default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID20. WG 1994: Herrsching, Germany
- Ernst W. Mayr, Gunther Schmidt
, Gottfried Tinhofer:
Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings. Lecture Notes in Computer Science 903, Springer 1995, ISBN 3-540-59071-4 - Hans L. Bodlaender, Joost Engelfriet:
Domino Treewith (Extended Abstract). 1-13 - Siddharthan Ramachandramurthi:
A Lower Bound for Treewidth and Its Consequences. 14-25 - Renate Garbe:
Tree-width and Path-width of Comparability Graphs of interval Orders. 26-37 - Jürgen Ebert, Angelika Franzke:
A Declarative Approach to Graph Based Modeling. 38-50 - Francesco Parisi-Presicce, Gabriele Piersanti:
Multilevel Graph Grammars. 51-64 - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. 65-80 - Elias Dahlhaus, Peter L. Hammer, Frédéric Maffray, Stephan Olariu:
On Domination Elimination Orderings and Domination Graphs (Extended Abstract). 81-92 - Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle:
Complexity of Graph Covering Problems. 93-105 - Ton Kloks, Dieter Kratsch, Haiko Müller:
Dominoes. 106-120 - Volker Turau, Weimin Chen:
GLB-Closures in Directed Acyclic Graphs and Their Applications. 121-129 - Pierluigi Crescenzi, Luca Trevisan:
Minimum Vertex Cover, Distributed Decision-Making, and Communication Complexity (Extended Abstract). 130-139 - Thomas Andreae, Michael Nölle, Gerald Schreiber:
Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). 140-150 - Andy Schürr:
Specification of Graph Translators with Triple Graph Grammars. 151-163 - Bernhard Westfechtel:
Using Programmed Graph Rewriting for the Formal Specification of a Configuration Management System. 164-179 - Konstantin Skodinis, Egon Wanke:
Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. 180-192 - Dharmavani Bhagavathi, Venkatavasu Bokka, Himabindu Gurla, Stephan Olariu, James L. Schwing:
Time-Optimal Tree Computations on Sparse Meshes. 193-205 - Shiva Chaudhuri, Torben Hagerup:
Prefix Graphs and Their Applications. 206-218 - Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer:
The Complexity of Broadcasting in Planar and Decomposable Graphs. 219-231 - Zhi-Zhong Chen:
The Maximal f-Dependent Set Problem for Planar Graphs is in NC. 232-241 - Giuseppe Di Battista, Roberto Tamassia, Luca Vismara:
On-Line Convex Plabarity Testing. 242-255 - Farhad Shahrokhi, Ondrej Sýkora, László A. Székely, Imrich Vrto:
Book Embeddings and Crossing Numbers. 256-268 - Valeska Naumann:
Measuring the Distance to Series-Parallelity by Path Expressions. 269-281 - Mordecai J. Golin, Shmuel Zaks:
Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. 282-291 - Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, Zsolt Tuza:
Ranking of Graphs. 292-304 - Heiko Dörr:
Bypass Strong V-Structures and Find an Isomorphic Labelled Subgraph in Linear Time. 305-318 - Koichi Wada, Akinari Takaki, Kimio Kawaguchi:
Efficient Algorithms for a Mixed k-Partition Problem of Graphs without Specifying Bases. 319-330 - Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos:
Fugitive-Search Games on Graphs and Related Parameters. 331-342 - Yoji Kajitani, Jun Dong Cho, Majid Sarrafzadeh:
New Approximation Results on Graph Matching and related Problems. 343-358 - Detlef Sieling, Ingo Wegener:
New Lower Bounds and Hierarchy Results for Restricted Branching Programs. 359-370 - Roberto Giaccio:
On-line Algorithms for Satisfiability Problems with Uncertainty. 371-386 - Evripidis Bampis, Yannis Manoussakis, Ioannis Milis:
NC Algorithms for Antidirected Hamiltonian Paths and Cycles in Tournaments (Extended Abstract). 387-394 - Luitpold Babel, Ilia N. Ponomarenko, Gottfried Tinhofer:
Direct Path Graph Isomorphism (Extended Abstract). 395-406
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 2025-10-28 21:45 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:
