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: Series=Leibniz International Proceedings in Informatics (LIPIcs) AND Volume=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of analyzing infinite-state Markov chains, Markov decision processes, and stochastic games
Kousha Etessami
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 1-2
Graph coloring, communication complexity and the stubborn problem
Nicolas Bousquet
,
Aurélie Lagoutte
,
Stéphan Thomassé
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 3-4
Physarum computations
Kurt Mehlhorn
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 5-6
Algorithmic graph structure theory (Tutorial)
Dániel Marx
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 7-7
Searching for better fill-in
Fedor V. Fomin
,
Yngve Villanger
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 8-19
Probably optimal graph motifs
Andreas Björklund
,
Petteri Kaski
,
Lukasz Kowalik
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 20-31
Tight bounds for parameterized complexity of cluster editing
Fedor V. Fomin
,
Stefan Kratsch
,
Marcin Pilipczuk
,
Michal Pilipczuk
,
Yngve Villanger
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 32-43
Bounded-width QBF is PSPACE-complete
Albert Atserias
,
Sergi Oliva
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 44-54
Model counting for CNF formulas of bounded modular treewidth
Daniel Paulusma
,
Friedrich Slivovsky
,
Stefan Szeider
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 55-66
Backdoors to
q
-Horn
Serge Gaspers
,
Sebastian Ordyniak
,
M.S. Ramanujan
,
Saket Saurabh
,
Stefan Szeider
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 67-79
On polynomial kernels for sparse integer linear programs
Stefan Kratsch
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 80-91
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
Fedor V. Fomin
,
Daniel Lokshtanov
,
Saket Saurabh
,
Dimitrios M. Thilikos
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 92-103
The PCP theorem for NP over the reals
Martijn Baartse
,
Klaus Meer
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 104-115
Mutual dimension
Adam Case
,
Jack H. Lutz
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 116-126
Exact and approximation algorithms for the maximum constraint satisfaction problem over the point algebra
Yoichi Iwata
,
Yuichi Yoshida
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 127-138
Local search is better than random assignment for bounded occurrence ordering
k
-CSPs
Konstantin Makarychev
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 139-147
The complexity of approximating conservative counting CSPs
Xi Chen
,
Martin Dyer
,
Leslie Ann Goldberg
,
Mark Jerrum
,
Pinyan Lu
,
Colin McQuillan
,
David Richerby
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 148-159
Lossy chains and fractional secret sharing
Yuval Ishai
,
Eyal Kushilevitz
,
Omer Strulovich
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 160-171
Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM
Sarah Cannon
,
Erik D. Demaine
,
Martin L. Demaine
,
Sarah Eisenstat
,
Matthew J. Patitz
,
Robert T. Schweller
,
Scott M. Summers
,
Andrew Winslow
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 172-184
Unlabeled data does provably help
Malte Darnstädt
,
Hans Ulrich Simon
,
Balázs Szörényi
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 185-196
Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings
Michal Pilipczuk
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 197-208
On pairwise spanners
Marek Cygan
,
Fabrizio Grandoni
,
Telikepalli Kavitha
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 209-220
Excluded vertex-minors for graphs of linear rank-width at most
k
Jisu Jeong
,
O-joung Kwon
,
Sang-il Oum
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 221-232
Recompression: A simple and powerful technique for word equations
Artur Jez
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 233-244
Fast algorithms for Abelian periods in words and greatest common divisor queries
Tomasz Kociumaka
,
Jakub Radoszewski
,
Wojciech Rytter
Leibniz International Proceedings in Informatics (LIPIcs)
20
, 2013, pp. 245-256
Seiten 1
2
3
>