Volume 3,
May 1999
6th Twente Workshop on Graphs and Combinatorial Optimization,
University of Twente,
Enschede,
the Netherlands,
26-28 May 1999,
Edited by H.J. Broersma,
U. Faigle,
C. Hoede and J.L. Hurink
- Claudio Arbib:
A Primal-Dual Property of the Upper Chromatic Number of Mixed Hypergraphs.
2-6
Electronic Edition (link) BibTeX
- Van Bang Le:
Bipartite-Perfect Graphs.
7-12
Electronic Edition (link) BibTeX
- Ulrich Blasum, Winfried Hochstättler, Peter Oertel:
STEINER-Diagrams.
13-18
Electronic Edition (link) BibTeX
- Hans L. Bodlaender, Ton Kloks, Rolf Niedermeier:
SIMPLE MAX-CUT for unit interval graphs and graphs with few P4s.
19-26
Electronic Edition (link) BibTeX
- S. Brandt:
Triangle-free graphs without forbidden subgraphs.
27
Electronic Edition (link) BibTeX
- Gunnar Brinkmann, Brendan D. McKay:
Fast generation of some classes of planar graphs.
28-31
Electronic Edition (link) BibTeX
- Gunnar Brinkmann, U. von Nathusius, A. H. R. Palser:
Fast generation of nanotube caps.
32
Electronic Edition (link) BibTeX
- Janka Chlebíková:
The structure of obstructions to treewidth and pathwidth.
33-38
Electronic Edition (link) BibTeX
- Victor Chepoi, Feodor F. Dragan:
A note on distance approximating trees in graphs.
39
Electronic Edition (link) BibTeX
- Veerle Fack, Stijn Lievens, Joris Van der Jeugt:
On bounds for the rotation distance between binary coupling trees.
40-44
Electronic Edition (link) BibTeX
- Corinne Feremans, Martine Labbé, Gilbert Laporte:
The Generalized Minimum Spanning Tree: Polyhedra and Branch-and-Cut.
45-50
Electronic Edition (link) BibTeX
- Miranca Fischermann, Lutz Volkmann:
Graphs having distance-n domination number half their order.
51-54
Electronic Edition (link) BibTeX
- Juliane Greinus, Gunnar Brinkmann:
Patches with minimal boundary length.
55-59
Electronic Edition (link) BibTeX
- Harald Gropp:
On triple systems, in particular those with 13 elements.
60-64
Electronic Edition (link) BibTeX
- Yubao Guo, Jin Ho Kwak:
The cycle structure of regular multipartite tournaments.
65-68
Electronic Edition (link) BibTeX
- Thomas Harmuth:
The enumeration of cubic maps with given genus and given face degrees.
69-71
Electronic Edition (link) BibTeX
- Mark Hartmann, Özgür Özlük:
Solving the Traveling Circus Problem by Branch & Cut.
72-76
Electronic Edition (link) BibTeX
- M. Hayer, Winfried Hochstättler:
Test Sets for Vertex Cover Problems.
77-81
Electronic Edition (link) BibTeX
- Arne Hoffmann, Bert Randerath, Lutz Volkmann:
Maximal Sets of 2-Factors in Complete Equipartite Graphs.
82-85
Electronic Edition (link) BibTeX
- Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly I. Voloshin, Douglas B. West:
Chromatic spectrum is broken.
86-89
Electronic Edition (link) BibTeX
- Sandi Klavzar, Uros Milutinovic, Ciril Petr:
On the Frame-Stewarr algorithm for the multi-peg Tower of Hanoi problem (Extended Abstract).
90-93
Electronic Edition (link) BibTeX
- Ton Kloks, Dieter Kratsch, Haiko Müller:
On the structure of graphs with bounded asteroidal number.
94
Electronic Edition (link) BibTeX
- Ekkehard Köhler, Matthias Kriesell:
Edge-Dominating Trails in AT-free Graphs (Extended Abstract).
95-101
Electronic Edition (link) BibTeX
- Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen:
Solving Frequency Assignment Problems via Tree-Decomposition1.
102-105
Electronic Edition (link) BibTeX
- Dieter Kratsch, Lorna Stewart:
Approximating Bandwidth by Mixing Layouts of Interval Graphs.
106-109
Electronic Edition (link) BibTeX
- Matthias Kriesell:
Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity.
110-113
Electronic Edition (link) BibTeX
- Jamel Lakhal, Luc Litzler:
An NC Algorithm for the Perfect Matching Problem in Larger cycle-free Graphs.
114-117
Electronic Edition (link) BibTeX
- Martin Lugering:
Provably Good Global Routing of Integrated Circuits.
118-127
Electronic Edition (link) BibTeX
- Lilian Markenzon, N. Paciornik:
Equilateral Drawing of 2-Connected Planar Chordal Graphs.
128-132
Electronic Edition (link) BibTeX
- Aziz Moukrim:
Non-preemptive Profile Scheduling and Quasi Interval Orders.
133-139
Electronic Edition (link) BibTeX
- H. M. Mulder:
Intersection graphs on trees with a tolerance.
140
Electronic Edition (link) BibTeX
- M. Nakamura:
Lifting and reduction of antimatroids.
141
Electronic Edition (link) BibTeX
- Thomas Niessen, Jaakob Kind:
Polyhedral Sets and Integer Rounding.
142-145
Electronic Edition (link) BibTeX
- Stavros D. Nikolopoulos:
Coloring permutation graphs in parallel.
146-152
Electronic Edition (link) BibTeX
- Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem.
153-156
Electronic Edition (link) BibTeX
- Dmitrii V. Pasechnik:
Bipartite sandwiches: semide?nite relaxations for maximum biclique.
157-161
Electronic Edition (link) BibTeX
- Artem V. Pyatkin:
The incidentor coloring of multigraphs and its application in data networks.
162-165
Electronic Edition (link) BibTeX
- Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes:
Vertex Pancyclic Graphs.
166-170
Electronic Edition (link) BibTeX
- R. M. N. D. Rodrigues, N. M. M. Abreu, Lilian Markenzon:
Maxregularity and Maximal Outerplanar Graphs.
171-175
Electronic Edition (link) BibTeX
- Annette Schelten, Ingo Schiermeyer, Ralph J. Faudree:
3-colored Ramsey Numbers of Odd Cycles.
176-178
Electronic Edition (link) BibTeX
- Anand Srivastav, Hartmut Schroeter, Christoph Michel:
Alternating TSP and Printed Circuit Board Assembly.
179-183
Electronic Edition (link) BibTeX
- Yannis C. Stamatiou, Dimitrios M. Thilikos:
Monotonicity and inert fugitive search games.
184
Electronic Edition (link) BibTeX
- Meike Tewes:
Pancyclic orderings of in-tournaments.
185-188
Electronic Edition (link) BibTeX
- Dimitrios M. Thilikos:
Quickly Excluding K2, r from Planar Graphs.
189-194
Electronic Edition (link) BibTeX
- Robert Tijdeman:
Discrete tomography in four directions.
195-198
Electronic Edition (link) BibTeX
- Jean-Marie Vanherpe:
On canonical decomposition of bipartite graphs.
199-204
Electronic Edition (link) BibTeX
- Hansjoachim Walther:
Polyhedral Graphs with Extreme Numbers of Types of Faces.
205-207
Electronic Edition (link) BibTeX
- Ligong Wang, Xueliang Li, Ruying Liu:
Integral Trees With Diameter 6 or 8.
208-213
Electronic Edition (link) BibTeX
- A. Pawel Wojda:
Erdös-type condition for a graph to contain k independent edges.
214-216
Electronic Edition (link) BibTeX
- Blaz Zmazek, Janez Zerovnik:
Algorithm for Recognizing Cartesian Graph Bundles.
217-221
Electronic Edition (link) BibTeX
- B. Reed:
Introducing Directed Tree Width.
222-229
Electronic Edition (link) BibTeX
- Celina M. Herrera de Figueiredo, John Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
Linear-time Algorithms for Maximum Sets of Sources and sinks.
230-234
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:58:05 2009
by Michael Ley (ley@uni-trier.de)