default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM Transactions on Algorithms, Volume 11
Volume 11, Number 1, August 2014
- Yoann Dieudonné, Andrzej Pelc, David Peleg:
Gathering Despite Mischief. 1:1-1:28 - Petra Berenbrink, Martin Hoefer, Thomas Sauerwald:
Distributed Selfish Load Balancing on Networks. 2:1-2:29 - Nikhil Bansal, Ravishankar Krishnaswamy, Viswanath Nagarajan:
Better Scalable Algorithms for Broadcast Scheduling. 3:1-3:24 - Martin Grohe
, Dániel Marx:
Constraint Solving via Fractional Edge Covers. 4:1-4:20 - Piotr Berman, Sofya Raskhodnikova:
Approximation Algorithms for Min-Max Generalization Problems. 5:1-5:23 - Stephen Alstrup, Mikkel Thorup, Inge Li Gørtz, Theis Rauhe, Uri Zwick:
Union-Find with Constant Time Deletions. 6:1-6:28 - Amit Chakrabarti, Graham Cormode, Andrew McGregor, Justin Thaler:
Annotations in Data Streams. 7:1-7:30
Volume 11, Number 2, October 2014
- Joseph Cheriyan, Bundit Laekhanukit, Guyslain Naves, Adrian Vetta:
Approximating Rooted Steiner Networks. 8:1-8:22 - Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald:
Quasirandom Rumor Spreading. 9:1-9:35 - Yoann Dieudonné, Andrzej Pelc:
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports. 10:1-10:29 - Yufei Tao:
Dynamic Ray Stabbing. 11:1-11:19 - Richard Cole, Carmit Hazay, Moshe Lewenstein, Dekel Tsur:
Two-Dimensional Parameterized Matching. 12:1-12:30 - Michael Dom, Daniel Lokshtanov, Saket Saurabh:
Kernelization Lower Bounds Through Colors and IDs. 13:1-13:20 - Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dániel Marx:
Minimizing Movement: Fixed-Parameter Tractability. 14:1-14:29 - Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh:
Faster Parameterized Algorithms Using Linear Programming. 15:1-15:31
Volume 11, Number 3, January 2015
- Glencora Borradaile, Piotr Sankowski, Christian Wulff-Nilsen:
Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time. 16:1-16:29 - Stefanie Gerke, Konstantinos Panagiotou, Justus Schwartz, Angelika Steger:
Maximizing the Minimum Load for Random Processing Times. 17:1-17:19 - Bernadette Charron-Bost, Matthias Függer, Jennifer L. Welch, Josef Widder:
Time Complexity of Link Reversal Routing. 18:1-18:39 - Glencora Borradaile, Philip N. Klein, Claire Mathieu:
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest. 19:1-19:20 - Artur Jez:
Faster Fully Compressed Pattern Matching by Recompression. 20:1-20:43 - Yixin Cao, Dániel Marx:
Interval Deletion Is Fixed-Parameter Tractable. 21:1-21:35 - Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Dual-Pivot Quicksort. 22:1-22:42 - Inge Li Gørtz, Viswanath Nagarajan, R. Ravi:
Minimum Makespan Multi-Vehicle Dial-a-Ride. 23:1-23:29 - Reut Levi, Dana Ron:
A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor. 24:1-24:13
Volume 11, Number 4, June 2015
- Wiebke Höhn, Tobias Jacobs:
On the Performance of Smith's Rule in Single-Machine Scheduling with Nonlinear Cost. 25:1-25:30 - Danny Z. Chen, Haitao Wang:
Computing Shortest Paths among Curved Obstacles in the Plane. 26:1-26:46 - Dániel Marx, László A. Végh:
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation. 27:1-27:24 - Rajesh Hemant Chitnis, Marek Cygan, Mohammad Taghi Hajiaghayi, Dániel Marx:
Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable. 28:1-28:28 - Rinat Ben Avraham, Omrit Filtser, Haim Kaplan, Matthew J. Katz, Micha Sharir:
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection. 29:1-29:29 - Bernhard Haeupler, Siddhartha Sen, Robert Endre Tarjan:
Rank-Balanced Trees. 30:1-30:26 - Djamal Belazzougui, Gonzalo Navarro:
Optimal Lower and Upper Bounds for Representing Sequences. 31:1-31:21 - Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Vít Jelínek, Jan Kratochvíl, Maurizio Patrignani, Ignaz Rutter:
Testing Planarity of Partially Embedded Graphs. 32:1-32:42 - Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
Mapping Simple Polygons: The Power of Telling Convex from Reflex. 33:1-33:16 - Shayan Ehsani, Saber Shokat Fadaee, MohammadAmin Fazli, Abbas Mehrabian, Sina Sadeghian Sadeghabad, Mohammad Ali Safari, Morteza Saghafian:
A Bounded Budget Network Creation Game. 34:1-34:25 - Noa Avigdor-Elgrabli, Yuval Rabani:
An Improved Competitive Algorithm for Reordering Buffer Management. 35:1-35:15
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-08 09:52 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:
