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=5
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dispersion in unit disks
Adrian Dumitrescu
,
Minghui Jiang
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 299-310
Long non-crossing configurations in the plane
Adrian Dumitrescu
,
Csaba D. Tóth
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 311-322
The complexity of approximating bounded-degree Boolean
\#
CSP
Martin Dyer
,
Leslie Ann Goldberg
,
Markus Jalsenius
,
David Richerby
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 323-334
The complexity of the list homomorphism problem for graphs
László Egri
,
Andrei Krokhin
,
Benoit Larose
,
Pascal Tesson
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 335-346
Improved approximation guarantees for weighted matching in the semi-streaming model
Leah Epstein
,
Asaf Levin
,
Julián Mestre
,
Danny Segev
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 347-358
Computing least fixed points of probabilistic systems of polynomials
Javier Esparza
,
Andreas Gaiser
,
Stefan Kiefer
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 359-370
The
k
-in-a-path problem for claw-free graphs
Jiȓí Fiala
,
Marcin Kamiński
,
Bernard Lidický
,
Daniël Paulusma
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 371-382
Finding induced subgraphs via minimal triangulations
Fedor V. Fomin
,
Yngve Villanger
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 383-394
Inseparability and strong hypotheses for disjoint
NP
pairs
Lance Fortnow
,
Jack H. Lutz
,
Elvira Mayordomo
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 395-404
Branching-time model checking of one-counter processes
Stefan GÖller
,
Markus Lohrey
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 405-416
Evolving MultiAlgebras unify all usual sequential computation models
Serge Grigorieff
,
Pierre Valarcher
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 417-428
Collapsing and separating completeness notions under average-case and worst-case hypotheses
Xiaoyang Gu
,
John M. Hitchcock
,
Aduri Pavan
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 429-440
Revisiting the Rice Theorem of cellular automata
Pierre Guillon
,
Gaétan Richard
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 441-452
On optimal heuristic randomized semidecision procedures, with application to proof complexity
Edward A. Hirsch
,
Dmitry Itsykson
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 453-464
Weakening assumptions for deterministic subexponential time non-singular matrix completion
Maurice Jansen
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 465-476
On equations over sets of integers
Artur Jeż
,
Alexander Okhotin
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 477-488
A
\frac{4}{3}
-competitive randomized algorithm for online scheduling of packets with agreeable deadlines
Łukasz Jeż
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 489-500
Collapsible pushdown graphs of level 2 are tree-automatic
Alexander Kartzow
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 501-512
Approximate shortest paths avoiding a failed vertex: Optimal size data structures for unweighted graphs
Neelesh Khanna
,
Surender Baswana
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 513-524
Holant problems for regular graphs with complex edge functions
Michael Kowalczyk
,
Jin-Yi Cai
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 525-536
Is Ramsey's theorem
\omega
-automatic?
Dietrich Kuske
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 537-548
An efficient quantum algorithm for some instances of the group isomorphism problem
François Le Gall
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 549-560
Treewidth reduction for constrained separation and bipartization problems
Dániel Marx
,
Barry O'Sullivanand Igor Razgon
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 561-572
Online correlation clustering
Claire Mathieu
,
Ocan Sankur
,
Warren Schudy
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 573-584
The recognition of tolerance and bounded tolerance graphs
George B. Mertzios
,
Ignasi Sau
,
Shmuel Zaks
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 585-596
Seiten
<
1
2
3
>