dblp.uni-trier.dewww.uni-trier.de

Hans L. Bodlaender Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

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

Coauthor Index

1Jochen Alber [105] [120]
2Helmut Alt [169]
3Emgad H. Bachoore [147] [161] [168]
4Paul Beame [17]
5Andreas Brandstädt [130] [143]
6Hajo Broersma (H. J. Broersma) [124]
7Jitender S. Deogun [58] [89]
8Thomas C. van Dijk [178]
9Michael J. Dinneen [114] [119]
10Frederic Dorn [152]
11Rodney G. Downey (Rod Downey) [62] [64] [68] [185]
12Frank van den Eijkhof [113] [121] [125] [165]
13Joost Engelfriet [59] [78]
14Patricia A. Evans [76]
15A. J. Feelders (Ad Feelders) [137]
16Michael R. Fellows (Mike Fellows) [41] [62] [64] [68] [76] [100] [129] [160] [172] [180] [185] [186]
17Corinne Feremans [158]
18Henning Fernau [105] [120]
19Celina M. Herrera de Figueiredo [136]
20Babette van Antwerpen-de Fluiter (Babette de Fluiter) [70] [74] [75] [77] [84] [87] [97] [109] [111]
21Fedor V. Fomin [112] [116] [123] [124] [138] [142] [146] [152] [159] [187]
22Linda C. van der Gaag [113] [125] [137]
23John R. Gilbert [29] [67]
24Teofilo F. Gonzalez [32] [66]
25Alexander Grigoriev [151] [153] [158] [164] [171] [175] [177]
26Nadejda V. Grigorieva [171] [177]
27Peter Gritzmann [22]
28Jens Gustedt [92]
29Marisa Gutierrez [136]
30Hjálmtyr Hafsteinsson [29] [67]
31Torben Hagerup [71] [90] [93]
32Michael T. Hallett [68] [100]
33Herman J. Haverkort [99]
34Pinar Heggernes [180] [184]
35Albert Hendriks [171] [177]
36Danny Hermelin [185]
37Stan P. M. van Hoesel (C. P. M. van Hoesel) [110]
38Klaus Jansen [33] [36] [50] [56] [58] [60] [63] [89] [101]
39Goos Kant [30] [38] [82]
40Irit Katriel [150] [156]
41Bakhadyr Khoussainov [114] [119]
42Victor Klee [22]
43Ton Kloks (Antonius J. J. Kloks) [29] [31] [32] [37] [39] [40] [44] [51] [52] [58] [61] [65] [66] [67] [73] [89] [91] [95] [106] [120] [134] [136]
44Arie M. C. A. Koster [110] [113] [135] [140] [141] [148] [153] [154] [155] [159] [163] [165] [173] [175]
45Dieter Kratsch [34] [51] [52] [58] [61] [65] [89] [91] [117] [130] [143] [159]
46Marc J. van Kreveld [169]
47Johan Kwisthout [170]
48Michael A. Langston [160] [162] [172]
49Jan van Leeuwen [1] [2] [3] [4] [22] [69] [81] [106] [127] [134] [178]
50Daniel Lokshtanov [187]
51Federico Mancini [180]
52Rolf H. Möhring [24] [43]
53Shlomo Moran [18] [55]
54Haiko Müller [52] [58] [61] [89] [91]
55Rolf Niedermeier [95] [105] [120] [136]
56Charis Papadopoulos [180]
57Eelko Penninkx [152] [158] [182] [183] [187]
58Artem V. Pyatkin [124]
59Mark A. Ragan [160] [172]
60Michaël Rao [130] [143]
61H. N. de Ridder [98]
62Johan M. M. van Rooij [174] [179] [181] [189]
63Frances A. Rosamond [160] [172] [180]
64Peter Rossmanith [189]
65Günter Rote [169]
66Udi Rotics [122] [128]
67Nicola Santoro [53]
68Saket Saurabh [187]
69Anneke A. Schoone [3]
70Maria J. Serna [107] [115] [144] [145]
71René Sitters (René A. Sitters) [158]
72Jeremy Spinrad [130] [143]
73Richard B. Tan [69] [81] [106] [127] [134] [178] [183]
74Gerard Tel [20] [53] [133] [169] [170]
75Jan Arne Telle [92] [132]
76Dimitrios M. Thilikos [69] [79] [80] [81] [83] [86] [87] [94] [97] [107] [115] [129] [139] [144] [145] [159] [186] [187]
77Stéphan Thomassé [188]
78Zsolt Tuza [58] [89]
79Yngve Villanger [184]
80Todd Wareham (Harold T. Wareham) [62] [64] [68] [100]
81Manfred K. Warmuth [18] [55]
82Tandy Warnow [41] [100]
83Mark Weyer [160] [172]
84Gerhard J. Woeginger [33] [36] [56] [124]
85Thomas Wolle [140] [148] [154] [158]
86Koichi Yamazaki [80] [87] [97]
87Anders Yeo [188]
88Hans Zantema [102] [118]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)