Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Hans L. Bodlaender
@article{DBLP:journals/corr/abs-2402-03087,
author = {Hans L. Bodlaender and
Krisztina Szil{\'{a}}gyi},
title = {XNLP-hardness of Parameterized Problems on Planar Graphs},
journal = {CoRR},
volume = {abs/2402.03087},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.03087},
doi = {10.48550/ARXIV.2402.03087},
eprinttype = {arXiv},
eprint = {2402.03087},
timestamp = {Mon, 12 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-03087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderJT23,
author = {Hans L. Bodlaender and
Lars Jaffke and
Jan Arne Telle},
title = {Typical Sequences Revisited - Computing Width Parameters of Graphs},
journal = {Theory Comput. Syst.},
volume = {67},
number = {1},
pages = {52--88},
year = {2023},
url = {https://doi.org/10.1007/s00224-021-10030-3},
doi = {10.1007/S00224-021-10030-3},
timestamp = {Tue, 28 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderJT23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/or/ZandenBH23,
author = {Tom C. van der Zanden and
Hans L. Bodlaender and
Herbert J. M. Hamers},
title = {Efficiently computing the Shapley value of connectivity games in low-treewidth
graphs},
journal = {Oper. Res.},
volume = {23},
number = {1},
pages = {6},
year = {2023},
url = {https://doi.org/10.1007/s12351-023-00742-4},
doi = {10.1007/S12351-023-00742-4},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/or/ZandenBH23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergBKK23,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {3},
pages = {740--760},
year = {2023},
url = {https://doi.org/10.1137/22m1469122},
doi = {10.1137/22M1469122},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/BergBKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderGP23,
author = {Hans L. Bodlaender and
Carla Groenland and
Michal Pilipczuk},
editor = {Kousha Etessami and
Uriel Feige and
Gabriele Puppis},
title = {Parameterized Complexity of Binary {CSP:} Vertex Cover, Treedepth,
and Related Parameters},
booktitle = {50th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2023, July 10-14, 2023, Paderborn, Germany},
series = {LIPIcs},
volume = {261},
pages = {27:1--27:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2023.27},
doi = {10.4230/LIPICS.ICALP.2023.27},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderGP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderMOPL23,
author = {Hans L. Bodlaender and
Isja Mannens and
Jelle J. Oostveen and
Sukanya Pandey and
Erik Jan van Leeuwen},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {The Parameterised Complexity Of Integer Multicommodity Flow},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {6:1--6:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.6},
doi = {10.4230/LIPICS.IPEC.2023.6},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderMOPL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderBJKLM23,
author = {Hans L. Bodlaender and
{\'{E}}douard Bonnet and
Lars Jaffke and
Dusan Knop and
Paloma T. Lima and
Martin Milanic and
Sebastian Ordyniak and
Sukanya Pandey and
Ondrej Such{\'{y}}},
editor = {Neeldhara Misra and
Magnus Wahlstr{\"{o}}m},
title = {Treewidth Is NP-Complete on Cubic Graphs},
booktitle = {18th International Symposium on Parameterized and Exact Computation,
{IPEC} 2023, September 6-8, 2023, Amsterdam, The Netherlands},
series = {LIPIcs},
volume = {285},
pages = {7:1--7:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2023.7},
doi = {10.4230/LIPICS.IPEC.2023.7},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderBJKLM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2301-10031,
author = {Hans L. Bodlaender and
{\'{E}}douard Bonnet and
Lars Jaffke and
Dusan Knop and
Paloma T. Lima and
Martin Milanic and
Sebastian Ordyniak and
Sukanya Pandey and
Ondrej Such{\'{y}}},
title = {Treewidth is NP-Complete on Cubic Graphs (and related results)},
journal = {CoRR},
volume = {abs/2301.10031},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2301.10031},
doi = {10.48550/ARXIV.2301.10031},
eprinttype = {arXiv},
eprint = {2301.10031},
timestamp = {Thu, 26 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2301-10031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-01613,
author = {Hans L. Bodlaender and
Matthew Johnson and
Barnaby Martin and
Jelle J. Oostveen and
Sukanya Pandey and
Dani{\"{e}}l Paulusma and
Siani Smith and
Erik Jan van Leeuwen},
title = {Complexity Framework for Forbidden Subgraphs {IV:} The Steiner Forest
Problem},
journal = {CoRR},
volume = {abs/2305.01613},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.01613},
doi = {10.48550/ARXIV.2305.01613},
eprinttype = {arXiv},
eprint = {2305.01613},
timestamp = {Sun, 12 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-01613.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-05784,
author = {Hans L. Bodlaender and
Isja Mannens and
Jelle J. Oostveen and
Sukanya Pandey and
Erik Jan van Leeuwen},
title = {The Parameterised Complexity of Integer Multicommodity Flow},
journal = {CoRR},
volume = {abs/2310.05784},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2310.05784},
doi = {10.48550/ARXIV.2310.05784},
eprinttype = {arXiv},
eprint = {2310.05784},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2310-05784.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cstat/DAmbrosioBB22,
author = {Federico D'Ambrosio and
Hans L. Bodlaender and
Gerard T. Barkema},
title = {Dynamic sampling from a discrete probability distribution with a known
distribution of rates},
journal = {Comput. Stat.},
volume = {37},
number = {3},
pages = {1203--1228},
year = {2022},
url = {https://doi.org/10.1007/s00180-021-01159-3},
doi = {10.1007/S00180-021-01159-3},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cstat/DAmbrosioBB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/BodlaenderBGS22,
author = {Hans L. Bodlaender and
Josse van Dobben de Bruyn and
Dion Gijswijt and
Harry Smit},
title = {Constructing tree decompositions of graphs with bounded gonality},
journal = {J. Comb. Optim.},
volume = {44},
number = {4},
pages = {2681--2699},
year = {2022},
url = {https://doi.org/10.1007/s10878-021-00762-w},
doi = {10.1007/S10878-021-00762-W},
timestamp = {Wed, 07 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/BodlaenderBGS22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderGJ22,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob},
editor = {Shiri Chechik and
Gonzalo Navarro and
Eva Rotenberg and
Grzegorz Herman},
title = {List Colouring Trees in Logarithmic Space},
booktitle = {30th Annual European Symposium on Algorithms, {ESA} 2022, September
5-9, 2022, Berlin/Potsdam, Germany},
series = {LIPIcs},
volume = {244},
pages = {24:1--24:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ESA.2022.24},
doi = {10.4230/LIPICS.ESA.2022.24},
timestamp = {Wed, 28 Feb 2024 00:16:41 +0100},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderGJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderGJPP22,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob and
Marcin Pilipczuk and
Michal Pilipczuk},
editor = {Holger Dell and
Jesper Nederlof},
title = {On the Complexity of Problems on Tree-Structured Graphs},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {6:1--6:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.6},
doi = {10.4230/LIPICS.IPEC.2022.6},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderGJPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderGJ22,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob},
editor = {Holger Dell and
Jesper Nederlof},
title = {On the Parameterized Complexity of Computing Tree-Partitions},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {7:1--7:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.7},
doi = {10.4230/LIPICS.IPEC.2022.7},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderGJ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderGJJL22,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob and
Lars Jaffke and
Paloma T. Lima},
editor = {Holger Dell and
Jesper Nederlof},
title = {XNLP-Completeness for Parameterized Problems on Graphs with a Linear
Structure},
booktitle = {17th International Symposium on Parameterized and Exact Computation,
{IPEC} 2022, September 7-9, 2022, Potsdam, Germany},
series = {LIPIcs},
volume = {249},
pages = {8:1--8:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2022.8},
doi = {10.4230/LIPICS.IPEC.2022.8},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderGJJL22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pgm/BodlaenderDK22,
author = {Hans L. Bodlaender and
Nils Donselaar and
Johan Kwisthout},
editor = {Antonio Salmer{\'{o}}n and
Rafael Rum{\'{\i}}},
title = {Parameterized Completeness Results for Bayesian Inference},
booktitle = {International Conference on Probabilistic Graphical Models, {PGM}
2022, 5-7 October 2022, Almer{\'{\i}}a, Spain},
series = {Proceedings of Machine Learning Research},
volume = {186},
pages = {145--156},
publisher = {{PMLR}},
year = {2022},
url = {https://proceedings.mlr.press/v186/bodlaender22a.html},
timestamp = {Sat, 15 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/pgm/BodlaenderDK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/Bodlaender22,
author = {Hans L. Bodlaender},
editor = {Petra Mutzel and
Md. Saidur Rahman and
Slamin},
title = {From the W-hierarchy to {XNLP} - Classes of Fixed Parameter Intractability},
booktitle = {{WALCOM:} Algorithms and Computation - 16th International Conference
and Workshops, {WALCOM} 2022, Jember, Indonesia, March 24-26, 2022,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {13174},
pages = {15--25},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-030-96731-4\_2},
doi = {10.1007/978-3-030-96731-4\_2},
timestamp = {Fri, 01 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/walcom/Bodlaender22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderCW22,
author = {Hans L. Bodlaender and
Gunther Cornelissen and
Marieke van der Wegen},
editor = {Michael A. Bekos and
Michael Kaufmann},
title = {Problems Hard for Treewidth but Easy for Stable Gonality},
booktitle = {Graph-Theoretic Concepts in Computer Science - 48th International
Workshop, {WG} 2022, T{\"{u}}bingen, Germany, June 22-24, 2022,
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {13453},
pages = {84--97},
publisher = {Springer},
year = {2022},
url = {https://doi.org/10.1007/978-3-031-15914-5\_7},
doi = {10.1007/978-3-031-15914-5\_7},
timestamp = {Tue, 18 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderCW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-13119,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob},
title = {XNLP-completeness for Parameterized Problems on Graphs with a Linear
Structure},
journal = {CoRR},
volume = {abs/2201.13119},
year = {2022},
url = {https://arxiv.org/abs/2201.13119},
eprinttype = {arXiv},
eprint = {2201.13119},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-13119.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2202-06838,
author = {Hans L. Bodlaender and
Gunther Cornelissen and
Marieke van der Wegen},
title = {Problems hard for treewidth but easy for stable gonality},
journal = {CoRR},
volume = {abs/2202.06838},
year = {2022},
url = {https://arxiv.org/abs/2202.06838},
eprinttype = {arXiv},
eprint = {2202.06838},
timestamp = {Fri, 18 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-06838.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-07172,
author = {Hans L. Bodlaender and
Nils Donselaar and
Johan Kwisthout},
title = {Parameterized Complexity Results for Bayesian Inference},
journal = {CoRR},
volume = {abs/2206.07172},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.07172},
doi = {10.48550/ARXIV.2206.07172},
eprinttype = {arXiv},
eprint = {2206.07172},
timestamp = {Tue, 21 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-07172.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-09750,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob},
title = {List Colouring Trees in Logarithmic Space},
journal = {CoRR},
volume = {abs/2206.09750},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.09750},
doi = {10.48550/ARXIV.2206.09750},
eprinttype = {arXiv},
eprint = {2206.09750},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-09750.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-11828,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob and
Marcin Pilipczuk and
Michal Pilipczuk},
title = {On the Complexity of Problems on Tree-structured Graphs},
journal = {CoRR},
volume = {abs/2206.11828},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.11828},
doi = {10.48550/ARXIV.2206.11828},
eprinttype = {arXiv},
eprint = {2206.11828},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-11828.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2206-11832,
author = {Hans L. Bodlaender and
Carla Groenland and
Hugo Jacob},
title = {On the parameterized complexity of computing tree-partitions},
journal = {CoRR},
volume = {abs/2206.11832},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2206.11832},
doi = {10.48550/ARXIV.2206.11832},
eprinttype = {arXiv},
eprint = {2206.11832},
timestamp = {Tue, 24 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2206-11832.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-12543,
author = {Hans L. Bodlaender},
title = {The Parameterized Complexity Binary {CSP} for Graphs with a Small
Vertex Cover and Related Results},
journal = {CoRR},
volume = {abs/2208.12543},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.12543},
doi = {10.48550/ARXIV.2208.12543},
eprinttype = {arXiv},
eprint = {2208.12543},
timestamp = {Tue, 30 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-12543.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2208-12868,
author = {Tom C. van der Zanden and
Hans L. Bodlaender and
Herbert J. M. Hamers},
title = {Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth
Graphs},
journal = {CoRR},
volume = {abs/2208.12868},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2208.12868},
doi = {10.48550/ARXIV.2208.12868},
eprinttype = {arXiv},
eprint = {2208.12868},
timestamp = {Thu, 01 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2208-12868.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderWZ21,
author = {Hans L. Bodlaender and
Marieke van der Wegen and
Tom C. van der Zanden},
title = {Stable Divisorial Gonality is in {NP}},
journal = {Theory Comput. Syst.},
volume = {65},
number = {2},
pages = {428--440},
year = {2021},
url = {https://doi.org/10.1007/s00224-020-10019-4},
doi = {10.1007/S00224-020-10019-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderWZ21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderKP21,
author = {Hans L. Bodlaender and
Sudeshna Kolay and
Astrid Pieterse},
title = {Parameterized Complexity of Conflict-Free Graph Coloring},
journal = {{SIAM} J. Discret. Math.},
volume = {35},
number = {3},
pages = {2003--2038},
year = {2021},
url = {https://doi.org/10.1137/19M1307160},
doi = {10.1137/19M1307160},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderKP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderBJPPL21,
author = {Hans L. Bodlaender and
Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Steiner trees for hereditary graph classes: {A} treewidth perspective},
journal = {Theor. Comput. Sci.},
volume = {867},
pages = {30--39},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.03.012},
doi = {10.1016/J.TCS.2021.03.012},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderBJPPL21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodlaenderGNS21,
author = {Hans L. Bodlaender and
Carla Groenland and
Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis},
title = {Parameterized Problems Complete for Nondeterministic {FPT} time and
Logarithmic Space},
booktitle = {62nd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2021, Denver, CO, USA, February 7-10, 2022},
pages = {193--204},
publisher = {{IEEE}},
year = {2021},
url = {https://doi.org/10.1109/FOCS52979.2021.00027},
doi = {10.1109/FOCS52979.2021.00027},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BodlaenderGNS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderGS21,
author = {Hans L. Bodlaender and
Carla Groenland and
C{\'{e}}line M. F. Swennenhuis},
editor = {Petr A. Golovach and
Meirav Zehavi},
title = {Parameterized Complexities of Dominating and Independent Set Reconfiguration},
booktitle = {16th International Symposium on Parameterized and Exact Computation,
{IPEC} 2021, September 8-10, 2021, Lisbon, Portugal},
series = {LIPIcs},
volume = {214},
pages = {9:1--9:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2021.9},
doi = {10.4230/LIPICS.IPEC.2021.9},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderGS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/walcom/SaitohYB21,
author = {Toshiki Saitoh and
Ryo Yoshinaka and
Hans L. Bodlaender},
editor = {Ryuhei Uehara and
Seok{-}Hee Hong and
Subhas C. Nandy},
title = {Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval
Graph Classes},
booktitle = {{WALCOM:} Algorithms and Computation - 15th International Conference
and Workshops, {WALCOM} 2021, Yangon, Myanmar, February 28 - March
2, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12635},
pages = {142--153},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-68211-8\_12},
doi = {10.1007/978-3-030-68211-8\_12},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/walcom/SaitohYB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender21,
author = {Hans L. Bodlaender},
editor = {Lukasz Kowalik and
Michal Pilipczuk and
Pawel Rzazewski},
title = {Parameterized Complexity of Bandwidth of Caterpillars and Weighted
Path Emulation},
booktitle = {Graph-Theoretic Concepts in Computer Science - 47th International
Workshop, {WG} 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected
Papers},
series = {Lecture Notes in Computer Science},
volume = {12911},
pages = {15--27},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-86838-3\_2},
doi = {10.1007/978-3-030-86838-3\_2},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-14882,
author = {Hans L. Bodlaender and
Carla Groenland and
Jesper Nederlof and
C{\'{e}}line M. F. Swennenhuis},
title = {Parameterized Problems Complete for Nondeterministic {FPT} time and
Logarithmic Space},
journal = {CoRR},
volume = {abs/2105.14882},
year = {2021},
url = {https://arxiv.org/abs/2105.14882},
eprinttype = {arXiv},
eprint = {2105.14882},
timestamp = {Wed, 02 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2105-14882.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-15907,
author = {Hans L. Bodlaender and
Carla Groenland and
C{\'{e}}line M. F. Swennenhuis},
title = {Parameterized Complexities of Dominating and Independent Set Reconfiguration},
journal = {CoRR},
volume = {abs/2106.15907},
year = {2021},
url = {https://arxiv.org/abs/2106.15907},
eprinttype = {arXiv},
eprint = {2106.15907},
timestamp = {Mon, 05 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-15907.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHKKOO20,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
journal = {Algorithmica},
volume = {82},
number = {12},
pages = {3566--3587},
year = {2020},
url = {https://doi.org/10.1007/s00453-020-00737-z},
doi = {10.1007/S00453-020-00737-Z},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHKKOO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Bodlaender20,
author = {Hans L. Bodlaender},
title = {{EATCS-IPEC} Nerode Prize 2020 - Call for Nominations},
journal = {Bull. {EATCS}},
volume = {130},
year = {2020},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/614/622},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/Bodlaender20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BergBKMZ20,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
title = {A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower
Bounds in Geometric Intersection Graphs},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {6},
pages = {1291--1331},
year = {2020},
url = {https://doi.org/10.1137/20M1320870},
doi = {10.1137/20M1320870},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BergBKMZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodewesBCW20,
author = {Jelco M. Bodewes and
Hans L. Bodlaender and
Gunther Cornelissen and
Marieke van der Wegen},
title = {Recognizing hyperelliptic graphs in polynomial time},
journal = {Theor. Comput. Sci.},
volume = {815},
pages = {121--146},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.02.013},
doi = {10.1016/J.TCS.2020.02.013},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodewesBCW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderZ20,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
title = {On the exact complexity of polyomino packing},
journal = {Theor. Comput. Sci.},
volume = {839},
pages = {13--20},
year = {2020},
url = {https://doi.org/10.1016/j.tcs.2020.05.025},
doi = {10.1016/J.TCS.2020.05.025},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atal/BodlaenderHJOOZ20,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Lars Jaffke and
Hirotaka Ono and
Yota Otachi and
Tom C. van der Zanden},
editor = {Amal El Fallah Seghrouchni and
Gita Sukthankar and
Bo An and
Neil Yorke{-}Smith},
title = {Hedonic Seat Arrangement Problems},
booktitle = {Proceedings of the 19th International Conference on Autonomous Agents
and Multiagent Systems, {AAMAS} '20, Auckland, New Zealand, May 9-13,
2020},
pages = {1777--1779},
publisher = {International Foundation for Autonomous Agents and Multiagent Systems},
year = {2020},
url = {https://dl.acm.org/doi/10.5555/3398761.3398979},
doi = {10.5555/3398761.3398979},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/atal/BodlaenderHJOOZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BodlaenderBGS20,
author = {Hans L. Bodlaender and
Josse van Dobben de Bruyn and
Dion Gijswijt and
Harry Smit},
editor = {Donghyun Kim and
R. N. Uma and
Zhipeng Cai and
Dong Hoon Lee},
title = {Constructing Tree Decompositions of Graphs with Bounded Gonality},
booktitle = {Computing and Combinatorics - 26th International Conference, {COCOON}
2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12273},
pages = {384--396},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-58150-3\_31},
doi = {10.1007/978-3-030-58150-3\_31},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cocoon/BodlaenderBGS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderW20,
author = {Hans L. Bodlaender and
Marieke van der Wegen},
editor = {Yixin Cao and
Marcin Pilipczuk},
title = {Parameterized Complexity of Scheduling Chains of Jobs with Delays},
booktitle = {15th International Symposium on Parameterized and Exact Computation,
{IPEC} 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)},
series = {LIPIcs},
volume = {180},
pages = {4:1--4:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2020.4},
doi = {10.4230/LIPICS.IPEC.2020.4},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/BodlaenderB0PPL20,
author = {Hans L. Bodlaender and
Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
editor = {Yoshiharu Kohayakawa and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Steiner Trees for Hereditary Graph Classes},
booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium,
S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12118},
pages = {613--624},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-61792-9\_48},
doi = {10.1007/978-3-030-61792-9\_48},
timestamp = {Thu, 17 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/BodlaenderB0PPL20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderJT20,
author = {Hans L. Bodlaender and
Lars Jaffke and
Jan Arne Telle},
editor = {Christophe Paul and
Markus Bl{\"{a}}ser},
title = {Typical Sequences Revisited - Computing Width Parameters of Graphs},
booktitle = {37th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2020, March 10-13, 2020, Montpellier, France},
series = {LIPIcs},
volume = {154},
pages = {57:1--57:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.STACS.2020.57},
doi = {10.4230/LIPICS.STACS.2020.57},
timestamp = {Thu, 19 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderBFG20,
author = {Hans L. Bodlaender and
Benjamin A. Burton and
Fedor V. Fomin and
Alexander Grigoriev},
editor = {Isolde Adler and
Haiko M{\"{u}}ller},
title = {Knot Diagrams of Treewidth Two},
booktitle = {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},
pages = {80--91},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-60440-0\_7},
doi = {10.1007/978-3-030-60440-0\_7},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderBFG20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-10898,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Lars Jaffke and
Hirotaka Ono and
Yota Otachi and
Tom C. van der Zanden},
title = {Hedonic Seat Arrangement Problems},
journal = {CoRR},
volume = {abs/2002.10898},
year = {2020},
url = {https://arxiv.org/abs/2002.10898},
eprinttype = {arXiv},
eprint = {2002.10898},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-10898.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-07492,
author = {Hans L. Bodlaender and
Nick Brettell and
Matthew Johnson and
Giacomo Paesani and
Dani{\"{e}}l Paulusma and
Erik Jan van Leeuwen},
title = {Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective},
journal = {CoRR},
volume = {abs/2004.07492},
year = {2020},
url = {https://arxiv.org/abs/2004.07492},
eprinttype = {arXiv},
eprint = {2004.07492},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-07492.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-05569,
author = {Hans L. Bodlaender and
Josse van Dobben de Bruyn and
Dion Gijswijt and
Harry Smit},
title = {Constructing Tree Decompositions of Graphs with Bounded Gonality},
journal = {CoRR},
volume = {abs/2005.05569},
year = {2020},
url = {https://arxiv.org/abs/2005.05569},
eprinttype = {arXiv},
eprint = {2005.05569},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-05569.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-03859,
author = {Toshiki Saitoh and
Ryo Yoshinaka and
Hans L. Bodlaender},
title = {Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection
Graph Classes},
journal = {CoRR},
volume = {abs/2007.03859},
year = {2020},
url = {https://arxiv.org/abs/2007.03859},
eprinttype = {arXiv},
eprint = {2007.03859},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-03859.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2007-09023,
author = {Hans L. Bodlaender and
Marieke van der Wegen},
title = {Parameterized Complexity of Scheduling Chains of Jobs with Delays},
journal = {CoRR},
volume = {abs/2007.09023},
year = {2020},
url = {https://arxiv.org/abs/2007.09023},
eprinttype = {arXiv},
eprint = {2007.09023},
timestamp = {Tue, 28 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2007-09023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-01226,
author = {Hans L. Bodlaender},
title = {Parameterized complexity of Bandwidth of Caterpillars and Weighted
Path Emulation},
journal = {CoRR},
volume = {abs/2012.01226},
year = {2020},
url = {https://arxiv.org/abs/2012.01226},
eprinttype = {arXiv},
eprint = {2012.01226},
timestamp = {Fri, 04 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-01226.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergBK19,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak},
title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips {I:} Algorithms},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2934--2962},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00567-8},
doi = {10.1007/S00453-019-00567-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergBK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BergBK19a,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak},
title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips {II:}
Lower Bounds},
journal = {Algorithmica},
volume = {81},
number = {7},
pages = {2963--2990},
year = {2019},
url = {https://doi.org/10.1007/s00453-019-00561-0},
doi = {10.1007/S00453-019-00561-0},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BergBK19a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/ChenBW19,
author = {Jianer Chen and
Hans L. Bodlaender and
Virginia Vassilevska Williams},
title = {{EATCS-IPEC} Nerode Prize 2019 - Call for Nominations},
journal = {Bull. {EATCS}},
volume = {127},
year = {2019},
url = {http://bulletin.eatcs.org/index.php/beatcs/article/view/571/570},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/eatcs/ChenBW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderZ19,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
title = {On exploring always-connected temporal graphs of small pathwidth},
journal = {Inf. Process. Lett.},
volume = {142},
pages = {68--71},
year = {2019},
url = {https://doi.org/10.1016/j.ipl.2018.10.016},
doi = {10.1016/J.IPL.2018.10.016},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/HanakaBZO19,
author = {Tesshu Hanaka and
Hans L. Bodlaender and
Tom C. van der Zanden and
Hirotaka Ono},
title = {On the maximum weight minimal separator},
journal = {Theor. Comput. Sci.},
volume = {796},
pages = {294--308},
year = {2019},
url = {https://doi.org/10.1016/j.tcs.2019.09.025},
doi = {10.1016/J.TCS.2019.09.025},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HanakaBZO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BodlaenderHOOZ19,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
editor = {Pinar Heggernes},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
booktitle = {Algorithms and Complexity - 11th International Conference, {CIAC}
2019, Rome, Italy, May 27-29, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11485},
pages = {87--98},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-17402-6\_8},
doi = {10.1007/978-3-030-17402-6\_8},
timestamp = {Tue, 26 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BodlaenderHOOZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BodlaenderWZ19,
author = {Hans L. Bodlaender and
Marieke van der Wegen and
Tom C. van der Zanden},
editor = {Barbara Catania and
Rastislav Kr{\'{a}}lovic and
Jerzy R. Nawrocki and
Giovanni Pighizzini},
title = {Stable Divisorial Gonality is in {NP}},
booktitle = {{SOFSEM} 2019: Theory and Practice of Computer Science - 45th International
Conference on Current Trends in Theory and Practice of Computer Science,
Nov{\'{y}} Smokovec, Slovakia, January 27-30, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11376},
pages = {81--93},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-10801-4\_8},
doi = {10.1007/978-3-030-10801-4\_8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/BodlaenderWZ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BodlaenderKP19,
author = {Hans L. Bodlaender and
Sudeshna Kolay and
Astrid Pieterse},
editor = {Zachary Friggstad and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Mohammad R. Salavatipour},
title = {Parameterized Complexity of Conflict-Free Graph Coloring},
booktitle = {Algorithms and Data Structures - 16th International Symposium, {WADS}
2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11646},
pages = {168--180},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24766-9\_13},
doi = {10.1007/978-3-030-24766-9\_13},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wads/BodlaenderKP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-03117,
author = {Hans L. Bodlaender and
Benjamin A. Burton and
Fedor V. Fomin and
Alexander Grigoriev},
title = {Knot Diagrams of Treewidth Two},
journal = {CoRR},
volume = {abs/1904.03117},
year = {2019},
url = {http://arxiv.org/abs/1904.03117},
eprinttype = {arXiv},
eprint = {1904.03117},
timestamp = {Wed, 08 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-03117.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-00305,
author = {Hans L. Bodlaender and
Sudeshna Kolay and
Astrid Pieterse},
title = {Parameterized Complexity of Conflict-free Graph Coloring},
journal = {CoRR},
volume = {abs/1905.00305},
year = {2019},
url = {http://arxiv.org/abs/1905.00305},
eprinttype = {arXiv},
eprint = {1905.00305},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-00305.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-03643,
author = {Hans L. Bodlaender and
Lars Jaffke and
Jan Arne Telle},
title = {Typical Sequences Revisited - Algorithms for Linear Orderings of Series
Parallel Digraphs},
journal = {CoRR},
volume = {abs/1905.03643},
year = {2019},
url = {http://arxiv.org/abs/1905.03643},
eprinttype = {arXiv},
eprint = {1905.03643},
timestamp = {Mon, 27 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-03643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-10670,
author = {Hans L. Bodlaender and
Tesshu Hanaka and
Yasuaki Kobayashi and
Yusuke Kobayashi and
Yoshio Okamoto and
Yota Otachi and
Tom C. van der Zanden},
title = {Subgraph Isomorphism on Graph Classes that Exclude a Substructure},
journal = {CoRR},
volume = {abs/1905.10670},
year = {2019},
url = {http://arxiv.org/abs/1905.10670},
eprinttype = {arXiv},
eprint = {1905.10670},
timestamp = {Sat, 23 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-10670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderOO18,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
title = {Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes
and Parameterized Complexity},
journal = {Algorithmica},
volume = {80},
number = {7},
pages = {2160--2180},
year = {2018},
url = {https://doi.org/10.1007/s00453-017-0399-9},
doi = {10.1007/S00453-017-0399-9},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderOO18,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
title = {A faster parameterized algorithm for Pseudoforest Deletion},
journal = {Discret. Appl. Math.},
volume = {236},
pages = {42--56},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.10.018},
doi = {10.1016/J.DAM.2017.10.018},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderOO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BergBKK18,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
editor = {Mikkel Thorup},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
booktitle = {59th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2018, Paris, France, October 7-9, 2018},
pages = {450--461},
publisher = {{IEEE} Computer Society},
year = {2018},
url = {https://doi.org/10.1109/FOCS.2018.00050},
doi = {10.1109/FOCS.2018.00050},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BergBKK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/BodlaenderZ18,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
editor = {Hiro Ito and
Stefano Leonardi and
Linda Pagli and
Giuseppe Prencipe},
title = {On the Exact Complexity of Polyomino Packing},
booktitle = {9th International Conference on Fun with Algorithms, {FUN} 2018, June
13-15, 2018, La Maddalena, Italy},
series = {LIPIcs},
volume = {100},
pages = {9:1--9:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.FUN.2018.9},
doi = {10.4230/LIPICS.FUN.2018.9},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/fun/BodlaenderZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BergBKMZ18,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {A framework for ETH-tight algorithms and lower bounds in geometric
intersection graphs},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {574--586},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188854},
doi = {10.1145/3188745.3188854},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BergBKMZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodewesBCW18,
author = {Jelco M. Bodewes and
Hans L. Bodlaender and
Gunther Cornelissen and
Marieke van der Wegen},
editor = {Andreas Brandst{\"{a}}dt and
Ekkehard K{\"{o}}hler and
Klaus Meer},
title = {Recognizing Hyperelliptic Graphs in Polynomial Time},
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 = {52--64},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-00256-5\_5},
doi = {10.1007/978-3-030-00256-5\_5},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodewesBCW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-02379,
author = {Federico D'Ambrosio and
Gerard T. Barkema and
Hans L. Bodlaender},
title = {Optimal data structures for stochastic driven simulations},
journal = {CoRR},
volume = {abs/1802.02379},
year = {2018},
url = {http://arxiv.org/abs/1802.02379},
eprinttype = {arXiv},
eprint = {1802.02379},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-02379.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-10633,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
D{\'{a}}niel Marx and
Tom C. van der Zanden},
title = {Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection
Graphs},
journal = {CoRR},
volume = {abs/1803.10633},
year = {2018},
url = {http://arxiv.org/abs/1803.10633},
eprinttype = {arXiv},
eprint = {1803.10633},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-10633.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-01667,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender and
Erik Jan van Leeuwen and
Peter Rossmanith and
Martin Vatshelle},
title = {Fast Dynamic Programming on Graph Decompositions},
journal = {CoRR},
volume = {abs/1806.01667},
year = {2018},
url = {http://arxiv.org/abs/1806.01667},
eprinttype = {arXiv},
eprint = {1806.01667},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-01667.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-06933,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak and
Sudeshna Kolay},
title = {An ETH-Tight Exact Algorithm for Euclidean {TSP}},
journal = {CoRR},
volume = {abs/1807.06933},
year = {2018},
url = {http://arxiv.org/abs/1807.06933},
eprinttype = {arXiv},
eprint = {1807.06933},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-06933.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-11869,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
title = {On Exploring Temporal Graphs of Small Pathwidth},
journal = {CoRR},
volume = {abs/1807.11869},
year = {2018},
url = {http://arxiv.org/abs/1807.11869},
eprinttype = {arXiv},
eprint = {1807.11869},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1807-11869.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-06921,
author = {Hans L. Bodlaender and
Marieke van der Wegen and
Tom C. van der Zanden},
title = {Stable divisorial gonality is in {NP}},
journal = {CoRR},
volume = {abs/1808.06921},
year = {2018},
url = {http://arxiv.org/abs/1808.06921},
eprinttype = {arXiv},
eprint = {1808.06921},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-06921.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderKKKO17,
author = {Hans L. Bodlaender and
Stefan Kratsch and
Vincent J. C. Kreuzen and
O{-}joung Kwon and
Seongmin Ok},
title = {Characterizing width two for variants of treewidth},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {29--46},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2015.01.015},
doi = {10.1016/J.DAM.2015.01.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderKKKO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/JaffkeBHT17,
author = {Lars Jaffke and
Hans L. Bodlaender and
Pinar Heggernes and
Jan Arne Telle},
title = {Definability equals recognizability for k-outerplanar graphs and l-chordal
partial k-trees},
journal = {Eur. J. Comb.},
volume = {66},
pages = {191--234},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.06.025},
doi = {10.1016/J.EJC.2017.06.025},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/JaffkeBHT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/BodlaenderZ17,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
editor = {Dimitris Fotakis and
Aris Pagourtzis and
Vangelis Th. Paschos},
title = {Improved Lower Bounds for Graph Embedding Problems},
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 = {92--103},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-57586-5\_9},
doi = {10.1007/978-3-319-57586-5\_9},
timestamp = {Thu, 24 Mar 2022 11:08:56 +0100},
biburl = {https://dblp.org/rec/conf/ciac/BodlaenderZ17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ZandenB17,
author = {Tom C. van der Zanden and
Hans L. Bodlaender},
editor = {Daniel Lokshtanov and
Naomi Nishimura},
title = {Computing Treewidth on the {GPU}},
booktitle = {12th International Symposium on Parameterized and Exact Computation,
{IPEC} 2017, September 6-8, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {89},
pages = {29:1--29:13},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2017.29},
doi = {10.4230/LIPICS.IPEC.2017.29},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/ZandenB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/HanakaBZO17,
author = {Tesshu Hanaka and
Hans L. Bodlaender and
Tom C. van der Zanden and
Hirotaka Ono},
editor = {T. V. Gopal and
Gerhard J{\"{a}}ger and
Silvia Steila},
title = {On the Maximum Weight Minimal Separator},
booktitle = {Theory and Applications of Models of Computation - 14th Annual Conference,
{TAMC} 2017, Bern, Switzerland, April 20-22, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10185},
pages = {304--318},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-55911-7\_22},
doi = {10.1007/978-3-319-55911-7\_22},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/tamc/HanakaBZO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BergBK17,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak},
editor = {Faith Ellen and
Antonina Kolokolova and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips},
booktitle = {Algorithms and Data Structures - 15th International Symposium, {WADS}
2017, St. John's, NL, Canada, July 31 - August 2, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10389},
pages = {289--300},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-62127-2\_25},
doi = {10.1007/978-3-319-62127-2\_25},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wads/BergBK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2017,
editor = {Kim G. Larsen and
Hans L. Bodlaender and
Jean{-}Fran{\c{c}}ois Raskin},
title = {42nd International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark},
series = {LIPIcs},
volume = {83},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-046-0},
isbn = {978-3-95977-046-0},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2017,
editor = {Hans L. Bodlaender and
Gerhard J. Woeginger},
title = {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},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-68705-6},
doi = {10.1007/978-3-319-68705-6},
isbn = {978-3-319-68704-9},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2017.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BergBK17,
author = {Mark de Berg and
Hans L. Bodlaender and
S{\'{a}}ndor Kisfaludi{-}Bak},
title = {The Homogeneous Broadcast Problem in Narrow and Wide Strips},
journal = {CoRR},
volume = {abs/1705.01465},
year = {2017},
url = {http://arxiv.org/abs/1705.01465},
eprinttype = {arXiv},
eprint = {1705.01465},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BergBK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BodewesBCW17,
author = {Jelco M. Bodewes and
Hans L. Bodlaender and
Gunther Cornelissen and
Marieke van der Wegen},
title = {Recognizing hyperelliptic graphs in polynomial time},
journal = {CoRR},
volume = {abs/1706.05670},
year = {2017},
url = {http://arxiv.org/abs/1706.05670},
eprinttype = {arXiv},
eprint = {1706.05670},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BodewesBCW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-09990,
author = {Tom C. van der Zanden and
Hans L. Bodlaender},
title = {Computing Treewidth on the {GPU}},
journal = {CoRR},
volume = {abs/1709.09990},
year = {2017},
url = {http://arxiv.org/abs/1709.09990},
eprinttype = {arXiv},
eprint = {1709.09990},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-09990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BodlaenderFLPST16,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Daniel Lokshtanov and
Eelko Penninkx and
Saket Saurabh and
Dimitrios M. Thilikos},
title = {(Meta) Kernelization},
journal = {J. {ACM}},
volume = {63},
number = {5},
pages = {44:1--44:69},
year = {2016},
url = {https://doi.org/10.1145/2973749},
doi = {10.1145/2973749},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/BodlaenderFLPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderR16,
author = {Hans L. Bodlaender and
Johan M. M. van Rooij},
title = {Exact Algorithms for Intervalizing Coloured Graphs},
journal = {Theory Comput. Syst.},
volume = {58},
number = {2},
pages = {273--286},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9616-6},
doi = {10.1007/S00224-015-9616-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BodlaenderDDFLP16,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {A c\({}^{\mbox{k}}\) n 5-Approximation Algorithm for Treewidth},
journal = {{SIAM} J. Comput.},
volume = {45},
number = {2},
pages = {317--378},
year = {2016},
url = {https://doi.org/10.1137/130947374},
doi = {10.1137/130947374},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BodlaenderDDFLP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderNZ16,
author = {Hans L. Bodlaender and
Jesper Nederlof and
Tom C. van der Zanden},
editor = {Ioannis Chatzigiannakis and
Michael Mitzenmacher and
Yuval Rabani and
Davide Sangiorgi},
title = {Subexponential Time Algorithms for Embedding H-Minor Free Graphs},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2016, July 11-15, 2016, Rome, Italy},
series = {LIPIcs},
volume = {55},
pages = {9:1--9:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2016.9},
doi = {10.4230/LIPICS.ICALP.2016.9},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderNZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BodlaenderOO16,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
editor = {Seok{-}Hee Hong},
title = {Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes
and Parameterized Complexity},
booktitle = {27th International Symposium on Algorithms and Computation, {ISAAC}
2016, December 12-14, 2016, Sydney, Australia},
series = {LIPIcs},
volume = {64},
pages = {20:1--20:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.ISAAC.2016.20},
doi = {10.4230/LIPICS.ISAAC.2016.20},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/BodlaenderOO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderOO16,
author = {Hans L. Bodlaender and
Hirotaka Ono and
Yota Otachi},
editor = {Jiong Guo and
Danny Hermelin},
title = {A Faster Parameterized Algorithm for Pseudoforest Deletion},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {7:1--7:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.7},
doi = {10.4230/LIPICS.IPEC.2016.7},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderOO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/PinoBR16,
author = {Willem J. A. Pino and
Hans L. Bodlaender and
Johan M. M. van Rooij},
editor = {Jiong Guo and
Danny Hermelin},
title = {Cut and Count and Representative Sets on Branch Decompositions},
booktitle = {11th International Symposium on Parameterized and Exact Computation,
{IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
series = {LIPIcs},
volume = {63},
pages = {27:1--27:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2016.27},
doi = {10.4230/LIPICS.IPEC.2016.27},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/PinoBR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/AkkerBDHO16,
author = {Marjan van den Akker and
Hans L. Bodlaender and
Thomas C. van Dijk and
Han Hoogeveen and
Erik van Ommeren},
editor = {Rusins Martins Freivalds and
Gregor Engels and
Barbara Catania},
title = {Robust Recoverable Path Using Backup Nodes},
booktitle = {{SOFSEM} 2016: Theory and Practice of Computer Science - 42nd International
Conference on Current Trends in Theory and Practice of Computer Science,
Harrachov, Czech Republic, January 23-28, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9587},
pages = {95--106},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-662-49192-8\_8},
doi = {10.1007/978-3-662-49192-8\_8},
timestamp = {Sat, 10 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/AkkerBDHO16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Bodlaender16,
author = {Hans L. Bodlaender},
title = {Kernelization, Exponential Lower Bounds},
booktitle = {Encyclopedia of Algorithms},
pages = {1013--1017},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_521},
doi = {10.1007/978-1-4939-2864-4\_521},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Bodlaender16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Bodlaender16a,
author = {Hans L. Bodlaender},
title = {Treewidth of Graphs},
booktitle = {Encyclopedia of Algorithms},
pages = {2255--2257},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_431},
doi = {10.1007/978-1-4939-2864-4\_431},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Bodlaender16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BodlaenderN16,
author = {Hans L. Bodlaender and
Jesper Nederlof},
title = {Subexponential time algorithms for finding small tree and path decompositions},
journal = {CoRR},
volume = {abs/1601.02415},
year = {2016},
url = {http://arxiv.org/abs/1601.02415},
eprinttype = {arXiv},
eprint = {1601.02415},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BodlaenderN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BodlaenderZ16,
author = {Hans L. Bodlaender and
Tom C. van der Zanden},
title = {Improved Lower Bounds for Graph Embedding Problems},
journal = {CoRR},
volume = {abs/1610.09130},
year = {2016},
url = {http://arxiv.org/abs/1610.09130},
eprinttype = {arXiv},
eprint = {1610.09130},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BodlaenderZ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FafianieBN15,
author = {Stefan Fafianie and
Hans L. Bodlaender and
Jesper Nederlof},
title = {Speeding Up Dynamic Programming with Representative Sets: An Experimental
Evaluation of Algorithms for Steiner Tree on Tree Decompositions},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {636--660},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9934-0},
doi = {10.1007/S00453-014-9934-0},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FafianieBN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHI15,
author = {Hans L. Bodlaender and
MohammadTaghi Hajiaghayi and
Giuseppe F. Italiano},
title = {Editorial},
journal = {Algorithmica},
volume = {73},
number = {4},
pages = {748--749},
year = {2015},
url = {https://doi.org/10.1007/s00453-015-0074-y},
doi = {10.1007/S00453-015-0074-Y},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHI15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHI15a,
author = {Hans L. Bodlaender and
Mohammad Taghi Hajiaghayi and
Giuseppe F. Italiano},
title = {Erratum to: Editorial},
journal = {Algorithmica},
volume = {73},
number = {4},
pages = {750},
year = {2015},
url = {https://doi.org/10.1007/s00453-015-0091-x},
doi = {10.1007/S00453-015-0091-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHI15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BodlaenderHT15,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Jan Arne Telle},
title = {Recognizability Equals Definability for Graphs of Bounded Treewidth
and Bounded Chordality},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {559--568},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.076},
doi = {10.1016/J.ENDM.2015.06.076},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BodlaenderHT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderCKN15,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Deterministic single exponential time algorithms for connectivity
problems parameterized by treewidth},
journal = {Inf. Comput.},
volume = {243},
pages = {86--111},
year = {2015},
url = {https://doi.org/10.1016/j.ic.2014.12.008},
doi = {10.1016/J.IC.2014.12.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderCKN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderK15,
author = {Hans L. Bodlaender and
Marc J. van Kreveld},
title = {Google Scholar makes it hard - the complexity of organizing one's
publications},
journal = {Inf. Process. Lett.},
volume = {115},
number = {12},
pages = {965--968},
year = {2015},
url = {https://doi.org/10.1016/j.ipl.2015.07.003},
doi = {10.1016/J.IPL.2015.07.003},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderK15.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/ZandenB15,
author = {Tom C. van der Zanden and
Hans L. Bodlaender},
editor = {Vangelis Th. Paschos and
Peter Widmayer},
title = {PSPACE-Completeness of Bloxorz and of Games with 2-Buttons},
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 = {403--415},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-18173-8\_30},
doi = {10.1007/978-3-319-18173-8\_30},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/ZandenB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderN15,
author = {Hans L. Bodlaender and
Jesper Nederlof},
editor = {Nikhil Bansal and
Irene Finocchi},
title = {Subexponential Time Algorithms for Finding Small Tree and Path Decompositions},
booktitle = {Algorithms - {ESA} 2015 - 23rd Annual European Symposium, Patras,
Greece, September 14-16, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9294},
pages = {179--190},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48350-3\_16},
doi = {10.1007/978-3-662-48350-3\_16},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderN15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/JaffkeB15,
author = {Lars Jaffke and
Hans L. Bodlaender},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Definability Equals Recognizability for k-Outerplanar Graphs},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {175--186},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.175},
doi = {10.4230/LIPICS.IPEC.2015.175},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/iwpec/JaffkeB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BrinkeHB15,
author = {Chiel B. Ten Brinke and
Frank J. P. van Houten and
Hans L. Bodlaender},
editor = {Thore Husfeldt and
Iyad A. Kanj},
title = {Practical Algorithms for Linear Boolean-width},
booktitle = {10th International Symposium on Parameterized and Exact Computation,
{IPEC} 2015, September 16-18, 2015, Patras, Greece},
series = {LIPIcs},
volume = {43},
pages = {187--198},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.IPEC.2015.187},
doi = {10.4230/LIPICS.IPEC.2015.187},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BrinkeHB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JaffkeB15,
author = {Lars Jaffke and
Hans L. Bodlaender},
title = {MSOL-Definability Equals Recognizability for Halin Graphs and Bounded
Degree k-Outerplanar Graphs},
journal = {CoRR},
volume = {abs/1503.01604},
year = {2015},
url = {http://arxiv.org/abs/1503.01604},
eprinttype = {arXiv},
eprint = {1503.01604},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JaffkeB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrinkeHB15,
author = {Chiel B. Ten Brinke and
Frank J. P. van Houten and
Hans L. Bodlaender},
title = {Practical Algorithms for Linear Boolean-width},
journal = {CoRR},
volume = {abs/1509.07687},
year = {2015},
url = {http://arxiv.org/abs/1509.07687},
eprinttype = {arXiv},
eprint = {1509.07687},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BrinkeHB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JaffkeB15a,
author = {Lars Jaffke and
Hans L. Bodlaender},
title = {Definability Equals Recognizability for {\textdollar}k{\textdollar}-Outerplanar
Graphs},
journal = {CoRR},
volume = {abs/1509.08315},
year = {2015},
url = {http://arxiv.org/abs/1509.08315},
eprinttype = {arXiv},
eprint = {1509.08315},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JaffkeB15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BetzlerBBNU14,
author = {Nadja Betzler and
Hans L. Bodlaender and
Robert Bredereck and
Rolf Niedermeier and
Johannes Uhlmann},
title = {On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion},
journal = {Algorithmica},
volume = {68},
number = {3},
pages = {715--738},
year = {2014},
url = {https://doi.org/10.1007/s00453-012-9695-6},
doi = {10.1007/S00453-012-9695-6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BetzlerBBNU14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderJK14,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernelization Lower Bounds by Cross-Composition},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {277--305},
year = {2014},
url = {https://doi.org/10.1137/120880240},
doi = {10.1137/120880240},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderJK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/RietbergenGB14,
author = {Merel T. Rietbergen and
Linda C. van der Gaag and
Hans L. Bodlaender},
editor = {Torsten Schaub and
Gerhard Friedrich and
Barry O'Sullivan},
title = {Provisional Propagation for Verifying Monotonicity of Bayesian Networks},
booktitle = {{ECAI} 2014 - 21st European Conference on Artificial Intelligence,
18-22 August 2014, Prague, Czech Republic - Including Prestigious
Applications of Intelligent Systems {(PAIS} 2014)},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {263},
pages = {759--764},
publisher = {{IOS} Press},
year = {2014},
url = {https://doi.org/10.3233/978-1-61499-419-0-759},
doi = {10.3233/978-1-61499-419-0-759},
timestamp = {Mon, 19 Jun 2023 16:36:09 +0200},
biburl = {https://dblp.org/rec/conf/ecai/RietbergenGB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Bodlaender14,
author = {Hans L. Bodlaender},
editor = {Marek Cygan and
Pinar Heggernes},
title = {Lower Bounds for Kernelization},
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 = {1--14},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13524-3\_1},
doi = {10.1007/978-3-319-13524-3\_1},
timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Bodlaender14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BodlaenderK14,
author = {Hans L. Bodlaender and
Marc J. van Kreveld},
title = {Google Scholar makes it Hard - the complexity of organizing one's
publications},
journal = {CoRR},
volume = {abs/1410.3820},
year = {2014},
url = {http://arxiv.org/abs/1410.3820},
eprinttype = {arXiv},
eprint = {1410.3820},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BodlaenderK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ZandenB14,
author = {Tom C. van der Zanden and
Hans L. Bodlaender},
title = {PSPACE-completeness of Bloxorz and of Games with 2-Buttons},
journal = {CoRR},
volume = {abs/1411.5951},
year = {2014},
url = {http://arxiv.org/abs/1411.5951},
eprinttype = {arXiv},
eprint = {1411.5951},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ZandenB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BodlaenderHL14,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Daniel Lokshtanov},
title = {Graph Modification Problems (Dagstuhl Seminar 14071)},
journal = {Dagstuhl Reports},
volume = {4},
number = {2},
pages = {38--59},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.2.38},
doi = {10.4230/DAGREP.4.2.38},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BodlaenderHL14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/RooijNB13,
author = {Johan M. M. van Rooij and
Marcel E. van Kooten Niekerk and
Hans L. Bodlaender},
title = {Partition Into Triangles on Bounded Degree Graphs},
journal = {Theory Comput. Syst.},
volume = {52},
number = {4},
pages = {687--718},
year = {2013},
url = {https://doi.org/10.1007/s00224-012-9412-5},
doi = {10.1007/S00224-012-9412-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/RooijNB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/JansenB13,
author = {Bart M. P. Jansen and
Hans L. Bodlaender},
title = {Vertex Cover Kernelization Revisited - Upper and Lower Bounds for
a Refined Parameter},
journal = {Theory Comput. Syst.},
volume = {53},
number = {2},
pages = {263--299},
year = {2013},
url = {https://doi.org/10.1007/s00224-012-9393-4},
doi = {10.1007/S00224-012-9393-4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/JansenB13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderJK13,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {2108--2142},
year = {2013},
url = {https://doi.org/10.1137/120903518},
doi = {10.1137/120903518},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderJK13,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernel bounds for path and cycle problems},
journal = {Theor. Comput. Sci.},
volume = {511},
pages = {117--136},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.09.006},
doi = {10.1016/J.TCS.2012.09.006},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderJK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodlaenderDDFLP13,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {An O(c{\^{}}k n) 5-Approximation Algorithm for Treewidth},
booktitle = {54th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2013, 26-29 October, 2013, Berkeley, CA, {USA}},
pages = {499--508},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/FOCS.2013.60},
doi = {10.1109/FOCS.2013.60},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodlaenderDDFLP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderCKN13,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
editor = {Fedor V. Fomin and
Rusins Freivalds and
Marta Z. Kwiatkowska and
David Peleg},
title = {Deterministic Single Exponential Time Algorithms for Connectivity
Problems Parameterized by Treewidth},
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 = {196--207},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39206-1\_17},
doi = {10.1007/978-3-642-39206-1\_17},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderCKN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderBL13,
author = {Hans L. Bodlaender and
Paul S. Bonsma and
Daniel Lokshtanov},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {The Fine Details of Fast Dynamic Programming over Tree Decompositions},
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 = {41--53},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_5},
doi = {10.1007/978-3-319-03898-8\_5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderBL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/FafianieBN13,
author = {Stefan Fafianie and
Hans L. Bodlaender and
Jesper Nederlof},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Speeding Up Dynamic Programming with Representative Sets - An Experimental
Evaluation of Algorithms for Steiner Tree on Tree Decompositions},
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 = {321--334},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_27},
doi = {10.1007/978-3-319-03898-8\_27},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/FafianieBN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderKK13,
author = {Hans L. Bodlaender and
Stefan Kratsch and
Vincent J. C. Kreuzen},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Fixed-Parameter Tractability and Characterizations of Small Special
Treewidth},
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 = {88--99},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_9},
doi = {10.1007/978-3-642-45043-3\_9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderKK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/esa/2013,
editor = {Hans L. Bodlaender and
Giuseppe F. Italiano},
title = {Algorithms - {ESA} 2013 - 21st Annual European Symposium, Sophia Antipolis,
France, September 2-4, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8125},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40450-4},
doi = {10.1007/978-3-642-40450-4},
isbn = {978-3-642-40449-8},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/2013.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1301-2256,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster and
Frank van den Eijkhof and
Linda C. van der Gaag},
title = {Pre-processing for Triangulation of Probabilistic Networks},
journal = {CoRR},
volume = {abs/1301.2256},
year = {2013},
url = {http://arxiv.org/abs/1301.2256},
eprinttype = {arXiv},
eprint = {1301.2256},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1301-2256.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-6321,
author = {Hans L. Bodlaender and
P{\aa}l Gr{\o}n{\aa}s Drange and
Markus S. Dregi and
Fedor V. Fomin and
Daniel Lokshtanov and
Michal Pilipczuk},
title = {A O(c{\^{}}k n) 5-Approximation Algorithm for Treewidth},
journal = {CoRR},
volume = {abs/1304.6321},
year = {2013},
url = {http://arxiv.org/abs/1304.6321},
eprinttype = {arXiv},
eprint = {1304.6321},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-6321.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/FafianieBN13,
author = {Stefan Fafianie and
Hans L. Bodlaender and
Jesper Nederlof},
title = {Speeding-up Dynamic Programming with Representative Sets - An Experimental
Evaluation of Algorithms for Steiner Tree on Tree Decompositions},
journal = {CoRR},
volume = {abs/1305.7448},
year = {2013},
url = {http://arxiv.org/abs/1305.7448},
eprinttype = {arXiv},
eprint = {1305.7448},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FafianieBN13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderFGOL12,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Petr A. Golovach and
Yota Otachi and
Erik Jan van Leeuwen},
title = {Parameterized Complexity of the Spanning Tree Congestion Problem},
journal = {Algorithmica},
volume = {64},
number = {1},
pages = {85--111},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9565-7},
doi = {10.1007/S00453-011-9565-7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderFGOL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/RooijB12,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender},
title = {Exact Algorithms for Edge Domination},
journal = {Algorithmica},
volume = {64},
number = {4},
pages = {535--563},
year = {2012},
url = {https://doi.org/10.1007/s00453-011-9546-x},
doi = {10.1007/S00453-011-9546-X},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/RooijB12.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/scheduling/BodlaenderSW12,
author = {Hans L. Bodlaender and
Petra Schuurman and
Gerhard J. Woeginger},
title = {Scheduling of pipelined operator graphs},
journal = {J. Sched.},
volume = {15},
number = {3},
pages = {323--332},
year = {2012},
url = {https://doi.org/10.1007/s10951-011-0225-1},
doi = {10.1007/S10951-011-0225-1},
timestamp = {Wed, 01 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/scheduling/BodlaenderSW12.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}
}
@article{DBLP:journals/tcs/BodlaenderH12,
author = {Hans L. Bodlaender and
Jurriaan Hage},
title = {On switching classes, NLC-width, cliquewidth and treewidth},
journal = {Theor. Comput. Sci.},
volume = {429},
pages = {30--35},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.12.021},
doi = {10.1016/J.TCS.2011.12.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderH12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/birthday/Bodlaender12,
author = {Hans L. Bodlaender},
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {Fixed-Parameter Tractability of Treewidth and Pathwidth},
booktitle = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
pages = {196--227},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8\_12},
doi = {10.1007/978-3-642-30891-8\_12},
timestamp = {Mon, 03 Jan 2022 22:35:50 +0100},
biburl = {https://dblp.org/rec/conf/birthday/Bodlaender12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderJK12,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Fedor V. Fomin and
Petteri Kaski},
title = {Kernel Bounds for Structural Parameterizations of Pathwidth},
booktitle = {Algorithm Theory - {SWAT} 2012 - 13th Scandinavian Symposium and Workshops,
Helsinki, Finland, July 4-6, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7357},
pages = {352--363},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31155-0\_31},
doi = {10.1007/978-3-642-31155-0\_31},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderJK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/birthday/2012fellows,
editor = {Hans L. Bodlaender and
Rod Downey and
Fedor V. Fomin and
D{\'{a}}niel Marx},
title = {The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated
to Michael R. Fellows on the Occasion of His 60th Birthday},
series = {Lecture Notes in Computer Science},
volume = {7370},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-30891-8},
doi = {10.1007/978-3-642-30891-8},
isbn = {978-3-642-30890-1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/birthday/2012fellows.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-5941,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernelization Lower Bounds By Cross-Composition},
journal = {CoRR},
volume = {abs/1206.5941},
year = {2012},
url = {http://arxiv.org/abs/1206.5941},
eprinttype = {arXiv},
eprint = {1206.5941},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1206-5941.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4160,
author = {Linda C. van der Gaag and
Hans L. Bodlaender and
Ad Feelders},
title = {Monotonicity in Bayesian Networks},
journal = {CoRR},
volume = {abs/1207.4160},
year = {2012},
url = {http://arxiv.org/abs/1207.4160},
eprinttype = {arXiv},
eprint = {1207.4160},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-4160.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-4900,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernel Bounds for Structural Parameterizations of Pathwidth},
journal = {CoRR},
volume = {abs/1207.4900},
year = {2012},
url = {http://arxiv.org/abs/1207.4900},
eprinttype = {arXiv},
eprint = {1207.4900},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-4900.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1505,
author = {Hans L. Bodlaender and
Marek Cygan and
Stefan Kratsch and
Jesper Nederlof},
title = {Solving weighted and counting variants of connectivity problems parameterized
by treewidth deterministically in single exponential time},
journal = {CoRR},
volume = {abs/1211.1505},
year = {2012},
url = {http://arxiv.org/abs/1211.1505},
eprinttype = {arXiv},
eprint = {1211.1505},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1505.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderFLRRW11,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael A. Langston and
Mark A. Ragan and
Frances A. Rosamond and
Mark Weyer},
title = {Quadratic Kernelization for Convex Recoloring of Trees},
journal = {Algorithmica},
volume = {61},
number = {2},
pages = {362--388},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9404-2},
doi = {10.1007/S00453-010-9404-2},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderFLRRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderHV11,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Yngve Villanger},
title = {Faster Parameterized Algorithms for Minimum Fill-in},
journal = {Algorithmica},
volume = {61},
number = {4},
pages = {817--838},
year = {2011},
url = {https://doi.org/10.1007/s00453-010-9421-1},
doi = {10.1007/S00453-010-9421-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderHV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/RooijB11,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender},
title = {Exact algorithms for dominating set},
journal = {Discret. Appl. Math.},
volume = {159},
number = {17},
pages = {2147--2164},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.07.001},
doi = {10.1016/J.DAM.2011.07.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/RooijB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BodlaenderKMO11,
author = {Hans L. Bodlaender and
Kyohei Kozawa and
Takayoshi Matsushima and
Yota Otachi},
title = {Spanning tree congestion of k-outerplanar graphs},
journal = {Discret. Math.},
volume = {311},
number = {12},
pages = {1040--1045},
year = {2011},
url = {https://doi.org/10.1016/j.disc.2011.03.002},
doi = {10.1016/J.DISC.2011.03.002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BodlaenderKMO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderK11,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
title = {Treewidth computations {II.} Lower bounds},
journal = {Inf. Comput.},
volume = {209},
number = {7},
pages = {1103--1119},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2011.04.003},
doi = {10.1016/J.IC.2011.04.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderTY11,
author = {Hans L. Bodlaender and
St{\'{e}}phan Thomass{\'{e}} and
Anders Yeo},
title = {Kernel bounds for disjoint cycles and disjoint paths},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {35},
pages = {4570--4578},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.04.039},
doi = {10.1016/J.TCS.2011.04.039},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderTY11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecsqaru/GaagB11,
author = {Linda C. van der Gaag and
Hans L. Bodlaender},
editor = {Weiru Liu},
title = {On Stopping Evidence Gathering for Diagnostic Bayesian Networks},
booktitle = {Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- 11th European Conference, {ECSQARU} 2011, Belfast, UK, June 29-July
1, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6717},
pages = {170--181},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22152-1\_15},
doi = {10.1007/978-3-642-22152-1\_15},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ecsqaru/GaagB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderJK11,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {437--448},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_37},
doi = {10.1007/978-3-642-22006-7\_37},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderJK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderJK11,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Kernel Bounds for Path and Cycle Problems},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {145--158},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_12},
doi = {10.1007/978-3-642-28050-4\_12},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderJK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/KwisthoutBG11,
author = {Johan Kwisthout and
Hans L. Bodlaender and
Linda C. van der Gaag},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {The Complexity of Finding \emph{k}th Most Probable Explanations in
Probabilistic Networks},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {356--367},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_30},
doi = {10.1007/978-3-642-18381-2\_30},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/KwisthoutBG11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/OverwijkPB11,
author = {Arnold Overwijk and
Eelko Penninkx and
Hans L. Bodlaender},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {A Local Search Algorithm for Branchwidth},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {444--454},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_37},
doi = {10.1007/978-3-642-18381-2\_37},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/OverwijkPB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/RooijNB11,
author = {Johan M. M. van Rooij and
Marcel E. van Kooten Niekerk and
Hans L. Bodlaender},
editor = {Ivana Cern{\'{a}} and
Tibor Gyim{\'{o}}thy and
Juraj Hromkovic and
Keith G. Jeffery and
Rastislav Kr{\'{a}}lovic and
Marko Vukolic and
Stefan Wolf},
title = {Partition into Triangles on Bounded Degree Graphs},
booktitle = {{SOFSEM} 2011: Theory and Practice of Computer Science - 37th Conference
on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
Smokovec, Slovakia, January 22-28, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6543},
pages = {558--569},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-18381-2\_46},
doi = {10.1007/978-3-642-18381-2\_46},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/RooijNB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderJK11,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Cross-Composition: {A} New Technique for Kernelization Lower Bounds},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {165--176},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.165},
doi = {10.4230/LIPICS.STACS.2011.165},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/JansenB11,
author = {Bart M. P. Jansen and
Hans L. Bodlaender},
editor = {Thomas Schwentick and
Christoph D{\"{u}}rr},
title = {Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a
Refined Parameter},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2011, March 10-12, 2011, Dortmund, Germany},
series = {LIPIcs},
volume = {9},
pages = {177--188},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2011},
url = {https://doi.org/10.4230/LIPIcs.STACS.2011.177},
doi = {10.4230/LIPICS.STACS.2011.177},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/JansenB11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tapas/BodlaenderR11,
author = {Hans L. Bodlaender and
Johan M. M. van Rooij},
editor = {Alberto Marchetti{-}Spaccamela and
Michael Segal},
title = {Exact Algorithms for Intervalizing Colored Graphs},
booktitle = {Theory and Practice of Algorithms in (Computer) Systems - First International
{ICST} Conference, {TAPAS} 2011, Rome, Italy, April 18-20, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6595},
pages = {45--56},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-19754-3\_7},
doi = {10.1007/978-3-642-19754-3\_7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tapas/BodlaenderR11.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}
}
@article{DBLP:journals/corr/abs-1104-4217,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Preprocessing for Treewidth: {A} Combinatorial Analysis through Kernelization},
journal = {CoRR},
volume = {abs/1104.4217},
year = {2011},
url = {http://arxiv.org/abs/1104.4217},
eprinttype = {arXiv},
eprint = {1104.4217},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1104-4217.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1106-4141,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Kernel Bounds for Path and Cycle Problems},
journal = {CoRR},
volume = {abs/1106.4141},
year = {2011},
url = {http://arxiv.org/abs/1106.4141},
eprinttype = {arXiv},
eprint = {1106.4141},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1106-4141.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DornPBF10,
author = {Frederic Dorn and
Eelko Penninkx and
Hans L. Bodlaender and
Fedor V. Fomin},
title = {Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut
Decompositions},
journal = {Algorithmica},
volume = {58},
number = {3},
pages = {790--810},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9296-1},
doi = {10.1007/S00453-009-9296-1},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/DornPBF10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderK10,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
title = {Treewidth computations I. Upper bounds},
journal = {Inf. Comput.},
volume = {208},
number = {3},
pages = {259--275},
year = {2010},
url = {https://doi.org/10.1016/j.ic.2009.03.008},
doi = {10.1016/J.IC.2009.03.008},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/informs/BodlaenderHGG10,
author = {Hans L. Bodlaender and
Albert Hendriks and
Alexander Grigoriev and
Nadejda V. Grigorieva},
title = {The Valve Location Problem in Simple Network Topologies},
journal = {{INFORMS} J. Comput.},
volume = {22},
number = {3},
pages = {433--442},
year = {2010},
url = {https://doi.org/10.1287/ijoc.1090.0365},
doi = {10.1287/IJOC.1090.0365},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/informs/BodlaenderHGG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BodlaenderD10,
author = {Hans L. Bodlaender and
Thomas C. van Dijk},
title = {A Cubic Kernel for Feedback Vertex Set and Loop Cutset},
journal = {Theory Comput. Syst.},
volume = {46},
number = {3},
pages = {566--597},
year = {2010},
url = {https://doi.org/10.1007/s00224-009-9234-2},
doi = {10.1007/S00224-009-9234-2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/BodlaenderD10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderFHMPR10,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos and
Frances A. Rosamond},
title = {Clustering with partial information},
journal = {Theor. Comput. Sci.},
volume = {411},
number = {7-9},
pages = {1202--1211},
year = {2010},
url = {https://doi.org/10.1016/j.tcs.2009.12.016},
doi = {10.1016/J.TCS.2009.12.016},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderFHMPR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/KwisthoutBG10,
author = {Johan Kwisthout and
Hans L. Bodlaender and
Linda C. van der Gaag},
editor = {Helder Coelho and
Rudi Studer and
Michael J. Wooldridge},
title = {The Necessity of Bounded Treewidth for Efficient Inference in Bayesian
Networks},
booktitle = {{ECAI} 2010 - 19th European Conference on Artificial Intelligence,
Lisbon, Portugal, August 16-20, 2010, Proceedings},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {215},
pages = {237--242},
publisher = {{IOS} Press},
year = {2010},
url = {http://www.booksonline.iospress.nl/Content/View.aspx?piid=17749},
timestamp = {Fri, 26 Apr 2019 14:26:43 +0200},
biburl = {https://dblp.org/rec/conf/ecai/KwisthoutBG10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodlaenderLRV10,
author = {Hans L. Bodlaender and
Erik Jan van Leeuwen and
Johan M. M. van Rooij and
Martin Vatshelle},
editor = {Petr Hlinen{\'{y}} and
Anton{\'{\i}}n Kucera},
title = {Faster Algorithms on Branch and Clique Decompositions},
booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6281},
pages = {174--185},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15155-2\_17},
doi = {10.1007/978-3-642-15155-2\_17},
timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderLRV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/BodlaenderC10,
author = {Hans L. Bodlaender and
Marc Comas},
editor = {Jan van Leeuwen and
Anca Muscholl and
David Peleg and
Jaroslav Pokorn{\'{y}} and
Bernhard Rumpe},
title = {A Kernel for Convex Recoloring of Weighted Forests},
booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {212--223},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11266-9\_18},
doi = {10.1007/978-3-642-11266-9\_18},
timestamp = {Sat, 30 Sep 2023 09:57:10 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/BodlaenderC10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/OtachiBL10,
author = {Yota Otachi and
Hans L. Bodlaender and
Erik Jan van Leeuwen},
editor = {Dimitrios M. Thilikos},
title = {Complexity Results for the Spanning Tree Congestion Problem},
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 = {3--14},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_3},
doi = {10.1007/978-3-642-16926-7\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/OtachiBL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-4224,
author = {Hans L. Bodlaender and
Bart M. P. Jansen and
Stefan Kratsch},
title = {Cross-Composition: {A} New Technique for Kernelization Lower Bounds},
journal = {CoRR},
volume = {abs/1011.4224},
year = {2010},
url = {http://arxiv.org/abs/1011.4224},
eprinttype = {arXiv},
eprint = {1011.4224},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-4224.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-4701,
author = {Bart M. P. Jansen and
Hans L. Bodlaender},
title = {Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a
Refined Parameter},
journal = {CoRR},
volume = {abs/1012.4701},
year = {2010},
url = {http://arxiv.org/abs/1012.4701},
eprinttype = {arXiv},
eprint = {1012.4701},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-4701.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/comgeo/BodlaenderFGPSW09,
author = {Hans L. Bodlaender and
Corinne Feremans and
Alexander Grigoriev and
Eelko Penninkx and
Ren{\'{e}} Sitters and
Thomas Wolle},
title = {On the minimum corridor connection problem and other generalized geometric
problems},
journal = {Comput. Geom.},
volume = {42},
number = {9},
pages = {939--951},
year = {2009},
url = {https://doi.org/10.1016/j.comgeo.2009.05.001},
doi = {10.1016/J.COMGEO.2009.05.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/comgeo/BodlaenderFGPSW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BodlaenderFT09,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Dimitrios M. Thilikos},
title = {Derivation of algorithms for cutwidth and related graph layout parameters},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {4},
pages = {231--244},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2008.10.003},
doi = {10.1016/J.JCSS.2008.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BodlaenderFT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BodlaenderDFH09,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Danny Hermelin},
title = {On problems without polynomial kernels},
journal = {J. Comput. Syst. Sci.},
volume = {75},
number = {8},
pages = {423--434},
year = {2009},
url = {https://doi.org/10.1016/j.jcss.2009.04.001},
doi = {10.1016/J.JCSS.2009.04.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/BodlaenderDFH09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AltBKRT09,
author = {Helmut Alt and
Hans L. Bodlaender and
Marc J. van Kreveld and
G{\"{u}}nter Rote and
Gerard Tel},
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
journal = {Theory Comput. Syst.},
volume = {44},
number = {2},
pages = {160--174},
year = {2009},
url = {https://doi.org/10.1007/s00224-008-9104-3},
doi = {10.1007/S00224-008-9104-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AltBKRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/RooijBR09,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender and
Peter Rossmanith},
editor = {Amos Fiat and
Peter Sanders},
title = {Dynamic Programming on Tree Decompositions Using Generalised Fast
Subset Convolution},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {566--577},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_51},
doi = {10.1007/978-3-642-04128-0\_51},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/RooijBR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderTY09,
author = {Hans L. Bodlaender and
St{\'{e}}phan Thomass{\'{e}} and
Anders Yeo},
editor = {Amos Fiat and
Peter Sanders},
title = {Kernel Bounds for Disjoint Cycles and Disjoint Paths},
booktitle = {Algorithms - {ESA} 2009, 17th Annual European Symposium, Copenhagen,
Denmark, September 7-9, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5757},
pages = {635--646},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04128-0\_57},
doi = {10.1007/978-3-642-04128-0\_57},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderTY09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BodlaenderFLPST09,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Daniel Lokshtanov and
Eelko Penninkx and
Saket Saurabh and
Dimitrios M. Thilikos},
title = {(Meta) Kernelization},
booktitle = {50th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2009, October 25-27, 2009, Atlanta, Georgia, {USA}},
pages = {629--638},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/FOCS.2009.46},
doi = {10.1109/FOCS.2009.46},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/BodlaenderFLPST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Bodlaender09,
author = {Hans L. Bodlaender},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Kernelization: New Upper and Lower Bound Techniques},
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 = {17--37},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_2},
doi = {10.1007/978-3-642-11269-0\_2},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/Bodlaender09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderLP09,
author = {Hans L. Bodlaender and
Daniel Lokshtanov and
Eelko Penninkx},
editor = {Jianer Chen and
Fedor V. Fomin},
title = {Planar Capacitated Dominating Set Is \emph{W}[1]-Hard},
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 = {50--60},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11269-0\_4},
doi = {10.1007/978-3-642-11269-0\_4},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderLP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0904-0727,
author = {Hans L. Bodlaender and
Fedor V. Fomin and
Daniel Lokshtanov and
Eelko Penninkx and
Saket Saurabh and
Dimitrios M. Thilikos},
title = {(Meta) Kernelization},
journal = {CoRR},
volume = {abs/0904.0727},
year = {2009},
url = {http://arxiv.org/abs/0904.0727},
eprinttype = {arXiv},
eprint = {0904.0727},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0904-0727.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderGK08,
author = {Hans L. Bodlaender and
Alexander Grigoriev and
Arie M. C. A. Koster},
title = {Treewidth Lower Bounds with Brambles},
journal = {Algorithmica},
volume = {51},
number = {1},
pages = {81--98},
year = {2008},
url = {https://doi.org/10.1007/s00453-007-9056-z},
doi = {10.1007/S00453-007-9056-Z},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderGK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/BodlaenderK08,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
title = {Combinatorial Optimization on Graphs of Bounded Treewidth},
journal = {Comput. J.},
volume = {51},
number = {3},
pages = {255--269},
year = {2008},
url = {https://doi.org/10.1093/comjnl/bxm037},
doi = {10.1093/COMJNL/BXM037},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/BodlaenderK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderDFH08,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Danny Hermelin},
editor = {Luca Aceto and
Ivan Damg{\aa}rd and
Leslie Ann Goldberg and
Magn{\'{u}}s M. Halld{\'{o}}rsson and
Anna Ing{\'{o}}lfsd{\'{o}}ttir and
Igor Walukiewicz},
title = {On Problems without Polynomial Kernels (Extended Abstract)},
booktitle = {Automata, Languages and Programming, 35th International Colloquium,
{ICALP} 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part
{I:} Tack {A:} Algorithms, Automata, Complexity, and Games},
series = {Lecture Notes in Computer Science},
volume = {5125},
pages = {563--574},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-70575-8\_46},
doi = {10.1007/978-3-540-70575-8\_46},
timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderDFH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BodlaenderHV08,
author = {Hans L. Bodlaender and
Pinar Heggernes and
Yngve Villanger},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {Faster Parameterized Algorithms for Minimum Fill-In},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {282--293},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_27},
doi = {10.1007/978-3-540-92182-0\_27},
timestamp = {Thu, 27 Apr 2023 14:57:19 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BodlaenderHV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BodlaenderPT08,
author = {Hans L. Bodlaender and
Eelko Penninkx and
Richard B. Tan},
editor = {Seok{-}Hee Hong and
Hiroshi Nagamochi and
Takuro Fukunaga},
title = {A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs},
booktitle = {Algorithms and Computation, 19th International Symposium, {ISAAC}
2008, Gold Coast, Australia, December 15-17, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5369},
pages = {306--317},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92182-0\_29},
doi = {10.1007/978-3-540-92182-0\_29},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BodlaenderPT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderP08,
author = {Hans L. Bodlaender and
Eelko Penninkx},
editor = {Martin Grohe and
Rolf Niedermeier},
title = {A Linear Kernel for Planar Feedback Vertex Set},
booktitle = {Parameterized and Exact Computation, Third International Workshop,
{IWPEC} 2008, Victoria, Canada, May 14-16, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5018},
pages = {160--171},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79723-4\_16},
doi = {10.1007/978-3-540-79723-4\_16},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderP08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/RooijB08,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender},
editor = {Martin Grohe and
Rolf Niedermeier},
title = {Exact Algorithms for Edge Domination},
booktitle = {Parameterized and Exact Computation, Third International Workshop,
{IWPEC} 2008, Victoria, Canada, May 14-16, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5018},
pages = {214--225},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79723-4\_20},
doi = {10.1007/978-3-540-79723-4\_20},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/RooijB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodlaenderFHMPR08,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Pinar Heggernes and
Federico Mancini and
Charis Papadopoulos and
Frances A. Rosamond},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Clustering with Partial Information},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {144--155},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_11},
doi = {10.1007/978-3-540-85238-4\_11},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderFHMPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/RooijB08,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender},
editor = {Susanne Albers and
Pascal Weil},
title = {Design by Measure and Conquer, {A} Faster Exact Algorithm for Dominating
Set},
booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
Science, Bordeaux, France, February 21-23, 2008, Proceedings},
series = {LIPIcs},
volume = {1},
pages = {657--668},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1329},
doi = {10.4230/LIPICS.STACS.2008.1329},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/RooijB08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderTDL08,
author = {Hans L. Bodlaender and
Richard B. Tan and
Thomas C. van Dijk and
Jan van Leeuwen},
editor = {Joachim Gudmundsson},
title = {Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint},
booktitle = {Algorithm Theory - {SWAT} 2008, 11th Scandinavian Workshop on Algorithm
Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5124},
pages = {102--113},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-69903-3\_11},
doi = {10.1007/978-3-540-69903-3\_11},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderTDL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderGGH08,
author = {Hans L. Bodlaender and
Alexander Grigoriev and
Nadejda V. Grigorieva and
Albert Hendriks},
editor = {Hajo Broersma and
Thomas Erlebach and
Tom Friedetzky and
Dani{\"{e}}l Paulusma},
title = {The Valve Location Problem in Simple Network Topologies},
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 = {55--65},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-92248-3\_6},
doi = {10.1007/978-3-540-92248-3\_6},
timestamp = {Sun, 25 Oct 2020 23:07:56 +0100},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderGGH08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Bodlaender08,
author = {Hans L. Bodlaender},
editor = {Ming{-}Yang Kao},
title = {Treewidth of Graphs},
booktitle = {Encyclopedia of Algorithms - 2008 Edition},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-0-387-30162-4\_431},
doi = {10.1007/978-0-387-30162-4\_431},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Bodlaender08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2827,
author = {Johan M. M. van Rooij and
Hans L. Bodlaender},
title = {Design by Measure and Conquer, {A} Faster Exact Algorithm for Dominating
Set},
journal = {CoRR},
volume = {abs/0802.2827},
year = {2008},
url = {http://arxiv.org/abs/0802.2827},
eprinttype = {arXiv},
eprint = {0802.2827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EijkhofBK07,
author = {Frank van den Eijkhof and
Hans L. Bodlaender and
Arie M. C. A. Koster},
title = {Safe Reduction Rules for Weighted Treewidth},
journal = {Algorithmica},
volume = {47},
number = {2},
pages = {139--158},
year = {2007},
url = {https://doi.org/10.1007/s00453-006-1226-x},
doi = {10.1007/S00453-006-1226-X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/EijkhofBK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/GrigorievB07,
author = {Alexander Grigoriev and
Hans L. Bodlaender},
title = {Algorithms for Graphs Embeddable with Few Crossings per Edge},
journal = {Algorithmica},
volume = {49},
number = {1},
pages = {1--11},
year = {2007},
url = {https://doi.org/10.1007/s00453-007-0010-x},
doi = {10.1007/S00453-007-0010-X},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/GrigorievB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderK07,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
title = {On the maximum cardinality search lower bound for treewidth},
journal = {Discret. Appl. Math.},
volume = {155},
number = {11},
pages = {1348--1372},
year = {2007},
url = {https://doi.org/10.1016/j.dam.2007.02.004},
doi = {10.1016/J.DAM.2007.02.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BodlaenderFLRRW07,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael A. Langston and
Mark A. Ragan and
Frances A. Rosamond and
Mark Weyer},
editor = {Guohui Lin},
title = {Quadratic Kernelization for Convex Recoloring of Trees},
booktitle = {Computing and Combinatorics, 13th Annual International Conference,
{COCOON} 2007, Banff, Canada, July 16-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4598},
pages = {86--96},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73545-8\_11},
doi = {10.1007/978-3-540-73545-8\_11},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BodlaenderFLRRW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/BodlaenderGGH07,
author = {Hans L. Bodlaender and
Alexander Grigoriev and
Nadejda V. Grigorieva and
Albert Hendriks},
editor = {Johann L. Hurink and
Walter Kern and
Gerhard F. Post and
Georg Still},
title = {The valve location problem},
booktitle = {Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization,
University of Twente, Enschede, The Netherlands, 29-31 May, 2007},
pages = {13--16},
publisher = {University of Twente},
year = {2007},
timestamp = {Mon, 06 Apr 2020 17:04:26 +0200},
biburl = {https://dblp.org/rec/conf/colognetwente/BodlaenderGGH07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecsqaru/KwisthoutBT07,
author = {Johan Kwisthout and
Hans L. Bodlaender and
Gerard Tel},
editor = {Khaled Mellouli},
title = {Local Monotonicity in Probabilistic Networks},
booktitle = {Symbolic and Quantitative Approaches to Reasoning with Uncertainty,
9th European Conference, {ECSQARU} 2007, Hammamet, Tunisia, October
31 - November 2, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4724},
pages = {548--559},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-75256-1\_49},
doi = {10.1007/978-3-540-75256-1\_49},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/ecsqaru/KwisthoutBT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fun/AltBKRT07,
author = {Helmut Alt and
Hans L. Bodlaender and
Marc J. van Kreveld and
G{\"{u}}nter Rote and
Gerard Tel},
editor = {Pierluigi Crescenzi and
Giuseppe Prencipe and
Geppino Pucci},
title = {Wooden Geometric Puzzles: Design and Hardness Proofs},
booktitle = {Fun with Algorithms, 4th International Conference, {FUN} 2007, Castiglioncello,
Italy, June 3-5, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4475},
pages = {16--29},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72914-3\_4},
doi = {10.1007/978-3-540-72914-3\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/fun/AltBKRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BachooreB07,
author = {Emgad H. Bachoore and
Hans L. Bodlaender},
editor = {Takeshi Tokuyama},
title = {Weighted Treewidth Algorithmic Techniques and Results},
booktitle = {Algorithms and Computation, 18th International Symposium, {ISAAC}
2007, Sendai, Japan, December 17-19, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4835},
pages = {893--903},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77120-3\_77},
doi = {10.1007/978-3-540-77120-3\_77},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BachooreB07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sirocco/Bodlaender07,
author = {Hans L. Bodlaender},
editor = {Giuseppe Prencipe and
Shmuel Zaks},
title = {Treewidth: Structure and Algorithms},
booktitle = {Structural Information and Communication Complexity, 14th International
Colloquium, {SIROCCO} 2007, Castiglioncello, Italy, June 5-8, 2007,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4474},
pages = {11--25},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-72951-8\_3},
doi = {10.1007/978-3-540-72951-8\_3},
timestamp = {Tue, 14 May 2019 10:00:55 +0200},
biburl = {https://dblp.org/rec/conf/sirocco/Bodlaender07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/Bodlaender07,
author = {Hans L. Bodlaender},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {A Cubic Kernel for Feedback Vertex Set},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {320--331},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_28},
doi = {10.1007/978-3-540-70918-3\_28},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/Bodlaender07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BodlaenderK06,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
title = {Safe separators for treewidth},
journal = {Discret. Math.},
volume = {306},
number = {3},
pages = {337--350},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2005.12.017},
doi = {10.1016/J.DISC.2005.12.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BodlaenderK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BodlaenderWK06,
author = {Hans L. Bodlaender and
Thomas Wolle and
Arie M. C. A. Koster},
title = {Contraction and Treewidth Lower Bounds},
journal = {J. Graph Algorithms Appl.},
volume = {10},
number = {1},
pages = {5--49},
year = {2006},
url = {https://doi.org/10.7155/jgaa.00117},
doi = {10.7155/JGAA.00117},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgaa/BodlaenderWK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/KatrielB06,
author = {Irit Katriel and
Hans L. Bodlaender},
title = {Online topological ordering},
journal = {{ACM} Trans. Algorithms},
volume = {2},
number = {3},
pages = {364--379},
year = {2006},
url = {https://doi.org/10.1145/1159892.1159896},
doi = {10.1145/1159892.1159896},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/talg/KatrielB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaim/BachooreB06,
author = {Emgad H. Bachoore and
Hans L. Bodlaender},
editor = {Siu{-}Wing Cheng and
Chung Keung Poon},
title = {A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on
Treewidth},
booktitle = {Algorithmic Aspects in Information and Management, Second International
Conference, {AAIM} 2006, Hong Kong, China, June 20-22, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4041},
pages = {255--266},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11775096\_24},
doi = {10.1007/11775096\_24},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaim/BachooreB06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/acid/BodlaenderFLRRW06,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael A. Langston and
Mark A. Ragan and
Frances A. Rosamond and
Mark Weyer},
editor = {Hajo Broersma and
Stefan S. Dantchev and
Matthew Johnson and
Stefan Szeider},
title = {Kernelization for Convex Recoloring},
booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
ACiD Workshop, 18-20 September 2006, Durham, {UK}},
series = {Texts in Algorithmics},
volume = {7},
pages = {23--35},
publisher = {King's College, London},
year = {2006},
timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
biburl = {https://dblp.org/rec/conf/acid/BodlaenderFLRRW06.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/waoa/BodlaenderFGPSW06,
author = {Hans L. Bodlaender and
Corinne Feremans and
Alexander Grigoriev and
Eelko Penninkx and
Ren{\'{e}} Sitters and
Thomas Wolle},
editor = {Thomas Erlebach and
Christos Kaklamanis},
title = {On the Minimum Corridor Connection Problem and Other Generalized Geometric
Problems},
booktitle = {Approximation and Online Algorithms, 4th International Workshop, {WAOA}
2006, Zurich, Switzerland, September 14-15, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4368},
pages = {69--82},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11970125\_6},
doi = {10.1007/11970125\_6},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/waoa/BodlaenderFGPSW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender06,
author = {Hans L. Bodlaender},
editor = {Fedor V. Fomin},
title = {Treewidth: Characterizations, Applications, and Computations},
booktitle = {Graph-Theoretic Concepts in Computer Science, 32nd International Workshop,
{WG} 2006, Bergen, Norway, June 22-24, 2006, Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4271},
pages = {1--14},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11917496\_1},
doi = {10.1007/11917496\_1},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/iwpec/2006,
editor = {Hans L. Bodlaender and
Michael A. Langston},
title = {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},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11847250},
doi = {10.1007/11847250},
isbn = {3-540-39098-7},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ci/BodlaenderKE05,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster and
Frank van den Eijkhof},
title = {Preprocessing Rules for Triangulation of Probabilistic Networks},
journal = {Comput. Intell.},
volume = {21},
number = {3},
pages = {286--305},
year = {2005},
url = {https://doi.org/10.1111/j.1467-8640.2005.00274.x},
doi = {10.1111/J.1467-8640.2005.00274.X},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ci/BodlaenderKE05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderF05,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
title = {Tree decompositions with small cost},
journal = {Discret. Appl. Math.},
volume = {145},
number = {2},
pages = {143--154},
year = {2005},
url = {https://doi.org/10.1016/j.dam.2004.01.008},
doi = {10.1016/J.DAM.2004.01.008},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ThilikosSB05,
author = {Dimitrios M. Thilikos and
Maria J. Serna and
Hans L. Bodlaender},
title = {Cutwidth {I:} {A} linear time fixed parameter algorithm},
journal = {J. Algorithms},
volume = {56},
number = {1},
pages = {1--24},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.12.001},
doi = {10.1016/J.JALGOR.2004.12.001},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ThilikosSB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/ThilikosSB05a,
author = {Dimitrios M. Thilikos and
Maria J. Serna and
Hans L. Bodlaender},
title = {Cutwidth {II:} Algorithms for partial w-trees of bounded degree},
journal = {J. Algorithms},
volume = {56},
number = {1},
pages = {25--49},
year = {2005},
url = {https://doi.org/10.1016/j.jalgor.2004.12.003},
doi = {10.1016/J.JALGOR.2004.12.003},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/ThilikosSB05a.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}
}
@article{DBLP:journals/tcs/BodlaenderF05,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
title = {Equitable colorings of bounded treewidth graphs},
journal = {Theor. Comput. Sci.},
volume = {349},
number = {1},
pages = {22--30},
year = {2005},
url = {https://doi.org/10.1016/j.tcs.2005.09.027},
doi = {10.1016/J.TCS.2005.09.027},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/DornPBF05,
author = {Frederic Dorn and
Eelko Penninkx and
Hans L. Bodlaender and
Fedor V. Fomin},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut
Branch Decompositions},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {95--106},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_11},
doi = {10.1007/11561071\_11},
timestamp = {Tue, 27 Dec 2022 09:06:31 +0100},
biburl = {https://dblp.org/rec/conf/esa/DornPBF05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderGK05,
author = {Hans L. Bodlaender and
Alexander Grigoriev and
Arie M. C. A. Koster},
editor = {Gerth St{\o}lting Brodal and
Stefano Leonardi},
title = {Treewidth Lower Bounds with Brambles},
booktitle = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
Mallorca, Spain, October 3-6, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3669},
pages = {391--402},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11561071\_36},
doi = {10.1007/11561071\_36},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderGK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/GrigorievB05,
author = {Alexander Grigoriev and
Hans L. Bodlaender},
editor = {Maciej Liskiewicz and
R{\"{u}}diger Reischuk},
title = {Algorithms for Graphs Embeddable with Few Crossings Per Edge},
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 = {378--387},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11537311\_33},
doi = {10.1007/11537311\_33},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/GrigorievB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KatrielB05,
author = {Irit Katriel and
Hans L. Bodlaender},
title = {Online topological ordering},
booktitle = {Proceedings of the Sixteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2005, Vancouver, British Columbia, Canada, January
23-25, 2005},
pages = {443--450},
publisher = {{SIAM}},
year = {2005},
url = {http://dl.acm.org/citation.cfm?id=1070432.1070493},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KatrielB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/Bodlaender05,
author = {Hans L. Bodlaender},
editor = {Peter Vojt{\'{a}}s and
M{\'{a}}ria Bielikov{\'{a}} and
Bernadette Charron{-}Bost and
Ondrej S{\'{y}}kora},
title = {Discovering Treewidth},
booktitle = {{SOFSEM} 2005: Theory and Practice of Computer Science, 31st Conference
on Current Trends in Theory and Practice of Computer Science, Liptovsk{\'{y}}
J{\'{a}}n, Slovakia, January 22-28, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3381},
pages = {1--16},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30577-4\_1},
doi = {10.1007/978-3-540-30577-4\_1},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sofsem/Bodlaender05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/KosterWB05,
author = {Arie M. C. A. Koster and
Thomas Wolle and
Hans L. Bodlaender},
editor = {Sotiris E. Nikoletseas},
title = {Degree-Based Treewidth Lower Bounds},
booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop,
{WEA} 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3503},
pages = {101--112},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11427186\_11},
doi = {10.1007/11427186\_11},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/KosterWB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BachooreB05,
author = {Emgad H. Bachoore and
Hans L. Bodlaender},
editor = {Sotiris E. Nikoletseas},
title = {New Upper Bound Heuristics for Treewidth},
booktitle = {Experimental and Efficient Algorithms, 4th InternationalWorkshop,
{WEA} 2005, Santorini Island, Greece, May 10-13, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3503},
pages = {216--227},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11427186\_20},
doi = {10.1007/11427186\_20},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wea/BachooreB05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/BodlaenderKTL04,
author = {Hans L. Bodlaender and
Ton Kloks and
Richard B. Tan and
Jan van Leeuwen},
title = {Approximations for lambda-Colorings of Graphs},
journal = {Comput. J.},
volume = {47},
number = {2},
pages = {193--204},
year = {2004},
url = {https://doi.org/10.1093/comjnl/47.2.193},
doi = {10.1093/COMJNL/47.2.193},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/BodlaenderKTL04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/BodlaenderT04,
author = {Hans L. Bodlaender and
Gerard Tel},
title = {A Note on Rectilinearity and Angular Resolution},
journal = {J. Graph Algorithms Appl.},
volume = {8},
pages = {89--94},
year = {2004},
url = {https://doi.org/10.7155/jgaa.00083},
doi = {10.7155/JGAA.00083},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/BodlaenderT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BodlaenderT04,
author = {Hans L. Bodlaender and
Jan Arne Telle},
title = {Space-Efficient Construction Variants of Dynamic Programming},
journal = {Nord. J. Comput.},
volume = {11},
number = {4},
pages = {374--385},
year = {2004},
timestamp = {Wed, 03 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/njc/BodlaenderT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamjo/BodlaenderBFPW04,
author = {Hans L. Bodlaender and
Hajo Broersma and
Fedor V. Fomin and
Artem V. Pyatkin and
Gerhard J. Woeginger},
title = {Radio Labeling with Preassigned Frequencies},
journal = {{SIAM} J. Optim.},
volume = {15},
number = {1},
pages = {1--16},
year = {2004},
url = {https://doi.org/10.1137/S1052623402410181},
doi = {10.1137/S1052623402410181},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamjo/BodlaenderBFPW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/BodlaenderK04,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
editor = {Lars Arge and
Giuseppe F. Italiano and
Robert Sedgewick},
title = {Safe Seperators for Treewidth},
booktitle = {Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments
and the First Workshop on Analytic Algorithmics and Combinatorics,
New Orleans, LA, USA, January 10, 2004},
pages = {70--78},
publisher = {{SIAM}},
year = {2004},
timestamp = {Fri, 10 Dec 2004 13:45:59 +0100},
biburl = {https://dblp.org/rec/conf/alenex/BodlaenderK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderKW04,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster and
Thomas Wolle},
editor = {Susanne Albers and
Tomasz Radzik},
title = {Contraction and Treewidth Lower Bounds},
booktitle = {Algorithms - {ESA} 2004, 12th Annual European Symposium, Bergen, Norway,
September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3221},
pages = {628--639},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30140-0\_56},
doi = {10.1007/978-3-540-30140-0\_56},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderKW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BodlaenderT04,
author = {Hans L. Bodlaender and
Dimitrios M. Thilikos},
editor = {Rodney G. Downey and
Michael R. Fellows and
Frank K. H. A. Dehne},
title = {Computing Small Search Numbers in Linear Time},
booktitle = {Parameterized and Exact Computation, First International Workshop,
{IWPEC} 2004, Bergen, Norway, September 14-17, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3162},
pages = {37--48},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28639-4\_4},
doi = {10.1007/978-3-540-28639-4\_4},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BodlaenderT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodlaenderF04,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {Equitable Colorings of Bounded Treewidth Graphs},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {180--190},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_11},
doi = {10.1007/978-3-540-28629-5\_11},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/GaagBF04,
author = {Linda C. van der Gaag and
Hans L. Bodlaender and
A. J. Feelders},
editor = {David Maxwell Chickering and
Joseph Y. Halpern},
title = {Monotonicity in Bayesian Networks},
booktitle = {{UAI} '04, Proceedings of the 20th Conference in Uncertainty in Artificial
Intelligence, Banff, Canada, July 7-11, 2004},
pages = {569--576},
publisher = {{AUAI} Press},
year = {2004},
url = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&\#38;smnu=2\&\#38;article\_id=1156\&\#38;proceeding\_id=20},
timestamp = {Wed, 03 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/uai/GaagBF04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wea/BodlaenderFGKN04,
author = {Hans L. Bodlaender and
Celina M. H. de Figueiredo and
Marisa Gutierrez and
Ton Kloks and
Rolf Niedermeier},
editor = {Celso C. Ribeiro and
Simone L. Martins},
title = {Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P\({}_{\mbox{4}}\)'s},
booktitle = {Experimental and Efficient Algorithms, Third International Workshop,
{WEA} 2004, Angra dos Reis, Brazil, May 25-28, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3059},
pages = {87--99},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24838-5\_7},
doi = {10.1007/978-3-540-24838-5\_7},
timestamp = {Sat, 09 Apr 2022 12:38:17 +0200},
biburl = {https://dblp.org/rec/conf/wea/BodlaenderFGKN04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderK04,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster},
editor = {Juraj Hromkovic and
Manfred Nagl and
Bernhard Westfechtel},
title = {On the Maximum Cardinality Search Lower Bound for Treewidth},
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 = {81--92},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30559-0\_7},
doi = {10.1007/978-3-540-30559-0\_7},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderR03,
author = {Hans L. Bodlaender and
Udi Rotics},
title = {Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition},
journal = {Algorithmica},
volume = {36},
number = {4},
pages = {375--408},
year = {2003},
url = {https://doi.org/10.1007/s00453-003-1026-5},
doi = {10.1007/S00453-003-1026-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderTL03,
author = {Hans L. Bodlaender and
Richard B. Tan and
Jan van Leeuwen},
title = {Finding a bigtriangleup-regular supergraph of minimum order},
journal = {Discret. Appl. Math.},
volume = {131},
number = {1},
pages = {3--9},
year = {2003},
url = {https://doi.org/10.1016/S0166-218X(02)00413-4},
doi = {10.1016/S0166-218X(02)00413-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderTL03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/Bodlaender03,
author = {Hans L. Bodlaender},
title = {Necessary Edges in k-Chordalisations of Graphs},
journal = {J. Comb. Optim.},
volume = {7},
number = {3},
pages = {283--290},
year = {2003},
url = {https://doi.org/10.1023/A:1027320705349},
doi = {10.1023/A:1027320705349},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jco/Bodlaender03.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/mfcs/BodlaenderFT03,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Dimitrios M. Thilikos},
editor = {Branislav Rovan and
Peter Vojt{\'{a}}s},
title = {Starting with Nondeterminism: The Systematic Derivation of Linear-Time
Graph Layout Algorithms},
booktitle = {Mathematical Foundations of Computer Science 2003, 28th International
Symposium, {MFCS} 2003, Bratislava, Slovakia, August 25-29, 2003,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2747},
pages = {239--248},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/978-3-540-45138-9\_18},
doi = {10.1007/978-3-540-45138-9\_18},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderFT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/wg/2003,
editor = {Hans L. Bodlaender},
title = {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},
publisher = {Springer},
year = {2003},
url = {https://doi.org/10.1007/b93953},
doi = {10.1007/B93953},
isbn = {3-540-20452-0},
timestamp = {Tue, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/2003.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AlberBFKN02,
author = {Jochen Alber and
Hans L. Bodlaender and
Henning Fernau and
Ton Kloks and
Rolf Niedermeier},
title = {Fixed Parameter Algorithms for {DOMINATING} {SET} and Related Problems
on Planar Graphs},
journal = {Algorithmica},
volume = {33},
number = {4},
pages = {461--493},
year = {2002},
url = {https://doi.org/10.1007/s00453-001-0116-5},
doi = {10.1007/S00453-001-0116-5},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/AlberBFKN02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fuin/BodlaenderDK02,
author = {Hans L. Bodlaender and
Michael J. Dinneen and
Bakhadyr Khoussainov},
title = {Relaxed Update and Partition Network Games},
journal = {Fundam. Informaticae},
volume = {49},
number = {4},
pages = {301--312},
year = {2002},
url = {http://content.iospress.com/articles/fundamenta-informaticae/fi49-4-02},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/fuin/BodlaenderDK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZantemaB02,
author = {Hans Zantema and
Hans L. Bodlaender},
title = {Sizes of Ordered Decision Trees},
journal = {Int. J. Found. Comput. Sci.},
volume = {13},
number = {3},
pages = {445--458},
year = {2002},
url = {https://doi.org/10.1142/S0129054102001205},
doi = {10.1142/S0129054102001205},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ZantemaB02.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/jal/BodlaenderF02,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
title = {Approximation of pathwidth of outerplanar graphs},
journal = {J. Algorithms},
volume = {43},
number = {2},
pages = {190--200},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00001-9},
doi = {10.1016/S0196-6774(02)00001-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ecai/BodlaenderEG02,
author = {Hans L. Bodlaender and
Frank van den Eijkhof and
Linda C. van der Gaag},
editor = {Frank van Harmelen},
title = {On the Complexity of the {MPA} Problem in Probabilistic Networks},
booktitle = {Proceedings of the 15th European Conference on Artificial Intelligence,
ECAI'2002, Lyon, France, July 2002},
pages = {675--679},
publisher = {{IOS} Press},
year = {2002},
timestamp = {Mon, 03 Jan 2022 07:50:19 +0100},
biburl = {https://dblp.org/rec/conf/ecai/BodlaenderEG02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderBFPW02,
author = {Hans L. Bodlaender and
Hajo Broersma and
Fedor V. Fomin and
Artem V. Pyatkin and
Gerhard J. Woeginger},
editor = {Rolf H. M{\"{o}}hring and
Rajeev Raman},
title = {Radio Labeling with Pre-assigned Frequencies},
booktitle = {Algorithms - {ESA} 2002, 10th Annual European Symposium, Rome, Italy,
September 17-21, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2461},
pages = {211--222},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45749-6\_22},
doi = {10.1007/3-540-45749-6\_22},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderBFPW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderF02,
author = {Hans L. Bodlaender and
Fedor V. Fomin},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Tree Decompositions with Small Cost},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {378--387},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_39},
doi = {10.1007/3-540-45471-3\_39},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderF02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderR02,
author = {Hans L. Bodlaender and
Udi Rotics},
editor = {Martti Penttonen and
Erik Meineche Schmidt},
title = {Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition},
booktitle = {Algorithm Theory - {SWAT} 2002, 8th Scandinavian Workshop on Algorithm
Theory, Turku, Finland, July 3-5, 2002 Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2368},
pages = {388--397},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45471-3\_40},
doi = {10.1007/3-540-45471-3\_40},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/EijkhofB02,
author = {Frank van den Eijkhof and
Hans L. Bodlaender},
editor = {Ludek Kucera},
title = {Safe Reduction Rules for Weighted Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science, 28th International Workshop,
{WG} 2002, Cesky Krumlov, Czech Republic, June 13-15, 2002, Revised
Papers},
series = {Lecture Notes in Computer Science},
volume = {2573},
pages = {176--185},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36379-3\_16},
doi = {10.1007/3-540-36379-3\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/EijkhofB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BodlaenderF01,
author = {Hans L. Bodlaender and
Babette van Antwerpen{-}de Fluiter},
title = {Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth
Two},
journal = {Algorithmica},
volume = {29},
number = {4},
pages = {534--559},
year = {2001},
url = {https://doi.org/10.1007/s004530010070},
doi = {10.1007/S004530010070},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BodlaenderF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KosterBH01,
author = {Arie M. C. A. Koster and
Hans L. Bodlaender and
Stan P. M. van Hoesel},
title = {Treewidth: Computational Experiments},
journal = {Electron. Notes Discret. Math.},
volume = {8},
pages = {54--57},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(05)80078-2},
doi = {10.1016/S1571-0653(05)80078-2},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/KosterBH01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderF01,
author = {Hans L. Bodlaender and
Babette van Antwerpen{-}de Fluiter},
title = {Reduction Algorithms for Graphs of Small Treewidth},
journal = {Inf. Comput.},
volume = {167},
number = {2},
pages = {86--119},
year = {2001},
url = {https://doi.org/10.1006/inco.2000.2958},
doi = {10.1006/INCO.2000.2958},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderF01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jucs/Bodlaender01,
author = {Hans L. Bodlaender},
title = {A Generic NP-hardness Proof for a Variant of Graph Coloring},
journal = {J. Univers. Comput. Sci.},
volume = {7},
number = {12},
pages = {1114--1124},
year = {2001},
url = {https://doi.org/10.3217/jucs-007-12-1114},
doi = {10.3217/JUCS-007-12-1114},
timestamp = {Thu, 07 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jucs/Bodlaender01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/ThilikosSB01,
author = {Dimitrios M. Thilikos and
Maria J. Serna and
Hans L. Bodlaender},
editor = {Friedhelm Meyer auf der Heide},
title = {A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs
with Small Treewidth},
booktitle = {Algorithms - {ESA} 2001, 9th Annual European Symposium, Aarhus, Denmark,
August 28-31, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2161},
pages = {380--390},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44676-1\_32},
doi = {10.1007/3-540-44676-1\_32},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/ThilikosSB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BodlaenderDK01,
author = {Hans L. Bodlaender and
Michael J. Dinneen and
Bakhadyr Khoussainov},
editor = {Peter Eades and
Tadao Takaoka},
title = {On Game-Theoretic Models of Networks},
booktitle = {Algorithms and Computation, 12th International Symposium, {ISAAC}
2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2223},
pages = {550--561},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45678-3\_47},
doi = {10.1007/3-540-45678-3\_47},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BodlaenderDK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/uai/BodlaenderKEG01,
author = {Hans L. Bodlaender and
Arie M. C. A. Koster and
Frank van den Eijkhof and
Linda C. van der Gaag},
editor = {Jack S. Breese and
Daphne Koller},
title = {Pre-processing for Triangulation of Probabilistic Networks},
booktitle = {{UAI} '01: Proceedings of the 17th Conference in Uncertainty in Artificial
Intelligence, University of Washington, Seattle, Washington, USA,
August 2-5, 2001},
pages = {32--39},
publisher = {Morgan Kaufmann},
year = {2001},
url = {https://dslpitt.org/uai/displayArticleDetails.jsp?mmnu=1\&\#38;smnu=2\&\#38;article\_id=80\&\#38;proceeding\_id=17},
timestamp = {Wed, 03 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/uai/BodlaenderKEG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FominB01,
author = {Fedor V. Fomin and
Hans L. Bodlaender},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {Approximation of Pathwidth of Outerplanar 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 = {166--176},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_16},
doi = {10.1007/3-540-45477-2\_16},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FominB01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Bodlaender00,
author = {Hans L. Bodlaender},
title = {Introduction},
journal = {Algorithmica},
volume = {27},
number = {3},
pages = {209--211},
year = {2000},
url = {https://doi.org/10.1007/s004530010015},
doi = {10.1007/S004530010015},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/Bodlaender00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Bodlaender00,
author = {Hans L. Bodlaender},
title = {The algorithmic theory of treewidth},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {27--30},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80116-7},
doi = {10.1016/S1571-0653(05)80116-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Bodlaender00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/ZantemaB00,
author = {Hans Zantema and
Hans L. Bodlaender},
title = {Finding Small Equivalent Decision Trees is Hard},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {2},
pages = {343--354},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000193},
doi = {10.1142/S0129054100000193},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/ZantemaB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BodlaenderJ00,
author = {Hans L. Bodlaender and
Klaus Jansen},
title = {On the Complexity of the Maximum Cut Problem},
journal = {Nord. J. Comput.},
volume = {7},
number = {1},
pages = {14--31},
year = {2000},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BodlaenderJ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderFHWW00,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael T. Hallett and
Todd Wareham and
Tandy J. Warnow},
title = {The hardness of perfect phylogeny, feasible register assignment and
other problems on thin colored graphs},
journal = {Theor. Comput. Sci.},
volume = {244},
number = {1-2},
pages = {167--188},
year = {2000},
url = {https://doi.org/10.1016/S0304-3975(98)00342-9},
doi = {10.1016/S0304-3975(98)00342-9},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderFHWW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ThilikosSB00,
author = {Dimitrios M. Thilikos and
Maria J. Serna and
Hans L. Bodlaender},
editor = {D. T. Lee and
Shang{-}Hua Teng},
title = {Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width},
booktitle = {Algorithms and Computation, 11th International Conference, {ISAAC}
2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1969},
pages = {192--203},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-40996-3\_17},
doi = {10.1007/3-540-40996-3\_17},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ThilikosSB00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderKTL00,
author = {Hans L. Bodlaender and
Ton Kloks and
Richard B. Tan and
Jan van Leeuwen},
editor = {Horst Reichel and
Sophie Tison},
title = {lambda-Coloring of Graphs},
booktitle = {{STACS} 2000, 17th Annual Symposium on Theoretical Aspects of Computer
Science, Lille, France, February 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1770},
pages = {395--406},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-46541-3\_33},
doi = {10.1007/3-540-46541-3\_33},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderKTL00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/AlberBFN00,
author = {Jochen Alber and
Hans L. Bodlaender and
Henning Fernau and
Rolf Niedermeier},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson},
title = {Fixed Parameter Algorithms for {PLANAR} {DOMINATING} {SET} and Related
Problems},
booktitle = {Algorithm Theory - {SWAT} 2000, 7th Scandinavian Workshop on Algorithm
Theory, Bergen, Norway, July 5-7, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1851},
pages = {97--110},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44985-X\_10},
doi = {10.1007/3-540-44985-X\_10},
timestamp = {Fri, 27 Mar 2020 08:50:36 +0100},
biburl = {https://dblp.org/rec/conf/swat/AlberBFN00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/YamazakiBFT99,
author = {Koichi Yamazaki and
Hans L. Bodlaender and
Babette de Fluiter and
Dimitrios M. Thilikos},
title = {Isomorphism for Graphs of Bounded Distance Width},
journal = {Algorithmica},
volume = {24},
number = {2},
pages = {105--127},
year = {1999},
url = {https://doi.org/10.1007/PL00009273},
doi = {10.1007/PL00009273},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/YamazakiBFT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/Bodlaender99,
author = {Hans L. Bodlaender},
title = {A note on domino treewidth},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {3},
number = {4},
pages = {141--150},
year = {1999},
url = {https://doi.org/10.46298/dmtcs.256},
doi = {10.46298/DMTCS.256},
timestamp = {Tue, 24 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/Bodlaender99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BodlaenderKN99,
author = {Hans L. Bodlaender and
Ton Kloks and
Rolf Niedermeier},
title = {{SIMPLE} {MAX-CUT} for unit interval graphs and graphs with few P\({}_{\mbox{4}}\)s},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {19--26},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80014-9},
doi = {10.1016/S1571-0653(05)80014-9},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BodlaenderKN99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BodlaenderT99,
author = {Hans L. Bodlaender and
Dimitrios M. Thilikos},
title = {Graphs with Branchwidth at Most Three},
journal = {J. Algorithms},
volume = {32},
number = {2},
pages = {167--194},
year = {1999},
url = {https://doi.org/10.1006/jagm.1999.1011},
doi = {10.1006/JAGM.1999.1011},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/HaverkortB99,
author = {Herman J. Haverkort and
Hans L. Bodlaender},
title = {Finding a minimal tree in a polygon with its medial axis},
booktitle = {Proceedings of the 11th Canadian Conference on Computational Geometry,
UBC, Vancouver, British Columbia, Canada, August 15-18, 1999},
year = {1999},
url = {http://www.cccg.ca/proceedings/1999/fp54.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/HaverkortB99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/RidderB99,
author = {H. N. de Ridder and
Hans L. Bodlaender},
editor = {Gabriel Ciobanu and
Gheorghe Paun},
title = {Graph Automorphisms with Maximal Projection Distances},
booktitle = {Fundamentals of Computation Theory, 12th International Symposium,
{FCT} '99, Iasi, Romania, August 30 - September 3, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1684},
pages = {204--214},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-48321-7\_16},
doi = {10.1007/3-540-48321-7\_16},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/RidderB99.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/BodlaenderH98,
author = {Hans L. Bodlaender and
Torben Hagerup},
title = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
journal = {{SIAM} J. Comput.},
volume = {27},
number = {6},
pages = {1725--1746},
year = {1998},
url = {https://doi.org/10.1137/S0097539795289859},
doi = {10.1137/S0097539795289859},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/BodlaenderH98.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}
}
@article{DBLP:journals/tcs/Bodlaender98,
author = {Hans L. Bodlaender},
title = {A Partial \emph{k}-Arboretum of Graphs with Bounded Treewidth},
journal = {Theor. Comput. Sci.},
volume = {209},
number = {1-2},
pages = {1--45},
year = {1998},
url = {https://doi.org/10.1016/S0304-3975(97)00228-4},
doi = {10.1016/S0304-3975(97)00228-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bodlaender98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BodlaenderH98,
author = {Hans L. Bodlaender and
Torben Hagerup},
editor = {Lubos Brim and
Jozef Gruska and
Jir{\'{\i}} Zlatuska},
title = {Tree Decompositions of Small Diameter},
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 = {702--712},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0055821},
doi = {10.1007/BFB0055821},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderH98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BodlaenderGT98,
author = {Hans L. Bodlaender and
Jens Gustedt and
Jan Arne Telle},
editor = {Howard J. Karloff},
title = {Linear-Time Register Allocation for a Fixed Number of Registers},
booktitle = {Proceedings of the Ninth Annual {ACM-SIAM} Symposium on Discrete Algorithms,
25-27 January 1998, San Francisco, California, {USA}},
pages = {574--583},
publisher = {{ACM/SIAM}},
year = {1998},
url = {http://dl.acm.org/citation.cfm?id=314613.314994},
timestamp = {Thu, 05 Jul 2018 07:29:49 +0200},
biburl = {https://dblp.org/rec/conf/soda/BodlaenderGT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderT97,
author = {Hans L. Bodlaender and
Dimitrios M. Thilikos},
title = {Treewidth for Graphs with Small Chordality},
journal = {Discret. Appl. Math.},
volume = {79},
number = {1-3},
pages = {45--61},
year = {1997},
url = {https://doi.org/10.1016/S0166-218X(97)00031-0},
doi = {10.1016/S0166-218X(97)00031-0},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/KantB97,
author = {Goos Kant and
Hans L. Bodlaender},
title = {Triangulating Planar Graphs while Minimizing the Maximum Degree},
journal = {Inf. Comput.},
volume = {135},
number = {1},
pages = {1--14},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2635},
doi = {10.1006/INCO.1997.2635},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/KantB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderLTT97,
author = {Hans L. Bodlaender and
Jan van Leeuwen and
Richard B. Tan and
Dimitrios M. Thilikos},
title = {On Interval Routing Schemes and Treewidth},
journal = {Inf. Comput.},
volume = {139},
number = {1},
pages = {92--109},
year = {1997},
url = {https://doi.org/10.1006/inco.1997.2669},
doi = {10.1006/INCO.1997.2669},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderLTT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderTY97,
author = {Hans L. Bodlaender and
Dimitrios M. Thilikos and
Koichi Yamazaki},
title = {It is Hard to Know when Greedy is Good for Finding Independent Sets},
journal = {Inf. Process. Lett.},
volume = {61},
number = {2},
pages = {101--111},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(96)00208-6},
doi = {10.1016/S0020-0190(96)00208-6},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderTY97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ThilikosB97,
author = {Dimitrios M. Thilikos and
Hans L. Bodlaender},
title = {Fast Partitioning l-Apex Graphs with Application to Approximating
Maximum Induced-Subgraph Problems},
journal = {Inf. Process. Lett.},
volume = {61},
number = {5},
pages = {227--232},
year = {1997},
url = {https://doi.org/10.1016/S0020-0190(97)00024-0},
doi = {10.1016/S0020-0190(97)00024-0},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ThilikosB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BodlaenderE97,
author = {Hans L. Bodlaender and
Joost Engelfriet},
title = {Domino Treewidth},
journal = {J. Algorithms},
volume = {24},
number = {1},
pages = {94--123},
year = {1997},
url = {https://doi.org/10.1006/jagm.1996.0854},
doi = {10.1006/JAGM.1996.0854},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ciac/YamazakiBFT97,
author = {Koichi Yamazaki and
Hans L. Bodlaender and
Babette de Fluiter and
Dimitrios M. Thilikos},
editor = {Gian Carlo Bongiovanni and
Daniel P. Bovet and
Giuseppe Di Battista},
title = {Isomorphism for Graphs of Bounded Distance Width},
booktitle = {Algorithms and Complexity, Third Italian Conference, {CIAC} '97, Rome,
Italy, March 12-14, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1203},
pages = {276--287},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-62592-5\_79},
doi = {10.1007/3-540-62592-5\_79},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/ciac/YamazakiBFT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderT97,
author = {Hans L. Bodlaender and
Dimitrios M. Thilikos},
editor = {Pierpaolo Degano and
Roberto Gorrieri and
Alberto Marchetti{-}Spaccamela},
title = {Constructive Linear Time Algorithms for Branchwidth},
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 = {627--637},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/3-540-63165-8\_217},
doi = {10.1007/3-540-63165-8\_217},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderT97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Bodlaender97,
author = {Hans L. Bodlaender},
editor = {Igor Pr{\'{\i}}vara and
Peter Ruzicka},
title = {Treewidth: Algorithmic Techniques and Results},
booktitle = {Mathematical Foundations of Computer Science 1997, 22nd International
Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1295},
pages = {19--36},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0029946},
doi = {10.1007/BFB0029946},
timestamp = {Tue, 16 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/mfcs/Bodlaender97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FluiterB97,
author = {Babette de Fluiter and
Hans L. Bodlaender},
editor = {Rolf H. M{\"{o}}hring},
title = {Parallel Algorithms for Treewidth Two},
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 = {157--170},
publisher = {Springer},
year = {1997},
url = {https://doi.org/10.1007/BFb0024496},
doi = {10.1007/BFB0024496},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FluiterB97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderF96,
author = {Hans L. Bodlaender and
Babette van Antwerpen{-}de Fluiter},
title = {On Intervalizing K-colored Graphs for {DNA} Physical Mapping},
journal = {Discret. Appl. Math.},
volume = {71},
number = {1-3},
pages = {55--77},
year = {1996},
url = {https://doi.org/10.1016/S0166-218X(96)00057-1},
doi = {10.1016/S0166-218X(96)00057-1},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BodlaenderK96,
author = {Hans L. Bodlaender and
Ton Kloks},
title = {Efficient and Constructive Algorithms for the Pathwidth and Treewidth
of Graphs},
journal = {J. Algorithms},
volume = {21},
number = {2},
pages = {358--402},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0049},
doi = {10.1006/JAGM.1996.0049},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Bodlaender96,
author = {Hans L. Bodlaender},
title = {A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth},
journal = {{SIAM} J. Comput.},
volume = {25},
number = {6},
pages = {1305--1317},
year = {1996},
url = {https://doi.org/10.1137/S0097539793251219},
doi = {10.1137/S0097539793251219},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/Bodlaender96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/BodlaenderF96,
author = {Hans L. Bodlaender and
Babette de Fluiter},
editor = {Jin{-}yi Cai and
C. K. Wong},
title = {Reduction Algorithms for Constructing Solutions in Graphs with Small
Treewidth},
booktitle = {Computing and Combinatorics, Second Annual International Conference,
{COCOON} '96, Hong Kong, June 17-19, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1090},
pages = {199--208},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61332-3\_153},
doi = {10.1007/3-540-61332-3\_153},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/BodlaenderF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BodlaenderFE96,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Patricia A. Evans},
editor = {Daniel S. Hirschberg and
Eugene W. Myers},
title = {Finite-State Computability of Annotations of Strings and Trees},
booktitle = {Combinatorial Pattern Matching, 7th Annual Symposium, {CPM} 96, Laguna
Beach, California, USA, June 10-12, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1075},
pages = {384--391},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61258-0\_28},
doi = {10.1007/3-540-61258-0\_28},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BodlaenderFE96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BodlaenderF96,
author = {Hans L. Bodlaender and
Babette de Fluiter},
editor = {Josep D{\'{\i}}az and
Maria J. Serna},
title = {Parallel Algorithms for Series Parallel Graphs},
booktitle = {Algorithms - {ESA} '96, Fourth Annual European Symposium, Barcelona,
Spain, September 25-27, 1996, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1136},
pages = {277--289},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-61680-2\_62},
doi = {10.1007/3-540-61680-2\_62},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/BodlaenderF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/bioinformatics/BodlaenderDFHW95,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Michael T. Hallett and
Harold T. Wareham},
title = {Parameterized complexity analysis in computational biology},
journal = {Comput. Appl. Biosci.},
volume = {11},
number = {1},
pages = {49--57},
year = {1995},
url = {https://doi.org/10.1093/bioinformatics/11.1.49},
doi = {10.1093/BIOINFORMATICS/11.1.49},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/bioinformatics/BodlaenderDFHW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BodlaenderGHK95,
author = {Hans L. Bodlaender and
John R. Gilbert and
Hj{\'{a}}lmtyr Hafsteinsson and
Ton Kloks},
title = {Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination
Tree},
journal = {J. Algorithms},
volume = {18},
number = {2},
pages = {238--255},
year = {1995},
url = {https://doi.org/10.1006/jagm.1995.1009},
doi = {10.1006/JAGM.1995.1009},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderGHK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BodlaenderGK95,
author = {Hans L. Bodlaender and
Teofilo F. Gonzalez and
Ton Kloks},
title = {Complexity Aspects of Two-Dimensional Data Compression},
journal = {Nord. J. Comput.},
volume = {2},
number = {4},
pages = {462--495},
year = {1995},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BodlaenderGK95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BodlaenderF95,
author = {Hans L. Bodlaender and
Michael R. Fellows},
title = {W[2]-hardness of precedence constrained K-processor scheduling},
journal = {Oper. Res. Lett.},
volume = {18},
number = {2},
pages = {93--97},
year = {1995},
url = {https://doi.org/10.1016/0167-6377(95)00031-9},
doi = {10.1016/0167-6377(95)00031-9},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/BodlaenderF95.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}
}
@article{DBLP:journals/tcs/BodlaenderDFW95,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Harold T. Wareham},
title = {The Parameterized Complexity of Sequence Alignment and Consensus},
journal = {Theor. Comput. Sci.},
volume = {147},
number = {1{\&}2},
pages = {31--54},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(94)00251-D},
doi = {10.1016/0304-3975(94)00251-D},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderDFW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BodlaenderJ95,
author = {Hans L. Bodlaender and
Klaus Jansen},
title = {Restrictions of Graph Partition Problems. Part {I}},
journal = {Theor. Comput. Sci.},
volume = {148},
number = {1},
pages = {93--109},
year = {1995},
url = {https://doi.org/10.1016/0304-3975(95)00057-4},
doi = {10.1016/0304-3975(95)00057-4},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BodlaenderJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderF95,
author = {Hans L. Bodlaender and
Babette de Fluiter},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Intervalizing k-Colored Graphs},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {87--98},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_65},
doi = {10.1007/3-540-60084-1\_65},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderF95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderH95,
author = {Hans L. Bodlaender and
Torben Hagerup},
editor = {Zolt{\'{a}}n F{\"{u}}l{\"{o}}p and
Ferenc G{\'{e}}cseg},
title = {Parallel Algorithms with Optimal Speedup for Bounded Treewidth},
booktitle = {Automata, Languages and Programming, 22nd International Colloquium,
ICALP95, Szeged, Hungary, July 10-14, 1995, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {944},
pages = {268--279},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60084-1\_80},
doi = {10.1007/3-540-60084-1\_80},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderH95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderTTL95,
author = {Hans L. Bodlaender and
Richard B. Tan and
Dimitrios M. Thilikos and
Jan van Leeuwen},
editor = {Manfred Nagl},
title = {On Interval Routing Schemes and Treewidth},
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 = {181--196},
publisher = {Springer},
year = {1995},
url = {https://doi.org/10.1007/3-540-60618-1\_75},
doi = {10.1007/3-540-60618-1\_75},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderTTL95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Bodlaender94,
author = {Hans L. Bodlaender},
title = {Improved Self-reduction Algorithms for Graphs with Bounded Treewidth},
journal = {Discret. Appl. Math.},
volume = {54},
number = {2-3},
pages = {101--115},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90018-3},
doi = {10.1016/0166-218X(94)90018-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Bodlaender94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BodlaenderJW94,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
title = {Scheduling with Incompatible Jobs},
journal = {Discret. Appl. Math.},
volume = {55},
number = {3},
pages = {219--232},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90009-4},
doi = {10.1016/0166-218X(94)90009-4},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BodlaenderJW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderMW94,
author = {Hans L. Bodlaender and
Shlomo Moran and
Manfred K. Warmuth},
title = {The Distributed Bit Complexity of the Ring: From the Anonymous to
the Non-anonymous Case},
journal = {Inf. Comput.},
volume = {108},
number = {1},
pages = {34--50},
year = {1994},
url = {https://doi.org/10.1006/inco.1994.1002},
doi = {10.1006/INCO.1994.1002},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderMW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Bodlaender94,
author = {Hans L. Bodlaender},
title = {On Disjoint Cycles},
journal = {Int. J. Found. Comput. Sci.},
volume = {5},
number = {1},
pages = {59--68},
year = {1994},
url = {https://doi.org/10.1142/S0129054194000049},
doi = {10.1142/S0129054194000049},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/Bodlaender94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/njc/BodlaenderTS94,
author = {Hans L. Bodlaender and
Gerard Tel and
Nicola Santoro},
title = {Trade-Offs in Non-Reversing Diameter},
journal = {Nord. J. Comput.},
volume = {1},
number = {1},
pages = {111--134},
year = {1994},
timestamp = {Wed, 14 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/njc/BodlaenderTS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/BodlaenderDFW94,
author = {Hans L. Bodlaender and
Rodney G. Downey and
Michael R. Fellows and
Harold T. Wareham},
editor = {Maxime Crochemore and
Dan Gusfield},
title = {The Parameterized Complexity of Sequence Alignment and Consensus},
booktitle = {Combinatorial Pattern Matching, 5th Annual Symposium, {CPM} 94, Asilomar,
California, USA, June 5-8, 1994, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {807},
pages = {15--30},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-58094-8\_2},
doi = {10.1007/3-540-58094-8\_2},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cpm/BodlaenderDFW94.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/BodlaenderJ94,
author = {Hans L. Bodlaender and
Klaus Jansen},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
title = {On the Complexity of the Maximum Cut Problem},
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 = {769--780},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_189},
doi = {10.1007/3-540-57785-8\_189},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderJ94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BodlaenderFH94,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Michael T. Hallett},
editor = {Frank Thomson Leighton and
Michael T. Goodrich},
title = {Beyond NP-completeness for problems of bounded width: hardness for
the {W} hierarchy},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM} Symposium on Theory of
Computing, 23-25 May 1994, Montr{\'{e}}al, Qu{\'{e}}bec,
Canada},
pages = {449--458},
publisher = {{ACM}},
year = {1994},
url = {https://doi.org/10.1145/195058.195229},
doi = {10.1145/195058.195229},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/BodlaenderFH94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderE94,
author = {Hans L. Bodlaender and
Joost Engelfriet},
editor = {Ernst W. Mayr and
Gunther Schmidt and
Gottfried Tinhofer},
title = {Domino Treewith (Extended Abstract)},
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 = {1--13},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-59071-4\_33},
doi = {10.1007/3-540-59071-4\_33},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderE94.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/actaC/Bodlaender93,
author = {Hans L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = {Acta Cybern.},
volume = {11},
number = {1-2},
pages = {1--21},
year = {1993},
url = {https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3417},
timestamp = {Wed, 16 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/actaC/Bodlaender93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bodlaender93,
author = {Hans L. Bodlaender},
title = {On Linear Time Minor Tests with Depth-First Search},
journal = {J. Algorithms},
volume = {14},
number = {1},
pages = {1--23},
year = {1993},
url = {https://doi.org/10.1006/jagm.1993.1001},
doi = {10.1006/JAGM.1993.1001},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/Bodlaender93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/BodlaenderK93,
author = {Hans L. Bodlaender and
Ton Kloks},
title = {A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs},
journal = {J. Algorithms},
volume = {15},
number = {1},
pages = {160--172},
year = {1993},
url = {https://doi.org/10.1006/jagm.1993.1035},
doi = {10.1006/JAGM.1993.1035},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/BodlaenderK93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mmor/Bodlaender93,
author = {Hans L. Bodlaender},
title = {Book review},
journal = {{ZOR} Methods Model. Oper. Res.},
volume = {38},
number = {1},
pages = {18},
year = {1993},
url = {https://doi.org/10.1007/BF01416004},
doi = {10.1007/BF01416004},
timestamp = {Mon, 18 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mmor/Bodlaender93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BodlaenderM93,
author = {Hans L. Bodlaender and
Rolf H. M{\"{o}}hring},
title = {The Pathwidth and Treewidth of Cographs},
journal = {{SIAM} J. Discret. Math.},
volume = {6},
number = {2},
pages = {181--188},
year = {1993},
url = {https://doi.org/10.1137/0406014},
doi = {10.1137/0406014},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/BodlaenderM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bodlaender93,
author = {Hans L. Bodlaender},
title = {Complexity of Path-Forming Games},
journal = {Theor. Comput. Sci.},
volume = {110},
number = {1},
pages = {215--245},
year = {1993},
url = {https://doi.org/10.1016/0304-3975(93)90357-Y},
doi = {10.1016/0304-3975(93)90357-Y},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bodlaender93.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/mfcs/BodlaenderJ93,
author = {Hans L. Bodlaender and
Klaus Jansen},
editor = {Andrzej M. Borzyszkowski and
Stefan Sokolowski},
title = {On the Complexity of Scheduling Incompatible Jobs with Unit-Times},
booktitle = {Mathematical Foundations of Computer Science 1993, 18th International
Symposium, MFCS'93, Gdansk, Poland, August 30 - September 3, 1993,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {711},
pages = {291--300},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57182-5\_21},
doi = {10.1007/3-540-57182-5\_21},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BodlaenderJ93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Bodlaender93,
author = {Hans L. Bodlaender},
editor = {S. Rao Kosaraju and
David S. Johnson and
Alok Aggarwal},
title = {A linear time algorithm for finding tree-decompositions of small treewidth},
booktitle = {Proceedings of the Twenty-Fifth Annual {ACM} Symposium on Theory of
Computing, May 16-18, 1993, San Diego, CA, {USA}},
pages = {226--234},
publisher = {{ACM}},
year = {1993},
url = {https://doi.org/10.1145/167088.167161},
doi = {10.1145/167088.167161},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Bodlaender93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender93,
author = {Hans L. Bodlaender},
editor = {Jan van Leeuwen},
title = {On Reduction Algorithms for Graphs with Small Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {45--56},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_40},
doi = {10.1007/3-540-57899-4\_40},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender93a,
author = {Hans L. Bodlaender},
editor = {Jan van Leeuwen},
title = {Dynamic Algorithms for Graphs with Treewidth 2},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {112--124},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_45},
doi = {10.1007/3-540-57899-4\_45},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender93a.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}
}
@inproceedings{DBLP:conf/icalp/BodlaenderFW92,
author = {Hans L. Bodlaender and
Michael R. Fellows and
Tandy J. Warnow},
editor = {Werner Kuich},
title = {Two Strikes Against Perfect Phylogeny},
booktitle = {Automata, Languages and Programming, 19th International Colloquium,
ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {623},
pages = {273--283},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55719-9\_80},
doi = {10.1007/3-540-55719-9\_80},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderFW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/KloksB92,
author = {Ton Kloks and
Hans L. Bodlaender},
editor = {Toshihide Ibaraki and
Yasuyoshi Inagaki and
Kazuo Iwama and
Takao Nishizeki and
Masafumi Yamashita},
title = {Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs},
booktitle = {Algorithms and Computation, Third International Symposium, {ISAAC}
'92, Nagoya, Japan, December 16-18, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {650},
pages = {116--125},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56279-6\_64},
doi = {10.1007/3-540-56279-6\_64},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/KloksB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderK92,
author = {Hans L. Bodlaender and
Ton Kloks},
editor = {Alain Finkel and
Matthias Jantzen},
title = {A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs},
booktitle = {{STACS} 92, 9th Annual Symposium on Theoretical Aspects of Computer
Science, Cachan, France, February 13-15, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {577},
pages = {415--423},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55210-3\_201},
doi = {10.1007/3-540-55210-3\_201},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderK92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KantB92,
author = {Goos Kant and
Hans L. Bodlaender},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Triangulating Planar Graphs While Minimizing the Maximum Degree},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {258--271},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_22},
doi = {10.1007/3-540-55706-7\_22},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KantB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KloksB92,
author = {Ton Kloks and
Hans L. Bodlaender},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Testing Superperfection of k-Trees},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {292--303},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_25},
doi = {10.1007/3-540-55706-7\_25},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/KloksB92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderJW92,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
editor = {Ernst W. Mayr},
title = {Scheduling with Incompatible Jobs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {37--49},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_34},
doi = {10.1007/3-540-56402-0\_34},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderJW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender92,
author = {Hans L. Bodlaender},
editor = {Ernst W. Mayr},
title = {Kayles on Special Classes of Graphs - An Application of Sprague-Grundy
Theory},
booktitle = {Graph-Theoretic Concepts in Computer Science, 18th International Workshop,
{WG} '92, Wiesbaden-Naurod, Germany, June 19-20, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {657},
pages = {90--102},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56402-0\_39},
doi = {10.1007/3-540-56402-0\_39},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:tr/trier/MI92-09,
author = {Hans L. Bodlaender and
Klaus Jansen and
Gerhard J. Woeginger},
title = {Scheduling with Incompatible Jobs},
journal = {Universit{\"{a}}t Trier, Mathematik/Informatik, Forschungsbericht},
volume = {92-09},
year = {1992},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/tr/trier/MI92-09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/Bodlaender91,
author = {Hans L. Bodlaender},
title = {On the Complexity of Some Coloring Games},
journal = {Int. J. Found. Comput. Sci.},
volume = {2},
number = {2},
pages = {133--147},
year = {1991},
url = {https://doi.org/10.1142/S0129054191000091},
doi = {10.1142/S0129054191000091},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ijfcs/Bodlaender91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/Bodlaender91,
author = {Hans L. Bodlaender},
title = {Some Lower Bound Results for Decentralized Extrema-Finding in Rings
of Processors},
journal = {J. Comput. Syst. Sci.},
volume = {42},
number = {1},
pages = {97--118},
year = {1991},
url = {https://doi.org/10.1016/0022-0000(91)90041-3},
doi = {10.1016/0022-0000(91)90041-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/Bodlaender91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Bodlaender91,
author = {Hans L. Bodlaender},
title = {New Lower Bound Techniques for Distributed Leader Finding and Other
Problems on Rings of Processors},
journal = {Theor. Comput. Sci.},
volume = {81},
number = {2},
pages = {237--256},
year = {1991},
url = {https://doi.org/10.1016/0304-3975(91)90193-6},
doi = {10.1016/0304-3975(91)90193-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Bodlaender91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dcc/BodlaenderGK91,
author = {Hans L. Bodlaender and
Teofilo F. Gonzalez and
Ton Kloks},
editor = {James A. Storer and
John H. Reif},
title = {Complexity Aspects of Map Compression},
booktitle = {Proceedings of the {IEEE} Data Compression Conference, {DCC} 1991,
Snowbird, Utah, USA, April 8-11, 1991},
pages = {287--296},
publisher = {{IEEE} Computer Society},
year = {1991},
url = {https://doi.org/10.1109/DCC.1991.213352},
doi = {10.1109/DCC.1991.213352},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/dcc/BodlaenderGK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BodlaenderK91,
author = {Hans L. Bodlaender and
Ton Kloks},
editor = {Javier Leach Albert and
Burkhard Monien and
Mario Rodr{\'{\i}}guez{-}Artalejo},
title = {Better Algorithms for the Pathwidth and Treewidth of Graphs},
booktitle = {Automata, Languages and Programming, 18th International Colloquium,
ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {510},
pages = {544--555},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-54233-7\_162},
doi = {10.1007/3-540-54233-7\_162},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BodlaenderK91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/KantB91,
author = {Goos Kant and
Hans L. Bodlaender},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {Planar Graph Augmentation Problems (Extended Abstract)},
booktitle = {Algorithms and Data Structures, 2nd Workshop {WADS} '91, Ottawa, Canada,
August 14-16, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {519},
pages = {286--298},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/BFb0028270},
doi = {10.1007/BFB0028270},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/KantB91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/BodlaenderGKH91,
author = {Hans L. Bodlaender and
John R. Gilbert and
Ton Kloks and
Hj{\'{a}}lmtyr Hafsteinsson},
editor = {Gunther Schmidt and
Rudolf Berghammer},
title = {Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height},
booktitle = {17th International Workshop, {WG} '91, Fischbachau, Germany, June
17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {570},
pages = {1--12},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-55121-2\_1},
doi = {10.1007/3-540-55121-2\_1},
timestamp = {Sun, 02 Oct 2022 16:17:33 +0200},
biburl = {https://dblp.org/rec/conf/wg/BodlaenderGKH91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender91,
author = {Hans L. Bodlaender},
editor = {Gunther Schmidt and
Rudolf Berghammer},
title = {On Disjoint Cycles},
booktitle = {17th International Workshop, {WG} '91, Fischbachau, Germany, June
17-19, 1991, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {570},
pages = {230--238},
publisher = {Springer},
year = {1991},
url = {https://doi.org/10.1007/3-540-55121-2\_24},
doi = {10.1007/3-540-55121-2\_24},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BodlaenderGKL90,
author = {Hans L. Bodlaender and
Peter Gritzmann and
Victor Klee and
Jan van Leeuwen},
title = {Computational complexity of norm-maximization},
journal = {Comb.},
volume = {10},
number = {2},
pages = {203--225},
year = {1990},
url = {https://doi.org/10.1007/BF02123011},
doi = {10.1007/BF02123011},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BodlaenderGKL90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Bodlaender90,
author = {Hans L. Bodlaender},
title = {The Complexity of Finding Uniform Emulations on Paths and Ring Networks},
journal = {Inf. Comput.},
volume = {86},
number = {1},
pages = {87--106},
year = {1990},
url = {https://doi.org/10.1016/0890-5401(90)90027-F},
doi = {10.1016/0890-5401(90)90027-F},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/Bodlaender90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BodlaenderT90,
author = {Hans L. Bodlaender and
Gerard Tel},
title = {Bit-Optimal Election in Synchronous Rings},
journal = {Inf. Process. Lett.},
volume = {36},
number = {1},
pages = {53--56},
year = {1990},
url = {https://doi.org/10.1016/0020-0190(90)90187-3},
doi = {10.1016/0020-0190(90)90187-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BodlaenderT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Bodlaender90,
author = {Hans L. Bodlaender},
title = {Polynomial Algorithms for Graph Isomorphism and Chromatic Index on
Partial k-Trees},
journal = {J. Algorithms},
volume = {11},
number = {4},
pages = {631--643},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90013-5},
doi = {10.1016/0196-6774(90)90013-5},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Bodlaender90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BodlaenderM90,
author = {Hans L. Bodlaender and
Rolf H. M{\"{o}}hring},
editor = {John R. Gilbert and
Rolf G. Karlsson},
title = {The Pathwidth and Treewidth of Cographs},
booktitle = {{SWAT} 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen,
Norway, July 11-14, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {447},
pages = {301--309},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-52846-6\_99},
doi = {10.1007/3-540-52846-6\_99},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/BodlaenderM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender90,
author = {Hans L. Bodlaender},
editor = {Rolf H. M{\"{o}}hring},
title = {On the Complexity of Some Coloring Games},
booktitle = {Graph-Theoretic Concepts in Computer Science, 16rd International Workshop,
{WG} '90, Berlin, Germany, June 20-22, 1990, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {484},
pages = {30--40},
publisher = {Springer},
year = {1990},
url = {https://doi.org/10.1007/3-540-53832-1\_29},
doi = {10.1007/3-540-53832-1\_29},
timestamp = {Fri, 17 Jul 2020 16:12:47 +0200},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bodlaender89,
author = {Hans L. Bodlaender},
title = {Achromatic Number is NP-Complete for Cographs and Interval Graphs},
journal = {Inf. Process. Lett.},
volume = {31},
number = {3},
pages = {135--138},
year = {1989},
url = {https://doi.org/10.1016/0020-0190(89)90221-4},
doi = {10.1016/0020-0190(89)90221-4},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/Bodlaender89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jpdc/Bodlaender89,
author = {Hans L. Bodlaender},
title = {The Classification of Coverings of Processor Networks},
journal = {J. Parallel Distributed Comput.},
volume = {6},
number = {1},
pages = {166--182},
year = {1989},
url = {https://doi.org/10.1016/0743-7315(89)90048-8},
doi = {10.1016/0743-7315(89)90048-8},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jpdc/Bodlaender89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/BodlaenderMW89,
author = {Hans L. Bodlaender and
Shlomo Moran and
Manfred K. Warmuth},
editor = {J{\'{a}}nos Csirik and
J{\'{a}}nos Demetrovics and
Ferenc G{\'{e}}cseg},
title = {The Distributed Bit Complexity of the Ring: From the Anonymous to
the Non-anonymous Case},
booktitle = {Fundamentals of Computation Theory, International Conference FCT'89,
Szeged, Hungary, August 21-25, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {380},
pages = {58--67},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51498-8\_6},
doi = {10.1007/3-540-51498-8\_6},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/BodlaenderMW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeameB89,
author = {Paul Beame and
Hans L. Bodlaender},
editor = {Burkhard Monien and
Robert Cori},
title = {Distributed Computing on TRansitive Networks: The Thorus},
booktitle = {{STACS} 89, 6th Annual Symposium on Theoretical Aspects of Computer
Science, Paderborn, FRG, February 16-18, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {349},
pages = {294--303},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/BFb0028993},
doi = {10.1007/BFB0028993},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BeameB89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/Bodlaender89,
author = {Hans L. Bodlaender},
editor = {Frank K. H. A. Dehne and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Nicola Santoro},
title = {On Linear Time Minor Tests and Depth First Search},
booktitle = {Algorithms and Data Structures, Workshop {WADS} '89, Ottawa, Canada,
August 17-19, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {382},
pages = {577--590},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-51542-9\_48},
doi = {10.1007/3-540-51542-9\_48},
timestamp = {Fri, 17 Jul 2020 16:12:48 +0200},
biburl = {https://dblp.org/rec/conf/wads/Bodlaender89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender89,
author = {Hans L. Bodlaender},
editor = {Manfred Nagl},
title = {Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science, 15th International Workshop,
{WG} '89, Castle Rolduc, The Netherlands, June 14-16, 1989, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {411},
pages = {232--244},
publisher = {Springer},
year = {1989},
url = {https://doi.org/10.1007/3-540-52292-1\_17},
doi = {10.1007/3-540-52292-1\_17},
timestamp = {Thu, 14 Oct 2021 10:32:32 +0200},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eatcs/Bodlaender88,
author = {Hans L. Bodlaender},
title = {Some Classes of Graphs with Bounded Treewidth},
journal = {Bull. {EATCS}},
volume = {36},
pages = {116--125},
year = {1988},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eatcs/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bodlaender88,
author = {Hans L. Bodlaender},
title = {A Better Lower Bound For Distributed Leader Finding in Bidirectional,
Asynchronous Rings of Processors},
journal = {Inf. Process. Lett.},
volume = {27},
number = {6},
pages = {287--290},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90215-3},
doi = {10.1016/0020-0190(88)90215-3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Bodlaender88a,
author = {Hans L. Bodlaender},
title = {The Complexity of Finding Uniform Emulations on Fixed Graphs},
journal = {Inf. Process. Lett.},
volume = {29},
number = {3},
pages = {137--141},
year = {1988},
url = {https://doi.org/10.1016/0020-0190(88)90051-8},
doi = {10.1016/0020-0190(88)90051-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Bodlaender88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Bodlaender88,
author = {Hans L. Bodlaender},
editor = {Timo Lepist{\"{o}} and
Arto Salomaa},
title = {Dynamic Programming on Graphs with Bounded Treewidth},
booktitle = {Automata, Languages and Programming, 15th International Colloquium,
ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {317},
pages = {105--118},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19488-6\_110},
doi = {10.1007/3-540-19488-6\_110},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/Bodlaender88,
author = {Hans L. Bodlaender},
editor = {Rolf G. Karlsson and
Andrzej Lingas},
title = {Polynomial Algorithms for Graph Isomorphism and Chromatic Index on
Partial k-Trees},
booktitle = {{SWAT} 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad,
Sweden, July 5-8, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {318},
pages = {223--232},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-19487-8\_26},
doi = {10.1007/3-540-19487-8\_26},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/swat/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Bodlaender88,
author = {Hans L. Bodlaender},
editor = {Jan van Leeuwen},
title = {NC-Algorithms for Graphs with Small Treewidth},
booktitle = {Graph-Theoretic Concepts in Computer Science, 14th International Workshop,
{WG} '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {344},
pages = {1--10},
publisher = {Springer},
year = {1988},
url = {https://doi.org/10.1007/3-540-50728-0\_32},
doi = {10.1007/3-540-50728-0\_32},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/Bodlaender88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SchooneBL87,
author = {Anneke A. Schoone and
Hans L. Bodlaender and
Jan van Leeuwen},
title = {Diameter increase caused by edge deletion},
journal = {J. Graph Theory},
volume = {11},
number = {3},
pages = {409--427},
year = {1987},
url = {https://doi.org/10.1002/jgt.3190110315},
doi = {10.1002/JGT.3190110315},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SchooneBL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gi/Bodlaender87,
author = {Hans L. Bodlaender},
editor = {Manfred Paul},
title = {New Lower Bounds for Distributed Leader Finding in Asynchronous Rings
of Processors},
booktitle = {{GI} - 17. Jahrestagung, Computerintegrierter Arbeitsplatz im B{\"{u}}ro,
M{\"{u}}nchen, 20.-23. Oktober 1987, Proceedings},
series = {Informatik-Fachberichte},
volume = {156},
pages = {82--88},
publisher = {Springer},
year = {1987},
url = {https://doi.org/10.1007/978-3-662-01110-2\_6},
doi = {10.1007/978-3-662-01110-2\_6},
timestamp = {Sat, 07 Sep 2019 11:59:24 +0200},
biburl = {https://dblp.org/rec/conf/gi/Bodlaender87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BodlaenderL86,
author = {Hans L. Bodlaender and
Jan van Leeuwen},
title = {Simulation of Large Networks on Smaller Networks},
journal = {Inf. Control.},
volume = {71},
number = {3},
pages = {143--180},
year = {1986},
url = {https://doi.org/10.1016/S0019-9958(86)80008-0},
doi = {10.1016/S0019-9958(86)80008-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BodlaenderL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderL86,
author = {Hans L. Bodlaender and
Jan van Leeuwen},
editor = {Burkhard Monien and
Guy Vidal{-}Naquet},
title = {New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors},
booktitle = {{STACS} 86, 3rd Annual Symposium on Theoretical Aspects of Computer
Science, Orsay, France, January 16-18, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {210},
pages = {119--129},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-16078-7\_70},
doi = {10.1007/3-540-16078-7\_70},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/SchooneBL86,
author = {Anneke A. Schoone and
Hans L. Bodlaender and
Jan van Leeuwen},
editor = {Gottfried Tinhofer and
Gunther Schmidt},
title = {Improved Diameter Bounds for Altered Graphs},
booktitle = {Graphtheoretic Concepts in Computer Science, International Workshop,
{WG} '86, Bernried, Germany, June 17-19, 1986, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {246},
pages = {227--236},
publisher = {Springer},
year = {1986},
url = {https://doi.org/10.1007/3-540-17218-1\_61},
doi = {10.1007/3-540-17218-1\_61},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/SchooneBL86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BodlaenderL85,
author = {Hans L. Bodlaender and
Jan van Leeuwen},
editor = {Kurt Mehlhorn},
title = {Simulation of Large Networks on Smaller Networks},
booktitle = {{STACS} 85, 2nd Symposium of Theoretical Aspects of Computer Science,
Saarbr{\"{u}}cken, Germany, January 3-5, 1985, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {182},
pages = {47--58},
publisher = {Springer},
year = {1985},
url = {https://doi.org/10.1007/BFb0023994},
doi = {10.1007/BFB0023994},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BodlaenderL85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-02-13 19:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
