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.
Decidability of the interval temporal logic ABB̄ over the natural numbers
Angelo Montanari
,
Gabriele Puppis
,
Pietro Sala
,
Guido Sciavicco
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 597-608
Relaxed spanners for directed disk graphs
David Peleg
,
Liam Roditty
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 609-620
Unsatisfiable linear CNF formulas are large and complex
Dominik Scheder
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 621-632
Construction sequences and certifying 3-connectedness
Jens M. Schmidt
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 633-644
Named models in coalgebraic hybrid logic
Lutz Schröder
,
Dirk Pattinson
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 645-656
A dichotomy theorem for the general minimum cost homomorphism problem
Rustem Takhanov
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 657-668
Alternation-trading proofs, linear programming, and lower bounds
Ryan Williams
Leibniz International Proceedings in Informatics (LIPIcs)
5
, 2010, pp. 669-680
Seiten
<
1
2
3