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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=351
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Chordless paths through three vertices
Robert Haas
,
Michael Hoffmann
Theoretical Computer Science
351
(3), 2006, pp. 360-371
Trees, grids, and MSO decidability: From graphs to matroids
Petr Hlinȇý
,
Detlef Seese
Theoretical Computer Science
351
(3), 2006, pp. 372-393
Parameterized graph separation problems
Dániel Marx
Theoretical Computer Science
351
(3), 2006, pp. 394-406
Parameterized coloring problems on chordal graphs
Dániel Marx
Theoretical Computer Science
351
(3), 2006, pp. 407-424
Moving policies in cyclic assembly line scheduling
Matthias Müller-Hannemann
,
Karsten Weihe
Theoretical Computer Science
351
(3), 2006, pp. 425-436
Looking at the stars
Elena Prieto
,
Christian Sloper
Theoretical Computer Science
351
(3), 2006, pp. 437-445
Parameterized algorithms for feedback set problems and their duals in tournaments
Venkatesh Raman
,
Saket Saurabh
Theoretical Computer Science
351
(3), 2006, pp. 446-458
Seiten
<
1
2