WG B

38 papers

YearTitle / Authors
1999A Multi-Scale Algorithm for Drawing Graphs Nicely.
Ronny Hadany, David Harel
1999All Separating Triangles in a Plane Graph Can Be Optimally "Broken" in Polynomial Time.
Anna Accornero, Massimo Ancona, Sonia Varini
1999An Improved Algorithm for Finding Tree Decompositions of Small Width.
Ljubomir Perkovic, Bruce A. Reed
1999An Optimal Fault-Tolerant Routing for Triconnected Planar Graphs.
Koichi Wada, Yoriyuki Nagata, Wei Chen
1999Box-Rectangular Drawings of Plane Graphs.
Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki
1999Complexity Classification of Some Edge Modification Problems.
Assaf Natanzon, Ron Shamir, Roded Sharan
1999Dihamiltonian Decomposition of Regular Graphs with Degree Three.
Jung-Heum Park, Hee-Chul Kim
1999Efficient Analysis of Graphs with Small Minimal Separators.
Konstantin Skodinis
1999Euler is Standing in Line.
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth
1999Finding Smallest Supertrees Under Minor Containment.
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
1999Fixed-Parameter Complexity of lambda-Labelings.
Jirí Fiala, Ton Kloks, Jan Kratochvíl
1999Generating All the Minimal Separators of a Graph.
Anne Berry, Jean Paul Bordat, Olivier Cogis
1999Graph-Theoretic Concepts in Computer Science, 25th International Workshop, WG '99, Ascona, Switzerland, June 17-19, 1999, Proceedings
Peter Widmayer, Gabriele Neyer, Stephan J. Eidenbenz
1999Induced Matchings in Regular Graphs and Trees.
Michele Zito
1999Informatica, Scoula, Communità: Uno Sguardo dall' Occhio del Ciclone.
Nicola Santoro
1999Invited Lecture: Discrete Optimization Methods for Packing Problems in Two and Three Dimensions - With Applications in the Textile and Car Manufacturing Industries.
Thomas Lengauer
1999Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts.
Susanne Albers
1999Invited Lecture: Silver Graphs: Achievements and New Challenges.
Hartmut Noltemeier
1999Linear Orderings of Random Geometric Graphs.
Josep Díaz, Mathew D. Penrose, Jordi Petit, Maria J. Serna
1999Linear Time Algorithms for Hamiltonian Problems on (Claw, Net)-Free Graphs.
Andreas Brandstädt, Feodor F. Dragan, Ekkehard Köhler
1999Lower Bounds for Approximating Shortest Superstrings over an Alphabet of Size 2.
Sascha Ott
1999Mod-2 Independence and Domination in Graphs.
Magnús M. Halldórsson, Jan Kratochvíl, Jan Arne Telle
1999NLC
Öjvind Johansson
1999On Claw-Free Asteroidal Triple-Free Graphs.
Harald Hempel, Dieter Kratsch
1999On Minimum Diameter Spanning Trees under Reload Costs.
Hans-Christoph Wirth, Jan Steffan
1999On the Clique-Width of Perfect Graph Classes.
Martin Charles Golumbic, Udi Rotics
1999On the Hardness of Recognizing Bundles in Time Table Graphs.
Annegret Liebers, Dorothea Wagner, Karsten Weihe
1999On the Nature of Structure and Its Identification.
Benno Stein, Oliver Niggemann
1999Optimal Cuts for Powers of the Petersen Graph.
Sergei L. Bezrukov, Sajal K. Das, Robert Elsässer
1999Optimal Irreversible Dynamos in Chordal Rings.
Paola Flocchini, Frédéric Geurts, Nicola Santoro
1999Optimal Solutions for Frequency Assignment Problems via Tree Decomposition.
Arie M. C. A. Koster, Stan P. M. van Hoesel, Antoon W. J. Kolen
1999Proximity-Preserving Labeling Schemes and Their Applications.
David Peleg
1999Recognizing Bipartite Incident-Graphs of Circulant Digraphs.
Johanne Cohen, Pierre Fraigniaud, Cyril Gavoille
1999Routing Permutations in the Hypercube.
Olivier Baudon, Guillaume Fertin, Ivan Havel
1999Triangulated Neighbourhoods in
Igor Parfenoff, Florian Roussel, Irena Rusu
1999Two Broadcasting Problems in Faulty Hypercubes.
Stefan Dobrev, Imrich Vrto
1999Vertex Cover: Further Observations and Further Improvements.
Jianer Chen, Iyad A. Kanj, Weijia Jia
1999Vertex Partitioning of Crown-Free Interval Graphs.
Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani