sort by
approximate search
1shortlisttitle datasearch history  
results search [or] ISN:0000000081342475 | 1 hits
Person
ISNI: 
0000 0000 8134 2475
Name: 
Bodlaender, H.
Bodlaender, H. L.
Bodlaender, Hans L.
Bodlaender, Hans Leo
Hans L. Bodlaender
Hans L. Bodlaender (Dutch computer scientist)
Hans L. Bodlaender (Nederlands wiskundige)
Dates: 
1960-
Creation class: 
article
cre
Language material
Manuscript language material
Text
Creation role: 
author
contributor
editor
redactor
Related names: 
Department of Computer Science (Utrecht)
Fellows, Michael R. (1952-)
Fellows, Michael Ralph (1952-)
Fluiter, B. de (1970-)
Fluiter, Babette Lucie Elisabeth (1970-)
Italiano, Giuseppe F.
Jansen, Klaus
Kant, Goos (1967-)
Kant, Goossen (1967-)
Kloks, Antonius Jacobus Johannes (1957-)
Kloks, T. (1957-)
Langston, Michael A. (1950-)
Langston, Michael Allen (1950-)
Springer Science+Business Media
Tel, Gerard (1962-)
Thilikos, D.M.
Thilikos, Dimitrios M.
Universiteit Utrecht Department of Computer Science Affiliation (see also from)
Utrecht
Warnow, Tandy J.
Titles: 
Achromatic number is NP-complete for cographs and interval graphs
Algorithms 21st annual European symposium ; 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 = Gedistribueerde berekeningen
Dynamic programming on graphs ... 1987:
ESA 2013
Fast algorithms for the Tron game on trees
Graphs with branchwidth at most three
hardness of problems on thin colored graphs, The
Improved self-reduction algorithms for graphs with bounded treewidth
Internat. Workshop WG (29th : 2003 : Elspeet, Netherlands). Graph-theoretic concepts in computer science, c2003:
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
Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth, A
maximum cut and minimum cut into bounded sets problems on cographs, The
multivariate algorithmic revolution and beyond, The : 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
On disjoint cycles
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
Parallel algorithms for series parallel graphs
Parameterized and exact computation : second international workshop, IWPEC 2006, Zürich, Switzerland, September 13-15, 2006 : proceedings
parameterized complexity of sequence alignment and consensus, The
Planar graph augmentation problems
Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees
Rankings of graphs
Restrictions of graph partition problems
simple linear time algorithm for triangulating three-colored graphs, A
Testing superperfection of k-trees
Trade-offs in non-reversing diameter
Treewidth : Algorithmic Techniques and Results
Triangulating planar graphs while minimizing the maximum degree
Two strikes against perfect phylogeny
W[2]-hardness of precedence constrained K-processor scheduling
Contributed to or performed: 
DISCRETE APPLIED MATHEMATICS
LECTURE NOTES IN COMPUTER SCIENCE
SIAM JOURNAL ON COMPUTING
Notes: 
Zsfassung in niederländ. Sprache
Rijskuniv., Diss., 1986--Utrecht
Sources: 
VIAF DNB LC NKC NUKAT SUDOC WKD
BOWKER
DAI
NTA
TEL
ZETO