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=494
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nontriviality for exponential time w.r.t. weak reducibilities
Klaus Ambos-Spies
,
Timur Bakibayev
Theoretical Computer Science
494
, 2013, pp. 2-12
Streaming algorithms for language recognition problems
Ajesh Babu
,
Nutan Limaye
,
Jaikumar Radhakrishnan
,
Girish Varma
Theoretical Computer Science
494
, 2013, pp. 13-23
Twisted Jacobi intersections curves
Rongquan Feng
,
Menglong Nie
,
Hongfeng Wu
Theoretical Computer Science
494
, 2013, pp. 24-35
On symmetric nonlocal games
Andris Ambainis
,
Dmitry Kravchenko
,
Nikolay Nahimov
,
Alexander Rivosh
,
Madars Virza
Theoretical Computer Science
494
, 2013, pp. 36-48
Graph sharing games: Complexity and connectivity
Josef ibulka
,
Jan Kync̑l
,
Viola Mészáros
,
Rudolf Stolaȓ
,
Pavel Valtr
Theoretical Computer Science
494
, 2013, pp. 49-62
Partition functions on
k
-regular graphs with
\{0,1\}
-vertex assignments and real edge functions
Jin-Yi Cai
,
Michael Kowalczyk
Theoretical Computer Science
494
, 2013, pp. 63-74
An
O(n^2)
-time algorithm for the minimal interval completion problem
Christophe Crespelle
,
Ioan Todinca
Theoretical Computer Science
494
, 2013, pp. 75-85
Incremental list coloring of graphs, parameterized by conservation
Sepp Hartung
,
Rolf Niedermeier
Theoretical Computer Science
494
, 2013, pp. 86-98
Two-Layer Planarization parameterized by feedback edge set
Johannes Uhlmann
,
Mathias Weller
Theoretical Computer Science
494
, 2013, pp. 99-111
A simple routing algorithm based on Schnyder coordinates
Xin He
,
Huaming Zhang
Theoretical Computer Science
494
, 2013, pp. 112-121
Revisiting the Minimum Breakpoint Linearization problem
Laurent Bulteau
,
Guillaume Fertin
,
Irena Rusu
Theoretical Computer Science
494
, 2013, pp. 122-133
Kernel and fast algorithm for dense triplet inconsistency
Sylvain Guillemot
,
Matthias Mnich
Theoretical Computer Science
494
, 2013, pp. 134-143
Deterministic polynomial-time algorithms for designing short DNA words
Ming-Yang Kao
,
Henry C.M. Leung
,
He Sun
,
Yong Zhang
Theoretical Computer Science
494
, 2013, pp. 144-160