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=511
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved linear problem kernel for planar connected dominating set
Weizhong Luo
,
Jianxin Wang
,
Qilong Feng
,
Jiong Guo
,
Jianer Chen
Theoretical Computer Science
511
, 2013, pp. 2-12
On an extension of the Sort & Search method with application to scheduling theory
Ch. Lenté
,
M. Liedloff
,
A. Soukhal
,
V. T'Kindt
Theoretical Computer Science
511
, 2013, pp. 13-22
An exponential time 2-approximation algorithm for bandwidth
Martin Fürer
,
Serge Gaspers
,
Shiva Prasad Kasiviswanathan
Theoretical Computer Science
511
, 2013, pp. 23-31
Moderately exponential approximation for makespan minimization on related machines
Marin Bougeret
,
Pierre-Francois Dutot
,
Denis Trystram
Theoretical Computer Science
511
, 2013, pp. 32-41
Parameterized maximum path coloring
Michael Lampis
Theoretical Computer Science
511
, 2013, pp. 42-53
Graph classes with structured neighborhoods and algorithmic applications
Rémy Belmonte
,
Martin Vatshelle
Theoretical Computer Science
511
, 2013, pp. 54-65
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Binh-Minh Bui-Xuan
,
Jan Arne Telle
,
Martin Vatshelle
Theoretical Computer Science
511
, 2013, pp. 66-76
Parameterized complexity of MaxSat Above Average
Robert Crowston
,
Gregory Gutin
,
Mark Jones
,
Venkatesh Raman
,
Saket Saurabh
Theoretical Computer Science
511
, 2013, pp. 77-84
A novel parameterised approximation algorithm for
minimum vertex cover
Ljiljana Brankovic
,
Henning Fernau
Theoretical Computer Science
511
, 2013, pp. 85-108
On exact algorithms for the permutation CSP
Eun Jung Kim
,
Daniel Gonçalves
Theoretical Computer Science
511
, 2013, pp. 109-116
Kernel bounds for path and cycle problems
Hans L. Bodlaender
,
Bart M.P. Jansen
,
Stefan Kratsch
Theoretical Computer Science
511
, 2013, pp. 117-136
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing
Peter Damaschke
Theoretical Computer Science
511
, 2013, pp. 137-146
New parameterized algorithms for the edge dominating set problem
Mingyu Xiao
,
Ton Kloks
,
Sheung-Hung Poon
Theoretical Computer Science
511
, 2013, pp. 147-158
The
l
-Diversity problem: Tractability and approximability
Riccardo Dondi
,
Giancarlo Mauri
,
Italo Zoppis
Theoretical Computer Science
511
, 2013, pp. 159-171
Parameterized complexity of vertex deletion into perfect graph classes
Pinar Heggernes
,
Pim van 't Hof
,
Bart M.P. Jansen
,
Stefan Kratsch
,
Yngve Villanger
Theoretical Computer Science
511
, 2013, pp. 172-180