Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Booktitle=Proceedings of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'2011 (Tepl{\'a} Monastery, Czech Republic, June 21-24, 2011)

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Structures and hyperstructures in metabolic networks
Alberto Marchetti-Spaccamela
Lecture Notes in Computer Science 6986, 2011, pp. 1-4
Important separators and parameterized algorithms
Dániel Marx
Lecture Notes in Computer Science 6986, 2011, pp. 5-10
Split clique graph complexity
Liliana Alcón, Luerbio Faria, Celina M.H. de Figueiredo, Marisa Gutierrez
Lecture Notes in Computer Science 6986, 2011, pp. 11-22
On searching for small Kochen-Specker vector systems
Felix Arends, Joël Ouaknine, Charles W. Wampler
Lecture Notes in Computer Science 6986, 2011, pp. 23-34
Characterizations of deque and queue graphs
Christopher Auer, Andreas Gleißner
Lecture Notes in Computer Science 6986, 2011, pp. 35-46
Graph classes with structured neighborhoods and algorithmic applications
Rémy Belmonte, Martin Vatshelle
Lecture Notes in Computer Science 6986, 2011, pp. 47-58
Exact algorithms for Kayles
Hans L. Bodlaender, Dieter Kratsch
Lecture Notes in Computer Science 6986, 2011, pp. 59-70
The Cinderella game on holes and anti-holes
Marijke H.L. Bodlaender, Cor A.J. Hurkens, Gerhard J. Woeginger
Lecture Notes in Computer Science 6986, 2011, pp. 71-82
On the complexity of planar covering of small graphs
Ondȓej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec
Lecture Notes in Computer Science 6986, 2011, pp. 83-94
Approximability of economic equilibrium for housing markets with duplicate houses
Katarína Cechlárová, Eva Jelínková
Lecture Notes in Computer Science 6986, 2011, pp. 95-106
Planarization and acyclic colorings of subcubic claw-free graphs
Christine Cheng, Eric McDermid, Ichiro Suzuki
Lecture Notes in Computer Science 6986, 2011, pp. 107-118
List coloring in the absence of a linear forest
Jean-François Couturier, Petr A. Golovach, Dieter Kratsch, Daniël Paulusma
Lecture Notes in Computer Science 6986, 2011, pp. 119-130
Parameterized complexity of Eulerian deletion problems
Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michaƚ Pilipczuk, Ildikó Schlotter
Lecture Notes in Computer Science 6986, 2011, pp. 131-142
Restricted cuts for bisections in solid grids: A proof via polygons
Andreas Emil Feldmann, Shantanu Das, Peter Widmayer
Lecture Notes in Computer Science 6986, 2011, pp. 143-154
Maximum independent set in 2-direction outersegment graphs
Holger Flier, Matús̑ Mihalák, Peter Widmayer, Anna Zych
Lecture Notes in Computer Science 6986, 2011, pp. 155-166
Complexity of splits reconstruction for low-degree trees
Serge Gaspers, Mathieu Liedloff, Maya Stein, Karol Suchan
Lecture Notes in Computer Science 6986, 2011, pp. 167-178
Empires make cartography hard: The complexity of the empire colouring problem
Andrew R.A. McGrae, Michele Zito
Lecture Notes in Computer Science 6986, 2011, pp. 179-190
Alternation graphs
Magnús M. Halldórsson, Sergey Kitaev, Artem Pyatkin
Lecture Notes in Computer Science 6986, 2011, pp. 191-202
Improved bounds for minimum fault-tolerant gossip graphs
Toru Hasunuma, Hiroshi Nagamochi
Lecture Notes in Computer Science 6986, 2011, pp. 203-214
Parameterized two-player Nash equilibrium
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch, Magnus Wahlström
Lecture Notes in Computer Science 6986, 2011, pp. 215-226
Counting independent sets in claw-free graphs
Konstanty Junosza-Szaniawski, Zbigniew Lonc, Michaƚ Tuczyński
Lecture Notes in Computer Science 6986, 2011, pp. 227-237
On the independence number of graphs with maximum degree 3
Iyad A. Kanj, Fenghui Zhang
Lecture Notes in Computer Science 6986, 2011, pp. 238-249
On computing an optimal semi-matching
Frantis̑ek Galc̑ík, Ján Katrenic̑, Gabriel Semanis̑in
Lecture Notes in Computer Science 6986, 2011, pp. 250-261
Planar k-path in subexponential time and polynomial space
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
Lecture Notes in Computer Science 6986, 2011, pp. 262-270
Approximability of the path-distance-width for AT-free graphs
Yota Otachi, Toshiki Saitoh, Katsuhisa Yamanaka, Shuji Kijima, Yoshio Okamoto, Hirotaka Ono, Yushi Uno, Koichi Yamazaki
Lecture Notes in Computer Science 6986, 2011, pp. 271-282

Seiten 1 2 >