2002-01-24 The Use of Transitively Irreducible Kernels of Full Families of Functional Dependencies in Logical Data Base Design. 195-211 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#KandziaM80 2002-01-24 Concurrent Flows and Packet Routing in Cayley Graphs (Preliminary Version). 327-337 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#ShahrokhiS93 2002-01-03 Integral Uniform Flows in Symmetric Networks. 272-284 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#ShahrokhiS98 2002-01-03 A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs. 310-323 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#MiuraTNN98 2002-01-03 Formal Tools for Top-Down and Bottom-Up Generation of Acyclic Relational Schemata. 219-229 1981 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg81.html#BatiniDM81 2006-04-18 Make your Enemies Transparent. 342-353 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#VosS97 2002-01-24 On Complexity of a Message-Routing Strategy for Multicomputer Systems. 170-181 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#ChoiE90 2002-01-03 Clique and Anticlique Partition of Graphs. 67-72 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#BrysL96 2002-01-24 On Linearizing Graphs. 32-41 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#Witt80 2002-07-22 Tree Spanners for Subgraphs and Related Tree Covering Problems. 206-217 http://link.springer.de/link/service/series/0558/bibs/1928/19280206.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#HandkeK00 2002-01-24 Centipede Graphs and Visibility on a Cylinder. 252-263 1986 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg86.html#TamassiaT86 2002-07-22 On the Expected Runtime and the Success Probability of Evolutionary Algorithms. 1-10 http://link.springer.de/link/service/series/0558/bibs/1928/19280001.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#Wegener00 2002-01-24 The Size of Reduced OBDDs and Optimal Read-once Branching Programs for Almost all Boolean Functions. 252-263 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#Wegener93 2002-01-24 Linear Time Algorithms for Testing Approximate Congruence in the Plane. 213-228 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#Iwanowski88 2002-07-10 Optimal Vertex Ordering of a Graph and its Application to Symmetry Detection. 148-158 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#JiangB91 2003-03-25 Embedding Complete Binary Trees in Product Graphs. 56-66 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#BroadwaterEF96 2002-01-24 A Graph-Based Decomposition Approach for Recursive Query Processing. 148-165 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#Seipel88 2002-01-24 Decomposition of Linear Recursive Logic Programs. 291-310 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#Seipel90 2002-01-03 Modular Decomposition of Hypergraphs. 303-317 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#BonizzoniV95 2003-03-03 Bend-Minimum Orthogonal Drawings of Plane 3-Graphs. 367-378 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730367.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#RahmanN02 2002-01-24 On Scheduling Problems Restricted to Interval Orders. 27-36 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#Jansen92 2002-01-24 A Rainbow About T-Colorings for Complete Graphs. 189-199 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#Jansen93 2002-01-03 Induced Matchings in Regular Graphs and Trees. 89-100 http://link.springer.de/link/service/series/0558/bibs/1665/16650089.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#Zito99 2002-01-24 On-line Graph Algorithms for Incremental Compilation. 70-86 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#Marchetti-SpaccamelaNR93 2002-10-21 Attributed Elementarz Programmed Graph Grammars. 75-84 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#FreundH91 2003-09-26 O(n²) Algorithms for Graph Planarization. 352-377 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#JayakumarS88 2002-01-03 GLB-Closures in Directed Acyclic Graphs and Their Applications. 121-129 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#TurauC94 2002-01-03 Families of Graphs Having Broadcasting and Gossiping Properties. 63-77 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#FertinR98 2002-01-24 Two Algorithms for Finding Rectangular Duals of Planar Graphs. 396-410 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#KantH93 2002-01-24 A PrT-Net Representation of Graph Grammars. 20-31 1987 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg87.html#MontonenOT87 2002-01-03 The Complexity of the Matching-Cut Problem. 284-295 2001 WG http://link.springer.de/link/service/series/0558/bibs/2204/22040284.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2001.html#PatrignaniP01 2002-01-03 Drawing Planar Partitions II: HH-Drawings. 124-136 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#BiedlKM98 2002-01-24 F-Factors, Perfect Matchings and Related Concepts. 388-403 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#Derigs80 2002-01-03 A Declarative Approach to Graph Based Modeling. 38-50 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#EbertF94 2002-01-24 Reachablity Homomorphisms on Nets. 326-334 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#EbertP80 2002-07-22 Minimal Size of Piggybacked Information for Tracking Causality: A Graph-Based Characterization. 218-229 http://link.springer.de/link/service/series/0558/bibs/1928/19280218.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#HelaryM00 2005-02-21 An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. 372-383 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#Gorbunov98 2002-01-03 Optimal Solutions for Frequency Assignment Problems via Tree Decomposition. 338-349 http://link.springer.de/link/service/series/0558/bibs/1665/16650338.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#KosterHK99 2002-01-03 On the Isomorphism of Graphs with Few P4s. 24-36 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#BabelO95 2005-01-28 Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers 3353 3-540-24132-9 WG 2004 http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2004.html 2002-01-03 A New Characterization of P4-connected Graphs. 17-30 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#BabelO96 2002-01-03 On the Separable-Homogeneous Decomposition of Graphs (Extended Abstract). 25-37 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#BabelO97 2002-01-03 Domination and Steiner Tree Problems on Graphs with Few P4S. 337-350 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#BabelO98 2002-01-03 Pseudo-Hamiltonian Graphs. 38-51 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#BabelW97 2002-01-03 Optimal Fault-Tolerant ATM-Routings for Biconnected Graphs. 354-367 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#WadaCLK97 2002-01-03 Invited Lecture: Online Algorithms: A Study of Graph-Theoretic Concepts. 10-26 http://link.springer.de/link/service/series/0558/bibs/1665/16650010.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#Albers99 2002-01-03 Highly Fault-Tolerant Routings and Diameter Vulnerability for Generalized Hypercube Graphs. 197-208 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#WadaIKC95 2002-01-03 Finding Smallest Supertrees Under Minor Containment. 303-312 http://link.springer.de/link/service/series/0558/bibs/1665/16650303.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#NishimuraRT99 2004-01-09 ₁_INFMetrics. 70-83 1987 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg87.html#GovindanR87 2002-01-24 Hierarchical Specified Unit Disk Graphs (Extended Abstract). 21-32 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#MaratheRHR93 2002-01-24 The Node Visit Cost of Brother Trees. 106-117 1986 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg86.html#KleinW86 2002-07-22 Diameter of the Knödel Graph. 149-160 http://link.springer.de/link/service/series/0558/bibs/1928/19280149.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#FertinRSSV00 2002-01-03 Communication in the Two-Way Listen-in Vertex-disjoint Paths Mode. 38-49 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#Bockenhauer98 2003-03-03 Cycles in Generalized Networks. 47-56 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730047.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#Brandenburg02 2002-01-24 On the Complexity of Optimal Drawings of Graphs. 166-180 1989 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg89.html#Brandenburg89 2002-01-24 A New Data Structure for Representing Sorted Lists. 90-112 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#Mehlhorn80 2002-01-24 Regular Marked Petri Nets. 264-275 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#Desel93 2003-03-03 Online Call Admission in Optical Networks with Larger Demands. 333-344 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730333.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#KrumkeP02 2003-03-03 Search in Indecomposable Graphs. 80-91 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730080.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#Cournier02 2002-01-03 Homogeneous Sets and Domination Problems. 323-337 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#NicolaiS96 2002-01-03 The Bounded Tree-Width Problem of Context-Free Graph Languages. 303-317 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#Skodinis97 2002-01-03 Efficient Analysis of Graphs with Small Minimal Separators. 155-166 http://link.springer.de/link/service/series/0558/bibs/1665/16650155.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#Skodinis99 2002-01-03 A Dynamic Algorithm for Line Graph Recognition. 37-48 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#DegiorgiS95 2002-01-03 On Minimum Diameter Spanning Trees under Reload Costs. 78-88 http://link.springer.de/link/service/series/0558/bibs/1665/16650078.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#WirthS99 2002-01-03 Nondeterministic Control Structures for Graph Rewriting Systems. 48-62 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#ZundorfS91 2002-01-03 Counting Edges in a Dag. 85-100 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#CiceroneFNP96 2002-01-24 Properties of Ordered Graph Grammars. 70-79 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#Ludwigs80 2002-07-22 Networks with Small Stretch Number. 95-106 http://link.springer.de/link/service/series/0558/bibs/1928/19280095.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#CiceroneS00 2002-01-03 Graphs with Bounded Induced Distance. 177-191 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#CiceroneS98 2002-01-24 An Efficient Algorithm to Recognize Prime Undirected Graphs. 212-224 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#CournierH92 2002-01-24 NC-Algorithms for Graphs with Small Treewidth. 1-10 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#Bodlaender88 2002-01-24 Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth. 232-244 1989 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg89.html#Bodlaender89 2002-01-24 On the Complexity of Some Coloring Games. 30-40 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#Bodlaender90 2002-01-03 On Disjoint Cycles. 230-238 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#Bodlaender91 2002-01-24 Kayles on Special Classes of Graphs - An Application of Sprague-Grundy Theory. 90-102 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#Bodlaender92 2002-01-24 On Reduction Algorithms for Graphs with Small Treewidth. 45-56 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#Bodlaender93 2002-01-03 Improved Approximations of Independent Dominating Set in Bounded Degree Graphs. 2-16 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#AlimontiC96 2002-01-24 Petri Nets, Hypergraphs and Conflicts (Preliminary Version). 293-309 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#AlimontiF92 2002-01-24 Recognizing Outerplanar Graphs in Linear Time. 165-176 1986 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg86.html#Wiegers86 2002-01-24 On Shortcutting Digraphs. 205-211 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#Thorup92 2002-01-03 Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). 318-332 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#Thorup97 2002-07-22 Coloring Mixed Hypertrees. 279-289 http://link.springer.de/link/service/series/0558/bibs/1928/19280279.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#KralKPV00 2002-02-25 Complexity of Coloring Graphs without Forbidden Induced Subgraphs. 254-262 2001 WG http://link.springer.de/link/service/series/0558/bibs/2204/22040254.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2001.html#KralKTW01 2002-07-22 Efficient Dispersion Algorithms for Geometric Intersection Graphs. 107-115 http://link.springer.de/link/service/series/0558/bibs/1928/19280107.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#Damaschke00 2002-01-24 Induced Subgraph Isomorphism for Cographs in NP-Complete. 72-78 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#Damaschke90 2002-01-03 Logic Arrays for Interval Indicator Functions. 219-225 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#Damaschke91 2002-01-03 Searching for Faulty Leaves in Binary Trees. 265-274 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#Damaschke95 2002-01-03 Minus Domination in Small-Degree Graphs. 17-25 1998 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg98.html#Damaschke98 2002-01-03 On the Nature of Structure and Its Identification. 122-134 http://link.springer.de/link/service/series/0558/bibs/1665/16650122.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#SteinN99 2002-01-03 More General Parallel Tree Contraction: Register Allocation and Broadcasting in a Tree. 126-140 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#DiksH96 2002-01-03 System Diagnosis with Smallest Risk of Error. 141-150 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#DiksP96 2003-03-03 On the Minimum Size of a Contraction-Universal Tree. 25-34 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730025.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#Bodini02 2002-07-22 On the Domination Search Number. 161-171 http://link.springer.de/link/service/series/0558/bibs/1928/19280161.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#FominKM00 2003-03-03 The Complexity of Approximating the Oriented Diameter of Chordal Graphs. 211-222 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730211.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#FominMR02 2002-01-24 The Power of a One-Dimensional Vector of Processors. 80-89 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#BentleyO80 2002-01-03 One, Two, Three, Many, or: Complexity Aspects of Dynamic Network Flows with Dedicated Arcs. 254-267 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#KlinzW96 2002-01-24 A Parser for Context Free Plex Grammars. 136-150 1989 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg89.html#BunkeH89 2002-01-03 Independent Spanning Trees of Product Graphs. 338-351 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#ObokataIBI96 2002-01-24 The VLSI layout in various embedding models. 130-139 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#FormannW90 2002-07-22 Traversing Directed Eulerian Mazes. 35-46 http://link.springer.de/link/service/series/0558/bibs/1928/19280035.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#BhattEGT00 2002-01-03 New Lower Bounds and Hierarchy Results for Restricted Branching Programs. 359-370 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#SielingW94 2002-01-03 Exponential Time Analysis of Confluent and Boundary eNCE Graph Languages. 180-192 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#SkodinisW94 2002-01-24 On the transition graphs of automata and grammars. 311-337 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#CaucalM90 2002-01-24 Designing Gamma-Acyclic Database Schemes Using Decomposition and Augmentation Techniques. 171-185 1987 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg87.html#SeipelR87 2002-01-24 On the Estimate of a Directed Graph. 317-326 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#Marchetti-Spaccamela88 2002-01-24 Tolerance Graphs and Orders. 17-26 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#Felsner92 2002-07-22 Approximating the Treewidth of AT-Free Graphs. 59-70 http://link.springer.de/link/service/series/0558/bibs/1928/19280059.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#BouchitteT00 2005-01-10 Planarization of Graphs Embedded on Surfaces. 62-72 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#DijdjevV95 2002-01-24 Finding Minimally Weighted Subgraphs. 18-29 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#PlehnV90 2002-01-03 A Measure of Parallelization for the Lexicographically First Maximal Subgraph Problems. 333-341 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#Uehara97 2002-01-24 Embeddings of Treelike Graphs into 2-Dimensional Meshes. 182-192 1990 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg90.html#Zienicke90 2002-01-24 Alternative Cycle Covers and Paths. 367-378 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#Vornberger80 2002-01-24 Voronoi Diagrams in the Moscow Metric (Extended Abstract). 434-441 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#Klein88 2002-01-24 Combinatorial Properties of Abstract Voronoi Diagrams. 356-369 1989 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg89.html#Klein89 2002-01-03 Optimal Irreversible Dynamos in Chordal Rings. 202-214 http://link.springer.de/link/service/series/0558/bibs/1665/16650202.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#FlocchiniGS99 2002-01-03 Box-Rectangular Drawings of Plane Graphs. 250-261 http://link.springer.de/link/service/series/0558/bibs/1665/16650250.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#RahmanNN99 2002-01-24 Single vs. Double Pushout Derivations of Graphs. 248-262 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#Parisi-Presicce92 2002-01-24 Transitive Closure Algorithms for Very Large Databases. 122-147 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#BiskupS88 2002-01-24 Epsilon-Nets for Halfplanes. 243-252 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#Woeginger88 2003-03-03 DNA Sequencing, Eulerian Graphs, and the Exact Perfect Matching Problem. 13-24 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730013.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#BlazewiczFKSW02 2002-01-24 A Simple Implementation of Warshall's Algorithm on a VLSI Chip. 131-145 1986 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg86.html#DewanganR86 2003-03-03 An Additive Stretched Routing Scheme for Chordal Graphs. 150-163 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730150.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#Dourisboure02 2002-01-03 Cartesian Products of Graphs as Spanning Subgraphs of De Bruijn Graphs (Extended Abstract). 140-150 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#AndreaeNS94 2002-01-24 Graphs and Graph Polynomials of interest in Chemistry. 177-187 1986 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg86.html#Gutman86 2002-01-24 A Time-Optimal Parallel Algorithm for the Computing of Voronoi-Diagrams. 424-433 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#PreilowskiM88 2002-01-03 Algorithms for the Treewidth and Minimum Fill-in of HHD-Free Graphs. 109-117 1997 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg97.html#BroersmaDK97 2002-01-03 A Lower Bound for Treewidth and Its Consequences. 14-25 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#Ramachandramurthi94 2002-01-03 Multilevel Graph Grammars. 51-64 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#Parisi-PresicceP94 2002-01-03 Optimal Embedding of Complete Binary Trees into Lines and Grids. 25-35 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#HeckmannKMU91 2002-01-03 Monadic Second-Order Evaluations on Tree-Decomposable Graphs. 13-24 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#CourcelleM91 2002-01-24 Behaviour Preserving Refinement of Petri Nets. 82-93 1986 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg86.html#Vogler86 2002-01-24 On Hyperedge Replacement and BNLC Graph Grammars. 78-93 1989 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg89.html#Vogler89 2002-07-22 The Expressive Power and Complexity of Dynamic Process Graphs. 230-242 http://link.springer.de/link/service/series/0558/bibs/1928/19280230.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#JakobyLR00 2002-01-03 The Complexity of Broadcasting in Planar and Decomposable Graphs. 219-231 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#JakobyRS94 2002-01-03 Labelled Trees and Pairs of Input-Output Permutations in Priority Queues. 282-291 1994 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg94.html#GolinZ94 2002-01-03 Toward a General Theory of Unicast-Based Multicast Communication. 237-251 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#BirchlerET95 2002-01-03 Complexity and Approximability of Certain Bicriteria Location Problems. 73-87 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#KrumkeNRM95 2003-03-03 Facets of the Directed Acyclic Graph Layering Polytope. 246-257 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730246.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#HealyN02 2002-01-24 A Simple Systolic Method to Find all Bridges of an Undirected Graph. 262-267 1988 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg88.html#SchimmlerS88 2003-06-27 On the Complexity of (k, l)-Graph Sandwich Problems. 92-101 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730092.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#DantasFF02 2002-01-03 On the Hardness of Recognizing Bundles in Time Table Graphs. 325-337 http://link.springer.de/link/service/series/0558/bibs/1665/16650325.htm 1999 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg99.html#LiebersWW99 2002-01-24 Maintenance of Transitive Closures and Transitive Reductions of Graphs. 106-120 1987 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg87.html#PoutreL87 2002-01-03 How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time. 117-128 2001 WG http://link.springer.de/link/service/series/0558/bibs/2204/22040117.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2001.html#EspelageGW01 2005-12-29 Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers 3787 2005 3-540-31000-2 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2005.html 2004-07-01 On k-Partitioning the n-Cube. 44-55 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#Bezrukov96 2002-01-24 The Power and the Limitations of Local Computations on Graphs. 333-345 1992 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg92.html#LitovskyMZ92 2002-01-24 Fully Dynamic Maintenance of Vertex Cover. 99-111 1993 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg93.html#IvkovicL93 2002-01-03 Partition Coefficients of Acyclic Graphs. 318-322 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#Pfaltz95 2002-01-03 Node Rewriting in Hypergraphs. 31-43 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#BauderonJ96 2003-03-03 The Forest Wrapping Problem on Outerplanar Graphs. 345-354 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730345.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#LariRS02 2002-07-22 <i>_{n, n}</i>. 196-205 http://link.springer.de/link/service/series/0558/bibs/1928/19280196.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#GurskiW00 2003-03-03 Graph Separator Algorithms: A Refined Analysis. 186-197 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730186.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#Fernau02 2002-01-24 On the Use of Some Almost Sure Graph Properties. 113-126 1980 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg80.html#Tinhofer80 2003-03-03 Complexity of Pattern Coloring of Cycle Systems. 164-175 2002 WG http://link.springer.de/link/service/series/0558/bibs/2573/25730164.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2002.html#DvorakKKP02 2002-01-03 Switchbox Routing in VLSI Design: Closing the Complexity Gap. 196-210 1996 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg96.html#HartmannSS96 2002-01-03 Visualizing Two- and Three-Dimensional Models of Meristematic Growth. 116-130 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#Fracchia95 2002-01-03 Graph Rewriting Systems and their Application to Network Reliability Analysis. 36-47 1991 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg91.html#OkadaH91 2002-01-03 VC-Dimensions for Graphs (Extended Abstract). 1-13 1995 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg95.html#KranakisKRUW95 2002-01-24 Distributed Parallelism of Graph Transformations. 1-19 1987 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg87.html#Ehrig87 2002-01-03 (k, +)-Distance-Hereditary Graphs. 66-77 2001 WG http://link.springer.de/link/service/series/0558/bibs/2204/22040066.htm http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2001.html#CiceroneDS01 2002-07-22 Approximating Call-Scheduling Makespan in All-Optical Networks. 13-22 http://link.springer.de/link/service/series/0558/bibs/1928/19280013.htm 2000 WG http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2000.html#BecchettiIM00