default search action
21. WG 1995: Aachen, Germany
- Manfred Nagl
:
Graph-Theoretic Concepts in Computer Science, 21st International Workshop, WG '95, Aachen, Germany, June 20-22, 1995, Proceedings. Lecture Notes in Computer Science 1017, Springer 1995, ISBN 3-540-60618-1 - Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger:
VC-Dimensions for Graphs (Extended Abstract). 1-13 - Ton Kloks, Dieter Kratsch, Haiko Müller:
Finding and Counting Small Induced Subgraphs Efficiently. 14-23 - Luitpold Babel, Stephan Olariu:
On the Isomorphism of Graphs with Few P4s. 24-36 - Daniele Giorgio Degiorgi, Klaus Simon:
A Dynamic Algorithm for Line Graph Recognition. 37-48 - Fabrizio d'Amore, Roberto Giaccio:
Incremental Hive Graph. 49-61 - Hristo N. Djidjev, Shankar M. Venkatesan:
Planarization of Graphs Embedded on Surfaces. 62-72 - Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe:
Complexity and Approximability of Certain Bicriteria Location Problems. 73-87 - Detlef Plump:
On Termination of Graph Rewriting. 88-100 - Michel Bauderon:
A Uniform Approach to Graph Rewriting: The Pullback Approach. 101-115 - F. David Fracchia:
Visualizing Two- and Three-Dimensional Models of Meristematic Growth. 116-130 - Sven Hartmann:
Graph-Theoretical Methods to Construct Entity-Relationship Databases. 131-145 - Ingo Schiermeyer:
An Approximation Algorithm for 3-Colourability. 146-151 - Sophie Fischer, Leen Torenvliet:
The Malleability of TSP_{2Opt}. 152-166 - Paola Alimonti:
Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems. 167-180 - Hans L. Bodlaender
On Interval Routing Schemes and Treewidth. 181-196 - Koichi Wada, Takaharu Ikeo, Kimio Kawaguchi, Wei Chen:
Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. 197-208 - Friedhelm Meyer auf der Heide, Matthias Westermann:
Hot-Potato Routing on Multi-Dimensional Tori. 209-221 - Michele Flammini, Giorgio Gambosi, Sandro Salomone:
On Devising Boolean Routing Schemes. 222-236 - Barbara D. Birchler, Abdol-Hossein Esfahanian, Eric Torng:
Toward a General Theory of Unicast-Based Multicast Communication. 237-251 - José D. P. Rolim, Ondrej Sýkora, Imrich Vrto:
Optimal Cutwidths and Bisection Widths of 2- and 3-Dimensional Meshes. 252-264 - Peter Damaschke:
Searching for Faulty Leaves in Binary Trees. 265-274 - Zhi-Zhong Chen, Xin He:
NC Algorithms for Partitioning Planar Graphs into Induced Forests and Approximating NP-Hard Problems. 275-289 - Elias Dahlhaus:
Efficient Parallel Modular Decomposition (Extended Abstract). 290-302 - Paola Bonizzoni, Gianluca Della Vedova
Modular Decomposition of Hypergraphs. 303-317 - John L. Pfaltz:
Partition Coefficients of Acyclic Graphs. 318-322 - Tadao Takaoka:
Sub-Cubic Cost Algorithms for the All Pairs Shortest Path Problem. 323-343 - Jitender S. Deogun, Dieter Kratsch:
Diametral Path Graphs. 344-357 - Philippe Galinier, Michel Habib, Christophe Paul:
Chordal Graphs and Their Clique Graphs. 358-371 - Jens Gustedt
A Compact Data Structure and Parallel Algorithms for Permutation Graphs. 372-380 - Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai:
Homogeneously Orderable Graphs and the Steiner Tree Problem. 381-395
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 00:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: