Publications
2022
Scholarly publications
Bodlaender, H. L., Cornelissen, G., & Wegen, M. V. D. (2022). Problems hard for treewidth but easy for stable gonality. (CoRR), (arXiv). https://doi.org/10.48550/arXiv.2202.06838
Bodlaender, H. L., Groenland, C., Nederlof, J., & Swennenhuis, C. M. F. (2022). Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space. In Proceedings - 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science, FOCS 2021 (pp. 193-204). (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; Vol. 2022-February). IEEE Computer Society. https://doi.org/10.1109/FOCS52979.2021.00027
Bodlaender, H. L. (2022). From the W-hierarchy to XNLP: Classes of Fixed Parameter Intractability. In P. Mutzel, M. S. Rahman, & Slamin (Eds.), WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Proceedings (pp. 15-25). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 13174 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-96731-4_2
2021
Scholarly publications
Bodlaender, H. L., Groenland, C., & Swennenhuis, C. M. F. (2021). Parameterized complexities of dominating and independent set reconfiguration. In P. A. Golovach, & M. Zehavi (Eds.), 16th International Symposium on Parameterized and Exact Computation, IPEC 2021 (pp. 9:1-9:16). [9] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 214). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2021.9
Bodlaender, H. L., Jaffke, L., & Telle, J. A. (2021). Typical Sequences Revisited — Computing Width Parameters of Graphs. Theory of Computing Systems. https://doi.org/10.1007/s00224-021-10030-3
Bodlaender, H. L., van Dobben de Bruyn, J., Gijswijt, D., & Smit, H. (Accepted/In press). Constructing tree decompositions of graphs with bounded gonality. Journal of Combinatorial Optimization. https://doi.org/10.1007/s10878-021-00762-w
D’Ambrosio, F., Bodlaender, H. L., & Barkema, G. T. (2021). Dynamic sampling from a discrete probability distribution with a known distribution of rates. Computational Statistics. https://doi.org/10.1007/s00180-021-01159-3
Bodlaender, H. L., Kolay, S., & Pieterse, A. (2021). Parameterized complexity of conflict-free graph coloring. SIAM Journal on Discrete Mathematics, 35(3), 2003-2038. https://doi.org/10.1137/19M1307160
Bodlaender, H. L. (2021). Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. In L. Kowalik, M. Pilipczuk, & P. Rzazewski (Eds.), Graph-Theoretic Concepts in Computer Science: 47th International Workshop, WG 2021, Revised Selected Papers (pp. 15-27). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12911 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-86838-3_2
Saitoh, T., Yoshinaka, R., & Bodlaender, H. L. (2021). Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes. In R. Uehara, S-H. Hong, & S. C. Nandy (Eds.), WALCOM: Algorithms and Computation - 15th International Conference and Workshops, WALCOM 2021, Proceedings (pp. 142-153). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12635 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-68211-8_12
Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., & van Leeuwen, E. J. (2021). Steiner trees for hereditary graph classes: A treewidth perspective. Theoretical Computer Science, 867, 30-39. https://doi.org/10.1016/j.tcs.2021.03.012
Bodlaender, H. L., van der Wegen, M., & van der Zanden, T. C. (2021). Stable Divisorial Gonality is in NP. Theory of Computing Systems, 65(2), 428–440. https://doi.org/10.1007/s00224-020-10019-4
2020
Scholarly publications
Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., & Leeuwen, E. J. V. (2020). Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective. (pp. 1-16). arXiv. http://arxiv.org/abs/2004.07492v1
Bodlaender, H. L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y., & Zanden, T. C. V. D. (2020). Hedonic Seat Arrangement Problems. In A. E. F. Seghrouchni, G. Sukthankar, B. An, & N. Yorke-Smith (Eds.), Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, AAMAS '20, Auckland, New Zealand, May 9-13, 2020 (pp. 1777-1779). International Foundation for Autonomous Agents and Multiagent Systems. http://10.5555/3398761.3398979
Bodlaender, H. L., Brettell, N., Johnson, M., Paesani, G., Paulusma, D., & van Leeuwen, E. J. (2020). Steiner Trees for Hereditary Graph Classes. In Y. Kohayakawa, & F. K. Miyazawa (Eds.), LATIN 2020: Theoretical Informatics - 14th Latin American Symposium 2021, Proceedings (pp. 613-624). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 12118 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61792-9_48
De Berg, M., Bodlaender, H. L., Kisfaludi-Bak, S., Marx, D., & Van Der Zanden, T. C. (2020). A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. SIAM Journal on Computing, 49(6), 1291-1331. https://doi.org/10.1137/20M1320870
Bodlaender, H. L., & Wegen, M. V. D. (2020). Parameterized Complexity of Scheduling Chains of Jobs with Delays. In Y. Cao, & M. Pilipczuk (Eds.), 15th International Symposium on Parameterized and Exact Computation (IPEC 2020) (pp. 4:1-4:15). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 180). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.IPEC.2020.4
Bodlaender, H. L., Burton, B., Fomin, F. V., & Grigoriev, A. (2020). Knot Diagrams of Treewidth Two. In I. Adler, & H. Müller (Eds.), Graph-Theoretic Concepts in Computer Science: 46th International Workshop, WG 2020, Leeds, UK, June 24–26, 2020, Revised Selected Papers (pp. 80-91). (Lecture Notes in Computer Science; Vol. 12301 ), (Theoretical Computer Science and General Issues book sub series; Vol. 12301). Springer, Cham. https://doi.org/10.1007/978-3-030-60440-0_7
Bodlaender, H. L., Bruyn, J. V. D. D., Gijswijt, D., & Smit, H. (2020). Constructing Tree Decompositions of Graphs with Bounded Gonality. In D. Kim, R. N. Uma, Z. Cai, & D. H. Lee (Eds.), Computing and Combinatorics: 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings (pp. 384-396). ( Lecture Notes in Computer Science ; Vol. 12273). Springer. https://doi.org/10.1007/978-3-030-58150-3_31
Bodlaender, H. L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y., & Zanden, T. C. V. D. (2020). Hedonic Seat Arrangement Problems. In A. E. F. Seghrouchni, G. Sukthankar, B. An, & N. Yorke-Smith (Eds.), AAMAS '20: Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (pp. 1777-1779). International Foundation for Autonomous Agents and Multiagent Systems. https://doi.org/10.5555/3398761.3398979
Bodlaender, H. L., & van der Zanden, T. C. (2020). On the exact complexity of polyomino packing. Theoretical Computer Science, 839, 13-20. https://doi.org/10.1016/j.tcs.2020.05.025
Bodlaender, H. L., Hanaka, T., Kobayashi, Y., Kobayashi, Y., Okamoto, Y., Otachi, Y., & Zanden, T. C. V. D. (2020). Subgraph Isomorphism on Graph Classes that Exclude a Substructure. Algorithmica, 82(12), 3566-3587. https://doi.org/10.1007/s00453-020-00737-z
Bodlaender, H. L., Hanaka, T., Jaffke, L., Ono, H., Otachi, Y., & Zanden, T. C. V. D. (2020). Hedonic Seat Arrangement Problems. CoRR, abs/2002.10898. https://arxiv.org/abs/2002.10898
Bodlaender, H. L., Jaffke, L., & Telle, J. A. (2020). Typical Sequences Revisited: Computing Width Parameters of Graphs. In C. Paul, & M. Bläser (Eds.), 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10-13, 2020, Montpellier, France (Vol. 154, pp. 57:1-57:16). (LIPIcs). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH. https://doi.org/10.4230/LIPIcs.STACS.2020.57
Bodewes, J. M., Bodlaender, H. L., Cornelissen, G., & van der Wegen, M. (2020). Recognizing hyperelliptic graphs in polynomial time. Theoretical Computer Science, 815, 121-146. https://doi.org/10.1016/j.tcs.2020.02.013
D'Ambrosio, F., Barkema, G. T., & Bodlaender, H. L. (2020). Dynamic Sampling from a Discrete Probability Distribution with a Known Distribution of Rates. Manuscript submitted for publication. http://arxiv.org/abs/1802.02379
2019
Scholarly publications
Bodlaender, H. L., Kolay, S., & Pieterse, A. (2019). Parameterized complexity of conflict-free graph coloring. In Z. Friggstad, M. R. Salavatipour, & J-R. Sack (Eds.), Algorithms and Data Structures - 16th International Symposium, WADS 2019, Proceedings (pp. 168-180). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11646 LNCS). Springer. https://doi.org/10.1007/978-3-030-24766-9_13
Hanaka, T., Bodlaender, H. L., van der Zanden, T. C., & Ono, H. (2019). On the maximum weight minimal separator. Theoretical Computer Science, 796, 294-308. https://doi.org/10.1016/j.tcs.2019.09.025
de Berg, M., Bodlaender, H. L., & Kisfaludi-Bak, S. (2019). The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds. Algorithmica, 81(7), 2963–2990. https://doi.org/10.1007/s00453-019-00561-0
Berg, M. D., Bodlaender, H. L., & Kisfaludi-Bak, S. (2019). The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms. Algorithmica, 81(7), 2934-2962. https://doi.org/10.1007/s00453-019-00567-8
Bodlaender, H. L., Hanaka, T., Okamoto, Y., Otachi, Y., & van der Zanden, T. C. (2019). Subgraph Isomorphism on Graph Classes that Exclude a Substructure. In P. Heggernes (Ed.), Algorithms and complexity: 11th International Conference, CIAC 2019 Rome, Italy, May 27-29, 2019, Proceedings (pp. 87-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11485 LNCS). Springer. https://doi.org/10.1007/978-3-030-17402-6_8
Bodlaender, H. L., Wegen, M. V. D., & Zanden, T. C. V. D. (2019). Stable Divisorial Gonality is in NP. In B. Catania, R. Královič, J. Nawrocki, & G. Pighizzini (Eds.), SOFSEM 2019: Theory and Practice of Computer Science: 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings (pp. 81-93). (Lecture Notes in Computer Science; Vol. 11376). Springer. https://doi.org/10.1007/978-3-030-10801-4_8
Bodlaender, H. L., & van der Zanden, T. C. (2019). On exploring always-connected temporal graphs of small pathwidth. Information Processing Letters, 142, 68-71. https://doi.org/10.1016/j.ipl.2018.10.016
2018
Scholarly publications
Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica. https://doi.org/10.1007/s00453-017-0399-9
Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). A faster parameterized algorithm for Pseudoforest Deletion. Discrete Applied Mathematics. https://doi.org/10.1016/j.dam.2017.10.018
Bodlaender, H. L., Wegen, M. V. D., & Zanden, T. C. V. D. (2018). Stable divisorial gonality is in NP. CoRR, [1808.06921]. http://arxiv.org/abs/1808.06921
Bodlaender, H. L., & van der Zanden, T. C. (2018). On Exploring Temporal Graphs of Small Pathwidth. CoRR, [1807.11869]. http://arxiv.org/abs/1807.11869
Berg, M. D., Bodlaender, H. L., Kisfaludi-Bak, S., & Kolay, S. (2018). An ETH-Tight Exact Algorithm for Euclidean TSP. CoRR, [1807.06933]. http://arxiv.org/abs/1807.06933
https://dspace.library.uu.nl/bitstream/handle/1874/375465/1807.06933.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/375465/1807.06933.pdf?sequence=1
Berg, M. D., Bodlaender, H. L., Kisfaludi-Bak, S., Marx, D., & Zanden, T. C. V. D. (2018). Framework for ETH-tight Algorithms and Lower Bounds in Geometric Intersection Graphs. Manuscript submitted for publication. http://arxiv.org/abs/1803.10633
Berg, M. D., Bodlaender, H. L., Kisfaludi-Bak, S., & Kolay, S. (2018). An ETH-Tight Exact Algorithm for Euclidean TSP. In Proceedings 59th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2018 (pp. 450-461). IEEE Computer Society. https://doi.org/10.1109/FOCS.2018.00050
Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity. Algorithmica, 80(7), 2160-2180. https://doi.org/10.1007/s00453-017-0399-9
Bodewes, J. M., Bodlaender, H. L., Cornelissen, G., & van der Wegen, M. (2018). Recognizing hyperelliptic graphs in polynomial time. In Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Proceedings (pp. 52-64). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11159 LNCS). Springer. https://doi.org/10.1007/978-3-030-00256-5_5
https://dspace.library.uu.nl/bitstream/handle/1874/373730/Recognizing_hyperelliptic_graphs_WG_versie_.pdf?sequence=2
https://dspace.library.uu.nl/bitstream/handle/1874/373730/Recognizing_hyperelliptic_graphs_WG_versie_.pdf?sequence=2
Bodlaender, H. L., & Van Der Zanden, T. C. (2018). On the exact complexity of polyomino packing. In 9th International Conference on Fun with Algorithms, FUN 2018 (pp. 9:1-9:10). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 100). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.FUN.2018.9
Bodlaender, H. L., Ono, H., & Otachi, Y. (2018). A faster parameterized algorithm for PSEUDOFOREST DELETION. Discrete Applied Mathematics, 236, 42-56. https://doi.org/10.1016/j.dam.2017.10.018
2017
Scholarly publications
Bodlaender, H. L., & Woeginger, G. J. (2017). Preface. In H. L. Bodlaender (Ed.), Graph-Theoretic Concepts in Computer Science: 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers (pp. V-VI). (Lecture Notes in Computer Science; Vol. 10520). Springer.
https://dspace.library.uu.nl/bitstream/handle/1874/360588/Preface.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/360588/Preface.pdf?sequence=1
van der Zanden, T. C., & Bodlaender, H. L. (2017). Computing Treewidth on the GPU. In Proceedings of the 12th International Symposium on Parameterisiert and Exact Computation (IPEC 2017) (Leibniz International Proceedings in Informatics (LIPIcs)). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2017.29
de Berg, M., Bodlaender, H. L., & Kisfaludi-Bak, S. (2017). The homogeneous broadcast problem in narrow and wide strips. In Algorithms and Data Structures: 15th International Symposium, WADS 2017, Proceedings (pp. 289-300). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS). Springer. https://doi.org/10.1007/978-3-319-62127-2_25
Jaffke, L., Bodlaender, H. L., Heggernes, P., & Telle, J. A. (2017). Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees. European Journal of Combinatorics, 66, 191-234. https://doi.org/10.1016/j.ejc.2017.06.025
Hanaka, T., Bodlaender, H. L., Van Der Zanden, T. C., & Ono, H. (2017). On the maximum weight minimal separator. In Theory and Applications of Models of Computation: 14th Annual Conference, TAMC 2017, Proceedings (pp. 304-318). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10185 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-55911-7_22
Bodlaender, H. L., & Van Der Zanden, T. C. (2017). Improved lower bounds for graph embedding problems. In Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens, Greece, May 24-26, 2017, Proceedings (pp. 92-103). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10236 LNCS). Springer-Verlag. https://doi.org/10.1007/978-3-319-57586-5_9
Pino, W. J. A., Bodlaender, H. L., & Van Rooij, J. M. M. (2017). Cut and Count and representative sets on branch decompositions. In 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 (Vol. 63). [27] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2016.27
Bodlaender, H. L., Ono, H., & Otachi, Y. (2017). A faster parameterized algorithm for pseudoforest deletion. In 11th International Symposium on Parameterized and Exact Computation, IPEC 2016 (Vol. 63). [7] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2016.7
Bodlaender, H. L., Kratsch, S., Kreuzen, V. J. C., Kwon, O. J., & Ok, S. (2017). Characterizing width two for variants of treewidth. Discrete Applied Mathematics, 216(part 1), 29-46. https://doi.org/10.1016/j.dam.2015.01.015
Popularising publications
Bodlaender, H. L. (2017). Hoe verbonden is je netwerk? Nieuw archief voor wiskunde. Serie 5, 18(1), 40.
https://dspace.library.uu.nl/bitstream/handle/1874/351484/netwerk.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/351484/netwerk.pdf?sequence=1
2016
Scholarly publications
Bodlaender, H. L., Ono, H., & Otachi, Y. (2016). Degree-constrained orientation of maximum satisfaction: Graph classes and parameterized complexity. In 27th International Symposium on Algorithms and Computation, ISAAC 2016 (Vol. 64, pp. 20.1-20.12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2016.20
Bodlaender, H. L. (2016). Treewidth of Graphs. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 2255-2257). Springer. http://10.1007/978-1-4939-2864-4_431
Bodlaender, H. L., Fomin, F. V., Lokshtanov, D., Penninkx, E., Saurabh, S., & Thilikos, D. M. (2016). (Meta) Kernelization. Journal of the ACM, 63(5), [44]. https://doi.org/10.1145/2973749
Bodlaender, H., Nederlof, J., & van der Zanden, T. (2016). Subexponential Time Algorithms for Embedding H-Minor Free Graphs. In Y. R. Ioannis Chatzigiannakis Michael Mitzenmacher, & D. Sangiorgi (Eds.), 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) (Vol. 55, pp. 1-14). [9] (Leibniz International Proceedings in Informatics (LIPIcs)). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2016.9
Bodlaender, H. L., Drange, P. G., Dregi, M. S., Fomin, F. V., Lokshtanov, D., & Pilipczuk, M. (2016). A cκn 5-Approximation algorithm for treewidth. SIAM Journal on Computing, 45(2), 317-378. https://doi.org/10.1137/130947374
van den Akker, M., Bodlaender, H. L., van Dijk, T. C., Hoogeveen, J., & van Ommeren, E. (2016). Robust recoverable path using backup nodes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9587, pp. 95-106). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9587). Springer. https://doi.org/10.1007/978-3-662-49192-8_8
Bodlaender, H. L., & van Rooij, J. M. M. (2016). Exact Algorithms for Intervalizing Coloured Graphs. Theory of Computing Systems, 58(2), 273-286. https://doi.org/10.1007/s00224-015-9616-6
Other output
van den Akker, J. M., Bodlaender, H. L., van Dijk, T. C., Hoogeveen, J. A., & van Ommeren, E. (2016). Robust Recoverable Path using Backup Nodes. Paper presented at SOFSEM 2016, Czech Republic.
2015
Scholarly publications
Jaffke, L., & Bodlaender, H. L. (2015). Definability equals recognizability for κ-outerplanar graphs. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 43, pp. 176-186). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2015.175
Ten Brinke, C. B., Van Houten, F. J. P., & Bodlaender, H. L. (2015). Practical algorithms for linear boolean-width. In Leibniz International Proceedings in Informatics, LIPIcs (Vol. 43, pp. 187-198). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.IPEC.2015.187
Bodlaender, H. L., & van Kreveld, M. J. (2015). Google Scholar makes it hard - the complexity of organizing one's publications. Information Processing Letters, 115(12), 965-968. https://doi.org/10.1016/j.ipl.2015.07.003
Bodlaender, H., Boros, E., Heggernes, P., & Kratsch, D. (2015). Open Problems of the Lorentz Workshop, "Enumeration Algorithms using Structure". (Technical Report Series; No. UU-CS-2015-016). UU BETA ICS Departement Informatica.
https://dspace.library.uu.nl/bitstream/handle/1874/325991/Open.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/325991/Open.pdf?sequence=1
Bodlaender, H. L., Hajiaghayi, M. T., & Italiano, G. F. (2015). Erratum to: Editorial [Algorithmica, DOI:10.1007/s00453-015-0074-y]. Algorithmica, 73(4), 750. https://doi.org/10.1007/s00453-015-0091-x
Bodlaender, H. L., Heggernes, P., & Telle, J. A. (2015). Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. Electronic Notes in Discrete Mathematics, 49, 559-568. https://doi.org/10.1016/j.endm.2015.06.076
Bodlaender, H. L., & Nederlof, J. (2015). Subexponential time algorithms for finding small tree and path decompositions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9294, pp. 179-190). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9294). Springer. https://doi.org/10.1007/978-3-662-48350-3_16
Van Der Zanden, T. C., & Bodlaender, H. L. (2015). PSPACE-completeness of Bloxorz and of games with 2-buttons. In V. T. Paschos , & P. Widmayer (Eds.), Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings (pp. 403-415). (Lecture Notes in Computer Science; Vol. 9079). Springer. https://doi.org/10.1007/978-3-319-18173-8_30
Bodlaender, H. L., Hajiaghayi, M., & Italiano, G. F. (Accepted/In press). Editorial. Algorithmica, 73(3). https://doi.org/10.1007/s00453-015-0074-y
Bodlaender, H. L., Cygan, M., Kratsch, S., & Nederlof, J. (2015). Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Information and Computation, 243, 86-111. https://doi.org/10.1016/j.ic.2014.12.008
Jaffke, L., & Bodlaender, H. L. (2015). MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs. arXiv.org.
https://dspace.library.uu.nl/bitstream/handle/1874/309470/1503.01604v1?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/309470/1503.01604v1?sequence=1
Bodlaender, H. L., Kratsch, D., & Timmer, S. T. (2015). Exact algorithms for Kayles. Theoretical Computer Science, 562, 165-176. https://doi.org/10.1016/j.tcs.2014.09.042
Fafianie, S., Bodlaender, H. L., & Nederlof, J. (2015). Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. Algorithmica, 71(3), 636. https://doi.org/10.1007/s00453-014-9934-0
2014
Scholarly publications
Bodlaender, H. L., & van Kreveld, M. (2014). Google Scholar makes it Hard - the complexity of organizing one's publications. CoRR, abs/1410.3820, 1-5. http://arxiv.org/abs/1410.3820
Bodlaender, H. (2014). Treewidth of Graphs: Encyclopedia of Algorithms. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 1-5). Springer US. https://doi.org/10.1007/978-3-642-27848-8_431-2
Bodlaender, H. (2014). Kernelization, Exponential Lower Bounds: Encyclopedia of Algorithms. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 1-6). Springer US. https://doi.org/10.1007/978-3-642-27848-8_521-1
Bodlaender, H. (2014). Lower Bounds for Kernelization. In M. Cygan, & P. Heggernes (Eds.), Parameterized and Exact Computation: 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers (pp. 1-14). (Lecture Notes in Computer Science). Springer International Publishing. https://doi.org/10.1007/978-3-319-13524-3_1
Zanden, T. C. V. D., & Bodlaender, H. L. (2014). PSPACE-completeness of Bloxorz and of Games with 2-Buttons. CoRR, abs/1411.5951. http://arxiv.org/abs/1411.5951
Rietbergen, M., van der Gaag, L., & Bodlaender, H. (2014). Provisional Propagation for Verifying Monotonicity of Bayesian Networks. In T. Schaub, G. Friedrich, & B. O. Sullivan (Eds.), ECAI 2014 - 21st European Conference on Artificial Intelligence (pp. 759-764). (Frontiers in Artificial Intelligence and Applications; Vol. 263). IOS Press. https://doi.org/10.3233/978-1-61499-419-0-759
Betzler, N., Bodlaender, H. L., Bredereck, R., Niedermeier, R., & Uhlmann, J. (2014). On making a distinguished vertex of minimum degree by vertex deletion. Algorithmica, 68(3), 715-738. https://doi.org/10.1007/s00453-012-9695-6
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2014). Kernelization lower bounds by cross-composition. SIAM Journal on Discrete Mathematics, 28(1), 277-305. https://doi.org/10.1137/120880240
Other output
Bodlaender, H., Heggernes, P., & Lokshtanov, D. (2014). Graph Modification Problems (Dagstuhl Seminar 14071). 38-59. Graph Modification Problems, Dagstuhl, Germany. https://doi.org/10.4230/DagRep.4.2.38
2013
Scholarly publications
Bodlaender, H. L., Drange, P. G., Dregi, M. S., Fomin, F. V., Lokshtanov, D., & Pilipczuk, M. (2013). A O(ck n) 5-Approximation Algorithm for Treewidth. CoRR, abs/1304.6321. http://arxiv.org/abs/1304.6321
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2013). Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. SIAM Journal on Discrete Mathematics, 27(4), 2108-2142. https://doi.org/10.1137/120903518
Bodlaender, H. L., Drange, P. G., Dregi, M. S., Fomin, F. V., Lokshtanov, D., & Pilipczuk, M. (2013). An O(c^k n) 5-Approximation Algorithm for Treewidth. In 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013 (pp. 499-508). IEEE Computer Society. https://doi.org/10.1109/FOCS.2013.60
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2013). Kernel bounds for path and cycle problems. Theoretical Computer Science, 511, 117-136. https://doi.org/10.1016/j.tcs.2012.09.006
Jansen, B. M. P., & Bodlaender, H. L. (2013). Vertex Cover Kernelization Revisited - Upper and Lower Bounds for a Refined Parameter. Theory of Computing Systems, 53(2), 263-299. https://doi.org/10.1007/s00224-012-9393-4
Bodlaender, H. L., Kratsch, S., & Kreuzen, S. (2013). Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. In A. Brandstädt, K. Jansen, & R. Reischuk (Eds.), Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers (pp. 88-99). Springer. https://doi.org/10.1007/978-3-642-45043-3_9
Bodlaender, H. L., Bonsma, P., & Lokshtanov, D. (2013). The Fine Details of Fast Dynamic Programming over Tree Decompositions. In G. Gutin, & S. Szeider (Eds.), Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers (pp. 41-53). Springer. https://doi.org/10.1007/978-3-319-03898-8_5
van Rooij, J. M. M., Bodlaender, H. L., & van Kooten Niekerk, M. E. (2013). Partition Into Triangles on Bounded Degree Graphs. Theory of Computing Systems, 52(4), 687-718. https://doi.org/10.1007/s00224-012-9412-5
Bodlaender, H. L., & Italiano, G. F. (2013). Algorithms - ESA 2013 - 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings. (Lecture Notes in Computer Science ed.) Springer. https://doi.org/10.1007/978-3-642-40450-4
Fafianie, S., Bodlaender, H. L., & Kratsch, S. (2013). Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions. In G. Gutin, & S. Szeider (Eds.), Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers. (pp. 321-334). Springer. https://doi.org/10.1007/978-3-319-03898-8_27
Bodlaender, H. L., Cygan, M., Kratsch, S., & Nederlof, J. (2013). Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. In F. V. Fomin, F. Freivalds, M. Z. Kwiatkowska, & D. Peleg (Eds.), Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I (pp. 196-207). (Lecture Notes in Computer Science; Vol. 7965). Springer. https://doi.org/10.1007/978-3-642-39206-1_17
2012
Scholarly publications
Bodlaender, H. L., Cygan, M., Kratsch, S., & Nederlof, J. (2012). Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time. CoRR, abs/1211.1505. http://arxiv.org/abs/1211.1505
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2012). Kernel Bounds for Structural Parameterizations of Pathwidth. CoRR, abs/1207.4900. http://arxiv.org/abs/1207.4900
van der Gaag, L., Bodlaender, H. L., & Feelders, A. (2012). Monotonicity in Bayesian Networks. CoRR, abs/1207.4160. http://arxiv.org/abs/1207.4160
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2012). Kernelization Lower Bounds By Cross-Composition. CoRR, abs/1206.5941. http://arxiv.org/abs/1206.5941
Bodlaender, H. L., Fomin, F. V., Golovach, P. A., Otachi, Y., & van Leeuwen, E. J. (2012). Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica, 64(1), 85-111. https://doi.org/10.1007/s00453-011-9565-7
Bodlaender, H. L., Kratsch, D., & Timmer, S. (2012). Exact algorithms for Kayles. Department of Information and Computing Sciences, Utrecht University.
Bodlaender, H. L., Downey, R. G., Fomin, F. V., & Marx, D. (2012). The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. (Lecture Notes in Computer Science ed.) Springer. https://doi.org/10.1007/978-3-642-30891-8
Hage, J., & Bodlaender, H. L. (2012). On switching classes, NLC-width, cliquewidth and treewidth. Theoretical Computer Science, 429, 30-35.
Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D., & Thilikos, D. M. (2012). On exact algorithms for treewidth. ACM Transactions on Algorithms, 9(1).
Bodlaender, H. L. (2012). Probabilistic Inference and Monadic Second Order Logic. In J. C. M. Baeten, T. Ball, & F. de Boer (Eds.), Proceedings 7th IFIP TC 1/WG 2.2 International Conference on Theoretical Computer Science IFIP-TCS 2012 (pp. 43-56). Springer. https://doi.org/10.1007/978-3-642-33475-7_4
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2012). Kernel Bounds for Path and Cycle Problems. In D. Marx, & P. Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011, Saarbrücken, Germany, September 6-8, 2011. Revised Selected Papers (pp. 145-158). Springer.
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2012). Kernel Bounds for Structural Parameterizations of Pathwidth. In F. V. Fomin, & P. Kaski (Eds.), Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012 (pp. 352-363). Springer. https://doi.org/10.1007/978-3-642-31155-0_31
van Rooij, J. M. M., & Bodlaender, H. L. (2012). Exact Algorithms for Edge Domination. Algorithmica, 64(4), 535-564. https://doi.org/10.1007/s00453-011-9546-x
Bodlaender, H. L. (2012). Fixed-Parameter Tractability of Treewidth and Pathwidth. In H. L. Bodlaender, R. G. Downey, F. V. Fomin, & D. Marx (Eds.), The Multivariate Algorithmic Revolution and Beyond (pp. 196-227). Springer. https://doi.org/10.1007/978-3-642-30891-8_12
Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D., & Thilikos, D. M. (2012). A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory of Computing Systems, 50(3), 420-432. https://doi.org/10.1007/s00224-011-9312-0
Bodlaender, H. L., Schuurman, P., & Woeginger, G. J. (2012). Scheduling of pipelined operator graphs. Journal of Scheduling, 15(3), 323-332. https://doi.org/10.1007/s10951-011-0225-1
2011
Scholarly publications
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2011). Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. CoRR, abs/1104.4217. http://arxiv.org/abs/1104.4217
Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., & Weyer, M. (2011). Quadratic kernelization for the convex recoloring of trees. Algorithmica, 61, 362-388.
Bodlaender, H. L., & Kratsch, D. (2011). Exact Algorithms for Kayles. Department of Information and Computing Sciences, Utrecht University.
Jansen, B. M. P., & Bodlaender, H. L. (2011). Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. In T. Schwentick, & C. Dürr (Eds.), 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 (pp. 177-188). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
van Rooij, J. M. M., van Kooten Niekerk, M. E., & Bodlaender, H. L. (2011). Partition into Triangles on Bounded Degree Graphs. In I. Cerná, T. Gyimóthy, J. Hromkovic, K. Jeffery, R. Královic, M. Vukolic, & S. Wolf (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science (pp. 558-569). Springer.
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2011). Kernel Bounds for Path and Cycle Problems. In D. Marx, & P. Rossmanith (Eds.), Parameterized and Exact Computation - 6th International Symposium, IPEC 2011 (pp. 145-158). Springer.
Bodlaender, H. L., Kozawa, K., Matsushima, T., & Otachi, Y. (2011). Spanning tree congestion of k-outerplanar graphs. Discrete Mathematics, 311, 1040-1045.
Bodlaender, H. L., Heggernes, P., & Villanger, Y. (2011). Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica, 61(4), 817-838. https://doi.org/10.1007/s00453-010-9421-1
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2011). Cross-Composition: A New Technique for Kernelization Lower Bounds. In C. Dürr, & T. Schwentick (Eds.), Proceedings 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011 (pp. 165-176). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2011). Parameterized Complexity of Vertex Deletion into Perfect Graph Classes. In O. Owe, M. Steffen, & J. A. Telle (Eds.), Proceedings 18th International Symposium on Fundamentals of Computation Theory, FCT 2011 (pp. 240-251). Springer. https://doi.org/10.1007/978-3-642-22953-4_21
Bodlaender, H. L., & van Rooij, J. M. M. (2011). Exact algorithms for intervalizing colored graphs. In A. Marchetti-Spaccamela, & M. Segal (Eds.), Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems TAPAS 2011 (pp. 45-56). Springer.
Kwisthout, J., Bodlaender, H. L., & van der Gaag, L. C. (2011). The Complexity of Finding the Most Probable Explanations in Probabilistic Networks. In I. Cerná, T. Gyimóthy, J. Hromkovic, K. G. Jeffery, R. Královic, M. Vukolic, & S. Wolf (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science (pp. 356-367). Springer.
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2011). Preprocessing for Treewidth: A combinatorial analysis through kernelization. In L. Aceto, M. Henzinger, & J. Sgall (Eds.), Proceedings of the 38th International Colloquium on Automata, Languages, and Programming ICALP 2011 (pp. 437-448). Springer.
Bodlaender, H. L., & Koster, A. M. C. A. (2011). Treewidth computations II. Lower bounds. Information and Computation, 209(7), 1103-1119. https://doi.org/10.1016/j.ic.2011.04.003
Bodlaender, H. L., & Kratsch, D. (2011). Exact Algorithms for Kayles. In P. Kolman, & J. Kratochvil (Eds.), Proceedings 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011 (pp. 59-70). Springer. https://doi.org/10.1007/978-3-642-25870-1_7
van der Gaag, L. C., & Bodlaender, H. L. (2011). On Stopping Evidence Gathering for Diagnostic Bayesian Networks. In W. Liu (Ed.), Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 11th European Conference, ECSQARU 2011 (pp. 170-181). Springer.
Overwijk, A., Penninkx, E., & Bodlaender, H. L. (2011). A Local Search Algorithm for Branchwidth. In I. Cerná, T. Gyimóthy, J. Hromkovic, K. G. Jeffery, R. Královic, M. Vukolic, & S. Wolf (Eds.), SOFSEM 2011: Theory and Practice of Computer Science - 37th Conference on Current Trends in Theory and Practice of Computer Science (pp. 444-454). Springer.
Bodlaender, H. L., Thomassé, S., & Yeo, A. (2011). Kernel bounds for disjoint cycles and disjoint paths. Theoretical Computer Science, 412, 4570-4578.
Bodlaender, H. L., Jansen, B. P. M., & Kratsch, S. (2011). Kernel Bounds for Path and Cycle Problems. CoRR, abs/1106.4.
van Rooij, J. M. M., & Bodlaender, H. L. (2011). Exact algorithms for dominating set. Discrete Applied Mathematics, 159, 2147-2164.
2010
Scholarly publications
Jansen, B. M. P., & Bodlaender, H. L. (2010). Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. CoRR, abs/1012.4701. http://arxiv.org/abs/1012.4701
Bodlaender, H. L., Jansen, B. M. P., & Kratsch, S. (2010). Cross-Composition: A New Technique for Kernelization Lower Bounds. CoRR, abs/1011.4224. http://arxiv.org/abs/1011.4224
Bodlaender, H. L., Grigoriev, A., Grigorieva, N. V., & Hendriks, A. (2010). The Valve Location Problem in Simple Network Topologies. INFORMS Journal on Computing, 22, 433-442.
Bodlaender, H. L., & van Rooij, J. M. M. (2010). Exact algorithms for Intervalizing Colored Graphs. Department of Information and Computing Sciences, Utrecht University.
Bodlaender, H. L., van Leeuwen, E. J., & van Rooij, J. M. M. (2010). Faster algorithms on branch and clique decompositions. In P. Hlineny, & A. Kucera (Eds.), Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science, MFCS 2010 (pp. 174-185). Springer.
Bodlaender, H. L., & van Dijk, T. C. (2010). A cubic kernel for feedback vertex set and loop cutset. Theory of Computing Systems, 46, 566-597.
Bodlaender, H. L., Kozawa, K., Matsushima, T., & Otachi, Y. (2010). Spanning tree congestion of k-outerplanar graphs. Department of Information and Computing Sciences, Utrecht University.
van Rooij, J. M. M., van Kooten Niekerk, M. E., & Bodlaender, H. L. (2010). Partitioning Sparse Graphs Into Triangles: Relations to exact satisfiability and very fast exponential time algorithms. Department of Information and Computing Sciences, Utrecht University.
Kwisthout, J. H. P., Bodlaender, H. L., & van der Gaag, L. C. (2010). The necessity of bounded treewidth for efficient inference in Bayesian networks. In H. Coelho, R. Studer, & M. Wooldridge (Eds.), Proceedings of the 23rd European Conference on Artificial Intelligence, ECAI 2010 (pp. 237-242). IOS Press.
Bodlaender, H. L., Fellows, M. R., Heggernes, P., Mancini, F., Papadopoulos, C., & Rosamond, F. A. (2010). Clustering with partial information. Theoretical Computer Science, 411, 1202-1211.
Comas, M., & Bodlaender, H. L. (2010). A kernel for convex recoloring of weighted forests. In J. van Leeuwen, A. Muscholl, D. Peleg, J. Pokorny, & B. Rumke (Eds.), Proceedings of the 36th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2010 (pp. 212-223). Springer.
Otachi, Y., Bodlaender, H. L., & van Leeuwen, E. J. (2010). Complexity results for the Spanning Tree Congestion Problem. In D. M. Thilikos (Ed.), Graph-theoretic concepts in computer science: 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 : revised papers (pp. 3-14). (Lecture notes in computer science; Vol. 6410). Springer. https://doi.org/10.1007/978-3-642-16926-7_3
Bodlaender, H. L., & Koster, A. M. C. A. (2010). Treewidth computations I. Upper bounds. Information and Computation, 208, 259-275.
Dorn, F., Penninkx, E., Bodlaender, H. L., & Fomin, F. V. (2010). Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions. Algorithmica, 58, 790-810.
Bodlaender, H. L., & Koster, A. M. C. A. (2010). Treewidth Computations II. Lower Bounds. Department of Information and Computing Sciences, Utrecht University.
2009
Scholarly publications
Bodlaender, H. L., Fomin, F. V., Lokshtanov, D., Penninkx, E., Saurabh, S., & Thilikos, D. M. (2009). (Meta) kernelization. In Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009 (pp. 629-638). [5438590] (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS). https://doi.org/10.1109/FOCS.2009.46
Bodlaender, H. L., Fomin, F. V., Lokshtanov, D., Penninkx, E., Saurabh, S., & Thilikos, D. M. (2009). (Meta) Kernelization. CoRR, abs/0904.0727. http://arxiv.org/abs/0904.0727
Alt, H., Bodlaender, H. L., van Kreveld, M. J., Rote, G., & Tel, G. (2009). Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst., 44(2), 160-174.
Bodlaender, H. L., Thomassé, S., & Yeo, A. (2009). Kernel bounds for Disjoint Cycles and Disjoint Paths. In A. Fiat, & P. Sanders (Eds.), Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009 (pp. 635-646). Springer.
Kwisthout, J. H. P., & Bodlaender, H. L. (2009). Conditional Lower Bounds on the Complexity of Probabilistic Inference. UU BETA ICS Departement Informatica.
Bodlaender, H. L., Fomin, F. V., Lokshtanov, D., Penninkx, E., Saurabh, S., & Thilikos, D. M. (2009). (Meta) kernelization. In Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS 2009 (pp. 629-638). IEEE Press.
Bodlaender, H. L., Downey, R. G., Fellows, M. R., & Hermelin, D. (2009). On problems without polynomial kernels. Journal of Computer and System Sciences, 75(8), 423-434.
Bodlaender, H. L., Fellows, M. R., & Thilikos, D. (2009). Derivation of algorithms for cutwidth and related graph layout parameters. Journal of Computer and System Sciences, 75(4), 231-244.
Bodlaender, H. L., Grigoriev, A., Grigorieva, N. V., & Hendriks, A. (2009). The Valve Location Problem in Simple Network Topologies. In H. Broersma, T. Erlebach, T. Friedetzky, & D. Paulusma (Eds.), Proceedings 34th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2008 (pp. 55-65). Springer.
van Rooij, J. M. M., & Bodlaender, H. L. (2009). Dynamic programming on tree decompositions using generalised fast subset convolution. In A. Fiat, & P. Sanders (Eds.), Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009 (pp. 566-577). Springer.
Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D., & Thilikos, D. M. (2009). A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. UU BETA ICS Departement Informatica.
Bodlaender, H. L., Grigoriev, A., Grigorieva, N. V., & Hendriks, A. (2009). The valve location problem. In J. Hurink, W. Kern, G. F. Post, & G. Still (Eds.), Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization (pp. 13-16). University of Twente.
van Rooij, J. M. M., & Bodlaender, H. L. (2009). Design by Measure and Conquer: A faster exact algorithm for dominating set. UU BETA ICS Departement Informatica.
Bodlaender, H. L., Fomin, F. V., Lokshtanov, D., Penninkx, E., Saurabh, S., & Thilikos, D. M. (2009). (Meta) Kernelization. UU BETA ICS Departement Informatica.
Bodlaender, H. L., Lokshtanov, D., & Penninkx, E. (2009). Planar capacitated dominating set is W[1]-hard. In J. Chen, & F. Fomin (Eds.), Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009 (pp. 50-60). Springer.
Bodlaender, H. L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R., & Wolle, T. (2009). On the minimum corridor connection problem and other generalized geometric problems. Computational geometry, 42(9), 939-951.
Professional publications
Bodlaender, H. L. (2009). Kernelization: New upper and lower bound techniques. In J. Chen, & F. Fomin (Eds.), Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009 (pp. 17-37). Springer.
2008
Scholarly publications
Bodlaender, H. L., Grigoriev, A., Grigorieva, N. V., & Hendriks, A. (2008). The valve location problem in simple network topologies. In Graph-Theoretic Concepts in Computer Science - 34th International Workshop, WG 2008, Revised Papers (pp. 55-65). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5344 LNCS). https://doi.org/10.1007/978-3-540-92248-3_6
van Rooij, J., & Bodlaender, H. L. (2008). Design by Measure and Conquer: A Faster Exact Algorithm for Dominating Set. CoRR, abs/0802.2827. http://arxiv.org/abs/0802.2827
Bodlaender, H. L. (2008). Treewidth of Graphs. In M-Y. Kao (Ed.), Encyclopedia of Algorithms (pp. 968-970). Springer US. https://doi.org/10.1007/978-0-387-30162-4_431
Bodlaender, H. L., Thomassé, S., & Yeo, A. (2008). Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-030.html
Bodlaender, H. L., Downey, R. G., Fellows, M. R., & Hermelin, D. (2008). On Problems Without Polynomial Kernels (Extended Abstract). In L. Aceto, I. Damgaard, L. A. Goldberg, M. M. Halldorsson, A. Ingolfsdottir, & I. Walukuewics (Eds.), Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2008 (pp. 563-574). Springer.
van Rooij, J. M. M., & Bodlaender, H. L. (2008). Exact Algorithms for Edge Domination. In M. Grohe, & R. Niedermeier (Eds.), Proceedings Third International Workshop on Parameterized and Exact Computation, IWPEC 2008 (pp. 214-255). Springer.
Bodlaender, H. L., Fellows, M. R., Heggernes, P., Mancini, F., Papadopoulos, C., & Rosamond, F. A. (2008). Clustering with partial information. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-033.html
van Rooij, J. M. M., & Bodlaender, H. L. (2008). Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. In S. Albers, & P. Weil (Eds.), Proceedings STACS 2008, 25th Annual Symposium on Theoretical Aspects of Computer Science (pp. 657-668). Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI).
Bodlaender, H. L., Tan, R. B., van Dijk, T. C., & van Leeuwen, J. (2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. In J. Gudmundsson (Ed.), Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory (pp. 102-113). Springer.
Bodlaender, H. L., Heggernes, P., & Villanger, Y. (2008). Faster parameterized algorithms for Minimum Fill-In. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-042.html
Bodlaender, H. L., Fellows, M. R., Heggernes, P., Mancini, F., Papadopoulos, C., & Rosamond, F. A. (2008). Clustering with Partial Information. In E. Ochmanski, & J. Tyszkiewicz (Eds.), Proceedings 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008 (pp. 144-155). Springer.
Bodlaender, H. L., Tan, R. B., van Dijk, T. C., & van Leeuwen, J. (2008). Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-005.html
Bodlaender, H. L., Grigoriev, A., & Koster, A. M. C. A. (2008). Treewidth lower bounds with brambles. Algorithmica, 51, 81-98.
Bodlaender, H. L., & Penninkx, E. (2008). A Linear Kernel for Planar Feedback Vertex Set. In M. Grohe, & R. Niedermeier (Eds.), Proceedings Third International Workshop on Parameterized and Exact Computation, IWPEC 2008 (pp. 160-171). Springer.
Bodlaender, H. L., Penninkx, E., & Tan, R. B. (2008). A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. In S-H. Hong, H. Nagamochi, & T. Fukunaga (Eds.), Proceedings 19th International Symposium on Algorithms and Computation, ISAAC 2008 (pp. 306-317). Springer.
Bodlaender, H. L., & Koster, A. M. C. A. (2008). Treewidth Computations I. Upper Bounds. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-032.html
Kwisthout, J., Bodlaender, H. L., & Tel, G. (2008). Complexity results for local monotonicity in probabilistic networks. In M. M. Dastani, & E. de Jong (Eds.), Proceedings of the 19th Belgisch-Nederlandse conferentie class = Wet, Artificiële Intelligentie BNAIC'07
Bodlaender, H. L., Brandstädt, A., Kratsch, D., Rao, M., & Spinrad, J. (2008). On algorithms for (P_5,gem)-free graphs. Theoretical Computer Science, 349, 2-21.
Bodlaender, H. L., Heggernes, P., & Villanger, Y. (2008). Faster Parameterized Algorithms for Minimum Fill-In. In S-H. Hong, H. Nagamochi, & T. Fukunaga (Eds.), Proceedings 19th International Symposium on Algorithms and Computation, ISAAC 2008 (pp. 282-293). Springer.
Bodlaender, H. L., & Fomin, F. V. (2008). Equitable colorings of bounded treewidth graphs. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004 (pp. 204-214). Springer.
Bodlaender, H. L., Demaine, E. D., Fellows, M. R., Guo, J., Hermelin, D., Lokshtanov, D., Müller, M., Raman, V., van Rooij, J. ., & Rosamond, F. A. (2008). Open Problems in Parameterized and Exact Computation - IWPEC 2008. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2008-017.html
Bodlaender, H. L., Fellows, M. R., Heggernes, P., Mancini, F., Papadopoulos, C., & Rosamond, F. A. (2008). Clustering with partial information. (Reports in Informatics ed.) Department of Informatics, University of Bergen. http://www.cs.uu.nl/research/techreps/UU-CS-2008-033.html
Bodlaender, H. L., & Koster, A. M. C. A. (2008). Combinatorial Optimization on Graphs of Bounded Treewidth. The Computer Journal, 51(3), 255-269. https://doi.org/10.1093/comjnl/bxm037
2007
Scholarly publications
Bodlaender, H. L., Grigoriev, A., Grigorieva, N. V., & Hendriks, A. (2007). The valve location problem. In J. Hurink, W. Kern, G. F. Post, & G. Still (Eds.), Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007 (pp. 13-16). University of Twente.
Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., & Weyer, M. (2007). Quadratic kernelization for convex recoloring of trees. In G. Lin (Ed.), Proceedings 13th Annual International Computing and Combinatorics Conference, COCOON 2007 (pp. 86-96). Springer, Lecture Notes in Computer Science, volume 4598.
Kwisthout, J. H. P., Bodlaender, H. L., & Tel, G. (2007). Local Monotonicity in Probabilistic Networks. In K. Mellouli (Ed.), Procedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQUARU 2007 (pp. 548-559). Springer. http://www.springerlink.com/content/q128221130127116/
Alt, H., Bodlaender, H. L., van Kreveld, M. J., Rote, G., & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. (CS-UU ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-009.html
Grigoriev, A., & Bodlaender, H. L. (2007). Algorithms for graphs embeddable with few crossings per edge. Algorithmica, 49, 1-11.
Van den Eijkhof, F., Bodlaender, H. L., & Koster, A. M. C. A. (2007). Safe reduction rules for weighted treewidth. Algorithmica, 47, 139-158.
Bodlaender, H. L., Grigoriev, A., Grigorieva, N. V., & Hendriks, A. (2007). The Valve Location Problem in Simple Network Topologies. (CS-UU ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-019.html
Bodlaender, H. L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R., & Wolle, T. (2007). On the minimum corridor connection problem and other generalized geometric problems. (CS-UU ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-031.html
Bodlaender, H. L., & Koster, A. M. C. A. (2007). On the maximum cardinality search lower bound for treewidth. Discrete Applied Mathematics, 155, 1348-1372.
Kwisthout, J. H. P., Bodlaender, H. L., & Tel, G. (2007). Complexity Results for Local Monotonicity in Probabilistic Networks. (CS-UU ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-050.html
Bodlaender, H. L. (2007). A cubic kernel for feedback vertex set. In W. Thomas, & P. Well (Eds.), Proceedings 24th International Symposium on Theoretical Aspects of Computer Science, STACS 2007 (pp. 320-331). Springer, Lecture Notes in Computer Science.
Alt, H., Bodlaender, H. L., van Kreveld, M. J., Rote, G., & Tel, G. (2007). Wooden Geometric Puzzles: Design and Hardness Proofs. In P. Crescenzi, G. Prencipe, & G. Pucci (Eds.), Proceedings 4th International Conference on Fun with Algorithms, FUN 2007 (pp. 16-29). Springer, Lecture Notes in Computer Science, volume 4475.
van Rooij, J. M. M., & Bodlaender, H. L. (2007). Exact algorithms for Edge Domination. (CS-UU ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-051.html
Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., & Weyer, M. (2007). Quadratic kernelization for convex recoloring of trees. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-035.html
Bachoore, E. H., & Bodlaender, H. L. (2007). Weighted Treewidth: Algorithmic Techniques and Results. In T. Tokuyama (Ed.), Proceedings 18th International Symposium on Algorithms and Computation, ISAAC 2007 (pp. 893-903). Springer Lecture Notes in Computer Science, volume 4835.
Bodlaender, H. L., Downey, R. G., Fellows, M. R., & Hermelin, D. (2007). On Problems Without Polynomial Kernels. (UU-CS ed.) UU WINFI Informatica en Informatiekunde. http://www.cs.uu.nl/research/techreps/UU-CS-2007-046.html
Professional publications
Bodlaender, H. L. (2007). Treewidth: Structure and Algorithms. In G. Prencipe, & S. Zaks (Eds.), Proceedings 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007 (pp. 11-25). Springer, Lecture Notes in Computer Science, volume 4474.
Other output
Kwisthout, J. H. P., Bodlaender, H. L., & Tel, G. (2007). Complexity Results for Local Monotonicity in Probabilistic Networks (extended abstract). 369-370. Abstract from Unknown event, Asilomar, USA.
2006
Scholarly publications
Bodlaender, H. L., Fellows, M. R., Langston, M. A., Ragan, M. A., Rosamond, F. A., & Weyer, M. (2006). Kernelization for Convex Recoloring. In B. H., S. S. Dantchev, M. Johnson, & S. Szeider (Eds.), Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK (pp. 23-35). King's College, London.
Bodlaender, H. L., & Langston, M. A. (2006). Parameterized and Exact Computation, Second International Workshop, IWPEC 2006. (Lecture Notes in Computer Science ed.) Springer.
Bachoore, E. H., & Bodlaender, H. L. (2006). A branch and bound algorithm for exact, upper, and lower bounds on treewidth. UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L., Cai, L., Chen, J., Fellows, M. R., Telle, J. A., & Marx, D. (2006). Open Problems in Parameterized and Exact Computation --- IWPEC 2006. UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L. (2006). Treewidth: Characterizations, Applications, and Computations. In F. V. Fomin (Ed.), Proceedings 32nd International Workshop on class = Wet, Graph-Theoretic Concepts in Computer Science WG 2006 (pp. 1-14). Springer, Lecture Notes in Computer Science, volume 4271.
Bachoore, E., & Bodlaender, H. L. (2006). Weighted treewidth: Algorithmic techniques and results. UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L. (2006). Treewidth: Characterizations, Applications, and Computations. UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L., & Koster, A. M. C. A. (2006). Safe separators for treewidth. Discrete Mathematics, 306, 337-350.
Bodlaender, H. L., & Kratsch, D. (2006). An exact algorithm for graph coloring with polynomial memory. UU WINFI Informatica en Informatiekunde.
Bakker, E. M., Bodlaender, H. L., Tan, R. B., & van Leeuwen, J. (2006). Interval Routing and Minor-Monotone Graph Parameters. (UU-CS ed.) UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D., & Thilikos, D. M. (2006). On exact algorithms for treewidth. UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L., Feremans, C., Grigoriev, A., Penninkx, E., Sitters, R., & Wolle, T. (2006). On the minimum corridor connection problem and other generalized geometric problems. In T. Erleback, & C. Kaklamanis (Eds.), Proceedings 4th International Workshop on Approximation and Online Algorithms (pp. 69-82). Springer.
Bodlaender, H. L., Fomin, F. V., Koster, A. M. C. A., Kratsch, D., & Thilikos, D. M. (2006). On exact algorithms for treewidth. In Y. Azar, & T. Erlebach (Eds.), Proceedings 14th Annual European Symposium on Algorithms ESA 2006 (pp. 672-683). Springer, Lecture Notes in Computer Science, volume 4168.
Dorn, F., Penninkx, E., Bodlaender, H. L., & Fomin, F. V. (2006). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L., Koster, A. M. C. A., & Wolle, T. (2006). Contraction and treewidth lower bounds. Journal of Graph Algorithms and Applications, 10, 5-49.
Bachoore, E., & Bodlaender, H. L. (2006). A branch and bound algorithm for exact, upper, and lower bounds on treewidth. In S-W. Cheng, & C. K. Poon (Eds.), Proceedings 2nd International Conference on Algorithmic Aspects in Information and Management, AAIM 2006 (pp. 255-266). Springer, Lecture Notes in Computer Science, volume 4041.
Bodlaender, H. L. (2006). A cubic kernel for feedback vertex set. UU WINFI Informatica en Informatiekunde.
Bachoore, E. H., & Bodlaender, H. L. (2006). Convex recolorings of leaf-colored trees. UU WINFI Informatica en Informatiekunde.
Katriel, I., & Bodlaender, H. L. (2006). Online topological ordering. ACM Transactions on Algorithms, 2, 364-379.
2005
Scholarly publications
Bodlaender, H. L., Brandstädt, A., Kratsch, D., Rao, M., & Spinrad, J. (2005). On algorithms for (P_5,gem)-free graphs: Graph Colorings. Workshop on Graph Colorings 2003. Theoretical Computer Science, 349(1), 2-21. https://doi.org/10.1016/j.tcs.2005.09.026
Bodlaender, H. L., Grigoriev, A., & Koster, A. M. C. A. (2005). Treewidth lower bounds with brambles. In G. Stølting Brodal, & S. Leonardi (Eds.), Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings (pp. 391-402). (Lecture Notes in Computer Science; Vol. 3669). Springer. https://doi.org/10.1007/11561071_36
Thilikos, D., Serna, M. J., & Bodlaender, H. L. (2005). Cutwidth I: A linear time fixed parameter algorithm. Journal of Algorithms, 56, 1-24.
Katriel, I., & Bodlaender, H. L. (2005). Online topological ordering. In Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005 (pp. 443-450)
Thilikos, D., Serna, M. J., & Bodlaender, H. L. (2005). Cutwidth II: Algorithms for partial $w$-trees of bounded degree. Journal of Algorithms, 56, 25-49.
Bachoore, E., & Bodlaender, H. L. (2005). New upper bound heuristics for treewidth. In S. E. Nikoletseas (Ed.), Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings (pp. 216-227). (Lecture Notes in Computer Science; Vol. 3503). Springer. https://doi.org/10.1007/11427186_20
Katriel, I., & Bodlaender, H. L. (2005). Online Topological Ordering. (UU-CS ed.) UU WINFI Informatica en Informatiekunde.
Bodlaender, H. L., & Fomin, F. V. (2005). Tree decompositions with small cost. Discrete Applied Mathematics, 145, 143-154.
Bodlaender, H. L. (2005). Discovering treewidth. In P. Vojtáš, M. Bieliková, B. Charron-Bost, & O. Sýkora (Eds.), SOFSEM 2005: Theory and Practive of Computer Science: 31st Conference on Current Trends in Theory and Practive of Computer Science Liptovský Ján, Slovakia, January 22-28, 2005. Proceedings (pp. 1-16). (Lecture Notes in Computer Science; Vol. 3381). Springer. https://doi.org/10.1007/978-3-540-30577-4_1
Koster, A. M. C. A., Wolle, T., & Bodlaender, H. L. (2005). Degree-based treewidth lower bounds. In S. E. Nikoletseas (Ed.), Experimental and Efficient Algorithms: 4th International Workshop, WEA 2005, Santorini Island, Greece, May 10-13, 2005. Proceedings (pp. 101-112). (Lecture Notes in Computer Science; Vol. 3503). Springer. https://doi.org/10.1007/11427186_11
Dorn, F., Penninkx, E., Bodlaender, H. L., & Fomin, F. V. (2005). Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. In G. Stølting Brodal, & S. Leonardi (Eds.), Algorithms – ESA 2005: 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005. Proceedings (pp. 95-106). (Lecture Notes in Computer Science; Vol. 3669). Springer. https://doi.org/10.1007/11561071_11
Bodlaender, H. L., Grigoriev, A., & Koster, A. M. C. A. (2005). Treewidth Lower Bounds with Brambles. (UU-CS ed.) UU WINFI Informatica en Informatiekunde.
Grigoriev, A., & Bodlaender, H. L. (2005). Algorithms for graphs embeddable with few crossings per edge. In M. Liskiewicz, & R. Reischuk (Eds.), Fundamentals of Computation Theory: Proceedings 15th International Symposium, FCT 2005, Lübeck, Germany, August 17-20, 2005. (pp. 378-387). (Lecture Notes in Computer Science; Vol. 3623). Springer. https://doi.org/10.1007/11537311_33
Bodlaender, H. L., & Fomin, F. V. (2005). Equitable colorings of bounded treewidth graphs. Theoretical Computer Science, 349, 22-30.
Bodlaender, H. L., Koster, A. M. C. A., & Van den Eijkhof, F. (2005). Preprocessing rules for triangulation of probabilistic networks. Computational Intelligence, 21(3), 286-305.
Bodlaender, H. L. (2005). Discovering Treewidth. (UU-CS ed.) UU WINFI Informatica en Informatiekunde.
2004
Scholarly publications
Bodlaender, H., & Fomin, F. V. (2004). Equitable Colorings of Bounded Treewidth Graphs. In J. Fiala, V. Koubek, & J. Kratochvíl (Eds.), Mathematical Foundations of Computer Science 2004 (Vol. 3153, pp. 180-190). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_11
Bodlaender, H. L., Kloks, T., Tan, R. B., & van Leeuwen, J. (2004). Approximations for Lambda-Colorings of Graphs. The Computer Journal, 47, 193-204.
Bodlaender, H. L., & Telle, J. A. (2004). Space-efficient construction variants of dynamic programming. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/17990/bodlaender_04_space_efficient.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/17990/bodlaender_04_space_efficient.pdf?sequence=1
Bodlaender, H. L., & Koster, A. M. C. A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. Konrad-Zuse-Zentrum für Informationstechnik Berlin.
Bodlaender, H. L., & Koster, A. M. C. A. (2004). Safe separators for treewidth. In Proceedings 6th Workshop on Algorithm Engineering & Experiments ALENEX04 (pp. 70-78)
Bodlaender, H. L., & Koster, A. M. C. A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/17997/bodlaender_04_on_the_maximum.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/17997/bodlaender_04_on_the_maximum.pdf?sequence=1
Bodlaender, H. L., & Fomin, F. V. (2004). Equitable colorings of bounded treewidth graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/18037/bodlaender_04_equitable_colorings.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18037/bodlaender_04_equitable_colorings.pdf?sequence=1
Bodlaender, H. L., & Thilikos, D. M. (2004). Computing small search numbers in linear time. In R. Downey, M. Fellows, & F. Dehne (Eds.), Proceedings First International Workshop on Parameterized and Exact Computation (pp. 37-48). Springer.
Koster, A. M. C. A., Wolle, T., & Bodlaender, H. L. (2004). Degree-Based Treewidth Lower Bounds. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/18001/koster_04_degree_based.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18001/koster_04_degree_based.pdf?sequence=1
Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. V., & Woeginger, G. J. (2004). Radio labeling with preassigned frequencies. SIAM Journal on Optimization, 15, 1-16.
Wolle, T., Koster, A. M. C. A., & Bodlaender, H. L. (2004). A Note on Contraction Degeneracy. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/18009/wolle_04_a_note_on.pdf?sequence=2
https://dspace.library.uu.nl/bitstream/handle/1874/18009/wolle_04_a_note_on.pdf?sequence=2
Wolle, T., & Bodlaender, H. L. (2004). A Note on Edge Contraction. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/18000/wolle_04_a_note_on_edge.pdf?sequence=2
https://dspace.library.uu.nl/bitstream/handle/1874/18000/wolle_04_a_note_on_edge.pdf?sequence=2
Bodlaender, H. L., Koster, A. M. C. A., & Wolle, T. (2004). Contraction and treewidth lower bounds. In S. Albers, & T. Radzik (Eds.), Proceedings 12th Annual European Symposium on Algorithms, ESA2004 (pp. 628-639). Springer.
Bodlaender, H. L., & Wolle, T. (2004). Contraction Degeneracy on Cographs. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/17986/bodlaender_04_contraction_degeneracy.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/17986/bodlaender_04_contraction_degeneracy.pdf?sequence=1
Bachoore, E., & Bodlaender, H. L. (2004). New Upper Bound Heuristics for Treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/18014/bachoore_04_new_upper_bound.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18014/bachoore_04_new_upper_bound.pdf?sequence=1
Bodlaender, H. L., Koster, A. M. C. A., & Wolle, T. (2004). Contraction and Treewidth Lower Bounds. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/18015/bodlaender_04_contraction_and.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18015/bodlaender_04_contraction_and.pdf?sequence=1
Koster, A. M. C. A., Wolle, T., & Bodlaender, H. L. (2004). Degree-based treewidth lower bounds. Konrad-Zuse-Zentrum für Informationstechnik Berlin.
Bodlaender, H. L., & Wolle, T. (2004). A Note on the Complexity of Network Reliability Problems. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/315452/bodlaender_04_a_note_on_the.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/315452/bodlaender_04_a_note_on_the.pdf?sequence=1
Bodlaender, H. L., & Koster, A. M. C. A. (2004). On the Maximum Cardinality Search Lower Bound for Treewidth. In Proceedings 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG 2004 (pp. 81-92). Springer.
Grigoriev, A., & Bodlaender, H. L. (2004). Algorithms for graphs embeddable with few crossings per edge. (UU-CS ed.) Institute of Information and Computing Sciences.
https://dspace.library.uu.nl/bitstream/handle/1874/17980/grigoriev_04_algorithms_for_graphs.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/17980/grigoriev_04_algorithms_for_graphs.pdf?sequence=1
Bodlaender, H. L., & Telle, J. A. (2004). Space-efficient construction variants of dynamic programming. Nordic journal of computing, 11(4), 374-385.
van der Gaag, L. C., Bodlaender, H. L., & Feelders, A. J. (2004). Monotonicity in Bayesian Networks. In M. Chickering, & J. Halpern (Eds.), Proceedings of the Twentieth Conference on Uncertainty in Artificial Intelligence (pp. 569-576). AUAI Press.
Bodlaender, H. L., de Figueiredo, C. M. H., Gutierrez, M., Kloks, T., & Niedermeier, R. (2004). Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4's. In WEA 2004, Proceedings 3rd International Workshop on Experimental and Efficient Algorithms (pp. 87-99). Springer.
Bodlaender, H. L., & Tel, G. (2004). A note on rectilinearity and angular resolution. Journal of Graph Algorithms and Applications, 8(1), 89-94. https://doi.org/10.7155/jgaa.00083
2003
Scholarly publications
Bodlaender, H. L., & Koster, A. M. C. A. (2003). Safe Separators for Treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
Bodlaender, H. L., & Rotics, U. (2003). Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica, 36, 375-408.
Bodlaender, H. L. (2003). Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003. Springer.
Bodlaender, H. L., Koster, A. M. C. A., & Van den Eijkhof, F. (2003). Pre-processing rules for triangulation of probabilistic networks. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
Bodlaender, H. L., Tan, R. B., & van Leeuwen, J. (2003). Finding a Delta-regular supergraph of minimum order. Discrete Applied Mathematics, 131, 3-9.
Bodlaender, H. L., Brandstädt, A., Kratsch, D., Rao, M., & Spinrad, J. (2003). Linear time algorithms for some NP-complete problems on (P_5,gem)-free graphs. (Extended abstract). In FCT'03, Proceedings 14th International Symposium on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 2751 (pp. 61-72). Springer.
Bodlaender, H. L., & Tel, G. (2003). Rectilinear Graphs and Angular Resolution. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
Bodlaender, H. L., Brandstadt, A., Kratsch, D., Rao, M., & Spinrad, J. (2003). On Algorithms for (P5,Gem)-Free Graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences.
Bodlaender, H. L., Fellows, M. R., & Thilikos, D. M. (2003). Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. In Proceedings 28nd International Symposium on Mathematical Foundations of Computer Science, MFCS'03, Lecture Notes in Computer Science, volume 2747 (pp. 239-248). Springer.
Bodlaender, H. L. (2003). Necessary edges in k-chordalizations of graphs. Journal of Combinatorial Optimization, 7, 283-290.
2002
Scholarly publications
Zantema, H., & Bodlaender, H. L. (2002). Sizes of ordered decision trees. International Journal of Foundations of Computer Science, 13, 445-458.
Bodlaender, H. L., Dinneen, M. J., & Khoussainov, B. (2002). Relaxed update and partition network games. Fundamenta Informaticae, 49, 301-312.
Bodlaender, H. L., & Fomin, F. V. (2002). Approximation of pathwidth of outerplanar graphs. Journal of Algorithms, 43, 190-200.
Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. V., & Woeginger, G. J. (2002). Radio labelling with pre-assigned frequencies. In R. Moehring, & R. Raman (Eds.), 10th Annual European Symposium on Algorithms (ESA 2002) (pp. 211-222). Springer.
Bodlaender, H. L., & Kratsch, D. (2002). Kayles and nimbers. Journal of Algorithms, 43, 106-119.
Bodlaender, H. L., & Rotics, U. (2002). Computing the treewidth and the minimum fill-in with the modular decomposition. In M. Penttonen, & E. M. Schmidt (Eds.), 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002) (pp. 388-397). Springer.
Van den Eijkhof, F., & Bodlaender, H. L. (2002). Safe reduction rules for weighted treewidth. In L. Kucera (Ed.), Graph-Theoretic Concepts in Computer Science (WG 2002) (pp. 176-185). Springer.
Bodlaender, H. L., Broersma, H. J., Fomin, F. V., Pyatkin, A. V., & Woeginer, G. J. (2002). Radio labeling with pre-assigned frequencies. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2002-026.html
Alber, J., Bodlaender, H. L., Fernau, H., Kloks, T., & Niedermeier, R. (2002). Fixed parameters algorithms for dominating set and related problems on planar graphs. Algorithmica, 33, 461-493.
Thilikos, D. M., Fellows, M. R., & Bodlaender, H. L. (2002). Derivation of algorithms for cutwidth and related graph layout problems. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2002-032.html
Bodlaender, H. L., & Fomin, F. V. (2002). Tree decompositions with small cost. In M. Penttonen, & E. M. Schmidt (Eds.), 8th Scandinavian Workshop on Algorithm Theory (SWAT 2002) (pp. 378-387). Springer.
Bodlaender, H. L., & Fomin, F. V. (2002). Tree decompositions with small cost. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2002-001.html
Bodlaender, H. L., Van den Eijkhof, F., & van der Gaag, L. C. (2002). On the complexity of the MPA problem in probabilistic networks. In F. van Harmelen (Ed.), Proceedings 15th European Conference on Artificial Intelligence (pp. 675-679). IOS Press.
Van den Eijkhof, F., Bodlaender, H. L., & Koster, A. M. C. A. (2002). Safe reduction rules for weighted treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2002-051.html
2001
Scholarly publications
Koster, A. M. C. A., Bodlaender, H. L., & Van Hoesel, S. P. M. (2001). Treewidth: Computational experiments. Electronic Notes in Discrete Mathematics, 8, 1-4.
Koster, A. M. C. A., Bodlaender, H. L., & van Hoesel, S. P. M. (2001). Treewidth: Computational Experiments. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2001-49.html
Bodlaender, H. L., Dinneen, M. J., & Khoussainov, B. (2001). On game theoretic models of networks. In P. Eades, & T. Takaoka (Eds.), Proceedings 12th International Symposium on Algorithms and Computation (pp. 550-561). Springer.
Koster, A. M. C. A., Bodlaender, H. L., & van Hoesel, S. P. M. (2001). Treewidth: Computational experiments. In H. Broersmna, U. Faigle, J. Hurink, & S. Pickl (Eds.), Electronic Notes in Discrete Mathematics Elsevier Science.
Bodlaender, H. L., Koster, A. M. C., Van den Eijkhof, F., & van der Gaag, L. C. (2001). Pre-processing for triangulation of probabilistic networks. In J. Breese, & D. Koller (Eds.), Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence (pp. 32-39). Morgan Kaufmann.
Bodlaender, H. L., & van Antwerpen-de Fluiter, B. L. E. (2001). Reduction algorithms for graphs of small treewidth. Information and Computation, 167, 86-119.
Bodlaender, H. L., & Rotics, U. (2001). Computing the treewidth and the minimum fill-in with the modular decomposition. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2001-22.html
Bodlaender, H. L., Van den Eijkhof, F., & van der Gaag, L. C. (2001). On the MPA problem in probabilistic networks. In B. Kröse, M. de Rijke, G. Schreiber, & M. van Someren (Eds.), Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence (pp. 59-66). Universiteit van Amsterdam.
Fomin, F. V., & Bodlaender, H. L. (2001). Approximation of pathwidth of outerplanar graphs. In A. Brandstaedt, & L. van Bang (Eds.), Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001 (pp. 166-176). Springer.
Bodlaender, H. L., Serna, M. J., & Thilikos, D. M. (2001). A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2001-04.html
Bodlaender, H. L., Dinneen, M. J., & Khoussainov, B. (2001). Relaxed Update and Partition Network Games. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2001-15.html
Bodlaender, H. L., & van Antwerpen-de Fluiter, B. L. E. (2001). Parallel algorithms for series parallel graphs and graphs with treewidth two. Algorithmica, 29, 543-559.
Bodlaender, H. L., Koster, A. M. C., Van den Eijkhof, F., & van der Gaag, L. C. (2001). Pre-processing for triangulation of probabilistic networks. In B. Kröse, M. de Rijke, G. Schreiber, & M. van Someren (Eds.), Proceedings of the 13th Belgium-Netherlands Conference on Artificial Intelligence (pp. 67-68).
Bodlaender, H. L. (2001). A generic NP-hardness proof for a variant of graph coloring. Journal of Universal Computer Science, 7(12), 1114-1124.
Thilikos, D. M., Serna, M. J., & Bodlaender, H. L. (2001). A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. In F. Meyer auf der Heide (Ed.), Proceedings 9th Annual European Symposium on Algorithms ESA 2001 (pp. 380-390). Springer.
Bodlaender, H. L. (2001). A generic NP-hardness proof for a variant of Graph Coloring. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2001-08.html
2000
Scholarly publications
Bodlaender, H. L. (2000). The algorithmic theory of treewidth. Electronic Notes in Discrete Mathematics, 5, 27-30. https://doi.org/10.1016/S1571-0653(05)80116-7
Bodlaender, H. L., & Kratsch, D. (2000). Kayles and nimbers. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-42.html
Bodlaender, H. L., Fellows, M. R., Hallett, M. T., Wareham, H. T., & Warnow, T. J. (2000). The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. Theoretical Computer Science, 244, 167-188.
Alber, J., Bodlaender, H. L., Fernau, H., & Niedermeier, R. (2000). Fixed parameter algorithms for planar dominating set and related problems. In M. Halldorsson (Ed.), Proceedings 7th Scandinavian Workshop on Algorithm Theory (pp. 97-110). Springer.
Bodlaender, H. L., Tan, R. B., & van Leeuwen, J. (2000). Finding a Delta-regular supergraph of minimum order. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-29.html
Bodlaender, H. L., & Jansen, K. (2000). On the complexity of the maximum cut problem. Nordic journal of computing, 7, 14-31.
Bodlaender, H. L., Kloks, A. J. J., Tan, R. B., & van Leeuwen, J. (2000). Approximations for Lambda-coloring of graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-25.html
Alber, J., Bodlaender, H. L., Fernau, H., & Niedermeier, R. (2000). Fixed parameter algorithms for planar dominating set. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-28.html
Thilikos, D. M., Serna, M. J., & Bodlaender, H. L. (2000). A constructive linear time algorithm for small cutwidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-24.html
Bodlaender, H. L., Kloks, T., Tan, R. B., & van Leeuwen, J. (2000). Lambda-coloring of graphs. In H. Reichel, & S. Tison (Eds.), 17th Annual Symposium on Theoretical Aspects of Computer Science (pp. 395-406). Springer.
Bodlaender, H. L. (2000). Necessary edges in k-chordalizations of graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-27.html
Zantema, H., & Bodlaender, H. L. (2000). Finding small equivalent decision trees is hard. International Journal of Foundations of Computer Science, 11(2), 343-354.
Bodlaender, H. L., & Thilikos, D. M. (2000). Constructive linear time algorithms for branchwidth. Departament de Llenguatges Sistemes Informatics.
https://dspace.library.uu.nl/bitstream/handle/1874/18903/bodlaender_00_constructive.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18903/bodlaender_00_constructive.pdf?sequence=1
Bodlaender, H. L., Thilikos, D. M., & Serna, M. J. (2000). Constructive linear time algorithms for small cutwidth and carving-width. In L. Teng, & S. H. Teng (Eds.), Proc. 11th International Symposium on Algorithms And Computation ISAAC '00 (pp. 192-203). Springer.
Thilikos, D. M., & Bodlaender, H. L. (2000). Constructive linear time algorithms for branchwidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-38.html
Bodlaender, H. L., & Fomin, F. V. (2000). Approximation of pathwidth of outerplanar graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-2000-23.html
Professional publications
Bodlaender, H. L. (2000). Introduction to special issue on treewidth. Algorithmica, 27(3-4), 209-211.
1999
Scholarly publications
Bodlaender, H. L., Kloks, T., & Niedermeier, R. (1999). SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s. Electronic Notes in Discrete Mathematics, 3, 1-8.
Haverkort, H. J., & Bodlaender, H. L. (1999). Finding a minimal tree in a polygon with its medial axis. In 11th Canadian Conference on Computational Geometry, Vancouver
de Ridder, H. N., & Bodlaender, H. L. (1999). Graph automorphisms with maximal projection distances. In G. Ciobanu, & G. Paun (Eds.), Proceedings 12th International Symposium on Fundamentals of Computation Theory, FCT'99 (pp. 204-214). Springer.
Zantema, H., & Bodlaender, H. L. (1999). Sizes of decision tables and decision trees. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1999-31.html
Yamazaki, K., Bodlaender, H. L., de Fluiter, B., & Thilikos, D. M. (1999). Isomorphism for graphs of bounded distance width. Algorithmica, 24, 105-127.
Zantema, H., & Bodlaender, H. L. (1999). Finding small equivalent decision trees is hard. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1999-02.html
Bodlaender, H. L., & Thilikos, D. M. (1999). Graphs with branchwidth at most three. Journal of Algorithms, 32, 167-194.
1998
Scholarly publications
Bodlaender, H., Gustedt, J., & Telle, J. A. (1998). Linear-time register allocation for a fixed number of registers. In H. J. Karloff (Ed.), Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998 (pp. 574-583). SIAM.
Bodlaender, H. L. (1998). A note on domino treewidth. Discrete Mathematics and Theoretical Computer Science, 3, 109-118.
Bodlaender, H. L., & Thilikos, D. M. (1998). Computing small search numbers in linear time. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1998-05.html
Bodlaender, H. L., & Hagerup, T. (1998). Parallel algorithms with optimal speedup for bounded treewidth. SIAM Journal on Computing, 27, 1-23.
Bodlaender, H. L. (1998). A note on domino treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1998-15.html
Bodlaender, H. L., Kloks, T., Kratsch, D., & Muller, H. (1998). Treewidth and minimum fill-in on d-trapezoid graphs. Journal of Graph Algorithms and Applications, 2(5), 1-23. https://doi.org/10.7155/jgaa.00008
Bodlaender, H. L., Deogun, J. S., Jansen, K., Kloks, T., Kratsch, D., Muller, H., & Tuza, Z. (1998). Rankings of graphs. SIAM Journal on Discrete Mathematics, 11, 168-181.
Bodlaender, H. L., & Hagerup, T. (1998). Tree decompositions of small diameter. In Proceedings 23nd International Symposium on Mathematical Foundations of Computer Science (MFCS'98) (pp. 702-712). Springer.
Professional publications
Bodlaender, H. L. (1998). A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209, 1-45.
1997
Scholarly publications
de Fluiter, B. L. E., & Bodlaender, H. L. (1997). Parallel algorithms for treewidth two. In R. H. Mohring (Ed.), Proc 23rd Int. Workshop on Graph Theoretic Concepts in Computer Science (WG'97) (pp. 157-170). Springer.
https://dspace.library.uu.nl/bitstream/handle/1874/18710/bodlaender_97_parallel.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18710/bodlaender_97_parallel.pdf?sequence=1
Bodlaender, H. L. (1997). Treewidth: Algorithmic results and techniques. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-31.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1997). Reduction algorithms for graphs of small treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-24.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1997). Parallel algorithms for series parallel graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-21.html
Kant, G., & Bodlaender, H. L. (1997). Triangulating Planar Graphs While Minimizing the Maximum Degree. Information and Computation, 135, 1-14.
van der Gaag, L. C., & Bodlaender, H. L. (1997). Comparing loop cutsets and clique trees in probabilistic inference. In K. Van Marcke, & W. Daelemans (Eds.), Proceedings of the 9th Dutch Conference on Artificial Intelligence (pp. 71-80). Nederlandse Vereniging voor Kunstmatige Intelligentie (NVKI).
https://dspace.library.uu.nl/bitstream/handle/1874/18711/bodlaender_97_comparing.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18711/bodlaender_97_comparing.pdf?sequence=1
Bodlaender, H. L., & de Fluiter, B. L. E. (1997). A problem on strings with an application to intervalizing colored graphs. Bulletin of the European Association for Theoretical Computer Science, 62, 323-324.
Bodlaender, H. L., van Leeuwen, J., Tan, R., & Thilikos, D. M. (1997). On interval routing schemes and treewidth. Information and Computation, 139, 91-109.
https://dspace.library.uu.nl/bitstream/handle/1874/18307/bodlaender_96_on_interval.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18307/bodlaender_96_on_interval.pdf?sequence=1
Yamazaki, K., Bodlaender, H. L., de Fluiter, B. L. E., & Thilikos, D. M. (1997). Isomorphism for graphs of bounded distance width. In G. Bongiovanni, D. P. Bovet, & G. Di Battista (Eds.), Proceedings 3rd Italian Conference on Algorithms and Complexity (CIAC'97) (pp. 276-287). Springer.
https://dspace.library.uu.nl/bitstream/handle/1874/18712/bodlaender_97_isomorphism.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/18712/bodlaender_97_isomorphism.pdf?sequence=1
Bodlaender, H. L., & Thilikos, D. M. (1997). Constructive linear time algorithms for branchwidth. In P. Degano, R. Gorrieri, & A. Marchetti-Spaccamela (Eds.), Proceedings 24th Int. Colloquium on Automata, Languages, and Programming (ICALP'97) (pp. 627-637). Springer.
de Fluiter, B. L. E., & Bodlaender, H. L. (1997). Parallel algorithms for treewidth two. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-23.html
Bodlaender, H. L., & Thilikos, D. M. (1997). Treewidth for graphs with small chordality. Discrete Applied Mathematics, 79, 45-61.
Yamazaki, T., Bodlaender, H. L., de Fluiter, B. L. E., & Thilikos, D. M. (1997). Isomorphism for graphs of bounded distance width. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-05.html
Thilikos, D. M., & Bodlaender, H. L. (1997). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Information Processing Letters, 61, 227-232.
de Fluiter, B. L. E., & Bodlaender, H. L. (1997). Intervalizing sandwich graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-04.html
Bodlaender, H. L., Thilikos, D. M., & Yamazaki, K. (1997). It is hard to know when greedy is good for finding independent sets. Information Processing Letters, 61, 101-106.
van der Gaag, L. C., & Bodlaender, H. L. (1997). Comparing loop cutsets and clique trees in probabilistic inference. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-42.html
Bodlaender, H. L., & Engelfriet, J. (1997). Domino treewidth. Journal of Algorithms, (24), 94-123.
Bodlaender, H. L., & Thilikos, D. M. (1997). Graphs with branchwidth at most three. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1997-37.html
Professional publications
Bodlaender, H. L. (1997). Treewidth algorithmic techniques and results. In I. Privara, & P. Ruzicka (Eds.), Proc 22nd Int. Symposium on Mathematical Foundations of Computer Sciences (MFCS'97) (pp. 19-36). Springer.
1996
Scholarly publications
Bodlaender, H., Fellows, M. R., & Evans, P. A. (1996). Finite-state computability of annotations of strings and trees (extended abstract): Combinatorial Pattern Matching. In D. Hirschberg, & G. Myers (Eds.), Combinatorial Pattern Matching: 7th Annual Symposium, CPM 96 Laguna Beach, California, June 10–12, 1996 Proceedings (Vol. 1075, pp. 384-391). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-61258-0_28
Bodlaender, H. L. (1996). A partial k-arboretum of graphs with bounded treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1996-02.html
Bodlaender, H. L., & Kloks, T. (1996). Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms, 21, 358-402.
https://dspace.library.uu.nl/bitstream/handle/1874/16538/bodlaender_93_efficient.pdf?sequence=1
https://dspace.library.uu.nl/bitstream/handle/1874/16538/bodlaender_93_efficient.pdf?sequence=1
Bodlaender, H. L. (1996). A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing, 25, 1305-1317.
Bodlaender, H. L., van Leeuwen, J., Tan, R. B., & Thilikos, D. M. (1996). On interval routing schemes and treewidth. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1996-41.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1996). Parallel algorithms for series parallel graphs. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1996-13.html
Thilikos, D. M., & Bodlaender, H. L. (1996). Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1996-30.html
Bodlaender, H. L., Thilikos, D. M., & Yamazaki, T. (1996). It is hard to know when greedy is good for finding independent sets. (UU-CS ed.) Utrecht University: Information and Computing Sciences. http://www.cs.uu.nl/research/techreps/UU-CS-1996-29.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1996). Parallel algorithms for series parallel graphs. In J. Diaz, & M. Serna (Eds.), Proceedings 4th Annual European Symposium on Algorithms ESA'96 (pp. 277-289). Springer.
Bodlaender, H. L., & de Fluiter, B. L. E. (1996). Reduction algorithms for constructing solutions in graphs with small treewidth. In Jin-Yi Cai, & Chak Kuen Wong (Eds.), Proceedings 2nd Annual International Conference on Computing and Combinatorics (COCOON'96) (pp. 199-208). Springer.
Bodlaender, H. L., & de Fluiter, B. L. E. (1996). On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics, 71, 55-77.
1995
Scholarly publications
Bodlaender, H., Gonzalez, T. F., & Kloks, T. (1995). Complexity Aspects of Two-Dimensional Data Compression. Nordic journal of computing, 2(4), 462-495.
Bodlaender, H., & de Fluiter, B. (1995). Intervalizing k-colored graphs. In Z. Fülöp, & F. Gécseg (Eds.), Automata, Languages and Programming: 22nd International Colloquium, ICALP 95 Szeged, Hungary, July 10–14, 1995 Proceedings (Vol. 944, pp. 87-98). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-60084-1_65
Bodlaender, H., & Hagerup, T. (1995). Parallel algorithms with optimal speedup for bounded treewidth. In Z. Fülöp, & F. Gécseg (Eds.), Automata, Languages and Programming: 22nd International Colloquium, ICALP 95 Szeged, Hungary, July 10–14, 1995 Proceedings (Vol. 944, pp. 268-279). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-60084-1_80
Bodlaender, H., Tan, R. B., Thilokos, D., & van Leeuwen, J. (1995). On Interval Routing Schemes and treewidth. In M. Nagl (Ed.), Graph-Theoretic Concepts in Computer Science: 21st International Workshop, WG '95 Aachen, Germany, June 20–22, 1995 Proceedings (Vol. 1017, pp. 181-196). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-60618-1_75
Bodlaender, H., & Engelfriet, J. (1995). Domino treewidth. In E. Mayr, G. Schmidt, & G. Tinhofer (Eds.), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94 Herrsching, Germany, June 16–18, 1994 Proceedings (Vol. 903, pp. 1-13). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-59071-4_33
Bodlaender, H. L., Deogun, J. S., Jansen, K., Kloks, T., Kratsch, D., Müller, H., & Tuza, Z. (1995). Rankings of graphs. In E. W. Mayr, G. Schmidt, & G. Tinhofer (Eds.), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, WG '94 Herrsching, Germany, June 16–18, 1994 Proceedings (Vol. 903, pp. 292-304). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-59071-4_56
Bodlaender, H. L., Downey, R. G., Fellows, M. R., & Wareham, H. T. (1995). The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science, 147(1-2), 31-54.
Bodlaender, H. L., & Fellows, M. R. (1995). W[2]-hardness of precedence constrained K-processor scheduling. Operations Research Letters, 18(2), 93-97.
Bodlaender, H. L., & Jansen, K. (1995). Restrictions of graph partition problems. Part I. Theoretical Computer Science, 148(1), 93-109.
Bodlaender, H. L., Downey, R. G., Fellows, M. R., Hallett, M. T., & Wareham, H. T. (1995). Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences, 11(1), 49-57.
Bodlaender, H. L., Gilbert, J. R., Hafsteinsson, H., & Kloks, T. (1995). Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. Journal of Algorithms, 18(2), 238-255. https://doi.org/10.1006/jagm.1995.1009
Bodlaender, H. L. (1995). The hardness of problems on thin colored graphs. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-36.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1995). Reduction algorithms for graphs with small treewidth. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-37.html
Bodlaender, H. L., Kratsch, D., & Kloks, A. J. J. (1995). Rankings of graphs. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-03.html
Bodlaender, H. L. (1995). The parameterized complexity of sequence alignment and consensus. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-01.html
Bodlaender, H. L., Kratsch, D., & Kloks, A. J. J. (1995). Treewidth and minimum fill-in on d-trapezoid graphs. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-34.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1995). On intervalizing k-colored graphs for DNA physical mapping. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-20.html
Bodlaender, H. L., & de Fluiter, B. L. E. (1995). Intervalizing k-colored graphs. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-15.html
Bodlaender, H. L., & Thilikos, D. M. (1995). Treewidth and small separators for graphs with small chordality. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-02.html
Bodlaender, H. L. (1995). Parallel algorithms with optimal speedup for bounded treewidth. (UU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/UU-CS-1995-25.html
1994
Scholarly publications
Bodlaender, H. (1994). On disjoint cycles. International Journal of Foundations of Computer Science, 5(1), 59-68. https://doi.org/10.1142/S0129054194000049
Bodlaender, H., Tel, G., & Santoro, N. (1994). Trade-Offs in Non-Reversing Diameter. Nordic journal of computing, 1(1), 111-134.
Bodlaender, H., Downey, R. G., Fellows, M. R., & Wareham, H. T. (1994). The parameterized complexity of sequence alignment and consensus. In M. Crochemore, & D. Gusfield (Eds.), Combinatorial Pattern Matching: 5th Annual Symposium, CPM 94 Asilomar, CA, USA, June 5–8, 1994 Proceedings (Vol. 807, pp. 15-30). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-58094-8_2
Bodlaender, H., & Jansen, K. (1994). On the complexity of the maximum cut problem. In P. Enjalbert, E. W. Mayr, & K. W. Wagner (Eds.), STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24–26, 1994 Proceedings (Vol. 775, pp. 769-780). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-57785-8_189
Bodlaender, H. L., Fellows, M. R., & Hallett, M. T. (1994). Beyond NP-completeness for Problems of Bounded Width (Extended Abstract): Hardness for the W Hierarchy. In F. T. Leighton, & M. Goodrich (Eds.), Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, STOC'94 (pp. 449-458). (STOC '94). ACM. https://doi.org/10.1145/195058.195229
Bodlaender, H. (1994). On reduction algorithms for graphs with small treewidth. In J. van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93 Utrecht, The Netherlands, June 16–18, 1993 Proceedings (Vol. 790, pp. 45-56). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-57899-4_40
Bodlaender, H. (1994). Dynamic algorithms for graphs with treewidth 2. In J. van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science: 19th International Workshop, WG '93 Utrecht, The Netherlands, June 16–18, 1993 Proceedings (Vol. 790, pp. 112-124). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-57899-4_45
Bodlaender, H. L., Fellows, M. R., & Hallett, M. T. (1994). Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 449-458). ACM.
Bodlaender, H. L., Moran, S., & Warmuth, M. K. (1994). The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. Information and Computation, 108(1), 34-50. https://doi.org/10.1006/inco.1994.1002
Bodlaender, H. L. (1994). Improved self-reduction algorithms for graphs with bounded treewidth. Discrete Applied Mathematics, 54(2-3), 101-115.
Bodlaender, H. L., Jansen, K., & Woeginger, G. J. (1994). Scheduling with incompatible jobs. Discrete Applied Mathematics, 55(3), 219-232.
Bodlaender, H. L. (1994). W[2]-hardness of Precedence Constrained K-processor Scheduling. (UU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/UU-CS-1994-14.html
Bodlaender, H. L. (1994). Domino treewidth. (UU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/UU-CS-1994-11.html
Other output
Kloks, T., Bodlaender, H., Müller, H., & Kratsch, D. (1994). Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. 508.
1993
Scholarly publications
Bodlaender, H. L. (1993). A Tourist Guide through Treewidth. Acta Cybernetica, 11(1--2), 1-21.
Bodlaender, H., & Möhring, R. H. (1993). The Pathwidth and Treewidth of Cographs. SIAM Journal on Discrete Mathematics, 6(2), 181-188.
Kloks, T., Bodlaender, H., Müller, H., & Kratsch, D. (1993). Computing treewidth and minimum fill-in: All you need are the minimal separators. In T. Lengauer (Ed.), Algorithms—ESA '93: First Annual European Symposium Bad Honnef, Germany September 30–October 2, 1993 Proceedings (Vol. 726, pp. 260-271). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-57273-2_61
Bodlaender, H., Kloks, T., & Kratsch, D. (1993). Treewidth and pathwidth of permutation graphs. In A. Lingas, R. Karlsson, & S. Carlsson (Eds.), Automata, Languages and Programming: 20th International Colloquium, ICALP 93 Lund, Sweden, July 5–9, 1993 Proceedings (Vol. 700, pp. 114-125). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-56939-1_66
Bodlaender, H., & Jansen, K. (1993). On the complexity of scheduling incompatible jobs with unit-times: Mathematical Foundations of Computer Science 1993. In A. M. Borzyszkowski, & S. Sokołowski (Eds.), Mathematical Foundations of Computer Science 1993: 18th International Symposium, MFCS'93 Gdańsk, Poland, August 30–September 3, 1993 Proceedings (Vol. 711, pp. 291-300). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-57182-5_21
Bodlaender, H. L. (1993). A Linear Time Algorithm for Finding Tree-decompositions of Small Treewidth. In Proceedings of the Twenty-fifth Annual ACM Symposium on Theory of Computing: STOC'93 (pp. 226-234). (STOC '93). ACM. https://doi.org/10.1145/167088.167161
Bodlaender, H., Jansen, K., & Woeginger, G. J. (1993). Scheduling with incompatible jobs: Graph-Theoretic Concepts in Computer Science. In E. W. Mayr (Ed.), Graph-Theoretic Concepts in Computer Science (Vol. 657, pp. 37-49). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-56402-0_34
Bodlaender, H. (1993). Kayles on special classes of graphs — An application of Sprague-Grundy theory. In E. W. Mayr (Ed.), Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings (Vol. 657, pp. 90-102). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-56402-0_39
Bodlaender, H. L. (1993). On Linear Time Minor Tests with Depth-First Search. Journal of Algorithms, 14(1), 1-23. https://doi.org/10.1006/jagm.1993.1001
Bodlaender, H. L. (1993). Linear time algorithm for finding tree-decompositions of small treewidth. In Conference Proceedings of the 25th Annual ACM Symposium on Theory of Computing, STOC 1993 (pp. 226-234). ACM.
Bodlaender, H. L. (1993). Complexity of path-forming games. Theoretical Computer Science, 110(1), 215-245.
Bodlaender, H., & Kloks, T. (1993). A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. Journal of Algorithms, 15(1), 160-172. https://doi.org/10.1006/jagm.1993.1035
Bodlaender, H. L., & Kloks, A. J. J. (1993). Efficient and constructive algorithms for the pathwidth and treewidth of graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-93-27.html
1992
Scholarly publications
Bodlaender, H., Fellows, M. R., & Warnow, T. J. (1992). Two strikes against perfect phylogeny. In W. Kuich (Ed.), Automata, Languages and Programming: 19th International Colloquium Wien, Austria, July 13–17, 1992 Proceedings (Vol. 623, pp. 273-283). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55719-9_80
Kloks, T., & Bodlaender, H. (1992). Approximating treewidth and pathwidth of some classes of perfect graphs. In T. Ibaraki, Y. Inagaki, K. Iwama, T. Nishizeki, & M. Yamashita (Eds.), Algorithms and Computation: Third International Symposium, ISAAC'92 Nagoya, Japan, December 16–18, 1992 Proceedings (Vol. 650, pp. 116-125). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-56279-6_64
Bodlaender, H., & Kloks, T. (1992). A simple linear time algorithm for triangulating three-colored graphs. In A. Finkel, & M. Jantzen (Eds.), STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992 Proceedings (Vol. 577, pp. 413-423). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55210-3_201
Kant, G., & Bodlaender, H. (1992). Triangulating planar graphs while minimizing the maximum degree. In O. Nurmi, & E. Ukkonen (Eds.), Algorithm Theory — SWAT '92: Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings (Vol. 621, pp. 258-271). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55706-7_22
Kloks, T., & Bodlaender, H. (1992). Testing superperfection of k-trees. In O. Nurmi, & E. Ukkonen (Eds.), Algorithm Theory — SWAT '92: Third Scandinavian Workshop on Algorithm Theory Helsinki, Finland, July 8–10, 1992 Proceedings (Vol. 621, pp. 292-303). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55706-7_25
Bodlaender, H., Gilbert, J. R., Hafsteinsson, H., & Kloks, T. (1992). Approximating treewidth, pathwidth, and minimum elimination tree height. In G. Schmidt, & R. Berghammer (Eds.), Graph-Theoretic Concepts in Computer Science: 17th International Workshop, WG '91 Fischbachau, Germany, June 17–19 1991 Proceedings (Vol. 570, pp. 1-12). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55121-2_1
Bodlaender, H. (1992). On disjoint cycles. In G. Schmidt, & R. Berghammer (Eds.), Graph-Theoretic Concepts in Computer Science (Vol. 570, pp. 230-238). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-55121-2_24
Bodlaender, H. L., & Kratsch, D. (1992). The complexity of coloring games on perfect graphs. Theoretical Computer Science, 106(2), 309-326.
Bodlaender, H. L. (1992). A tourist guide through Treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-12.html
Kloks, A. J. J., & Bodlaender, H. L. (1992). Testing superperfection of $k-$trees. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-09.html
Kloks, A. J. J., & Bodlaender, H. L. (1992). Only few graphs have bounded treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-35.html
Kloks, A. J. J., & Bodlaender, H. L. (1992). Approximating treewidth and pathwidth of some classes of perfect graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-29.html
Kloks, A. J. J., & Bodlaender, H. L. (1992). On the Treewidth and Pathwidth of Permutation Graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-13.html
Bodlaender, H. L. (1992). Two strikes against perfect phylogeny. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-08.html
Bodlaender, H. L., Kloks, A. J. J., & Kratsch, D. (1992). Treewidth and pathwidth of permutation graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-30.html
Kant, G., & Bodlaender, H. L. (1992). Triangslating planar graphs while minimizing the maximum degree. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-07.html
Bodlaender, H. L. (1992). A linear time algorithm for finding tree-decompositions of small treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-92-27.html
1991
Scholarly publications
Bodlaender, H. (1991). On the complexity of some coloring games. International Journal of Foundations of Computer Science, 02(02), 133-147. https://doi.org/10.1142/S0129054191000091
Bodlaender, H., Gonzalez, T., & Kloks, T. (1991). Complexity aspects of map compression. In Data Compression Conference, DCC'91. (pp. 287-296). IEEE Computer Society. https://doi.org/10.1109/DCC.1991.213352
Bodlaender, H., & Kloks, T. (1991). Better algorithms for the pathwidth and treewidth of graphs. In J. L. Albert, B. Monien, & M. R. Artalejo (Eds.), Automata, Languages and Programming: 18th International Colloquium Madrid, Spain, July 8–12, 1991 Proceedings (Vol. 510, pp. 544-555). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-54233-7_162
Kant, G., & Bodlaender, H. (1991). Planar graph augmentation problems: 2nd Workshop, WADS '91 Ottawa, Canada, August 14–16, 1991 Proceedings. In F. Dehne, J-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures (Vol. 519, pp. 286-298). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/BFb0028270
Bodlaender, H. (1991). On the complexity of some coloring games. In R. H. Möhring (Ed.), Graph-Theoretic Concepts in Computer Science: 16th International Workshop WG '90 Berlin, Germany, June 20–22, 1990 Proceedings (Vol. 484, pp. 30-40). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-53832-1_29
Bodlaender, H. L. (1991). Some lower bound results for decentralized extrema-finding in rings of processors. Journal of Computer and System Sciences, 42(1), 97-118.
Bodlaender, H. L. (1991). New lower bound techniques for distributed leader finding and other problems on rings of processors. Theoretical Computer Science, 81(2), 237-256.
Kant, G., & Bodlaender, H. L. (1991). Planar graph augmentation problems. (RUU-CS ed.) Utrecht University. http://www.cs.uu.nl/research/techreps/RUU-CS-91-25.html
Bodlaender, H. L. (1991). Kayles on special classes of graphs - An application of Sprague-Grundy theory. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-49.html
Bodlaender, H. L., & Kloks, A. J. J. (1991). Approximating treewidth, pathwidth, and minimum elimination tree height. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-01.html
Bodlaender, H. L., & Kloks, A. J. J. (1991). Complexity aspects of 2-dimensional data compression. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-35.html
Bodlaender, H. L. (1991). Restrictions of graph partition problems. Part I. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-44.html
Bodlaender, H. L. (1991). On the complexity of the maximum cut problem. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-39.html
Bodlaender, H. L., & Kratsch, D. (1991). The complexity of coloring games on perfect graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-03.html
Bodlaender, H. L., & Kloks, A. J. J. (1991). A simple linear time algorithm for triangulating three-colored graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-91-13.html
1990
Scholarly publications
Bodlaender, H., & Möhring, R. H. (1990). The pathwidth and treewidth of cographs. In J. R. Gilbert, & R. Karlsson (Eds.), SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory Bergen, Sweden, July 11–14, 1990 Proceedings (Vol. 447, pp. 301-309). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/3-540-52846-6_99
Bodlaender, H. (1990). Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. In M. Nagl (Ed.), Graph-Theoretic Concepts in Computer Science: 15th International Workshop WG '89 Castle Rolduc, The Netherlands, June 14–16, 1989 Proceedings (Vol. 411, pp. 232-244). (Lecture Notes in Computer Science; Vol. 411). Springer. https://doi.org/10.1007/3-540-52292-1_17
Bodlaender, H. L. (1990). Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees. Journal of Algorithms, 11(4), 631-643.
Bodlaender, H. L., & Tel, G. (1990). Bit-optimal election in synchronous rings. Information Processing Letters, 36(1), 53-56. https://doi.org/10.1016/0020-0190(90)90187-3
Bodlaender, H. L. (1990). The complexity of finding uniform emulations on paths and ring networks. Information and Computation, 86(1), 87-106.
Bodlaender, H. L., Gritzmann, P., Klee, V., & Van Leeuwen, J. (1990). Computational complexity of norm-maximization. Combinatorica, 10(2), 203-225. https://doi.org/10.1007/BF02123011
Bodlaender, H. L. (1990). On disjoint cycles in graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-90-29.html
Bodlaender, H. L., & Kloks, A. J. J. (1990). Fast algorithms for the Tron game on trees. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-90-11.html
Bodlaender, H. L. (1990). The pathwidth and treewidth of cographs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-90-07.html
1989
Scholarly publications
Bodlaender, H., Moran, S., & Warmuth, M. K. (1989). The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. In J. Csirik, J. Demetrovics, & F. Gécseg (Eds.), Fundamentals of Computation Theory: International Conference FCT '89 Szeged, Hungary, August 21–25, 1989 Proceedings (Vol. 380, pp. 58-67). (Lecture Notes in Computer Science; Vol. 380). Springer. https://doi.org/10.1007/3-540-51498-8_6
Beame, P. W., & Bodlaender, H. (1989). Distributed computing on transitive networks: The torus. In B. Monien, & R. Cori (Eds.), STACS 89: 6th Annual Symposium on Theoretical Aspects of Computer Science Paderborn, FRG, February 16–18, 1989 Proceedings (Vol. 349, pp. 294-303). (Lecture Notes in Computer Science). Springer Berlin Heidelberg. https://doi.org/10.1007/BFb0028993
Bodlaender, H. (1989). On linear time minor tests and depth first search. In F. K. H. A. Dehne, J-R. Sack, & N. Santoro (Eds.), Algorithms and Data Structures: Workshop WADS '89 Ottawa, Canada, August 17–19, 1989 Proceedings (pp. 577-590). (Lecture Notes in Computer Science; Vol. 382). Springer. https://doi.org/10.1007/3-540-51542-9_48
Bodlaender, H. (1989). NC-Algorithms for Graphs with Small Treewidth. In J. van Leeuwen (Ed.), Graph-Theoretic Concepts in Computer Science, 14th International Workshop, WG '88, Amsterdam, The Netherlands, June 15-17, 1988, Proceedings. (Vol. 344, pp. 1-10). (Lecture Notes in Computer Science; Vol. 344). Springer. https://doi.org/10.1007/3-540-50728-0_32
Bodlaender, H. L. (1989). Achromatic number is NP-complete for cographs and interval graphs. Information Processing Letters, 31(3), 135-138.
Bodlaender, H. L. (1989). The classification of coverings of processor networks. Journal of Parallel and Distributed Computing, 6(1), 166-182.
Bodlaender, H. L. (1989). On linear time minor tests and depth first search. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-89-01.html
Bodlaender, H. L. (1989). On the complexity of some coloring games. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-89-27.html
Bodlaender, H. L., & Tel, G. (1989). Trade-offs in non-reversing diameter. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-89-22.html
Bodlaender, H. L., & Tel, G. (1989). Bit-optimal election in synchronous rings. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-89-02.html
Bodlaender, H. L. (1989). Complexity of path-forming games. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-89-29.html
1988
Scholarly publications
Bodlaender, H. (1988). Some Classes of Graphs with Bounded Treewidth. Bulletin of the EATCS, (36), 116-125.
Bodlaender, H. (1988). Dynamic Programming on Graphs with Bounded Treewidth. In T. Lepistö, & A. S. (Eds.), 15th International Colloquium Tampere, Finland, July 11–15, 1988 Proceedings (Vol. 317, pp. 105-118). (Lecture Notes in Computer Science; Vol. 217). Springer. https://doi.org/10.1007/3-540-19488-6_110
Bodlaender, H. (1988). Polynomial algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. In R. Karlsson, & A. Lingas (Eds.), 1st Scandinavian Workshop on Algorithm Theory Halmstad, Sweden, July 5–8, 1988 Proceedings (Vol. 318, pp. 223). (Lecture Notes in Computer Science; Vol. 318). Springer. https://doi.org/10.1007/3-540-19487-8_26
Bodlaender, H. L. (1988). A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors. Information Processing Letters, 27(6), 287-290.
Bodlaender, H. L. (1988). The complexity of finding uniform emulations on fixed graphs. Information Processing Letters, 29(3), 137-141. https://doi.org/10.1016/S0019-9958(86)80008-0
Bodlaender, H. L. (1988). ACHROMATIC NUMBER is NP-complete for cographs and interval graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-25.html
Bodlaender, H. L. (1988). Improved self-reduction algorithms for graphs with bounded treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-29.html
Bodlaender, H. L. (1988). Planar graphs with bounded treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-14.html
Bodlaender, H. L. (1988). The distributed bit complexity of the ring; from the anonymous to the non-anonymous case. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-33.html
Beame, P. W., & Bodlaender, H. L. (1988). Distributed computing on transitive networks; the torus. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-31.html
Bodlaender, H. L. (1988). NC-algorithms for graphs of small treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-04.html
Bodlaender, H. L. (1988). New lower bound techniques for distributed leader finding and other problems on rings of processors. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-88-18.html
1987
Scholarly publications
Bodlaender, H. (1987). New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors: GI Jahrestagung 1987. In M. Paul (Ed.), GI - 17. Jahrestagung, Computerintegrierter Arbeitsplatz im Büro, München, 20.-23. Oktober 1987, Proceedings. (pp. 82). Springer.
Schoone, A. A., Bodlaender, H., & van Leeuwen, J. (1987). Diameter increase caused by edge deletion. Journal of Graph Theory, 11(3). https://doi.org/10.1002/jgt.3190110315
Schoone, A. A., Bodlaender, H., & van Leeuwen, J. (1987). Improved diameter bounds for altered graphs. In G. Tinhofer, & G. Schmidt (Eds.), Proceedings 12th International Workshop on Graph Theoretic Concepts in Computer Science, WG'86 (pp. 227-236). (Lecture Notes in Computer Science; Vol. 246). Springer. https://doi.org/10.1007/3-540-17218-1_61
Bodlaender, H. L. (1987). A new lowerbound technique for distributed extrema finding on rings of processors. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-87-11.html
Bodlaender, H. L. (1987). The maximum cut and minimum cut into bounded sets problems on cographs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-87-12.html
Bodlaender, H. L. (1987). Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-87-17.html
Bodlaender, H. L. (1987). A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-87-13.html
Bodlaender, H. L. (1987). Dynamic programming on graphs with bounded treewidth. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-87-22.html
1986
Scholarly publications
Bodlaender, H., & van Leeuwen, J. (1986). New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. In B. Monien, & G. Vidal-Naquet (Eds.), Proceedings 3rd Annual Symposium on Theoretical Aspects of Computer Science, STACS 86 (pp. 119-129). (Lecture Notes in Computer Science; Vol. 210). Springer. https://doi.org/10.1007/3-540-16078-7_70
Bodlaender, H. L., & van Leeuwen, J. (1986). Simulation of large networks on smaller networks. Information and control, 71(3), 143-180.
Bodlaender, H. L., & van Leeuwen, J. (1986). Distribution of records on a ring of processors. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-86-06.html
Bodlaender, H. L. (1986). Classes of graphs with bounded tree-width. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-86-22.html
1985
Scholarly publications
Bodlaender, H., & van Leeuwen, J. (1985). Simulation of Large Networks on Smaller Networks. In K. Mehlhorn (Ed.), Proceedings 2nd Symposium of Theoretical Aspects of Computer Science (pp. 47-58). (Lecture Notes in Computer Science; Vol. 182). Springer. https://doi.org/10.1007/BFb0023994
Bodlaender, H. L. (1985). On Approximation algorithms for determining minimum cost emulations. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-10.html
Bodlaender, H. L. (1985). Some lowerbound results for decentralized extrema-finding in rings of processors. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-22.html
Schoone, A. A., Bodlaender, H. L., & van Leeuwen, J. (1985). Diameter increase caused by edge deletion. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-26.html
Bodlaender, H. L., & van Leeuwen, J. (1985). On the complexity of finding uniform emulations. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-04.html
Bodlaender, H. L. (1985). Deadlock-free packet switching networks with variable packet size. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-25.html
Bodlaender, H. L. (1985). The classification of coverings of processor networks. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-11.html
Bodlaender, H. L. (1985). The complexity of finding uniform emulations on paths and ring networks. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-05.html
Bodlaender, H. L. (1985). Emulations of processor networks with buses. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-20.html
Bodlaender, H. L. (1985). The complexity of finding uniform emulations on fixed graphs. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-14.html
Bodlaender, H. L. (1985). Finding grid embeddings with bounded maximum edge length is NP-complete. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-18.html
Bodlaender, H. L., & van Leeuwen, J. (1985). New upperbounds for decentralized extremafinding in a ring of processors. (RUU-CS ed.) Unknown Publisher. http://www.cs.uu.nl/research/techreps/RUU-CS-85-15.html
1983
Scholarly publications
Bodlaender, H. L., Wijshoff, H. A. G., & van Leeuwen, J. (1983). Compositions of double diagonal and cross Latin squares. (Technical report series; No. RUU-CS-83-01). Utrecht University. http://www.cs.uu.nl/research/techreps/RUU-CS-83-01.html