Distributed computing: structure and complexity / H.L. BodlaenderOn linear time minor tests and depth first search / Hans L. BodlaenderBit-optimal election in synchronous rings / Hans L. Bodlaender and Gerard TelA new lowerbound technique for distributed extrema finding on rings of processors / Hans L. BodlaenderThe maximum cut and minimum cut into bounded sets problems on cographs / Hans L. BodlaenderA better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors / Hans L. BodlaenderPolynomial algorithms for chromatic index and graph isomorphism on partial k-trees / Hans L. BodlaenderDynamic programming on graphs with bounded treewidth / Hans L. BodlaenderNC-algorithms for graphs with small treewidth / Hans L. BodlaenderPlanar graphs with bounded treewidth / Hans L. BodlaenderNew lower bound techniques for distributed leader finding and other problems on rings of processors / Hans L. BodlaenderAchromatic number is NP-complete for cographs and interval graphs / Hans L. BodlaenderImproved self-reduction algorithms for graphs with bounded treewidth / Hans L. BodlaenderThe distributed bit complexity of the ring : from the anonymous to the non-anonymous case / Hans L. Bodlaender, Shlomo Moran, Manfred K. WarmuthTrade-offs in non-reversing diameter / Hans L. Bodlaender ; Gerard Tel ; Nicola SantoroOn the complexity of some coloring games / Hans L. BodlaenderComplexity of path forming games / Hans L. BodlaenderThe pathwidth and treewidth of cographs / Hans L. Bodlaender and Rolf H. MöhringOn disjoint cycles / Hans L. BodlaenderFast algorithms for the Tron game on trees / H. Bodlaender and T. KloksA simple linear time algorithm for triangulating three-colored graphs / H. Bodlaender, T. KloksComplexity aspects of 2-dimensional data compression / H. Bodlaender, T. Gonzalez, T. KloksOn the complexity of the maximum cut problem / Hans L. Bodlaender, Klaus JansenRestrictions of graph partition problems / Hans L. BodlaenderKayles on special classes of graphs : an application of Sprague-Grundy theory / Hans L. BodlaenderRestrictions of graph partition problems / Hans L. Bodlaender, Klaus JansenTwo strikes against perfect phylogeny / Hans L. Bodlaender, Mike R. Fellows, Tandy J. WarnowA tourist guide through treewidth / Hans L. BodlaenderA linear time algorithm for finding tree-decompositions of small treewidth / Hans L. BodlaenderTreewidth and pathwidth of permutation graphs / H. Bodlaender, T. Kloks, D. KratschEfficient and constructive algorithms for the pathwidth and treewidth of graphs / Hans L. Bodlaender and Ton KloksDomino treewidth / H.L. Bodlaender and J. EngelfrietW[2]-hardness of precedence constrained K-processor scheduling / H.L. Bodleander and M.R. FellowsTreewidth and small separators for graphs with small chordality / H.L. Bodlaender and D.M. ThilikosIntervalizing k-colored graphs / H.L. Bodlaender and B. de FluiterOn intervalizing k-colored graphs for DNA physical mapping / H.L. Bodlaender and B. de FluiterParallel algorithms with optimal speedup for bounded treewidth / H.L. Bodlaender and T. HagerupReduction algorithms for graphs with small treewidth / H.L. Bodlaender and B. de FluiterA partial k-arboretum of graphs with bounded treewidth / H.L. BodlaenderParallel algorithms for series parallel graphs / H.L. Bodlaender and B. de Fluiter
author
Distributed computing on transitive networks : the Torus / Paul W. Beame, Hans L. BodlaenderPlanar graph augmentation problems / Goos Kant en Hans L. BodlaenderTriangulating planar graphs while minimizing the maximum degree / Goos Kant, Hans L. BodlaenderTesting superperfection of k-trees / T. Kloks, H. BodlaenderOn the treewidth and pathwidth of permutation graphs / T. Kloks, Hans L. BodlaenderApproximating treewidth and pathwidth of some classes of perfect graphs / T. Kloks, H. BodlaenderOnly few graphs have bounded treewidth / T. Kloks, H. BodlaenderThe parameterized complexity of sequence alignment and consensus / H.L. Bodlaender ... [et al.]Rankings of graphs / H.L. Bodlaender ... [et al.]Treewidth and minimum fill-in on d-trapezoid graphs / H. Bodlaender ... [et al.]The hardness of problems on thin colored graphs / H.L. Bodlaender ... [et al.]Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems / D.M. Thilikos and H.L. BodlaenderOn interval routing schemes and treewidth / H.L. Bodlaender ... [et al.]Intervalizing sandwich graphs / B. de Fluiter and H.L. BodlaenderComparing loop cutsets and clique trees in probabilistic inference / L.C. van der Gaag and H.L. BodlaenderParallel algorithms for treewidth two / B. de Fluiter and H.L. BodlaenderTreewidth: computational experiments / A. Koster, H. Bodlaender, S. Van Hoesel