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 YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Scheduling for weighted flow time and energy with rejection penalty
Sze-Hang Chan
,
Tak-Wah Lam
,
Lap-Kei Lee
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 392-403
Clique-width: When hard does not mean impossible
Robert Ganian
,
Petr Hlinȇný
,
Jan Obdrz̑álek
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 404-415
From pathwidth to connected pathwidth
Dariusz Dereniowski
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 416-427
Polynomial fitting of data streams with applications to codeword testing
Andrew McGregor
,
Atri Rudra
,
Steve Uurtamo
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 428-439
Spectral sparsification in the semi-streaming setting
Jonathan A. Kelner
,
Alex Levin
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 440-451
Solovay functions and
K
-triviality
Laurent Bienvenu
,
Wolfgang Merkle
,
André Nies
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 452-463
Everywhere complex sequences and the probabilistic method
Andrey Yu. Rumyantsev
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 464-471
Online scheduling with interval conflicts
Magnús M. Halldórsson
,
Boaz Patt-Shamir
,
Dror Rawitz
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 472-483
Analysis of multi-stage open shop processing systems
Christian E.J. Eggermont
,
Alexander Schrijver
,
Gerhard J. Woeginger
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 484-494
Graphs encoded by regular expressions
Stefan Gulan
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 495-506
Extended regular expressions: Succinctness and decidability
Dominik D. Freydenberger
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 507-518
New exact and approximation algorithms for the star packing problem in undirected graphs
Maxim Babenko
,
Alexey Gusakov
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 519-530
Balanced interval coloring
Antonios Antoniadis
,
Falk Hüffner
,
Pascal Lenzner
,
Carsten Moldenhauer
,
Alexander Souza
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 531-542
Symmetric determinantal representation of weakly-skew circuits
Bruno Grenet
,
Erich L. Kaltofen
,
Pascal Koiran
,
Natacha Portier
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 543-554
Randomness efficient testing of sparse black box identities of unbounded degree over the reals
Markus Bläser
,
Christian Engels
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 555-566
On isomorphism testing of groups with normal Hall Subgroups
Youming Qiao
,
Jayalal Sarma M.N.
,
Bangsheng Tang
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 567-578
Space complexity of perfect matching in bounded genus bipartite graphs
Samir Datta
,
Raghav Kulkarni
,
Raghunath Tewari
,
N. Variyam Vinodchandran
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 579-590
The recognition of triangle graphs
George B. Mertzios
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 591-602
Collapse operation increases expressive power of deterministic higher order pushdown automata
Paweƚ Parys
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 603-614
Temporal synthesis for bounded systems and environments
Orna Kupferman
,
Yoad Lustig
,
Moshe Y. Vardi
,
Mihalis Yannakakis
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 615-626
Linear temporal logic for regular cost functions
Denis Kuperberg
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 627-636
Bounds on the maximum multiplicity of some common geometric graphs
Adrian Dumitrescu
,
André Schulz
,
Adam Sheffer
,
Csaba D. Tóth
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 637-648
On the computational complexity of ham-sandwich cuts, Helly sets, and related problems
Christian Knauer
,
Hans Raj Tiwary
,
Daniel Werner
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 649-660
Quantum query complexity of minor-closed graph properties
Andrew M. Childs
,
Robin Kothari
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 661-672
Three query locally decodable codes with higher correctness require exponential length
Anna Gál
,
Andrew Mills
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 673-684
Seiten
<
1
2
3
4