| 1999 | Invited Lecture: Silver Graphs: Achievements and New Challenges. | Hartmut Noltemeier |
| 1999 | Finding Smallest Supertrees Under Minor Containment. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 1999 | Complexity Classification of Some Edge Modification Problems. | Assaf Natanzon, Ron Shamir, Roded Sharan |
| 1999 | On the Hardness of Recognizing Bundles in Time Table Graphs. | Annegret Liebers, Dorothea Wagner, Karsten Weihe |
| 1999 | Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries. | Thomas Lengauer |
| 1999 | Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. | Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen |
| 1999 | NLC | jvind Johansson |
| 1999 | On Claw-Free Asteroidal Triple-Free Graphs. | Harald Hempel, Dieter Kratsch |
| 1999 | Euler is Standing in Line. | Dietrich Hauptmeier, Sven Oliver Krumke, Jrg Rambau, Hans-Christoph Wirth |
| 1999 | Mod-2 Independence and Domination in Graphs. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1999 | A Multi-Scale Algorithm for Drawing Graphs Nicely. | Ronny Hadany, David Harel |
| 1999 | On the Clique-Width of Perfect Graph Classes. | Martin Charles Golumbic, Udi Rotics |
| 1999 | Optimal Irreversible Dynamos in Chordal Rings. | Paola Flocchini, Frdric Geurts, Nicola Santoro |
| 1999 | Fixed-Parameter Complexity of lambda-Labelings. | Jir Fiala, Ton Kloks, Jan Kratochvl |
| 1999 | Two Broadcasting Problems in Faulty Hypercubes. | Stefan Dobrev, Imrich Vrto |
| 1999 | Linear Orderings of Random Geometric Graphs. | Josep Daz, Mathew D. Penrose, Jordi Petit, Maria J. Serna |
| 1999 | Vertex Partitioning of Crown-Free Interval Graphs. | Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani |
| 1999 | Recognizing Bipartite Incident-Graphs of Circulant Digraphs. | Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille |
| 1999 | Vertex Cover: Further Observations and Further Improvements. | Jianer Chen, Iyad A. Kanj, Weijia Jia |
| 1999 | Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs. | Andreas Brandstdt, Feodor F. Dragan, Ekkehard Khler |
| 1999 | Optimal Cuts for Powers of the Petersen Graph. | Sergei L. Bezrukov, Sajal K. Das, Robert Elssser |
| 1999 | Generating All the Minimal Separators of a Graph. | Anne Berry, Jean Paul Bordat, Olivier Cogis |
| 1999 | Routing Permutations in the Hypercube. | Olivier Baudon, Guillaume Fertin, Ivan Havel |
| 1999 | Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. | Susanne Albers |
| 1999 | All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time. | Anna Accornero, Massimo Ancona, Sonia Varini |