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=522
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
(Nearly-)tight bounds on the contiguity and linearity of cographs
Christophe Crespelle
,
Philippe Gambette
Theoretical Computer Science
522
, 2014, pp. 1-12
k
-capture in multiagent pursuit evasion, or the lion and the hyenas
Shaunak D. Bopardikar
,
Subhash Suri
Theoretical Computer Science
522
, 2014, pp. 13-23
A method of batching conflict routings in shuffle-exchange networks
Yi-Hao Zhang
,
Yue-Hong Shen
,
Min Dong
,
Yi-Min Jiang
Theoretical Computer Science
522
, 2014, pp. 24-33
Colouring of graphs with Ramsey-type forbidden subgraphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Daniel Paulusma
Theoretical Computer Science
522
, 2014, pp. 34-43
A probabilistic PTAS for shortest common superstring
Kai Plociennik
Theoretical Computer Science
522
, 2014, pp. 44-53
Total coloring of planar graphs with maximum degree 8
Huijuan Wang
,
Lidong Wu
,
Jianliang Wu
Theoretical Computer Science
522
, 2014, pp. 54-61
Design and analysis of periodic multiple seeds
Lavinia Egidi
,
Giovanni Manzini
Theoretical Computer Science
522
, 2014, pp. 62-76
Linear computation of unbordered conjugate on unordered alphabet
J.-P. Duval
,
T. Lecroq
,
A. Lefebvre
Theoretical Computer Science
522
, 2014, pp. 77-84
Matching and weighted
P_2
-packing: Algorithms and kernels
Qilong Feng
,
Jianxin Wang
,
Jianer Chen
Theoretical Computer Science
522
, 2014, pp. 85-94
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization
Gianluigi Greco
,
Francesco Scarcello
Theoretical Computer Science
522
, 2014, pp. 95-114