Bodlaender, Hans Leo (1960-)

A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors / Hans L. Bodlaenderschema:ProductModel A linear time algorithm for finding tree-decompositions of small treewidth / Hans L. Bodlaenderschema:ProductModel A new lowerbound technique for distributed extrema finding on rings of processors / Hans L. Bodlaenderschema:ProductModel A partial k-arboretum of graphs with bounded treewidth / H.L. Bodlaenderschema:ProductModel A simple linear time algorithm for triangulating three-colored graphs / H. Bodlaender, T. Kloksschema:ProductModel A tourist guide through treewidth / Hans L. Bodlaenderschema:ProductModel Achromatic number is NP-complete for cographs and interval graphs / Hans L. Bodlaenderschema:ProductModel Algorithms for graphs embeddable with few crossings per edge / Hans L. Bodlaender, Alexander Grigorievschema:ProductModel Bit-optimal election in synchronous rings / Hans L. Bodlaender and Gerard Telschema:ProductModel Complexity aspects of 2-dimensional data compression / H. Bodlaender, T. Gonzalez, T. Kloksschema:ProductModel Complexity of path forming games / Hans L. Bodlaenderschema:ProductModel Distributed computing : structure and complexity / [by] Hans Leo Bodlaender ; (met een samenv. i.h. Nederlands)schema:ProductModel Distributed computing: structure and complexity / H.L. Bodlaenderschema:ProductModel Domino treewidth / H.L. Bodlaender and J. Engelfrietschema:ProductModel Dynamic programming on graphs with bounded treewidth / Hans L. Bodlaenderschema:ProductModel Efficient and constructive algorithms for the pathwidth and treewidth of graphs / Hans L. Bodlaender and Ton Kloksschema:ProductModel Fast algorithms for the Tron game on trees / H. Bodlaender and T. Kloksschema:ProductModel Graphs with branchwidth at most three / H.L. Bodlaender and D.M. Thilikosschema:ProductModel Improved self-reduction algorithms for graphs with bounded treewidth / Hans L. Bodlaenderschema:ProductModel Intervalizing k-colored graphs / H.L. Bodlaender and B. de Fluiterschema:ProductModel ... show all 47

Approximating treewidth and pathwidth of some classes of perfect graphs / T. Kloks, H. Bodlaenderschema:ProductModel Comparing loop cutsets and clique trees in probabilistic inference / L.C. van der Gaag and H.L. Bodlaenderschema:ProductModel Distributed computing on transitive networks : the Torus / Paul W. Beame, Hans L. Bodlaenderschema:ProductModel Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems / D.M. Thilikos and H.L. Bodlaenderschema:ProductModel Intervalizing sandwich graphs / B. de Fluiter and H.L. Bodlaenderschema:ProductModel On interval routing schemes and treewidth / H.L. Bodlaender ... [et al.]schema:ProductModel On the treewidth and pathwidth of permutation graphs / T. Kloks, Hans L. Bodlaenderschema:ProductModel Only few graphs have bounded treewidth / T. Kloks, H. Bodlaenderschema:ProductModel Parallel algorithms for treewidth two / B. de Fluiter and H.L. Bodlaenderschema:ProductModel Planar graph augmentation problems / Goos Kant en Hans L. Bodlaenderschema:ProductModel Rankings of graphs / H.L. Bodlaender ... [et al.]schema:ProductModel Testing superperfection of k-trees / T. Kloks, H. Bodlaenderschema:ProductModel The hardness of problems on thin colored graphs / H.L. Bodlaender ... [et al.]schema:ProductModel The parameterized complexity of sequence alignment and consensus / H.L. Bodlaender ... [et al.]schema:ProductModel Treewidth and minimum fill-in on d-trapezoid graphs / H. Bodlaender ... [et al.]schema:ProductModel Treewidth: computational experiments / A. Koster, H. Bodlaender, S. Van Hoeselschema:ProductModel Triangulating planar graphs while minimizing the maximum degree / Goos Kant, Hans L. Bodlaenderschema:ProductModel