Bodlaender, Hans L. (Hans Leo), 1960-
Bodlaender, H. L.
Bodlaender, Hans L., 1960-
Bodlaender, Hans L.
Bodlaender, Hans Leo
Hans L. Bodlaender
Bodlaender, Hans Leo (1960- ).
Hans L. Bodlaender Dutch computer scientist
VIAF ID: 54818348 ( Personal )
Permalink: http://viaf.org/viaf/54818348
Preferred Forms
-
- 100 1 _ ‡a Bodlaender, H. L.
- 100 1 _ ‡a Bodlaender, H. L.
-
-
-
- 100 1 _ ‡a Bodlaender, Hans L. ‡d 1960-
- 100 1 _ ‡a Bodlaender, Hans L. ‡d 1960-
-
-
- 100 1 _ ‡a Bodlaender, Hans Leo
-
- 100 0 _ ‡a Hans L. Bodlaender
- 100 0 _ ‡a Hans L. Bodlaender ‡c Dutch computer scientist
4xx's: Alternate Name Forms (15)
5xx's: Related Names (8)
- 551 _ _ ‡a Bennekom ‡4 ortg ‡4 https://d-nb.info/standards/elementset/gnd#placeOfBirth
- 510 2 _ ‡a Department of Computer Science (Utrecht)
- 510 2 _ ‡a Springer Science+Business Media
- 510 2 _ ‡a UU WINFI Informatica
- 510 2 _ ‡a Universiteit Utrecht ‡b Department of Computer Science
- 510 2 _ ‡a Universiteit Utrecht ‡b Department of Computer Science ‡4 affi ‡4 https://d-nb.info/standards/elementset/gnd#affiliation ‡e Affiliation
- 510 2 _ ‡a Utrecht
- 551 _ _ ‡a Utrecht ‡4 ortw ‡4 https://d-nb.info/standards/elementset/gnd#placeOfActivity
Works
Title | Sources |
---|---|
Achromatic number is NP-complete for cographs and interval graphs | |
Algorithms - ESA 2013 : 21st Annual European Symposium, Sophia Antipolis, France, September 2-4, 2013. Proceedings | |
Algorithms for graphs embeddable with few crossings per edge | |
Bit-optimal election in synchronous rings | |
Comparing loop cutsets and clique trees in probabilistic inference | |
Complexity aspects of 2-dimensional data compression | |
Complexity of path forming games | |
Distributed computing on transitive networks : the Torus | |
Distributed computing : structure and complexity | |
Domino treewidth | |
Dynamic programming on graphs ... 1987: | |
Fast algorithms for the Tron game on trees | |
Graph-theoretic concepts in computer science : 29th international workshop, WG 2003, Elspeet, the Netherlands, June 19-21, 2003 : revised papers | |
Graphs with branchwidth at most three | |
The hardness of problems on thin colored graphs | |
It is hard to know when greedy is good for finding independent sets | |
Kayles on special classes of graphs : an application of Sprague-Grundy theory | |
A linear time algorithm for finding tree-decompositions of small treewidth | |
The maximum cut and minimum cut into bounded sets problems on cographs | |
The multivariate algorithmic revolution and beyond : essays dedicated to Michael R. Fellows on the occasion of his 60th birthday | |
New lower bound techniques for distributed leader finding and other problems on rings of processors | |
New techniques applicable to selected NP-hard problems | |
Nowe techniki stosowane przy rozwiązywaniu wybranych problemów NP-trudnych | |
On disjoint cycles | |
On interval routing schemes and treewidth | |
On intervalizing k-colored graphs for DNA physical mapping | |
On linear time minor tests and depth first search | |
On the complexity of the maximum cut problem | |
Only few graphs have bounded treewidth | |
Parallel algorithms for series parallel graphs | |
Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings | |
The parameterized complexity of sequence alignment and consensus | |
Planar graph augmentation problems | |
Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees | |
Rankings of graphs | |
Restrictions of graph partition problems | |
A simple linear time algorithm for triangulating three-colored graphs | |
Testing superperfection of k-trees | |
A tourist guide through treewidth | |
Trade-offs in non-reversing diameter | |
Treewidth: algorithmic techniques and results | |
Treewidth and minimum fill-in on d-trapezoid graphs | |
Treewidth and pathwidth of permutation graphs | |
Treewidth and small separators for graphs with small chordality | |
Treewidth computational experiments | |
Triangulating planar graphs while minimizing the maximum degree | |
Two strikes against perfect phylogeny | |
W[2]-hardness of precedence constrained K-processor scheduling | |
WG 2003 |