Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Series=LNCS AND Volume=8747
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph-TSP from Steiner cycles
Satoru Iwata
,
Alantha Newman
,
R. Ravi
Lecture Notes in Computer Science
8747
, 2014, pp. 312-323
A characterization of mixed unit interval graphs
Felix Joos
Lecture Notes in Computer Science
8747
, 2014, pp. 324-335
On the number of connected sets in bounded degree graphs
Kustaa Kangas
,
Petteri Kaski
,
Mikko Koivisto
,
Janne H. Korhonen
Lecture Notes in Computer Science
8747
, 2014, pp. 336-347
Parameterized edge hamiltonicity
Michael Lampis
,
Kazuhisa Makino
,
Valia Mitsou
,
Yushi Uno
Lecture Notes in Computer Science
8747
, 2014, pp. 348-359
Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs
Van Bang Le
,
Andrea Oversberg
,
Oliver Schaudt
Lecture Notes in Computer Science
8747
, 2014, pp. 360-371
The maximum time of 2-neighbour bootstrap percolation: Complexity results
Thiago Marcilon
,
Samuel Nascimento
,
Rudini Sampaio
Lecture Notes in Computer Science
8747
, 2014, pp. 372-383
Parameterized algorithms for graph partitioning problems
Hadas Shachnai
,
Meirav Zehavi
Lecture Notes in Computer Science
8747
, 2014, pp. 384-395
Between treewidth and clique-width
Sigve Hortemo Sæther
,
Jan Arne Telle
Lecture Notes in Computer Science
8747
, 2014, pp. 396-407
A polynomial Turing-Kernel for weighted independent set in bull-free graphs
Stéphan Thomassé
,
Nicolas Trotignon
,
Kristina Vus̑ković
Lecture Notes in Computer Science
8747
, 2014, pp. 408-419
Seiten
<
1
2