Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=4769

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

Computational complexity of generalized domination: A complete dichotomy for chordal graphs
Petr Golovach, Jan Kratochvíl
Lecture Notes in Computer Science 4769, 2007, pp. 1-11
Recognizing bipartite tolerance graphs in linear time
Arthur H. Busch, Garth Isaak
Lecture Notes in Computer Science 4769, 2007, pp. 12-20
Graph searching in a crime wave
David Richerby, Dimitrios M. Thilikos
Lecture Notes in Computer Science 4769, 2007, pp. 21-32
Monotonicity of non-deterministic graph searching
Frédéric Mazoit, Nicolas Nisse
Lecture Notes in Computer Science 4769, 2007, pp. 33-44
Tree-width and optimization in bounded degree graphs
Vadim Lozin, Martin Milanic̑
Lecture Notes in Computer Science 4769, 2007, pp. 45-54
On restrictions of balanced 2-interval graphs
Philippe Gambette, Stéphane Vialette
Lecture Notes in Computer Science 4769, 2007, pp. 55-65
Graph operations characterizing rank-width and balanced graph expressions
Bruno Courcelle, Mamadou Moustapha Kanté
Lecture Notes in Computer Science 4769, 2007, pp. 66-75
The clique-width of tree-power and leaf-power graphs
Frank Gurski, Egon Wanke
Lecture Notes in Computer Science 4769, 2007, pp. 76-85
NLC-2 graph recognition and isomorphism
Vincent Limouzy, Fabien de Montgolfier, Michaël Rao
Lecture Notes in Computer Science 4769, 2007, pp. 86-98
A characterisation of the minimal triangulations of permutation graphs
Daniel Meister
Lecture Notes in Computer Science 4769, 2007, pp. 99-108
The 3-Steiner root problem
Maw-Shang Chang, Ming-Tat Ko
Lecture Notes in Computer Science 4769, 2007, pp. 109-120
On finding graph clusterings with maximum modularity
Ulrik Brandes, Daniel Delling, Marco Gaertler, Robert Görke, Martin Hoefer, Zoran Nikoloski, Dorothea Wagner
Lecture Notes in Computer Science 4769, 2007, pp. 121-132
On minimum area planar upward drawings of directed trees and other families of directed acyclic graphs
Fabrizio Frati
Lecture Notes in Computer Science 4769, 2007, pp. 133-144
A very practical algorithm for the two-paths problem in 3-connected planar graphs
Torben Hagerup
Lecture Notes in Computer Science 4769, 2007, pp. 145-150
Approximation algorithms for geometric intersection graphs
Klaus Jansen
Lecture Notes in Computer Science 4769, 2007, pp. 151-153
An equivalent version of the Caccetta-Häggkvist conjecture in an online load balancing problem
Angelo Monti, Paolo Penna, Riccardo Silvestri
Lecture Notes in Computer Science 4769, 2007, pp. 154-165
Mixing 3-colourings in bipartite graphs
Luis Cereceda, Jan van den Heuvel, Matthew Johnson
Lecture Notes in Computer Science 4769, 2007, pp. 166-177
Minimum-weight cyclecovers and their approximability
Bodo Manthey
Lecture Notes in Computer Science 4769, 2007, pp. 178-189
On the number of \alpha-orientations
Stefan Felsner, Florian Zickfeld
Lecture Notes in Computer Science 4769, 2007, pp. 190-201
Complexity and approximation results for the connected vertex cover problem
Bruno Escoffier, Laurent Gourvès, Jérôme Monnot
Lecture Notes in Computer Science 4769, 2007, pp. 202-213
Segmenting strings homogeneously via trees
Peter Damaschke
Lecture Notes in Computer Science 4769, 2007, pp. 214-225
Characterisations and linear-time recognition of probe cographs
Van Bang Le, H.N. de Ridder
Lecture Notes in Computer Science 4769, 2007, pp. 226-237
Recognition of polygon-circle graphs and graphs of interval filaments is NP-complete
Martin Pergel
Lecture Notes in Computer Science 4769, 2007, pp. 238-247
Proper Helly circular-arc graphs
Min Chi Lin, Francisco J. Soulignac, Jayme L. Szwarcfiter
Lecture Notes in Computer Science 4769, 2007, pp. 248-257
Pathwidth of circular-arc graphs
Karol Suchan, Ioan Todinca
Lecture Notes in Computer Science 4769, 2007, pp. 258-269

Seiten 1 2 >