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=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
New developments in iterated rounding
Nikhil Bansal
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 1-10
Reasoning about distributed systems: WYSIWYG
Aiswarya Cyriac
,
Paul Gastin
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 11-30
Colour refinement: A simple partitioning algorithm with applications from graph isomorphism testing to machine learning
Martin Grohe
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 31-31
Properties and utilization of capacitated automata
Orna Kupferman
,
Tami Tamir
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 33-44
Algorithms, games, and evolution
Erick Chastain
,
Adi Livnat
,
Christos H. Papadimitriou
,
Umesh V. Vazirani
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 45-46
The polynomial method in circuit complexity applied to algorithm design
Richard Ryan Williams
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 47-60
Vertex exponential algorithms for connected
f
-factors
Geevarghese Philip
,
M.S. Ramanujan
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 61-71
Connecting vertices by independent trees
Manu Basavaraju
,
Fedor V. Fomin
,
Petr A. Golovach
,
Saket Saurabh
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 73-84
Tree deletion set has a polynomial kernel (but no OPT
^{\mathcal O(1)}
approximation)
Archontia C. Giannopoulou
,
Daniel Lokshtanov
,
Saket Saurabh
,
Ondrej Suchy
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 85-96
Editing to Eulerian graphs
Konrad K. Dabrowski
,
Petr A. Golovach
,
Pim van 't Hof
,
Daniel Paulusma
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 97-108
Parameterized complexity of fixed variable logics
Christoph Berkholz
,
Michael Elberfeld
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 109-120
Synchronizing words for weighted and timed automata
Laurent Doyen
,
Line Juhl
,
Kim G. Larsen
,
Nicolas Markey
,
Mahsa Shirmohammadi
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 121-132
Finite-valued weighted automata
Emmanuel Filiot
,
Raffaella Gentilini
,
Jean-François Raskin
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 133-145
First-order definable string transformations
Emmanuel Filiot
,
Shankara Narayanan Krishna
,
Ashutosh Trivedi
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 147-159
Regular sensing
Shaull Almagor
,
Denis Kuperberg
,
Orna Kupferman
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 161-173
Symbolic solving of extended regular expression inequalities
Matthias Keil
,
Peter Thiemann
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 175-186
Solving the stable set problem in terms of the odd cycle packing number
Adrian Bock
,
Yuri Faenza
,
Carsten Moldenhauer
,
Andres Jacinto Ruiz-Vargas
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 187-198
Lift & project systems performing on the partial vertex cover polytope
Konstantinos Georgiou
,
Edward Lee
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 199-211
Replica placement on directed acyclic graphs
Sonika Arora
,
Venkatesan T. Chakaravarthy
,
Kanika Gupta
,
Neelima Gupta
,
Yogish Sabharwal
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 213-225
Maintaining approximate maximum matching in an incremental bipartite graph in polylogarithmic update time
Manoj Gupta
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 227-239
The complexity of counting models of linear-time temporal logic
Hazem Torfah
,
Martin Zimmermann
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 241-252
Extending temporal logics with data variable quantifications
Fu Song
,
Zhilin Wu
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 253-265
Generalized data automata and fixpoint logic
Thomas Colcombet
,
Amaldev Manuel
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 267-278
Consistency of injective tree patterns
Claire David
,
Nadime Francis
,
Filip Murlak
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 279-290
Asymptotically optimal encodings for range selection
Gonzalo Navarro
,
Rajeev Raman
,
Srinivasa Rao Satti
Leibniz International Proceedings in Informatics (LIPIcs)
29
, 2014, pp. 291-301
Seiten 1
2
3
4
5
>