Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Pinar Heggernes
@article{DBLP:journals/algorithmica/BlairHLL22,
author = {Jean R. S. Blair and
Pinar Heggernes and
Paloma T. Lima and
Daniel Lokshtanov},
title = {On the Maximum Number of Edges in Chordal Graphs of Bounded Degree
and Matching Number},
journal = {Algorithmica},
volume = {84},
number = {12},
pages = {3587--3602},
year = {2022},
url = {https://doi.org/10.1007/s00453-022-00953-9},
doi = {10.1007/S00453-022-00953-9},
timestamp = {Fri, 09 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlairHLL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rairo/SekerHET22,
author = {Oylum Seker and
Pinar Heggernes and
T{\'{\i}}naz Ekim and
Z. Caner Taskin},
title = {Generation of random chordal graphs using subtrees of a tree},
journal = {{RAIRO} Oper. Res.},
volume = {56},
number = {2},
pages = {565--582},
year = {2022},
url = {https://doi.org/10.1051/ro/2022027},
doi = {10.1051/RO/2022027},
timestamp = {Wed, 14 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rairo/SekerHET22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKLP20,
author = {Petr A. Golovach and
Pinar Heggernes and
Athanasios L. Konstantinidis and
Paloma T. Lima and
Charis Papadopoulos},
title = {Parameterized Aspects of Strong Subgraph Closure},
journal = {Algorithmica},
volume = {82},
number = {7},
pages = {2006--2038},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00684-9},
doi = {10.1007/S00453-020-00684-9},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachHKS20,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Reza Saei},
title = {Enumeration of minimal connected dominating sets for chordal graphs},
journal = {Discret. Appl. Math.},
volume = {278},
pages = {3--11},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.07.015},
doi = {10.1016/J.DAM.2019.07.015},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/GolovachHKS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Abu-KhzamFH20,
author = {Faisal N. Abu{-}Khzam and
Carl Feghali and
Pinar Heggernes},
title = {Partitioning a graph into degenerate subgraphs},
journal = {Eur. J. Comb.},
volume = {83},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2019.103015},
doi = {10.1016/J.EJC.2019.103015},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Abu-KhzamFH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GolovachHLM20,
author = {Petr A. Golovach and
Pinar Heggernes and
Paloma T. Lima and
Pedro Montealegre},
title = {Finding connected secluded subgraphs},
journal = {J. Comput. Syst. Sci.},
volume = {113},
pages = {101--124},
year = {2020},
url = {https://doi.org/10.1016/j.jcss.2020.05.006},
doi = {10.1016/J.JCSS.2020.05.006},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/GolovachHLM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BlairHLL20,
author = {Jean R. S. Blair and
Pinar Heggernes and
Paloma T. Lima and
Daniel Lokshtanov},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {On the Maximum Number of Edges in Chordal Graphs of Bounded Degree
and Matching Number},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {600--612},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_47},
doi = {10.1007/978-3-030-61792-9\_47},
timestamp = {Thu, 03 Dec 2020 14:27:45 +0100},
biburl = {https://dblp.org/rec/conf/latin/BlairHLL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKLP19,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth
at Most 2},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2795--2828},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00555-y},
doi = {10.1007/S00453-019-00555-Y},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKLP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/ciac/2019,
editor = {Pinar Heggernes},
title = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6},
doi = {10.1007/978-3-030-17402-6},
isbn = {978-3-030-17401-9},
timestamp = {Mon, 20 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2019,
editor = {Peter Rossmanith and
Pinar Heggernes and
Joost{-}Pieter Katoen},
title = {44th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
series = {LIPIcs},
volume = {138},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-117-7},
isbn = {978-3-95977-117-7},
timestamp = {Tue, 27 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/2019.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKKSV18,
author = {Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kant{\'{e}} and
Dieter Kratsch and
Sigve Hortemo S{\ae}ther and
Yngve Villanger},
title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear
MIM-Width},
journal = {Algorithmica},
volume = {80},
number = {2},
pages = {714--741},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0289-1},
doi = {10.1007/S00453-017-0289-1},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKKSV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GolovachHK18,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch},
title = {Enumeration and maximum number of minimal connected vertex covers
in graphs},
journal = {Eur. J. Comb.},
volume = {68},
pages = {132--147},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.07.015},
doi = {10.1016/J.EJC.2017.07.015},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GolovachHK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HeggernesILLL18,
author = {Pinar Heggernes and
Davis Issac and
Juho Lauri and
Paloma T. Lima and
Erik Jan van Leeuwen},
editor = {Igor Potapov and
Paul G. Spirakis and
James Worrell},
title = {Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2018, August 27-31, 2018, Liverpool, {UK}},
series = {LIPIcs},
volume = {117},
pages = {83:1--83:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2018.83},
doi = {10.4230/LIPICS.MFCS.2018.83},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/HeggernesILLL18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/GolovachHKLP18,
author = {Petr A. Golovach and
Pinar Heggernes and
Athanasios L. Konstantinidis and
Paloma T. Lima and
Charis Papadopoulos},
editor = {David Eppstein},
title = {Parameterized Aspects of Strong Subgraph Closure},
booktitle = {16th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT}
2018, June 18-20, 2018, Malm{\"{o}}, Sweden},
series = {LIPIcs},
volume = {101},
pages = {23:1--23:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SWAT.2018.23},
doi = {10.4230/LIPICS.SWAT.2018.23},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/GolovachHKLP18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-10386,
author = {Petr A. Golovach and
Pinar Heggernes and
Athanasios L. Konstantinidis and
Paloma T. Lima and
Charis Papadopoulos},
title = {Parameterized Aspects of Strong Subgraph Closure},
journal = {CoRR},
volume = {abs/1802.10386},
year = {2018},
url = {http://arxiv.org/abs/1802.10386},
eprinttype = {arXiv},
eprint = {1802.10386},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-10386.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-04388,
author = {Faisal N. Abu{-}Khzam and
Carl Feghali and
Pinar Heggernes},
title = {Partitioning a graph into degenerate subgraphs},
journal = {CoRR},
volume = {abs/1803.04388},
year = {2018},
url = {http://arxiv.org/abs/1803.04388},
eprinttype = {arXiv},
eprint = {1803.04388},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-04388.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-13326,
author = {Oylum Seker and
Pinar Heggernes and
T{\'{\i}}naz Ekim and
Z. Caner Taskin},
title = {Generation of random chordal graphs using subtrees of a tree},
journal = {CoRR},
volume = {abs/1810.13326},
year = {2018},
url = {http://arxiv.org/abs/1810.13326},
eprinttype = {arXiv},
eprint = {1810.13326},
timestamp = {Fri, 17 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-13326.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachHKKV17,
author = {Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kant{\'{e}} and
Dieter Kratsch and
Yngve Villanger},
title = {Minimal dominating sets in interval graphs and trees},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {162--170},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.01.038},
doi = {10.1016/J.DAM.2016.01.038},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachHKKV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachHLMSSS17,
author = {Petr A. Golovach and
Pinar Heggernes and
Nathan Lindzey and
Ross M. McConnell and
Vin{\'{\i}}cius Fernandes dos Santos and
Jeremy P. Spinrad and
Jayme Luiz Szwarcfiter},
title = {On recognition of threshold tolerance graphs and their complements},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {171--180},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.01.034},
doi = {10.1016/J.DAM.2015.01.034},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachHLMSSS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BresarHKMPPT17,
author = {Bostjan Bresar and
Pinar Heggernes and
Marcin Jakub Kaminski and
Martin Milanic and
Dani{\"{e}}l Paulusma and
Primoz Potocnik and
Nicolas Trotignon},
title = {Preface: Algorithmic Graph Theory on the Adriatic Coast},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {1--3},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.05.007},
doi = {10.1016/J.DAM.2017.05.007},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BresarHKMPPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DibekEH17,
author = {Cemil Dibek and
T{\'{\i}}naz Ekim and
Pinar Heggernes},
title = {Maximum number of edges in claw-free graphs whose maximum degree and
matching number are bounded},
journal = {Discret. Math.},
volume = {340},
number = {5},
pages = {927--934},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2017.01.010},
doi = {10.1016/J.DISC.2017.01.010},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DibekEH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JaffkeBHT17,
author = {Lars Jaffke and
Hans L. Bodlaender and
Pinar Heggernes and
Jan Arne Telle},
title = {Definability equals recognizability for k-outerplanar graphs and l-chordal
partial k-trees},
journal = {Eur. J. Comb.},
volume = {66},
pages = {191--234},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.06.025},
doi = {10.1016/J.EJC.2017.06.025},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/JaffkeBHT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/SekerHET17,
author = {Oylum Seker and
Pinar Heggernes and
T{\'{\i}}naz Ekim and
Z. Caner Taskin},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Linear-Time Generation of Random Chordal Graphs},
booktitle = {Algorithms and Complexity - 10th International Conference, {CIAC}
2017, Athens, Greece, May 24-26, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10236},
pages = {442--453},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_37},
doi = {10.1007/978-3-319-57586-5\_37},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/SekerHET17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GolovachHLM17,
author = {Petr A. Golovach and
Pinar Heggernes and
Paloma T. Lima and
Pedro Montealegre},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Finding Connected Secluded Subgraphs},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {18:1--18:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.18},
doi = {10.4230/LIPICS.IPEC.2017.18},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GolovachHLM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachHKLP17,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth
at Most 2},
booktitle = {Graph-Theoretic Concepts in Computer Science - 43rd International
Workshop, {WG} 2017, Eindhoven, The Netherlands, June 21-23, 2017,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {10520},
pages = {275--288},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6\_21},
doi = {10.1007/978-3-319-68705-6\_21},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachHKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachHKLP17,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Paloma T. Lima and
Dani{\"{e}}l Paulusma},
title = {Algorithms for outerplanar graph roots and graph roots of pathwidth
at most 2},
journal = {CoRR},
volume = {abs/1703.05102},
year = {2017},
url = {http://arxiv.org/abs/1703.05102},
eprinttype = {arXiv},
eprint = {1703.05102},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachHKLP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-10979,
author = {Petr A. Golovach and
Pinar Heggernes and
Paloma T. Lima and
Pedro Montealegre},
title = {Finding Connected Secluded Subgraphs},
journal = {CoRR},
volume = {abs/1710.10979},
year = {2017},
url = {http://arxiv.org/abs/1710.10979},
eprinttype = {arXiv},
eprint = {1710.10979},
timestamp = {Tue, 29 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1710-10979.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganH16,
author = {Marek Cygan and
Pinar Heggernes},
title = {Foreword: Special Issue on {IPEC} 2014},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {255--256},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0151-x},
doi = {10.1007/S00453-016-0151-X},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CyganH16a,
author = {Marek Cygan and
Pinar Heggernes},
title = {Erratum to: Foreword: Special Issue on {IPEC} 2014},
journal = {Algorithmica},
volume = {75},
number = {2},
pages = {257},
year = {2016},
url = {https://doi.org/10.1007/s00453-016-0161-8},
doi = {10.1007/S00453-016-0161-8},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/CyganH16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesPT16,
author = {Pinar Heggernes and
Andrzej Proskurowski and
Dimitrios M. Thilikos},
title = {Foreword: Sixth Workshop on Graph Classes, Optimization, and Width
Parameters, Santorini, Greece, October 2013},
journal = {Discret. Appl. Math.},
volume = {199},
pages = {1--2},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.10.004},
doi = {10.1016/J.DAM.2015.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesPT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachHKKV16,
author = {Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kant{\'{e}} and
Dieter Kratsch and
Yngve Villanger},
title = {Enumerating minimal dominating sets in chordal bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {199},
pages = {30--36},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2014.12.010},
doi = {10.1016/J.DAM.2014.12.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachHKKV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesMPR16,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos and
Udi Rotics},
title = {Clique-width of path powers},
journal = {Discret. Appl. Math.},
volume = {205},
pages = {62--72},
year = {2016},
url = {https://doi.org/10.1016/j.dam.2015.11.009},
doi = {10.1016/J.DAM.2015.11.009},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HeggernesMPR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Abu-KhzamH16,
author = {Faisal N. Abu{-}Khzam and
Pinar Heggernes},
title = {Enumerating minimal dominating sets in chordal graphs},
journal = {Inf. Process. Lett.},
volume = {116},
number = {12},
pages = {739--743},
year = {2016},
url = {https://doi.org/10.1016/j.ipl.2016.07.002},
doi = {10.1016/J.IPL.2016.07.002},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Abu-KhzamH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BasavarajuHHSV16,
author = {Manu Basavaraju and
Pinar Heggernes and
Pim van 't Hof and
Reza Saei and
Yngve Villanger},
title = {Maximal Induced Matchings in Triangle-Free Graphs},
journal = {J. Graph Theory},
volume = {83},
number = {3},
pages = {231--250},
year = {2016},
url = {https://doi.org/10.1002/jgt.21994},
doi = {10.1002/JGT.21994},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BasavarajuHHSV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FominHL16,
author = {Fedor V. Fomin and
Pinar Heggernes and
Erik Jan van Leeuwen},
title = {The Firefighter problem on graph classes},
journal = {Theor. Comput. Sci.},
volume = {613},
pages = {38--50},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2015.11.024},
doi = {10.1016/J.TCS.2015.11.024},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FominHL16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachHK16,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch},
title = {Enumerating minimal connected dominating sets in graphs of bounded
chordality},
journal = {Theor. Comput. Sci.},
volume = {630},
pages = {63--75},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.03.026},
doi = {10.1016/J.TCS.2016.03.026},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2016,
editor = {Pinar Heggernes},
title = {Graph-Theoretic Concepts in Computer Science - 42nd International
Workshop, {WG} 2016, Istanbul, Turkey, June 22-24, 2016, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {9941},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-53536-3},
doi = {10.1007/978-3-662-53536-3},
isbn = {978-3-662-53535-6},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachHK16,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch},
title = {Enumeration and Maximum Number of Minimal Connected Vertex Covers
in Graphs},
journal = {CoRR},
volume = {abs/1602.07504},
year = {2016},
url = {http://arxiv.org/abs/1602.07504},
eprinttype = {arXiv},
eprint = {1602.07504},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachHK16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHHMPP15,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Fredrik Manne and
Dani{\"{e}}l Paulusma and
Michal Pilipczuk},
title = {Modifying a Graph Using Vertex Elimination},
journal = {Algorithmica},
volume = {72},
number = {1},
pages = {99--125},
year = {2015},
url = {https://doi.org/10.1007/s00453-013-9848-2},
doi = {10.1007/S00453-013-9848-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHHMPP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeggernesHMMV15,
author = {Pinar Heggernes and
Pim van 't Hof and
D{\'{a}}niel Marx and
Neeldhara Misra and
Yngve Villanger},
title = {On the Parameterized Complexity of Finding Separators with Non-Hereditary
Properties},
journal = {Algorithmica},
volume = {72},
number = {3},
pages = {687--713},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9868-6},
doi = {10.1007/S00453-014-9868-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeggernesHMMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GolovachHKV15,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Yngve Villanger},
title = {An Incremental Polynomial Time Algorithm to Enumerate All Minimal
Edge Dominating Sets},
journal = {Algorithmica},
volume = {72},
number = {3},
pages = {836--859},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9875-7},
doi = {10.1007/S00453-014-9875-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GolovachHKV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CourcelleHMPR15,
author = {Bruno Courcelle and
Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos and
Udi Rotics},
title = {A characterisation of clique-width through nested partitions},
journal = {Discret. Appl. Math.},
volume = {187},
pages = {70--81},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.02.016},
doi = {10.1016/J.DAM.2015.02.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CourcelleHMPR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BodlaenderHT15,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Jan Arne Telle},
title = {Recognizability Equals Definability for Graphs of Bounded Treewidth
and Bounded Chordality},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {559--568},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.076},
doi = {10.1016/J.ENDM.2015.06.076},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BodlaenderHT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/FernauHHMS15,
author = {Henning Fernau and
Pinar Heggernes and
Pim van 't Hof and
Daniel Meister and
Reza Saei},
title = {Computing the metric dimension for chain graphs},
journal = {Inf. Process. Lett.},
volume = {115},
number = {9},
pages = {671--676},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.04.006},
doi = {10.1016/J.IPL.2015.04.006},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/FernauHHMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FernauHV15,
author = {Henning Fernau and
Pinar Heggernes and
Yngve Villanger},
title = {A multi-parameter analysis of hard problems on deterministic finite
automata},
journal = {J. Comput. Syst. Sci.},
volume = {81},
number = {4},
pages = {747--765},
year = {2015},
url = {https://doi.org/10.1016/j.jcss.2014.12.027},
doi = {10.1016/J.JCSS.2014.12.027},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/FernauHV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/HeggernesHLS15,
author = {Pinar Heggernes and
Pim van 't Hof and
Erik Jan van Leeuwen and
Reza Saei},
title = {Finding Disjoint Paths in Split Graphs},
journal = {Theory Comput. Syst.},
volume = {57},
number = {1},
pages = {140--159},
year = {2015},
url = {https://doi.org/10.1007/s00224-014-9580-6},
doi = {10.1007/S00224-014-9580-6},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/HeggernesHLS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GolovachHHP15,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Christophe Paul},
title = {Hadwiger Number of Graphs with Small Chordality},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {3},
pages = {1427--1451},
year = {2015},
url = {https://doi.org/10.1137/140975279},
doi = {10.1137/140975279},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GolovachHHP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesHMV15,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Meister and
Yngve Villanger},
title = {Induced Subgraph Isomorphism on proper interval and bipartite permutation
graphs},
journal = {Theor. Comput. Sci.},
volume = {562},
pages = {252--269},
year = {2015},
url = {https://doi.org/10.1016/j.tcs.2014.10.002},
doi = {10.1016/J.TCS.2014.10.002},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesHMV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolovachHKKSV15,
author = {Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kant{\'{e}} and
Dieter Kratsch and
Sigve Hortemo S{\ae}ther and
Yngve Villanger},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear
MIM-Width},
booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {248--258},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_22},
doi = {10.1007/978-3-662-48971-0\_22},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolovachHKKSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/GolovachHK15,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch},
editor = {Zsuzsanna Lipt{\'{a}}k and
William F. Smyth},
title = {Enumeration and Maximum Number of Minimal Connected Vertex Covers
in Graphs},
booktitle = {Combinatorial Algorithms - 26th International Workshop, {IWOCA} 2015,
Verona, Italy, October 5-7, 2015, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {9538},
pages = {235--247},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-29516-9\_20},
doi = {10.1007/978-3-319-29516-9\_20},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/GolovachHK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GolovachHK15,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Enumerating Minimal Connected Dominating Sets in Graphs of Bounded
Chordality},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {307--318},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.307},
doi = {10.4230/LIPICS.IPEC.2015.307},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/GolovachHK15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachHKKSV15,
author = {Petr A. Golovach and
Pinar Heggernes and
Mamadou Moustapha Kant{\'{e}} and
Dieter Kratsch and
Sigve Hortemo S{\ae}ther and
Yngve Villanger},
title = {Output-Polynomial Enumeration on Graphs of Bounded (Local) Linear
MIM-Width},
journal = {CoRR},
volume = {abs/1509.03753},
year = {2015},
url = {http://arxiv.org/abs/1509.03753},
eprinttype = {arXiv},
eprint = {1509.03753},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachHKKSV15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HeggernesHLLP14,
author = {Pinar Heggernes and
Pim van 't Hof and
Benjamin L{\'{e}}v{\^{e}}que and
Daniel Lokshtanov and
Christophe Paul},
title = {Contracting Graphs to Paths and Trees},
journal = {Algorithmica},
volume = {68},
number = {1},
pages = {109--132},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9670-2},
doi = {10.1007/S00453-012-9670-2},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HeggernesHLLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominHKPV14,
author = {Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch and
Charis Papadopoulos and
Yngve Villanger},
title = {Enumerating Minimal Subset Feedback Vertex Sets},
journal = {Algorithmica},
volume = {69},
number = {1},
pages = {216--231},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9731-6},
doi = {10.1007/S00453-012-9731-6},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominHKPV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteGHHKP14,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting Fixed Patterns in Chordal Graphs in Polynomial Time},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {501--521},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9748-5},
doi = {10.1007/S00453-013-9748-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteGHHKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesHLP14,
author = {Pinar Heggernes and
Pim van 't Hof and
Benjamin L{\'{e}}v{\^{e}}que and
Christophe Paul},
title = {Contracting chordal graphs and bipartite graphs to paths and trees},
journal = {Discret. Appl. Math.},
volume = {164},
pages = {444--449},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.02.025},
doi = {10.1016/J.DAM.2013.02.025},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HeggernesHLP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesKO14,
author = {Pinar Heggernes and
Jan Kratochv{\'{\i}}l and
Sang{-}il Oum},
title = {Guest editors' foreword},
journal = {Discret. Appl. Math.},
volume = {168},
pages = {1--2},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2013.12.012},
doi = {10.1016/J.DAM.2013.12.012},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesKO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHHRS14,
author = {R{\'{e}}my Belmonte and
Pinar Heggernes and
Pim van 't Hof and
Arash Rafiey and
Reza Saei},
title = {Graph classes and Ramsey numbers},
journal = {Discret. Appl. Math.},
volume = {173},
pages = {16--27},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.03.016},
doi = {10.1016/J.DAM.2014.03.016},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHHRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachHKR14,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Arash Rafiey},
title = {Finding clubs in graph classes},
journal = {Discret. Appl. Math.},
volume = {174},
pages = {57--65},
year = {2014},
url = {https://doi.org/10.1016/j.dam.2014.04.016},
doi = {10.1016/J.DAM.2014.04.016},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachHKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/GolovachHKS14,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Reza Saei},
title = {Subset feedback vertex sets in chordal graphs},
journal = {J. Discrete Algorithms},
volume = {26},
pages = {7--15},
year = {2014},
url = {https://doi.org/10.1016/j.jda.2013.09.005},
doi = {10.1016/J.JDA.2013.09.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/GolovachHKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/BorosHHM14,
author = {Endre Boros and
Pinar Heggernes and
Pim van 't Hof and
Martin Milanic},
title = {Vector connectivity in graphs},
journal = {Networks},
volume = {63},
number = {4},
pages = {277--285},
year = {2014},
url = {https://doi.org/10.1002/net.21545},
doi = {10.1002/NET.21545},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/BorosHHM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BergerGHZ14,
author = {Andr{\'{e}} Berger and
Alexander Grigoriev and
Pinar Heggernes and
Ruben van der Zwaan},
title = {Scheduling unit-length jobs with precedence constraints of small height},
journal = {Oper. Res. Lett.},
volume = {42},
number = {2},
pages = {166--172},
year = {2014},
url = {https://doi.org/10.1016/j.orl.2014.01.008},
doi = {10.1016/J.ORL.2014.01.008},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/BergerGHZ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HeggernesHLS14,
author = {Pinar Heggernes and
Pim van 't Hof and
Erik Jan van Leeuwen and
Reza Saei},
editor = {Viliam Geffert and
Bart Preneel and
Branislav Rovan and
Julius Stuller and
A Min Tjoa},
title = {Finding Disjoint Paths in Split Graphs},
booktitle = {{SOFSEM} 2014: Theory and Practice of Computer Science - 40th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 26-29, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8327},
pages = {315--326},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-04298-5\_28},
doi = {10.1007/978-3-319-04298-5\_28},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HeggernesHLS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BasavarajuHHSV14,
author = {Manu Basavaraju and
Pinar Heggernes and
Pim van 't Hof and
Reza Saei and
Yngve Villanger},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Maximal Induced Matchings in Triangle-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {93--104},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_8},
doi = {10.1007/978-3-319-12340-0\_8},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BasavarajuHHSV14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachHHP14,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Christophe Paul},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Hadwiger Number of Graphs with Small Chordality},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {201--213},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_17},
doi = {10.1007/978-3-319-12340-0\_17},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachHHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachHLMSS14,
author = {Petr A. Golovach and
Pinar Heggernes and
Nathan Lindzey and
Ross M. McConnell and
Vin{\'{\i}}cius Fernandes dos Santos and
Jeremy P. Spinrad},
editor = {Dieter Kratsch and
Ioan Todinca},
title = {Recognizing Threshold Tolerance Graphs in O(n\({}^{\mbox{2}}\)) Time},
booktitle = {Graph-Theoretic Concepts in Computer Science - 40th International
Workshop, {WG} 2014, Nouan-le-Fuzelier, France, June 25-27, 2014.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8747},
pages = {214--224},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-12340-0\_18},
doi = {10.1007/978-3-319-12340-0\_18},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/GolovachHLMSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2014,
editor = {Marek Cygan and
Pinar Heggernes},
title = {Parameterized and Exact Computation - 9th International Symposium,
{IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {8894},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3},
doi = {10.1007/978-3-319-13524-3},
isbn = {978-3-319-13523-6},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2014.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachHHP14,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Christophe Paul},
title = {Hadwiger number of graphs with small chordality},
journal = {CoRR},
volume = {abs/1406.3812},
year = {2014},
url = {http://arxiv.org/abs/1406.3812},
eprinttype = {arXiv},
eprint = {1406.3812},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachHHP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BodlaenderHL14,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Daniel Lokshtanov},
title = {Graph Modification Problems (Dagstuhl Seminar 14071)},
journal = {Dagstuhl Reports},
volume = {4},
number = {2},
pages = {38--59},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.2.38},
doi = {10.4230/DAGREP.4.2.38},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BodlaenderHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/EkimHM13,
author = {T{\'{\i}}naz Ekim and
Pinar Heggernes and
Daniel Meister},
title = {Polar permutation graphs are polynomial-time recognisable},
journal = {Eur. J. Comb.},
volume = {34},
number = {3},
pages = {576--592},
year = {2013},
url = {https://doi.org/10.1016/j.ejc.2011.12.007},
doi = {10.1016/J.EJC.2011.12.007},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/EkimHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/HeggernesKLRS13,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
title = {Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle
Stabbing via iterative localization},
journal = {Inf. Comput.},
volume = {231},
pages = {109--116},
year = {2013},
url = {https://doi.org/10.1016/j.ic.2013.08.007},
doi = {10.1016/J.IC.2013.08.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HeggernesKLRS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GolovachHHP13,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Choosability on H-free graphs},
journal = {Inf. Process. Lett.},
volume = {113},
number = {4},
pages = {107--110},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2012.12.003},
doi = {10.1016/J.IPL.2012.12.003},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GolovachHHP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeggernesHLP13,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Christophe Paul},
title = {Obtaining a Bipartite Graph by Contracting Few Edges},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {2143--2156},
year = {2013},
url = {https://doi.org/10.1137/130907392},
doi = {10.1137/130907392},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeggernesHLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/CouturierHHK13,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Pinar Heggernes and
Pim van 't Hof and
Dieter Kratsch},
title = {Minimal dominating sets in graph classes: Combinatorial bounds and
enumeration},
journal = {Theor. Comput. Sci.},
volume = {487},
pages = {82--94},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.03.026},
doi = {10.1016/J.TCS.2013.03.026},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/CouturierHHK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesHJKV13,
author = {Pinar Heggernes and
Pim van 't Hof and
Bart M. P. Jansen and
Stefan Kratsch and
Yngve Villanger},
title = {Parameterized complexity of vertex deletion into perfect graph classes},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {172--180},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.03.013},
doi = {10.1016/J.TCS.2012.03.013},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesHJKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/GolovachHKR13,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Arash Rafiey},
editor = {Paul G. Spirakis and
Maria J. Serna},
title = {Cliques and Clubs},
booktitle = {Algorithms and Complexity, 8th International Conference, {CIAC} 2013,
Barcelona, Spain, May 22-24, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7878},
pages = {276--287},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38233-8\_23},
doi = {10.1007/978-3-642-38233-8\_23},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/GolovachHKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GolovachHKV13,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Yngve Villanger},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {An Incremental Polynomial Time Algorithm to Enumerate All Minimal
Edge Dominating Sets},
booktitle = {Automata, Languages, and Programming - 40th International Colloquium,
{ICALP} 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {7965},
pages = {485--496},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_41},
doi = {10.1007/978-3-642-39206-1\_41},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/GolovachHKV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/HeggernesHM13,
author = {Pinar Heggernes and
Pim van 't Hof and
Martin Milanic},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {Induced Subtrees in Interval Graphs},
booktitle = {Combinatorial Algorithms - 24th International Workshop, {IWOCA} 2013,
Rouen, France, July 10-12, 2013, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8288},
pages = {230--243},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_20},
doi = {10.1007/978-3-642-45278-9\_20},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/HeggernesHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/FernauHV13,
author = {Henning Fernau and
Pinar Heggernes and
Yngve Villanger},
editor = {Adrian{-}Horia Dediu and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {A Multivariate Analysis of Some {DFA} Problems},
booktitle = {Language and Automata Theory and Applications - 7th International
Conference, {LATA} 2013, Bilbao, Spain, April 2-5, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7810},
pages = {275--286},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-37064-9\_25},
doi = {10.1007/978-3-642-37064-9\_25},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lata/FernauHV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BorosHHM13,
author = {Endre Boros and
Pinar Heggernes and
Pim van 't Hof and
Martin Milanic},
editor = {T.{-}H. Hubert Chan and
Lap Chi Lau and
Luca Trevisan},
title = {Vector Connectivity in Graphs},
booktitle = {Theory and Applications of Models of Computation, 10th International
Conference, {TAMC} 2013, Hong Kong, China, May 20-22, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7876},
pages = {331--342},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-38236-9\_30},
doi = {10.1007/978-3-642-38236-9\_30},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BorosHHM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BasavarajuHHSV13,
author = {Manu Basavaraju and
Pinar Heggernes and
Pim van 't Hof and
Reza Saei and
Yngve Villanger},
title = {Maximal induced matchings in triangle-free graphs},
journal = {CoRR},
volume = {abs/1312.5180},
year = {2013},
url = {http://arxiv.org/abs/1312.5180},
eprinttype = {arXiv},
eprint = {1312.5180},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/BasavarajuHHSV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesKP12,
author = {Pinar Heggernes and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
title = {Guest editors' foreword},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {683--684},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.01.001},
doi = {10.1016/J.DAM.2012.01.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachHM12,
author = {Petr A. Golovach and
Pinar Heggernes and
Rodica Mihai},
title = {Edge search number of cographs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {734--743},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.04.020},
doi = {10.1016/J.DAM.2011.04.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesMP12,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos},
title = {Characterising the linear clique-width of a class of graphs by forbidden
induced subgraphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {888--901},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.03.018},
doi = {10.1016/J.DAM.2011.03.018},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HeggernesMP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHH12,
author = {R{\'{e}}my Belmonte and
Pinar Heggernes and
Pim van 't Hof},
title = {Edge contractions in subclasses of chordal graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {7-8},
pages = {999--1010},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.12.012},
doi = {10.1016/J.DAM.2011.12.012},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HeggernesHP12,
author = {Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
title = {Computing role assignments of proper interval graphs in polynomial
time},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {173--188},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.004},
doi = {10.1016/J.JDA.2011.12.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HeggernesHP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeggernesHLN12,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Jesper Nederlof},
title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {3},
pages = {1008--1021},
year = {2012},
url = {https://doi.org/10.1137/110830514},
doi = {10.1137/110830514},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeggernesHLN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/CouturierHHV12,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Pinar Heggernes and
Pim van 't Hof and
Yngve Villanger},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and
Cographs},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {133--144},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_12},
doi = {10.1007/978-3-642-32241-9\_12},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/CouturierHHV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BelmonteHHS12,
author = {R{\'{e}}my Belmonte and
Pinar Heggernes and
Pim van 't Hof and
Reza Saei},
editor = {Joachim Gudmundsson and
Juli{\'{a}}n Mestre and
Taso Viglas},
title = {Ramsey Numbers for Line Graphs and Perfect Graphs},
booktitle = {Computing and Combinatorics - 18th Annual International Conference,
{COCOON} 2012, Sydney, Australia, August 20-22, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7434},
pages = {204--215},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32241-9\_18},
doi = {10.1007/978-3-642-32241-9\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BelmonteHHS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/HeggernesS12,
author = {Pinar Heggernes and
Sigve Hortemo S{\ae}ther},
editor = {Edward A. Hirsch and
Juhani Karhum{\"{a}}ki and
Arto Lepist{\"{o}} and
Michail Kh. Prilutskii},
title = {Broadcast Domination on Block Graphs in Linear Time},
booktitle = {Computer Science - Theory and Applications - 7th International Computer
Science Symposium in Russia, {CSR} 2012, Nizhny Novgorod, Russia,
July 3-7, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7353},
pages = {172--183},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30642-6\_17},
doi = {10.1007/978-3-642-30642-6\_17},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/HeggernesS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/FominHL12,
author = {Fedor V. Fomin and
Pinar Heggernes and
Erik Jan van Leeuwen},
editor = {Evangelos Kranakis and
Danny Krizanc and
Flaminia L. Luccio},
title = {Making Life Easier for Firefighters},
booktitle = {Fun with Algorithms - 6th International Conference, {FUN} 2012, Venice,
Italy, June 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7288},
pages = {177--188},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30347-0\_19},
doi = {10.1007/978-3-642-30347-0\_19},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fun/FominHL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GolovachHKS12,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Reza Saei},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {An Exact Algorithm for Subset Feedback Vertex Set on Chordal Graphs},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {85--96},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_10},
doi = {10.1007/978-3-642-33293-7\_10},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GolovachHKS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/EkimEHHM12,
author = {T{\'{\i}}naz Ekim and
Aysel Erey and
Pinar Heggernes and
Pim van 't Hof and
Daniel Meister},
editor = {David Fern{\'{a}}ndez{-}Baca},
title = {Computing Minimum Geodetic Sets of Proper Interval Graphs},
booktitle = {{LATIN} 2012: Theoretical Informatics - 10th Latin American Symposium,
Arequipa, Peru, April 16-20, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7256},
pages = {279--290},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-29344-3\_24},
doi = {10.1007/978-3-642-29344-3\_24},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/EkimEHHM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/CouturierHHK12,
author = {Jean{-}Fran{\c{c}}ois Couturier and
Pinar Heggernes and
Pim van 't Hof and
Dieter Kratsch},
editor = {M{\'{a}}ria Bielikov{\'{a}} and
Gerhard Friedrich and
Georg Gottlob and
Stefan Katzenbeisser and
Gy{\"{o}}rgy Tur{\'{a}}n},
title = {Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and
Enumeration},
booktitle = {{SOFSEM} 2012: Theory and Practice of Computer Science - 38th Conference
on Current Trends in Theory and Practice of Computer Science, {\v{S}}pindler{\r{u}}v
Ml{\'{y}}n, Czech Republic, January 21-27, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7147},
pages = {202--213},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-27660-6\_17},
doi = {10.1007/978-3-642-27660-6\_17},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/CouturierHHK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachHHMPP12,
author = {Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Fredrik Manne and
Dani{\"{e}}l Paulusma and
Michal Pilipczuk},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {How to Eliminate a Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {320--331},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_32},
doi = {10.1007/978-3-642-34611-8\_32},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/GolovachHHMPP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesHMMV12,
author = {Pinar Heggernes and
Pim van 't Hof and
D{\'{a}}niel Marx and
Neeldhara Misra and
Yngve Villanger},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {On the Parameterized Complexity of Finding Separators with Non-Hereditary
Properties},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {332--343},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_33},
doi = {10.1007/978-3-642-34611-8\_33},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HeggernesHMMV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1208-5345,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Yngve Villanger},
title = {Generating All Minimal Edge Dominating Sets with Incremental-Polynomial
Delay},
journal = {CoRR},
volume = {abs/1208.5345},
year = {2012},
url = {http://arxiv.org/abs/1208.5345},
eprinttype = {arXiv},
eprint = {1208.5345},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1208-5345.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHV11,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Yngve Villanger},
title = {Faster Parameterized Algorithms for Minimum Fill-in},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {817--838},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9421-1},
doi = {10.1007/S00453-010-9421-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HeggernesHLP11,
author = {Pinar Heggernes and
Pim van 't Hof and
Benjamin L{\'{e}}v{\^{e}}que and
Christophe Paul},
title = {Contracting chordal graphs and bipartite graphs to paths and trees},
journal = {Electron. Notes Discret. Math.},
volume = {37},
pages = {87--92},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.05.016},
doi = {10.1016/J.ENDM.2011.05.016},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/HeggernesHLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/HeggernesMPS11,
author = {Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos and
R. Sritharan},
title = {Strongly chordal and chordal bipartite graphs are sandwich monotone},
journal = {J. Comb. Optim.},
volume = {22},
number = {3},
pages = {438--456},
year = {2011},
url = {https://doi.org/10.1007/s10878-010-9322-x},
doi = {10.1007/S10878-010-9322-X},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/HeggernesMPS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeggernesLMP11,
author = {Pinar Heggernes and
Daniel Lokshtanov and
Rodica Mihai and
Charis Papadopoulos},
title = {Cutwidth of Split Graphs and Threshold Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {25},
number = {3},
pages = {1418--1437},
year = {2011},
url = {https://doi.org/10.1137/080741197},
doi = {10.1137/080741197},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeggernesLMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesMP11,
author = {Pinar Heggernes and
Daniel Meister and
Andrzej Proskurowski},
title = {Computing minimum distortion embeddings into a path for bipartite
permutation graphs and threshold graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {12-14},
pages = {1275--1297},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.01.005},
doi = {10.1016/J.TCS.2011.01.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesMP11a,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos},
title = {Graphs of linear clique-width at most 3},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5466--5486},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.06.016},
doi = {10.1016/J.TCS.2011.06.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesMP11a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachHKLMS11,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Daniel Meister and
Saket Saurabh},
title = {Bandwidth on AT-free graphs},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {50},
pages = {7001--7008},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.09.011},
doi = {10.1016/J.TCS.2011.09.011},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachHKLMS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/Bui-XuanHMP11,
author = {Binh{-}Minh Bui{-}Xuan and
Pinar Heggernes and
Daniel Meister and
Andrzej Proskurowski},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {A Generic Approach to Decomposition Algorithms, with an Application
to Digraph Decomposition},
booktitle = {Computing and Combinatorics - 17th Annual International Conference,
{COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {331--342},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_30},
doi = {10.1007/978-3-642-22685-4\_30},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/Bui-XuanHMP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/HeggernesMR11,
author = {Pinar Heggernes and
Daniel Meister and
Udi Rotics},
editor = {Alexander S. Kulikov and
Nikolay K. Vereshchagin},
title = {Computing the Clique-Width of Large Path Powers in Linear Time via
a New Characterisation of Clique-Width},
booktitle = {Computer Science - Theory and Applications - 6th International Computer
Science Symposium in Russia, {CSR} 2011, St. Petersburg, Russia, June
14-18, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6651},
pages = {233--246},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20712-9\_18},
doi = {10.1007/978-3-642-20712-9\_18},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/csr/HeggernesMR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/HeggernesHJKV11,
author = {Pinar Heggernes and
Pim van 't Hof and
Bart M. P. Jansen and
Stefan Kratsch and
Yngve Villanger},
editor = {Olaf Owe and
Martin Steffen and
Jan Arne Telle},
title = {Parameterized Complexity of Vertex Deletion into Perfect Graph Classes},
booktitle = {Fundamentals of Computation Theory - 18th International Symposium,
{FCT} 2011, Oslo, Norway, August 22-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6914},
pages = {240--251},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22953-4\_21},
doi = {10.1007/978-3-642-22953-4\_21},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/HeggernesHJKV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HeggernesHLP11,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Christophe Paul},
editor = {Supratik Chakraborty and
Amit Kumar},
title = {Obtaining a Bipartite Graph by Contracting Few Edges},
booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
Theoretical Computer Science, {FSTTCS} 2011, December 12-14, 2011,
Mumbai, India},
series = {LIPIcs},
volume = {13},
pages = {217--228},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.217},
doi = {10.4230/LIPICS.FSTTCS.2011.217},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HeggernesHLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BelmonteGHHKP11,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Finding Contractions and Induced Minors in Chordal Graphs via Disjoint
Paths},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {110--119},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_13},
doi = {10.1007/978-3-642-25591-5\_13},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BelmonteGHHKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/HeggernesHLLP11,
author = {Pinar Heggernes and
Pim van 't Hof and
Benjamin L{\'{e}}v{\^{e}}que and
Daniel Lokshtanov and
Christophe Paul},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Contracting Graphs to Paths and Trees},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {55--66},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_5},
doi = {10.1007/978-3-642-28050-4\_5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/HeggernesHLLP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BelmonteHH11,
author = {R{\'{e}}my Belmonte and
Pinar Heggernes and
Pim van 't Hof},
editor = {Mitsunori Ogihara and
Jun Tarui},
title = {Edge Contractions in Subclasses of Chordal Graphs},
booktitle = {Theory and Applications of Models of Computation - 8th Annual Conference,
{TAMC} 2011, Tokyo, Japan, May 23-25, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6648},
pages = {528--539},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20877-5\_51},
doi = {10.1007/978-3-642-20877-5\_51},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BelmonteHH11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/FominHKPV11,
author = {Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch and
Charis Papadopoulos and
Yngve Villanger},
editor = {Frank Dehne and
John Iacono and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Enumerating Minimal Subset Feedback Vertex Sets},
booktitle = {Algorithms and Data Structures - 12th International Symposium, {WADS}
2011, New York, NY, USA, August 15-17, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6844},
pages = {399--410},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22300-6\_34},
doi = {10.1007/978-3-642-22300-6\_34},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/FominHKPV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-5441,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Christophe Paul},
title = {Obtaining a Bipartite Graph by Contracting Few Edges},
journal = {CoRR},
volume = {abs/1102.5441},
year = {2011},
url = {http://arxiv.org/abs/1102.5441},
eprinttype = {arXiv},
eprint = {1102.5441},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-5441.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1104-3677,
author = {Pinar Heggernes and
Pim van 't Hof and
Benjamin L{\'{e}}v{\^{e}}que and
Daniel Lokshtanov and
Christophe Paul},
title = {Contracting Graphs to Paths and Trees},
journal = {CoRR},
volume = {abs/1104.3677},
year = {2011},
url = {http://arxiv.org/abs/1104.3677},
eprinttype = {arXiv},
eprint = {1104.3677},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-3677.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BrandstadtGHM11,
author = {Andreas Brandst{\"{a}}dt and
Martin Charles Golumbic and
Pinar Heggernes and
Ross M. McConnell},
title = {Exploiting graph structure to cope with hard problems (Dagstuhl Seminar
11182)},
journal = {Dagstuhl Reports},
volume = {1},
number = {5},
pages = {29--46},
year = {2011},
url = {https://doi.org/10.4230/DagRep.1.5.29},
doi = {10.4230/DAGREP.1.5.29},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BrandstadtGHM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesKP10,
author = {Pinar Heggernes and
Jan Kratochv{\'{\i}}l and
Andrzej Proskurowski},
title = {Guest Editors' Foreword},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {729--730},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.01.003},
doi = {10.1016/J.DAM.2010.01.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesKP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HeggernesM10,
author = {Pinar Heggernes and
Daniel Meister},
title = {Hardness and approximation of minimum distortion embeddings},
journal = {Inf. Process. Lett.},
volume = {110},
number = {8-9},
pages = {312--316},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.02.009},
doi = {10.1016/J.IPL.2010.02.009},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HeggernesM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FominHM10,
author = {Fedor V. Fomin and
Pinar Heggernes and
Rodica Mihai},
title = {Mixed search number and linear-width of interval and split graphs},
journal = {Networks},
volume = {56},
number = {3},
pages = {207--214},
year = {2010},
url = {https://doi.org/10.1002/net.20373},
doi = {10.1002/NET.20373},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FominHM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderFHMPR10,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos and
Frances A. Rosamond},
title = {Clustering with partial information},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {7-9},
pages = {1202--1211},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.12.016},
doi = {10.1016/J.TCS.2009.12.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderFHMPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/HeggernesMNV10,
author = {Pinar Heggernes and
Federico Mancini and
Jesper Nederlof and
Yngve Villanger},
editor = {Tiziana Calamoneri and
Josep D{\'{\i}}az},
title = {A Parameterized Algorithm for Chordal Sandwich},
booktitle = {Algorithms and Complexity, 7th International Conference, {CIAC} 2010,
Rome, Italy, May 26-28, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6078},
pages = {120--130},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13073-1\_12},
doi = {10.1007/978-3-642-13073-1\_12},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/ciac/HeggernesMNV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HeggernesMV10,
author = {Pinar Heggernes and
Daniel Meister and
Yngve Villanger},
editor = {Otfried Cheong and
Kyung{-}Yong Chwa and
Kunsoo Park},
title = {Induced Subgraph Isomorphism on Interval and Proper Interval Graphs},
booktitle = {Algorithms and Computation - 21st International Symposium, {ISAAC}
2010, Jeju Island, Korea, December 15-17, 2010, Proceedings, Part
{II}},
series = {Lecture Notes in Computer Science},
volume = {6507},
pages = {399--409},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-17514-5\_34},
doi = {10.1007/978-3-642-17514-5\_34},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HeggernesMV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/HeggernesHP10,
author = {Pinar Heggernes and
Pim van 't Hof and
Dani{\"{e}}l Paulusma},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Computing Role Assignments of Proper Interval Graphs in Polynomial
Time},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {167--180},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_18},
doi = {10.1007/978-3-642-19222-7\_18},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/HeggernesHP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HeggernesKLRS10,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Venkatesh Raman and
Saket Saurabh},
editor = {Haim Kaplan},
title = {Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle
Stabbing},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {334--345},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_32},
doi = {10.1007/978-3-642-13731-0\_32},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HeggernesKLRS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/HeggernesMR10,
author = {Pinar Heggernes and
Daniel Meister and
Udi Rotics},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Exploiting Restricted Linear Structure to Cope with the Hardness of
Clique-Width},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {284--295},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_26},
doi = {10.1007/978-3-642-13562-0\_26},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/HeggernesMR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesHLN10,
author = {Pinar Heggernes and
Pim van 't Hof and
Daniel Lokshtanov and
Jesper Nederlof},
editor = {Dimitrios M. Thilikos},
title = {Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {75--87},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_9},
doi = {10.1007/978-3-642-16926-7\_9},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HeggernesHLN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesLNPT10,
author = {Pinar Heggernes and
Daniel Lokshtanov and
Jesper Nederlof and
Christophe Paul and
Jan Arne Telle},
editor = {Dimitrios M. Thilikos},
title = {Generalized Graph Clustering: Recognizing (\emph{p}, \emph{q})-Cluster
Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {171--183},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_17},
doi = {10.1007/978-3-642-16926-7\_17},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/HeggernesLNPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesM09,
author = {Pinar Heggernes and
Federico Mancini},
title = {Dynamically maintaining split graphs},
journal = {Discret. Appl. Math.},
volume = {157},
number = {9},
pages = {2057--2069},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.06.028},
doi = {10.1016/J.DAM.2008.06.028},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesM09a,
author = {Pinar Heggernes and
Federico Mancini},
title = {Minimal split completions},
journal = {Discret. Appl. Math.},
volume = {157},
number = {12},
pages = {2659--2669},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.08.010},
doi = {10.1016/J.DAM.2008.08.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HeggernesM09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HeggernesMP09,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos},
title = {A new representation of proper interval graphs with an application
to clique-width},
journal = {Electron. Notes Discret. Math.},
volume = {32},
pages = {27--34},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.02.005},
doi = {10.1016/J.ENDM.2009.02.005},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/HeggernesMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/HeggernesKM09,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Meister},
title = {Bandwidth of bipartite permutation graphs in polynomial time},
journal = {J. Discrete Algorithms},
volume = {7},
number = {4},
pages = {533--544},
year = {2009},
url = {https://doi.org/10.1016/j.jda.2008.11.001},
doi = {10.1016/J.JDA.2008.11.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/HeggernesKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/VillangerHPT09,
author = {Yngve Villanger and
Pinar Heggernes and
Christophe Paul and
Jan Arne Telle},
title = {Interval Completion Is Fixed Parameter Tractable},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {5},
pages = {2007--2020},
year = {2009},
url = {https://doi.org/10.1137/070710913},
doi = {10.1137/070710913},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/VillangerHPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HeggernesP09,
author = {Pinar Heggernes and
Charis Papadopoulos},
title = {Single-edge monotonic sequences of graphs and linear-time algorithms
for minimal completions and deletions},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {1},
pages = {1--15},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.07.020},
doi = {10.1016/J.TCS.2008.07.020},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/HeggernesP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HeggernesMPS09,
author = {Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos and
R. Sritharan},
editor = {Hung Q. Ngo},
title = {Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone},
booktitle = {Computing and Combinatorics, 15th Annual International Conference,
{COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5609},
pages = {398--407},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02882-3\_40},
doi = {10.1007/978-3-642-02882-3\_40},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HeggernesMPS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/HeggernesM09,
author = {Pinar Heggernes and
Rodica Mihai},
editor = {Xiaotie Deng and
John E. Hopcroft and
Jinyun Xue},
title = {Edge Search Number of Cographs in Linear Time},
booktitle = {Frontiers in Algorithmics, Third International Workshop, {FAW} 2009,
Hefei, China, June 20-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5598},
pages = {16--26},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02270-8\_5},
doi = {10.1007/978-3-642-02270-8\_5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/faw/HeggernesM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolovachHKLMS09,
author = {Petr A. Golovach and
Pinar Heggernes and
Dieter Kratsch and
Daniel Lokshtanov and
Daniel Meister and
Saket Saurabh},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Bandwidth on AT-Free Graphs},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {573--582},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_59},
doi = {10.1007/978-3-642-10631-6\_59},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolovachHKLMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/EkimHM09,
author = {T{\'{\i}}naz Ekim and
Pinar Heggernes and
Daniel Meister},
editor = {Jir{\'{\i}} Fiala and
Jan Kratochv{\'{\i}}l and
Mirka Miller},
title = {Polar Permutation Graphs},
booktitle = {Combinatorial Algorithms, 20th International Workshop, {IWOCA} 2009,
Hradec nad Moravic{\'{\i}}, Czech Republic, June 28-July 2, 2009,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {5874},
pages = {218--229},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10217-2\_23},
doi = {10.1007/978-3-642-10217-2\_23},
timestamp = {Fri, 17 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/EkimHM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovachH09,
author = {Petr A. Golovach and
Pinar Heggernes},
editor = {Rastislav Kr{\'{a}}lovic and
Damian Niwinski},
title = {Choosability of P5-Free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August
24-28, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5734},
pages = {382--391},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03816-7\_33},
doi = {10.1007/978-3-642-03816-7\_33},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovachH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/HeggernesMP09,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos},
editor = {Jianer Chen and
S. Barry Cooper},
title = {A Complete Characterisation of the Linear Clique-Width of Path Powers},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {241--250},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_27},
doi = {10.1007/978-3-642-02017-9\_27},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/HeggernesMP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HeggernesMP08,
author = {Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos},
title = {Minimal comparability completions of arbitrary graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {5},
pages = {705--718},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.08.039},
doi = {10.1016/J.DAM.2007.08.039},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HeggernesMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/HeggernesP08,
author = {Pinar Heggernes and
Barry W. Peyton},
title = {Fast Computation of Minimal Fill Inside {A} Given Elimination Ordering},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {30},
number = {4},
pages = {1424--1444},
year = {2008},
url = {https://doi.org/10.1137/070680680},
doi = {10.1137/070680680},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/HeggernesP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BerryDHS08,
author = {Anne Berry and
Elias Dahlhaus and
Pinar Heggernes and
Genevi{\`{e}}ve Simonet},
title = {Sequential and parallel triangulating algorithms for Elimination Game
and new insights on Minimum Degree},
journal = {Theor. Comput. Sci.},
volume = {409},
number = {3},
pages = {601--616},
year = {2008},
url = {https://doi.org/10.1016/j.tcs.2008.09.059},
doi = {10.1016/J.TCS.2008.09.059},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BerryDHS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/faw/HeggernesM08,
author = {Pinar Heggernes and
Rodica Mihai},
editor = {Franco P. Preparata and
Xiaodong Wu and
Jianping Yin},
title = {Mixed Search Number of Permutation Graphs},
booktitle = {Frontiers in Algorithmics, Second Annual International Workshop, {FAW}
2008, Changsha, China, June 19-21, 2008, Proceeedings},
series = {Lecture Notes in Computer Science},
volume = {5059},
pages = {196--207},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69311-6\_22},
doi = {10.1007/978-3-540-69311-6\_22},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/faw/HeggernesM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BodlaenderHV08,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Yngve Villanger},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Faster Parameterized Algorithms for Minimum Fill-In},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {282--293},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_27},
doi = {10.1007/978-3-540-92182-0\_27},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BodlaenderHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/HeggernesKM08,
author = {Pinar Heggernes and
Dieter Kratsch and
Daniel Meister},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Bandwidth of Bipartite Permutation Graphs in Polynomial Time},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {216--227},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_19},
doi = {10.1007/978-3-540-78773-0\_19},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/HeggernesKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodlaenderFHMPR08,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos and
Frances A. Rosamond},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Clustering with Partial Information},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {144--155},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_11},
doi = {10.1007/978-3-540-85238-4\_11},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderFHMPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/HeggernesMP08,
author = {Pinar Heggernes and
Daniel Meister and
Andrzej Proskurowski},
editor = {Joachim Gudmundsson},
title = {Minimum Distortion Embeddings into a Path of Bipartite Permutation
and Threshold Graphs},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {331--342},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_30},
doi = {10.1007/978-3-540-69903-3\_30},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/HeggernesMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/HeggernesMP08,
author = {Pinar Heggernes and
Daniel Meister and
Charis Papadopoulos},
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {Graphs of Linear Clique-Width at Most 3},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
pages = {330--341},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4\_29},
doi = {10.1007/978-3-540-79228-4\_29},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/HeggernesMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesLMP08,
author = {Pinar Heggernes and
Daniel Lokshtanov and
Rodica Mihai and
Charis Papadopoulos},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 34th International Workshop,
{WG} 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5344},
pages = {218--229},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_20},
doi = {10.1007/978-3-540-92248-3\_20},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HeggernesLMP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/FominHK07,
author = {Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch},
title = {Exact Algorithms for Graph Homomorphisms},
journal = {Theory Comput. Syst.},
volume = {41},
number = {2},
pages = {381--393},
year = {2007},
url = {https://doi.org/10.1007/s00224-007-2007-x},
doi = {10.1007/S00224-007-2007-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/FominHK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/HeggernesK07,
author = {Pinar Heggernes and
Dieter Kratsch},
title = {Linear-time certifying recognition algorithms and forbidden induced
subgraphs},
journal = {Nord. J. Comput.},
volume = {14},
number = {1-2},
pages = {87--108},
year = {2007},
timestamp = {Mon, 28 Feb 2011 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/HeggernesK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HeggernesP07,
author = {Pinar Heggernes and
Charis Papadopoulos},
editor = {Guohui Lin},
title = {Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms
for Minimal Completions and Deletions},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {406--416},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_40},
doi = {10.1007/978-3-540-73545-8\_40},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HeggernesP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/HeggernesSTV07,
author = {Pinar Heggernes and
Karol Suchan and
Ioan Todinca and
Yngve Villanger},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {Characterizing Minimal Interval Completions},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {236--247},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_21},
doi = {10.1007/978-3-540-70918-3\_21},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/HeggernesSTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HeggernesPTV07,
author = {Pinar Heggernes and
Christophe Paul and
Jan Arne Telle and
Yngve Villanger},
editor = {David S. Johnson and
Uriel Feige},
title = {Interval completion with few edges},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {374--381},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250847},
doi = {10.1145/1250790.1250847},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/HeggernesPTV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FominHM07,
author = {Fedor V. Fomin and
Pinar Heggernes and
Rodica Mihai},
editor = {Andreas Brandst{\"{a}}dt and
Dieter Kratsch and
Haiko M{\"{u}}ller},
title = {Mixed Search Number and Linear-Width of Interval and Split Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
{WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4769},
pages = {304--315},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74839-7\_29},
doi = {10.1007/978-3-540-74839-7\_29},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FominHM07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Heggernes06,
author = {Pinar Heggernes},
title = {Minimal triangulations of graphs: {A} survey},
journal = {Discret. Math.},
volume = {306},
number = {3},
pages = {297--317},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.003},
doi = {10.1016/J.DISC.2005.12.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Heggernes06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BerryHV06,
author = {Anne Berry and
Pinar Heggernes and
Yngve Villanger},
title = {A vertex incremental approach for maintaining chordality},
journal = {Discret. Math.},
volume = {306},
number = {3},
pages = {318--336},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.002},
doi = {10.1016/J.DISC.2005.12.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BerryHV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HeggernesL06,
author = {Pinar Heggernes and
Daniel Lokshtanov},
title = {Optimal broadcast domination in polynomial time},
journal = {Discret. Math.},
volume = {306},
number = {24},
pages = {3267--3280},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.06.013},
doi = {10.1016/J.DISC.2006.06.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HeggernesL06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ManciniH06,
author = {Federico Mancini and
Pinar Heggernes},
title = {A completely dynamic algorithm for split graphs},
journal = {Electron. Notes Discret. Math.},
volume = {27},
pages = {69--70},
year = {2006},
url = {https://doi.org/10.1016/j.endm.2006.08.060},
doi = {10.1016/J.ENDM.2006.08.060},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ManciniH06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BerryBHSV06,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes and
Genevi{\`{e}}ve Simonet and
Yngve Villanger},
title = {A wide-range algorithm for minimal triangulation from an arbitrary
ordering},
journal = {J. Algorithms},
volume = {58},
number = {1},
pages = {33--66},
year = {2006},
url = {https://doi.org/10.1016/j.jalgor.2004.07.001},
doi = {10.1016/J.JALGOR.2004.07.001},
timestamp = {Tue, 06 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BerryBHSV06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HeggernesMP06,
author = {Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos},
editor = {Tetsuo Asano},
title = {Making Arbitrary Graphs Transitively Orientable: Minimal Comparability
Completions},
booktitle = {Algorithms and Computation, 17th International Symposium, {ISAAC}
2006, Kolkata, India, December 18-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4288},
pages = {419--428},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11940128\_43},
doi = {10.1007/11940128\_43},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HeggernesMP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/HeggernesM06,
author = {Pinar Heggernes and
Federico Mancini},
editor = {Jos{\'{e}} R. Correa and
Alejandro Hevia and
Marcos A. Kiwi},
title = {Minimal Split Completions of Graphs},
booktitle = {{LATIN} 2006: Theoretical Informatics, 7th Latin American Symposium,
Valdivia, Chile, March 20-24, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3887},
pages = {592--604},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11682462\_55},
doi = {10.1007/11682462\_55},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/HeggernesM06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/CohenFHKK06,
author = {Johanne Cohen and
Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch and
Gregory Kucherov},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Optimal Linear Arrangement of Interval Graphs},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {267--279},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_24},
doi = {10.1007/11821069\_24},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/CohenFHKK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominHT04,
author = {Fedor V. Fomin and
Pinar Heggernes and
Jan Arne Telle},
title = {Graph Searching, Elimination Trees, and a Generalization of Bandwidth},
journal = {Algorithmica},
volume = {41},
number = {2},
pages = {73--87},
year = {2005},
url = {https://doi.org/10.1007/s00453-004-1117-y},
doi = {10.1007/S00453-004-1117-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FominHT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HeggernesTV05,
author = {Pinar Heggernes and
Jan Arne Telle and
Yngve Villanger},
title = {Computing Minimal Triangulations in Time \emph{O}(\emph{n}\({}^{\mbox{alpha}}\)
\emph{log n}) = \emph{o}(\emph{n} \({}^{\mbox{2.376}}\))},
journal = {{SIAM} J. Discret. Math.},
volume = {19},
number = {4},
pages = {900--913},
year = {2005},
url = {https://doi.org/10.1137/S0895480104445010},
doi = {10.1137/S0895480104445010},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HeggernesTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HeggernesSTV05,
author = {Pinar Heggernes and
Karol Suchan and
Ioan Todinca and
Yngve Villanger},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Minimal Interval Completions},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {403--414},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_37},
doi = {10.1007/11561071\_37},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/HeggernesSTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FominHK05,
author = {Fedor V. Fomin and
Pinar Heggernes and
Dieter Kratsch},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Exact Algorithms for Graph Homomorphisms},
booktitle = {Fundamentals of Computation Theory, 15th International Symposium,
{FCT} 2005, L{\"{u}}beck, Germany, August 17-20, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3623},
pages = {161--171},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_15},
doi = {10.1007/11537311\_15},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/FominHK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HeggernesTV05,
author = {Pinar Heggernes and
Jan Arne Telle and
Yngve Villanger},
title = {Computing minimal triangulations in time O(n\({}^{\mbox{alpha}}\)
log n) = o(n\({}^{\mbox{2.376}}\))},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {907--916},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070560},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HeggernesTV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HeggernesL05,
author = {Pinar Heggernes and
Daniel Lokshtanov},
editor = {Dieter Kratsch},
title = {Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {187--198},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_17},
doi = {10.1007/11604686\_17},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HeggernesL05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BerryBHP04,
author = {Anne Berry and
Jean R. S. Blair and
Pinar Heggernes and
Barry W. Peyton},
title = {Maximum Cardinality Search for Computing Minimal Triangulations of
Graphs},
journal = {Algorithmica},
volume = {39},
number = {4},
pages = {287--298},
year = {2004},
url = {https://doi.org/10.1007/s00453-004-1084-3},
doi = {10.1007/S00453-004-1084-3},
timestamp = {Mon, 05 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BerryBHP04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/para/HeggernesV04,
author = {Pinar Heggernes and
Yngve Villanger},
editor = {Jack J. Dongarra and
Kaj Madsen and
Jerzy Wasniewski},
title = {Simple and Efficient Modifications of Elimination Orderings},
booktitle = {Applied Parallel Computing, State of the Art in Scientific Computing,
7th International Workshop, {PARA} 2004, Lyngby, Denmark, June 20-23,
2004, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3732},
pages = {788--797},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/11558958\_95},
doi = {10.1007/11558958\_95},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/para/HeggernesV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FellowsHRST04,
author = {Mike Fellows and
Pinar Heggernes and
Frances A. Rosamond and
Christian Sloper and
Jan Arne Telle},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {Finding k Disjoint Triangles in an Arbitrary Graph},
booktitle = {Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG
2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {3353},
pages = {235--244},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_20},
doi = {10.1007/978-3-540-30559-0\_20},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FellowsHRST04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/FialaHKT03,
author = {Jir{\'{\i}} Fiala and
Pinar Heggernes and
Petter Kristiansen and
Jan Arne Telle},
title = {Generalized H-coloring and H-covering of Trees},
journal = {Nord. J. Comput.},
volume = {10},
number = {3},
pages = {206--223},
year = {2003},
timestamp = {Fri, 14 Oct 2016 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/FialaHKT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/FominHT03,
author = {Fedor V. Fomin and
Pinar Heggernes and
Jan Arne Telle},
editor = {Andrzej Lingas and
Bengt J. Nilsson},
title = {Graph Searching, Elimination Trees, and a Generalization of Bandwidth},
booktitle = {Fundamentals of Computation Theory, 14th International Symposium,
{FCT} 2003, Malm{\"{o}}, Sweden, August 12-15, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2751},
pages = {73--85},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45077-1\_8},
doi = {10.1007/978-3-540-45077-1\_8},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/FominHT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BerryHV03,
author = {Anne Berry and
Pinar Heggernes and
Yngve Villanger},
editor = {Toshihide Ibaraki and
Naoki Katoh and
Hirotaka Ono},
title = {A Vertex Incremental Approach for Dynamically Maintaining Chordal
Graphs},
booktitle = {Algorithms and Computation, 14th International Symposium, {ISAAC}
2003, Kyoto, Japan, December 15-17, 2003, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2906},
pages = {47--57},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-24587-2\_7},
doi = {10.1007/978-3-540-24587-2\_7},
timestamp = {Fri, 29 Dec 2023 12:40:31 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BerryHV03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryHS03,
author = {Anne Berry and
Pinar Heggernes and
Genevi{\`{e}}ve Simonet},
editor = {Hans L. Bodlaender},
title = {The Minimum Degree Heuristic and the Minimal Triangulation Process},
booktitle = {Graph-Theoretic Concepts in Computer Science, 29th International Workshop,
{WG} 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {2880},
pages = {58--70},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_6},
doi = {10.1007/978-3-540-39890-5\_6},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/HeggernesV02,
author = {Pinar Heggernes and
Yngve Villanger},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Efficient Implementation of a Minimal Triangulation Algorithm},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {550--561},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_49},
doi = {10.1007/3-540-45749-6\_49},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/HeggernesV02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BerryBH02,
author = {Anne Berry and
Jean R. S. Blair and
Pinar Heggernes},
editor = {Ludek Kucera},
title = {Maximum Cardinality Search for Computing Minimal Triangulations},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {1--12},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_1},
doi = {10.1007/3-540-36379-3\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/BerryBH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FialaHKT02,
author = {Jir{\'{\i}} Fiala and
Pinar Heggernes and
Petter Kristiansen and
Jan Arne Telle},
editor = {Ludek Kucera},
title = {Generalized H-Coloring and H-Covering of Trees},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {198--210},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_18},
doi = {10.1007/3-540-36379-3\_18},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/FialaHKT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BlairHT01,
author = {Jean R. S. Blair and
Pinar Heggernes and
Jan Arne Telle},
title = {A practical algorithm for making filled graphs minimal},
journal = {Theor. Comput. Sci.},
volume = {250},
number = {1-2},
pages = {125--141},
year = {2001},
url = {https://doi.org/10.1016/S0304-3975(99)00126-7},
doi = {10.1016/S0304-3975(99)00126-7},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BlairHT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BerryBH00,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes},
title = {Recognizing Weakly Triangulated Graphs by Edge Separability},
journal = {Nord. J. Comput.},
volume = {7},
number = {3},
pages = {164--177},
year = {2000},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BerryBH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/BjorckHM00,
author = {{\AA}ke Bj{\"{o}}rck and
Pinar Heggernes and
P. Matstoms},
title = {Methods for Large Scale Total Least Squares Problems},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {22},
number = {2},
pages = {413--429},
year = {2000},
url = {https://doi.org/10.1137/S0895479899355414},
doi = {10.1137/S0895479899355414},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/BjorckHM00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BerryBH00,
author = {Anne Berry and
Jean Paul Bordat and
Pinar Heggernes},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Recognizing Weakly Triangulated Graphs by Edge Separability},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {139--149},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_13},
doi = {10.1007/3-540-44985-X\_13},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/BerryBH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/HeggernesT98,
author = {Pinar Heggernes and
Jan Arne Telle},
title = {Partitioning Graphs into Generalized Dominating Sets},
journal = {Nord. J. Comput.},
volume = {5},
number = {2},
pages = {128--142},
year = {1998},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/HeggernesT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BlairHT96,
author = {Jean R. S. Blair and
Pinar Heggernes and
Jan Arne Telle},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Making an Arbitrary Filled Graph Minimal by Removing Fill Edges},
booktitle = {Algorithm Theory - {SWAT} '96, 5th Scandinavian Workshop on Algorithm
Theory, Reykjav{\'{\i}}k, Iceland, July 3-5, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1097},
pages = {173--184},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61422-2\_130},
doi = {10.1007/3-540-61422-2\_130},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BlairHT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-02-06 23:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
