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
[1]
Hilfe
Suche: Author="Karrenbauer, Andreas"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A simple efficient interior point method for min-cost flow
Ruben Becker
,
Andreas Karrenbauer
Lecture Notes in Computer Science
8889
, 2014, pp. 753-765
Nearly tight approximability results for minimum biclique cover and partition
Parinya Chalermsook
,
Sandy Heydrich
,
Eugenia Holm
,
Andreas Karrenbauer
Lecture Notes in Computer Science
8737
, 2014, pp. 235-246
Physarum can compute shortest paths: Convergence proofs and complexity bounds
Luca Becchetti
,
Vincenzo Bonifaci
,
Michael Dirnberger
,
Andreas Karrenbauer
,
Kurt Mehlhorn
Lecture Notes in Computer Science
7966
, 2013, pp. 472-483
Accelerated bend minimization
Sabine Cornelsen
,
Andreas Karrenbauer
Lecture Notes in Computer Science
7034
, 2012, pp. 111-122
Approximation algorithms for the interval constrained coloring problem
Ernst Althaus
,
Stefan Canzar
,
Khaled Elbassioni
,
Andreas Karrenbauer
,
Julián Mestre
Algorithmica
61
(2), 2011, pp. 342-361
The interval constrained 3-coloring problem
Jaroslaw Byrka
,
Andreas Karrenbauer
,
Laura Sanità
Lecture Notes in Computer Science
6034
, 2010, pp. 591-602
Multiline addressing by network flow
Friedrich Eisenbrand
,
Andreas Karrenbauer
,
Martin Skutella
,
Chihao Xu
Algorithmica
53
(4), 2009, pp. 583-596
An average-case analysis for rate-monotonic multiprocessor real-time scheduling
Andreas Karrenbauer
,
Thomas Rothvoß
Lecture Notes in Computer Science
5757
, 2009, pp. 432-443
Approximating the interval constrained coloring problem
Ernst Althaus
,
Stefan Canzar
,
Khaled Elbassioni
,
Andreas Karrenbauer
,
Julián Mestre
Lecture Notes in Computer Science
5124
, 2008, pp. 210-221
Multiline addressing by network flow
Friedrich Eisenbrand
,
Andreas Karrenbauer
,
Martin Skutella
,
Chihao Xu
Lecture Notes in Computer Science
4168
, 2006, pp. 744-755