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=63
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Near-linear approximation algorithms for geometric hitting sets
Pankaj K. Agarwal
,
Esther Ezra
,
Micha Sharir
Algorithmica
63
(1-2), 2012, pp. 1-25
Graph decomposition for memoryless periodic exploration
Adrian Kosowski
,
Alfredo Navarra
Algorithmica
63
(1-2), 2012, pp. 26-38
Almost exact matchings
Raphael Yuster
Algorithmica
63
(1-2), 2012, pp. 39-50
Contribution games in networks
Elliot Anshelevich
,
Martin Hoefer
Algorithmica
63
(1-2), 2012, pp. 51-90
On the hitting times of quantum versus random walks
Frédéric Magniez
,
Ashwin Nayak
,
Peter C. Richter
,
Miklos Santha
Algorithmica
63
(1-2), 2012, pp. 91-116
Reducing tile complexity for the self-assembly of scaled shapes through temperature programming
Scott M. Summers
Algorithmica
63
(1-2), 2012, pp. 117-136
Maximum series-parallel subgraph
Gruia Cȃlinescu
,
Cristina G. Fernandes
,
Hemanshu Kaul
,
Alexander Zelikovsky
Algorithmica
63
(1-2), 2012, pp. 137-157
A distributed algorithm for computing the node search number in trees
David Coudert
,
Florian Huc
,
Dorian Mazauric
Algorithmica
63
(1-2), 2012, pp. 158-190
A primal-dual approximation algorithm for the facility location problem with submodular penalties
Donglei Du
,
Ruixing Lu
,
Dachuan Xu
Algorithmica
63
(1-2), 2012, pp. 191-200
Succinct and I/O efficient data structures for traversal in trees
Craig Dillabaugh
,
Meng He
,
Anil Maheshwari
Algorithmica
63
(1-2), 2012, pp. 201-223
Faster algorithms for all-pairs small stretch distances in weighted graphs
Telikepalli Kavitha
Algorithmica
63
(1-2), 2012, pp. 224-245
On equilibria for ADM minimization games
Leah Epstein
,
Asaf Levin
Algorithmica
63
(1-2), 2012, pp. 246-273
Minimize the maximum duty in multi-interface networks
Gianlorenzo D'Angelo
,
Gabriele Di Stefano
,
Alfredo Navarra
Algorithmica
63
(1-2), 2012, pp. 274-295
A competitive analysis for balanced transactional memory workloads
Gokarna Sharma
,
Costas Busch
Algorithmica
63
(1-2), 2012, pp. 296-322
An exact exponential time algorithm for
Power Dominating Set
Daniel Binkele-Raible
,
Henning Fernau
Algorithmica
63
(1-2), 2012, pp. 323-346
Improved approximation algorithms for data migration
Samir Khuller
,
Yoo-Ah Kim
,
Azarakhsh Malekian
Algorithmica
63
(1-2), 2012, pp. 347-362
Interval partitions and polynomial factorization
Joachim von zur Gathen
,
Daniel Panario
,
Bruce Richmond
Algorithmica
63
(1-2), 2012, pp. 363-397
Approximating node-connectivity augmentation problems
Zeev Nutov
Algorithmica
63
(1-2), 2012, pp. 398-410
Improved competitive performance bounds for CIOQ switches
Alex Kesselman
,
Kirill Kogan
,
Michael Segal
Algorithmica
63
(1-2), 2012, pp. 411-424
Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs
A. Aazami
,
J. Cheriyan
,
K.R. Jampani
Algorithmica
63
(1-2), 2012, pp. 425-456
External memory planar point location with logarithmic updates
Lars Arge
,
Gerth Stlting Brodal
,
S. Srinivasa Rao
Algorithmica
63
(1-2), 2012, pp. 457-475
Layered working-set trees
Prosenjit Bose
,
Karim Douïeb
,
Vida Dujmović
,
John Howat
Algorithmica
63
(1-2), 2012, pp. 476-489
Bipartite matching in the semi-streaming model
Sebastian Eggert
,
Lasse Kliemann
,
Peter Munstermann
,
Anand Srivastav
Algorithmica
63
(1-2), 2012, pp. 490-508
Average case analysis of Moore's state minimization algorithm
Frédérique Bassino
,
Julien David
,
Cyril Nicaud
Algorithmica
63
(1-2), 2012, pp. 509-531
Polynomial kernelization for MIN F
^+\Pi_1
and MAX NP
Stefan Kratsch
Algorithmica
63
(1-2), 2012, pp. 532-550
Seiten 1
2
>