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=59
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Origami embedding of piecewise-linear two-manifolds
Marshall Bern
,
Barry Hayes
Algorithmica
59
(1), 2011, pp. 3-15
On dissemination thresholds in regular and irregular graph classes
I. Rapaport
,
K. Suchan
,
I. Todinca
,
J. Verstraete
Algorithmica
59
(1), 2011, pp. 16-34
Quantum property testing of group solvability
Yoshifumi Inui
,
François Le Gall
Algorithmica
59
(1), 2011, pp. 35-47
Random 2 XORSAT phase transition
Daudé Hervé
,
Ravelomanana Vlady
Algorithmica
59
(1), 2011, pp. 48-65
Making doubling metrics geodesic
Anupam Gupta
,
Kunal Talwar
Algorithmica
59
(1), 2011, pp. 66-80
Approximation algorithms for
k
-hurdle problems
Brian C. Dean
,
Adam Griffis
,
Ojas Parekh
,
Adam Whitley
Algorithmica
59
(1), 2011, pp. 81-93
Energy efficient monitoring in sensor networks
Amol Deshpande
,
Samir Khuller
,
Azarakhsh Malekian
,
Mohammed Toossi
Algorithmica
59
(1), 2011, pp. 94-114
Approximate range searching in external memory
Micha Streppel
,
Ke Yi
Algorithmica
59
(2), 2011, pp. 115-128
The Stackelberg minimum spanning tree game
Jean Cardinal
,
Erik D. Demaine
,
Samuel Fiorini
,
Gwenaël Joret
,
Stefan Langerman
,
Ilan Newman
,
Oren Weimann
Algorithmica
59
(2), 2011, pp. 129-144
Augmenting the rigidity of a graph in
R^2
A. García
,
J. Tejel
Algorithmica
59
(2), 2011, pp. 145-168
Exact algorithms for
L(2,1)
-labeling of graphs
Frédéric Havet
,
Martin Klazar
,
Jan Kratochvíl
,
Dieter Kratsch
,
Mathieu Liedloff
Algorithmica
59
(2), 2011, pp. 169-194
Improved algorithms for maximum agreement and compatible supertrees
Viet Tung Hoang
,
Wing-Kin Sung
Algorithmica
59
(2), 2011, pp. 195-214
Linear-time recognition of Helly circular-arc models and graphs
Benson L. Joeris
,
Min Chih Lin
,
Ross M. McConnell
,
Jeremy P. Spinrad
,
Jayme L. Szwarcfiter
Algorithmica
59
(2), 2011, pp. 215-239
35/44-approximation for asymmetric maximum TSP with triangle inequality
Lukasz Kowalik
,
Marcin Mucha
Algorithmica
59
(2), 2011, pp. 240-255
Finding total unimodularity in optimization problems solved by linear programs
Christoph Dürr
,
Mathilde Hurand
Algorithmica
59
(2), 2011, pp. 256-268
Linear-time construction of two-dimensional suffix trees
Dong Kyue Kim
,
Joong Chae Na
,
Jeong Seop Sim
,
Kunsoo Park
Algorithmica
59
(2), 2011, pp. 269-297
Theory of evolutionary computation
Benjamin Doerr
,
Thomas Jansen
Algorithmica
59
(3), 2011, pp. 299-300
Precision, local search and unimodal functions
Martin Dietzfelbinger
,
Jonathan E. Rowe
,
Ingo Wegener
,
Philipp Woelfel
Algorithmica
59
(3), 2011, pp. 301-322
Computing minimum cuts by randomized search heuristics
Frank Neumann
,
Joachim Reichel
,
Martin Skutella
Algorithmica
59
(3), 2011, pp. 323-342
Hybridizing evolutionary algorithms with variable-depth search to overcome local optima
Dirk Sudholt
Algorithmica
59
(3), 2011, pp. 343-368
Simplified drift analysis for proving lower bounds in evolutionary computation
Pietro S. Oliveto
,
Carsten Witt
Algorithmica
59
(3), 2011, pp. 369-386
Lower bounds for comparison based evolution strategies using VC-dimension and sign patterns
Hervé Fournier
,
Olivier Teytaud
Algorithmica
59
(3), 2011, pp. 387-408
Combining Markov-chain analysis and drift analysis - The (1+1) evolutionary algorithm on linear functions reloaded
Jens Jägersküpper
Algorithmica
59
(3), 2011, pp. 409-424
Log-linear convergence and divergence of the scale-invariant (1+1)-ES in noisy environments
Mohamed Jebalia
,
Anne Auger
,
Nikolaus Hansen
Algorithmica
59
(3), 2011, pp. 425-460
Constant-degree graph expansions that preserve treewidth
Igor L. Markov
,
Yaoyun Shi
Algorithmica
59
(4), 2011, pp. 461-470
Seiten 1
2
>