default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 59
Volume 59, Number 1, January 2011
- Eduardo Sany Laber, Claudson F. Bornstein, Cristina G. Fernandes
:
Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN). 1-2 - Marshall W. Bern, Barry Hayes:
Origami Embedding of Piecewise-Linear Two-Manifolds. 3-15 - Ivan Rapaport, Karol Suchan, Ioan Todinca, Jacques Verstraëte:
On Dissemination Thresholds in Regular and Irregular Graph Classes. 16-34 - Yoshifumi Inui, François Le Gall:
Quantum Property Testing of Group Solvability. 35-47 - Hervé Daudé, Vlady Ravelomanana:
Random 2 XORSAT Phase Transition. 48-65 - Anupam Gupta, Kunal Talwar:
Making Doubling Metrics Geodesic. 66-80 - Brian C. Dean, Adam Griffis, Ojas Parekh, Adam Whitley:
Approximation Algorithms for k-hurdle Problems. 81-93 - Amol Deshpande, Samir Khuller, Azarakhsh Malekian, Mohammed Toossi:
Energy Efficient Monitoring in Sensor Networks. 94-114
Volume 59, Number 2, February 2011
- Micha Streppel, Ke Yi:
Approximate Range Searching in External Memory. 115-128 - Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. 129-144 - Alfredo García Olaverri, Javier Tejel:
Augmenting the Rigidity of a Graph in R2. 145-168 - Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff:
Exact Algorithms for L(2, 1)-Labeling of Graphs. 169-194 - Viet Tung Hoang, Wing-Kin Sung:
Improved Algorithms for Maximum Agreement and Compatible Supertrees. 195-214 - Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy P. Spinrad, Jayme Luiz Szwarcfiter:
Linear-Time Recognition of Helly Circular-Arc Models and Graphs. 215-239 - Lukasz Kowalik, Marcin Mucha:
35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality. 240-255 - Christoph Dürr, Mathilde Hurand:
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs. 256-268 - Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park:
Linear-Time Construction of Two-Dimensional Suffix Trees. 269-297
Volume 59, Number 3, March 2011
- Benjamin Doerr, Thomas Jansen:
Theory of Evolutionary Computation. 299-300 - Martin Dietzfelbinger, Jonathan E. Rowe, Ingo Wegener, Philipp Woelfel:
Precision, Local Search and Unimodal Functions. 301-322 - Frank Neumann, Joachim Reichel, Martin Skutella:
Computing Minimum Cuts by Randomized Search Heuristics. 323-342 - Dirk Sudholt:
Hybridizing Evolutionary Algorithms with Variable-Depth Search to Overcome Local Optima. 343-368 - Pietro S. Oliveto, Carsten Witt:
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation. 369-386 - Hervé Fournier, Olivier Teytaud:
Lower Bounds for Comparison Based Evolution Strategies Using VC-dimension and Sign Patterns. 387-408 - Jens Jägersküpper:
Combining Markov-Chain Analysis and Drift Analysis - The (1+1) Evolutionary Algorithm on Linear Functions Reloaded. 409-424 - Mohamed Jebalia, Anne Auger, Nikolaus Hansen:
Log-Linear Convergence and Divergence of the Scale-Invariant (1+1)-ES in Noisy Environments. 425-460
Volume 59, Number 4, April 2011
- Igor L. Markov, Yaoyun Shi:
Constant-Degree Graph Expansions that Preserve Treewidth. 461-470 - Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail:
New Approximation Algorithms for Minimum Cycle Bases of Graphs. 471-488 - Jochen Könemann, Ojas Parekh, Danny Segev:
A Unified Approach to Approximating Partial Covering Problems. 489-509 - Mingyu Xiao, Leizhen Cai, Andrew Chi-Chih Yao:
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem. 510-520 - Victor Chepoi, Morgan Seston:
Seriation in the Presence of Errors: A Factor 16 Approximation Algorithm for l∞-Fitting Robinson Structures to Distances. 521-568 - Nikhil Bansal, Ho-Leung Chan, Kirk Pruhs:
Competitive Algorithms for Due Date Scheduling. 569-582 - Liam Roditty, Michael Segal:
On Bounded Leg Shortest Paths Problems. 583-600 - Eduardo Sany Laber, Marco Molinaro:
An Approximation Algorithm for Binary Searching in Trees. 601-620 - Asaf Shapira, Raphael Yuster, Uri Zwick:
All-Pairs Bottleneck Paths in Vertex Weighted Graphs. 621-633
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-13 20:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
