BibTeX records: Yngve Villanger

download as .bib file

@article{DBLP:journals/tcs/TelleV19,
  author       = {Jan Arne Telle and
                  Yngve Villanger},
  title        = {{FPT} algorithms for domination in sparse graphs and beyond},
  journal      = {Theor. Comput. Sci.},
  volume       = {770},
  pages        = {62--68},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.tcs.2018.10.030},
  doi          = {10.1016/J.TCS.2018.10.030},
  timestamp    = {Wed, 08 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/TelleV19.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/dam/ChapelleLTV17,
  author       = {Mathieu Chapelle and
                  Mathieu Liedloff and
                  Ioan Todinca and
                  Yngve Villanger},
  title        = {Treewidth and Pathwidth parameterized by the vertex cover number},
  journal      = {Discret. Appl. Math.},
  volume       = {216},
  pages        = {114--129},
  year         = {2017},
  url          = {https://doi.org/10.1016/j.dam.2014.12.012},
  doi          = {10.1016/J.DAM.2014.12.012},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/ChapelleLTV17.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/algorithmica/BliznetsFPV16,
  author       = {Ivan Bliznets and
                  Fedor V. Fomin and
                  Michal Pilipczuk and
                  Yngve Villanger},
  title        = {Largest Chordal and Interval Subgraphs Faster than {\textdollar}{\textdollar}2{\^{}}n{\textdollar}{\textdollar}
                  2 n},
  journal      = {Algorithmica},
  volume       = {76},
  number       = {2},
  pages        = {569--594},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00453-015-0054-2},
  doi          = {10.1007/S00453-015-0054-2},
  timestamp    = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BliznetsFPV16.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/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/mst/FernauSV16,
  author       = {Henning Fernau and
                  Markus L. Schmid and
                  Yngve Villanger},
  title        = {On the Parameterised Complexity of String Morphism Problems},
  journal      = {Theory Comput. Syst.},
  volume       = {59},
  number       = {1},
  pages        = {24--51},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00224-015-9635-3},
  doi          = {10.1007/S00224-015-9635-3},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/FernauSV16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Villanger16,
  author       = {Yngve Villanger},
  title        = {Fast Minimal Triangulation},
  booktitle    = {Encyclopedia of Algorithms},
  pages        = {731--735},
  year         = {2016},
  url          = {https://doi.org/10.1007/978-1-4939-2864-4\_142},
  doi          = {10.1007/978-1-4939-2864-4\_142},
  timestamp    = {Wed, 12 Jul 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Villanger16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FominPV15,
  author       = {Fedor V. Fomin and
                  Geevarghese Philip and
                  Yngve Villanger},
  title        = {Minimum Fill-in of Sparse Graphs: Kernelization and Approximation},
  journal      = {Algorithmica},
  volume       = {71},
  number       = {1},
  pages        = {1--20},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00453-013-9776-1},
  doi          = {10.1007/S00453-013-9776-1},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/FominPV15.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/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/siamcomp/FominTV15,
  author       = {Fedor V. Fomin and
                  Ioan Todinca and
                  Yngve Villanger},
  title        = {Large Induced Subgraphs via Triangulations and {CMSO}},
  journal      = {{SIAM} J. Comput.},
  volume       = {44},
  number       = {1},
  pages        = {54--87},
  year         = {2015},
  url          = {https://doi.org/10.1137/140964801},
  doi          = {10.1137/140964801},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FominTV15.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}
}
@article{DBLP:journals/toct/DrangeFPV15,
  author       = {P{\aa}l Gr{\o}n{\aa}s Drange and
                  Fedor V. Fomin and
                  Michal Pilipczuk and
                  Yngve Villanger},
  title        = {Exploring the Subexponential Complexity of Completion Problems},
  journal      = {{ACM} Trans. Comput. Theory},
  volume       = {7},
  number       = {4},
  pages        = {14:1--14:38},
  year         = {2015},
  url          = {https://doi.org/10.1145/2799640},
  doi          = {10.1145/2799640},
  timestamp    = {Mon, 08 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toct/DrangeFPV15.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}
}
@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/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/dam/LiedloffTV14,
  author       = {Mathieu Liedloff and
                  Ioan Todinca and
                  Yngve Villanger},
  title        = {Solving Capacitated Dominating Set by using covering by subsets and
                  maximum matching},
  journal      = {Discret. Appl. Math.},
  volume       = {168},
  pages        = {60--68},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.dam.2012.10.021},
  doi          = {10.1016/J.DAM.2012.10.021},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/LiedloffTV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FominV14,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  title        = {Searching for better fill-in},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {80},
  number       = {7},
  pages        = {1374--1383},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jcss.2014.04.010},
  doi          = {10.1016/J.JCSS.2014.04.010},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/FominV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FominKPPV14,
  author       = {Fedor V. Fomin and
                  Stefan Kratsch and
                  Marcin Pilipczuk and
                  Michal Pilipczuk and
                  Yngve Villanger},
  title        = {Tight bounds for parameterized complexity of Cluster Editing with
                  a small number of clusters},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {80},
  number       = {7},
  pages        = {1430--1447},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.jcss.2014.04.015},
  doi          = {10.1016/J.JCSS.2014.04.015},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/FominKPPV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/LokshantovVV14,
  author       = {Daniel Lokshtanov and
                  Martin Vatshelle and
                  Yngve Villanger},
  editor       = {Chandra Chekuri},
  title        = {Independent Set in \emph{P}\({}_{\mbox{5}}\)-Free Graphs in Polynomial
                  Time},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {570--581},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.43},
  doi          = {10.1137/1.9781611973402.43},
  timestamp    = {Wed, 01 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/LokshantovVV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FominTV14,
  author       = {Fedor V. Fomin and
                  Ioan Todinca and
                  Yngve Villanger},
  editor       = {Chandra Chekuri},
  title        = {Large induced subgraphs via triangulations and {CMSO}},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {582--583},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.44},
  doi          = {10.1137/1.9781611973402.44},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FominTV14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DrangeFPV14,
  author       = {P{\aa}l Gr{\o}n{\aa}s Drange and
                  Fedor V. Fomin and
                  Michal Pilipczuk and
                  Yngve Villanger},
  editor       = {Ernst W. Mayr and
                  Natacha Portier},
  title        = {Exploring Subexponential Parameterized Complexity of Completion Problems},
  booktitle    = {31st International Symposium on Theoretical Aspects of Computer Science
                  {(STACS} 2014), {STACS} 2014, March 5-8, 2014, Lyon, France},
  series       = {LIPIcs},
  volume       = {25},
  pages        = {288--299},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2014},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2014.288},
  doi          = {10.4230/LIPICS.STACS.2014.288},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/DrangeFPV14.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}
}
@article{DBLP:journals/algorithmica/HofV13,
  author       = {Pim van 't Hof and
                  Yngve Villanger},
  title        = {Proper Interval Vertex Deletion},
  journal      = {Algorithmica},
  volume       = {65},
  number       = {4},
  pages        = {845--867},
  year         = {2013},
  url          = {https://doi.org/10.1007/s00453-012-9661-3},
  doi          = {10.1007/S00453-012-9661-3},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/HofV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominV13,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  title        = {Subexponential Parameterized Algorithm for Minimum Fill-In},
  journal      = {{SIAM} J. Comput.},
  volume       = {42},
  number       = {6},
  pages        = {2197--2216},
  year         = {2013},
  url          = {https://doi.org/10.1137/11085390X},
  doi          = {10.1137/11085390X},
  timestamp    = {Wed, 14 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FominV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FominSV13,
  author       = {Fedor V. Fomin and
                  Saket Saurabh and
                  Yngve Villanger},
  title        = {A Polynomial Kernel for Proper Interval Vertex Deletion},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {27},
  number       = {4},
  pages        = {1964--1976},
  year         = {2013},
  url          = {https://doi.org/10.1137/12089051X},
  doi          = {10.1137/12089051X},
  timestamp    = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/FominSV13.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/esa/BliznetsFPV13,
  author       = {Ivan Bliznets and
                  Fedor V. Fomin and
                  Michal Pilipczuk and
                  Yngve Villanger},
  editor       = {Hans L. Bodlaender and
                  Giuseppe F. Italiano},
  title        = {Largest Chordal and Interval Subgraphs Faster Than 2 n},
  booktitle    = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
                  France, September 2-4, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8125},
  pages        = {193--204},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40450-4\_17},
  doi          = {10.1007/978-3-642-40450-4\_17},
  timestamp    = {Mon, 03 Jan 2022 22:19:39 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/BliznetsFPV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/FernauSV13,
  author       = {Henning Fernau and
                  Markus L. Schmid and
                  Yngve Villanger},
  editor       = {Anil Seth and
                  Nisheeth K. Vishnoi},
  title        = {On the Parameterised Complexity of String Morphism Problems},
  booktitle    = {{IARCS} Annual Conference on Foundations of Software Technology and
                  Theoretical Computer Science, {FSTTCS} 2013, December 12-14, 2013,
                  Guwahati, India},
  series       = {LIPIcs},
  volume       = {24},
  pages        = {55--66},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2013.55},
  doi          = {10.4230/LIPICS.FSTTCS.2013.55},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/FernauSV13.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/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/stacs/FominV13,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  editor       = {Natacha Portier and
                  Thomas Wilke},
  title        = {Searching for better fill-in},
  booktitle    = {30th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
  series       = {LIPIcs},
  volume       = {20},
  pages        = {8--19},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2013.8},
  doi          = {10.4230/LIPICS.STACS.2013.8},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/FominV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FominKPPV13,
  author       = {Fedor V. Fomin and
                  Stefan Kratsch and
                  Marcin Pilipczuk and
                  Michal Pilipczuk and
                  Yngve Villanger},
  editor       = {Natacha Portier and
                  Thomas Wilke},
  title        = {Tight bounds for Parameterized Complexity of Cluster Editing},
  booktitle    = {30th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
  series       = {LIPIcs},
  volume       = {20},
  pages        = {32--43},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2013},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2013.32},
  doi          = {10.4230/LIPICS.STACS.2013.32},
  timestamp    = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FominKPPV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ChapelleLTV13,
  author       = {Mathieu Chapelle and
                  Mathieu Liedloff and
                  Ioan Todinca and
                  Yngve Villanger},
  editor       = {Frank Dehne and
                  Roberto Solis{-}Oba and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title        = {Treewidth and Pathwidth Parameterized by the Vertex Cover Number},
  booktitle    = {Algorithms and Data Structures - 13th International Symposium, {WADS}
                  2013, London, ON, Canada, August 12-14, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8037},
  pages        = {232--243},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40104-6\_21},
  doi          = {10.1007/978-3-642-40104-6\_21},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/ChapelleLTV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/TelleV13,
  author       = {Jan Arne Telle and
                  Yngve Villanger},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Klaus Jansen and
                  R{\"{u}}diger Reischuk},
  title        = {Connecting Terminals and 2-Disjoint Connected Subgraphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 39th International
                  Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
                  Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8165},
  pages        = {418--428},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-45043-3\_36},
  doi          = {10.1007/978-3-642-45043-3\_36},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/TelleV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-2506,
  author       = {Jan Arne Telle and
                  Yngve Villanger},
  title        = {Connecting Terminals and 2-Disjoint Connected Subgraphs},
  journal      = {CoRR},
  volume       = {abs/1301.2506},
  year         = {2013},
  url          = {http://arxiv.org/abs/1301.2506},
  eprinttype    = {arXiv},
  eprint       = {1301.2506},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1301-2506.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0433,
  author       = {Mathieu Chapelle and
                  Mathieu Liedloff and
                  Ioan Todinca and
                  Yngve Villanger},
  title        = {{TREEWIDTH} and {PATHWIDTH} parameterized by vertex cover},
  journal      = {CoRR},
  volume       = {abs/1305.0433},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.0433},
  eprinttype    = {arXiv},
  eprint       = {1305.0433},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-0433.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FominTV13,
  author       = {Fedor V. Fomin and
                  Ioan Todinca and
                  Yngve Villanger},
  title        = {Large induced subgraphs via triangulations and {CMSO}},
  journal      = {CoRR},
  volume       = {abs/1309.1559},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.1559},
  eprinttype    = {arXiv},
  eprint       = {1309.1559},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/FominTV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DrangeFPV13,
  author       = {P{\aa}l Gr{\o}n{\aa}s Drange and
                  Fedor V. Fomin and
                  Michal Pilipczuk and
                  Yngve Villanger},
  title        = {Exploring Subexponential Parameterized Complexity of Completion Problems},
  journal      = {CoRR},
  volume       = {abs/1309.4022},
  year         = {2013},
  url          = {http://arxiv.org/abs/1309.4022},
  eprinttype    = {arXiv},
  eprint       = {1309.4022},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/DrangeFPV13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BliznetsFPV13,
  author       = {Ivan Bliznets and
                  Fedor V. Fomin and
                  Michal Pilipczuk and
                  Yngve Villanger},
  title        = {Largest chordal and interval subgraphs faster than 2{\^{}}n},
  journal      = {CoRR},
  volume       = {abs/1311.4055},
  year         = {2013},
  url          = {http://arxiv.org/abs/1311.4055},
  eprinttype    = {arXiv},
  eprint       = {1311.4055},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BliznetsFPV13.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/combinatorica/FominV12,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  title        = {Treewidth computation and extremal combinatorics},
  journal      = {Comb.},
  volume       = {32},
  number       = {3},
  pages        = {289--308},
  year         = {2012},
  url          = {https://doi.org/10.1007/s00493-012-2536-z},
  doi          = {10.1007/S00493-012-2536-Z},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorica/FominV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/FellowsFLRSV12,
  author       = {Michael R. Fellows and
                  Fedor V. Fomin and
                  Daniel Lokshtanov and
                  Frances A. Rosamond and
                  Saket Saurabh and
                  Yngve Villanger},
  title        = {Local search: Is brute-force avoidable?},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {78},
  number       = {3},
  pages        = {707--719},
  year         = {2012},
  url          = {https://doi.org/10.1016/j.jcss.2011.10.003},
  doi          = {10.1016/J.JCSS.2011.10.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/FellowsFLRSV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/Binkele-RaibleFFLSV12,
  author       = {Daniel Binkele{-}Raible and
                  Henning Fernau and
                  Fedor V. Fomin and
                  Daniel Lokshtanov and
                  Saket Saurabh and
                  Yngve Villanger},
  title        = {Kernel(s) for problems with no kernel: On out-trees with many leaves},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {8},
  number       = {4},
  pages        = {38:1--38:19},
  year         = {2012},
  url          = {https://doi.org/10.1145/2344422.2344428},
  doi          = {10.1145/2344422.2344428},
  timestamp    = {Tue, 21 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/Binkele-RaibleFFLSV12.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/esa/FominSV12,
  author       = {Fedor V. Fomin and
                  Saket Saurabh and
                  Yngve Villanger},
  editor       = {Leah Epstein and
                  Paolo Ferragina},
  title        = {A Polynomial Kernel for Proper Interval Vertex Deletion},
  booktitle    = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
                  Slovenia, September 10-12, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7501},
  pages        = {467--478},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33090-2\_41},
  doi          = {10.1007/978-3-642-33090-2\_41},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/FominSV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/TelleV12,
  author       = {Jan Arne Telle and
                  Yngve Villanger},
  editor       = {Leah Epstein and
                  Paolo Ferragina},
  title        = {{FPT} Algorithms for Domination in Biclique-Free Graphs},
  booktitle    = {Algorithms - {ESA} 2012 - 20th Annual European Symposium, Ljubljana,
                  Slovenia, September 10-12, 2012. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {7501},
  pages        = {802--812},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-33090-2\_69},
  doi          = {10.1007/978-3-642-33090-2\_69},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/TelleV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FominGGSSLVV12,
  author       = {Fedor V. Fomin and
                  Serge Gaspers and
                  Petr A. Golovach and
                  Karol Suchan and
                  Stefan Szeider and
                  Erik Jan van Leeuwen and
                  Martin Vatshelle and
                  Yngve Villanger},
  editor       = {David Fern{\'{a}}ndez{-}Baca},
  title        = {k-Gap 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        = {350--361},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-29344-3\_30},
  doi          = {10.1007/978-3-642-29344-3\_30},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/FominGGSSLVV12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FominV12,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  editor       = {Yuval Rabani},
  title        = {Subexponential parameterized algorithm for minimum fill-in},
  booktitle    = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages        = {1737--1746},
  publisher    = {{SIAM}},
  year         = {2012},
  url          = {https://doi.org/10.1137/1.9781611973099.138},
  doi          = {10.1137/1.9781611973099.138},
  timestamp    = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/FominV12.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-1204-4880,
  author       = {Fedor V. Fomin and
                  Saket Saurabh and
                  Yngve Villanger},
  title        = {A Polynomial kernel for Proper Interval Vertex Deletion},
  journal      = {CoRR},
  volume       = {abs/1204.4880},
  year         = {2012},
  url          = {http://arxiv.org/abs/1204.4880},
  eprinttype    = {arXiv},
  eprint       = {1204.4880},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1204-4880.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}
}
@inproceedings{DBLP:conf/esa/FominTV11,
  author       = {Fedor V. Fomin and
                  Ioan Todinca and
                  Yngve Villanger},
  editor       = {Camil Demetrescu and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson},
  title        = {Exact Algorithm for the Maximum Induced Planar Subgraph Problem},
  booktitle    = {Algorithms - {ESA} 2011 - 19th Annual European Symposium, Saarbr{\"{u}}cken,
                  Germany, September 5-9, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6942},
  pages        = {287--298},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-23719-5\_25},
  doi          = {10.1007/978-3-642-23719-5\_25},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/FominTV11.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/FominPV11,
  author       = {Fedor V. Fomin and
                  Geevarghese Philip and
                  Yngve Villanger},
  editor       = {Supratik Chakraborty and
                  Amit Kumar},
  title        = {Minimum Fill-in of Sparse Graphs: Kernelization and Approximation},
  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        = {164--175},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2011},
  url          = {https://doi.org/10.4230/LIPIcs.FSTTCS.2011.164},
  doi          = {10.4230/LIPICS.FSTTCS.2011.164},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/fsttcs/FominPV11.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-1104-2230,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  title        = {Subexponential Parameterized Algorithm for Minimum Fill-in},
  journal      = {CoRR},
  volume       = {abs/1104.2230},
  year         = {2011},
  url          = {http://arxiv.org/abs/1104.2230},
  eprinttype    = {arXiv},
  eprint       = {1104.2230},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1104-2230.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-3244,
  author       = {Fedor V. Fomin and
                  Serge Gaspers and
                  Petr A. Golovach and
                  Karol Suchan and
                  Stefan Szeider and
                  Erik Jan van Leeuwen and
                  Martin Vatshelle and
                  Yngve Villanger},
  title        = {k-Gap Interval Graphs},
  journal      = {CoRR},
  volume       = {abs/1112.3244},
  year         = {2011},
  url          = {http://arxiv.org/abs/1112.3244},
  eprinttype    = {arXiv},
  eprint       = {1112.3244},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1112-3244.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-4419,
  author       = {Fedor V. Fomin and
                  Stefan Kratsch and
                  Marcin Pilipczuk and
                  Michal Pilipczuk and
                  Yngve Villanger},
  title        = {Subexponential fixed-parameter tractability of cluster editing},
  journal      = {CoRR},
  volume       = {abs/1112.4419},
  year         = {2011},
  url          = {http://arxiv.org/abs/1112.4419},
  eprinttype    = {arXiv},
  eprint       = {1112.4419},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1112-4419.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/iwpec/Villanger10,
  author       = {Yngve Villanger},
  editor       = {Venkatesh Raman and
                  Saket Saurabh},
  title        = {Proper Interval Vertex Deletion},
  booktitle    = {Parameterized and Exact Computation - 5th International Symposium,
                  {IPEC} 2010, Chennai, India, December 13-15, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6478},
  pages        = {228--238},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17493-3\_22},
  doi          = {10.1007/978-3-642-17493-3\_22},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/Villanger10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FominV10,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  editor       = {Jean{-}Yves Marion and
                  Thomas Schwentick},
  title        = {Finding Induced Subgraphs via Minimal Triangulations},
  booktitle    = {27th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2010, March 4-6, 2010, Nancy, France},
  series       = {LIPIcs},
  volume       = {5},
  pages        = {383--394},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2010},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2010.2470},
  doi          = {10.4230/LIPICS.STACS.2010.2470},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/stacs/FominV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LiedloffTV10,
  author       = {Mathieu Liedloff and
                  Ioan Todinca and
                  Yngve Villanger},
  editor       = {Dimitrios M. Thilikos},
  title        = {Solving Capacitated Dominating Set by Using Covering by Subsets and
                  Maximum Matching},
  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        = {88--99},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-16926-7\_10},
  doi          = {10.1007/978-3-642-16926-7\_10},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/LiedloffTV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PhilipRV10,
  author       = {Geevarghese Philip and
                  Venkatesh Raman and
                  Yngve Villanger},
  editor       = {Dimitrios M. Thilikos},
  title        = {A Quartic Kernel for Pathwidth-One Vertex Deletion},
  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        = {196--207},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-16926-7\_19},
  doi          = {10.1007/978-3-642-16926-7\_19},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/PhilipRV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-0806,
  author       = {Geevarghese Philip and
                  Venkatesh Raman and
                  Yngve Villanger},
  title        = {A Quartic Kernel for Pathwidth-One Vertex Deletion},
  journal      = {CoRR},
  volume       = {abs/1009.0806},
  year         = {2010},
  url          = {http://arxiv.org/abs/1009.0806},
  eprinttype    = {arXiv},
  eprint       = {1009.0806},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1009-0806.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}
}
@inproceedings{DBLP:conf/ijcai/FellowsRFLSV09,
  author       = {Michael R. Fellows and
                  Frances A. Rosamond and
                  Fedor V. Fomin and
                  Daniel Lokshtanov and
                  Saket Saurabh and
                  Yngve Villanger},
  editor       = {Craig Boutilier},
  title        = {Local Search: Is Brute-Force Avoidable?},
  booktitle    = {{IJCAI} 2009, Proceedings of the 21st International Joint Conference
                  on Artificial Intelligence, Pasadena, California, USA, July 11-17,
                  2009},
  pages        = {486--491},
  year         = {2009},
  url          = {http://ijcai.org/Proceedings/09/Papers/088.pdf},
  timestamp    = {Tue, 20 Aug 2019 16:16:40 +0200},
  biburl       = {https://dblp.org/rec/conf/ijcai/FellowsRFLSV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/SuchanV09,
  author       = {Karol Suchan and
                  Yngve Villanger},
  editor       = {Jianer Chen and
                  Fedor V. Fomin},
  title        = {Computing Pathwidth Faster Than 2\({}^{\mbox{\emph{n}}}\)},
  booktitle    = {Parameterized and Exact Computation, 4th International Workshop, {IWPEC}
                  2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected
                  Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {5917},
  pages        = {324--335},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-11269-0\_27},
  doi          = {10.1007/978-3-642-11269-0\_27},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/SuchanV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FernauFLRSV09,
  author       = {Henning Fernau and
                  Fedor V. Fomin and
                  Daniel Lokshtanov and
                  Daniel Raible and
                  Saket Saurabh and
                  Yngve Villanger},
  editor       = {Susanne Albers and
                  Jean{-}Yves Marion},
  title        = {Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves},
  booktitle    = {26th International Symposium on Theoretical Aspects of Computer Science,
                  {STACS} 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
  series       = {LIPIcs},
  volume       = {3},
  pages        = {421--432},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year         = {2009},
  url          = {https://doi.org/10.4230/LIPIcs.STACS.2009.1843},
  doi          = {10.4230/LIPICS.STACS.2009.1843},
  timestamp    = {Tue, 22 Jun 2021 15:43:57 +0200},
  biburl       = {https://dblp.org/rec/conf/stacs/FernauFLRSV09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0909-5278,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  title        = {Finding Induced Subgraphs via Minimal Triangulations},
  journal      = {CoRR},
  volume       = {abs/0909.5278},
  year         = {2009},
  url          = {http://arxiv.org/abs/0909.5278},
  eprinttype    = {arXiv},
  eprint       = {0909.5278},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0909-5278.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/ChenFLLV08,
  author       = {Jianer Chen and
                  Fedor V. Fomin and
                  Yang Liu and
                  Songjian Lu and
                  Yngve Villanger},
  title        = {Improved algorithms for feedback vertex set problems},
  journal      = {J. Comput. Syst. Sci.},
  volume       = {74},
  number       = {7},
  pages        = {1188--1198},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.jcss.2008.05.002},
  doi          = {10.1016/J.JCSS.2008.05.002},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jcss/ChenFLLV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FominKTV08,
  author       = {Fedor V. Fomin and
                  Dieter Kratsch and
                  Ioan Todinca and
                  Yngve Villanger},
  title        = {Exact Algorithms for Treewidth and Minimum Fill-In},
  journal      = {{SIAM} J. Comput.},
  volume       = {38},
  number       = {3},
  pages        = {1058--1079},
  year         = {2008},
  url          = {https://doi.org/10.1137/050643350},
  doi          = {10.1137/050643350},
  timestamp    = {Sun, 02 Jun 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/FominKTV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/FominV08,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  editor       = {Luca Aceto and
                  Ivan Damg{\aa}rd and
                  Leslie Ann Goldberg and
                  Magn{\'{u}}s M. Halld{\'{o}}rsson and
                  Anna Ing{\'{o}}lfsd{\'{o}}ttir and
                  Igor Walukiewicz},
  title        = {Treewidth Computation and Extremal Combinatorics},
  booktitle    = {Automata, Languages and Programming, 35th International Colloquium,
                  {ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
                  {I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
  series       = {Lecture Notes in Computer Science},
  volume       = {5125},
  pages        = {210--221},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-70575-8\_18},
  doi          = {10.1007/978-3-540-70575-8\_18},
  timestamp    = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/FominV08.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/iwpec/DomLSV08,
  author       = {Michael Dom and
                  Daniel Lokshtanov and
                  Saket Saurabh and
                  Yngve Villanger},
  editor       = {Martin Grohe and
                  Rolf Niedermeier},
  title        = {Capacitated Domination and Covering: {A} Parameterized Perspective},
  booktitle    = {Parameterized and Exact Computation, Third International Workshop,
                  {IWPEC} 2008, Victoria, Canada, May 14-16, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5018},
  pages        = {78--90},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-79723-4\_9},
  doi          = {10.1007/978-3-540-79723-4\_9},
  timestamp    = {Tue, 14 May 2019 10:00:45 +0200},
  biburl       = {https://dblp.org/rec/conf/iwpec/DomLSV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GolovachV08,
  author       = {Petr A. Golovach and
                  Yngve Villanger},
  editor       = {Hajo Broersma and
                  Thomas Erlebach and
                  Tom Friedetzky and
                  Dani{\"{e}}l Paulusma},
  title        = {Parameterized Complexity for Domination Problems on Degenerate 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        = {195--205},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-92248-3\_18},
  doi          = {10.1007/978-3-540-92248-3\_18},
  timestamp    = {Sun, 25 Oct 2020 23:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/GolovachV08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Villanger08,
  author       = {Yngve Villanger},
  editor       = {Ming{-}Yang Kao},
  title        = {Fast Minimal Triangulation},
  booktitle    = {Encyclopedia of Algorithms - 2008 Edition},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-0-387-30162-4\_142},
  doi          = {10.1007/978-0-387-30162-4\_142},
  timestamp    = {Thu, 27 Jun 2019 16:25:31 +0200},
  biburl       = {https://dblp.org/rec/reference/algo/Villanger08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0803-1321,
  author       = {Fedor V. Fomin and
                  Yngve Villanger},
  title        = {Treewidth computation and extremal combinatorics},
  journal      = {CoRR},
  volume       = {abs/0803.1321},
  year         = {2008},
  url          = {http://arxiv.org/abs/0803.1321},
  eprinttype    = {arXiv},
  eprint       = {0803.1321},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0803-1321.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0810-4796,
  author       = {Henning Fernau and
                  Fedor V. Fomin and
                  Daniel Lokshtanov and
                  Daniel Raible and
                  Saket Saurabh and
                  Yngve Villanger},
  title        = {Kernel(s) for Problems With no Kernel: On Out-Trees With Many Leaves},
  journal      = {CoRR},
  volume       = {abs/0810.4796},
  year         = {2008},
  url          = {http://arxiv.org/abs/0810.4796},
  eprinttype    = {arXiv},
  eprint       = {0810.4796},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0810-4796.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/wads/ChenFLLV07,
  author       = {Jianer Chen and
                  Fedor V. Fomin and
                  Yang Liu and
                  Songjian Lu and
                  Yngve Villanger},
  editor       = {Frank K. H. A. Dehne and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack and
                  Norbert Zeh},
  title        = {Improved Algorithms for the Feedback Vertex Set Problems},
  booktitle    = {Algorithms and Data Structures, 10th International Workshop, {WADS}
                  2007, Halifax, Canada, August 15-17, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4619},
  pages        = {422--433},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73951-7\_37},
  doi          = {10.1007/978-3-540-73951-7\_37},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/ChenFLLV07.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/Villanger06,
  author       = {Yngve Villanger},
  title        = {Lex {M} versus {MCS-M}},
  journal      = {Discret. Math.},
  volume       = {306},
  number       = {3},
  pages        = {393--400},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.disc.2005.12.005},
  doi          = {10.1016/J.DISC.2005.12.005},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Villanger06.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/latin/Villanger06,
  author       = {Yngve Villanger},
  editor       = {Jos{\'{e}} R. Correa and
                  Alejandro Hevia and
                  Marcos A. Kiwi},
  title        = {Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In},
  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        = {800--811},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11682462\_73},
  doi          = {10.1007/11682462\_73},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/latin/Villanger06.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/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/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/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/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}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics