Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=8165

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

Tight upper bounds for minimum feedback arc sets of regular graphs
Kathrin Hanauer, Franz J. Brandenburg, Christopher Auer
Lecture Notes in Computer Science 8165, 2013, pp. 298-309
A linear-time kernelization for the rooted k-leaf outbranching problem
Frank Kammer
Lecture Notes in Computer Science 8165, 2013, pp. 310-320
On retracts, absolute retracts, and folds in cographs
Ton Kloks, Yue-Li Wang
Lecture Notes in Computer Science 8165, 2013, pp. 321-332
Coloring triangle-free rectangular frame intersection graphs with O(\log\log n) colors
Tomasz Krawczyk, Arkadiusz Pawlik, Bartosz Walczak
Lecture Notes in Computer Science 8165, 2013, pp. 333-344
On finding Tucker submatrices and Lekkerkerker-Boland subgraphs
Nathan Lindzey, Ross M. McConnell
Lecture Notes in Computer Science 8165, 2013, pp. 345-357
Certifying 3-edge-connectivity
Kurt Mehlhorn, Adrian Neumann, Jens M. Schmidt
Lecture Notes in Computer Science 8165, 2013, pp. 358-369
Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Neeldhara Misra, Fahad Panolan, Ashutosh Rai, Venkatesh Raman, Saket Saurabh
Lecture Notes in Computer Science 8165, 2013, pp. 370-381
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Ragnar Nevries, Christian Rosenke
Lecture Notes in Computer Science 8165, 2013, pp. 382-393
Beyond knights and knaves
Christine T. Cheng, Andrew McConvey, Drew Onderko, Nathaniel Shar, Charles Tomlinson
Lecture Notes in Computer Science 8165, 2013, pp. 394-405
Drawing graphs with few arcs
André Schulz
Lecture Notes in Computer Science 8165, 2013, pp. 406-417
Connecting terminals and 2-disjoint connected subgraphs
Jan Arne Telle, Yngve Villanger
Lecture Notes in Computer Science 8165, 2013, pp. 418-428

Seiten < 1 2