- Dániel Marx, Ildikó Schlotter:
Cleaning Interval Graphs. Algorithmica 65(2): 275-316 (2013) - Neeldhara Misra, Hannes Moser, Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
The Parameterized Complexity of Unique Coverage and Its Variants. Algorithmica 65(3): 517-544 (2013) - Jesper Nederlof:
Fast Polynomial-Space Algorithms Using Inclusion-Exclusion. Algorithmica 65(4): 868-884 (2013) - Shoshana Neuburger, Dina Sokol:
Succinct 2D Dictionary Matching. Algorithmica 65(3): 662-684 (2013) - Chaoyi Pang, Qing Zhang, Xiaofang Zhou, David P. Hansen, Sen Wang, Anthony J. Maeder:
Computing Unrestricted Synopses Under Maximum Error Bound. Algorithmica 65(1): 1-42 (2013) - David Peleg, Liam Roditty:
Relaxed Spanners for Directed Disk Graphs. Algorithmica 65(1): 146-158 (2013) - M. Praveen:
Small Vertex Cover makes Petri Net Coverability and Boundedness Easier. Algorithmica 65(4): 713-753 (2013) - Venkatesh Raman, Saket Saurabh:
Guest Editorial: Special Issue on Parameterized and Exact Computation, Part II. Algorithmica 65(4): 711-712 (2013) - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Adam D. Smith:
Sublinear Algorithms for Approximating String Compressibility. Algorithmica 65(3): 685-709 (2013) - Bang Ye Wu:
A Simpler and More Efficient Algorithm for the Next-to-Shortest Path Problem. Algorithmica 65(2): 467-479 (2013) - Ke Yi, Qin Zhang:
Optimal Tracking of Distributed Heavy Hitters and Quantiles. Algorithmica 65(1): 206-223 (2013)