Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Dieter Kratsch
@article{DBLP:journals/jcss/GolovachKKL22, author = {Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, title = {Refined notions of parameterized enumeration kernels with applications to matching cut enumeration}, journal = {J. Comput. Syst. Sci.}, volume = {123}, pages = {76--102}, year = {2022}, url = {https://doi.org/10.1016/j.jcss.2021.07.005}, doi = {10.1016/J.JCSS.2021.07.005}, timestamp = {Wed, 03 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jcss/GolovachKKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/GolovachKKL21, author = {Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, editor = {Markus Bl{\"{a}}ser and Benjamin Monmege}, title = {Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration}, booktitle = {38th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2021, March 16-19, 2021, Saarbr{\"{u}}cken, Germany (Virtual Conference)}, series = {LIPIcs}, volume = {187}, pages = {37:1--37:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.STACS.2021.37}, doi = {10.4230/LIPICS.STACS.2021.37}, timestamp = {Thu, 11 Mar 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/GolovachKKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-03800, author = {Petr A. Golovach and Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, title = {Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration}, journal = {CoRR}, volume = {abs/2101.03800}, year = {2021}, url = {https://arxiv.org/abs/2101.03800}, eprinttype = {arXiv}, eprint = {2101.03800}, timestamp = {Thu, 21 Jan 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-03800.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/dam/KomusiewiczKL20, author = {Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, title = {Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms}, journal = {Discret. Appl. Math.}, volume = {283}, pages = {44--58}, year = {2020}, url = {https://doi.org/10.1016/j.dam.2019.12.010}, doi = {10.1016/J.DAM.2019.12.010}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/KomusiewiczKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KammerKL19, author = {Frank Kammer and Dieter Kratsch and Moritz Laudahn}, title = {Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs}, journal = {Algorithmica}, volume = {81}, number = {3}, pages = {1180--1204}, year = {2019}, url = {https://doi.org/10.1007/s00453-018-0464-z}, doi = {10.1007/S00453-018-0464-Z}, timestamp = {Sat, 02 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/KammerKL19.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} }
@article{DBLP:journals/dam/GolovachKLS19, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, title = {Enumeration and maximum number of maximal irredundant sets for chordal graphs}, journal = {Discret. Appl. Math.}, volume = {265}, pages = {69--85}, year = {2019}, url = {https://doi.org/10.1016/j.dam.2019.03.018}, doi = {10.1016/J.DAM.2019.03.018}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GolovachKLS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKS19, author = {Petr A. Golovach and Dieter Kratsch and Mohamed Yosri Sayadi}, title = {Enumeration of maximal irredundant sets for claw-free graphs}, journal = {Theor. Comput. Sci.}, volume = {754}, pages = {3--15}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2018.02.014}, doi = {10.1016/J.TCS.2018.02.014}, timestamp = {Wed, 19 Dec 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKS19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKLS19, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, title = {Enumeration and maximum number of minimal dominating sets for chordal graphs}, journal = {Theor. Comput. Sci.}, volume = {783}, pages = {41--52}, year = {2019}, url = {https://doi.org/10.1016/j.tcs.2019.03.017}, doi = {10.1016/J.TCS.2019.03.017}, timestamp = {Wed, 03 Jul 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKLS19.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/ChapelleCCKLLP18, author = {Mathieu Chapelle and Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Dieter Kratsch and Romain Letourneur and Mathieu Liedloff and Anthony Perez}, title = {Exact algorithms for weak Roman domination}, journal = {Discret. Appl. Math.}, volume = {248}, pages = {79--92}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2017.09.015}, doi = {10.1016/J.DAM.2017.09.015}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/ChapelleCCKLLP18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/CochefertCGKPS18, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Computing square roots of graphs with low maximum degree}, journal = {Discret. Appl. Math.}, volume = {248}, pages = {93--101}, year = {2018}, url = {https://doi.org/10.1016/j.dam.2017.04.041}, doi = {10.1016/J.DAM.2017.04.041}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/CochefertCGKPS18.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} }
@article{DBLP:journals/mst/GolovachKPS18, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Finding Cactus Roots in Polynomial Time}, journal = {Theory Comput. Syst.}, volume = {62}, number = {6}, pages = {1409--1426}, year = {2018}, url = {https://doi.org/10.1007/s00224-017-9825-2}, doi = {10.1007/S00224-017-9825-2}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/GolovachKPS18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/KomusiewiczKL18, author = {Christian Komusiewicz and Dieter Kratsch and Van Bang Le}, editor = {Christophe Paul and Michal Pilipczuk}, title = {Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms}, booktitle = {13th International Symposium on Parameterized and Exact Computation, {IPEC} 2018, August 20-24, 2018, Helsinki, Finland}, series = {LIPIcs}, volume = {115}, pages = {19:1--19:13}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.IPEC.2018.19}, doi = {10.4230/LIPICS.IPEC.2018.19}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/KomusiewiczKL18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DraganKL17, author = {Feodor F. Dragan and Dieter Kratsch and Van Bang Le}, title = {Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandst{\"{a}}dt on the occasion of his 65th birthday}, journal = {Discret. Appl. Math.}, volume = {216}, pages = {1}, year = {2017}, url = {https://doi.org/10.1016/j.dam.2016.08.009}, doi = {10.1016/J.DAM.2016.08.009}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dam/DraganKL17.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/tcs/ChapelleCKLL17, author = {Mathieu Chapelle and Manfred Cochefert and Dieter Kratsch and Romain Letourneur and Mathieu Liedloff}, title = {Exact exponential algorithms to find tropical connected sets of minimum size}, journal = {Theor. Comput. Sci.}, volume = {676}, pages = {33--41}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.03.003}, doi = {10.1016/J.TCS.2017.03.003}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/ChapelleCKLL17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKPS17, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {A linear kernel for finding square roots of almost planar graphs}, journal = {Theor. Comput. Sci.}, volume = {689}, pages = {36--47}, year = {2017}, url = {https://doi.org/10.1016/j.tcs.2017.05.008}, doi = {10.1016/J.TCS.2017.05.008}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKPS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/GolovachKS17, author = {Petr A. Golovach and Dieter Kratsch and Mohamed Yosri Sayadi}, editor = {Dimitris Fotakis and Aris Pagourtzis and Vangelis Th. Paschos}, title = {Enumeration of Maximal Irredundant Sets for Claw-Free 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 = {297--309}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-57586-5\_25}, doi = {10.1007/978-3-319-57586-5\_25}, timestamp = {Thu, 24 Mar 2022 11:08:56 +0100}, biburl = {https://dblp.org/rec/conf/ciac/GolovachKS17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/KratschLS17, author = {Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, editor = {Bernhard Steffen and Christel Baier and Mark van den Brand and Johann Eder and Mike Hinchey and Tiziana Margaria}, title = {Enumerating Minimal Tropical Connected Sets}, booktitle = {{SOFSEM} 2017: Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16-20, 2017, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {10139}, pages = {217--228}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-51963-0\_17}, doi = {10.1007/978-3-319-51963-0\_17}, timestamp = {Sun, 02 Oct 2022 16:15:51 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/KratschLS17.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} }
@inproceedings{DBLP:conf/wg/GolovachKLS17, author = {Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Mohamed Yosri Sayadi}, editor = {Hans L. Bodlaender and Gerhard J. Woeginger}, title = {Enumeration and Maximum Number of Maximal Irredundant Sets for Chordal Graphs}, 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 = {289--302}, publisher = {Springer}, year = {2017}, url = {https://doi.org/10.1007/978-3-319-68705-6\_22}, doi = {10.1007/978-3-319-68705-6\_22}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/GolovachKLS17.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/algorithmica/Cochefert0GKP16, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {Parameterized Algorithms for Finding Square Roots}, journal = {Algorithmica}, volume = {74}, number = {2}, pages = {602--629}, year = {2016}, url = {https://doi.org/10.1007/s00453-014-9967-4}, doi = {10.1007/S00453-014-9967-4}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/Cochefert0GKP16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/KratschT16, author = {Dieter Kratsch and Ioan Todinca}, title = {Guest Editorial: Selected Papers from {WG} 2014}, journal = {Algorithmica}, volume = {75}, number = {1}, pages = {186}, year = {2016}, url = {https://doi.org/10.1007/s00453-016-0135-x}, doi = {10.1007/S00453-016-0135-X}, timestamp = {Tue, 26 Jun 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/KratschT16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/0001KKPP16, author = {Matthew Johnson and Dieter Kratsch and Stefan Kratsch and Viresh Patel and Dani{\"{e}}l Paulusma}, title = {Finding Shortest Paths Between Graph Colourings}, journal = {Algorithmica}, volume = {75}, number = {2}, pages = {295--321}, year = {2016}, url = {https://doi.org/10.1007/s00453-015-0009-7}, doi = {10.1007/S00453-015-0009-7}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/0001KKPP16.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/endm/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Squares of Low Clique Number}, journal = {Electron. Notes Discret. Math.}, volume = {55}, pages = {195--198}, year = {2016}, url = {https://doi.org/10.1016/j.endm.2016.10.048}, doi = {10.1016/J.ENDM.2016.10.048}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KratschL16, author = {Dieter Kratsch and Van Bang Le}, title = {Algorithms solving the Matching Cut problem}, journal = {Theor. Comput. Sci.}, volume = {609}, pages = {328--335}, year = {2016}, url = {https://doi.org/10.1016/j.tcs.2015.10.016}, doi = {10.1016/J.TCS.2015.10.016}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KratschL16.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} }
@inproceedings{DBLP:conf/iwoca/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, editor = {Veli M{\"{a}}kinen and Simon J. Puglisi and Leena Salmela}, title = {Finding Cactus Roots in Polynomial Time}, booktitle = {Combinatorial Algorithms - 27th International Workshop, {IWOCA} 2016, Helsinki, Finland, August 17-19, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9843}, pages = {361--372}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-44543-4\_28}, doi = {10.1007/978-3-319-44543-4\_28}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/Cochefert0GK16, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Serge Gaspers and Dieter Kratsch}, editor = {Evangelos Kranakis and Gonzalo Navarro and Edgar Ch{\'{a}}vez}, title = {Faster Algorithms to Enumerate Hypergraph Transversals}, booktitle = {{LATIN} 2016: Theoretical Informatics - 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9644}, pages = {306--318}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-662-49529-2\_23}, doi = {10.1007/978-3-662-49529-2\_23}, timestamp = {Wed, 28 Feb 2024 00:16:41 +0100}, biburl = {https://dblp.org/rec/conf/latin/Cochefert0GK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/KammerKL16, author = {Frank Kammer and Dieter Kratsch and Moritz Laudahn}, editor = {Piotr Faliszewski and Anca Muscholl and Rolf Niedermeier}, title = {Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs}, booktitle = {41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland}, series = {LIPIcs}, volume = {58}, pages = {56:1--56:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.MFCS.2016.56}, doi = {10.4230/LIPICS.MFCS.2016.56}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/KammerKL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, editor = {Rasmus Pagh}, title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs}, booktitle = {15th Scandinavian Symposium and Workshops on Algorithm Theory, {SWAT} 2016, June 22-24, 2016, Reykjavik, Iceland}, series = {LIPIcs}, volume = {53}, pages = {4:1--4:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.SWAT.2016.4}, doi = {10.4230/LIPICS.SWAT.2016.4}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/swat/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/Kratsch16, author = {Dieter Kratsch}, title = {Exact Algorithms for Dominating Set}, booktitle = {Encyclopedia of Algorithms}, pages = {667--670}, year = {2016}, url = {https://doi.org/10.1007/978-1-4939-2864-4\_132}, doi = {10.1007/978-1-4939-2864-4\_132}, timestamp = {Wed, 12 Jul 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/reference/algo/Kratsch16.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/corr/KammerKL16, author = {Frank Kammer and Dieter Kratsch and Moritz Laudahn}, title = {Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs}, journal = {CoRR}, volume = {abs/1606.04679}, year = {2016}, url = {http://arxiv.org/abs/1606.04679}, eprinttype = {arXiv}, eprint = {1606.04679}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KammerKL16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/GolovachKPS16, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {A Linear Kernel for Finding Square Roots of Almost Planar Graphs}, journal = {CoRR}, volume = {abs/1608.06136}, year = {2016}, url = {http://arxiv.org/abs/1608.06136}, eprinttype = {arXiv}, eprint = {1608.06136}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/GolovachKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/Cochefert0GKPS16, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma and Anthony Stewart}, title = {Squares of Low Maximum Degree}, journal = {CoRR}, volume = {abs/1608.06142}, year = {2016}, url = {http://arxiv.org/abs/1608.06142}, eprinttype = {arXiv}, eprint = {1608.06142}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Cochefert0GKPS16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/0001GKP15, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {List Coloring in the Absence of a Linear Forest}, journal = {Algorithmica}, volume = {71}, number = {1}, pages = {21--35}, year = {2015}, url = {https://doi.org/10.1007/s00453-013-9777-0}, doi = {10.1007/S00453-013-9777-0}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/0001GKP15.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/tcs/BodlaenderKT15, author = {Hans L. Bodlaender and Dieter Kratsch and Sjoerd T. Timmer}, title = {Exact algorithms for Kayles}, journal = {Theor. Comput. Sci.}, volume = {562}, pages = {165--176}, year = {2015}, url = {https://doi.org/10.1016/j.tcs.2014.09.042}, doi = {10.1016/J.TCS.2014.09.042}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BodlaenderKT15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/KratschL15, author = {Dieter Kratsch and Van Bang Le}, editor = {Vangelis Th. Paschos and Peter Widmayer}, title = {Algorithms Solving the Matching Cut Problem}, booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015, Paris, France, May 20-22, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9079}, pages = {288--299}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-18173-8\_21}, doi = {10.1007/978-3-319-18173-8\_21}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/ciac/KratschL15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/KratschLM15, author = {Dieter Kratsch and Mathieu Liedloff and Daniel Meister}, editor = {Vangelis Th. Paschos and Peter Widmayer}, title = {End-Vertices of Graph Search Algorithms}, booktitle = {Algorithms and Complexity - 9th International Conference, {CIAC} 2015, Paris, France, May 20-22, 2015. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {9079}, pages = {300--312}, publisher = {Springer}, year = {2015}, url = {https://doi.org/10.1007/978-3-319-18173-8\_22}, doi = {10.1007/978-3-319-18173-8\_22}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/ciac/KratschLM15.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/corr/Cochefert0GK15, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Serge Gaspers and Dieter Kratsch}, title = {Faster algorithms to enumerate hypergraph transversals}, journal = {CoRR}, volume = {abs/1510.05093}, year = {2015}, url = {http://arxiv.org/abs/1510.05093}, eprinttype = {arXiv}, eprint = {1510.05093}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/Cochefert0GK15.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/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} }
@inproceedings{DBLP:conf/iwpec/ChapelleCKLL14, author = {Mathieu Chapelle and Manfred Cochefert and Dieter Kratsch and Romain Letourneur and Mathieu Liedloff}, editor = {Marek Cygan and Pinar Heggernes}, title = {Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size}, booktitle = {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}, pages = {147--158}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13524-3\_13}, doi = {10.1007/978-3-319-13524-3\_13}, timestamp = {Sat, 19 Oct 2019 20:25:35 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/ChapelleCKLL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/0002KKPP14, author = {Matthew Johnson and Dieter Kratsch and Stefan Kratsch and Viresh Patel and Dani{\"{e}}l Paulusma}, editor = {Marek Cygan and Pinar Heggernes}, title = {Finding Shortest Paths Between Graph Colourings}, booktitle = {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}, pages = {221--233}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-13524-3\_19}, doi = {10.1007/978-3-319-13524-3\_19}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/0002KKPP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sofsem/CochefertK14, author = {Manfred Cochefert and Dieter Kratsch}, editor = {Viliam Geffert and Bart Preneel and Branislav Rovan and Julius Stuller and A Min Tjoa}, title = {Exact Algorithms to Clique-Colour 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 = {187--198}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-04298-5\_17}, doi = {10.1007/978-3-319-04298-5\_17}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/sofsem/CochefertK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2014, editor = {Dieter Kratsch and Ioan Todinca}, title = {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}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-12340-0}, doi = {10.1007/978-3-319-12340-0}, isbn = {978-3-319-12339-4}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2014.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/0002KKPP14, author = {Matthew Johnson and Dieter Kratsch and Stefan Kratsch and Viresh Patel and Dani{\"{e}}l Paulusma}, title = {Colouring Reconfiguration Is Fixed-Parameter Tractable}, journal = {CoRR}, volume = {abs/1403.6347}, year = {2014}, url = {http://arxiv.org/abs/1403.6347}, eprinttype = {arXiv}, eprint = {1403.6347}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/0002KKPP14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGKLS13, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch and Daniel Lokshtanov and Saket Saurabh}, title = {Computing Optimal Steiner Trees in Polynomial Space}, journal = {Algorithmica}, volume = {65}, number = {3}, pages = {584--604}, year = {2013}, url = {https://doi.org/10.1007/s00453-012-9612-z}, doi = {10.1007/S00453-012-9612-Z}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGKLS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/BroersmaKW13, author = {Hajo Broersma and Dieter Kratsch and Gerhard J. Woeginger}, title = {Fully decomposable split graphs}, journal = {Eur. J. Comb.}, volume = {34}, number = {3}, pages = {567--575}, year = {2013}, url = {https://doi.org/10.1016/j.ejc.2011.09.044}, doi = {10.1016/J.EJC.2011.09.044}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/BroersmaKW13.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/mst/CouturierGKLP13, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Mathieu Liedloff and Artem V. Pyatkin}, title = {Colorings with few Colors: Counting, Enumeration and Combinatorial Bounds}, journal = {Theory Comput. Syst.}, volume = {52}, number = {4}, pages = {645--667}, year = {2013}, url = {https://doi.org/10.1007/s00224-012-9410-7}, doi = {10.1007/S00224-012-9410-7}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/CouturierGKLP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/GolovachKP13, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {Detecting induced minors in AT-free graphs}, journal = {Theor. Comput. Sci.}, volume = {482}, pages = {20--32}, year = {2013}, url = {https://doi.org/10.1016/j.tcs.2013.02.029}, doi = {10.1016/J.TCS.2013.02.029}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/GolovachKP13.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} }
@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/ChapelleCCKLP13, author = {Mathieu Chapelle and Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Dieter Kratsch and Mathieu Liedloff and Anthony Perez}, editor = {Thierry Lecroq and Laurent Mouchard}, title = {Exact Algorithms for Weak Roman Domination}, 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 = {81--93}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45278-9\_8}, doi = {10.1007/978-3-642-45278-9\_8}, timestamp = {Wed, 25 Sep 2019 18:08:04 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/ChapelleCCKLP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/KratschK13, author = {Dieter Kratsch and Stefan Kratsch}, editor = {Gregory Z. Gutin and Stefan Szeider}, title = {The Jump Number Problem: Exact and Parameterized}, booktitle = {Parameterized and Exact Computation - 8th International Symposium, {IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8246}, pages = {230--242}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-319-03898-8\_20}, doi = {10.1007/978-3-319-03898-8\_20}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/KratschK13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CochefertCGKP13, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and R{\"{u}}diger Reischuk}, title = {Sparse Square Roots}, 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 = {177--188}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-45043-3\_16}, doi = {10.1007/978-3-642-45043-3\_16}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CochefertCGKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/CochefertCGKP13, author = {Manfred Cochefert and Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {Parameterized Algorithms for Finding Square Roots}, journal = {CoRR}, volume = {abs/1310.5469}, year = {2013}, url = {http://arxiv.org/abs/1310.5469}, eprinttype = {arXiv}, eprint = {1310.5469}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/CochefertCGKP13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/GaspersKL12, author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff}, title = {On Independent Sets and Bicliques in Graphs}, journal = {Algorithmica}, volume = {62}, number = {3-4}, pages = {637--658}, year = {2012}, url = {https://doi.org/10.1007/s00453-010-9474-1}, doi = {10.1007/S00453-010-9474-1}, timestamp = {Wed, 17 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/GaspersKL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/CouturierK12, author = {Jean{-}Fran{\c{c}}ois Couturier and Dieter Kratsch}, title = {Bicolored independent sets and bicliques}, journal = {Inf. Process. Lett.}, volume = {112}, number = {8-9}, pages = {329--334}, year = {2012}, url = {https://doi.org/10.1016/j.ipl.2012.01.010}, doi = {10.1016/J.IPL.2012.01.010}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/CouturierK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/CouturierGKP12, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, title = {On the parameterized complexity of coloring graphs in the absence of a linear forest}, journal = {J. Discrete Algorithms}, volume = {15}, pages = {56--62}, year = {2012}, url = {https://doi.org/10.1016/j.jda.2012.04.008}, doi = {10.1016/J.JDA.2012.04.008}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/CouturierGKP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/BodlaenderFKKT12, author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos}, title = {A Note on Exact Algorithms for Vertex Ordering Problems on Graphs}, journal = {Theory Comput. Syst.}, volume = {50}, number = {3}, pages = {420--432}, year = {2012}, url = {https://doi.org/10.1007/s00224-011-9312-0}, doi = {10.1007/S00224-011-9312-0}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/BodlaenderFKKT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/BodlaenderFKKT12, author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos}, title = {On exact algorithms for treewidth}, journal = {{ACM} Trans. Algorithms}, volume = {9}, number = {1}, pages = {12:1--12:23}, year = {2012}, url = {https://doi.org/10.1145/2390176.2390188}, doi = {10.1145/2390176.2390188}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/BodlaenderFKKT12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KratschM12, author = {Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Leah Epstein and Paolo Ferragina}, title = {Colouring AT-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 = {707--718}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-33090-2\_61}, doi = {10.1007/978-3-642-33090-2\_61}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/KratschM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/GolovachKP12, author = {Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Kun{-}Mao Chao and Tsan{-}sheng Hsu and Der{-}Tsai Lee}, title = {Detecting Induced Minors in AT-Free Graphs}, booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC} 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7676}, pages = {495--505}, publisher = {Springer}, year = {2012}, url = {https://doi.org/10.1007/978-3-642-35261-4\_52}, doi = {10.1007/978-3-642-35261-4\_52}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/isaac/GolovachKP12.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/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} }
@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/HavetKKKL11, author = {Fr{\'{e}}d{\'{e}}ric Havet and Martin Klazar and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, title = {Exact Algorithms for \emph{L}(2, 1)-Labeling of Graphs}, journal = {Algorithmica}, volume = {59}, number = {2}, pages = {169--194}, year = {2011}, url = {https://doi.org/10.1007/s00453-009-9302-7}, doi = {10.1007/S00453-009-9302-7}, timestamp = {Mon, 06 Nov 2017 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/HavetKKKL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGKKL11, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, title = {Branch and Recharge: Exact Algorithms for Generalized Domination}, journal = {Algorithmica}, volume = {61}, number = {2}, pages = {252--273}, year = {2011}, url = {https://doi.org/10.1007/s00453-010-9418-9}, doi = {10.1007/S00453-010-9418-9}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGKKL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/Binkele-RaibleBCFKKLLPRW11, author = {Daniel Binkele{-}Raible and Ljiljana Brankovic and Marek Cygan and Henning Fernau and Joachim Kneis and Dieter Kratsch and Alexander Langer and Mathieu Liedloff and Marcin Pilipczuk and Peter Rossmanith and Jakub Onufry Wojtaszczyk}, title = {Breaking the 2\({}^{\mbox{n}}\)-barrier for Irredundance: Two lines of attack}, journal = {J. Discrete Algorithms}, volume = {9}, number = {3}, pages = {214--230}, year = {2011}, url = {https://doi.org/10.1016/j.jda.2011.03.002}, doi = {10.1016/J.JDA.2011.03.002}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/Binkele-RaibleBCFKKLLPRW11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FernauKKLLRR11, author = {Henning Fernau and Joachim Kneis and Dieter Kratsch and Alexander Langer and Mathieu Liedloff and Daniel Raible and Peter Rossmanith}, title = {An exact algorithm for the Maximum Leaf Spanning Tree problem}, journal = {Theor. Comput. Sci.}, volume = {412}, number = {45}, pages = {6290--6302}, year = {2011}, url = {https://doi.org/10.1016/j.tcs.2011.07.011}, doi = {10.1016/J.TCS.2011.07.011}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FernauKKLLRR11.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/colognetwente/CouturierK11, author = {Jean{-}Fran{\c{c}}ois Couturier and Dieter Kratsch}, editor = {Ludovica Adacher and Marta Flamini and Gianmaria Leo and Gaia Nicosia and Andrea Pacifici and Veronica Piccialli}, title = {Bicolored independent sets and bicliques}, booktitle = {Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011}, pages = {130--133}, year = {2011}, url = {http://ctw2011.dia.uniroma3.it/ctw\_proceedings.pdf\#page=142}, timestamp = {Thu, 12 Mar 2020 11:34:41 +0100}, biburl = {https://dblp.org/rec/conf/colognetwente/CouturierK11.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} }
@inproceedings{DBLP:conf/wg/BodlaenderK11, author = {Hans L. Bodlaender and Dieter Kratsch}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {Exact Algorithms for Kayles}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {59--70}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_7}, doi = {10.1007/978-3-642-25870-1\_7}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/CouturierGKP11, author = {Jean{-}Fran{\c{c}}ois Couturier and Petr A. Golovach and Dieter Kratsch and Dani{\"{e}}l Paulusma}, editor = {Petr Kolman and Jan Kratochv{\'{\i}}l}, title = {List Coloring in the Absence of a Linear Forest}, booktitle = {Graph-Theoretic Concepts in Computer Science - 37th International Workshop, {WG} 2011, Tepl{\'{a}} Monastery, Czech Republic, June 21-24, 2011. Revised Papers}, series = {Lecture Notes in Computer Science}, volume = {6986}, pages = {119--130}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-25870-1\_12}, doi = {10.1007/978-3-642-25870-1\_12}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/CouturierGKP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@book{DBLP:series/txtcs/FominK10, author = {Fedor V. Fomin and Dieter Kratsch}, title = {Exact Exponential Algorithms}, series = {Texts in Theoretical Computer Science. An {EATCS} Series}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16533-7}, doi = {10.1007/978-3-642-16533-7}, isbn = {978-3-642-16532-0}, timestamp = {Tue, 16 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/series/txtcs/FominK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FominGGKS10, author = {Fedor V. Fomin and Serge Gaspers and Petr A. Golovach and Dieter Kratsch and Saket Saurabh}, title = {Parameterized algorithm for eternal vertex cover}, journal = {Inf. Process. Lett.}, volume = {110}, number = {16}, pages = {702--706}, year = {2010}, url = {https://doi.org/10.1016/j.ipl.2010.05.029}, doi = {10.1016/J.IPL.2010.05.029}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FominGGKS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/FominGKLS10, author = {Fedor V. Fomin and Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Saket Saurabh}, title = {Iterative compression and exact algorithms}, journal = {Theor. Comput. Sci.}, volume = {411}, number = {7-9}, pages = {1045--1053}, year = {2010}, url = {https://doi.org/10.1016/j.tcs.2009.11.012}, doi = {10.1016/J.TCS.2009.11.012}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/FominGKLS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ciac/Binkele-RaibleBFKKLLR10, author = {Daniel Binkele{-}Raible and Ljiljana Brankovic and Henning Fernau and Joachim Kneis and Dieter Kratsch and Alexander Langer and Mathieu Liedloff and Peter Rossmanith}, editor = {Tiziana Calamoneri and Josep D{\'{\i}}az}, title = {A Parameterized Route to Exact Puzzles: Breaking the 2\({}^{\mbox{\emph{n}}}\)-Barrier for Irredundance}, 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 = {311--322}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13073-1\_28}, doi = {10.1007/978-3-642-13073-1\_28}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/ciac/Binkele-RaibleBFKKLLR10.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/wg/GolovachKC10, author = {Petr A. Golovach and Dieter Kratsch and Jean{-}Fran{\c{c}}ois Couturier}, editor = {Dimitrios M. Thilikos}, title = {Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds}, 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 = {39--50}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16926-7\_6}, doi = {10.1007/978-3-642-16926-7\_6}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/GolovachKC10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/2010P10441, editor = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin}, title = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010}, series = {Dagstuhl Seminar Proceedings}, volume = {10441}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2010}, url = {http://drops.dagstuhl.de/portals/10441/}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2010P10441.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/HusfeldtKPS10, author = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin}, editor = {Thore Husfeldt and Dieter Kratsch and Ramamohan Paturi and Gregory B. Sorkin}, title = {10441 Abstracts Collection - Exact Complexity of NP-hard Problems}, booktitle = {Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010}, series = {Dagstuhl Seminar Proceedings}, volume = {10441}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2010}, url = {http://drops.dagstuhl.de/opus/volltexte/2011/2936/}, timestamp = {Thu, 10 Jun 2021 13:02:09 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/HusfeldtKPS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschM09, author = {Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On a property of minimal triangulations}, journal = {Discret. Math.}, volume = {309}, number = {6}, pages = {1724--1729}, year = {2009}, url = {https://doi.org/10.1016/j.disc.2008.01.048}, doi = {10.1016/J.DISC.2008.01.048}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FominGKKL09, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, title = {Sort and Search: Exact algorithms for generalized domination}, journal = {Inf. Process. Lett.}, volume = {109}, number = {14}, pages = {795--798}, year = {2009}, url = {https://doi.org/10.1016/j.ipl.2009.03.023}, doi = {10.1016/J.IPL.2009.03.023}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/FominGKKL09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jacm/FominGK09, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, title = {A measure {\&} conquer approach for the analysis of exact algorithms}, journal = {J. {ACM}}, volume = {56}, number = {5}, pages = {25:1--25:32}, year = {2009}, url = {https://doi.org/10.1145/1552285.1552286}, doi = {10.1145/1552285.1552286}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jacm/FominGK09.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/talg/GaspersKLT09, author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Ioan Todinca}, title = {Exponential time algorithms for the minimum dominating set problem on some graph classes}, journal = {{ACM} Trans. Algorithms}, volume = {6}, number = {1}, pages = {9:1--9:21}, year = {2009}, url = {https://doi.org/10.1145/1644015.1644024}, doi = {10.1145/1644015.1644024}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/talg/GaspersKLT09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/KanjK09, author = {Iyad A. Kanj and Dieter Kratsch}, editor = {Hung Q. Ngo}, title = {Convex Recoloring Revisited: Complexity and Exact Algorithms}, 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 = {388--397}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02882-3\_39}, doi = {10.1007/978-3-642-02882-3\_39}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/KanjK09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/colognetwente/FernauGKLR09, author = {Henning Fernau and Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Daniel Raible}, editor = {Sonia Cafieri and Antonio Mucherino and Giacomo Nannicini and Fabien Tarissan and Leo Liberti}, title = {Exact Exponential-Time Algorithms for Finding Bicliques in a Graph}, booktitle = {Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, {CTW} 2009, Paris, France, June 2-4 2009}, pages = {205--209}, year = {2009}, url = {http://www.lix.polytechnique.fr/ctw09/ctw09-proceedings.pdf\#page=217}, timestamp = {Thu, 12 Mar 2020 11:34:41 +0100}, biburl = {https://dblp.org/rec/conf/colognetwente/FernauGKLR09.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/BroersmaKW09, author = {Hajo Broersma and Dieter Kratsch and Gerhard J. Woeginger}, editor = {Jir{\'{\i}} Fiala and Jan Kratochv{\'{\i}}l and Mirka Miller}, title = {Fully Decomposable Split 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 = {105--112}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-10217-2\_13}, doi = {10.1007/978-3-642-10217-2\_13}, timestamp = {Sat, 05 Sep 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/iwoca/BroersmaKW09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/FernauKKLLRR09, author = {Henning Fernau and Joachim Kneis and Dieter Kratsch and Alexander Langer and Mathieu Liedloff and Daniel Raible and Peter Rossmanith}, editor = {Jianer Chen and Fedor V. Fomin}, title = {An Exact Algorithm for the Maximum Leaf Spanning Tree Problem}, 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 = {161--172}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-11269-0\_13}, doi = {10.1007/978-3-642-11269-0\_13}, timestamp = {Tue, 21 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/iwpec/FernauKKLLRR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0909-4224, author = {Ljiljana Brankovic and Henning Fernau and Joachim Kneis and Dieter Kratsch and Alexander Langer and Mathieu Liedloff and Daniel Raible and Peter Rossmanith}, title = {Breaking the 2{\^{}}n-Barrier for Irredundance: {A} Parameterized Route to Solving Exact Puzzles}, journal = {CoRR}, volume = {abs/0909.4224}, year = {2009}, url = {http://arxiv.org/abs/0909.4224}, eprinttype = {arXiv}, eprint = {0909.4224}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0909-4224.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/FominGK08, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, title = {Solving Connected Dominating Set Faster than 2\({}^{\mbox{ \emph{n} }}\)}, journal = {Algorithmica}, volume = {52}, number = {2}, pages = {153--166}, year = {2008}, url = {https://doi.org/10.1007/s00453-007-9145-z}, doi = {10.1007/S00453-007-9145-Z}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/FominGK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KratschMT08, author = {Dieter Kratsch and Haiko M{\"{u}}ller and Ioan Todinca}, title = {Feedback vertex set on AT-free graphs}, journal = {Discret. Appl. Math.}, volume = {156}, number = {10}, pages = {1936--1947}, year = {2008}, url = {https://doi.org/10.1016/j.dam.2007.10.006}, doi = {10.1016/J.DAM.2007.10.006}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KratschMT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschSS08, author = {Dieter Kratsch and Jeremy P. Spinrad and R. Sritharan}, title = {A new characterization of HH-free graphs}, journal = {Discret. Math.}, volume = {308}, number = {20}, pages = {4833--4835}, year = {2008}, url = {https://doi.org/10.1016/j.disc.2007.08.063}, doi = {10.1016/J.DISC.2007.08.063}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschSS08.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/esa/FominGK08, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, editor = {Dan Halperin and Kurt Mehlhorn}, title = {Faster Steiner Tree Computation in Polynomial-Space}, booktitle = {Algorithms - {ESA} 2008, 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5193}, pages = {430--441}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-87744-8\_36}, doi = {10.1007/978-3-540-87744-8\_36}, timestamp = {Sun, 02 Jun 2019 21:14:36 +0200}, biburl = {https://dblp.org/rec/conf/esa/FominGK08.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/FominGKLS08, author = {Fedor V. Fomin and Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Saket Saurabh}, editor = {Edward Ochmanski and Jerzy Tyszkiewicz}, title = {Iterative Compression and Exact Algorithms}, 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 = {335--346}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85238-4\_27}, doi = {10.1007/978-3-540-85238-4\_27}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/FominGKLS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/GaspersKL08, author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff}, editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani{\"{e}}l Paulusma}, title = {On Independent Sets and Bicliques in 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 = {171--182}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-92248-3\_16}, doi = {10.1007/978-3-540-92248-3\_16}, timestamp = {Sun, 25 Oct 2020 23:07:56 +0100}, biburl = {https://dblp.org/rec/conf/wg/GaspersKL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/2008P8431, editor = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, title = {Moderately Exponential Time Algorithms, 19.10. - 24.10.2008}, series = {Dagstuhl Seminar Proceedings}, volume = {08431}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {http://drops.dagstuhl.de/portals/08431/}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2008P8431.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:reference/algo/Kratsch08, author = {Dieter Kratsch and Fedor V. Fomin and Fabrizio Grandoni}, editor = {Ming{-}Yang Kao}, title = {Exact Algorithms for Dominating Set}, booktitle = {Encyclopedia of Algorithms - 2008 Edition}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-0-387-30162-4\_132}, doi = {10.1007/978-0-387-30162-4\_132}, timestamp = {Thu, 27 Jun 2019 16:25:31 +0200}, biburl = {https://dblp.org/rec/reference/algo/Kratsch08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/FominIK08, author = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, editor = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, title = {08431 Abstracts Collection - Moderately Exponential Time Algorithms}, booktitle = {Moderately Exponential Time Algorithms, 19.10. - 24.10.2008}, series = {Dagstuhl Seminar Proceedings}, volume = {08431}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {http://drops.dagstuhl.de/opus/volltexte/2008/1800/}, timestamp = {Thu, 10 Jun 2021 13:02:06 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/FominIK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/FominIK08a, author = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, editor = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, title = {08431 Executive Summary - Moderately Exponential Time Algorithms}, booktitle = {Moderately Exponential Time Algorithms, 19.10. - 24.10.2008}, series = {Dagstuhl Seminar Proceedings}, volume = {08431}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {http://drops.dagstuhl.de/opus/volltexte/2008/1797/}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/FominIK08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/FominIKKKKORW08, author = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch and Petteri Kaski and Mikko Koivisto and Lukasz Kowalik and Yoshio Okamoto and Johan M. M. van Rooij and Ryan Williams}, editor = {Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch}, title = {08431 Open Problems - Moderately Exponential Time Algorithms}, booktitle = {Moderately Exponential Time Algorithms, 19.10. - 24.10.2008}, series = {Dagstuhl Seminar Proceedings}, volume = {08431}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {http://drops.dagstuhl.de/opus/volltexte/2008/1798/}, timestamp = {Thu, 23 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/FominIKKKKORW08.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} }
@article{DBLP:journals/tcs/KratschL07, author = {Dieter Kratsch and Mathieu Liedloff}, title = {An exact algorithm for the minimum dominating clique problem}, journal = {Theor. Comput. Sci.}, volume = {385}, number = {1-3}, pages = {226--240}, year = {2007}, url = {https://doi.org/10.1016/j.tcs.2007.06.014}, doi = {10.1016/J.TCS.2007.06.014}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KratschL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/KratochvilKL07, author = {Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, editor = {Ludek Kucera and Anton{\'{\i}}n Kucera}, title = {Exact Algorithms for \emph{L} (2, 1)-Labeling of Graphs}, booktitle = {Mathematical Foundations of Computer Science 2007, 32nd International Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic, August 26-31, 2007, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4708}, pages = {513--524}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74456-6\_46}, doi = {10.1007/978-3-540-74456-6\_46}, timestamp = {Fri, 30 Aug 2019 10:02:28 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/KratochvilKL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wads/FominGKKL07, author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Mathieu Liedloff}, editor = {Frank K. H. A. Dehne and J{\"{o}}rg{-}R{\"{u}}diger Sack and Norbert Zeh}, title = {Branch and Recharge: Exact Algorithms for Generalized Domination}, 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 = {507--518}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-73951-7\_44}, doi = {10.1007/978-3-540-73951-7\_44}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/wads/FominGKKL07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/dagstuhl/2007P7211, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad}, title = {Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007}, series = {Dagstuhl Seminar Proceedings}, volume = {07211}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2007}, url = {http://drops.dagstuhl.de/portals/07211/}, timestamp = {Thu, 10 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7211.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2007, editor = {Andreas Brandst{\"{a}}dt and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {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}, publisher = {Springer}, year = {2007}, url = {https://doi.org/10.1007/978-3-540-74839-7}, doi = {10.1007/978-3-540-74839-7}, isbn = {978-3-540-74838-0}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2007.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/BrandstadtJKS07, author = {Andreas Brandst{\"{a}}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad}, editor = {Andreas Brandst{\"{a}}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad}, title = {07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes}, booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007}, series = {Dagstuhl Seminar Proceedings}, volume = {07211}, publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany}, year = {2007}, url = {http://drops.dagstuhl.de/opus/volltexte/2007/1269}, timestamp = {Thu, 10 Jun 2021 13:02:07 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/BrandstadtJKS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KloksKLL06, author = {Ton Kloks and Dieter Kratsch and Chuan{-}Min Lee and Jiping Liu}, title = {Improved bottleneck domination algorithms}, journal = {Discret. Appl. Math.}, volume = {154}, number = {11}, pages = {1578--1592}, year = {2006}, url = {https://doi.org/10.1016/j.dam.2006.02.003}, doi = {10.1016/J.DAM.2006.02.003}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KloksKLL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschS06, author = {Dieter Kratsch and Jeremy P. Spinrad}, title = {Minimal fill in O(\emph{n}\({}^{\mbox{2.69}}\)) time}, journal = {Discret. Math.}, volume = {306}, number = {3}, pages = {366--371}, year = {2006}, url = {https://doi.org/10.1016/j.disc.2005.12.009}, doi = {10.1016/J.DISC.2005.12.009}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KratschS06, author = {Dieter Kratsch and Jeremy P. Spinrad}, title = {Between O(nm) and O(n\({}^{\mbox{alpha}}\))}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {2}, pages = {310--325}, year = {2006}, url = {https://doi.org/10.1137/S0097539704441435}, doi = {10.1137/S0097539704441435}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KratschS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KratschMMS06, author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy P. Spinrad}, title = {Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {2}, pages = {326--353}, year = {2006}, url = {https://doi.org/10.1137/S0097539703437855}, doi = {10.1137/S0097539703437855}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KratschMMS06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/BodlaenderFKKT06, author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos}, editor = {Yossi Azar and Thomas Erlebach}, title = {On Exact Algorithms for Treewidth}, booktitle = {Algorithms - {ESA} 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4168}, pages = {672--683}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11841036\_60}, doi = {10.1007/11841036\_60}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/esa/BodlaenderFKKT06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fsttcs/FominGK06, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, editor = {S. Arun{-}Kumar and Naveen Garg}, title = {Solving Connected Dominating Set Faster Than 2\({}^{\mbox{\emph{n}}}\)}, booktitle = {{FSTTCS} 2006: Foundations of Software Technology and Theoretical Computer Science, 26th International Conference, Kolkata, India, December 13-15, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4337}, pages = {152--163}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11944836\_16}, doi = {10.1007/11944836\_16}, timestamp = {Tue, 29 Dec 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/fsttcs/FominGK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/iwpec/KratschL06, author = {Dieter Kratsch and Mathieu Liedloff}, editor = {Hans L. Bodlaender and Michael A. Langston}, title = {An Exact Algorithm for the Minimum Dominating Clique Problem}, booktitle = {Parameterized and Exact Computation, Second International Workshop, {IWPEC} 2006, Z{\"{u}}rich, Switzerland, September 13-15, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4169}, pages = {130--141}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11847250\_12}, doi = {10.1007/11847250\_12}, timestamp = {Tue, 14 May 2019 10:00:45 +0200}, biburl = {https://dblp.org/rec/conf/iwpec/KratschL06.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} }
@inproceedings{DBLP:conf/soda/FominGK06, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, title = {Measure and conquer: a simple O(2\({}^{\mbox{0.288\emph{n}}}\)) independent set algorithm}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {18--25}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109560}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/soda/FominGK06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/swat/GaspersKL06, author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff}, editor = {Lars Arge and Rusins Freivalds}, title = {Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes}, booktitle = {Algorithm Theory - {SWAT} 2006, 10th ScandinavianWorkshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {4059}, pages = {148--159}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11785293\_16}, doi = {10.1007/11785293\_16}, timestamp = {Tue, 14 May 2019 10:00:39 +0200}, biburl = {https://dblp.org/rec/conf/swat/GaspersKL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BrandstadtK05, author = {Andreas Brandst{\"{a}}dt and Dieter Kratsch}, title = {On the structure of (\emph{P}\({}_{\mbox{5}}\), gem)-free graphs}, journal = {Discret. Appl. Math.}, volume = {145}, number = {2}, pages = {155--166}, year = {2005}, url = {https://doi.org/10.1016/j.dam.2004.01.009}, doi = {10.1016/J.DAM.2004.01.009}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BrandstadtK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eatcs/FominGK05, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, title = {Some New Techniques in Design and Analysis of Exact (Exponential) Algorithms}, journal = {Bull. {EATCS}}, volume = {87}, pages = {47--77}, year = {2005}, timestamp = {Thu, 18 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eatcs/FominGK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BodlaenderBKRS05, author = {Hans L. Bodlaender and Andreas Brandst{\"{a}}dt and Dieter Kratsch and Micha{\"{e}}l Rao and Jeremy P. Spinrad}, title = {On algorithms for (\emph{P}\({}_{\mbox{5}}\), gem)-free graphs}, journal = {Theor. Comput. Sci.}, volume = {349}, number = {1}, pages = {2--21}, year = {2005}, url = {https://doi.org/10.1016/j.tcs.2005.09.026}, doi = {10.1016/J.TCS.2005.09.026}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BodlaenderBKRS05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/ChangKKLP05, author = {Maw{-}Shang Chang and Ton Kloks and Dieter Kratsch and Jiping Liu and Sheng{-}Lung Peng}, editor = {Lusheng Wang}, title = {On the Recognition of Probe Graphs of Some Self-Complementary Classes of Perfect Graphs}, booktitle = {Computing and Combinatorics, 11th Annual International Conference, {COCOON} 2005, Kunming, China, August 16-29, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3595}, pages = {808--817}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11533719\_82}, doi = {10.1007/11533719\_82}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/ChangKKLP05.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/icalp/FominGK05, author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and Catuscia Palamidessi and Moti Yung}, title = {Measure and Conquer: Domination - {A} Case Study}, booktitle = {Automata, Languages and Programming, 32nd International Colloquium, {ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3580}, pages = {191--203}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11523468\_16}, doi = {10.1007/11523468\_16}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FominGK05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/wg/2005, editor = {Dieter Kratsch}, title = {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}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/11604686}, doi = {10.1007/11604686}, isbn = {3-540-31000-2}, timestamp = {Tue, 14 May 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/2005.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FominKM04, author = {Fedor V. Fomin and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Algorithms for graphs with small octopus}, journal = {Discret. Appl. Math.}, volume = {134}, number = {1-3}, pages = {105--128}, year = {2004}, url = {https://doi.org/10.1016/S0166-218X(03)00298-1}, doi = {10.1016/S0166-218X(03)00298-1}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FominKM04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BouchitteKMT04, author = {Vincent Bouchitt{\'{e}} and Dieter Kratsch and Haiko M{\"{u}}ller and Ioan Todinca}, title = {On treewidth approximations}, journal = {Discret. Appl. Math.}, volume = {136}, number = {2-3}, pages = {183--196}, year = {2004}, url = {https://doi.org/10.1016/S0166-218X(03)00440-2}, doi = {10.1016/S0166-218X(03)00440-2}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BouchitteKMT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/FominKT04, author = {Fedor V. Fomin and Dieter Kratsch and Ioan Todinca}, editor = {Josep D{\'{\i}}az and Juhani Karhum{\"{a}}ki and Arto Lepist{\"{o}} and Donald Sannella}, title = {Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In}, booktitle = {Automata, Languages and Programming: 31st International Colloquium, {ICALP} 2004, Turku, Finland, July 12-16, 2004. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3142}, pages = {568--580}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-27836-8\_49}, doi = {10.1007/978-3-540-27836-8\_49}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/FominKT04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominKW04, author = {Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger}, editor = {Juraj Hromkovic and Manfred Nagl and Bernhard Westfechtel}, title = {Exact (Exponential) Algorithms for the Dominating Set Problem}, 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 = {245--256}, publisher = {Springer}, year = {2004}, url = {https://doi.org/10.1007/978-3-540-30559-0\_21}, doi = {10.1007/978-3-540-30559-0\_21}, timestamp = {Tue, 14 May 2019 10:00:40 +0200}, biburl = {https://dblp.org/rec/conf/wg/FominKW04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/FominKM03, author = {Fedor V. Fomin and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On the Domination Search Number}, journal = {Discret. Appl. Math.}, volume = {127}, number = {3}, pages = {565--580}, year = {2003}, url = {https://doi.org/10.1016/S0166-218X(02)00389-X}, doi = {10.1016/S0166-218X(02)00389-X}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/FominKM03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/BodlaenderBKRS03, author = {Hans L. Bodlaender and Andreas Brandst{\"{a}}dt and Dieter Kratsch and Micha{\"{e}}l Rao and Jeremy P. Spinrad}, editor = {Andrzej Lingas and Bengt J. Nilsson}, title = {Linear Time Algorithms for Some NP-Complete Problems on (P\({}_{\mbox{5}}\), Gem)-Free Graphs}, 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 = {61--72}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45077-1\_7}, doi = {10.1007/978-3-540-45077-1\_7}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/BodlaenderBKRS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KratschMMS03, author = {Dieter Kratsch and Ross M. McConnell and Kurt Mehlhorn and Jeremy P. Spinrad}, title = {Certifying algorithms for recognizing interval graphs and permutation graphs}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {158--167}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644137}, timestamp = {Wed, 01 Apr 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/KratschMMS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KratschS03, author = {Dieter Kratsch and Jeremy P. Spinrad}, title = {Between O(nm) and O(n alpha)}, booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}}, pages = {709--716}, publisher = {{ACM/SIAM}}, year = {2003}, url = {http://dl.acm.org/citation.cfm?id=644108.644225}, timestamp = {Wed, 01 Apr 2015 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/KratschS03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KratschMT03, author = {Dieter Kratsch and Haiko M{\"{u}}ller and Ioan Todinca}, editor = {Hans L. Bodlaender}, title = {Feedback Vertex Set and Longest Induced Path on AT-Free Graphs}, 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 = {309--321}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-39890-5\_27}, doi = {10.1007/978-3-540-39890-5\_27}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KratschMT03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/algorithmica/BroersmaKKM02, author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {A Generalization of AT-Free Graphs and a Generic Algorithm for Solving Triangulation Problems}, journal = {Algorithmica}, volume = {32}, number = {4}, pages = {594--610}, year = {2002}, url = {https://doi.org/10.1007/s00453-001-0091-x}, doi = {10.1007/S00453-001-0091-X}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/algorithmica/BroersmaKKM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/HempelK02, author = {Harald Hempel and Dieter Kratsch}, title = {On claw-free asteroidal triple-free graphs}, journal = {Discret. Appl. Math.}, volume = {121}, number = {1-3}, pages = {155--180}, year = {2002}, url = {https://doi.org/10.1016/S0166-218X(01)00208-6}, doi = {10.1016/S0166-218X(01)00208-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/HempelK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/FominKN02, author = {Fedor V. Fomin and Dieter Kratsch and Jean{-}Christophe Novelli}, title = {Approximating minimum cocolorings}, journal = {Inf. Process. Lett.}, volume = {84}, number = {5}, pages = {285--290}, year = {2002}, url = {https://doi.org/10.1016/S0020-0190(02)00288-0}, doi = {10.1016/S0020-0190(02)00288-0}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/FominKN02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/BodlaenderK02, author = {Hans L. Bodlaender and Dieter Kratsch}, title = {Kayles and Nimbers}, journal = {J. Algorithms}, volume = {43}, number = {1}, pages = {106--119}, year = {2002}, url = {https://doi.org/10.1006/jagm.2002.1215}, doi = {10.1006/JAGM.2002.1215}, timestamp = {Sun, 02 Jun 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/BodlaenderK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/DeogunK02, author = {Jitender S. Deogun and Dieter Kratsch}, title = {Dominating Pair Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {15}, number = {3}, pages = {353--366}, year = {2002}, url = {https://doi.org/10.1137/S0895480100367111}, doi = {10.1137/S0895480100367111}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/DeogunK02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KratschS02, author = {Dieter Kratsch and Lorna Stewart}, title = {Approximating Bandwidth by Mixing Layouts of Interval Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {15}, number = {4}, pages = {435--449}, year = {2002}, url = {https://doi.org/10.1137/S0895480199359624}, doi = {10.1137/S0895480199359624}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KratschS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BabelKKKMO01, author = {Luitpold Babel and Ton Kloks and Jan Kratochv{\'{\i}}l and Dieter Kratsch and Haiko M{\"{u}}ller and Stephan Olariu}, title = {Efficient algorithms for graphs with few \emph{P}\({}_{\mbox{4}}\)'s}, journal = {Discret. Math.}, volume = {235}, number = {1-3}, pages = {29--51}, year = {2001}, url = {https://doi.org/10.1016/S0012-365X(00)00258-2}, doi = {10.1016/S0012-365X(00)00258-2}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BabelKKKMO01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/BouchitteKMT01, author = {Vincent Bouchitt{\'{e}} and Dieter Kratsch and Haiko M{\"{u}}ller and Ioan Todinca}, title = {On treewidth approximations}, journal = {Electron. Notes Discret. Math.}, volume = {8}, pages = {98--101}, year = {2001}, url = {https://doi.org/10.1016/S1571-0653(05)80091-5}, doi = {10.1016/S1571-0653(05)80091-5}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/BouchitteKMT01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/KloksKM01, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On the Structure of Graphs with Bounded Asteroidal Number}, journal = {Graphs Comb.}, volume = {17}, number = {2}, pages = {295--306}, year = {2001}, url = {https://doi.org/10.1007/s003730170043}, doi = {10.1007/S003730170043}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/gc/KloksKM01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/FominKN01, author = {Fedor V. Fomin and Dieter Kratsch and Jean{-}Christophe Novelli}, editor = {Rusins Freivalds}, title = {Approximating Minimum Cocolourings}, booktitle = {Fundamentals of Computation Theory, 13th International Symposium, {FCT} 2001, Riga, Latvia, August 22-24, 2001, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2138}, pages = {118--125}, publisher = {Springer}, year = {2001}, url = {https://doi.org/10.1007/3-540-44669-9\_13}, doi = {10.1007/3-540-44669-9\_13}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/FominKN01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/Kratsch00, author = {Dieter Kratsch}, title = {Domination and Total Domination on Asteroidal Triple-free Graphs}, journal = {Discret. Appl. Math.}, volume = {99}, number = {1-3}, pages = {111--123}, year = {2000}, url = {https://doi.org/10.1016/S0166-218X(99)00128-6}, doi = {10.1016/S0166-218X(99)00128-6}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/Kratsch00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/BauerKKV00, author = {Douglas Bauer and Gyula Y. Katona and Dieter Kratsch and Henk Jan Veldman}, title = {Chordality and 2-factors in Tough Graphs}, journal = {Discret. Appl. Math.}, volume = {99}, number = {1-3}, pages = {323--329}, year = {2000}, url = {https://doi.org/10.1016/S0166-218X(99)00142-0}, doi = {10.1016/S0166-218X(99)00142-0}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/BauerKKV00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KloksKM00, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Finding and counting small induced subgraphs efficiently}, journal = {Inf. Process. Lett.}, volume = {74}, number = {3-4}, pages = {115--121}, year = {2000}, url = {https://doi.org/10.1016/S0020-0190(00)00047-8}, doi = {10.1016/S0020-0190(00)00047-8}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/KloksKM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/networks/BroersmaKTHKKM00, author = {Hajo Broersma and Otto R. Koppius and Hilde Tuinstra and Andreas Huck and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Degree-preserving trees}, journal = {Networks}, volume = {35}, number = {1}, pages = {26--39}, year = {2000}, url = {https://doi.org/10.1002/(SICI)1097-0037(200001)35:1\&\#60;26::AID-NET3\&\#62;3.0.CO;2-M}, doi = {10.1002/(SICI)1097-0037(200001)35:1\&\#60;26::AID-NET3\&\#62;3.0.CO;2-M}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/networks/BroersmaKTHKKM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/FominKM00, author = {Fedor V. Fomin and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {On the Domination Search Number}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {161--171}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_16}, doi = {10.1007/3-540-40064-8\_16}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/FominKM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKBM00, author = {Ton Kloks and Dieter Kratsch and Yvan Le Borgne and Haiko M{\"{u}}ller}, editor = {Ulrik Brandes and Dorothea Wagner}, title = {Bandwidth of Split and Circular Permutation Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 26th International Workshop, {WG} 2000, Konstanz, Germany, June 15-17, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1928}, pages = {243--254}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-40064-8\_23}, doi = {10.1007/3-540-40064-8\_23}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksKBM00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/DeogunKKM99, author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs}, journal = {Discret. Appl. Math.}, volume = {98}, number = {1-2}, pages = {39--63}, year = {1999}, url = {https://doi.org/10.1016/S0166-218X(99)00179-1}, doi = {10.1016/S0166-218X(99)00179-1}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/DeogunKKM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KloksKM99, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {On the structure of graphs with bounded asteroidal number}, journal = {Electron. Notes Discret. Math.}, volume = {3}, pages = {94}, year = {1999}, url = {https://doi.org/10.1016/S1571-0653(05)80032-0}, doi = {10.1016/S1571-0653(05)80032-0}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KloksKM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/endm/KratschS99, author = {Dieter Kratsch and Lorna Stewart}, title = {Approximating Bandwidth by Mixing Layouts of Interval Graphs}, journal = {Electron. Notes Discret. Math.}, volume = {3}, pages = {106--109}, year = {1999}, url = {https://doi.org/10.1016/S1571-0653(05)80035-6}, doi = {10.1016/S1571-0653(05)80035-6}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/endm/KratschS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KloksKM99, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Approximating the Bandwidth for Asteroidal Triple-Free Graphs}, journal = {J. Algorithms}, volume = {32}, number = {1}, pages = {41--57}, year = {1999}, url = {https://doi.org/10.1006/jagm.1998.0997}, doi = {10.1006/JAGM.1998.0997}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/KloksKM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BroersmaKKM99, author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Independent Sets in Asteroidal Triple-Free Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {12}, number = {2}, pages = {276--287}, year = {1999}, url = {https://doi.org/10.1137/S0895480197326346}, doi = {10.1137/S0895480197326346}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/BroersmaKKM99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KratschS99, author = {Dieter Kratsch and Lorna Stewart}, editor = {Christoph Meinel and Sophie Tison}, title = {Approximating Bandwidth by Mixing Layouts of Interval Graphs}, booktitle = {{STACS} 99, 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, March 4-6, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1563}, pages = {248--258}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-49116-3\_23}, doi = {10.1007/3-540-49116-3\_23}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KratschS99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/HempelK99, author = {Harald Hempel and Dieter Kratsch}, editor = {Peter Widmayer and Gabriele Neyer and Stephan J. Eidenbenz}, title = {On Claw-Free Asteroidal Triple-Free Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop, {WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1665}, pages = {377--390}, publisher = {Springer}, year = {1999}, url = {https://doi.org/10.1007/3-540-46784-X\_35}, doi = {10.1007/3-540-46784-X\_35}, timestamp = {Wed, 11 Sep 2019 13:15:53 +0200}, biburl = {https://dblp.org/rec/conf/wg/HempelK99.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschR98, author = {Dieter Kratsch and Jean{-}Xavier Rampon}, title = {Tree-visibility orders}, journal = {Discret. Math.}, volume = {190}, number = {1-3}, pages = {163--175}, year = {1998}, url = {https://doi.org/10.1016/S0012-365X(98)00041-7}, doi = {10.1016/S0012-365X(98)00041-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschR98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KloksKM98, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Bandwidth of Chain Graphs}, journal = {Inf. Process. Lett.}, volume = {68}, number = {6}, pages = {313--315}, year = {1998}, url = {https://doi.org/10.1016/S0020-0190(98)00173-2}, doi = {10.1016/S0020-0190(98)00173-2}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/KloksKM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KloksKW98, author = {Ton Kloks and Dieter Kratsch and C. K. Wong}, title = {Minimum Fill-in on Circle and Circular-Arc Graphs}, journal = {J. Algorithms}, volume = {28}, number = {2}, pages = {272--289}, year = {1998}, url = {https://doi.org/10.1006/jagm.1998.0936}, doi = {10.1006/JAGM.1998.0936}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jal/KloksKW98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgaa/BodlaenderKKM98, author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, title = {Treewidth and Minimum Fill-in on d-Trapezoid Graphs}, journal = {J. Graph Algorithms Appl.}, volume = {2}, number = {5}, pages = {1--23}, year = {1998}, url = {https://doi.org/10.7155/jgaa.00008}, doi = {10.7155/JGAA.00008}, timestamp = {Mon, 03 Jan 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jgaa/BodlaenderKKM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KloksK98, author = {Ton Kloks and Dieter Kratsch}, title = {Listing All Minimal Separators of a Graph}, journal = {{SIAM} J. Comput.}, volume = {27}, number = {3}, pages = {605--613}, year = {1998}, url = {https://doi.org/10.1137/S009753979427087X}, doi = {10.1137/S009753979427087X}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KloksK98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BodlaenderDJKKMT98, author = {Hans L. Bodlaender and Jitender S. Deogun and Klaus Jansen and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller and Zsolt Tuza}, title = {Rankings of Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {11}, number = {1}, pages = {168--181}, year = {1998}, url = {https://doi.org/10.1137/S0895480195282550}, doi = {10.1137/S0895480195282550}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderDJKKMT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mfcs/BroersmaHKKKMT98, author = {Hajo Broersma and Andreas Huck and Ton Kloks and Otto R. Koppius and Dieter Kratsch and Haiko M{\"{u}}ller and Hilde Tuinstra}, editor = {Lubos Brim and Jozef Gruska and Jir{\'{\i}} Zlatuska}, title = {Degree-Preserving Forests}, booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1450}, pages = {713--721}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/BFb0055822}, doi = {10.1007/BFB0055822}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/mfcs/BroersmaHKKKMT98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BroersmaKKM98, author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Juraj Hromkovic and Ondrej S{\'{y}}kora}, title = {A Generalization of AT-free Graphs and a Generic Algorithm for Solving Treewidth, Minimum Fill-In and Vertex Ranking}, booktitle = {Graph-Theoretic Concepts in Computer Science, 24th International Workshop, {WG} '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1517}, pages = {88--99}, publisher = {Springer}, year = {1998}, url = {https://doi.org/10.1007/10692760\_8}, doi = {10.1007/10692760\_8}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BroersmaKKM98.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/KratschKM97, author = {Dieter Kratsch and Ton Kloks and Haiko M{\"{u}}ller}, title = {Measuring the Vulnerability for Classes of Intersection Graphs}, journal = {Discret. Appl. Math.}, volume = {77}, number = {3}, pages = {259--270}, year = {1997}, url = {https://doi.org/10.1016/S0166-218X(96)00133-3}, doi = {10.1016/S0166-218X(96)00133-3}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/KratschKM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DeogunKS97, author = {Jitender S. Deogun and Dieter Kratsch and George Steiner}, title = {1-Tough cocomparability graphs are hamiltonian}, journal = {Discret. Math.}, volume = {170}, number = {1-3}, pages = {99--106}, year = {1997}, url = {https://doi.org/10.1016/0012-365X(95)00359-5}, doi = {10.1016/0012-365X(95)00359-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DeogunKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DeogunKS97, author = {Jitender S. Deogun and Dieter Kratsch and George Steiner}, title = {An Approximation Algorithm for Clustering Graphs with Dominating Diametral Path}, journal = {Inf. Process. Lett.}, volume = {61}, number = {3}, pages = {121--127}, year = {1997}, url = {https://doi.org/10.1016/S0020-0190(97)81663-8}, doi = {10.1016/S0020-0190(97)81663-8}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/DeogunKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KratschS97, author = {Dieter Kratsch and Lorna Stewart}, title = {Total Domination and Transformation}, journal = {Inf. Process. Lett.}, volume = {63}, number = {3}, pages = {167--170}, year = {1997}, url = {https://doi.org/10.1016/S0020-0190(97)00115-4}, doi = {10.1016/S0020-0190(97)00115-4}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KratschS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/KloksKS97, author = {Ton Kloks and Dieter Kratsch and Jeremy P. Spinrad}, title = {On Treewidth and Minimum Fill-In of Asteroidal Triple-Free Graphs}, journal = {Theor. Comput. Sci.}, volume = {175}, number = {2}, pages = {309--335}, year = {1997}, url = {https://doi.org/10.1016/S0304-3975(96)00206-X}, doi = {10.1016/S0304-3975(96)00206-X}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/KloksKS97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BroersmaKKM97, author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti{-}Spaccamela}, title = {Independent Sets in Asteroidal Triple-Free Graphs}, booktitle = {Automata, Languages and Programming, 24th International Colloquium, ICALP'97, Bologna, Italy, 7-11 July 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1256}, pages = {760--770}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/3-540-63165-8\_229}, doi = {10.1007/3-540-63165-8\_229}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/icalp/BroersmaKKM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKM97, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Rolf H. M{\"{o}}hring}, title = {Asteroidal Sets in Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, {WG} '97, Berlin, Germany, June 18-20, 1997, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1335}, pages = {229--241}, publisher = {Springer}, year = {1997}, url = {https://doi.org/10.1007/BFb0024501}, doi = {10.1007/BFB0024501}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksKM97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschLM96, author = {Dieter Kratsch and Jen{\"{o}} Lehel and Haiko M{\"{u}}ller}, title = {Toughness, hamiltonicity and split graphs}, journal = {Discret. Math.}, volume = {150}, number = {1-3}, pages = {231--245}, year = {1996}, url = {https://doi.org/10.1016/0012-365X(95)00190-8}, doi = {10.1016/0012-365X(95)00190-8}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschLM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschR96, author = {Dieter Kratsch and Jean{-}Xavier Rampon}, title = {Width two posets are reconstructible}, journal = {Discret. Math.}, volume = {162}, number = {1-3}, pages = {305--310}, year = {1996}, url = {https://doi.org/10.1016/0012-365X(95)00295-8}, doi = {10.1016/0012-365X(95)00295-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschR96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/GyarfasKLM96, author = {Andr{\'{a}}s Gy{\'{a}}rf{\'{a}}s and Dieter Kratsch and Jen{\"{o}} Lehel and Fr{\'{e}}d{\'{e}}ric Maffray}, title = {Minimal non-neighborhood-perfect graphs}, journal = {J. Graph Theory}, volume = {21}, number = {1}, pages = {55--66}, year = {1996}, url = {https://doi.org/10.1002/(SICI)1097-0118(199601)21:1\&\#60;55::AID-JGT8\&\#62;3.0.CO;2-L}, doi = {10.1002/(SICI)1097-0118(199601)21:1\&\#60;55::AID-JGT8\&\#62;3.0.CO;2-L}, timestamp = {Fri, 02 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/GyarfasKLM96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KloksKW96, author = {Ton Kloks and Dieter Kratsch and C. K. Wong}, editor = {Friedhelm Meyer auf der Heide and Burkhard Monien}, title = {Minimum Fill-In on Circle and Circular-Arc Graphs}, booktitle = {Automata, Languages and Programming, 23rd International Colloquium, ICALP96, Paderborn, Germany, 8-12 July 1996, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1099}, pages = {256--267}, publisher = {Springer}, year = {1996}, url = {https://doi.org/10.1007/3-540-61440-0\_133}, doi = {10.1007/3-540-61440-0\_133}, timestamp = {Tue, 14 May 2019 10:00:44 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KloksKW96.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/KloksK95, author = {Ton Kloks and Dieter Kratsch}, title = {Computing a Perfect Edge Without Vertex Elimination Ordering of a Chordal Bipartite Graph}, journal = {Inf. Process. Lett.}, volume = {55}, number = {1}, pages = {11--16}, year = {1995}, url = {https://doi.org/10.1016/0020-0190(95)00027-A}, doi = {10.1016/0020-0190(95)00027-A}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ipl/KloksK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jal/KloksK95, author = {Ton Kloks and Dieter Kratsch}, title = {Treewidth of Chordal Bipartite Graphs}, journal = {J. Algorithms}, volume = {19}, number = {2}, pages = {266--281}, year = {1995}, url = {https://doi.org/10.1006/jagm.1995.1037}, doi = {10.1006/JAGM.1995.1037}, timestamp = {Sun, 28 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jal/KloksK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/BodlaenderKK95, author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch}, title = {Treewidth and Pathwidth of Permutation Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {8}, number = {4}, pages = {606--616}, year = {1995}, url = {https://doi.org/10.1137/S089548019223992X}, doi = {10.1137/S089548019223992X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderKK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KloksKM95, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Paul G. Spirakis}, title = {Approximating the Bandwidth for Asteroidal Triple-Free Graphs}, booktitle = {Algorithms - {ESA} '95, Third Annual European Symposium, Corfu, Greece, September 25-27, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {979}, pages = {434--447}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60313-1\_161}, doi = {10.1007/3-540-60313-1\_161}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/KloksKM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKM95, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Manfred Nagl}, title = {Finding and Counting Small Induced Subgraphs Efficiently}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {14--23}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_62}, doi = {10.1007/3-540-60618-1\_62}, timestamp = {Thu, 14 Oct 2021 10:32:32 +0200}, biburl = {https://dblp.org/rec/conf/wg/KloksKM95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/DeogunK95, author = {Jitender S. Deogun and Dieter Kratsch}, editor = {Manfred Nagl}, title = {Diametral Path Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 21st International Workshop, {WG} '95, Aachen, Germany, June 20-22, 1995, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1017}, pages = {344--357}, publisher = {Springer}, year = {1995}, url = {https://doi.org/10.1007/3-540-60618-1\_87}, doi = {10.1007/3-540-60618-1\_87}, timestamp = {Mon, 22 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/wg/DeogunK95.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dam/GimbelKS94, author = {John G. Gimbel and Dieter Kratsch and Lorna Stewart}, title = {On Cocolourings and Cochromatic Numbers of Graphs}, journal = {Discret. Appl. Math.}, volume = {48}, number = {2}, pages = {111--127}, year = {1994}, url = {https://doi.org/10.1016/0166-218X(92)00121-2}, doi = {10.1016/0166-218X(92)00121-2}, timestamp = {Thu, 11 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dam/GimbelKS94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KratschDL94, author = {Dieter Kratsch and Peter Damaschke and Anna Lubiw}, title = {Dominating cliques in chordal graphs}, journal = {Discret. Math.}, volume = {128}, number = {1-3}, pages = {269--275}, year = {1994}, url = {https://doi.org/10.1016/0012-365X(94)90118-X}, doi = {10.1016/0012-365X(94)90118-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KratschDL94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mmor/KratschGVG94, author = {Dieter Kratsch and E. Godehardt and S. Vo{\ss} and O. Gascuel}, title = {Book reviews}, journal = {Math. Methods Oper. Res.}, volume = {40}, number = {1}, pages = {120--125}, year = {1994}, url = {https://doi.org/10.1007/BF01414033}, doi = {10.1007/BF01414033}, timestamp = {Wed, 14 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mmor/KratschGVG94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/KratschH94, author = {Dieter Kratsch and Lane A. Hemaspaandra}, title = {On the Complexity of Graph Reconstruction}, journal = {Math. Syst. Theory}, volume = {27}, number = {3}, pages = {257--273}, year = {1994}, url = {https://doi.org/10.1007/BF01578845}, doi = {10.1007/BF01578845}, timestamp = {Sun, 17 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mst/KratschH94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KloksBMK94, author = {Ton Kloks and Hans L. Bodlaender and Haiko M{\"{u}}ller and Dieter Kratsch}, editor = {Jan van Leeuwen}, title = {Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators}, booktitle = {Algorithms - {ESA} '94, Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {855}, pages = {508}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/BFb0049435}, doi = {10.1007/BFB0049435}, timestamp = {Tue, 14 May 2019 10:00:54 +0200}, biburl = {https://dblp.org/rec/conf/esa/KloksBMK94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DeogunKKM94, author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner}, title = {On Vertex Ranking for Permutations and Other Graphs}, booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {775}, pages = {747--758}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-57785-8\_187}, doi = {10.1007/3-540-57785-8\_187}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stacs/DeogunKKM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KloksK94, author = {Ton Kloks and Dieter Kratsch}, editor = {Patrice Enjalbert and Ernst W. Mayr and Klaus W. Wagner}, title = {Finding All Minimal Separators of a Graph}, booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer Science, Caen, France, February 24-26, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {775}, pages = {759--768}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-57785-8\_188}, doi = {10.1007/3-540-57785-8\_188}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KloksK94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/KloksKM94, author = {Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Dominoes}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {106--120}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_41}, doi = {10.1007/3-540-59071-4\_41}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/KloksKM94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wg/BodlaenderDJKKMT94, author = {Hans L. Bodlaender and Jitender S. Deogun and Klaus Jansen and Ton Kloks and Dieter Kratsch and Haiko M{\"{u}}ller and Zsolt Tuza}, editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, title = {Ranking of Graphs}, booktitle = {Graph-Theoretic Concepts in Computer Science, 20th International Workshop, {WG} '94, Herrsching, Germany, June 16-18, 1994, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {903}, pages = {292--304}, publisher = {Springer}, year = {1994}, url = {https://doi.org/10.1007/3-540-59071-4\_56}, doi = {10.1007/3-540-59071-4\_56}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wg/BodlaenderDJKKMT94.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/KratschS93, author = {Dieter Kratsch and Lorna Stewart}, title = {Domination on Cocomparability Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {6}, number = {3}, pages = {400--417}, year = {1993}, url = {https://doi.org/10.1137/0406032}, doi = {10.1137/0406032}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/KratschS93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/esa/KloksBMK93, author = {Ton Kloks and Hans L. Bodlaender and Haiko M{\"{u}}ller and Dieter Kratsch}, editor = {Thomas Lengauer}, title = {Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators}, booktitle = {Algorithms - {ESA} '93, First Annual European Symposium, Bad Honnef, Germany, September 30 - October 2, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {726}, pages = {260--271}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-57273-2\_61}, doi = {10.1007/3-540-57273-2\_61}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/esa/KloksBMK93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/BodlaenderKK93, author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch}, editor = {Andrzej Lingas and Rolf G. Karlsson and Svante Carlsson}, title = {Treewidth and Pathwidth of Permutation Graphs}, booktitle = {Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {700}, pages = {114--125}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-56939-1\_66}, doi = {10.1007/3-540-56939-1\_66}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/BodlaenderKK93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/KloksK93, author = {Ton Kloks and Dieter Kratsch}, editor = {Patrice Enjalbert and Alain Finkel and Klaus W. Wagner}, title = {Treewidth of Bipartite Graphs}, booktitle = {{STACS} 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, W{\"{u}}rzburg, Germany, February 25-27, 1993, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {665}, pages = {80--89}, publisher = {Springer}, year = {1993}, url = {https://doi.org/10.1007/3-540-56503-5\_11}, doi = {10.1007/3-540-56503-5\_11}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/stacs/KloksK93.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BodlaenderK92, author = {Hans L. Bodlaender and Dieter Kratsch}, title = {The Complexity of Coloring Games on Perfect Graphs}, journal = {Theor. Comput. Sci.}, volume = {106}, number = {2}, pages = {309--326}, year = {1992}, url = {https://doi.org/10.1016/0304-3975(92)90254-D}, doi = {10.1016/0304-3975(92)90254-D}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BodlaenderK92.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jgt/ErdosGK91, author = {Paul Erd{\"{o}}s and John G. Gimbel and Dieter Kratsch}, title = {Some extremal results in cochromatic and dichromatic theory}, journal = {J. Graph Theory}, volume = {15}, number = {6}, pages = {579--585}, year = {1991}, url = {https://doi.org/10.1002/jgt.3190150604}, doi = {10.1002/JGT.3190150604}, timestamp = {Tue, 01 Jun 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jgt/ErdosGK91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/KratschH91, author = {Dieter Kratsch and Lane A. Hemachandra}, editor = {Lothar Budach}, title = {On the Complexity of Graph Reconstruction}, booktitle = {Fundamentals of Computation Theory, 8th International Symposium, {FCT} '91, Gosen, Germany, September 9-13, 1991, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {529}, pages = {318--328}, publisher = {Springer}, year = {1991}, url = {https://doi.org/10.1007/3-540-54458-5\_76}, doi = {10.1007/3-540-54458-5\_76}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/fct/KratschH91.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Kratsch90, author = {Dieter Kratsch}, title = {Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs}, journal = {Discret. Math.}, volume = {86}, number = {1-3}, pages = {225--238}, year = {1990}, url = {https://doi.org/10.1016/0012-365X(90)90363-M}, doi = {10.1016/0012-365X(90)90363-M}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Kratsch90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ipl/DamaschkeMK90, author = {Peter Damaschke and Haiko M{\"{u}}ller and Dieter Kratsch}, title = {Domination in Convex and Chordal Bipartite Graphs}, journal = {Inf. Process. Lett.}, volume = {36}, number = {5}, pages = {231--236}, year = {1990}, url = {https://doi.org/10.1016/0020-0190(90)90147-P}, doi = {10.1016/0020-0190(90)90147-P}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ipl/DamaschkeMK90.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/iandc/Kratsch87, author = {Dieter Kratsch}, title = {Finding the Minimum Bandwidth of an Interval Graphs}, journal = {Inf. Comput.}, volume = {74}, number = {2}, pages = {140--158}, year = {1987}, url = {https://doi.org/10.1016/0890-5401(87)90028-9}, doi = {10.1016/0890-5401(87)90028-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/iandc/Kratsch87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/BrandstadtK87, author = {Andreas Brandst{\"{a}}dt and Dieter Kratsch}, title = {On Domination Problems for Permutation and Other Graphs}, journal = {Theor. Comput. Sci.}, volume = {54}, pages = {181--198}, year = {1987}, url = {https://doi.org/10.1016/0304-3975(87)90128-9}, doi = {10.1016/0304-3975(87)90128-9}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/BrandstadtK87.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eik/BrandstadtK86, author = {Andreas Brandst{\"{a}}dt and Dieter Kratsch}, title = {On Partitions of Permutations into Increasing and Decreasing Subsequences}, journal = {J. Inf. Process. Cybern.}, volume = {22}, number = {5/6}, pages = {263--273}, year = {1986}, timestamp = {Fri, 06 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eik/BrandstadtK86.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fct/BrandstadtK85, author = {Andreas Brandst{\"{a}}dt and Dieter Kratsch}, editor = {Lothar Budach}, title = {On the restriction of some NP-complete graph problems to permutation graphs}, booktitle = {Fundamentals of Computation Theory, {FCT} '85, Cottbus, GDR, September 9-13, 1985}, series = {Lecture Notes in Computer Science}, volume = {199}, pages = {53--62}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/BFb0028791}, doi = {10.1007/BFB0028791}, timestamp = {Tue, 14 May 2019 10:00:53 +0200}, biburl = {https://dblp.org/rec/conf/fct/BrandstadtK85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.