| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christine T. Cheng, Eric McDermid, Ichiro Suzuki |
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs.  |
WG  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rémy Belmonte, Martin Vatshelle |
Graph Classes with Structured Neighborhoods and Algorithmic Applications. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec |
On the Complexity of Planar Covering of Small Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan |
Complexity of Splits Reconstruction for Low-Degree Trees. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Matthias Mnich, Saket Saurabh |
Planar k-Path in Subexponential Time and Polynomial Space. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Katarína Cechlárová, Eva Jelínková |
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx |
Important Separators and Parameterized Algorithms. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Chaplick, Elad Cohen, Juraj Stacho |
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström |
Parameterized Two-Player Nash Equilibrium. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki |
Approximability of the Path-Distance-Width for AT-free Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin |
Alternation Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans L. Bodlaender, Dieter Kratsch |
Exact Algorithms for Kayles. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liliana Alcón, Luerbio Faria, Celina M. Herrera de Figueiredo, Marisa Gutierrez |
Split Clique Graph Complexity. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Frantisek Galcík, Ján Katrenic, Gabriel Semanisin |
On Computing an Optimal Semi-matching. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr Kolman, Jan Kratochvíl (eds.) |
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic |
Hanani-Tutte and Monotone Drawings. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger |
The Cinderella Game on Holes and Anti-holes. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrew R. A. McGrae, Michele Zito |
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Marchetti-Spaccamela |
Structures and Hyperstructures in Metabolic Networks. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller |
From Few Components to an Eulerian Graph by Adding Arcs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Arends, Joël Ouaknine, Charles W. Wampler |
On Searching for Small Kochen-Specker Vector Systems. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Iyad A. Kanj, Fenghui Zhang |
On the Independence Number of Graphs with Maximum Degree 3. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hisao Tamaki |
A Polynomial Time Algorithm for Bounded Directed Pathwidth. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski |
Counting Independent Sets in Claw-Free Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter |
Parameterized Complexity of Eulerian Deletion Problems. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Ravsky, Oleg Verbitsky |
On Collinear Sets in Straight-Line Drawings. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Toru Hasunuma, Hiroshi Nagamochi |
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christopher Auer, Andreas Gleißner |
Characterizations of Deque and Queue Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Emil Feldmann, Shantanu Das, Peter Widmayer |
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych |
Maximum Independent Set in 2-Direction Outersegment Graphs. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
List Coloring in the Absence of a Linear Forest. |
WG |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Geevarghese Philip, Venkatesh Raman, Yngve Villanger |
A Quartic Kernel for Pathwidth-One Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yota Otachi, Hans L. Bodlaender, Erik Jan van Leeuwen |
Complexity Results for the Spanning Tree Congestion Problem. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Frederic Dorn, Hannes Moser, Rolf Niedermeier, Mathias Weller |
Efficient Algorithms for Eulerian Extension. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitrios M. Thilikos (eds.) |
Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jannik Matuschke, Britta Peis |
Lattices and Maximum Flow Algorithms in Planar Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Petr A. Golovach, Daniël Paulusma, Jian Song |
Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Konrad Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries |
Colouring Vertices of Triangle-Free Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mike Fellows, Panos Giannopoulos, Christian Knauer, Christophe Paul, Frances A. Rosamond, Sue Whitesides, Nathan Yu |
Milling a Graph with Turn Costs: A Parameterized Complexity Perspective. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse, David Ilcinkas |
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tamás Fleiner |
On Stable Matchings and Flows. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 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 | Marcin Kaminski |
max-cut and Containment Relations in Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dániel Marx, Ildikó Schlotter |
Parameterized Complexity of the Arc-Preserving Subsequence Problem. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Padmini Mukkamala, János Pach, Deniz Sariöz |
Graphs with Large Obstacle Numbers. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin McDiarmid, Tobias Müller |
The Number of Bits Needed to Represent a Unit Disk Graph. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérémie Chalopin, Paola Flocchini, Bernard Mans, Nicola Santoro |
Network Exploration by Silent and Oblivious Robots. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine |
Algorithmic Graph Minors and Bidimensionality. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Pim van 't Hof, Daniel Lokshtanov, Jesper Nederlof |
Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Annabell Berger, Matthias Müller-Hannemann |
Uniform Sampling of Digraphs with a Fixed Degree Sequence. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Binh-Minh Bui-Xuan, Yuri Rabinovich, Gabriel Renault, Jan Arne Telle, Martin Vatshelle |
On the Boolean-Width of a Graph: Structure and Applications. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dimitris Achlioptas |
Algorithmic Barriers from Phase Transitions in Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
Solving Capacitated Dominating Set by Using Covering by Subsets and Maximum Matching. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Christophe Paul, Jan Arne Telle |
Generalized Graph Clustering: Recognizing (p, q)-Cluster Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Elsässer, Adrian Ogierman |
Efficient Broadcasting in Random Power Law Networks. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk |
Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Edyta Szymanska |
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriaki Ioannidou, Stavros D. Nikolopoulos |
The Longest Path Problem is Polynomial on Cocomparability Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Karin Arikushi, Radoslav Fulek, Balázs Keszegh, Filip Moric, Csaba D. Tóth |
Graphs that Admit Right Angle Crossing Drawings. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ge Xia, Yong Zhang |
On the Small Cycle Transversal of Planar Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | René van Bevern, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier |
Measuring Indifference: Unit Interval Vertex Deletion. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Petr A. Golovach, Dieter Kratsch, Jean-François Couturier |
Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato |
From Path Graphs to Directed Path Graphs. |
WG |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shiri Chechik, David Peleg |
Low-Port Tree Representations. |
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 | Gruia Calinescu, Cristina G. Fernandes, Hemanshu Kaul |
Maximum Series-Parallel Subgraph. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Gary MacGillivray, André Raspaud, Jacobus Swarts |
Injective Oriented Colourings. |
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 | Zdenek Dvorak, Daniel Král |
Algorithms for Classes of Graphs with Bounded Expansion. |
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 | 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 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh |
An Exact Algorithm for Minimum Distortion Embedding. |
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 | George B. Mertzios, Ignasi Sau, Shmuel Zaks |
A New Intersection Model and Improved Algorithms for Tolerance Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Meister, Jan Arne Telle |
Chordal Digraphs. |
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 | Rajiv Gandhi, Bradford Greening, Sriram V. Pemmaraju, Rajiv Raman |
Sub-coloring and Hypo-coloring 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 | Michael R. Fellows, Jiong Guo, Iyad A. Kanj |
The Parameterized Complexity of Some Minimum Label Problems. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | David Eppstein |
Graph-Theoretic Solutions to Computational Geometry Problems. |
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 | Petr A. Golovach, Jan Kratochvíl, Ondrej Suchý |
Parameterized Complexity of Generalized Domination Problems. |
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 | Zhentao Li, Ignasi Sau |
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph. |
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 | 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 | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann |
A Graph Polynomial Arising from Community Structure (Extended Abstract). |
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 | 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 | Frank Kammer, Torsten Tholey |
The k-Disjoint Paths Problem on Chordal Graphs. |
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 | Christophe Crespelle |
Fully Dynamic Representations of Interval Graphs. |
WG |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stephan Kreutzer, Sebastian Ordyniak |
Distance d-Domination Games. |
WG |
2009 |
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 | Pascal Koiran, Klaus Meer |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. |
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 | 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 | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
On Independent Sets and Bicliques in Graphs. |
WG |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yahav Nussbaum |
From a Circular-Arc Model to a Proper Circular-Arc Model. |
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 |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")