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=30
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Space-efficient basic graph algorithms
Amr Elmasry
,
Torben Hagerup
,
Frank Kammer
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 288-301
Pattern matching with variables: Fast algorithms and new hardness results
Henning Fernau
,
Florin Manea
,
Robert Mercaş
,
Markus L. Schmid
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 302-315
Approximating the generalized terminal backup problem via half-integral multiflow relaxation
Takuro Fukunaga
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 316-328
On matrix powering in low dimensions
Esther Galby
,
Joël Ouaknine
,
James Worrell
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 329-340
The complexity of recognizing unique sink orientations
Bernd Gärtner
,
Antonis Thomas
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 341-353
New geometric representations and domination problems on tolerance and multitolerance graphs
Archontia C. Giannopoulou
,
George B. Mertzios
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 354-366
Comparing 1D and 2D real time on cellular automata
Anaël Grandjean
,
Victor Poupet
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 367-378
Tropical effective primary and dual nullstellensätze
Dima Grigoriev
,
Vladimir V. Podolskii
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 379-391
Upper tail estimates with combinatorial proofs
Jan Hazla
,
Thomas Holenstein
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 392-405
Minimum cost flows in graphs with unit capacities
Andrew V. Goldberg
,
Haim Kaplan
,
Sagi Hed
,
Robert E. Tarjan
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 406-419
Inductive inference and reverse mathematics
Rupert Hölzl
,
Sanjay Jain
,
Frank Stephan
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 420-433
Dynamic planar embeddings of dynamic graphs
Jacob Holm
,
Eva Rotenberg
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 434-446
On the information carried by programs about the objects they compute
Mathieu Hoyrup
,
Cristóbal Rojas
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 447-459
Communication complexity of approximate matching in distributed graphs
Zengfeng Huang
,
Boz̑idar Radunović
,
Milan Vojnović
,
Qin Zhang
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 460-473
Stochastic scheduling of heavy-tailed jobs
Sungjin Im
,
Benjamin Moseley
,
Kirk Pruhs
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 474-486
On finding the Adams consensus tree
Jesper Jansson
,
Zhaoxian Li
,
Wing-Kin Sung
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 487-499
Flip distance is in FPT time
\mathcal O(n+ k\cdot c^k)
Iyad Kanj
,
Ge Xia
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 500-512
New pairwise spanners
Telikepalli Kavitha
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 513-526
Multi-
k
-ic depth three circuit lower bound
Neeraj Kayal
,
Chandan Saha
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 527-539
Automorphism groups of geometrically represented graphs
Pavel Klavík
,
Peter Zeman
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 540-553
Correlation clustering and two-edge-connected augmentation for planar graphs
Philip N. Klein
,
Claire Mathieu
,
Hang Zhou
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 554-567
Extended formulation lower bounds via hypergraph coloring?
Stavros G. Kolliopoulos
,
Yannis Moysoglou
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 568-581
Lempel-Ziv factorization may be harder than computing all runs
Dmitry Kosolobov
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 582-593
Visibly counter languages and constant depth circuits
Andreas Krebs
,
Klaus-Jörn Lange
,
Michael Ludwig
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 594-607
Optimal decremental connectivity in planar graphs
Jakub Ła̧cki
,
Piotr Sankowski
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 608-621
Seiten
<
1
2
3
>