Zoekresultaten
Resultaat 1 - 20 (van 33)
Hans L. Bodlaender | T. Kloks A simple linear time algorithm for triangulating three-colored graphs
Non-fictie
Engels | 12 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1991
Gedrukt boek
Hans L. Bodlaender | Gerard Tel Bit-optimal election in synchronous rings
Non-fictie
Engels | 6 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1989
Gedrukt boek
Hans L. Bodlaender Improved self-reduction algorithms for graphs with bounded treewidth
Non-fictie
Engels | 16 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Hans L. Bodlaender NC-algorithms for graphs with small treewidth
Non-fictie
Engels | 11 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Hans L. Bodlaender Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees
Non-fictie
Engels | 14 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1987
Gedrukt boek
Hans L. Bodlaender | A. Grigoriev Algorithms for graphs embeddable with few crossings per edge
Non-fictie
Engels | 4 pagina's | METEOR, Maastricht research school of Economics of TEchnology and ORganizations, Maastricht | 2004
Gedrukt boek
Hans L. Bodlaender | D.M. Thilikos Graphs with branchwidth at most three
Non-fictie
Engels | 5 pagina's | Universiteit Utrecht, Utrecht | 1997
Gedrukt boek
Hans L. Bodlaender Treewidth: algorithmic techniques and results
Non-fictie
Engels | 5 pagina's | Universiteit Utrecht, Utrecht | 1997
Gedrukt boek
B. de Fluiter | Hans L. Bodlaender Intervalizing sandwich graphs
Non-fictie
Engels | 66 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1997
Gedrukt boek
Hans L. Bodlaender | B. de Fluiter Parallel algorithms for series parallel graphs
Non-fictie
Engels | 4 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1997
Gedrukt boek
Hans L. Bodlaender | B. de Fluiter Reduction algorithms for graphs of small treewidth
Non-fictie
Engels | 5 pagina's | Universiteit Utrecht, Utrecht | 1997
Gedrukt boek
B. de Fluiter | Hans L. Bodlaender Parallel algorithms for treewidth two
Non-fictie
Engels | 4 pagina's | Utrecht University, Utrecht | 1997
Gedrukt boek
Hans L. Bodlaender | D.M. Thilikos | K. Yamazaki It is hard to know when greedy is good for finding independent sets
Non-fictie
Engels | 9 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1996
Gedrukt boek
D.M. Thilikos | Hans L. Bodlaender Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
Non-fictie
Engels | 8 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1996
Gedrukt boek
Hans L. Bodlaender | T. Hagerup Parallel algorithms with optimal speedup for bounded treewidth
Non-fictie
Engels | 27 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1995
Gedrukt boek
Hans L. Bodlaender | B. de Fluiter Intervalizing k-colored graphs
Non-fictie
Engels | 4 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1995
Gedrukt boek
Hans L. Bodlaender | B. de Fluiter On intervalizing k-colored graphs for DNA physical mapping
Non-fictie
Engels | 4 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1995
Gedrukt boek
Hans L. Bodlaender | B. de Fluiter Reduction algorithms for graphs with small treewidth
Non-fictie
Engels | 43 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1995
Gedrukt boek
Hans L. Bodlaender | Michael R. Fellows W[2]-hardness of precedence constrained K-processor scheduling
Non-fictie
Engels | 8 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1994
Gedrukt boek
Hans L. Bodlaender A linear time algorithm for finding tree-decompositions of small treewidth
Non-fictie
Engels | 16 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1992
Gedrukt boek