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: Journal=Theor.~Comput.~Sci. AND Volume=420
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Intervals of balanced binary trees in the Tamari lattice
Samuele Giraudo
Theoretical Computer Science
420
, 2012, pp. 1-27
Induced packing of odd cycles in planar graphs
Petr A. Golovach
,
Marcin Kamiński
,
Daniël Paulusma
,
Dimitrios M. Thilikos
Theoretical Computer Science
420
, 2012, pp. 28-35
Behavior of various complexity functions
Teturo Kamae
Theoretical Computer Science
420
, 2012, pp. 36-47
Properties of Gomory-Hu co-cycle bases
Telikepalli Kavitha
Theoretical Computer Science
420
, 2012, pp. 48-55
Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring
Daniel Kirsten
Theoretical Computer Science
420
, 2012, pp. 56-63
Testing computability by width-two OBDDs
Dana Ron
,
Gilad Tsur
Theoretical Computer Science
420
, 2012, pp. 64-79
Eulerian entropy and non-repetitive subword complexity
T.K. Subrahmonian Moothathu
Theoretical Computer Science
420
, 2012, pp. 80-88
Single and multiple device DSA problems, complexities and online algorithms
Weiwei Wu
,
Minming Li
,
Wanyong Tian
,
Jason Chun Xue
,
Enhong Chen
Theoretical Computer Science
420
, 2012, pp. 89-98