Volume 99, Number 1-3, February 2000
- F. Göbel, E. A. Neutel:
Cyclic Graphs.
3-12
- Harald Gropp:
On some Infinite Series of (r, 1)-Designs.
13-21
- Pavol Gvozdjak, Peter Horák, Mariusz Meszka, Zdzislaw Skupien:
On the Strong Chromatic Index of Cyclic Multigraphs.
23-38
- Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle:
Independent Sets with Domination Constraints.
39-54
- Anja Hamacher, Winfried Hochstättler, Christoph Moll:
Tree Partitioning Under Constraints - Clustering for Vehicle Routing Problems.
55-69
- Andreas Huck:
Reducible Configurations for the Cycle Double Cover Conjecture.
71-90
- Ekkehard Köhler:
Connected Domination and Dominating Clique in Trapezoid Graphs.
91-110
- Dieter Kratsch:
Domination and Total Domination on Asteroidal Triple-free Graphs.
111-123
- Ulrich Krüger:
Structural Aspects of Ordered Polymatroids.
125-148
- Jan B. M. Melissen, P. C. Schuur:
Covering a Rectangle with Six and Seven Circles.
149-156
- Markus Peter, Georg Wambach:
N-extendible Posets, and How to Minimize Total Weighted Completion Time.
157-167
- Erich Prisner:
Recognizing k-path Graphs.
169-181
- Anand Srivastav, Peter Stangier:
On Complexity, Representation and Approximation of Integral Multicommodity Flows.
183-208
- Zsolt Tuza, Vitaly I. Voloshin:
Uncolorable Mixed Hypergraphs.
209-227
- Joost P. Warners, Hans van Maaren:
Recognition of Tractable Satisfiability Problems through Balanced Polynomial Representations.
229-244
- Tianxing Yao, Yubao Guo, Kemin Zhang:
Pancyclic out-arcs of a Vertex in Tournaments.
245-249
- Irmina A. Ziolo:
Subtrees of Bipartite Digraphs - The Minimum Degree Condition.
251-259
- Eric Angel, Vassilis Zissimopoulos:
On the Classification of NP-complete Problems in Terms of Their Correlation Coefficient.
261-277
- Claudio Arbib, Michele Flammini, Enrico Nardelli:
How to Survive While Visiting a Graph.
279-293
- Luitpold Babel:
Recognition and Isomorphism of Tree-like P4-connected Graphs.
295-315
- Douglas Bauer, Hajo Broersma, Henk Jan Veldman:
Not Every 2-tough Graph Is Hamiltonian.
317-321
- Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs.
323-329
- Anton Betten, Gunnar Brinkmann, Tomaz Pisanski:
Counting Symmetric Configurations v3.
331-338
- Rodica Boliac, Dmitrii Lozovanu, D. Solomon:
Optimal Paths in Network Games with P Players.
339-348
- Andreas Brandstädt, Van Bang Le:
Recognizing the P4-structure of Block Graphs.
349-366
- Hajo Broersma, Elias Dahlhaus, Ton Kloks:
A Linear Time Algorithm for Minimum Fill-in and Treewidth for Distance Hereditary Graphs.
367-400
- Hans Georg Carstens, Thomas Dinski, Eckhard Steffen:
Reduction of Symmetric Configurations n3.
401-411
- Vladimir G. Deineko, Gerhard J. Woeginger:
The Maximum Travelling Salesman Problem on Symmetric Demidenko Matrices.
413-425
- Feodor F. Dragan:
Strongly Orderable Graphs a Common Generalization of Strongly Chordal and Chordal Bipartite Graphs.
427-442
- Katalin Friedl, Shi-Chun Tsai:
Two Results on the Bit Extraction Problem.
443-454
Last update Tue May 21 18:46:50 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
