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=64
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
Seiten
<
1
2