| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christophe Paul, Michel Habib (eds.) |
Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers   |
WG  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhentao Li, Ignasi Sau |
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Van Bang Le, Nguyen Ngoc Tuy |
Hardness Results and Efficient Algorithms for Graph Powers. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Serge Gaspers, Daniel Raible |
Exact and Parameterized Algorithms for Max Internal Spanning Tree. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
An Exact Algorithm for Minimum Distortion Embedding. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Torben Hagerup |
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma |
Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Kammer, Torsten Tholey |
The k-Disjoint Paths Problem on Chordal Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Grumbach, Zhilin Wu |
Logical Locality Entails Frugal Distributed Computation over Graphs (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Andreas Wiese, Fenghui Zhang |
Local Algorithms for Edge Colorings in UDGs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann |
A Graph Polynomial Arising from Community Structure (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Graph-Theoretic Solutions to Computational Geometry Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mamadou Moustapha Kanté, Michaël Rao |
Directed Rank-Width and Displit Decomposition. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Grigoriev, René Sitters |
Connected Feedback Vertex Set in Planar Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Crespelle |
Fully Dynamic Representations of Interval Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank Gurski, Egon Wanke |
On Module-Composed Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
special graph classes, homogeneous sets, HHDS-free graphs, bipartite graphs, distance hereditary graphs |
| 1 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
Maximum Series-Parallel Subgraph. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman |
Sub-coloring and Hypo-coloring Interval Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
Parameterized Complexity of Generalized Domination Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zdenek Dvorak, Daniel Král |
Algorithms for Classes of Graphs with Bounded Expansion. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, David Peleg |
Low-Port Tree Representations. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Bastian Katz, Ignaz Rutter, Gerhard J. Woeginger |
An Algorithmic Study of Switch Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
The Parameterized Complexity of Some Minimum Label Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Pim van 't Hof, Marcin Kaminski, Daniël Paulusma |
Finding Induced Paths of Given Parity in Claw-Free Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary MacGillivray, André Raspaud, Jacobus Swarts |
Injective Oriented Colourings. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Meister, Jan Arne Telle |
Chordal Digraphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoshio Okamoto, Ryuhei Uehara, Takeaki Uno |
Counting the Number of Matchings in Chordal and Chordal Bipartite Graph Classes. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
A New Intersection Model and Improved Algorithms for Tolerance Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter |
Cycles, Paths, Connectivity and Diameter in Distance Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Kreutzer, Sebastian Ordyniak |
Distance d-Domination Games. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Shrem, Michal Stern, Martin Charles Golumbic |
Smallest Odd Holes in Claw-Free Graphs (Extended Abstract). |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 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 BibTeX RDF |
|
| 1 | Joachim Kneis, Alexander Langer, Peter Rossmanith |
Improved Upper Bounds for Partial Vertex Cover. |
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 | Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov |
Upward Straight-Line Embeddings of Directed Graphs into Point Sets. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Leszek Gasieniec, Tomasz Radzik |
Memory Efficient Anonymous Graph Exploration. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang |
Additive Spanners for Circle Graphs and Polygonal 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 | Jirí Fiala, 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 | 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 | 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 | Davide Bilò, Luca Forlizzi, Guido Proietti |
Approximating the Metric TSP in Linear Time. |
WG |
2008 |
DBLP DOI BibTeX RDF |
Metric Graphs, Linear-time Approximation Algorithms, Traveling Salesman Problem, NP-hardness |
| 1 | Martin Grohe |
Algorithmic Meta Theorems. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Nisse, Karol Suchan |
Fast Robber in Planar Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
Cops and robber, grid, planar graph, subdivision, minor |
| 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 | 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, traffic grooming, graph decomposition, ADM, cubic graph |
| 1 | David Richerby, Dimitrios M. Thilikos |
Searching for a Visible, Lazy Fugitive. |
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 | Dániel Marx, Ildikó Schlotter |
Parameterized Graph Cleaning Problems. |
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 | 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 | Pascal Koiran, Klaus Meer |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
What Is between Chordal and Weakly Chordal Graphs?. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
A Most General Edge Elimination Polynomial. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vít Jelínek |
The Rank-Width of the Square Grid. |
WG |
2008 |
DBLP DOI BibTeX RDF |
rank-width, grid graph |
| 1 | Yahav Nussbaum |
From a Circular-Arc Model to a Proper Circular-Arc Model. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gregory 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 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz |
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabrizio Frati |
A Lower Bound on the Area Requirements of Series-Parallel Graphs. |
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 | Marek Cygan, Marcin Pilipczuk |
Faster Exact Bandwidth. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Wiese, Evangelos Kranakis |
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. |
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 | Stephan Kreutzer, Sebastian Ordyniak |
Digraph Decompositions and Monotonicity in Digraph Searching. |
WG |
2008 |
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 | 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 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 | David Richerby, Dimitrios M. Thilikos |
Graph Searching in a Crime Wave. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 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, Zoran Nikoloski, Dorothea Wagner |
On Finding Graph Clusterings with Maximum Modularity. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Arthur H. Busch, Garth Isaak |
Recognizing Bipartite Tolerance Graphs in Linear Time. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Cereceda, Jan van den Heuvel, Matthew Johnson |
Mixing 3-Colourings in Bipartite Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 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 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. |
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 | 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 | Stefan Felsner, Florian Zickfeld |
On the Number of alpha -Orientations. |
WG |
2007 |
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 | 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 | 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 | 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 | 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 | Matthias Hagen |
Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation. |
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 | Klaus Jansen |
Approximation Algorithms for Geometric Intersection Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Limouzy, Fabien de Montgolfier, Michaël Rao |
NLC-2 Graph Recognition and Isomorphism. |
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 | 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 | Bodo Manthey |
Minimum-Weight Cycle Covers and Their Approximability. |
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 | Frédéric Mazoit, Nicolas Nisse |
Monotonicity of Non-deterministic Graph Searching. |
WG |
2007 |
DBLP DOI BibTeX RDF |
Monotonicity, Treewidth, Graph searching |
| 1 | Daniel Meister |
A Characterisation of the Minimal Triangulations of Permutation Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Meister, Jan Arne Telle, Martin Vatshelle |
Characterization and Recognition of Digraphs of Bounded Kelly-width. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 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 | Martin Pergel |
Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete. |
WG |
2007 |
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 | 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 BibTeX RDF |
|
| 1 | Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez |
Clique Graph Recognition Is NP-Complete. |
WG |
2006 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")