Search results for "WG"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Paul S. Bonsma, Florian Zickfeld	A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs.	WG	2008	DBLP DOI BibTeX RDF	maximum leaf, approximation algorithm, connected dominating set, cubic graph
1	Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma (eds.)	Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers	WG	2008	DBLP DOI BibTeX RDF
1	Siamak Tazari, Matthias Müller-Hannemann	A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes.	WG	2008	DBLP DOI BibTeX RDF
1	Joachim Kneis, Alexander Langer, Peter Rossmanith	Improved Upper Bounds for Partial Vertex Cover.	WG	2008	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Yngve Villanger	Parameterized Complexity for Domination Problems on Degenerate Graphs.	WG	2008	DBLP DOI BibTeX RDF	degenerate graphs, algorithms, domination, Parameterized complexity
1	Ilya Averbouch, Benny Godlin, Johann A. Makowsky	A Most General Edge Elimination Polynomial.	WG	2008	DBLP DOI BibTeX RDF
1	Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang	On the Pseudo-achromatic Number Problem.	WG	2008	DBLP DOI BibTeX RDF	pseudo-achromatic number, kernel, fixed-parameter tractability, parameterized complexity
1	Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks	The Valve Location Problem in Simple Network Topologies.	WG	2008	DBLP DOI BibTeX RDF	Valve location problem, computational complexity, dynamic programming, binary search, bounded treewidth
1	Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo	An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph.	WG	2008	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Petr A. Golovach	Complexity of the Packing Coloring Problem for Trees.	WG	2008	DBLP DOI BibTeX RDF	Packing coloring, computational complexity, graph algorithm, chordal graph
1	Marek Cygan, Marcin Pilipczuk	Faster Exact Bandwidth.	WG	2008	DBLP DOI BibTeX RDF
1	Athanassios Koutsonas, Dimitrios M. Thilikos	Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms.	WG	2008	DBLP DOI BibTeX RDF
1	David Richerby, Dimitrios M. Thilikos	Searching for a Visible, Lazy Fugitive.	WG	2008	DBLP DOI BibTeX RDF
1	Xavier Muñoz, Ignasi Sau	Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph.	WG	2008	DBLP DOI BibTeX RDF	SONET over WDM, bridgeless graph, optical networks, graph decomposition, traffic grooming, ADM, cubic graph
1	Andreas Wiese, Evangelos Kranakis	Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs.	WG	2008	DBLP DOI BibTeX RDF
1	Benny Godlin, Tomer Kotek, Johann A. Makowsky	Evaluations of Graph Polynomials.	WG	2008	DBLP DOI BibTeX RDF
1	Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos	Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs.	WG	2008	DBLP DOI BibTeX RDF
1	Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca	Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings.	WG	2008	DBLP DOI BibTeX RDF
1	Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini	(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective.	WG	2008	DBLP DOI BibTeX RDF
1	Martin Grohe	Algorithmic Meta Theorems.	WG	2008	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Rodica Mihai	Mixed Search Number and Linear-Width of Interval and Split Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Luis Cereceda, Jan van den Heuvel, Matthew Johnson 0002	Mixing 3-Colourings in Bipartite Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Daniel Meister 0001, Jan Arne Telle, Martin Vatshelle	Characterization and Recognition of Digraphs of Bounded Kelly-width.	WG	2007	DBLP DOI BibTeX RDF
1	Bodo Manthey	Minimum-Weight Cycle Covers and Their Approximability.	WG	2007	DBLP DOI BibTeX RDF
1	Vadim V. Lozin, Martin Milanic	Tree-Width and Optimization in Bounded Degree Graphs.	WG	2007	DBLP DOI BibTeX RDF	Hereditary class of graphs, Induced Matching, Dominating set, Tree-width
1	Angelo Monti, Paolo Penna, Riccardo Silvestri	An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem.	WG	2007	DBLP DOI BibTeX RDF	Caccetta-Häggkvist conjecture, online load balancing, competitive analysis
1	Fabrizio Frati	On Minimum Area Planar Upward Drawings of Directed Trees and Other Families of Directed Acyclic Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Min Chih Lin, Francisco J. Soulignac, Jayme Luiz Szwarcfiter	Proper Helly Circular-Arc Graphs.	WG	2007	DBLP DOI BibTeX RDF	Helly circular-arc graphs, proper circular-arc graphs, unit circular-arc graphs, algorithms, forbidden subgraphs
1	David Richerby, Dimitrios M. Thilikos	Graph Searching in a Crime Wave.	WG	2007	DBLP DOI BibTeX RDF
1	Klaus Jansen	Approximation Algorithms for Geometric Intersection Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Torben Hagerup	A Very Practical Algorithm for the Two-Paths Problem in 3-Connected Planar Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Andreas Brandstädt, Dieter Kratsch, Haiko Müller (eds.)	Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers	WG	2007	DBLP DOI BibTeX RDF
1	Frank Gurski, Egon Wanke	The Clique-Width of Tree-Power and Leaf-Power Graphs.	WG	2007	DBLP DOI BibTeX RDF	tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers
1	Stefan Felsner, Florian Zickfeld	On the Number of alpha -Orientations.	WG	2007	DBLP DOI BibTeX RDF
1	Refael Hassin, Jérôme Monnot, Danny Segev	The Complexity of Bottleneck Labeled Graph Problems.	WG	2007	DBLP DOI BibTeX RDF
1	Martin Pergel	Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete.	WG	2007	DBLP DOI BibTeX RDF
1	Peter Damaschke	Segmenting Strings Homogeneously Via Trees.	WG	2007	DBLP DOI BibTeX RDF
1	Frederic Dorn	How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.	WG	2007	DBLP DOI BibTeX RDF
1	Philippe Gambette, Stéphane Vialette	On Restrictions of Balanced 2-Interval Graphs.	WG	2007	DBLP DOI BibTeX RDF	2-interval graphs, graph classes, quasi-line graphs, circular interval graphs, scheduling, bioinformatics, line graphs, claw-free graphs
1	Karol Suchan, Ioan Todinca	Pathwidth of Circular-Arc Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer 0001, Zoran Nikoloski, Dorothea Wagner	On Finding Graph Clusterings with Maximum Modularity.	WG	2007	DBLP DOI BibTeX RDF
1	Matthias Hagen	Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation.	WG	2007	DBLP DOI BibTeX RDF
1	Petr A. Golovach, Jan Kratochvíl	Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs.	WG	2007	DBLP DOI BibTeX RDF	Computational complexity, graph algorithms
1	Maw-Shang Chang, Ming-Tat Ko	The 3-Steiner Root Problem.	WG	2007	DBLP DOI BibTeX RDF	Tree power, tree root, Steiner root, efficient algorithm, leaf power
1	Vincent Limouzy, Fabien de Montgolfier, Michaël Rao	NLC-2 Graph Recognition and Isomorphism.	WG	2007	DBLP DOI BibTeX RDF
1	Bruno Escoffier, Laurent Gourvès, Jérôme Monnot	Complexity and Approximation Results for the Connected Vertex Cover Problem.	WG	2007	DBLP DOI BibTeX RDF	Connected vertex cover, APX-complete, approximation algorithm, planar graphs, bipartite graphs, chordal graphs
1	Arthur H. Busch, Garth Isaak	Recognizing Bipartite Tolerance Graphs in Linear Time.	WG	2007	DBLP DOI BibTeX RDF
1	Daniel Meister 0001	A Characterisation of the Minimal Triangulations of Permutation Graphs.	WG	2007	DBLP DOI BibTeX RDF
1	Van Bang Le, H. N. de Ridder	Characterisations and Linear-Time Recognition of Probe Cographs.	WG	2007	DBLP DOI BibTeX RDF
1	Dániel Marx, Ildikó Schlotter	Obtaining a Planar Graph by Vertex Deletion.	WG	2007	DBLP DOI BibTeX RDF
1	Bruno Courcelle, Mamadou Moustapha Kanté	Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.	WG	2007	DBLP DOI BibTeX RDF
1	Frédéric Mazoit, Nicolas Nisse	Monotonicity of Non-deterministic Graph Searching.	WG	2007	DBLP DOI BibTeX RDF	Monotonicity, Treewidth, Graph searching
1	Gaurav Goel, Jens Gustedt	Bounded Arboricity to Determine the Local Structure of Sparse Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Lukasz Kowalik	Improved Edge-Coloring with Three Colors.	WG	2006	DBLP DOI BibTeX RDF
1	Serge Gaspers, Mathieu Liedloff	A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set in Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Christian Knauer, Andreas Spillner 0001	A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators.	WG	2006	DBLP DOI BibTeX RDF
1	Yasuhiko Takenaga, Kenichi Higashide	Vertex Coloring of Comparability+ke and -ke Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Elisabeth Gassner, Michael Jünger, Merijam Percan, Marcus Schaefer 0001, Michael Schulz 0001	Simultaneous Graph Embeddings with Fixed Edges.	WG	2006	DBLP DOI BibTeX RDF
1	Pierre Fraigniaud, Nicolas Nisse	Monotony Properties of Connected Visible Graph Searching.	WG	2006	DBLP DOI BibTeX RDF	Treewidth, Graph Searching, Pathwidth
1	Magnús M. Halldórsson, Ragnar K. Karlsson	Strip Graphs: Recognition and Scheduling.	WG	2006	DBLP DOI BibTeX RDF
1	Martin Charles Golumbic, Marina Lipshteyn, Michal Stern	Finding Intersection Models of Weakly Chordal Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Haim Kaplan, Yahav Nussbaum	Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez	Clique Graph Recognition Is NP-Complete.	WG	2006	DBLP DOI BibTeX RDF
1	Jirí Fiala 0001, Jan Kratochvíl	Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy.	WG	2006	DBLP DOI BibTeX RDF
1	Jérémie Chalopin, Daniël Paulusma	Graph Labelings Derived from Models in Distributed Computing.	WG	2006	DBLP DOI BibTeX RDF
1	Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy, Fabien de Montgolfier	Homogeneity vs. Adjacency: Generalising Some Graph Decomposition Algorithms.	WG	2006	DBLP DOI BibTeX RDF
1	David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng	Partitioned Probe Comparability Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Divide-and-Color.	WG	2006	DBLP DOI BibTeX RDF
1	Masashi Kiyomi, Shuji Kijima, Takeaki Uno	Listing Chordal Graphs and Interval Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Alexander Grigoriev, Joyce van Loon, René Sitters, Marc Uetz	How to Sell a Graph: Guidelines for Graph Retailers.	WG	2006	DBLP DOI BibTeX RDF	Pricing problems, tollbooth problem, highway problem, computational complexity, dynamic programming, fully polynomial time approximation scheme
1	Ivan Rapaport, Karol Suchan, Ioan Todinca	Minimal Proper Interval Completions.	WG	2006	DBLP DOI BibTeX RDF
1	Michele Flammini, Gianpiero Monaco, Luca Moscardelli, Mordechai Shalom, Shmuel Zaks	Approximating the Traffic Grooming Problem in Tree and Star Networks.	WG	2006	DBLP DOI BibTeX RDF	Optical Networks, Tree Networks, Traffic Grooming, Add-Drop Multiplexer(ADM), Wavelength Division Multiplexing(WDM)
1	Sylvain Coulonges	Circular-Perfect Concave-Round Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Miklós Bartha, Miklós Krész	Flexible Matchings.	WG	2006	DBLP DOI BibTeX RDF
1	Fedor V. Fomin (eds.)	Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006, Bergen, Norway, June 22-24, 2006, Revised Papers	WG	2006	DBLP DOI BibTeX RDF
1	Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos	A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.	WG	2006	DBLP DOI BibTeX RDF	fully dynamic algorithms, P4-sparse graphs, recognition, modular decomposition
1	Andrew R. Curtis, Clemente Izurieta, Benson L. Joeris, Scott M. Lundberg, Ross M. McConnell	An Implicit Representation of Chordal Comparabilty Graphs in Linear-Time.	WG	2006	DBLP DOI BibTeX RDF
1	Seok-Hee Hong 0001, Hiroshi Nagamochi	Convex Drawings of Graphs with Non-convex Boundary.	WG	2006	DBLP DOI BibTeX RDF
1	Christophe Paul, Andrzej Proskurowski, Jan Arne Telle	Generation of Graphs with Bounded Branchwidth.	WG	2006	DBLP DOI BibTeX RDF
1	Jan Foniok, Jaroslav Nesetril, Claude Tardif	Generalised Dualities and Finite Maximal Antichains.	WG	2006	DBLP DOI BibTeX RDF
1	Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin	Computing Graph Polynomials on Graphs of Bounded Clique-Width.	WG	2006	DBLP DOI BibTeX RDF
1	Dániel Marx	Chordal Deletion Is Fixed-Parameter Tractable.	WG	2006	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender	Treewidth: Characterizations, Applications, and Computations.	WG	2006	DBLP DOI BibTeX RDF
1	Bodo Manthey	Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions.	WG	2006	DBLP DOI BibTeX RDF
1	Erik Jan van Leeuwen	Approximation Algorithms for Unit Disk Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Ephraim Korach, Margarita Razgon	Optimal Hypergraph Tree-Realization.	WG	2005	DBLP DOI BibTeX RDF
1	Prosenjit Bose, Vida Dujmovic, David R. Wood	Induced Subgraphs of Bounded Degree and Bounded Treewidth.	WG	2005	DBLP DOI BibTeX RDF
1	Pascal Berthomé, Sylvain Lebresne, Kim Nguyen 0001	Computation of Chromatic Polynomials Using Triangulations and Clique Trees.	WG	2005	DBLP DOI BibTeX RDF
1	Dieter Kratsch (eds.)	Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers	WG	2005	DBLP DOI BibTeX RDF
1	Pinar Heggernes, Daniel Lokshtanov	Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time.	WG	2005	DBLP DOI BibTeX RDF
1	Christophe Crespelle, Christophe Paul	Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Guillaume Blin, Guillaume Fertin, Danny Hermelin, Stéphane Vialette	Fixed-Parameter Algorithms for Protein Similarity Search Under mRNA Structure Constraints.	WG	2005	DBLP DOI BibTeX RDF
1	Sang-il Oum	Approximating Rank-Width and Clique-Width Quickly.	WG	2005	DBLP DOI BibTeX RDF
1	Anne Berry, Richard Krueger, Geneviève Simonet	Ultimate Generalizations of LexBFS and LEX M.	WG	2005	DBLP DOI BibTeX RDF
1	Manuel Bodirsky, Daniel Král	Locally Consistent Constraint Satisfaction Problems with Binary Constraints.	WG	2005	DBLP DOI BibTeX RDF
1	Van Bang Le, Raffaele Mosca, Haiko Müller	On Stable Cutsets in Claw-Free Graphs and Planar Graphs.	WG	2005	DBLP DOI BibTeX RDF
1	Peter Damaschke	On the Fixed-Parameter Enumerability of Cluster Editing.	WG	2005	DBLP DOI BibTeX RDF
1	Akihisa Kako, Takao Ono, Tomio Hirata, Magnús M. Halldórsson	Approximation Algorithms for the Weighted Independent Set Problem.	WG	2005	DBLP DOI BibTeX RDF
1	Frank Gurski, Egon Wanke	Minimizing NLC-Width is NP-Complete.	WG	2005	DBLP DOI BibTeX RDF
1	Yoshio Okamoto, Takeaki Uno, Ryuhei Uehara	Linear-Time Counting Algorithms for Independent Sets in Chordal Graphs.	WG	2005	DBLP DOI BibTeX RDF	# P-completeness, NP-completeness, polynomial time algorithm, enumeration, independent set, Chordal graph, counting

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