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=565
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the parameterized complexity of vertex cover and edge cover with connectivity constraints
Henning Fernau
,
Fedor V. Fomin
,
Geevarghese Philip
,
Saket Saurabh
Theoretical Computer Science
565
, 2015, pp. 1-15
On the Cartesian skeleton and the factorization of the strong product of digraphs
Marc Hellmuth
,
Tilen Marc
Theoretical Computer Science
565
, 2015, pp. 16-29
Visual cryptograms of random grids for threshold access structures
Shyong Jian Shyu
Theoretical Computer Science
565
, 2015, pp. 30-49
A family of sand automata
Nicholas Faulkner
,
Reem Yassawi
Theoretical Computer Science
565
, 2015, pp. 50-62
Reductions between scheduling problems with non-renewable resources and knapsack problems
Péter Györgyi
,
Tamás Kis
Theoretical Computer Science
565
, 2015, pp. 63-76
Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms
Abraham P. Punnen
,
Piyashat Sripratak
,
Daniel Karapetyan
Theoretical Computer Science
565
, 2015, pp. 77-89
Vertical representation of
C^\infty
-words
Jean-Marc Fédou
,
Gabriele Fici
Theoretical Computer Science
565
, 2015, pp. 90-101
Combinatorial optimization problems with uncertain costs and the OWA criterion
Adam Kasperski
,
Paweƚ Zieliński
Theoretical Computer Science
565
, 2015, pp. 102-112