Volume 108,
Number 1-2,
February 2001
Workshop on Graph Theoretic Concepts in Computer Science,
Slovakia,
15 January 2001
- Juraj Hromkovic, Ondrej Sýkora:
Preface.
1-2 BibTeX
- Serafino Cicerone, Gabriele Di Stefano:
Graphs with bounded induced distance.
3-21 BibTeX
- Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic.
23-52 BibTeX
- Peter Damaschke:
Minus domination in small-degree graphs.
53-64 BibTeX
- Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto:
SPLITTING NUMBER is NP-complete.
65-83 BibTeX
- Sándor P. Fekete, Jana Kremer:
Tree spanners in planar graphs.
85-103 BibTeX
- Dagmar Handke:
Independent tree spanners: fault-tolerant spanning trees with constant distance guarantees.
105-127 BibTeX
- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth:
Upgrading bottleneck constrained forests.
129-142 BibTeX
- Markus Röttger, Ulf-Peter Schroeder:
Efficient embeddings of grids into grids.
143-173 BibTeX
- Farhad Shahrokhi, László A. Székely:
Constructing integral uniform flows in symmetric networks with application to the edge-forwarding index problem.
175-191 BibTeX
- Maurizio Talamo, Paola Vocca:
Representing graphs implicitly using almost optimal space.
193-210 BibTeX
Volume 108,
Number 3,
March 2001
- Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams:
Maximum-entropy remote sampling.
211-226 BibTeX
- Yijie Han, Weifa Liang, Xiaojun Shen:
Very fast parallel algorithms for approximate edge coloring.
227-238 BibTeX
- Claire Hanen, Alix Munier:
An approximation algorithm for scheduling dependent tasks on m processors with small communication delays.
239-257 BibTeX
- Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia:
Ray shooting from convex ranges.
259-267 BibTeX
- Jon Lee, Dan Wilson:
Polyhedral methods for piecewise-linear functions I: the lambda method.
269-285 BibTeX
- Victor Mitrana, Ralf Stiebe:
Extended finite automata over groups.
287-300 BibTeX
- Andreas Brandstädt, Vadim V. Lozin:
A note on alpha-redundant vertices in graphs.
301-308 BibTeX
- Jon T. Butler, Gerhard W. Dueck, Svetlana N. Yanushkevich, Vlad P. Shmerko:
On the number of generators for transeunt triangles.
309-316 BibTeX
- Walter Kern, Daniël Paulusma:
The new FIFA rules are hard: complexity aspects of sports competitions.
317-323 BibTeX
- Gerhard J. Woeginger:
A note on the depth function of combinatorial optimization problems.
325-328 BibTeX
- Guochuan Zhang:
An on-line bin-batching problem.
329-333 BibTeX
Copyright © Sat May 16 23:55:14 2009
by Michael Ley (ley@uni-trier.de)
