The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hans L. Bodlaender: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hans L. Bodlaender
    A linear time algorithm for finding tree-decompositions of small treewidth. [Citation Graph (3, 0)][DBLP]
    STOC, 1993, pp:226-234 [Conf]
  2. Hans L. Bodlaender
    A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. [Citation Graph (3, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:6, pp:1305-1317 [Journal]
  3. Hans L. Bodlaender
    Treewidth: Algorithmoc Techniques and Results. [Citation Graph (1, 0)][DBLP]
    MFCS, 1997, pp:19-36 [Conf]
  4. Hans L. Bodlaender
    NC-Algorithms for Graphs with Small Treewidth. [Citation Graph (1, 0)][DBLP]
    WG, 1988, pp:1-10 [Conf]
  5. Hans L. Bodlaender
    Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1990, v:11, n:4, pp:631-643 [Journal]
  6. Emgad H. Bachoore, Hans L. Bodlaender
    A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:255-266 [Conf]
  7. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Kernelization for Convex Recoloring. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:23-35 [Conf]
  8. Hans L. Bodlaender, Arie M. C. A. Koster
    Safe Seperators for Treewidth. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALC, 2004, pp:70-78 [Conf]
  9. Herman J. Haverkort, Hans L. Bodlaender
    Finding a minimal tree in a polygon with its medial axis. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  10. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
    Isomorphism for Graphs of Bounded Distance Width. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:276-287 [Conf]
  11. Hans L. Bodlaender, Babette de Fluiter
    Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:199-208 [Conf]
  12. Hans L. Bodlaender, Michael R. Fellows, Patricia A. Evans
    Finite-State Computability of Annotations of Strings and Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 1996, pp:384-391 [Conf]
  13. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    CPM, 1994, pp:15-30 [Conf]
  14. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
    Complexity Aspects of Map Compression. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1991, pp:287-296 [Conf]
  15. Hans L. Bodlaender, Frank van den Eijkhof, Linda C. van der Gaag
    On the Complexity of the MPA Problem in Probabilistic Networks. [Citation Graph (0, 0)][DBLP]
    ECAI, 2002, pp:675-679 [Conf]
  16. Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger
    Radio Labeling with Pre-assigned Frequencies. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:211-222 [Conf]
  17. Hans L. Bodlaender, Babette de Fluiter
    Parallel Algorithms for Series Parallel Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:277-289 [Conf]
  18. Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos
    On Exact Algorithms for Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:672-683 [Conf]
  19. Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster
    Treewidth Lower Bounds with Brambles. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:391-402 [Conf]
  20. Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle
    Contraction and Treewidth Lower Bounds. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:628-639 [Conf]
  21. Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin
    Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:95-106 [Conf]
  22. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:260-271 [Conf]
  23. Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch
    Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:508- [Conf]
  24. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:380-390 [Conf]
  25. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:61-72 [Conf]
  26. Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
    The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:58-67 [Conf]
  27. Alexander Grigoriev, Hans L. Bodlaender
    Algorithms for Graphs Embeddable with Few Crossings Per Edge. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:378-387 [Conf]
  28. H. N. de Ridder, Hans L. Bodlaender
    Graph Automorphisms with Maximal Projection Distances. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:204-214 [Conf]
  29. Hans L. Bodlaender
    New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors. [Citation Graph (0, 0)][DBLP]
    GI Jahrestagung, 1987, pp:82-88 [Conf]
  30. Hans L. Bodlaender
    Dynamic Programming on Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    ICALP, 1988, pp:105-118 [Conf]
  31. Hans L. Bodlaender, Babette de Fluiter
    Intervalizing k-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:87-98 [Conf]
  32. Hans L. Bodlaender, Michael R. Fellows, Tandy Warnow
    Two Strikes Against Perfect Phylogeny. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:273-283 [Conf]
  33. Hans L. Bodlaender, Torben Hagerup
    Parallel Algorithms with Optimal Speedup for Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    ICALP, 1995, pp:268-279 [Conf]
  34. Hans L. Bodlaender, Ton Kloks
    Better Algorithms for the Pathwidth and Treewidth of Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:544-555 [Conf]
  35. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:114-125 [Conf]
  36. Hans L. Bodlaender, Dimitrios M. Thilikos
    Constructive Linear Time Algorithms for Branchwidth. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:627-637 [Conf]
  37. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
    On Game-Theoretic Models of Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2001, pp:550-561 [Conf]
  38. Ton Kloks, Hans L. Bodlaender
    Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:116-125 [Conf]
  39. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:192-203 [Conf]
  40. Hans L. Bodlaender, Dimitrios M. Thilikos
    Computing Small Search Numbers in Linear Time. [Citation Graph (0, 0)][DBLP]
    IWPEC, 2004, pp:37-48 [Conf]
  41. Hans L. Bodlaender, Fedor V. Fomin
    Equitable Colorings of Bounded Treewidth Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:180-190 [Conf]
  42. Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
    Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. [Citation Graph (0, 0)][DBLP]
    MFCS, 2003, pp:239-248 [Conf]
  43. Hans L. Bodlaender, Torben Hagerup
    Tree Decompositions of Small Diameter. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:702-712 [Conf]
  44. Hans L. Bodlaender, Klaus Jansen
    On the Complexity of Scheduling Incompatible Jobs with Unit-Times. [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:291-300 [Conf]
  45. Hans L. Bodlaender, Jens Gustedt, Jan Arne Telle
    Linear-Time Register Allocation for a Fixed Number of Registers. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:574-583 [Conf]
  46. Irit Katriel, Hans L. Bodlaender
    Online topological ordering. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:443-450 [Conf]
  47. Hans L. Bodlaender
    Discovering Treewidth. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2005, pp:1-16 [Conf]
  48. Paul Beame, Hans L. Bodlaender
    Distributed Computing on TRansitive Networks: The Thorus. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:294-303 [Conf]
  49. Hans L. Bodlaender, Klaus Jansen
    On the Complexity of the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:769-780 [Conf]
  50. Hans L. Bodlaender, Ton Kloks
    A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:415-423 [Conf]
  51. Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
    lambda-Coloring of Graphs. [Citation Graph (0, 0)][DBLP]
    STACS, 2000, pp:395-406 [Conf]
  52. Hans L. Bodlaender, Jan van Leeuwen
    Simulation of Large Networks on Smaller Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 1985, pp:47-58 [Conf]
  53. Hans L. Bodlaender, Jan van Leeuwen
    New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. [Citation Graph (0, 0)][DBLP]
    STACS, 1986, pp:119-129 [Conf]
  54. Hans L. Bodlaender
    A Cubic Kernel for Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:320-331 [Conf]
  55. Jochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier
    Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:97-110 [Conf]
  56. Hans L. Bodlaender, Fedor V. Fomin
    Tree Decompositions with Small Cost. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:378-387 [Conf]
  57. Hans L. Bodlaender
    Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:223-232 [Conf]
  58. Hans L. Bodlaender, Rolf H. Möhring
    The Pathwidth and Treewidth of Cographs. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:301-309 [Conf]
  59. Hans L. Bodlaender, Udi Rotics
    Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:388-397 [Conf]
  60. Goos Kant, Hans L. Bodlaender
    Triangulating Planar Graphs While Minimizing the Maximum Degree. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:258-271 [Conf]
  61. Ton Kloks, Hans L. Bodlaender
    Testing Superperfection of k-Trees. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:292-303 [Conf]
  62. Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof, Linda C. van der Gaag
    Pre-processing for Triangulation of Probabilistic Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 2001, pp:32-39 [Conf]
  63. Hans L. Bodlaender
    On Linear Time Minor Tests and Depth First Search. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:577-590 [Conf]
  64. Goos Kant, Hans L. Bodlaender
    Planar Graph Augmentation Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:286-298 [Conf]
  65. Hans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle
    On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:69-82 [Conf]
  66. Emgad H. Bachoore, Hans L. Bodlaender
    New Upper Bound Heuristics for Treewidth. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:216-227 [Conf]
  67. Hans L. Bodlaender, Celina M. Herrera de Figueiredo, Marisa Gutierrez, Ton Kloks, Rolf Niedermeier
    Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:87-99 [Conf]
  68. Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender
    Degree-Based Treewidth Lower Bounds. [Citation Graph (0, 0)][DBLP]
    WEA, 2005, pp:101-112 [Conf]
  69. Hans L. Bodlaender
    Treewidth: Characterizations, Applications, and Computations. [Citation Graph (0, 0)][DBLP]
    WG, 2006, pp:1-14 [Conf]
  70. Hans L. Bodlaender
    Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:232-244 [Conf]
  71. Hans L. Bodlaender
    On the Complexity of Some Coloring Games. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:30-40 [Conf]
  72. Hans L. Bodlaender
    On Disjoint Cycles. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:230-238 [Conf]
  73. Hans L. Bodlaender
    Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:90-102 [Conf]
  74. Hans L. Bodlaender
    On Reduction Algorithms for Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:45-56 [Conf]
  75. Hans L. Bodlaender
    Dynamic Algorithms for Graphs with Treewidth 2. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:112-124 [Conf]
  76. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
    Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP]
    WG, 1992, pp:37-49 [Conf]
  77. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Ranking of Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:292-304 [Conf]
  78. Hans L. Bodlaender, Joost Engelfriet
    Domino Treewith (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1994, pp:1-13 [Conf]
  79. Hans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson
    Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. [Citation Graph (0, 0)][DBLP]
    WG, 1991, pp:1-12 [Conf]
  80. Hans L. Bodlaender, Arie M. C. A. Koster
    On the Maximum Cardinality Search Lower Bound for Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2004, pp:81-92 [Conf]
  81. Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen
    On Interval Routing Schemes and Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 1995, pp:181-196 [Conf]
  82. Frank van den Eijkhof, Hans L. Bodlaender
    Safe Reduction Rules for Weighted Treewidth. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:176-185 [Conf]
  83. Babette de Fluiter, Hans L. Bodlaender
    Parallel Algorithms for Treewidth Two. [Citation Graph (0, 0)][DBLP]
    WG, 1997, pp:157-170 [Conf]
  84. Fedor V. Fomin, Hans L. Bodlaender
    Approximation of Pathwidth of Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2001, pp:166-176 [Conf]
  85. Anneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen
    Improved Diameter Bounds for Altered Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:227-236 [Conf]
  86. Hans L. Bodlaender
    A Tourist Guide through Treewidth. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1993, v:11, n:1-2, pp:1-22 [Journal]
  87. Jochen Alber, Hans L. Bodlaender, Henning Fernau, Ton Kloks, Rolf Niedermeier
    Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:4, pp:461-493 [Journal]
  88. Hans L. Bodlaender
    Introduction. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2000, v:27, n:3, pp:209-211 [Journal]
  89. Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
    Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:29, n:4, pp:534-559 [Journal]
  90. Hans L. Bodlaender, Udi Rotics
    Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:36, n:4, pp:375-408 [Journal]
  91. Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos
    Isomorphism for Graphs of Bounded Distance Width. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:2, pp:105-127 [Journal]
  92. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
    Parameterized complexity analysis in computational biology. [Citation Graph (0, 0)][DBLP]
    Computer Applications in the Biosciences, 1995, v:11, n:1, pp:49-57 [Journal]
  93. Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen
    Approximations for lambda-Colorings of Graphs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2004, v:47, n:2, pp:193-204 [Journal]
  94. Hans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen
    Computational complexity of norm-maximization. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1990, v:10, n:2, pp:203-225 [Journal]
  95. Hans L. Bodlaender
    Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:54, n:2-3, pp:101-115 [Journal]
  96. Hans L. Bodlaender, Fedor V. Fomin
    Tree decompositions with small cost. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:145, n:2, pp:143-154 [Journal]
  97. Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
    On Intervalizing K-colored Graphs for DNA Physical Mapping. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:71, n:1-3, pp:55-77 [Journal]
  98. Hans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger
    Scheduling with Incompatible Jobs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:3, pp:219-232 [Journal]
  99. Hans L. Bodlaender, Dimitrios M. Thilikos
    Treewidth for Graphs with Small Chordality. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1997, v:79, n:1-3, pp:45-61 [Journal]
  100. Hans L. Bodlaender, Richard B. Tan, Jan van Leeuwen
    Finding a bigtriangleup-regular supergraph of minimum order. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:3-9 [Journal]
  101. Hans L. Bodlaender, Arie M. C. A. Koster
    Safe separators for treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:3, pp:337-350 [Journal]
  102. Hans L. Bodlaender
    A note on domino treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 1999, v:3, n:4, pp:141-150 [Journal]
  103. Hans L. Bodlaender
    Some Classes of Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:36, n:, pp:116-125 [Journal]
  104. Hans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov
    Relaxed Update and Partition Network Games. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:49, n:4, pp:301-312 [Journal]
  105. Hans L. Bodlaender
    The Complexity of Finding Uniform Emulations on Paths and Ring Networks [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:86, n:1, pp:87-106 [Journal]
  106. Hans L. Bodlaender, Babette van Antwerpen-de Fluiter
    Reduction Algorithms for Graphs of Small Treewidth. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2001, v:167, n:2, pp:86-119 [Journal]
  107. Hans L. Bodlaender, Jan van Leeuwen
    Simulation of Large Networks on Smaller Networks [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:71, n:3, pp:143-180 [Journal]
  108. Hans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos
    On Interval Routing Schemes and Treewidth. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:139, n:1, pp:92-109 [Journal]
  109. Hans L. Bodlaender, Shlomo Moran, Manfred K. Warmuth
    The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:108, n:1, pp:34-50 [Journal]
  110. Goos Kant, Hans L. Bodlaender
    Triangulating Planar Graphs while Minimizing the Maximum Degree. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:135, n:1, pp:1-14 [Journal]
  111. Hans L. Bodlaender
    On Disjoint Cycles. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1994, v:5, n:1, pp:59-68 [Journal]
  112. Hans L. Bodlaender
    On the Complexity of Some Coloring Games. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:133-147 [Journal]
  113. Hans Zantema, Hans L. Bodlaender
    Sizes of Ordered Decision Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2002, v:13, n:3, pp:445-458 [Journal]
  114. Hans Zantema, Hans L. Bodlaender
    Finding Small Equivalent Decision Trees is Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2000, v:11, n:2, pp:343-354 [Journal]
  115. Hans L. Bodlaender
    A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:6, pp:287-290 [Journal]
  116. Hans L. Bodlaender
    The Complexity of Finding Uniform Emulations on Fixed Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:29, n:3, pp:137-141 [Journal]
  117. Hans L. Bodlaender
    Achromatic Number is NP-Complete for Cographs and Interval Graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:3, pp:135-138 [Journal]
  118. Hans L. Bodlaender
    Achromatic number is NP-complete for cographs and interval graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:32, n:3, pp:135-138 [Journal]
  119. Hans L. Bodlaender, Gerard Tel
    Bit-Optimal Election in Synchronous Rings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:36, n:1, pp:53-56 [Journal]
  120. Hans L. Bodlaender, Dimitrios M. Thilikos, Koichi Yamazaki
    It is Hard to Know when Greedy is Good for Finding Independent Sets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:2, pp:101-111 [Journal]
  121. Dimitrios M. Thilikos, Hans L. Bodlaender
    Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1997, v:61, n:5, pp:227-232 [Journal]
  122. Hans L. Bodlaender
    On Linear Time Minor Tests with Depth-First Search. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:1, pp:1-23 [Journal]
  123. Hans L. Bodlaender, Joost Engelfriet
    Domino Treewidth. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:1, pp:94-123 [Journal]
  124. Hans L. Bodlaender, Fedor V. Fomin
    Approximation of pathwidth of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:2, pp:190-200 [Journal]
  125. Hans L. Bodlaender, John R. Gilbert, Hjálmtyr Hafsteinsson, Ton Kloks
    Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1995, v:18, n:2, pp:238-255 [Journal]
  126. Hans L. Bodlaender, Dieter Kratsch
    Kayles and Nimbers. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:43, n:1, pp:106-119 [Journal]
  127. Hans L. Bodlaender, Ton Kloks
    A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:15, n:1, pp:160-172 [Journal]
  128. Hans L. Bodlaender, Ton Kloks
    Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:2, pp:358-402 [Journal]
  129. Hans L. Bodlaender, Dimitrios M. Thilikos
    Graphs with Branchwidth at Most Three. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1999, v:32, n:2, pp:167-194 [Journal]
  130. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Cutwidth I: A linear time fixed parameter algorithm. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:1-24 [Journal]
  131. Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender
    Cutwidth II: Algorithms for partial w-trees of bounded degree. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2005, v:56, n:1, pp:25-49 [Journal]
  132. Hans L. Bodlaender
    Necessary Edges in k-Chordalisations of Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:3, pp:283-290 [Journal]
  133. Hans L. Bodlaender
    Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:42, n:1, pp:97-118 [Journal]
  134. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch, Haiko Müller
    Treewidth and Minimum Fill-in on d-Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  135. Hans L. Bodlaender, Gerard Tel
    A Note on Rectilinearity and Angular Resolution. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2004, v:8, n:, pp:89-94 [Journal]
  136. Hans L. Bodlaender
    The Classification of Coverings of Processor Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1989, v:6, n:1, pp:166-182 [Journal]
  137. Hans L. Bodlaender
    A Generic NP-hardness Proof for a Variant of Graph Coloring. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:12, pp:1114-1124 [Journal]
  138. Hans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks
    Complexity Aspects of Two-Dimensional Data Compression. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:4, pp:462-495 [Journal]
  139. Hans L. Bodlaender, Klaus Jansen
    On the Complexity of the Maximum Cut Problem. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:1, pp:14-31 [Journal]
  140. Hans L. Bodlaender, Jan Arne Telle
    Space-Efficient Construction Variants of Dynamic Programming. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2004, v:11, n:4, pp:374-385 [Journal]
  141. Hans L. Bodlaender, Gerard Tel, Nicola Santoro
    Trade-Offs in Non-Reversing Diameter. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:1, pp:111-134 [Journal]
  142. Hans L. Bodlaender, Torben Hagerup
    Parallel Algorithms with Optimal Speedup for Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1725-1746 [Journal]
  143. Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza
    Rankings of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1998, v:11, n:1, pp:168-181 [Journal]
  144. Hans L. Bodlaender, Ton Kloks, Dieter Kratsch
    Treewidth and Pathwidth of Permutation Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:4, pp:606-616 [Journal]
  145. Hans L. Bodlaender, Rolf H. Möhring
    The Pathwidth and Treewidth of Cographs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:2, pp:181-188 [Journal]
  146. Irit Katriel, Hans L. Bodlaender
    Online topological ordering. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2006, v:2, n:3, pp:364-379 [Journal]
  147. Hans L. Bodlaender
    New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:81, n:2, pp:237-256 [Journal]
  148. Hans L. Bodlaender
    Complexity of Path-Forming Games. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:110, n:1, pp:215-245 [Journal]
  149. Hans L. Bodlaender
    A Partial k-Arboretum of Graphs with Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:209, n:1-2, pp:1-45 [Journal]
  150. Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad
    On algorithms for (P5, gem)-free graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:2-21 [Journal]
  151. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
    The Parameterized Complexity of Sequence Alignment and Consensus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:31-54 [Journal]
  152. Hans L. Bodlaender, Fedor V. Fomin
    Equitable colorings of bounded treewidth graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:22-30 [Journal]
  153. Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy Warnow
    The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:167-188 [Journal]
  154. Hans L. Bodlaender, Klaus Jansen
    Restrictions of Graph Partition Problems. Part I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:148, n:1, pp:93-109 [Journal]
  155. Hans L. Bodlaender, Dieter Kratsch
    The Complexity of Coloring Games on Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:106, n:2, pp:309-326 [Journal]
  156. Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
    Quadratic Kernelization for Convex Recoloring of Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:86-96 [Conf]
  157. Johan Kwisthout, Hans L. Bodlaender, Gerard Tel
    Local Monotonicity in Probabilistic Networks. [Citation Graph (0, 0)][DBLP]
    ECSQARU, 2007, pp:548-559 [Conf]
  158. Hans L. Bodlaender
    Treewidth: Structure and Algorithms. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2007, pp:11-25 [Conf]
  159. Linda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders
    Monotonicity in Bayesian Networks. [Citation Graph (0, 0)][DBLP]
    UAI, 2004, pp:569-576 [Conf]
  160. Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel
    Wooden Geometric Puzzles: Design and Hardness Proofs. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:16-29 [Conf]
  161. Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster
    Safe Reduction Rules for Weighted Treewidth. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2007, v:47, n:2, pp:139-158 [Journal]
  162. Hans L. Bodlaender, Arie M. C. A. Koster
    On the maximum cardinality search lower bound for treewidth. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:11, pp:1348-1372 [Journal]

  163. The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks. [Citation Graph (, )][DBLP]


  164. Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. [Citation Graph (, )][DBLP]


  165. Kernel Bounds for Disjoint Cycles and Disjoint Paths. [Citation Graph (, )][DBLP]


  166. (Meta) Kernelization. [Citation Graph (, )][DBLP]


  167. On Problems without Polynomial Kernels (Extended Abstract). [Citation Graph (, )][DBLP]


  168. Faster Parameterized Algorithms for Minimum Fill-In. [Citation Graph (, )][DBLP]


  169. Weighted Treewidth Algorithmic Techniques and Results. [Citation Graph (, )][DBLP]


  170. A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. [Citation Graph (, )][DBLP]


  171. Kernelization: New Upper and Lower Bound Techniques. [Citation Graph (, )][DBLP]


  172. Exact Algorithms for Edge Domination. [Citation Graph (, )][DBLP]


  173. A Linear Kernel for Planar Feedback Vertex Set. [Citation Graph (, )][DBLP]


  174. Planar Capacitated Dominating Set Is W[1]-Hard. [Citation Graph (, )][DBLP]


  175. Clustering with Partial Information. [Citation Graph (, )][DBLP]


  176. Faster Algorithms on Branch and Clique Decompositions. [Citation Graph (, )][DBLP]


  177. A Kernel for Convex Recoloring of Weighted Forests. [Citation Graph (, )][DBLP]


  178. Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. [Citation Graph (, )][DBLP]


  179. Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. [Citation Graph (, )][DBLP]


  180. The Valve Location Problem in Simple Network Topologies. [Citation Graph (, )][DBLP]


  181. The valve location problem. [Citation Graph (, )][DBLP]


  182. Algorithms for Graphs Embeddable with Few Crossings per Edge. [Citation Graph (, )][DBLP]


  183. Treewidth Lower Bounds with Brambles. [Citation Graph (, )][DBLP]


  184. Preprocessing Rules for Triangulation of Probabilistic Networks. [Citation Graph (, )][DBLP]


  185. Combinatorial Optimization on Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]


  186. On the minimum corridor connection problem and other generalized geometric problems. [Citation Graph (, )][DBLP]


  187. Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set [Citation Graph (, )][DBLP]


  188. (Meta) Kernelization [Citation Graph (, )][DBLP]


Search in 0.076secs, Finished in 0.081secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002