default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID37. WG 2011: Teplá Monastery, Czech Republic
- Petr Kolman, Jan Kratochvíl:
Graph-Theoretic Concepts in Computer Science - 37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers. Lecture Notes in Computer Science 6986, Springer 2011, ISBN 978-3-642-25869-5 - Alberto Marchetti-Spaccamela
:
Structures and Hyperstructures in Metabolic Networks. 1-4 - Dániel Marx:
Important Separators and Parameterized Algorithms. 5-10 - Liliana Alcón, Luérbio Faria, Celina M. H. de Figueiredo, Marisa Gutierrez:
Split Clique Graph Complexity. 11-22 - Felix Arends, Joël Ouaknine, Charles W. Wampler:
On Searching for Small Kochen-Specker Vector Systems. 23-34 - Christopher Auer, Andreas Gleißner:
Characterizations of Deque and Queue Graphs. 35-46 - Rémy Belmonte, Martin Vatshelle:
Graph Classes with Structured Neighborhoods and Algorithmic Applications. 47-58 - Hans L. Bodlaender, Dieter Kratsch:
Exact Algorithms for Kayles. 59-70 - Marijke H. L. Bodlaender, Cor A. J. Hurkens, Gerhard J. Woeginger:
The Cinderella Game on Holes and Anti-holes. 71-82 - Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec:
On the Complexity of Planar Covering of Small Graphs. 83-94 - Katarína Cechlárová, Eva Jelínková:
Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses. 95-106 - Christine T. Cheng, Eric McDermid, Ichiro Suzuki:
Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs. 107-118 - Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma:
List Coloring in the Absence of a Linear Forest. 119-130 - Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Ildikó Schlotter:
Parameterized Complexity of Eulerian Deletion Problems. 131-142 - Andreas Emil Feldmann, Shantanu Das, Peter Widmayer:
Restricted Cuts for Bisections in Solid Grids: A Proof via Polygons. 143-154 - Holger Flier, Matús Mihalák, Peter Widmayer, Anna Zych:
Maximum Independent Set in 2-Direction Outersegment Graphs. 155-166 - Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan:
Complexity of Splits Reconstruction for Low-Degree Trees. 167-178 - Andrew R. A. McGrae, Michele Zito:
Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem. 179-190 - Magnús M. Halldórsson, Sergey Kitaev, Artem V. Pyatkin:
Alternation Graphs. 191-202 - Toru Hasunuma, Hiroshi Nagamochi:
Improved Bounds for Minimum Fault-Tolerant Gossip Graphs. 203-214 - Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström:
Parameterized Two-Player Nash Equilibrium. 215-226 - Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michal Tuczynski:
Counting Independent Sets in Claw-Free Graphs. 227-237 - Iyad A. Kanj, Fenghui Zhang:
On the Independence Number of Graphs with Maximum Degree 3. 238-249 - Frantisek Galcík, Ján Katrenic, Gabriel Semanisin:
On Computing an Optimal Semi-matching. 250-261 - Daniel Lokshtanov, Matthias Mnich, Saket Saurabh:
Planar k-Path in Subexponential Time and Polynomial Space. 262-270 - 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. 271-282 - Radoslav Fulek, Michael J. Pelsmajer, Marcus Schaefer, Daniel Stefankovic:
Hanani-Tutte and Monotone Drawings. 283-294 - Alexander Ravsky, Oleg Verbitsky:
On Collinear Sets in Straight-Line Drawings. 295-306 - Manuel Sorge, René van Bevern, Rolf Niedermeier, Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs. 307-318 - Steven Chaplick, Elad Cohen, Juraj Stacho:
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid. 319-330 - Hisao Tamaki:
A Polynomial Time Algorithm for Bounded Directed Pathwidth. 331-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-27 00:09 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
