Search results for "WG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Divesh Aggarwal, Shashank K. Mehta, Jitender S. Deogun	Domination Search on Graphs with Low Dominating-Target-Number.	WG	2005	DBLP DOI BibTeX RDF
1	Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Extending the Tractability Border for Closest Leaf Powers.	WG	2005	DBLP DOI BibTeX RDF
1	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Algorithms Based on the Treewidth of Sparse Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Torsten Tholey	Finding Disjoint Paths on Directed Acyclic Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Eric Angel, Evripidis Bampis, Laurent Gourvès	Approximation Algorithms for the Bi-criteria Weighted max-cut Problem.	WG	2005	DBLP DOI BibTeX RDF
1	Stavros D. Nikolopoulos, Leonidas Palios	Recognizing HHDS-Free Graphs.	WG	2005	DBLP DOI BibTeX RDF	HHD-free graphs, HHDS-free graphs, homogeneously orderable graphs, recognition, sun, perfectly orderable graphs
1	Daniel Gonçalves 0001, Mickaël Montassier	Acyclic Choosability of Graphs with Small Maximum Degree.	WG	2005	DBLP DOI BibTeX RDF
1	Michael Gatto, Riko Jacob, Leon Peeters, Anita Schöbel	The Computational Complexity of Delay Management.	WG	2005	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Daniël Paulusma, Jan Arne Telle	Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms.	WG	2005	DBLP DOI BibTeX RDF
1	Joachim Giesen, Dieter Mitsche	Bounding the Misclassification Error in Spectral Partitioning in the Planted Partition Model.	WG	2005	DBLP DOI BibTeX RDF
1	Mathilde Bouvel, Vladimir Grebinski, Gregory Kucherov	Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey.	WG	2005	DBLP DOI BibTeX RDF
1	Ross M. McConnell, Fabien de Montgolfier	Algebraic Operations on PQ Trees and Modular Decomposition Trees.	WG	2005	DBLP DOI BibTeX RDF
1	Frédéric Havet, Jean-Sébastien Sereni	Channel Assignment and Improper Choosability of Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Robert Elsässer, Thomas Sauerwald	On Randomized Broadcasting in Star Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Stavros D. Nikolopoulos, Leonidas Palios	Adding an Edge in a Cograph.	WG	2005	DBLP DOI BibTeX RDF	cotrees, co-connected components, optimization problems, connected components, Perfect graphs, cographs
1	Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca	Computing Branchwidth Via Efficient Triangulations and Blocks.	WG	2005	DBLP DOI BibTeX RDF
1	Emeric Gioan	Complete Graph Drawings Up to Triangle Mutations.	WG	2005	DBLP DOI BibTeX RDF
1	Anne Berry, Alain Sigayret, Jeremy P. Spinrad	Faster Dynamic Algorithms for Chordal Graphs, and an Application to Phylogeny.	WG	2005	DBLP DOI BibTeX RDF
1	Shin-Ichi Nakano, Takeaki Uno	Generating Colored Trees.	WG	2005	DBLP DOI BibTeX RDF
1	Georg Gottlob, Martin Grohe, Nysret Musliu, Marko Samer, Francesco Scarcello	Hypertree Decompositions: Structure, Algorithms, and Applications.	WG	2005	DBLP DOI BibTeX RDF
1	Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan	Collective Tree 1-Spanners for Interval Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Omer Giménez, Petr Hlinený, Marc Noy	Computing the Tutte Polynomial on Graphs of Bounded Clique-Width.	WG	2005	DBLP DOI BibTeX RDF	subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial
1	Daniel Meister 0001	Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time.	WG	2005	DBLP DOI BibTeX RDF
1	Zuzana Beerliova, Felix Eberhard, Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák, L. Shankar Ram	Network Discovery and Verification.	WG	2005	DBLP DOI BibTeX RDF
1	Mathieu Liedloff, Ton Kloks, Jiping Liu, Sheng-Lung Peng	Roman Domination over Some Graph Classes.	WG	2005	DBLP DOI BibTeX RDF
1	Daniel Sawitzki	A Symbolic Approach to the All-Pairs Shortest-Paths Problem.	WG	2004	DBLP DOI BibTeX RDF
1	Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel (eds.)	Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers	WG	2004	DBLP DOI BibTeX RDF
1	Zhi-Zhong Chen, Tatsuie Tsukiji	Computing Bounded-Degree Phylogenetic Roots of Disconnected Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Thomas Bietenhader, Yoshio Okamoto	Core Stability of Minimum Coloring Games.	WG	2004	DBLP DOI BibTeX RDF
1	Franz Baader	A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL.	WG	2004	DBLP DOI BibTeX RDF
1	Tim Nieberg, Johann L. Hurink, Walter Kern	A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Roger Wattenhofer	Wireless Networking: Graph Theory Unplugged.	WG	2004	DBLP DOI BibTeX RDF
1	Eduardo Moreno 0001, Martín Matamala	Minimal de Bruijn Sequence in a Language with Forbidden Substrings.	WG	2004	DBLP DOI BibTeX RDF
1	Christophe Crespelle, Christophe Paul	Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs.	WG	2004	DBLP DOI BibTeX RDF
1	Fabrizio Grandoni 0001, Giuseppe F. Italiano	Decremental Clique Problem.	WG	2004	DBLP DOI BibTeX RDF
1	Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, Dominique Poulalhon, Gilles Schaeffer	Planar Graphs, via Well-Orderly Maps and Trees.	WG	2004	DBLP DOI BibTeX RDF
1	Jean-Luc Fouquet, Michel Habib, Fabien de Montgolfier, Jean-Marie Vanherpe	Bimodular Decomposition of Bipartite Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Chenyu Yan, Derek G. Corneil	Collective Tree Spanners and Routing in AT-free Related Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Michele Conforti, Anna Galluccio, Guido Proietti	Edge-Connectivity Augmentation and Network Matrices.	WG	2004	DBLP DOI BibTeX RDF
1	Mike Fellows, Pinar Heggernes, Frances A. Rosamond, Christian Sloper, Jan Arne Telle	Finding k Disjoint Triangles in an Arbitrary Graph.	WG	2004	DBLP DOI BibTeX RDF
1	Michael Baur, Ulrik Brandes	Crossing Reduction in Circular Layouts.	WG	2004	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger	Exact (Exponential) Algorithms for the Dominating Set Problem.	WG	2004	DBLP DOI BibTeX RDF
1	Md. Saidur Rahman 0001, Kazuyuki Miura, Takao Nishizeki	Octagonal Drawings of Plane Graphs with Prescribed Face Areas.	WG	2004	DBLP DOI BibTeX RDF
1	Sabine Cornelsen, Gabriele Di Stefano	Treelike Comparability Graphs: Characterization, Recognition, and Applications.	WG	2004	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Arie M. C. A. Koster	On the Maximum Cardinality Search Lower Bound for Treewidth.	WG	2004	DBLP DOI BibTeX RDF
1	Hajo Broersma, Daniël Paulusma, Gerard J. M. Smit, Frank Vlaardingerbroek, Gerhard J. Woeginger	The Computational Complexity of the Minimum Weight Processor Assignment Problem.	WG	2004	DBLP DOI BibTeX RDF
1	Mordecai J. Golin, Yiu-Cho Leung	Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters.	WG	2004	DBLP DOI BibTeX RDF
1	Shin-Ichi Nakano, Takeaki Uno	Constant Time Generation of Trees with Specified Diameter.	WG	2004	DBLP DOI BibTeX RDF
1	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.	WG	2004	DBLP DOI BibTeX RDF
1	Derek G. Corneil	Lexicographic Breadth First Search - A Survey.	WG	2004	DBLP DOI BibTeX RDF
1	Michaël Rao	Coloring a Graph Using Split Decomposition.	WG	2004	DBLP DOI BibTeX RDF
1	Benny Chor, Mike Fellows, David W. Juedes	Linear Kernels in Linear Time, or How to Save k Colors in O(n2) Steps.	WG	2004	DBLP DOI BibTeX RDF
1	Valentin E. Brimkov, Reneta P. Barneva, Reinhard Klette, Joseph Straight	Efficient Computation of the Lovász Theta Function for a Class of Circulant Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter	Characterization and Recognition of Generalized Clique-Helly Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.	WG	2004	DBLP DOI BibTeX RDF
1	Stavros D. Nikolopoulos, Leonidas Palios	Recognizing HHD-free and Welsh-Powell Opposition Graphs.	WG	2004	DBLP DOI BibTeX RDF
1	Boris Goldengorin, Gerard Sierksma, Marcel Turkensteen	Tolerance Based Algorithms for the ATSP.	WG	2004	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Petr A. Golovach, Jan Kratochvíl	Elegant Distance Constrained Labelings of Trees.	WG	2004	DBLP DOI BibTeX RDF
1	Nicola Apollonio, Massimiliano Caramia, Giuseppe F. Italiano	A Stochastic Location Problem with Applications to Tele-diagnostic.	WG	2004	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le, Ryuhei Uehara	Tree Spanners for Bipartite Graphs and Probe Interval Graphs.	WG	2003	DBLP DOI BibTeX RDF	Chordal bipartite graph, Interval bigraph, Probe interval graph, Tree spanner, NP-completeness
1	Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath	Drawing Planar Graphs on a Curve.	WG	2003	DBLP DOI BibTeX RDF
1	Thomas Erlebach, Aris Pagourtzis, Katerina Potika, Stamatis Stefanakos	Resource Allocation Problems in Multifiber WDM Tree Networks.	WG	2003	DBLP DOI BibTeX RDF
1	Cécile Murat, Vangelis Th. Paschos	The Probabilistic Minimum Coloring Problem.	WG	2003	DBLP DOI BibTeX RDF
1	Paul D. Manuel, Bharati Rajan, Indra Rajasingh, Amutha Alaguvel	Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	Luérbio Faria, Celina M. H. de Figueiredo, Ondrej Sýkora, Imrich Vrto	An Improved Upper Bound on the Crossing Number of the Hypercube.	WG	2003	DBLP DOI BibTeX RDF
1	Paz Carmi, Thomas Erlebach, Yoshio Okamoto	Greedy Edge-Disjoint Paths in Complete Graphs.	WG	2003	DBLP DOI BibTeX RDF	Shortening lemma, Approximation algorithm, Greedy algorithm
1	Stavros D. Nikolopoulos, Leonidas Palios	Recognizing Bipolarizable and P 4-Simplicial Graphs.	WG	2003	DBLP DOI BibTeX RDF	Bipolarizable (Raspail) graph, P 4-simplicial graph, algorithm, complexity, recognition, forbidden subgraph, perfectly orderable graph
1	Michael R. Fellows	Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT.	WG	2003	DBLP DOI BibTeX RDF
1	Christian S. Collberg, Stephen G. Kobourov, Edward Carter, Clark D. Thomborson	Graph-Based Approaches to Software Watermarking.	WG	2003	DBLP DOI BibTeX RDF
1	Simon M. Becker, Bernhard Westfechtel	Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars.	WG	2003	DBLP DOI BibTeX RDF
1	Paul S. Bonsma	The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes.	WG	2003	DBLP DOI BibTeX RDF
1	Asaf Levin, Daniël Paulusma, Gerhard J. Woeginger	The Complexity of Graph Contractions.	WG	2003	DBLP DOI BibTeX RDF
1	Sabine Cornelsen, Dorothea Wagner	Completely Connected Clustered Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	Claudio Arbib, Michele Flammini, Fabrizio Marinelli 0001	Minimum Flow Time Graph Ordering.	WG	2003	DBLP DOI BibTeX RDF
1	Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse	Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation.	WG	2003	DBLP DOI BibTeX RDF
1	Ioan Todinca	Coloring Powers of Graphs of Bounded Clique-Width.	WG	2003	DBLP DOI BibTeX RDF
1	Alexander Glikson, Johann A. Makowsky	NCE Graph Grammars and Clique-Width.	WG	2003	DBLP DOI BibTeX RDF
1	Anne Berry, Pinar Heggernes, Geneviève Simonet	The Minimum Degree Heuristic and the Minimal Triangulation Process.	WG	2003	DBLP DOI BibTeX RDF
1	Lukasz Kowalik	Short Cycles in Planar Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	Pascal Berthomé, Madiagne Diallo, Afonso Ferreira	Generalized Parametric Multi-terminal Flows Problem.	WG	2003	DBLP DOI BibTeX RDF
1	Jan Kratochvíl	Complexity of Hypergraph Coloring and Seidel's Switching.	WG	2003	DBLP DOI BibTeX RDF
1	Franz-Josef Brandenburg	Erratum: Cycles in Generalized Networks.	WG	2003	DBLP DOI BibTeX RDF
1	Frank K. H. A. Dehne, Michael R. Fellows, Frances A. Rosamond	An FPT Algorithm for Set Splitting.	WG	2003	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender (eds.)	Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers	WG	2003	DBLP DOI BibTeX RDF
1	Carsten Gutwenger, Michael Jünger, Sebastian Leipert, Petra Mutzel, Merijam Percan, René Weiskircher	Subgraph Induced Planar Connectivity Augmentation: (Extended Abstract).	WG	2003	DBLP DOI BibTeX RDF
1	Lali Barrière, Pierre Fraigniaud, Nicola Santoro, Dimitrios M. Thilikos	Searching Is Not Jumping.	WG	2003	DBLP DOI BibTeX RDF
1	Ton Kloks, Chuan-Min Lee, Jiping Liu, Haiko Müller	On the Recognition of General Partition Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	Martin Charles Golumbic, Marina Lipshteyn	Chordal Probe Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Gerhard J. Woeginger	Backbone Colorings for Networks.	WG	2003	DBLP DOI BibTeX RDF
1	Alexander Schrijver	Matching, Edge-Colouring, and Dimers.	WG	2003	DBLP DOI BibTeX RDF
1	Anna Bretscher, Derek G. Corneil, Michel Habib, Christophe Paul	A Simple Linear Time LexBFS Cograph Recognition Algorithm.	WG	2003	DBLP DOI BibTeX RDF
1	Dieter Kratsch, Haiko Müller, Ioan Todinca	Feedback Vertex Set and Longest Induced Path on AT-Free Graphs.	WG	2003	DBLP DOI BibTeX RDF
1	Vida Dujmovic, David R. Wood	Tree-Partitions of k-Trees with Applications in Graph Layout.	WG	2003	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Pinar Heggernes, Petter Kristiansen, Jan Arne Telle	Generalized H-Coloring and H-Covering of Trees.	WG	2002	DBLP DOI BibTeX RDF
1	Alain Cournier	Search in Indecomposable Graphs.	WG	2002	DBLP DOI BibTeX RDF	Indecomposable Graphs, Search in a Graph, Prime Graphs
1	Jan Kratochvíl, Zsolt Tuza, Margit Voigt	On the b-Chromatic Number of Graphs.	WG	2002	DBLP DOI BibTeX RDF
1	Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos	The Complexity of Restrictive H-Coloring.	WG	2002	DBLP DOI BibTeX RDF
1	Edith Hemaspaandra, Jörg Rothe, Holger Spakowski	Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP.	WG	2002	DBLP DOI BibTeX RDF	minimum vertex cover heuristics, parallel access to NP, Computational complexity, approximation, completeness
1	Ton Kloks, Chuan-Min Lee, Jiping Liu	New Algorithms for k-Face Cover, k-Feedback Vertex Set, and k -Disjoint Cycles on Plane and Planar Graphs.	WG	2002	DBLP DOI BibTeX RDF
1	Zdenek Dvorák 0001, Jan Kára, Daniel Král, Ondrej Pangrác	Complexity of Pattern Coloring of Cycle Systems.	WG	2002	DBLP DOI BibTeX RDF

Publications at "WG"( http://dblp.L3S.de/Venues/WG )