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=571
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The importance of being proper: (In clustered-level planarity and
T
-level planarity)
Patrizio Angelini
,
Giordano Da Lozzo
,
Giuseppe Di Battista
,
Fabrizio Frati
,
Vincenzo Roselli
Theoretical Computer Science
571
, 2015, pp. 1-9
On the construction of all shortest vertex-disjoint paths in Cayley graphs of Abelian groups
Cheng-Nan Lai
Theoretical Computer Science
571
, 2015, pp. 10-20
Combinatorial auctions with verification are tractable
Piotr Krysta
,
Carmine Ventre
Theoretical Computer Science
571
, 2015, pp. 21-35
Upward planar graphs and their duals
Christopher Auer
,
Christian Bachmaier
,
Franz J. Brandenburg
,
Andreas Gleißner
,
Kathrin Hanauer
Theoretical Computer Science
571
, 2015, pp. 36-49
Searching for Zimin patterns
Wojciech Rytter
,
Arseny M. Shur
Theoretical Computer Science
571
, 2015, pp. 50-57
A PTAS for the minimum weight connected vertex cover
P_3
problem on unit disk graphs
Limin Wang
,
Xiaoyan Zhang
,
Zhao Zhang
,
Hajo Broersma
Theoretical Computer Science
571
, 2015, pp. 58-66
Termination of the iterated strong-factor operator on multipartite graphs
Christophe Crespelle
,
Thi Ha Duong Phan
,
The Hung Tran
Theoretical Computer Science
571
, 2015, pp. 67-77
On graphs that are not PCGs
Stephane Durocher
,
Debajyoti Mondal
,
Md. Saidur Rahman
Theoretical Computer Science
571
, 2015, pp. 78-87