@article{Gobel-Neutel/00,
AUTHOR = {G{\"o}bel, F. and Neutel, E.A.},
TITLE = {Cyclic graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {3-12},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Gropp/00,
AUTHOR = {Gropp, Harald},
TITLE = {On some infinite series of $(r,1)$-designs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {13-21},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Gvozdjak-Horak-Meszka-Skupien/00,
AUTHOR = {Gvozdjak, Pavol and Hor{\'{a}}k, Peter and Meszka, Mariusz and Skupie{\'n}, Zdzislaw},
TITLE = {On the strong chromatic index of cyclic multigraphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {23-38},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Halldorsson-Kratochvil-Telle/00,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M. and Kratochv{\'{i}}l, Jan and Telle, Jan Arne},
TITLE = {Independent sets with domination constraints},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {39-54},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Hamacher-Hochstattler-Moll/00,
AUTHOR = {Hamacher, Anja and Hochst{\"a}ttler, Winfried and Moll, Christoph},
TITLE = {Tree partitioning under constraints --- Clustering for vehicle routing problems},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {55-69},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Huck/00,
AUTHOR = {Huck, Andreas},
TITLE = {Reducible configurations for the cycle double cover conjecture},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {71-90},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Kohler/00,
AUTHOR = {K{\"o}hler, Ekkehard},
TITLE = {Connected domination and dominating clique in trapezoid graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {91-110},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Kratsch/00,
AUTHOR = {Kratsch, Dieter},
TITLE = {Domination and total domination on asteroidal triple-free graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {111-123},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Kruger/00,
AUTHOR = {Kr{\"u}ger, Ulrich},
TITLE = {Structural aspects of ordered polymatroids},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {125-148},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Melissen-Schuur/00,
AUTHOR = {Melissen, J.B.M. and Schuur, P.C.},
TITLE = {Covering a rectangle with six and seven circles},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {149-156},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Peter-Wambach/00,
AUTHOR = {Peter, Markus and Wambach, Georg},
TITLE = {$N$-extendible posets, and how to minimize total weighted completion time},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {157-167},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Prisner/00a,
AUTHOR = {Prisner, Erich},
TITLE = {Recognizing $k$-path graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {169-181},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Srivastav-Stangier/00,
AUTHOR = {Srivastav, Anand and Stangier, Peter},
TITLE = {On complexity, representation and approximation of integral multicommodity flows},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {183-208},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Tuza-Voloshin/00,
AUTHOR = {Tuza, Zsolt and Voloshin, Vitaly},
TITLE = {Uncolorable mixed hypergraphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {209-227},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Warners-Maaren/00,
AUTHOR = {Warners, Joost P. and Maaren, Hans van},
TITLE = {Recognition of tractable satisfiability problems through balanced polynomial representations},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {229-244},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Yao-Guo-Zhang/00,
AUTHOR = {Yao, Tianxing and Guo, Yubao and Zhang, Kemin},
TITLE = {Pancyclic out-arcs of a vertex in tournaments},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {245-249},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Ziolo/00,
AUTHOR = {Zio{\l}o, Irmina A.},
TITLE = {Subtrees of bipartite digraphs --- The minimum degree condition},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {251-259},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Angel-Zissimopoulos/00,
AUTHOR = {Angel, Eric and Zissimopoulos, Vassilis},
TITLE = {On the classification of $NP$-complete problems in terms of their correlation coefficient},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {261-277},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Arbib-Flammini-Nardelli/00,
AUTHOR = {Arbib, Claudio and Flammini, Michele and Nardelli, Enrico},
TITLE = {How to survive while visiting a graph},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {279-293},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Babel/00,
AUTHOR = {Babel, Luitpold},
TITLE = {Recognition and isomorphism of tree-like $P_4$-connected graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {295-315},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Bauer-Broersma-Veldman/00,
AUTHOR = {Bauer, D. and Broersma, H.J. and Veldman, H.J.},
TITLE = {Not every 2-tough graph is Hamiltonian},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {317-321},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Bauer-Katona-Kratsch-Veldman/00,
AUTHOR = {Bauer, D. and Katona, G.Y. and Kratsch, D. and Veldman, H.J.},
TITLE = {Chordality and 2-factors in tough graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {323-329},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Betten-Brinkmann-Pisanski/00,
AUTHOR = {Betten, Anton and Brinkmann, Gunnar and Pisanski, Toma{\v{z}}},
TITLE = {Counting symmetric configurations $v_3$},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {331-338},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Boliac-Lozovanu-Solomon/00,
AUTHOR = {Boliac, R. and Lozovanu and Solomon, D.},
TITLE = {Optimal paths in network games with $p$ players},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {339-348},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Brandstadt-Le/00,
AUTHOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
TITLE = {Recognizing the $P_4$-structure of block graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {349-366},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Broersma-Dahlhaus-Kloks/00,
AUTHOR = {Broersma, H.J. and Dahlhaus, E. and Kloks, T.},
TITLE = {A linear time algorith for minimum fill-in and treewidth for distance hereditary graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {367-400},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Carstens-Dinski-Steffen/00,
AUTHOR = {Carstens, H.G. and Dinski, T. and Steffen, E.},
TITLE = {Reduction of symmetric configurations $n_3$},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {401-411},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Deneko-Woeginger/00,
AUTHOR = {De{\u{\i}}neko, Vladimir G. and Woeginger, Gerhard J.},
TITLE = {The maximum Travelling Salesman problem on symmetric Demidenko matrices},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {413-425},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Dragan/00,
AUTHOR = {Dragan, Feodor F.},
TITLE = {Strongly orderable graphs --- A common generalization of strongly chordal and chordal bipartite graphs},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {427-442},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}
@article{Friedl-Tsai/00,
AUTHOR = {Friedl, Katalin and Tsai, Shi-Chun},
TITLE = {Two results on the bit extraction problem},
JOURNAL = {Discrete Appl.~Math.},
VOLUME = {99},
NUMBER = {1-3},
PAGES = {443-454},
YEAR = {2000},
PUBLISHER = {Elsevier Science Publishers B.V. (North Holland)},
ADDRESS = {Amsterdam-Lausanne-New York-Oxford-Shannon-Tokyo},
}