The following pages link to Hans L. Bodlaender (Q242851):
Displayed 50 items.
- Improved self-reduction algorithms for graphs with bounded treewidth (Q1336622) (← links)
- The nonexistence of reduction rules giving an embedding into a \(k\)-tree (Q1336627) (← links)
- Evacuation of labelled graphs (Q1336658) (← links)
- Scheduling with incompatible jobs (Q1343141) (← links)
- Complexity of list coloring problems with a fixed total number of colors (Q1348378) (← links)
- Splitting trees (Q1356762) (← links)
- Binary labeling of graphs (Q1359371) (← links)
- The Erdös-Sós conjecture for graphs without \(C_ 4\) (Q1362105) (← links)
- Triangulating planar graphs while minimizing the maximum degree (Q1363779) (← links)
- The parameterized complexity of sequence alignment and consensus (Q1367540) (← links)
- Treewidth for graphs with small chordality (Q1372729) (← links)
- Integral sum graphs from identification (Q1381849) (← links)
- The subdivision graph of a graceful tree is a graceful tree (Q1381864) (← links)
- On interval routing schemes and treewidth (Q1383155) (← links)
- Bridge obstructions to circular-three gate matrix layout (Q1393029) (← links)
- Magic twin body stars generated from chains of prismoids (Q1398277) (← links)
- On the Laplacian spectral radius of a tree. (Q1399261) (← links)
- Computing the treewidth and the minimum fill-in with the modular decomposition (Q1402225) (← links)
- Finding a \(\Delta\)-regular supergraph of minimum order (Q1408809) (← links)
- Necessary edges in \(k\)-chordalisations of graphs (Q1417852) (← links)
- The cutwidth of trees with diameters at most 4 (Q1430969) (← links)
- Item:Q242851 (redirect page) (← links)
- The computational complexity of cordial and equitable labelling (Q1567263) (← links)
- Eccentricity-approximating trees in chordal graphs (Q1567628) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- Linear-time algorithms for partial \(k\)-tree complements (Q1578411) (← links)
- Algorithms and obstructions for linear-width and related search parameters (Q1582084) (← links)
- An algebraic matching algorithm (Q1586334) (← links)
- Graceful labelings of nearly complete graphs (Q1601392) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Totally magic graphs (Q1613532) (← links)
- On exploring always-connected temporal graphs of small pathwidth (Q1628692) (← links)
- A faster parameterized algorithm for pseudoforest deletion (Q1693129) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- \(k\)-Steiner-minimal-trees in metric spaces (Q1808781) (← links)
- Hypertrees (Q1808971) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- On a question by Erdős about edge-magic graphs (Q1817579) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- On \(L(2,1)\)-labelings of Cartesian products of paths and cycles (Q1827783) (← links)
- Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs (Q1849745) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Edge-magic trees (Q1860738) (← links)
- Minimal congestion trees (Q1877665) (← links)
- A family of sparse graphs of large sum number (Q1894767) (← links)
- The irregular coloring number of a tree (Q1894778) (← links)
- Minimum proper interval graphs (Q1896346) (← links)
- Almost all trees have tribe number 2 or 3 (Q1897446) (← links)
- On upper bounds of bandwidths of trees (Q1899015) (← links)