Conferences in DBLP

Workshop on Graph-Theoretic Concepts in Computer Science (WG) (wg)
2003 (conf/wg/2003)

1. Michael R. Fellows
   Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:1-12 [Conf]
   
2. Alexander Schrijver
   Matching, Edge-Colouring, and Dimers. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:13-22 [Conf]
   
3. Claudio Arbib, Michele Flammini, Fabrizio Marinelli
   Minimum Flow Time Graph Ordering. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:23-33 [Conf]
   
4. Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos
   Searching Is Not Jumping. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:34-45 [Conf]
   
5. Simon M. Becker, Bernhard Westfechtel
   Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:46-57 [Conf]
   
6. Anne Berry, Pinar Heggernes, Geneviève Simonet
   The Minimum Degree Heuristic and the Minimal Triangulation Process. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:58-70 [Conf]
   
7. Pascal Berthomé, Madiagne Diallo, Afonso Ferreira
   Generalized Parametric Multi-terminal Flows Problem. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:71-80 [Conf]
   
8. Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
   Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:81-92 [Conf]
   
9. Paul S. Bonsma
   The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes. [Citation Graph (0, 0)][DBLP]
   WG, 2003, pp:93-105 [Conf]
   
10. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara
    Tree Spanners for Bipartite Graphs and Probe Interval Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:106-118 [Conf]
    
11. Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul
    A Simple Linear Time LexBFS Cograph Recognition Algorithm. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:119-130 [Conf]
    
12. Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger
    Backbone Colorings for Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:131-142 [Conf]
    
13. Paz Carmi, Thomas Erlebach, Yoshio Okamoto
    Greedy Edge-Disjoint Paths in Complete Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:143-155 [Conf]
    
14. Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson
    Graph-Based Approaches to Software Watermarking. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:156-167 [Conf]
    
15. Sabine Cornelsen, Dorothea Wagner
    Completely Connected Clustered Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:168-179 [Conf]
    
16. Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond
    An FPT Algorithm for Set Splitting. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:180-191 [Conf]
    
17. Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath
    Drawing Planar Graphs on a Curve. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:192-204 [Conf]
    
18. Vida Dujmovic, David R. Wood
    Tree-Partitions of k-Trees with Applications in Graph Layout. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:205-217 [Conf]
    
19. Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos
    Resource Allocation Problems in Multifiber WDM Tree Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:218-229 [Conf]
    
20. Luerbio Faria, Celina M. Herrera de Figueiredo, Ondrej Sýkora, Imrich Vrto
    An Improved Upper Bound on the Crossing Number of the Hypercube. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:230-236 [Conf]
    
21. Alexander Glikson, Johann A. Makowsky
    NCE Graph Grammars and Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:237-248 [Conf]
    
22. Martin Charles Golumbic, Marina Lipshteyn
    Chordal Probe Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:249-260 [Conf]
    
23. Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher
    Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:261-272 [Conf]
    
24. Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller
    On the Recognition of General Partition Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:273-283 [Conf]
    
25. Lukasz Kowalik
    Short Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:284-296 [Conf]
    
26. Jan Kratochvíl
    Complexity of Hypergraph Coloring and Seidel's Switching. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:297-308 [Conf]
    
27. Dieter Kratsch, Haiko Müller, Ioan Todinca
    Feedback Vertex Set and Longest Induced Path on AT-Free Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:309-321 [Conf]
    
28. Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger
    The Complexity of Graph Contractions. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:322-333 [Conf]
    
29. Paul Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel
    Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:334-345 [Conf]
    
30. Cécile Murat, Vangelis Th. Paschos
    The Probabilistic Minimum Coloring Problem. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:346-357 [Conf]
    
31. Stavros D. Nikolopoulos, Leonidas Palios
    Recognizing Bipolarizable and P 4-Simplicial Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:358-369 [Conf]
    
32. Ioan Todinca
    Coloring Powers of Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:370-382 [Conf]
    
33. Franz-Josef Brandenburg
    Erratum: Cycles in Generalized Networks. [Citation Graph (0, 0)][DBLP]
    WG, 2003, pp:383- [Conf]