Conferences in DBLP
Derek G. Corneil Lexicographic Breadth First Search - A Survey. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:1-19 [Conf ] Roger Wattenhofer Wireless Networking: Graph Theory Unplugged. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:20-32 [Conf ] Shin-Ichi Nakano , Takeaki Uno Constant Time Generation of Trees with Specified Diameter. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:33-45 [Conf ] Sabine Cornelsen , Gabriele Di Stefano Treelike Comparability Graphs: Characterization, Recognition, and Applications. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:46-57 [Conf ] Jirí Fiala , Petr A. Golovach , Jan Kratochvíl Elegant Distance Constrained Labelings of Trees. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:58-67 [Conf ] Feodor F. Dragan , Chenyu Yan , Derek G. Corneil Collective Tree Spanners and Routing in AT-free Related Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:68-80 [Conf ] Hans L. Bodlaender , Arie M. C. A. Koster On the Maximum Cardinality Search Lower Bound for Treewidth. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:81-92 [Conf ] Christophe Crespelle , Christophe Paul Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:93-104 [Conf ] Stavros D. Nikolopoulos , Leonidas Palios Recognizing HHD-free and Welsh-Powell Opposition Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:105-116 [Conf ] Jean-Luc Fouquet , Michel Habib , Fabien de Montgolfier , Jean-Marie Vanherpe Bimodular Decomposition of Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:117-128 [Conf ] Michaël Rao Coloring a Graph Using Split Decomposition. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:129-141 [Conf ] Fabrizio Grandoni , Giuseppe F. Italiano Decremental Clique Problem. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:142-153 [Conf ] Daniel Sawitzki A Symbolic Approach to the All-Pairs Shortest-Paths Problem. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:154-167 [Conf ] Eduardo Moreno , Martín Matamala Minimal de Bruijn Sequence in a Language with Forbidden Substrings. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:168-176 [Conf ] Franz Baader A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:177-188 [Conf ] Hajo Broersma , Daniël Paulusma , Gerard J. M. Smit , Frank Vlaardingerbroek , Gerhard J. Woeginger The Computational Complexity of the Minimum Weight Processor Assignment Problem. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:189-200 [Conf ] Nicola Apollonio , Massimiliano Caramia , Giuseppe F. Italiano A Stochastic Location Problem with Applications to Tele-diagnostic. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:201-213 [Conf ] Tim Nieberg , Johann Hurink , Walter Kern A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:214-221 [Conf ] Boris Goldengorin , Gerard Sierksma , Marcel Turkensteen Tolerance Based Algorithms for the ATSP. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:222-234 [Conf ] Mike Fellows , Pinar Heggernes , Frances A. Rosamond , Christian Sloper , Jan Arne Telle Finding k Disjoint Triangles in an Arbitrary Graph. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:235-244 [Conf ] Fedor V. Fomin , Dieter Kratsch , Gerhard J. Woeginger Exact (Exponential) Algorithms for the Dominating Set Problem. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:245-256 [Conf ] Benny Chor , Mike Fellows , David W. Juedes Linear Kernels in Linear Time, or How to Save k Colors in O(n^{2} ) Steps. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:257-269 [Conf ] Nicolas Bonichon , Cyril Gavoille , Nicolas Hanusse , Dominique Poulalhon , Gilles Schaeffer Planar Graphs, via Well-Orderly Maps and Trees. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:270-284 [Conf ] Valentin E. Brimkov , Reneta P. Barneva , Reinhard Klette , Joseph Straight Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:285-295 [Conf ] Mordecai J. Golin , Yiu-Cho Leung Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:296-307 [Conf ] Zhi-Zhong Chen , Tatsuie Tsukiji Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:308-319 [Conf ] Md. Saidur Rahman , Kazuyuki Miura , Takao Nishizeki Octagonal Drawings of Plane Graphs with Prescribed Face Areas. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:320-331 [Conf ] Michael Baur , Ulrik Brandes Crossing Reduction in Circular Layouts. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:332-343 [Conf ] Mitre Costa Dourado , Fábio Protti , Jayme Luiz Szwarcfiter Characterization and Recognition of Generalized Clique-Helly Graphs. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:344-354 [Conf ] Michele Conforti , Anna Galluccio , Guido Proietti Edge-Connectivity Augmentation and Network Matrices. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:355-364 [Conf ] Takehiro Ito , Xiao Zhou , Takao Nishizeki Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:365-376 [Conf ] Dominique de Werra , Marc Demange , Jérôme Monnot , Vangelis Th. Paschos The Hypocoloring Problem: Complexity and Approximability Results when the Chromatic Number Is Small. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:377-388 [Conf ] Thomas Bietenhader , Yoshio Okamoto Core Stability of Minimum Coloring Games. [Citation Graph (0, 0)][DBLP ] WG, 2004, pp:389-401 [Conf ]