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=506
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On covering a digital disc with concentric circles in
\mathbb Z^2
Sahadev Bera
,
Partha Bhowmick
,
Peer Stelldinger
,
Bhargab B. Bhattacharya
Theoretical Computer Science
506
, 2013, pp. 1-16
Strict bounds for pattern avoidance
F. Blanchet-Sadri
,
Brent Woodhouse
Theoretical Computer Science
506
, 2013, pp. 17-28
Split clique graph complexity
Liliana Alcón
,
Luerbio Faria
,
Celina M.H. de Figueiredo
,
Marisa Gutierrez
Theoretical Computer Science
506
, 2013, pp. 29-42
Deterministic geoleader election in disoriented anonymous systems
Yoann Dieudonné
,
Florence Levé
,
Franck Petit
,
Vincent Villain
Theoretical Computer Science
506
, 2013, pp. 43-54
Two spanning disjoint paths with required length in generalized hypercubes
Dyi-Rong Duh
,
Yao-Chung Lin
,
Cheng-Nan Lai
,
Yue-Li Wang
Theoretical Computer Science
506
, 2013, pp. 55-78
Cellular automata between sofic tree shifts
Tullio Ceccherini-Silberstein
,
Michel Coornaert
,
Francesca Fiorenzi
,
Zoran S̑unić
Theoretical Computer Science
506
, 2013, pp. 79-101
Enhanced string covering
Tomás̑ Flouri
,
Costas S. Iliopoulos
,
Tomasz Kociumaka
,
Solon P. Pissis
,
Simon J. Puglisi
,
W.F. Smyth
,
Wojciech Tyczyński
Theoretical Computer Science
506
, 2013, pp. 102-114
Solving
min ones 2-sat
as fast as
vertex cover
Neeldhara Misra
,
N.S. Narayanaswamy
,
Venkatesh Raman
,
Bal Sri Shankar
Theoretical Computer Science
506
, 2013, pp. 115-121