Hans L. Bodlaender | Academic Influence

Hans L. Bodlaender's AcademicInfluence.com Rankings

Hans L. Bodlaender

Computer Science

#2070

World Rank

#2150

Historical Rank

Database

#1149

World Rank

#1206

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Hans L. Bodlaender's Degrees

PhD Computer Science University of Amsterdam

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Hans L. Bodlaender Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Hans Leo Bodlaender is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known for his work on graph algorithms and parameterized complexity and in particular for algorithms relating to tree decomposition of graphs.

(See a Problem?)

Hans L. Bodlaender's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A linear time algorithm for finding tree-decompositions of small treewidth (1993) (1676)
A Partial k-Arboretum of Graphs with Bounded Treewidth (1998) (1007)
A Tourist Guide through Treewidth (1993) (740)
On problems without polynomial kernels (2009) (524)
Dynamic Programming on Graphs with Bounded Treewidth (1988) (341)
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (1993) (297)
(Meta) Kernelization (2009) (297)
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree (1995) (295)
Combinatorial Optimization on Graphs of Bounded Treewidth (2008) (289)
Kernel bounds for disjoint cycles and disjoint paths (2009) (287)
Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs (2002) (276)
Kernelization Lower Bounds by Cross-Composition (2012) (234)
Two Strikes Against Perfect Phylogeny (1992) (229)
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth (2013) (229)
A ck n 5-Approximation Algorithm for Treewidth (2016) (228)
On the Complexity of Some Coloring Games (1991) (209)
The Pathwidth and Treewidth of Cographs (1990) (203)
Treewidth computations I. Upper bounds (2010) (197)
Treewidth: Algorithmoc Techniques and Results (1997) (197)
Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006, Proceedings (2006) (195)
Discovering Treewidth (2005) (189)
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees (1988) (181)
Treewidth and Pathwidth of Permutation Graphs (1993) (151)
Kernelization: New Upper and Lower Bound Techniques (2009) (148)
Rankings of Graphs (1998) (147)
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution (2009) (143)
On Linear Time Minor Tests with Depth-First Search (1993) (142)
On Disjoint Cycles (1991) (132)
Treewidth: Computational Experiments (2001) (128)
Parallel Algorithms with Optimal Speedup for Bounded Treewidth (1995) (124)
Treewidth: Characterizations, Applications, and Computations (2006) (121)
Algorithms for Graphs Embeddable with Few Crossings per Edge (2005) (119)
Cross-Composition: A New Technique for Kernelization Lower Bounds (2010) (114)
Parameterized complexity analysis in computational biology (1995) (112)
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions (2005) (109)
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height (1991) (106)
Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions (2010) (105)
NC-Algorithms for Graphs with Small Treewidth (1988) (103)
Reduction Algorithms for Graphs of Small Treewidth (2001) (102)
The Parameterized Complexity of Sequence Alignment and Consensus (1994) (100)
An O(c^k n) 5-Approximation Algorithm for Treewidth (2013) (100)
Scheduling with Incompatible Jobs (1992) (93)
Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (1994) (92)
Constructive Linear Time Algorithms for Branchwidth (1997) (92)
On the Complexity of the Maximum Cut Problem (1994) (91)
Safe separators for treewidth (2006) (91)
Diameter increase caused by edge deletion (1987) (86)
Achromatic Number is NP-Complete for Cographs and Interval Graphs (1989) (85)
Classes of graphs with bounded tree-width (1986) (82)
Approximations for lambda-Colorings of Graphs (2004) (79)
Kernel bounds for path and cycle problems (2011) (79)
On exact algorithms for treewidth (2006) (79)
Treewidth computations II. Lower bounds (2011) (78)
Cutwidth I: A linear time fixed parameter algorithm (2005) (77)
Equitable colorings of bounded treewidth graphs (2004) (74)
Treewidth for Graphs with Small Chordality (1997) (74)
lambda-Coloring of Graphs (2000) (74)
The Necessity of Bounded Treewidth for Efficient Inference in Bayesian Networks (2010) (73)
A Cubic Kernel for Feedback Vertex Set and Loop Cutset (2010) (73)
Some Classes of Graphs with Bounded Treewidth (1988) (73)
Finding Small Equivalent Decision Trees is Hard (2000) (71)
On Problems without Polynomial Kernels (Extended Abstract) (2008) (71)
Better Algorithms for the Pathwidth and Treewidth of Graphs (1991) (71)
Exact algorithms for dominating set (2011) (69)
Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators (1993) (68)
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems (2000) (68)
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter (2011) (68)
Restrictions of Graph Partition Problems. Part I (1995) (66)
Contraction and Treewidth Lower Bounds (2004) (66)
Vertex Cover Kernelization Revisited (2010) (64)
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (2011) (64)
Linear-time register allocation for a fixed number of registers (1998) (64)
Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy (1994) (63)
Treewidth and Minimum Fill-in on d-Trapezoid Graphs (1998) (61)
The Multivariate Algorithmic Revolution and Beyond (2012) (61)
Drawing Planar Graphs Using the Canonical Ordering (1996) (60)
On the Complexity of Scheduling Incompatible Jobs with Unit-Times (1993) (59)
Computational complexity of norm-maximization (1990) (59)
A Cubic Kernel for Feedback Vertex Set (2007) (58)
On Interval Routing Schemes and Treewidth (1995) (55)
Treewidth: Structure and Algorithms (2007) (55)
Safe Reduction Rules for Weighted Treewidth (2002) (54)
PREPROCESSING RULES FOR TRIANGULATION OF PROBABILISTIC NETWORKS * (2005) (52)
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set (2008) (52)
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs (2012) (52)
Planar graphs with bounded treewidth (1988) (51)
Cutwidth II: Algorithms for partial w-trees of bounded degree (2005) (51)
Treewidth Lower Bounds with Brambles (2005) (51)
W[2]-hardness of precedence constrained K-processor scheduling (1995) (51)
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (2000) (50)
Restrictions of Graph Partition Problems (1993) (49)
Monotonicity in Bayesian Networks (2004) (46)
Isomorphism for Graphs of Bounded Distance Width (1997) (46)
The Classification of Coverings of Processor Networks (1989) (45)
Graphs with Branchwidth at Most Three (1999) (44)
Open Problems in Parameterized and Exact Computation - IWPEC 2006 (2006) (44)
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday (2012) (44)
Exact Algorithms for Edge Domination (2008) (44)
Partition Into Triangles on Bounded Degree Graphs (2011) (42)
Trade-Offs in Non-Reversing Diameter (1994) (42)
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs (1992) (42)
Pre-processing for Triangulation of Probabilistic Networks (2001) (42)
Domino Treewidth (1997) (41)
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width (2000) (40)
Online topological ordering (2005) (40)
Parallel Algorithms for Series Parallel Graphs (1996) (39)
Approximations for -Coloring of Graphs (2004) (39)
On Linear Time Minor Tests and Depth First Search (1989) (38)
Treewidth: Algorithmic results and techniques (1997) (38)
Approximation of pathwidth of outerplanar graphs (2001) (38)
Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels (2008) (37)
Complexity of Path-Forming Games (1993) (36)
Triangulating Planar Graphs while Minimizing the Maximum Degree (1992) (36)
Simulation of Large Networks on Smaller Networks (1985) (34)
A Note on the Complexity of Network Reliability Problems (2004) (34)
A Linear Kernel for Planar Feedback Vertex Set (2008) (34)
Computing Small Search Numbers in Linear Time (2004) (33)
Improved Self-reduction Algorithms for Graphs with Bounded Treewidth (1990) (33)
Ranking of Graphs (1994) (31)
Reduction Algorithms for Constructing Solutions in Graphs with Small Treewidth (1996) (31)
On Intervalizing K-colored Graphs for DNA Physical Mapping (1996) (30)
Faster Algorithms on Branch and Clique Decompositions (2010) (30)
Planar Capacitated Dominating Set Is W[1]-Hard (2009) (29)
Planar Graph Augmentation Problems (Extended Abstract) (1991) (28)
Tree decompositions with small cost (2002) (28)
Intervalizing k-Colored Graphs (1995) (28)
New Lower Bound Techniques for Distributed Leader Finding and Other Problems on Rings of Processors (1991) (28)
Dynamic Algorithms for Graphs with Treewidth 2 (1993) (28)
On algorithms for (P5, gem)-free graphs (2005) (28)
The Distributed Bit Complexity of the Ring: From the Anonymous to the Non-anonymous Case (1989) (27)
A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth (2006) (27)
Distributed Computing on TRansitive Networks: The Thorus (1989) (26)
New Upper Bound Heuristics for Treewidth (2005) (25)
On the Complexity of the MPA Problem in Probabilistic Networks (2002) (25)
Parallel Algorithms for Series Parallel Graphs and Graphs with Treewidth Two1 (2001) (25)
Kayles and Nimbers (2002) (25)
On the Minimum Corridor Connection Problem and Other Generalized Geometric Problems (2006) (25)
An exact algorithm for graph coloring with polynomial memory (2006) (24)
A note on domino treewidth (1999) (24)
Fixed-Parameter Tractability of Treewidth and Pathwidth (2012) (24)
Clustering with partial information (2008) (23)
Algorithms – ESA 2013 (2013) (23)
λ-coloring of graphs (2000) (23)
A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs (2008) (22)
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth (2001) (22)
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition (2002) (22)
Degree-Based Treewidth Lower Bounds (2005) (22)
Quadratic Kernelization for Convex Recoloring of Trees (2007) (21)
Derivation of algorithms for cutwidth and related graph layout parameters (2002) (21)
A Note on Edge Contraction (2004) (21)
Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees (1987) (20)
A framework for ETH-tight algorithms and lower bounds in geometric intersection graphs (2018) (20)
The Fine Details of Fast Dynamic Programming over Tree Decompositions (2013) (20)
Faster Parameterized Algorithms for Minimum Fill-in (2008) (19)
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time (2012) (19)
The Complexity of Finding Uniform Emulations on Paths and Ring Networks (1990) (18)
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions (2013) (18)
Subexponential Time Algorithms for Embedding H-Minor Free Graphs (2016) (18)
It is Hard to Know when Greedy is Good for Finding Independent Sets (1997) (18)
On the maximum cardinality search lower bound for treewidth (2004) (18)
Parameterized Complexity of the Spanning Tree Congestion Problem (2012) (17)
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint (2008) (17)
Only few graphs have bounded treewidth (1992) (17)
Necessary Edges in k-Chordalisations of Graphs (2003) (17)
Kernel Bounds for Structural Parameterizations of Pathwidth (2012) (17)
Graph Modification Problems (Dagstuhl Seminar 14071) (2014) (17)
A Note on Rectilinearity and Angular Resolution (2004) (16)
An ETH-Tight Exact Algorithm for Euclidean TSP (2018) (16)
A Framework for Exponential-Time-Hypothesis-Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (2020) (16)
Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs (1992) (15)
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space (2021) (14)
Bit-Optimal Election in Synchronous Rings (1990) (13)
A Better Lower Bound For Distributed Leader Finding in Bidirectional, Asynchronous Rings of Processors (1988) (13)
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s (1999) (13)
The Complexity of Coloring Games on Perfect Graphs (1992) (13)
A Faster Parameterized Algorithm for Pseudoforest Deletion (2017) (13)
The Valve Location Problem in Simple Network Topologies (2008) (13)
The Complexity of Finding kth Most Probable Explanations in Probabilistic Networks (2011) (12)
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors (1986) (12)
Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P4's (2004) (12)
Parameterized Complexity of Conflict-free Graph Coloring (2019) (12)
Radio Labeling with Preassigned Frequencies (2004) (12)
On exploring always-connected temporal graphs of small pathwidth (2019) (12)
Spanning tree congestion of k-outerplanar graphs (2010) (11)
Complexity Results for the Spanning Tree Congestion Problem (2010) (11)
PSPACE-Completeness of Bloxorz and of Games with 2-Buttons (2014) (11)
Subexponential Time Algorithms for Finding Small Tree and Path Decompositions (2016) (11)
Exact algorithms for Kayles (2011) (11)
Distributed computing: structure and complexity (1987) (11)
A Note on Contraction Degeneracy (2004) (10)
On Making a Distinguished Vertex of Minimum Degree by Vertex Deletion (2014) (10)
Convex recoloring of leaf-colored trees (2006) (10)
On Game-Theoretic Models of Networks (2001) (10)
Computing Treewidth on the GPU (2017) (10)
Safe Seperators for Treewidth (2004) (10)
On the Maximum Weight Minimal Separator (2017) (10)
Fast algorithms for the Tron game on trees (1990) (10)
Parallel Algorithms for Treewidth Two (1997) (10)
Space-Efficient Construction Variants of Dynamic Programming (2004) (9)
Treewidth and small separators for graphs with small chordality (1995) (9)
Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions (2013) (9)
Scheduling of pipelined operator graphs (2012) (9)
Finding a bigtriangleup-regular supergraph of minimum order (2003) (9)
Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory (1992) (8)
The ESA '93 Proceedings (1994) (8)
Recognizing hyperelliptic graphs in polynomial time (2017) (8)
Weighted Treewidth Algorithmic Techniques and Results (2007) (8)
A Local Search Algorithm for Branchwidth (2011) (8)
Fast Partitioning l-Apex Graphs with Application to Approximating Maximum Induced-Subgraph Problems (1997) (8)
Problems hard for treewidth but easy for stable gonality (2022) (7)
Hedonic Seat Arrangement Problems (2020) (7)
Open Problems of the Lorentz Workshop \Enumeration Algorithms using Structure" (2015) (7)
Definability Equals Recognizability for $k$-Outerplanar Graphs (2015) (7)
Characterizing width two for variants of treewidth (2014) (7)
Subgraph Isomorphism on Graph Classes that Exclude a Substructure (2019) (7)
Kernelization for Convex Recoloring (2006) (7)
The Complexity of Finding Uniform Emulations on Fixed Graphs (1988) (7)
The algorithmic theory of treewidth (2000) (7)
Cut and Count and Representative Sets on Branch Decompositions (2017) (7)
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth (2013) (6)
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality (2015) (6)
Google Scholar makes it hard - the complexity of organizing one's publications (2014) (6)
Exact Algorithms for Intervalizing Coloured Graphs (2011) (6)
Finite-State Computability of Annotations of Strings and Trees (1996) (6)
Typical Sequences Revisited — Computing Width Parameters of Graphs (2019) (6)
On Stopping Evidence Gathering for Diagnostic Bayesian Networks (2011) (6)
Approximations for λ-Colorings of Graphs 201 (2004) (6)
Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings:Preface (2013) (6)
On Reduction Algorithms for Graphs with Small Treewidth (1993) (6)
Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors (1991) (6)
Radio Labeling with Pre-assigned Frequencies (2002) (6)
XNLP-completeness for Parameterized Problems on Graphs with a Linear Structure (2022) (6)
Distribution of records on a ring of processors (1986) (5)
Stable Divisorial Gonality is in NP (2018) (5)
Improved Diameter Bounds for Altered Graphs (1986) (5)
Local Monotonicity in Probabilistic Networks (2007) (5)
Sizes of decision tables and decision trees (1999) (5)
Relaxed Update and Partition Network Games (2002) (5)
Tree Decompositions of Small Diameter (1998) (5)
Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms (2003) (5)
On the Complexity of Problems on Tree-structured Graphs (2022) (5)
Contraction Degeneracy on Cographs (2004) (5)
On the parameterized complexity of computing tree-partitions (2022) (5)
Sizes of Ordered Decision Trees (2002) (4)
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition (2003) (4)
Graph Automorphisms with Maximal Projection Distances (1999) (4)
Improved Lower Bounds for Graph Embedding Problems (2016) (4)
Parameterized Complexities of Dominating and Independent Set Reconfiguration (2021) (4)
New Lower Bounds for Distributed Leader Finding in Asynchronous Rings of Processors (1987) (4)
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective (2020) (4)
Treewidth of Graphs : Encyclopedia of Algorithms (2014) (4)
List Colouring Trees in Logarithmic Space (2022) (4)
On the minimum corridor connection and other generalized geometric problems (2006) (4)
Comparing loop cutsets and clique trees in probabilistic inference (1997) (4)
Parameterized Complexity of Scheduling Chains of Jobs with Delays (2020) (4)
A Constructive linear time algorithm for small cutwidth (2000) (4)
Kernelization for convex recoloring of trees (2006) (4)
Fast Dynamic Programming on Graph Decompositions (2018) (3)
Parameterized complexity of Bandwidth of Caterpillars and Weighted Path Emulation (2020) (3)
The hardness of problems on thin colored graphs (1995) (3)
Domino Treewith (Extended Abstract) (1994) (3)
Knot Diagrams of Treewidth Two (2019) (3)
Steiner Trees for Hereditary Graph Classes (2020) (3)
Deadlock-free packet switching networks with variable packet size (1985) (3)
Partitioning Sparse Graphs Into Triangles Relations to exact satisfiability and very fast exponential time algorithms (2010) (3)
Wooden Geometric Puzzles: Design and Hardness Proofs (2007) (3)
MSOL-Definability Equals Recognizability for Halin Graphs and Bounded Degree k-Outerplanar Graphs (2015) (3)
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity (2016) (3)
Preprocessing for treewidth (2011) (3)
Lower Bounds for Kernelization (2014) (3)
Kernelization, Exponential Lower Bounds (2016) (3)
Treewidth of Graphs (2008) (3)
On the Exact Complexity of Polyomino Packing (2018) (3)
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms (2017) (3)
The Complexity of Finding kth Most Probable Most Probable Explanations in Probabilistic Networks (2011) (2)
Linear Time Algorithms for Some NP-Complete Problems on (P5, Gem)-Free Graphs (2003) (2)
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds (2019) (2)
The maximum cut and minimum cut into bounded sets problems on cographs (1987) (2)
Connected dominating set in unit-disk graphs is W[1]-hard (2016) (2)
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Interval Graph Classes (2021) (2)
Learning minor closed graph classes with membership and equivalence queries (1994) (2)
Constructive linear time algorithms for small carving-width (2000) (2)
The Complexity of Finding (2011) (2)
Graph-theoretic concepts in computer science : 29th International Workshop, WG 2003, Elspeet, the Netherlands, June 19-21, 2003 : revised papers (2003) (2)
A Generic NP-hardness Proof for a Variant of Graph Coloring (2001) (2)
Rectilinear Graphs and Angular Resolution (2003) (2)
The valve location problem (2007) (1)
On Approximation algorithms for determining minimum cost emulations (1985) (1)
Stable Divisorial Gonality is in NP (2020) (1)
On the complexity of finding uniform emulations (1985) (1)
On switching classes, NLC-width, cliquewidth and treewidth (2012) (1)
On disjoint cycles in graphs (1990) (1)
Practical Algorithms for Linear Boolean-width (2015) (1)
Fixed-Treewidth-Efficient Algorithms for Edge-Deletion to Intersection Graph Classes (2020) (1)
A new lowerbound technique for distributed extrema finding on rings of processors (1987) (1)
Parameterized Complexity of the Spanning Tree Congestion Problem (2011) (1)
Faster algorithms for domination of planar graphs (2000) (1)
Dynamic sampling from a discrete probability distribution with a known distribution of rates (2018) (1)
Erratum: Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators (1994) (1)
Series On Game-Theoretic Models of Networks (2001) (1)
On Exploring Temporal Graphs of Small Pathwidth (2018) (1)
Treewidth is NP-Complete on Cubic Graphs (and related results) (2023) (1)
12 On Exact Algorithms for Treewidth (2012) (1)
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem (2023) (1)
Complexity aspects of map compression (1991) (1)
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark (2017) (1)
Provisional Propagation for Verifying Monotonicity of Bayesian Networks (2014) (1)
Definability equals recognizability for k-outerplanar graphs and l-chordal partial k-trees (2017) (1)
Sizes of de ision tables and de ision treesHans (1999) (1)
Typical Sequences Revisited - Algorithms for Linear Orderings of Series Parallel Digraphs (2019) (1)
On the Challenge of Creating an Attractive Research Master Program: Graduate Education Avant-la-Lettre (2009) (0)
Spanning tree congestion of k-outerplanar graphs (アルゴリズム(AL) Vol.2010-AL-130) (2010) (0)
Communication complexity of pairs of graph families with applications (2017) (0)
New results on lambda-colorings for special graph classes. (2000) (0)
Parallel Algorithms for Partial Two-Trees and for Blocks of Partial k-Trees ? (2007) (0)
Distributed computing (1986) (0)
Partition Into Triangles on Bounded Degree Graphs (2012) (0)
Testing Superperfection of k-Trees (1992) (0)
Robust Recoverable Path Using Backup Nodes (2016) (0)
Book review (1993) (0)
A Kernel for Convex Recoloring of Weighted Forests (2009) (0)
Deposited in DRO : 07 October 2008 Version of attached le : Published Version Peer-review status of attached le : Peer-reviewed Citation for published item (2014) (0)
Complexity Results for Local Monotonicity in Probabilistic Networks (2008) (0)
Uniform emulations of the shuffle-exchange network (1984) (0)
Variations on Boolean-width (2015) (0)
Finding a minimal tree in a polygon with its medial axis (1999) (0)
Exact Algorithms for Edge Domination (2011) (0)
From the W-hierarchy to XNLP - Classes of Fixed Parameter Intractability (2022) (0)
Interval Routing and Minor-Monotone Graph Parameters (2006) (0)
Graph-Theoretic Concepts in Computer Science (2015) (0)
40 14071 – Graph Modification Problems 2 Table of Contents (2014) (0)
Complexity Aspects of Two-Dimensional Data Compression (1995) (0)
Compositions of double diagonal and cross Latin squares (1983) (0)
Fixed parameter algorithms for planar dominating set (2000) (0)
Theoretical Computer Science Recognizing hyperelliptic graphs in polynomial time ✩ (2020) (0)
Parameterized Completeness Results for Bayesian Inference (2022) (0)
Linear time algorithms for some NP-complete problems on (P5, Gem)-Free graphs (extended abstract) (2003) (0)
J un 2 01 8 Fast Dynamic Programming on Graph Decompositions ∗ (2018) (0)
Comparing Loop Cutsets and Clique Treesin Probabilistic (1997) (0)
Erratum: Probabilistic Inference and Monadic Second Order Logic (2012) (0)
Exploring the class XNLP ARPE ﬁnal report (2022) (0)
Uniform emulations of two different types of shuffle-exchange networks (2007) (0)
Kernelization Rules for Special Treewidth and Spaghetti Treewidth (2012) (0)
The Parameterized Complexity Binary CSP for Graphs with a Small Vertex Cover and Related Results (2022) (0)
Some Results for Cluster Traveling Salesperson Problem (1998) (0)
Degree-Constrained Orientation of Maximum Satisfaction: Graph Classes and Parameterized Complexity (2017) (0)
Erratum to: Editorial (2015) (0)
Graph-Theoretic Concepts in Computer Science (2003) (0)
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs (2011) (0)
Erratum to: Editorial (2015) (0)
Exact Algorithms for Intervalizing Coloured Graphs (2015) (0)
Intervalizing sandwich graphs (1997) (0)
Parameterized Complexity of Binary CSP: Vertex Cover, Treedepth, and Related Parameters (2022) (0)
Algorithms for graphs embedable with few crossings per egde (2004) (0)
The Homogeneous Broadcast Problem in Narrow and Wide Strips I: Algorithms (2019) (0)
Title Index, Volume 21 (2005) (0)
LIPIcs, Volume 83, MFCS'17, Complete Volume (2017) (0)
Vertex Cover Kernelization Revisited (2012) (0)
Finding grid embeddings with bounded maximum edge length is NP-complete (1985) (0)
2 Cross-Composition : A New Technique for Kernelization Lower Bounds of problems on planar graphs (2010) (0)
The Valve Location Proble m (2008) (0)
The Homogeneous Broadcast Problem in Narrow and Wide Strips II: Lower Bounds (2019) (0)
Parameterized Complexity Results for Bayesian Inference (2022) (0)
Emulations of processor networks with buses (1985) (0)
Conditional Lower Bounds on the Complexity of Probabilistic Inference (2009) (0)
Proceedings of the Second international conference on Parameterized and Exact Computation (2006) (0)
Online Topological Ordering Irit Katriel (0)
Tree width and combinatorial optimization (TACO) (2001) (0)
Subgraph Isomorphism on Graph Classes that Exclude a Substructure (2020) (0)
K-processor Scheduling (1994) (0)
Improved Kernelization and Linear Time FPT for Convex Recoloring of Trees ? (0)
EATCS-IPEC Nerode Prize 2019 - Call for Nominations (2019) (0)
Scheduling of pipelined operator graphs (2011) (0)
Boombreedte en combinatoriële optimalisering (TACO) (2001) (0)
Efficiently computing the Shapley value of connectivity games in low-treewidth graphs (2022) (0)
The minimum bisection width of (three-dimensional) blocks (1984) (0)
Constructing tree decompositions of graphs with bounded gonality (2020) (0)
Optimal data structures for stochastic driven simulations (2018) (0)

This paper list is powered by the following services:

Other Resources About Hans L. Bodlaender

en.wikipedia.org

What Schools Are Affiliated With Hans L. Bodlaender?

Hans L. Bodlaender is affiliated with the following schools: