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

Hans L. Bodlaender Home Page Coauthor index pubzone.org

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

DBLP keys2012
228Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen: Parameterized Complexity of the Spanning Tree Congestion Problem. Algorithmica 64(1): 85-111 (2012)
227Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger: Scheduling of pipelined operator graphs. J. Scheduling 15(3): 323-332 (2012)
226Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: A Note on Exact Algorithms for Vertex Ordering Problems on Graphs. Theory Comput. Syst. 50(3): 420-432 (2012)
2011
225Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLinda C. van der Gaag, Hans L. Bodlaender: On Stopping Evidence Gathering for Diagnostic Bayesian Networks. ECSQARU 2011: 170-181
224Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ICALP (1) 2011: 437-448
223Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems. IPEC 2011: 145-158
222Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag: The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks. SOFSEM 2011: 356-367
221Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArnold Overwijk, Eelko Penninkx, Hans L. Bodlaender: A Local Search Algorithm for Branchwidth. SOFSEM 2011: 444-454
220Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender: Partition into Triangles on Bounded Degree Graphs. SOFSEM 2011: 558-569
219Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds. STACS 2011: 165-176
218Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBart M. P. Jansen, Hans L. Bodlaender: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. STACS 2011: 177-188
217Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Johan M. M. van Rooij: Exact Algorithms for Intervalizing Colored Graphs. TAPAS 2011: 45-56
216Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dieter Kratsch: Exact Algorithms for Kayles. WG 2011: 59-70
215Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Quadratic Kernelization for Convex Recoloring of Trees. Algorithmica 61(2): 362-388 (2011)
214Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-in. Algorithmica 61(4): 817-838 (2011)
213Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization CoRR abs/1104.4217: (2011)
212Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Kernel Bounds for Path and Cycle Problems CoRR abs/1106.4141: (2011)
211Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan M. M. van Rooij, Hans L. Bodlaender: Exact algorithms for dominating set. Discrete Applied Mathematics 159(17): 2147-2164 (2011)
210Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi: Spanning tree congestion of k-outerplanar graphs. Discrete Mathematics 311(12): 1040-1045 (2011)
209Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations II. Lower bounds. Inf. Comput. 209(7): 1103-1119 (2011)
208Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel bounds for disjoint cycles and disjoint paths. Theor. Comput. Sci. 412(35): 4570-4578 (2011)
2010
207Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag: The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks. ECAI 2010: 237-242
206Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle: Faster Algorithms on Branch and Clique Decompositions. MFCS 2010: 174-185
205Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Marc Comas: A Kernel for Convex Recoloring of Weighted Forests. SOFSEM 2010: 212-223
204Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLYota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen: Complexity Results for the Spanning Tree Congestion Problem. WG 2010: 3-14
203Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica 58(3): 790-810 (2010)
202Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch: Cross-Composition: A New Technique for Kernelization Lower Bounds CoRR abs/1011.4224: (2010)
201Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBart M. P. Jansen, Hans L. Bodlaender: Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter CoRR abs/1012.4701: (2010)
200Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva: The Valve Location Problem in Simple Network Topologies. INFORMS Journal on Computing 22(3): 433-442 (2010)
199Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster: Treewidth computations I. Upper bounds. Inf. Comput. 208(3): 259-275 (2010)
198Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with partial information. Theor. Comput. Sci. 411(7-9): 1202-1211 (2010)
197Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Thomas C. van Dijk: A Cubic Kernel for Feedback Vertex Set and Loop Cutset. Theory Comput. Syst. 46(3): 566-597 (2010)
2009
196Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith: Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. ESA 2009: 566-577
195Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Stéphan Thomassé, Anders Yeo: Kernel Bounds for Disjoint Cycles and Disjoint Paths. ESA 2009: 635-646
194Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization. FOCS 2009: 629-638
193Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Kernelization: New Upper and Lower Bound Techniques. IWPEC 2009: 17-37
192Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx: Planar Capacitated Dominating Set Is W[1]-Hard. IWPEC 2009: 50-60
191Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos: (Meta) Kernelization CoRR abs/0904.0727: (2009)
190Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Corinne Feremans, Alexander Grigoriev, Eelko Penninkx, René Sitters, Thomas Wolle: On the minimum corridor connection problem and other generalized geometric problems. Comput. Geom. 42(9): 939-951 (2009)
189Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
188Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009)
187Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel: Wooden Geometric Puzzles: Design and Hardness Proofs. Theory Comput. Syst. 44(2): 160-174 (2009)
2008
186Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
185Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Pinar Heggernes, Yngve Villanger: Faster Parameterized Algorithms for Minimum Fill-In. ISAAC 2008: 282-293
184Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Eelko Penninkx, Richard B. Tan: A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. ISAAC 2008: 306-317
183Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Eelko Penninkx: A Linear Kernel for Planar Feedback Vertex Set. IWPEC 2008: 160-171
182Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan M. M. van Rooij, Hans L. Bodlaender: Exact Algorithms for Edge Domination. IWPEC 2008: 214-225
181Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond: Clustering with Partial Information. MFCS 2008: 144-155
180Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan M. M. van Rooij, Hans L. Bodlaender: Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. STACS 2008: 657-668
179Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
178Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks: The Valve Location Problem in Simple Network Topologies. WG 2008: 55-65
177Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Treewidth of Graphs. Encyclopedia of Algorithms 2008
176Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. Algorithmica 51(1): 81-98 (2008)
175Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan M. M. van Rooij, Hans L. Bodlaender: Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set CoRR abs/0802.2827: (2008)
174Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster: Combinatorial Optimization on Graphs of Bounded Treewidth. Comput. J. 51(3): 255-269 (2008)
2007
173Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
172no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks: The valve location problem. CTW 2007: 13-16
171Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJohan Kwisthout, Hans L. Bodlaender, Gerard Tel: Local Monotonicity in Probabilistic Networks. ECSQARU 2007: 548-559
170Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel: Wooden Geometric Puzzles: Design and Hardness Proofs. FUN 2007: 16-29
169Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmgad H. Bachoore, Hans L. Bodlaender: Weighted Treewidth Algorithmic Techniques and Results. ISAAC 2007: 893-903
168Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Treewidth: Structure and Algorithms. SIROCCO 2007: 11-25
167Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A Cubic Kernel for Feedback Vertex Set. STACS 2007: 320-331
166Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster: Safe Reduction Rules for Weighted Treewidth. Algorithmica 47(2): 139-158 (2007)
165Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Grigoriev, Hans L. Bodlaender: Algorithms for Graphs Embeddable with Few Crossings per Edge. Algorithmica 49(1): 1-11 (2007)
164Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
163no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael A. Langston: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings Springer 2006
162Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmgad H. Bachoore, Hans L. Bodlaender: A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. AAIM 2006: 255-266
161no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer: Kernelization for Convex Recoloring. ACiD 2006: 23-35
160Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos: On Exact Algorithms for Treewidth. ESA 2006: 672-683
159Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
158Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Treewidth: Characterizations, Applications, and Computations. WG 2006: 1-14
157Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrit Katriel, Hans L. Bodlaender: Online topological ordering. ACM Transactions on Algorithms 2(3): 364-379 (2006)
156Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster: Safe separators for treewidth. Discrete Mathematics 306(3): 337-350 (2006)
155Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster: Contraction and Treewidth Lower Bounds. J. Graph Algorithms Appl. 10(1): 5-49 (2006)
2005
154Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster: Treewidth Lower Bounds with Brambles. ESA 2005: 391-402
153Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. ESA 2005: 95-106
152Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAlexander Grigoriev, Hans L. Bodlaender: Algorithms for Graphs Embeddable with Few Crossings Per Edge. FCT 2005: 378-387
151Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIrit Katriel, Hans L. Bodlaender: Online topological ordering. SODA 2005: 443-450
150Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Discovering Treewidth. SOFSEM 2005: 1-16
149Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender: Degree-Based Treewidth Lower Bounds. WEA 2005: 101-112
148Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLEmgad H. Bachoore, Hans L. Bodlaender: New Upper Bound Heuristics for Treewidth. WEA 2005: 216-227
147Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof: Preprocessing Rules for Triangulation of Probabilistic Networks. Computational Intelligence 21(3): 286-305 (2005)
146Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin: Tree decompositions with small cost. Discrete Applied Mathematics 145(2): 143-154 (2005)
145Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Cutwidth I: A linear time fixed parameter algorithm. J. Algorithms 56(1): 1-24 (2005)
144Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitrios 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)
143Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
142Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin: Equitable colorings of bounded treewidth graphs. Theor. Comput. Sci. 349(1): 22-30 (2005)
2004
141no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster: Safe Seperators for Treewidth. ALENEX/ANALC 2004: 70-78
140Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle: Contraction and Treewidth Lower Bounds. ESA 2004: 628-639
139Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dimitrios M. Thilikos: Computing Small Search Numbers in Linear Time. IWPEC 2004: 37-48
138Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin: Equitable Colorings of Bounded Treewidth Graphs. MFCS 2004: 180-190
137Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLinda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders: Monotonicity in Bayesian Networks. UAI 2004: 569-576
136Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
135Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Arie M. C. A. Koster: On the Maximum Cardinality Search Lower Bound for Treewidth. WG 2004: 81-92
134Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: Approximations for lambda-Colorings of Graphs. Comput. J. 47(2): 193-204 (2004)
133Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Gerard Tel: A Note on Rectilinearity and Angular Resolution. J. Graph Algorithms Appl. 8: 89-94 (2004)
132no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jan Arne Telle: Space-Efficient Construction Variants of Dynamic Programming. Nord. J. Comput. 11(4): 374-385 (2004)
131Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Preassigned Frequencies. SIAM Journal on Optimization 15(1): 1-16 (2004)
2003
130no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers Springer 2003
129Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
128Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos: Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. MFCS 2003: 239-248
127Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003)
126Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Richard B. Tan, Jan van Leeuwen: Finding a bigtriangleup-regular supergraph of minimum order. Discrete Applied Mathematics 131(1): 3-9 (2003)
125Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Necessary Edges in k-Chordalisations of Graphs. J. Comb. Optim. 7(3): 283-290 (2003)
2002
124no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
123Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger: Radio Labeling with Pre-assigned Frequencies. ESA 2002: 211-222
122Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin: Tree Decompositions with Small Cost. SWAT 2002: 378-387
121Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397
120Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFrank van den Eijkhof, Hans L. Bodlaender: Safe Reduction Rules for Weighted Treewidth. WG 2002: 176-185
119Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen 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)
118Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: Relaxed Update and Partition Network Games. Fundam. Inform. 49(4): 301-312 (2002)
117Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Zantema, Hans L. Bodlaender: Sizes of Ordered Decision Trees. Int. J. Found. Comput. Sci. 13(3): 445-458 (2002)
116Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dieter Kratsch: Kayles and Nimbers. J. Algorithms 43(1): 106-119 (2002)
115Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Fedor V. Fomin: Approximation of pathwidth of outerplanar graphs. J. Algorithms 43(2): 190-200 (2002)
2001
114Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitrios 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
113Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael J. Dinneen, Bakhadyr Khoussainov: On Game-Theoretic Models of Networks. ISAAC 2001: 550-561
112Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
111Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFedor V. Fomin, Hans L. Bodlaender: Approximation of Pathwidth of Outerplanar Graphs. WG 2001: 166-176
110Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Babette van Antwerpen-de Fluiter: Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two. Algorithmica 29(4): 534-559 (2001)
109Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLArie M. C. A. Koster, Hans L. Bodlaender, Stan P. M. van Hoesel: Treewidth: Computational Experiments. Electronic Notes in Discrete Mathematics 8: 54-57 (2001)
108Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Babette van Antwerpen-de Fluiter: Reduction Algorithms for Graphs of Small Treewidth. Inf. Comput. 167(2): 86-119 (2001)
107Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A Generic NP-hardness Proof for a Variant of Graph Coloring. J. UCS 7(12): 1114-1124 (2001)
2000
106Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender: Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width. ISAAC 2000: 192-203
105Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen: lambda-Coloring of Graphs. STACS 2000: 395-406
104Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJochen Alber, Hans L. Bodlaender, Henning Fernau, Rolf Niedermeier: Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems. SWAT 2000: 97-110
103Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Introduction. Algorithmica 27(3): 209-211 (2000)
102Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: The algorithmic theory of treewidth. Electronic Notes in Discrete Mathematics 5: 27-30 (2000)
101no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans Zantema, Hans L. Bodlaender: Finding Small Equivalent Decision Trees is Hard. Int. J. Found. Comput. Sci. 11(2): 343-354 (2000)
100no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen: On the Complexity of the Maximum Cut Problem. Nord. J. Comput. 7(1): 14-31 (2000)
99Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
98Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Hans L. Bodlaender: Finding a minimal tree in a polygon with its medial axis. CCCG 1999
97Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLH. N. de Ridder, Hans L. Bodlaender: Graph Automorphisms with Maximal Projection Distances. FCT 1999: 204-214
96Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKoichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. Algorithmica 24(2): 105-127 (1999)
95Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A note on domino treewidth. Discrete Mathematics & Theoretical Computer Science 3(4): 141-150 (1999)
94Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
93Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dimitrios M. Thilikos: Graphs with Branchwidth at Most Three. J. Algorithms 32(2): 167-194 (1999)
1998
92Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Torben Hagerup: Tree Decompositions of Small Diameter. MFCS 1998: 702-712
91Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jens Gustedt, Jan Arne Telle: Linear-Time Register Allocation for a Fixed Number of Registers. SODA 1998: 574-583
90Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
89Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Torben Hagerup: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. SIAM J. Comput. 27(6): 1725-1746 (1998)
88Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
87Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209(1-2): 1-45 (1998)
1997
86Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKoichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos: Isomorphism for Graphs of Bounded Distance Width. CIAC 1997: 276-287
85Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dimitrios M. Thilikos: Constructive Linear Time Algorithms for Branchwidth. ICALP 1997: 627-637
84Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Treewidth: Algorithmoc Techniques and Results. MFCS 1997: 19-36
83Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBabette de Fluiter, Hans L. Bodlaender: Parallel Algorithms for Treewidth Two. WG 1997: 157-170
82Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dimitrios M. Thilikos: Treewidth for Graphs with Small Chordality. Discrete Applied Mathematics 79(1-3): 45-61 (1997)
81Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGoos Kant, Hans L. Bodlaender: Triangulating Planar Graphs while Minimizing the Maximum Degree. Inf. Comput. 135(1): 1-14 (1997)
80Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jan van Leeuwen, Richard B. Tan, Dimitrios M. Thilikos: On Interval Routing Schemes and Treewidth. Inf. Comput. 139(1): 92-109 (1997)
79Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
78Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDimitrios 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)
77Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Joost Engelfriet: Domino Treewidth. J. Algorithms 24(1): 94-123 (1997)
1996
76Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Babette de Fluiter: Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth. COCOON 1996: 199-208
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Patricia A. Evans: Finite-State Computability of Annotations of Strings and Trees. CPM 1996: 384-391
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Babette de Fluiter: Parallel Algorithms for Series Parallel Graphs. ESA 1996: 277-289
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs. J. Algorithms 21(2): 358-402 (1996)
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6): 1305-1317 (1996)
1995
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Torben Hagerup: Parallel Algorithms with Optimal Speedup for Bounded Treewidth. ICALP 1995: 268-279
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Babette de Fluiter: Intervalizing k-Colored Graphs. ICALP 1995: 87-98
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen: On Interval Routing Schemes and Treewidth. WG 1995: 181-196
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
65no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Two-Dimensional Data Compression. Nord. J. Comput. 2(4): 462-495 (1995)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. SIAM J. Discrete Math. 8(4): 606-616 (1995)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen: Restrictions of Graph Partition Problems. Part I. Theor. Comput. Sci. 148(1): 93-109 (1995)
1994
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30
60no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTon 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
59Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen: On the Complexity of the Maximum Cut Problem. STACS 1994: 769-780
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Joost Engelfriet: Domino Treewith (Extended Abstract). WG 1994: 1-13
57Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza: Ranking of Graphs. WG 1994: 292-304
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Improved Self-reduction Algorithms for Graphs with Bounded Treewidth. Discrete Applied Mathematics 54(2-3): 101-115 (1994)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. Discrete Applied Mathematics 55(3): 219-232 (1994)
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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)
53no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On Disjoint Cycles. Int. J. Found. Comput. Sci. 5(1): 59-68 (1994)
52no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Gerard Tel, Nicola Santoro: Trade-Offs in Non-Reversing Diameter. Nord. J. Comput. 1(1): 111-134 (1994)
1993
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTon 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
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks, Dieter Kratsch: Treewidth and Pathwidth of Permutation Graphs. ICALP 1993: 114-125
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen: On the Complexity of Scheduling Incompatible Jobs with Unit-Times. MFCS 1993: 291-300
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A linear time algorithm for finding tree-decompositions of small treewidth. STOC 1993: 226-234
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Dynamic Algorithms for Graphs with Treewidth 2. WG 1993: 112-124
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On Reduction Algorithms for Graphs with Small Treewidth. WG 1993: 45-56
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A Tourist Guide through Treewidth. Acta Cybern. 11(1-2): 1-22 (1993)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On Linear Time Minor Tests with Depth-First Search. J. Algorithms 14(1): 1-23 (1993)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. J. Algorithms 15(1): 160-172 (1993)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rolf H. Möhring: The Pathwidth and Treewidth of Cographs. SIAM J. Discrete Math. 6(2): 181-188 (1993)
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Complexity of Path-Forming Games. Theor. Comput. Sci. 110(1): 215-245 (1993)
1992
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Michael R. Fellows, Tandy Warnow: Two Strikes Against Perfect Phylogeny. ICALP 1992: 273-283
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTon Kloks, Hans L. Bodlaender: Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. ISAAC 1992: 116-125
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks: A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs. STACS 1992: 415-423
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGoos Kant, Hans L. Bodlaender: Triangulating Planar Graphs While Minimizing the Maximum Degree. SWAT 1992: 258-271
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTon Kloks, Hans L. Bodlaender: Testing Superperfection of k-Trees. SWAT 1992: 292-303
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs. WG 1992: 37-49
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. WG 1992: 90-102
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Dieter Kratsch: The Complexity of Coloring Games on Perfect Graphs. Theor. Comput. Sci. 106(2): 309-326 (1992)
32no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Klaus Jansen, Gerhard J. Woeginger: Scheduling with Incompatible Jobs Universität Trier, Mathematik/Informatik, Forschungsbericht 92-09: (1992)
1991
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Teofilo F. Gonzalez, Ton Kloks: Complexity Aspects of Map Compression. Data Compression Conference 1991: 287-296
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Ton Kloks: Better Algorithms for the Pathwidth and Treewidth of Graphs. ICALP 1991: 544-555
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGoos Kant, Hans L. Bodlaender: Planar Graph Augmentation Problems (Extended Abstract). WADS 1991: 286-298
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, John R. Gilbert, Ton Kloks, Hjálmtyr Hafsteinsson: Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height. WG 1991: 1-12
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On Disjoint Cycles. WG 1991: 230-238
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On the Complexity of Some Coloring Games. Int. J. Found. Comput. Sci. 2(2): 133-147 (1991)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors. J. Comput. Syst. Sci. 42(1): 97-118 (1991)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Rolf H. Möhring: The Pathwidth and Treewidth of Cographs. SWAT 1990: 301-309
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On the Complexity of Some Coloring Games. WG 1990: 30-40
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Peter Gritzmann, Victor Klee, Jan van Leeuwen: Computational complexity of norm-maximization. Combinatorica 10(2): 203-225 (1990)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: The Complexity of Finding Uniform Emulations on Paths and Ring Networks Inf. Comput. 86(1): 87-106 (1990)
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Gerard Tel: Bit-Optimal Election in Synchronous Rings. Inf. Process. Lett. 36(1): 53-56 (1990)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. J. Algorithms 11(4): 631-643 (1990)
1989
17no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans 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
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPaul Beame, Hans L. Bodlaender: Distributed Computing on TRansitive Networks: The Thorus. STACS 1989: 294-303
15no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: On Linear Time Minor Tests and Depth First Search. WADS 1989: 577-590
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. WG 1989: 232-244
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Achromatic Number is NP-Complete for Cographs and Interval Graphs. Inf. Process. Lett. 31(3): 135-138 (1989)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: The Classification of Coverings of Processor Networks. J. Parallel Distrib. Comput. 6(1): 166-182 (1989)
1988
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Dynamic Programming on Graphs with Bounded Treewidth. ICALP 1988: 105-118
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. SWAT 1988: 223-232
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: NC-Algorithms for Graphs with Small Treewidth. WG 1988: 1-10
8no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: Some Classes of Graphs with Bounded Treewidth. Bulletin of the EATCS 36: 116-125 (1988)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors. Inf. Process. Lett. 27(6): 287-290 (1988)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: The Complexity of Finding Uniform Emulations on Fixed Graphs. Inf. Process. Lett. 29(3): 137-141 (1988)
1987
5no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender: New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors. GI Jahrestagung 1987: 82-88
1986
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jan van Leeuwen: New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. STACS 1986: 119-129
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAnneke A. Schoone, Hans L. Bodlaender, Jan van Leeuwen: Improved Diameter Bounds for Altered Graphs. WG 1986: 227-236
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jan van Leeuwen: Simulation of Large Networks on Smaller Networks Information and Control 71(3): 143-180 (1986)
1985
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHans L. Bodlaender, Jan van Leeuwen: Simulation of Large Networks on Smaller Networks. STACS 1985: 47-58

Coauthor Index

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

Colors in the list of coauthors

Home | Conferences | Journals | Series | FAQ — Search: Faceted | Free | Complete | Author
Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — This material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page