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=566
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Descriptional complexity of unambiguous input-driven pushdown automata
Alexander Okhotin
,
Kai Salomaa
Theoretical Computer Science
566
, 2015, pp. 1-11
The fault-tolerant capacitated
K
-center problem
Shiri Chechik
,
David Peleg
Theoretical Computer Science
566
, 2015, pp. 12-25
Abelian properties of Parry words
Ondȓej Turek
Theoretical Computer Science
566
, 2015, pp. 26-38
Complexity of conflict-free colorings of graphs
Luisa Gargano
,
Adele A. Rescigno
Theoretical Computer Science
566
, 2015, pp. 39-49
Some sufficient conditions for 1-planar graphs to be Class 1
Wenwen Zhang
,
Jian-Liang Wu
Theoretical Computer Science
566
, 2015, pp. 50-58
On the proper orientation number of bipartite graphs
Julio Araujo
,
Nathann Cohen
,
Susanna F. de Rezende
,
Frédéric Havet
,
Phablo F.S. Moura
Theoretical Computer Science
566
, 2015, pp. 59-75