The following pages link to Hans L. Bodlaender (Q242851):
Displaying 50 items.
- (Q203385) (redirect page) (← links)
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- It is hard to know when greedy is good for finding independent sets (Q286978) (← links)
- Fast partitioning \(l\)-apex graphs with applications to approximating maximum induced-subgraph problems (Q287003) (← links)
- Recognizability equals definability for graphs of bounded treewidth and bounded chordality (Q322323) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- On switching classes, NLC-width, cliquewidth and treewidth (Q418754) (← links)
- Exact algorithms for Kayles (Q476858) (← links)
- Google Scholar makes it hard -- the complexity of organizing one's publications (Q495683) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Spanning tree congestion of \(k\)-outerplanar graphs (Q536232) (← links)
- Treewidth computations. II. Lower bounds (Q549673) (← links)
- (Q587219) (redirect page) (← links)
- Kernel bounds for disjoint cycles and disjoint paths (Q638521) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Restrictions of graph partition problems. I (Q672380) (← links)
- A note on exact algorithms for vertex ordering problems on graphs (Q692902) (← links)
- Degree-constrained orientation of maximum satisfaction: graph classes and parameterized complexity (Q724225) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Equitable colorings of bounded treewidth graphs (Q817768) (← links)
- Safe separators for treewidth (Q819825) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Safe reduction rules for weighted treewidth (Q870458) (← links)
- Bit-optimal election in synchronous rings (Q916342) (← links)
- The complexity of finding uniform emulations on paths and ring networks (Q918210) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- A cubic kernel for feedback vertex set and loop cutset (Q968273) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Derivation of algorithms for cutwidth and related graph layout parameters (Q1015810) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315) (← links)
- The complexity of finding uniform emulations on fixed graphs (Q1110329) (← links)
- The complexity of coloring games on perfect graphs (Q1202928) (← links)
- Complexity of path-forming games (Q1210546) (← links)
- (Q1270768) (redirect page) (← links)
- The cyclic cutwidth of trees (Q1270769) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- The b-chromatic number of a graph (Q1283791) (← links)
- Isomorphism for graphs of bounded distance width (Q1293880) (← links)
- A bound for the game chromatic number of graphs (Q1297403) (← links)
- The game coloring number of planar graphs (Q1305532) (← links)
- The distributed bit complexity of the ring: From the anonymous to the non-anonymous case (Q1314268) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
