Papers of Hans L. Bodlaender

• Discovering Treewidth. (Link to Springer website for this paper in SOFSEM 2005.)

• my technical Reports at Utrecht University. (Papers can be downloaded from links there.)
• Publications; overview in the Metis system. Bibliographical data.

The linked versions are not always the most recent. For journal papers, it is preferable to look at the journal version.

• Hans L. Bodlaender, Thomas Wolle, Contraction degeneracy on cographs. Technical report UU-CS-2004-031, IICS, Utrecht University, 2004.
• Hans L. Bodlaender, Jan Arne Telle, Space-efficient construction variants of dynamic programming. Technical report UU-CS-2004-030, IICS, Utrecht University, 2004.
• Hans L. Bodlaender, Fedor V. Fomin, Equitable colorings of bounded treewidth graphs. Technical report UU-CS-2004-010, IICS, Utrecht University, 2004.
• Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad, On algorithms for (P₅,gem)-free graphs. Technical Report UU-CS-2003-038. Institute for Information and Computing Sciences, Utrecht University, 2003.
• Hans L. Bodlaender and Gerard Tel, Rectilinear graphs and angular resolution. Technical Report UU-CS-2003-033. Institute for Information and Computing Sciences, Utrecht University, 2003.
• Hans L. Bodlaender and Arie M. C. A. Koster, Safe separators for treewidth. Technical Report UU-CS-2003-027. Institute for Information and Computing Sciences, Utrecht University, 2003.
• Hans L. Bodlaender, Arie M. C. A. Koster, and Frank van den Eijkhof, Pre-processing rules for triangulation of probabilistic networks. Technical Report UU-CS-2003-001. Institute for Information and Computing Sciences, Utrecht University, 2003.
• Frank van den Eijkhof, Hans L. Bodlaender, and Arie M. C. A. Koster, Safe reduction rules for weighted treewidth. Technical Report UU-CS-2002-051. Institute for Information and Computing Sciences, Utrecht University, 2002.
• Hans L. Bodlaender, Michael R. Fellows and Dimitrios M. Thilikos, Derivation of algorithms for cutwidth and related graph layout problems. Technical Report UU-CS-2002-032. Institute for Information and Computing Sciences, Utrecht University, 2002.
• Hans L. Bodlaender, Hajo J. Broersma, Fedor V. Fomin, Artem V. Pyatkin and Gerhard J. Wöginger, Radio labeling with pre-assigned frequencies. In Rolf Möhring, Rajeev Raman, editors, Proceedings of the 10th Annual European Symposium on Algorithms, ESA'2002, Springer Verlag Lecture Notes in Computer Science 2461, pages 211 -- 222, 2002.
• Hans L. Bodlaender and Fedor V. Fomin, Tree decompositions with small cost. In Matti Penttonen and Erik~Meineche Schmidt, editors, Proceedings 8th Scandinavian Workshop on Algorithm Theory, SWAT'2002, Lecture Notes in Computer Science 1851, pages 378--387. Springer-Verlag, 2002.
• Hans L. Bodlaender and Udi Rotics, Computing the treewidth and the minimum fill-in with the modular decomposition. Algorithmica, 36 (2003) 375-408.
• Hans L. Bodlaender, Michael J. Dinneen, and Bakhadyr Khoussainov, Relaxed update and partition network games. Fundamenta Informaticae 49 (2002) 301-312.
• Arie M.C.A. Koster, Hans L. Bodlaender and Stam P.M. van Hoesel, Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8, Elsevier Science Publishers, 2001.
• Hans L. Bodlaender and Babette van Antwerpen-de Fluiter, Parallel algorithms for series parallel graphs and graphs with treewidth two, Algorithmica, 29 (2001) 543-559.
• Hans L. Bodlaender. A generic NP-hardness proof for a variant of Graph Coloring. Journal of Universal Computer Science 7 (2001) 1114 - 1124.
• Dimitrios M. Thilikos, Maria J. Serna and Hans L. Bodlaender, A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth. Technical Report LSI-01-4-R, Departament de Llenguatges i Sistemes Informatics, Universitat Politècnica de Catalyny, 2001. Also: Technical Report UU-CS-2001-04. Institute for Information and Computing Sciences, Utrecht University, 2001.
• Hans L. Bodlaender, Richard B. Tan and Jan van Leeuwen, Finding a Delta-regular subgraph of minimum order, Discrete Applied Mathematics 131 (2003) 3 - 9.
• Jochen Alber, Hans L. Bodlaender, Henning Fernau and Rolf Niedermeier, Fixed parameter algorithms for Planar Dominating Set and related problems, Technical Report UU-CS-2000-28. Institute for Information and Computing Sciences, Utrecht University, 2000. (Extended abstract in SWAT'2000.) Appeared as: J. Alber, H. L. Bodlaender, F. Fernau, T. Kloks, and R. Niedermeier, Fixed parameter algorithms for {\sc Dominating Set} and related problems on planar graphs, Algorithmica (2002) 33: 461-493.
• Hans L. Bodlaender Necessary edges in $k$-chordalizations of graphs, Technical Report UU-CS-2000-27. Institute for Information and Computing Sciences, Utrecht University, 2000.
• Dimitrios M. Thilikos, Maria J. Serna and Hans L. Bodlaender, A constructive linear time algorithm for small cutwidth, Technical Report UU-CS-2000-24. Institute for Information and Computing Sciences, Utrecht University, 2000. Conference paper: Constructive linear time algorithms for small cutwidth and carving-width, Proc. 11th International Symposium on Algorithms And Computation ISAAC '00, Lecture Notes in Computer Science 1969, Springer Verlag, p. 192--203, 2000.
• Fedor V. Fomin and Hans L. Bodlaender, Approximation of pathwidth of outerplanar graphs, Technical Report UU-CS-2000-23, Institute for Information and Computing Sciences, Utrecht University, 2000. Journal of Algorithms 43 (2002) 190-200.
• H. N. de Ridder and Hans L. Bodlaender, Graph automorphisms with maximal projection distances, G. Ciobabu, G. Paun (Eds.), FCT'99, Proc. 12th Intern. Symp. on Fundamentals of Computation Theory, Lecture Notes in Computer Science Vol. 1684, Springer-Verlag, Berlin, 204-214, 1999.
• Hans L. Bodlaender, T. Kloks, Richard B. Tan, and Jan van Leeuwen, lambda-Coloring of Graphs, H. Reichel and S. Tison (Eds.), STACS 2000, Proc. 17th Annual Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science Vol. 1770, Springer-Verlag, Berlin, 2000, pp. 395-406.
• Hans Zantema and Hans L. Bodlaender. Sizes of decision tables and decision trees. Technical Report UU-CS-1999-31, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1999. International Journal of Foundations of Computer Science, Vol 13, No 3, 2002, 445-458.
• Hans Zantema and Hans L. Bodlaender. Finding small equivalent decision trees is hard. Int. J. Found. Comp. Sc., 11(2):343--354, 2000.
• Hans L. Bodlaender and Torben Hagerup. Tree decompositions of small diameter. In: Proceedings 23nd International Symposium on Mathematical Foundations of Computer Science, MFCS'98, Lecture Notes in Computer Science, volume 1450, Springer-Verlag, Berlin, 1998, 702-712.
• Hans L. Bodlaender. A note on domino treewidth. Discrete Mathematics & Theoretical Computer Science, vol 3., pp. 109 - 118.
• Hans L. Bodlaender, Dimitrios M. Thilikos. Computing Small Search Numbers in Linear Time. Technical Report UU-CS-1998-05, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1998.
• L.C. van der Gaag, H.L. Bodlaender. Comparing loop cutsets and clique trees in probabilistic inference. In: K. Van Marcke, W. Daelemans (Editors). Proceedings of the Ninth Dutch Conference on Artificial Intelligence, NVKI, pp. 71 - 80, 1997.
• Hans L. Bodlaender, Dimitrios M. Thilikos. Graphs with Branchwidth at most Three. Technical Report UU-CS-1997-37, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1997.
• Hans L. Bodlaender. Treewidth: Algorithmic Techniques and Results. Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97, Lecture Notes in Computer Science, volume 1295, Igor Privara and Peter Ruzicka (editors), Springer-Verlag, Berlin, 1997, p. 29-36.
• Hans L. Bodlaender, Dimitrios M. Thilikos. Constructive Linear Time Algorithms for Branchwidth. Proceedings 24th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, volume 1256. Pierpaolo Degano, Roberto Gorrieri and Alberto Marchetti-Spaccamela (editors), 1997, Springer-Verlag Lecture Notes in Computer Science vol. 1256, p. 627-637.
  Technical report version: Dimitrios M. Thilikos, Hans L. Bodlaender, Constructive Linear Time Algorithms for Branchwidth, Technical Report UU-CS-2000-38, Institute for Information and Computing Sciences, Utrecht University, Utrecht, the Netherlands, 2000.
• Hans L. Bodlaender, Babette van Antwerpen-de Fluiter. Reduction algorithms for graphs of small treewidth. Information and Computation 167, 86 - 119, 2001.
• Babette de Fluiter, Hans L. Bodlaender. Parallel algorithms for treewidth two. Proceedings 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97. Rolf H. Möhring (editor), Springer-Verlag Lecture Notes in Computer Science vol. 1335, p. 157-170, 1997.
• Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle. Linear-time register allocation for a fixed number of registers. Technical Report 551/1997, Fachbereich Mathematik, Technical University Berlin, Germany, 1997.
• Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos. Isomorphism for graphs of bounded distance width. Algorithmica 24 (1999) 105-127.
• Babette de Fluiter, Hans L. Bodlaender. Intervalizing Sandwich Graphs. Technical Report UU-CS-1997-04, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1997.
• Dimitrios M. Thilikos, Hans L. Bodlaender. Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems. Information Processing Letters 61 (1997) 227 - 232.
• Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki. It is hard to know when greedy is good for finding independent sets. Information Processing Letters 61 (1997) 101-106.
• Hans L. Bodlaender, Babette de Fluiter. Parallel algorithms for series parallel graphs. Technical Report UU-CS-1997-21, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1997. In: Proceedings 4st Annual European Symposium on Algorithms ESA'96, Springer Verlag Lecture Notes on Computer Science, vol. 1136, 1996, 277-289. (Older version: Technical report UU-CS-1996-13.)
• Hans L. Bodlaender, Babette de Fluiter. Parallel algorithms for partial two-trees and for blocks of partial k-trees.. Manuscript.
• Hans L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoretical Computer Science, 209 (1998) 1-45.
• Hans L. Bodlaender, Babette de Fluiter. Reduction algorithms for graphs with small treewidth. Technical Report UU-CS-1995-37, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1995. In: Proceedings 2nd Annual International Conference on Computing and Combinatorics, COCOON'96, Springer Verlag, Lecture Notes in Computer Science, vol. 1090, 1996 (199-208). (Revised and updated version: July 1997. See above.)
• Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, H. T. Wareham, Tandy J. Warnow. The hardness of problems on thin colored graphs. Journal version: The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs, Theoretical Computer Science, 244 (2000) 167-188.
• Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller. Treewidth and minimum fill-in on d-trapezoid graphs. Journal on Graph Algorithms and Applications 2 (1998) 1-23. (Link to JGAA website, on which you can find this paper online.)
• Hans L. Bodlaender, Torben Hagerup. Parallel algorithms with optimal speedup for bounded treewidth. SIAM Journal on Computing, 27, 1998, 1725-1746.
• Hans L. Bodlaender, Richard Tan, Dimitrios M. Thilikos, Jan van Leeuwen. On Interval Routing Schemes and Treewidth. Information and Computation 139 (1997) 92-109.
• Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza. Rankings of graphs. SIAM J. Discrete Math. 11 (1998) 168-181.
• Hans L. Bodlaender, Dimitrios M. Thilikos. Treewidth and small separators for graphs with small chordality. Technical Report UU-CS-1995-02, Department of Computer Science, Utrecht University, Utrecht, the Netherlands.
  Revised version: Treewidth for graphs with small chordality. Discrete Applied Mathematics 79 (1997) 45-61.
• Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, H. T. Wareham. The parameterized complexity of sequence alignment and consensus. Theoretical Computer Science 147 (1995) 31-54.
• Hans L. Bodlaender, Babette L. E. de Fluiter. On intervalizing k-colored graphs for DNA physical mapping. Discrete Applied Mathematics 71 (1996) 55-77.
• Hans L. Bodlaender, Babette L. E. de Fluiter. Intervalizing k-colored graphs. . Technical Report UU-CS-1995-15, Department of Computer Science, Utrecht University, Utrecht, the Netherlands, 1995. Proceedings 22nd International Colloquium on Automata, Languages and Programming, Springer-Verlag, Lecture Notes in Computer Science 944, p. 97-98, 1995.
• Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett. Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, pages 449-458, ACM Press, 1994.
• Hans L. Bodlaender, Dynamic algorithms for graphs with treewidth 2. In Jan van Leeuwen, editor, Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'93, Lecture Notes in Computer Science, vol. 790, pages 112-124, Berlin, 1994. Springer Verlag.
• Hans L. Bodlaender, On reduction algorithms for graphs with small treewidth. In Jan van Leeuwen, editor, Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'93, Lecture Notes in Computer Science, vol. 790, pages 45-56, Berlin, 1994. Springer Verlag. Subsumed by paper with de Fluiter, mentioned above.
• Hans L. Bodlaender, Michael R. Fellows, W[2]-hardness of precedence constrained K-processor scheduling. Operations Research Letters, 18 (1995) 93-98.
• Hans L. Bodlaender, Joost Engelfriet. Domino treewidth. Journal of Algorithms 24 (1997) 94-123.
• Hans L. Bodlaender, Klaus Jansen. On the complexity of scheduling incompatible jobs with unit-times. A. M. Borzyszkowski and S. Sokolowski, editors, Proceedings 18th International Symposium on Mathematical Foundations of Computer Science, Lecture Notes on Computer Science, pages 291-300, Berlin, 1993. Springer Verlag.
• Ton Kloks, Hans Bodlaender, Haiko Müller, Dieter Kratsch. Computing treewidth and minimum fill-in: All you need are the minimal separators. In Thomas Lengauer, editor, Proceedings 1st Annual European Symposium on Algorithms ESA'93, Lecture Notes on Computer Science, vol. 726, pages 260-271, Berlin, 1993. Springer Verlag. NOTE: This paper contains a serious error!
• Hans L. Bodlaender, Ton Kloks. Efficient and constructive algorithms for the pathwidth and treewidth of graphs. Journal of Algorithms 21 (1996) 358-402.
• Hans L. Bodlaender, Klaus Jansen, G. J. Woeginger. Scheduling with incompatible jobs. Discrete Applied Mathematics 55 (1994) 219 - 232.
• Ton Kloks, Hans Bodlaender. Only few graphs have bounded treewidth. Technical Report RUU-CS-92-35, Department of Computer Science, Utrecht University, Utrecht, 1992.
• Hans L. Bodlaender, Ton Kloks, Dieter Kratsch. Treewidth and pathwidth of permutation graphs. SIAM Journal on Discrete Mathematics 8 (1995) 606-616.
• Ton Kloks, Hans Bodlaender. Approximating treewidth and pathwidth of some classes of perfect graphs. In Proceedings Third International Symposium on Algorithms and Computation, ISAAC'92, Lect. Notes in Comp. Science 650, pages 116-125, Berlin, 1992. Springer Verlag.
• Hans L. Bodlaender. A linear time algorithm for finding tree-decompositions of small treewidth. SIAM Journal on Computing 25 (1996) 1305-1317.
• Hans L. Bodlaender. A tourist guide through treewidth. Acta Cybernetica 11 (1993) 1-21. Modified version in: J. Dassow and A. Kelemenova, editors, Developments in Theoretical Computer Science: Proceedings of the 7th International Meeting of Young Computer Scientists, Smolenice, 16 - 20 November 1992, pages 1-20. Gordon and Breach Science Publishers, 1994.
• Hans L. Bodlaender, Klaus Jansen. On the Complexity of the Maximum Cut Problem. Nordic Journal on Computing 7 (2000) 14-31.
• Hans L. Bodlaender. Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. Discrete Applied Mathematics 54 (1994) 101-115.
• Hans L. Bodlaender, S. Moran, M. K. Warmuth. The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. Information and Computation 108 (1994) 34-50.
• Hans L. Bodlaender, G. Tel, N. Santoro. Trade-Offs in Non-Reversing Diameter. Nordic Journal on Computing 1 (1994) 111-134.
• Hans L. Bodlaender. On disjoint cycles. Int. J. Found. Comp. Sc. 5 (1994) 59-68.
• Hans L. Bodlaender, John R. Gilbert, H. Hafsteinsson, Ton Kloks. Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. Journal of Algorithms 18 (1995) 238-255.
• Hans L. Bodlaender, Teo Gonzalez, Ton Kloks. Complexity Aspects of Two-Dimensional Data Compression. Nordic Journal on Computing 2 (1995) 462-495.
• Hans L. Bodlaender, Klaus Jansen. Restrictions of graph partition problems. Part I. Theoretical Computer Science 148 (1995) 93-109.
• Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, H. T. Wareham. Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11 (1995) 49-57.
• Ton Kloks, Hans L. Bodlaender. Testing superperfection of k-trees. In: Proceedings 3rd Scandinavian Workshop on Algorithm Theory. Springer Verlag, Lecture Notes in Computer Science 621, 292-303, 1992.
• Hans L. Bodlaender, Michael R. Fellows, Tandy J. Warnow. Two strikes against perfect phylogeny. In Proceedings 19th International Colloquium on Automata, Languages and Programming, p 273-283, Berlin, 1992. Springer Verlag, Lecture Notes in Computer Science 623.
• G. Kant, Hans L. Bodlaender. Triangulating planar graphs while minimizing the maximum degree. Information and Computation 135 (1997) 1-14.
• Hans L. Bodlaender, Dieter Kratsch. Kayles and nimbers. Journal of Algorithms 43, 106-119 (2002). (For the most recent version, see IDEAL.) An earlier version appeared as: Hans L. Bodlaender. Kayles on special classes of graphs - An application of Sprague-Grundy theory. In Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'92, p 90-102. Springer Verlag, Lecture Notes in Computer Science, volume 657, 1993.
• Hans L. Bodlaender, Klaus Jansen. On the complexity of the maximum cut problem. In Proc. STACS 94: 11st Annual Symposium on Theoretical Comp. Science, Springer Verlag, Lecture Notes in Computer Science 775, p 769-780. 1994.
• G. Kant, Hans L. Bodlaender. Planar graph augmentation problems. In Proceedings 2nd Workshop on Algorithms and Datastructures, p 286 - 298. Springer Verlag Lecture Notes in Computer Science, volume 519, 1991.
• Hans L. Bodlaender, Ton Kloks. A simple linear time algorithm for triangulating three-colored graphs. Journal of Algorithms 15(1): 160-172, 1993.
• Hans L. Bodlaender, Dieter Kratsch. The complexity of coloring games on perfect graphs. Theoretical Computer Science 106: 306-326, 1992.
• Hans L. Bodlaender, Ton Kloks. Fast algorithms for the TRON games on trees. Technical Report RUU-CS-90-11, Department of Computer Science, Utrecht University, Utrecht, 1990.
• Hans L. Bodlaender, R. H. Möhring. The pathwidth and treewidth of cographs. SIAM Journal on Discrete Mathematics 6(2): 181-188, 1993.
• Hans L. Bodlaender. Complexity of path-forming games. Theoretical Computer Science 110(1): 215-245, 1993.
• Hans L. Bodlaender. On the complexity of some coloring games. International Journal of Foundations of Computer Science 2(2): 133-148, 1991.
• Hans L. Bodlaender. On linear time minor tests with depth first search. Journal of Algorithms 14(1): 1-23, 1993.
• Hans L. Bodlaender, G. Tel. Bit-optimal election in synchronous rings. Information Processing Letters 36(1): 53-56, 1990.
• Hans L. Bodlaender, P. Gritzmann, V. Klee, Jan van Leeuwen. Computational complexity of norm-maximization. Combinatorica 10: 203-225, 1990.
• P. W. Beame, Hans L. Bodlaender. Distributed computing on transitive grids: The torus. In Proc. Symp. Theor. Aspects of Comp. Sc. STACS '89, p 294-303. Springer Verlag, 1989.
• Hans L. Bodlaender. Achromatic Number is NP-complete for cographs and interval graphs. Information Processing Letters 31: 135-138, 1989.
• Hans L. Bodlaender. New lower bound techniques for distributed leader finding and other problems on rings of processors. Theoretical Computer Science 81: 237 - 256, 1991.
• Hans L. Bodlaender. NC-algorithms for graphs with small treewidth. In: Proc. 14th Workshop Graph-Theoretic Concepts in Computer Science WG'88, p 1-10. Springer Verlag, Lecture Notes in Computer Science 344, 1989.
• Hans L. Bodlaender. Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees. Journal of Algorithms 11(4): 631-643, 1990.
• Hans L. Bodlaender. A better lower bound for distributed leader finding in bidirectional, asynchronous rings of processors. Information Processing Letters, 27(6): 287-290, 1988.
• Hans L. Bodlaender. Dynamic programming on graphs with bounded treewidth. In Proceedings 15th International Colloquium on Automata, Languages and Programming, pages 105--118, Berlin, 1988. Springer Verlag, Lecture Notes in Computer Science 317.
• Hans L. Bodlaender. Classes of Graphs with Bounded Treewidth. Technical Report RUU-CS-86-22, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1986.
• Hans L. Bodlaender. Distributed Computing: Structure and Complexity. Ph. D. Thesis, Utrecht University, November 1986. Appeared as: CWI Tract 43, CWI, Amsterdam, the Netherlands. ISBN: 90 6196 327 3.
• Anneke A. Schoone, Hans L. Bodlaender and Jan van Leeuwen. Diameter Increase Caused by Edge Deletion. Journal of Graph Theory 11(3): 409-427, 1987.
• Hans L. Bodlaender. Deadlock-free packet switching networks with variable packet size. Technical Report RUU-CS-85-25, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1985.
• Hans L. Bodlaender. Some lower bound results for decentralized extrema-finding in rings of processors. Journal on Computing and System Sciences 42(1): 97-118, 1991.
• Hans L. Bodlaender, Jan van Leeuwen. New upperbounds for decentralized extrema-finding in a ring of processors. Proc. STACS 86: 3rd Annual Conference on Theoretical Comp. Science, Orsay, Lect. Notes in Comp. Science 210. p 119-129, Springer Verlag, 1986.
• Hans L. Bodlaender. Emulations of processor networks with buses. Technical Report RUU-CS-85-20, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1985.
• Hans L. Bodlaender. Finding grid embeddings with bounded maximum edge length is NP-complete. Technical Report RUU-CS-85-18, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1985.
• Hans L. Bodlaender and Jan van Leeuwen. New upperbounds for decentralized extrema-finding in a ring of processors. Proc. STACS 86: 3rd Annual Conference on Theoretical Comp. Science, Orsay, Lect. Notes in Comp. Science 210, Springer Verlag, 1986, p. 119-129.
• Hans L. Bodlaender. The complexity of finding uniform emulations on fixed graphs. Information Processing Letters 29 (1988) 137-141.
• Hans L. Bodlaender. The classification of coverings of processor networks. Journal of Parallel and Distributed Computing 6 (1989) 166-182.
• Hans L. Bodlaender. On approximation algorithms for determining minimum cost emulations. Technical Report RUU-CS-85-10, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1985.
• Hans L. Bodlaender. The complexity of finding uniform emulations on paths and ring networks. Information and Computation 86 (1990) 87-106.
• Hans L. Bodlaender. On the complexity of finding uniform emulations. Technical Report RUU-CS-85-4, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1985.
• Hans L. Bodlaender. Uniform emulations of two different types of shuffle-exchange networks. Technical Report RUU-CS-84-9, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1984.
• Hans L. Bodlaender and Jan van Leeuwen. Simulations of large networks on smaller networks. Information and Control 71 (1986) 143-180.
• Hans L. Bodlaender and Jan van Leeuwen. The minimum bisection width of (three-dimensional) blocks. Technical Report RUU-CS-84-2, Department of Computer Science, Utrecht University, Utrecht, the Netherlands. 1984.
• Jan van Leeuwen, Hans L. Bodlaender, and Harry A. G. Wijshoff. Compositions of double diagonal and cross Latin squares. Nieuw Archief v. Wiskunde 4 (1984) 256-266.
• Hans L. Bodlaender. A solution to P33. EATCS Bulletin 21 (1983) 200-202.

Note: linked files are the technical report versions of papers. Journal versions are in general newer and improved versions: it is recommended for journal publications to look at the version in the journal. Of several papers, I have sufficient reprints received from the publisher, so email me if you want a reprint of a paper, published in a journal.