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=60
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Better and simpler approximation algorithms for the stable marriage problem
Zoltán Király
Algorithmica
60
(1), 2011, pp. 3-20
An integer programming algorithm for routing optimization in IP networks
Andreas Bley
Algorithmica
60
(1), 2011, pp. 21-45
An almost space-optimal streaming algorithm for coresets in fixed dimensions
Hamid Zarrabi-Zadeh
Algorithmica
60
(1), 2011, pp. 46-59
Time-dependent SHARK-routing
Daniel Delling
Algorithmica
60
(1), 2011, pp. 60-94
Fitting a step function to a point set
Hervé Fournier
,
Antoine Vigneron
Algorithmica
60
(1), 2011, pp. 95-109
Deterministic sampling algorithms for network design
Anke van Zuylen
Algorithmica
60
(1), 2011, pp. 110-151
Coupled path planning, region optimization, and applications in intensity-modulated radiation therapy
Danny Z. Chen
,
Shuang Luan
,
Chao Wang
Algorithmica
60
(1), 2011, pp. 152-174
Common intervals of multiple permutations
Steffen Heber
,
Richard Mayr
,
Jens Stoye
Algorithmica
60
(2), 2011, pp. 175-206
Constructing the simplest possible phylogenetic network from triplets
Leo van Iersel
,
Steven Kelk
Algorithmica
60
(2), 2011, pp. 207-235
Location-oblivious distributed unit disk graph coloring
Michel Barbeau
,
Prosenjit Bose
,
Paz Carmi
,
Mathieu Couture
,
Evangelos Kranakis
Algorithmica
60
(2), 2011, pp. 236-249
Out-of-order event processing in kinetic data structures
Mohammad Ali Abam
,
Pankaj K. Agarwal
,
Mark de Berg
,
Hai Yu
Algorithmica
60
(2), 2011, pp. 250-273
Capacitated domination problem
Mong-Jen Kao
,
Chung-Shou Liao
,
D.T. Lee
Algorithmica
60
(2), 2011, pp. 274-300
An online algorithm for a problem in scheduling with set-ups and release times
Srikrishnan Divakaran
,
Michael Saks
Algorithmica
60
(2), 2011, pp. 301-315
Exact algorithms for cluster editing: Evaluation and experiments
Sebastian Böcker
,
Sebastian Briesemeister
,
Gunnar W. Klau
Algorithmica
60
(2), 2011, pp. 316-334
Approximate pattern matching with the
L_{1}, L_{2}
and
L_{\infty}
metrics
Ohad Lipsky
,
Ely Porat
Algorithmica
60
(2), 2011, pp. 335-348
Peeling meshed potatoes
Boris Aronov
,
Marc van Kreveld
,
Maarten Löffler
,
Rodrigo I. Silveira
Algorithmica
60
(2), 2011, pp. 349-367
Selfish bin packing
Leah Epstein
,
Elena Kleiman
Algorithmica
60
(2), 2011, pp. 368-394
Approximability of packing disjoint cycles
Zachary Friggstad
,
Mohammad R. Salavatipour
Algorithmica
60
(2), 2011, pp. 395-400
Testing periodicity
Oded Lachish
,
Ilan Newman
Algorithmica
60
(2), 2011, pp. 401-420
Shape rectangularization problems in intensity-modulated radiation therapy
Nikhil Bansal
,
Danny Z. Chen
,
Don Coppersmith
,
Xiaobo S. Hu
,
Shuang Luan
,
Ewa Misioƚek
,
Baruch Schieber
,
Chao Wang
Algorithmica
60
(2), 2011, pp. 421-450
Improved approximations for guarding 1.5-dimensional terrains
Khaled Elbassioni
,
Erik Krohn
,
Domagoj Matijević
,
Julián Mestre
,
Domagoj S̑everdija
Algorithmica
60
(2), 2011, pp. 451-463
On centralized smooth scheduling
Ami Litman
,
Shiri Moran-Schein
Algorithmica
60
(2), 2011, pp. 464-480
Crossing number and weighted crossing number of near-planar graphs
Sergio Cabello
,
Bojan Mohar
Algorithmica
60
(3), 2011, pp. 484-504
Efficient authenticated data structures for graph connectivity and geometric search problems
Michael T. Goodrich
,
Roberto Tamassia
,
Nikos Triandopoulos
Algorithmica
60
(3), 2011, pp. 505-552
Injective colorings of graphs with low average degree
Daniel W. Cranston
,
Seog-Jin Kim
,
Gexin Yu
Algorithmica
60
(3), 2011, pp. 553-568
Seiten 1
2
>