| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen |
Parameterized Complexity of the Spanning Tree Congestion Problem.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Petra Schuurman, Gerhard J. Woeginger |
Scheduling of pipelined operator graphs. |
J. Scheduling |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans 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. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo |
Kernel bounds for disjoint cycles and disjoint paths. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Kyohei Kozawa, Takayoshi Matsushima, Yota Otachi |
Spanning tree congestion of k-outerplanar graphs. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
Quadratic Kernelization for Convex Recoloring of Trees. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
Faster Parameterized Algorithms for Minimum Fill-in. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Treewidth computations II. Lower bounds. |
Inf. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Kernel Bounds for Path and Cycle Problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender |
Exact algorithms for dominating set. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Dieter Kratsch |
Exact Algorithms for Kayles. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. |
ICALP |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Linda C. van der Gaag, Hans L. Bodlaender |
On Stopping Evidence Gathering for Diagnostic Bayesian Networks. |
ECSQARU |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Kernel Bounds for Path and Cycle Problems. |
IPEC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Hans L. Bodlaender |
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Cross-Composition: A New Technique for Kernelization Lower Bounds. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Johan M. M. van Rooij |
Exact Algorithms for Intervalizing Colored Graphs. |
TAPAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnold Overwijk, Eelko Penninkx, Hans L. Bodlaender |
A Local Search Algorithm for Branchwidth. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Marcel E. van Kooten Niekerk, Hans L. Bodlaender |
Partition into Triangles on Bounded Degree Graphs. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag |
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks. |
SOFSEM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
Clustering with partial information. |
Theor. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Treewidth computations I. Upper bounds. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Cross-Composition: A New Technique for Kernelization Lower Bounds |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Bart M. P. Jansen, Hans L. Bodlaender |
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Thomas C. van Dijk |
A Cubic Kernel for Feedback Vertex Set and Loop Cutset. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Albert Hendriks, Alexander Grigoriev, Nadejda V. Grigorieva |
The Valve Location Problem in Simple Network Topologies. |
INFORMS Journal on Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
Complexity Results for the Spanning Tree Congestion Problem. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Kwisthout, Hans L. Bodlaender, Linda C. van der Gaag |
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks. |
ECAI |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Erik Jan van Leeuwen, Johan M. M. van Rooij, Martin Vatshelle |
Faster Algorithms on Branch and Clique Decompositions. |
MFCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Marc Comas |
A Kernel for Convex Recoloring of Weighted Forests. |
SOFSEM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
(Meta) Kernelization |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel |
Wooden Geometric Puzzles: Design and Hardness Proofs. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Geometric puzzles, Complexity, Partition |
| 1 | Hans 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. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
On problems without polynomial kernels. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
Derivation of algorithms for cutwidth and related graph layout parameters. |
J. Comput. Syst. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Stéphan Thomassé, Anders Yeo |
Kernel Bounds for Disjoint Cycles and Disjoint Paths. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith |
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Kernelization: New Upper and Lower Bound Techniques. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
algorithms, kernel, kernelization, preprocessing, data reduction, fixed parameter tractability, combinatorial problems |
| 1 | Hans L. Bodlaender, Daniel Lokshtanov, Eelko Penninkx |
Planar Capacitated Dominating Set Is W[1]-Hard. |
IWPEC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos |
(Meta) Kernelization. |
FOCS |
2009 |
DBLP DOI BibTeX RDF |
Polynonial Time Preprocessing, Counting Monadic Second Order Logic, Finite Integer Index, Graphs of Bounded Genus, Planar Graphs, Kernelization, Parameterized Algorithms, Finite State |
| 1 | Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster |
Treewidth Lower Bounds with Brambles. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth |
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Combinatorial Optimization on Graphs of Bounded Treewidth. |
Comput. J. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender |
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Treewidth of Graphs. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |
The Valve Location Problem in Simple Network Topologies. |
WG |
2008 |
DBLP DOI BibTeX RDF |
Valve location problem, computational complexity, dynamic programming, binary search, bounded treewidth |
| 1 | Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin |
On Problems without Polynomial Kernels (Extended Abstract). |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
Clustering with Partial Information. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender |
Exact Algorithms for Edge Domination. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
minimum maximal matching, exponential time algorithms, measure and conquer, exact algorithms, edge dominating set |
| 1 | Hans L. Bodlaender, Eelko Penninkx |
A Linear Kernel for Planar Feedback Vertex Set. |
IWPEC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan M. M. van Rooij, Hans L. Bodlaender |
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Richard B. Tan, Thomas C. van Dijk, Jan van Leeuwen |
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Eelko Penninkx, Richard B. Tan |
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Pinar Heggernes, Yngve Villanger |
Faster Parameterized Algorithms for Minimum Fill-In. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, Hans L. Bodlaender |
Algorithms for Graphs Embeddable with Few Crossings per Edge. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster |
Safe Reduction Rules for Weighted Treewidth. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
On the maximum cardinality search lower bound for treewidth. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Johan Kwisthout, Hans L. Bodlaender, Gerard Tel |
Local Monotonicity in Probabilistic Networks. |
ECSQARU |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
A Cubic Kernel for Feedback Vertex Set. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Treewidth: Structure and Algorithms. |
SIROCCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Helmut Alt, Hans L. Bodlaender, Marc J. van Kreveld, Günter Rote, Gerard Tel |
Wooden Geometric Puzzles: Design and Hardness Proofs. |
FUN |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |
The valve location problem. |
CTW |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hans 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 |
DBLP DOI BibTeX RDF |
Topics Algorithms, Complexity |
| 1 | Emgad H. Bachoore, Hans L. Bodlaender |
Weighted Treewidth Algorithmic Techniques and Results. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Safe separators for treewidth. |
Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Katriel, Hans L. Bodlaender |
Online topological ordering. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
graphs, online algorithms, treewidth, Dynamic algorithms, topological order |
| 1 | Hans L. Bodlaender, Thomas Wolle, Arie M. C. A. Koster |
Contraction and Treewidth Lower Bounds. |
J. Graph Algorithms Appl. |
2006 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Treewidth: Characterizations, Applications, and Computations. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
On Exact Algorithms for Treewidth. |
ESA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Emgad H. Bachoore, Hans L. Bodlaender |
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer |
Kernelization for Convex Recoloring. |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Michael A. Langston (eds.) |
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings |
IWPEC |
2006 |
DBLP BibTeX RDF |
|
| 1 | Hans 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 |
DBLP DOI BibTeX RDF |
minimum corridor connection, generalized geometric problems, complexity, approximations, exact algorithms |
| 1 | Hans L. Bodlaender, Fedor V. Fomin |
Equitable colorings of bounded treewidth graphs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Andreas Brandstädt, Dieter Kratsch, Michaël Rao, Jeremy Spinrad |
On algorithms for (P5, gem)-free graphs. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Cutwidth I: A linear time fixed parameter algorithm. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender |
Cutwidth II: Algorithms for partial w-trees of bounded degree. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster, Frank van den Eijkhof |
Preprocessing Rules for Triangulation of Probabilistic Networks. |
Computational Intelligence |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin |
Tree decompositions with small cost. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster |
Treewidth Lower Bounds with Brambles. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin |
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Katriel, Hans L. Bodlaender |
Online topological ordering. |
SODA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender |
Degree-Based Treewidth Lower Bounds. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Emgad H. Bachoore, Hans L. Bodlaender |
New Upper Bound Heuristics for Treewidth. |
WEA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, Hans L. Bodlaender |
Algorithms for Graphs Embeddable with Few Crossings Per Edge. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Discovering Treewidth. |
SOFSEM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Hajo Broersma, Fedor V. Fomin, Artem V. Pyatkin, Gerhard J. Woeginger |
Radio Labeling with Preassigned Frequencies. |
SIAM Journal on Optimization |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Ton Kloks, Richard B. Tan, Jan van Leeuwen |
Approximations for lambda-Colorings of Graphs. |
Comput. J. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Gerard Tel |
A Note on Rectilinearity and Angular Resolution. |
J. Graph Algorithms Appl. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Jan Arne Telle |
Space-Efficient Construction Variants of Dynamic Programming. |
Nord. J. Comput. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
On the Maximum Cardinality Search Lower Bound for Treewidth. |
WG |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle |
Contraction and Treewidth Lower Bounds. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Fedor V. Fomin |
Equitable Colorings of Bounded Treewidth Graphs. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Arie M. C. A. Koster |
Safe Seperators for Treewidth. |
ALENEX/ANALC |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Dimitrios M. Thilikos |
Computing Small Search Numbers in Linear Time. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
WEA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Linda C. van der Gaag, Hans L. Bodlaender, A. J. Feelders |
Monotonicity in Bayesian Networks. |
UAI |
2004 |
DBLP BibTeX RDF |
|
| 1 | Hans L. Bodlaender |
Necessary Edges in k-Chordalisations of Graphs. |
J. Comb. Optim. |
2003 |
DBLP DOI BibTeX RDF |
triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth |
| 1 | Hans L. Bodlaender, Udi Rotics |
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Minimum fill-in, Minimal separators, Graph algorithms, Treewidth, Polynomial algorithms, Modular decomposition |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")