default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 66
Volume 66, Number 1, May 2013
- Harish Chandran, Nikhil Gopalkrishnan, John H. Reif:
Tile Complexity of Approximate Squares. 1-17 - Surender Baswana, Neelesh Khanna:
Approximate Shortest Paths Avoiding a Failed Vertex: Near Optimal Data Structures for Undirected Unweighted Graphs. 18-50 - Serafino Cicerone
, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Vinicio Maurizio:
Engineering a New Algorithm for Distributed Shortest Paths on Dynamic Networks. 51-86 - Raphael Yuster:
Maximum Matching in Regular and Almost Regular Graphs. 87-92 - Quentin F. Stout:
Isotonic Regression via Partitioning. 93-112 - Christos Koufogiannakis, Neal E. Young:
Greedy Δ-Approximation Algorithm for Covering with Arbitrary Constraints and Submodular Cost. 113-152 - David Doty, Lila Kari, Benoît Masson:
Negative Interactions in Irreversible Self-assembly. 153-172 - Lijun Chang, Jeffrey Xu Yu, Lu Qin:
Fast Maximal Cliques Enumeration in Sparse Graphs. 173-186 - Chien-Chung Huang, Zoya Svitkina:
Donation Center Location Problem. 187-210 - Elias Koutsoupias, Angelina Vidali:
A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. 211-223
Volume 66, Number 2, June 2013
- Adrian Dumitrescu, Minghui Jiang:
On the Largest Empty Axis-Parallel Box Amidst n Points. 225-248 - Alexis C. Kaporis, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas, Christos D. Zaroliagis:
Improved Bounds for Finger Search on a RAM. 249-286 - Martin R. Ehmsen, Jens S. Kohrt, Kim S. Larsen:
List Factoring and Relative Worst Order Analysis. 287-309 - Vladimir Pestov:
Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions. 310-328 - Jesper Jansson, Wing-Kin Sung:
Constructing the R* Consensus Tree of Two Trees in Subcubic Time. 329-345 - Satoru Iwata, Mizuyo Takamatsu:
Computing the Maximum Degree of Minors in Mixed Polynomial Matrices via Combinatorial Relaxation. 346-368 - Ching-Chi Lin, Gen-Huey Chen, Gerard J. Chang:
A Linear-Time Algorithm for Finding Locally Connected Spanning Trees on Circular-Arc Graphs. 369-396 - Markus Bläser, Bodo Manthey, B. V. Raghavendra Rao:
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals. 397-418 - Radu Mihaescu, Cameron Hill, Satish Rao:
Fast Phylogeny Reconstruction Through Learning of Ancestral Sequences. 419-449 - Uriel Feige, Nicole Immorlica, Vahab S. Mirrokni, Hamid Nazerzadeh:
PASS Approximation: A Framework for Analyzing and Designing Heuristics. 450-478
Volume 66, Number 3, July 2013
- Feodor F. Dragan, Yang Xiang:
How to Use Spanning Trees to Navigate in Graphs. 479-511 - Ioannis Caragiannis:
Efficient Coordination Mechanisms for Unrelated Machine Scheduling. 512-540 - Minghui Jiang:
Recognizing d-Interval Graphs and d-Track Interval Graphs. 541-563 - Erik Krohn, Bengt J. Nilsson:
Approximate Guarding of Monotone and Rectilinear Polygons. 564-594 - Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Maarten Löffler, Rodrigo I. Silveira, Carola Wenk, Lionov Wiratma:
Median Trajectories. 595-614 - Avivit Lazar, Arie Tamir:
Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs. 615-640 - Longkun Guo, Hong Shen:
On Finding Min-Min Disjoint Paths. 641-653 - Toru Hasunuma, Toshimasa Ishii, Hirotaka Ono, Yushi Uno:
A Linear Time Algorithm for L(2, 1)-Labeling of Trees. 654-681 - Danny Z. Chen, Haitao Wang:
Approximating Points by a Piecewise Linear Function. 682-713 - Katharina T. Huber, Vincent Moulton:
Encoding and Constructing 1-Nested Phylogenetic Networks with Trinets. 714-738
Volume 66, Number 4, August 2013
- Hsien-Kuei Hwang, Conrado Martínez, Robert Sedgewick:
Guest Editorial. 739-740 - Michael Drmota, Konstantinos Panagiotou:
A Central Limit Theorem for the Number of Degree-k Vertices in Random Maps. 741-761 - Ahmed Helmi, Alois Panholzer:
Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. 762-803 - Hanjo Täubig, Jeremias Weihmann, Sven Kosub, Raymond Hemmecke, Ernst W. Mayr:
Inequalities for the Number of Walks in Graphs. 804-828 - Stephan G. Wagner:
Asymptotic Enumeration of Extensional Acyclic Digraphs. 829-847 - Osamu Watanabe:
Message Passing Algorithms for MLS-3LIN Problem. 848-868
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-03-25 00:07 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:
