Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Haiko Müller
@article{DBLP:journals/corr/abs-2309-01482,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Thick Forests},
journal = {CoRR},
volume = {abs/2309.01482},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2309.01482},
doi = {10.48550/ARXIV.2309.01482},
eprinttype = {arXiv},
eprint = {2309.01482},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2309-01482.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/DellJMAP22,
author = {Holger Dell and
Mark Richard Jerrum and
Haiko M{\"{u}}ller and
Konrad Anand and
Marcus Pappik},
title = {Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar
22482)},
journal = {Dagstuhl Reports},
volume = {12},
number = {11},
pages = {124--145},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.11.124},
doi = {10.4230/DAGREP.12.11.124},
timestamp = {Wed, 17 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/DellJMAP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DyerHJM21,
author = {Martin E. Dyer and
Marc Heinrich and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {Polynomial-time approximation algorithms for the antiferromagnetic
Ising model on line graphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {6},
pages = {905--921},
year = {2021},
url = {https://doi.org/10.1017/S0963548321000080},
doi = {10.1017/S0963548321000080},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DyerHJM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DyerGM21,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
title = {Counting independent sets in graphs with bounded bipartite pathwidth},
journal = {Random Struct. Algorithms},
volume = {59},
number = {2},
pages = {204--237},
year = {2021},
url = {https://doi.org/10.1002/rsa.21003},
doi = {10.1002/RSA.21003},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/DyerGM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DyerJMV21,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller and
Kristina Vuskovic},
title = {Counting Weighted Independent Sets beyond the Permanent},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {2},
pages = {1503--1524},
year = {2021},
url = {https://doi.org/10.1137/20M1347747},
doi = {10.1137/20M1347747},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DyerJMV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-01997,
author = {Marc Heinrich and
Haiko M{\"{u}}ller},
title = {Counting independent sets in strongly orderable graphs},
journal = {CoRR},
volume = {abs/2101.01997},
year = {2021},
url = {https://arxiv.org/abs/2101.01997},
eprinttype = {arXiv},
eprint = {2101.01997},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-01997.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2020,
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Graph-Theoretic Concepts in Computer Science - 46th International
Workshop, {WG} 2020, Leeds, UK, June 24-26, 2020, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12301},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0},
doi = {10.1007/978-3-030-60440-0},
isbn = {978-3-030-60439-4},
timestamp = {Thu, 22 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2020.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-07944,
author = {Martin E. Dyer and
Marc Heinrich and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {Polynomial-time approximation algorithms for the antiferromagnetic
Ising model on line graphs},
journal = {CoRR},
volume = {abs/2005.07944},
year = {2020},
url = {https://arxiv.org/abs/2005.07944},
eprinttype = {arXiv},
eprint = {2005.07944},
timestamp = {Fri, 22 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-07944.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Quasimonotone graphs},
journal = {Discret. Appl. Math.},
volume = {271},
pages = {25--48},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2019.08.006},
doi = {10.1016/J.DAM.2019.08.006},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting independent sets in cocomparability graphs},
journal = {Inf. Process. Lett.},
volume = {144},
pages = {31--36},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.12.005},
doi = {10.1016/J.IPL.2018.12.005},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DyerM19,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting Perfect Matchings and the Switch Chain},
journal = {{SIAM} J. Discret. Math.},
volume = {33},
number = {3},
pages = {1146--1174},
year = {2019},
url = {https://doi.org/10.1137/18M1172910},
doi = {10.1137/18M1172910},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/DyerM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DyerGM19,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
editor = {Ignasi Sau and
Dimitrios M. Thilikos},
title = {Counting Independent Sets in Graphs with Bounded Bipartite Pathwidth},
booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
2019, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {11789},
pages = {298--310},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-30786-8\_23},
doi = {10.1007/978-3-030-30786-8\_23},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DyerGM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1909-03414,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller and
Kristina Vuskovic},
title = {Counting weighted independent sets beyond the permanent},
journal = {CoRR},
volume = {abs/1909.03414},
year = {2019},
url = {http://arxiv.org/abs/1909.03414},
eprinttype = {arXiv},
eprint = {1909.03414},
timestamp = {Tue, 17 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1909-03414.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/DyerM18,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Quasimonotone Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 44th International
Workshop, {WG} 2018, Cottbus, Germany, June 27-29, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11159},
pages = {190--202},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_16},
doi = {10.1007/978-3-030-00256-5\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/DyerM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1801-06494,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Quasimonotone graphs},
journal = {CoRR},
volume = {abs/1801.06494},
year = {2018},
url = {http://arxiv.org/abs/1801.06494},
eprinttype = {arXiv},
eprint = {1801.06494},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1801-06494.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-09853,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting Independent Sets in Cocomparability Graphs},
journal = {CoRR},
volume = {abs/1808.09853},
year = {2018},
url = {http://arxiv.org/abs/1808.09853},
eprinttype = {arXiv},
eprint = {1808.09853},
timestamp = {Mon, 03 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-09853.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-03195,
author = {Martin E. Dyer and
Catherine S. Greenhill and
Haiko M{\"{u}}ller},
title = {Counting independent sets in graphs with bounded bipartite pathwidth},
journal = {CoRR},
volume = {abs/1812.03195},
year = {2018},
url = {http://arxiv.org/abs/1812.03195},
eprinttype = {arXiv},
eprint = {1812.03195},
timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1812-03195.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/AdlerLMRTV17,
author = {Isolde Adler and
Ngoc{-}Khang Le and
Haiko M{\"{u}}ller and
Marko Radovanovic and
Nicolas Trotignon and
Kristina Vuskovic},
title = {On rank-width of even-hole-free graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {19},
number = {1},
year = {2017},
url = {https://doi.org/10.23638/DMTCS-19-1-24},
doi = {10.23638/DMTCS-19-1-24},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/AdlerLMRTV17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DyerJM17,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {On the Switch Markov Chain for Perfect Matchings},
journal = {J. {ACM}},
volume = {64},
number = {2},
pages = {12:1--12:33},
year = {2017},
url = {https://doi.org/10.1145/2822322},
doi = {10.1145/2822322},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/DyerJM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerM17,
author = {Martin E. Dyer and
Haiko M{\"{u}}ller},
title = {Counting perfect matchings and the switch chain},
journal = {CoRR},
volume = {abs/1705.05790},
year = {2017},
url = {http://arxiv.org/abs/1705.05790},
eprinttype = {arXiv},
eprint = {1705.05790},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DyerM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DyerJM16,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
editor = {Robert Krauthgamer},
title = {On the switch Markov chain for perfect matchings},
booktitle = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
pages = {1972--1983},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974331.ch138},
doi = {10.1137/1.9781611974331.CH138},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/DyerJM16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AdlerLMRTV16,
author = {Isolde Adler and
Ngoc{-}Khang Le and
Haiko M{\"{u}}ller and
Marko Radovanovic and
Nicolas Trotignon and
Kristina Vuskovic},
title = {On rank-width of even-hole-free graphs},
journal = {CoRR},
volume = {abs/1611.09907},
year = {2016},
url = {http://arxiv.org/abs/1611.09907},
eprinttype = {arXiv},
eprint = {1611.09907},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AdlerLMRTV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Abu-KhzamFM15,
author = {Faisal N. Abu{-}Khzam and
Carl Feghali and
Haiko M{\"{u}}ller},
title = {Partitioning a graph into disjoint cliques and a triangle-free graph},
journal = {Discret. Appl. Math.},
volume = {190-191},
pages = {1--12},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2015.03.015},
doi = {10.1016/J.DAM.2015.03.015},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Abu-KhzamFM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DyerJM15,
author = {Martin E. Dyer and
Mark Jerrum and
Haiko M{\"{u}}ller},
title = {On the switch Markov chain for perfect matchings},
journal = {CoRR},
volume = {abs/1501.07725},
year = {2015},
url = {http://arxiv.org/abs/1501.07725},
eprinttype = {arXiv},
eprint = {1501.07725},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DyerJM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FeghaliAM14a,
author = {Carl Feghali and
Faisal N. Abu{-}Khzam and
Haiko M{\"{u}}ller},
title = {Forbidden subgraph characterization of (P\({}_{\mbox{3}}\)-free, K\({}_{\mbox{3}}\)-free)-colourable
cographs},
journal = {CoRR},
volume = {abs/1403.5961},
year = {2014},
url = {http://arxiv.org/abs/1403.5961},
eprinttype = {arXiv},
eprint = {1403.5961},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FeghaliAM14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/MullerW13,
author = {Haiko M{\"{u}}ller and
Samuel Wilson},
editor = {Thierry Lecroq and
Laurent Mouchard},
title = {An {FPT} Certifying Algorithm for the Vertex-Deletion Problem},
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 = {468--472},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45278-9\_45},
doi = {10.1007/978-3-642-45278-9\_45},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/MullerW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/MullerW13,
author = {Haiko M{\"{u}}ller and
Samuel Wilson},
editor = {Kamiel Cornelissen and
Ruben Hoeksma and
Johann L. Hurink and
Bodo Manthey},
title = {Characterising subclasses of perfect graphs with respect to partial
orders related to edge contraction},
booktitle = {12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization,
Enschede, Netherlands, May 21-23, 2013},
series = {{CTIT} Workshop Proceedings},
volume = {{WP} 13-01},
pages = {183--186},
year = {2013},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/MullerW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DabrowskiLMR12,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Haiko M{\"{u}}ller and
Dieter Rautenbach},
title = {Parameterized complexity of the weighted independent set problem beyond
graphs of bounded clique number},
journal = {J. Discrete Algorithms},
volume = {14},
pages = {207--213},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2011.12.012},
doi = {10.1016/J.JDA.2011.12.012},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DabrowskiLMR12.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/wg/Muller12,
author = {Haiko M{\"{u}}ller},
editor = {Martin Charles Golumbic and
Michal Stern and
Avivit Levy and
Gila Morgenstern},
title = {On the Stable Degree of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 38th International
Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
Selcted Papers},
series = {Lecture Notes in Computer Science},
volume = {7551},
pages = {148--159},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-34611-8\_17},
doi = {10.1007/978-3-642-34611-8\_17},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/Muller12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MullerU10,
author = {Haiko M{\"{u}}ller and
Ruth Urner},
title = {On a disparity between relative cliquewidth and relative NLC-width},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {828--840},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2009.06.024},
doi = {10.1016/J.DAM.2009.06.024},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MullerU10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/DabrowskiLMR10,
author = {Konrad K. Dabrowski and
Vadim V. Lozin and
Haiko M{\"{u}}ller and
Dieter Rautenbach},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Parameterized Algorithms for the Independent Set Problem in Some Hereditary
Graph Classes},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {1--9},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_1},
doi = {10.1007/978-3-642-19222-7\_1},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwoca/DabrowskiLMR10.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/jct/KloksMV09,
author = {Ton Kloks and
Haiko M{\"{u}}ller and
Kristina Vuskovic},
title = {Even-hole-free graphs that do not contain diamonds: {A} structure
theorem and its consequences},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {5},
pages = {733--800},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.12.005},
doi = {10.1016/J.JCTB.2008.12.005},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KloksMV09.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/jda/LeMM08,
author = {Van Bang Le and
Raffaele Mosca and
Haiko M{\"{u}}ller},
title = {On stable cutsets in claw-free graphs and planar graphs},
journal = {J. Discrete Algorithms},
volume = {6},
number = {2},
pages = {256--276},
year = {2008},
url = {https://doi.org/10.1016/j.jda.2007.04.001},
doi = {10.1016/J.JDA.2007.04.001},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/LeMM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CryanDMS08,
author = {Mary Cryan and
Martin E. Dyer and
Haiko M{\"{u}}ller and
Leen Stougie},
title = {Random walks on the vertices of transportation polytopes with constant
number of sources},
journal = {Random Struct. Algorithms},
volume = {33},
number = {3},
pages = {333--355},
year = {2008},
url = {https://doi.org/10.1002/rsa.20222},
doi = {10.1002/RSA.20222},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CryanDMS08.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}
}
@article{DBLP:journals/dam/KloksKM05,
author = {Ton Kloks and
Jan Kratochv{\'{\i}}l and
Haiko M{\"{u}}ller},
title = {Computing the branchwidth of interval graphs},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {266--275},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.015},
doi = {10.1016/J.DAM.2004.01.015},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KloksKM05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/LeMM05,
author = {Van Bang Le and
Raffaele Mosca and
Haiko M{\"{u}}ller},
editor = {Dieter Kratsch},
title = {On Stable Cutsets in Claw-Free Graphs and Planar Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 31st International Workshop,
{WG} 2005, Metz, France, June 23-25, 2005, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {3787},
pages = {163--174},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11604686\_15},
doi = {10.1007/11604686\_15},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/LeMM05.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}
}
@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}
}
@article{DBLP:journals/dam/LeLM03,
author = {Ho{\`{a}}ng{-}Oanh Le and
Van Bang Le and
Haiko M{\"{u}}ller},
title = {Splitting a graph into disjoint induced paths or cycles},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {199--212},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00425-0},
doi = {10.1016/S0166-218X(02)00425-0},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/LeLM03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CryanDMS03,
author = {Mary Cryan and
Martin E. Dyer and
Haiko M{\"{u}}ller and
Leen Stougie},
title = {Random walks on the vertices of transportation polytopes with constant
number of sources},
booktitle = {Proceedings of the Fourteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 12-14, 2003, Baltimore, Maryland, {USA}},
pages = {330--339},
publisher = {{ACM/SIAM}},
year = {2003},
url = {http://dl.acm.org/citation.cfm?id=644108.644163},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/CryanDMS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/KloksLLM03,
author = {Ton Kloks and
Chuan{-}Min Lee and
Jiping Liu and
Haiko M{\"{u}}ller},
editor = {Hans L. Bodlaender},
title = {On the Recognition of General Partition 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 = {273--283},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-39890-5\_24},
doi = {10.1007/978-3-540-39890-5\_24},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/KloksLLM03.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/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/wg/ChangM01,
author = {Maw{-}Shang Chang and
Haiko M{\"{u}}ller},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {On the Tree-Degree of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {44--54},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_6},
doi = {10.1007/3-540-45477-2\_6},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/ChangM01.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}
}
@article{DBLP:journals/order/MullerR00,
author = {Haiko M{\"{u}}ller and
Jean{-}Xavier Rampon},
title = {Partial Orders on Weak Orders Convex Subsets},
journal = {Order},
volume = {17},
number = {2},
pages = {103--123},
year = {2000},
url = {https://doi.org/10.1023/A:1006497106096},
doi = {10.1023/A:1006497106096},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/order/MullerR00.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/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/KloksKM99,
author = {Ton Kloks and
Jan Kratochv{\'{\i}}l and
Haiko M{\"{u}}ller},
editor = {Christoph Meinel and
Sophie Tison},
title = {New Branchwidth Territories},
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 = {173--183},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-49116-3\_16},
doi = {10.1007/3-540-49116-3\_16},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/KloksKM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/KloksMW98,
author = {Ton Kloks and
Haiko M{\"{u}}ller and
C. K. Wong},
title = {Vertex Ranking of Asteroidal Triple-Free Graphs},
journal = {Inf. Process. Lett.},
volume = {68},
number = {4},
pages = {201--206},
year = {1998},
url = {https://doi.org/10.1016/S0020-0190(98)00162-8},
doi = {10.1016/S0020-0190(98)00162-8},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/KloksMW98.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/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/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/dam/Muller97,
author = {Haiko M{\"{u}}ller},
title = {Recognizing Interval Digraphs and Interval Bigraphs in Polynomial
Time},
journal = {Discret. Appl. Math.},
volume = {78},
number = {1-3},
pages = {189--205},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00027-9},
doi = {10.1016/S0166-218X(97)00027-9},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Muller97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MullerR97,
author = {Haiko M{\"{u}}ller and
Jean{-}Xavier Rampon},
title = {Partial orders and their convex subsets},
journal = {Discret. Math.},
volume = {165-166},
pages = {507--517},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00197-5},
doi = {10.1016/S0012-365X(96)00197-5},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MullerR97.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/Muller96,
author = {Haiko M{\"{u}}ller},
title = {On edge perfectness and classes of bipartite graphs},
journal = {Discret. Math.},
volume = {149},
number = {1-3},
pages = {159--187},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(94)00350-R},
doi = {10.1016/0012-365X(94)00350-R},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Muller96.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/Muller96a,
author = {Haiko M{\"{u}}ller},
title = {Hamiltonian circuits in chordal bipartite graphs},
journal = {Discret. Math.},
volume = {156},
number = {1-3},
pages = {291--298},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00057-4},
doi = {10.1016/0012-365X(95)00057-4},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Muller96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KloksMW96,
author = {Ton Kloks and
Haiko M{\"{u}}ller and
C. K. Wong},
editor = {Tetsuo Asano and
Yoshihide Igarashi and
Hiroshi Nagamochi and
Satoru Miyano and
Subhash Suri},
title = {Vertex Ranking of Asteroidal Triple-Free Graphs},
booktitle = {Algorithms and Computation, 7th International Symposium, {ISAAC} '96,
Osaka, Japan, December 16-18, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1178},
pages = {174--182},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/BFb0009493},
doi = {10.1007/BFB0009493},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KloksMW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/JansenM95,
author = {Klaus Jansen and
Haiko M{\"{u}}ller},
title = {The Minimum Broadcast Time Problem for Several Processor Networks},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {69--85},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00230-G},
doi = {10.1016/0304-3975(94)00230-G},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/JansenM95.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/cfcp/JansenM94,
author = {Klaus Jansen and
Haiko M{\"{u}}ller},
editor = {Michel Cosnard and
Afonso Ferreira and
Joseph G. Peters},
title = {The Minimum Broadcast Time Problem},
booktitle = {Parallel and Distributed Computing, First Canada-France Conference,
Montr{\'{e}}al, Canada, May 19-21, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {805},
pages = {219--234},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58078-6\_19},
doi = {10.1007/3-540-58078-6\_19},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cfcp/JansenM94.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/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/ipl/MullerN93,
author = {Haiko M{\"{u}}ller and
Falk Nicolai},
title = {Polynomial Time Algorithms for Hamiltonian Problems on Bipartite Distance-Hereditary
Graphs},
journal = {Inf. Process. Lett.},
volume = {46},
number = {5},
pages = {225--230},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90100-N},
doi = {10.1016/0020-0190(93)90100-N},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/MullerN93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Muller93,
author = {Haiko M{\"{u}}ller},
title = {A Note on Balanced Immunity},
journal = {Math. Syst. Theory},
volume = {26},
number = {2},
pages = {157--167},
year = {1993},
url = {https://doi.org/10.1007/BF01202280},
doi = {10.1007/BF01202280},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/Muller93.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}
}
@phdthesis{DBLP:phd/dnb/Muller91,
author = {Haiko M{\"{u}}ller},
title = {Die Kompliziertheitsklassen raumbeschr{\"{a}}nkter Turingmaschinen:
Relativierungen, Inklusionen, Separationen und Immunit{\"{a}}ten},
school = {University of Jena, Germany},
year = {1991},
url = {https://d-nb.info/911152490},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Muller91.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/tcs/MullerB87,
author = {Haiko M{\"{u}}ller and
Andreas Brandst{\"{a}}dt},
title = {The NP-Completeness of Steiner Tree and Dominating Set for Chordal
Bipartite Graphs},
journal = {Theor. Comput. Sci.},
volume = {53},
pages = {257--265},
year = {1987},
url = {https://doi.org/10.1016/0304-3975(87)90067-3},
doi = {10.1016/0304-3975(87)90067-3},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MullerB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
