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: Journal=Algorithmica AND YEAR=2012
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Exact algorithms for edge domination
Johan M.M. van Rooij
,
Hans L. Bodlaender
Algorithmica
64
(4), 2012, pp. 535-563
1-local 7/5-competitive algorithm for multicoloring hexagonal graphs
Petra S̑parl
,
Rafaƚ Witkowski
,
Janez Z̑erovnik
Algorithmica
64
(4), 2012, pp. 564-583
Competitive analysis of organization networks or multicast acknowledgment: How much to wait?
Carlos Fisch Brito
,
Elias Koutsoupias
,
Shailesh Vaya
Algorithmica
64
(4), 2012, pp. 584-605
Negative examples for sequential importance sampling of binary contingency tables
Ivona Bezáková
,
Alistair Sinclair
,
Daniel S̑tefankovic̑
,
Eric Vigoda
Algorithmica
64
(4), 2012, pp. 606-620
Theory of randomized search heuristics
Anne Auger
,
Carsten Witt
Algorithmica
64
(4), 2012, pp. 621-622
Black-box search by unbiased variation
Per Kristian Lehre
,
Carsten Witt
Algorithmica
64
(4), 2012, pp. 623-642
A simple Ant Colony Optimizer for stochastic shortest path problems
Dirk Sudholt
,
Christian Thyssen
Algorithmica
64
(4), 2012, pp. 643-672
Multiplicative drift analysis
Benjamin Doerr
,
Daniel Johannsen
,
Carola Winzen
Algorithmica
64
(4), 2012, pp. 673-697
Theoretical foundation for CMA-ES from information geometry perspective
Youhei Akimoto
,
Yuichi Nagata
,
Isao Ono
,
Shigenobu Kobayashi
Algorithmica
64
(4), 2012, pp. 698-716
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
Seiten
<
1
2
3
4
5
6
>