Zoekresultaten
Resultaat 1 - 14 (van 14)
Hans L. Bodlaender On disjoint cycles
Non-fictie
Engels | 12 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1990
Gedrukt boek
Hans L. Bodlaender Complexity of path forming games
Non-fictie
Engels | 39 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Hans L. Bodlaender On the complexity of some coloring games
Non-fictie
Engels | 17 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Hans L. Bodlaender | Gerard Tel | Nicola Santoro Trade-offs in non-reversing diameter
Non-fictie
Engels | 23 pagina's | Department of Computer Science, Utrecht University, Utrecht | 1989
Gedrukt boek
Hans L. Bodlaender Achromatic number is NP-complete for cographs and interval graphs
Non-fictie
Engels | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Hans L. Bodlaender New lower bound techniques for distributed leader finding and other problems on rings of processors
Non-fictie
Engels | 19 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Hans L. Bodlaender Planar graphs with bounded treewidth
Non-fictie
Engels | 7 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek
Hans L. Bodlaender A better lowerbound for distributed leader finding in bidirectional asynchronous rings of processors
Non-fictie
Engels | 7 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1987
Gedrukt boek
Hans L. Bodlaender Dynamic programming on graphs with bounded treewidth
Non-fictie
Engels | 50 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1987
Gedrukt boek
Hans L. Bodlaender Distributed computing: structure and complexity
Non-fictie
Engels | 294 pagina's | Centrum voor Wiskunde en Informatica, Amsterdam | 1987
Gedrukt boek
Hans L. Bodlaender A new lowerbound technique for distributed extrema finding on rings of processors
Non-fictie
Engels | 16 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1987
Gedrukt boek
Hans L. Bodlaender The maximum cut and minimum cut into bounded sets problems on cographs
Non-fictie
Engels | 8 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1987
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 | S. Moran | Manfred K. Warmuth The distributed bit complexity of the ring
from the anonymous to the non-anonymous case
Non-fictie
Engels | 15 pagina's | Department of Computer Science, University of Utrecht, Utrecht | 1988
Gedrukt boek