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: Journal=Algorithmica AND Volume=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast evaluation of interlace polynomials on graphs of bounded treewidth
Markus Bläser
,
Christian Hoffmann
Algorithmica
61
(1), 2011, pp. 3-35
A fast output-sensitive algorithm for Boolean matrix multiplication
Andrzej Lingas
Algorithmica
61
(1), 2011, pp. 36-50
On optimally partitioning a text to improve its compression
Paolo Ferragina
,
Igor Nitto
,
Rossano Venturini
Algorithmica
61
(1), 2011, pp. 51-74
Approximability of sparse integer programs
David Pritchard
,
Deeparnab Chakrabarty
Algorithmica
61
(1), 2011, pp. 75-93
Piercing translates and homothets of a convex body
Adrian Dumitrescu
,
Minghui Jiang
Algorithmica
61
(1), 2011, pp. 94-115
On the performance of approximate equilibria in congestion games
George Christodoulou
,
Elias Koutsoupias
,
Paul G. Spirakis
Algorithmica
61
(1), 2011, pp. 116-140
k
-outerplanar graphs, planar duality, and low stretch spanning trees
Yuval Emek
Algorithmica
61
(1), 2011, pp. 141-160
Dynamic vs. oblivious routing in network design
Navin Goyal
,
Neil Olver
,
F. Bruce Shepherd
Algorithmica
61
(1), 2011, pp. 161-173
Maximum flow in directed planar graphs with vertex capacities
Haim Kaplan
,
Yahav Nussbaum
Algorithmica
61
(1), 2011, pp. 174-189
Improved approximation algorithms for label cover problems
Moses Charikar
,
MohammadTaghi Hajiaghayi
,
Howard Karloff
Algorithmica
61
(1), 2011, pp. 190-206
Geometric spanners for weighted point sets
Mohammad Ali Abam
,
Mark de Berg
,
Mohammad Farshi
,
Joachim Gudmundsson
,
Michiel Smid
Algorithmica
61
(1), 2011, pp. 207-225
Reoptimization of the shortest common superstring problem
Davide Bilò
,
Hans-Joachim Böckenhauer
,
Dennis Komm
,
Richard Královic̑
,
Tobias Mömke
,
Sebastian Seibert
,
Anna Zych
Algorithmica
61
(2), 2011, pp. 227-251
Branch and recharge: Exact algorithms for generalized domination
Fedor V. Fomin
,
Petr A. Golovach
,
Jan Kratochvíl
,
Dieter Kratsch
,
Mathieu Liedloff
Algorithmica
61
(2), 2011, pp. 252-273
Graphical congestion games
Vittorio Bilò
,
Angelo Fanelli
,
Michele Flammini
,
Luca Moscardelli
Algorithmica
61
(2), 2011, pp. 274-297
Energy-efficient paths in radio networks
Rene Beier
,
Stefan Funke
,
Domagoj Matijević
,
Peter Sanders
Algorithmica
61
(2), 2011, pp. 298-319
The longest path problem has a polynomial solution on interval graphs
Kyriaki Ioannidou
,
George B. Mertzios
,
Stavros D. Nikolopoulos
Algorithmica
61
(2), 2011, pp. 320-341
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
Quadratic kernelization for convex recoloring of trees
Hans L. Bodlaender
,
Michael R. Fellows
,
Michael A. Langston
,
Mark A. Ragan
,
Frances A. Rosamond
,
Mark Weyer
Algorithmica
61
(2), 2011, pp. 362-388
On dynamic shortest paths problems
Liam Roditty
,
Uri Zwick
Algorithmica
61
(2), 2011, pp. 389-401
A quadratic algorithm for finding next-to-shortest paths in graphs
Kuo-Hua Kao
,
Jou-Ming Chang
,
Yue-Li Wang
,
Justie Su-Tzu Juan
Algorithmica
61
(2), 2011, pp. 402-418
Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
Thomas Moscibroda
,
Stefan Schmid
,
Roger Wattenhofer
Algorithmica
61
(2), 2011, pp. 419-446
On incentive compatible competitive selection protocols
Xi Chen
,
Xiaotie Deng
,
Becky Jie Liu
Algorithmica
61
(2), 2011, pp. 447-462
The cost of cache-oblivious searching
Michael A. Bender
,
Gerth Stlting Brodal
,
Rolf Fagerberg
,
Dongdong Ge
,
Simai He
,
Haodong Hu
,
John Iacono
,
Alejandro López-Ortiz
Algorithmica
61
(2), 2011, pp. 463-505
Nonclairvoyant speed scaling for flow and energy
Ho-Leung Chan
,
Jeff Edmonds
,
Tak-Wah Lam
,
Lap-Kei Lee
,
Alberto Marchetti-Spaccamela
,
Kirk Pruhs
Algorithmica
61
(3), 2011, pp. 507-517
Sleeping on the job: Energy-efficient and robust broadcast for radio networks
Valerie King
,
Cynthia Phillips
,
Jared Saia
,
Maxwell Young
Algorithmica
61
(3), 2011, pp. 518-554
Seiten 1
2
>