Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=5911

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

Graph-theoretic solutions to computational geometry problems
David Eppstein
Lecture Notes in Computer Science 5911, 2010, pp. 1-16
Algorithms for classes of graphs with bounded expansion
Zdenȇk Dvoȓák, Daniel Král'
Lecture Notes in Computer Science 5911, 2010, pp. 17-32
A graph polynomial arising from community structure
Ilia Averbouch, Johann A. Makowsky, Peter Tittmann
Lecture Notes in Computer Science 5911, 2010, pp. 33-43
Fast exact algorithms for Hamiltonicity in claw-free graphs
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma
Lecture Notes in Computer Science 5911, 2010, pp. 44-53
Maximum series-parallel subgraph
Gruia Cȃlinescu, Cristina G. Fernandes, Hemanshu Kaul
Lecture Notes in Computer Science 5911, 2010, pp. 54-65
Low-port tree representations
Shiri Chechik, David Peleg
Lecture Notes in Computer Science 5911, 2010, pp. 66-76
Fully dynamic representations of interval graphs
Christophe Crespelle
Lecture Notes in Computer Science 5911, 2010, pp. 77-87
The parameterized complexity of some minimum label problems
Michael R. Fellows, Jiong Guo, Iyad A. Kanj
Lecture Notes in Computer Science 5911, 2010, pp. 88-99
Exact and parameterized algorithms for Max Internal Spanning Tree
Henning Fernau, Serge Gaspers, Daniel Raible
Lecture Notes in Computer Science 5911, 2010, pp. 100-111
An exact algorithm for minimum distortion embedding
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
Lecture Notes in Computer Science 5911, 2010, pp. 112-121
Sub-coloring and hypo-coloring interval graphs
Rajiv Gandhi, Bradford, Jr. Greening, Sriram Pemmaraju, Rajiv Raman
Lecture Notes in Computer Science 5911, 2010, pp. 122-132
Parameterized complexity of generalized domination problems
Petr A. Golovach, Jan Kratochvíl, Ondȓej Suchý
Lecture Notes in Computer Science 5911, 2010, pp. 133-142
Connected feedback vertex set in planar graphs
Alexander Grigoriev, René Sitters
Lecture Notes in Computer Science 5911, 2010, pp. 143-153
Logical locality entails frugal distributed computation over graphs
Stéphane Grumbach, Zhilin Wu
Lecture Notes in Computer Science 5911, 2010, pp. 154-165
On module-composed graphs
Frank Gurski, Egon Wanke
Lecture Notes in Computer Science 5911, 2010, pp. 166-177
An even simpler linear-time algorithm for verifying minimum spanning trees
Torben Hagerup
Lecture Notes in Computer Science 5911, 2010, pp. 178-189
The k-disjoint paths problem on chordal graphs
Frank Kammer, Torsten Tholey
Lecture Notes in Computer Science 5911, 2010, pp. 190-201
Local algorithms for edge colorings in UDGs
Iyad A. Kanj, Andreas Wiese, Fenghui Zhang
Lecture Notes in Computer Science 5911, 2010, pp. 202-213
Directed rank-width and displit decomposition
Mamadou Moustapha Kanté, Michaël Rao
Lecture Notes in Computer Science 5911, 2010, pp. 214-225
An algorithmic study of switch graphs
Bastian Katz, Ignaz Rutter, Gerhard Woeginger
Lecture Notes in Computer Science 5911, 2010, pp. 226-237
Hardness results and efficient algorithms for graph powers
Van Bang Le, Ngoc Tuy Nguyen
Lecture Notes in Computer Science 5911, 2010, pp. 238-249
Graph partitioning and traffic grooming with bounded degree request graph
Zhentao Li, Ignasi Sau
Lecture Notes in Computer Science 5911, 2010, pp. 250-261
Injective oriented colourings
Gary MacGillivray, André Raspaud, Jacobus Swarts
Lecture Notes in Computer Science 5911, 2010, pp. 262-272
Chordal digraphs
Daniel Meister, Jan Arne Telle
Lecture Notes in Computer Science 5911, 2010, pp. 273-284
A new intersection model and improved algorithms for tolerance graphs
George B. Mertzios, Ignasi Sau, Shmuel Zaks
Lecture Notes in Computer Science 5911, 2010, pp. 285-295

Seiten 1 2 >