Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/algorithmica/GanianNORR19
%A Ganian, Robert
%A Narayanaswamy, N. S.
%A Ordyniak, Sebastian
%A Rahul, C. S.
%A Ramanujan, M. S.
%D 2019
%J Algorithmica
%K dblp
%N 6
%P 2606-2632
%T On the Complexity Landscape of Connected f-Factor Problems.
%U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#GanianNORR19
%V 81
@article{journals/algorithmica/GanianNORR19,
added-at = {2023-09-28T00:00:00.000+0200},
author = {Ganian, Robert and Narayanaswamy, N. S. and Ordyniak, Sebastian and Rahul, C. S. and Ramanujan, M. S.},
biburl = {https://www.bibsonomy.org/bibtex/222605d692a29e5e8b207a193f0e9a660/dblp},
ee = {https://doi.org/10.1007/s00453-019-00546-z},
interhash = {0cb414f9c9f9801c593d2dce4e5d9a97},
intrahash = {22605d692a29e5e8b207a193f0e9a660},
journal = {Algorithmica},
keywords = {dblp},
number = 6,
pages = {2606-2632},
timestamp = {2024-04-08T18:21:26.000+0200},
title = {On the Complexity Landscape of Connected f-Factor Problems.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica81.html#GanianNORR19},
volume = 81,
year = 2019
}
