| 2013 | A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs. Zdenek Dvorák, Vojtech Tuma |
| 2013 | Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings Frank Dehne, Roberto Solis-Oba, Jörg-Rüdiger Sack |
| 2013 | Approximation Algorithms for B 1-EPG Graphs. Dror Epstein, Martin Charles Golumbic, Gila Morgenstern |
| 2013 | Beacon-Based Algorithms for Geometric Routing. Michael Biro, Justin Iwerks, Irina Kostitsyna, Joseph S. B. Mitchell |
| 2013 | Better Space Bounds for Parameterized Range Majority and Minority. Djamal Belazzougui, Travis Gagie, Gonzalo Navarro |
| 2013 | Blame Trees. Erik D. Demaine, Pavel Panchekha, David A. Wilson, Edward Z. Yang |
| 2013 | Bounding the Running Time of Algorithms for Scheduling and Packing Problems. Klaus Jansen, Felix Land, Kati Land |
| 2013 | Bundling Three Convex Polygons to Minimize Area or Perimeter. Hee-Kap Ahn, Helmut Alt, Sang Won Bae, Dongwoo Park |
| 2013 | Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt |
| 2013 | Combinatorial Pair Testing: Distinguishing Workers from Slackers. David Eppstein, Michael T. Goodrich, Daniel S. Hirschberg |
| 2013 | Compressed Persistent Index for Efficient Rank/Select Queries. Wing-Kai Hon, Lap-Kei Lee, Kunihiko Sadakane, Konstantinos Tsakalidis |
| 2013 | Distance-Sensitive Planar Point Location. Boris Aronov, Mark de Berg, Marcel Roeloffzen, Bettina Speckmann |
| 2013 | Dynamic Planar Point Location with Sub-logarithmic Local Updates. Maarten Löffler, Joseph A. Simons, Darren Strash |
| 2013 | Finding the Minimum-Weight k-Path. Avinatan Hassidim, Orgad Keller, Moshe Lewenstein, Liam Roditty |
| 2013 | Fingerprints in Compressed Strings. Philip Bille, Patrick Hagge Cording, Inge Li Gørtz, Benjamin Sach, Hjalte Wedel Vildhøj, Søren Vind |
| 2013 | Hierarchies of Predominantly Connected Communities. Michael Hamann, Tanja Hartmann, Dorothea Wagner |
| 2013 | Interval Selection with Machine-Dependent Intervals. Katerina Böhmová, Yann Disser, Matús Mihalák, Peter Widmayer |
| 2013 | Joint Cache Partition and Job Assignment on Multi-core Processors. Avinatan Hassidim, Haim Kaplan, Omry Tuval |
| 2013 | Lift-and-Project Methods for Set Cover and Knapsack. Eden Chlamtác, Zachary Friggstad, Konstantinos Georgiou |
| 2013 | MapReduce Algorithmics. Sergei Vassilvitskii |
| 2013 | Neighborhood-Preserving Mapping between Trees. Jan Baumbach, Jiong Guo, Rashid Ibragimov |
| 2013 | On (Dynamic) Range Minimum Queries in External Memory. Lars Arge, Johannes Fischer, Peter Sanders, Nodari Sitchinava |
| 2013 | On Explaining Integer Vectors by Few Homogenous Segments. Robert Bredereck, Jiehua Chen, Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, Ondrej Suchý |
| 2013 | On Maximum Weight Objects Decomposable into Based Rectilinear Convex Objects. Mahmuda Ahmed, Iffat Chowdhury, Matt Gibson, Mohammad Shahedul Islam, Jessica Sherrette |
| 2013 | On the Spanning Ratio of Theta-Graphs. Prosenjit Bose, André van Renssen, Sander Verdonschot |
| 2013 | On the Stretch Factor of the Theta-4 Graph. Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot |
| 2013 | Online Control Message Aggregation in Chain Networks. Marcin Bienkowski, Jaroslaw Byrka, Marek Chrobak, Lukasz Jez, Jirí Sgall, Grzegorz Stachowiak |
| 2013 | Optimal Batch Schedules for Parallel Machines. Frederic Koehler, Samir Khuller |
| 2013 | Optimal Time-Convex Hull under the L p Metrics. Bang-Sin Dai, Mong-Jen Kao, D. T. Lee |
| 2013 | Parameterized Complexity of 1-Planarity. Michael J. Bannister, Sergio Cabello, David Eppstein |
| 2013 | Parameterized Enumeration of (Locally-) Optimal Aggregations. Naomi Nishimura, Narges Simjour |
| 2013 | Planar Packing of Binary Trees. Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth |
| 2013 | Plane 3-trees: Embeddability and Approximation - (Extended Abstract). Stephane Durocher, Debajyoti Mondal |
| 2013 | Relative Interval Analysis of Paging Algorithms on Access Graphs. Joan Boyar, Sushmita Gupta, Kim S. Larsen |
| 2013 | Smart-Grid Electricity Allocation via Strip Packing with Slicing. Soroush Alamdari, Therese Biedl, Timothy M. Chan, Elyot Grant, Krishnam Raju Jampani, Srinivasan Keshav, Anna Lubiw, Vinayak Pathak |
| 2013 | Socially Stable Matchings in the Hospitals/Residents Problem. Georgios Askalidis, Nicole Immorlica, Augustine Kwanashie, David F. Manlove, Emmanouil Pountourakis |
| 2013 | The Art of Shaving Logs. Timothy M. Chan |
| 2013 | The Greedy Gray Code Algorithm. Aaron Williams |
| 2013 | Tight Bounds for Low Dimensional Star Stencils in the External Memory Model. Philipp Hupp, Riko Jacob |
| 2013 | Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems. Tetsuo Asano, David G. Kirkpatrick |
| 2013 | Trajectory Grouping Structure. Kevin Buchin, Maike Buchin, Marc J. van Kreveld, Bettina Speckmann, Frank Staals |
| 2013 | Treewidth and Pathwidth Parameterized by the Vertex Cover Number. Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
| 2013 | Two-Sided Boundary Labeling with Adjacent Sides. Philipp Kindermann, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, André Schulz, Alexander Wolff |
| 2013 | Unions of Onions: Preprocessing Imprecise Points for Fast Onion Layer Decomposition. Maarten Löffler, Wolfgang Mulzer |
| 2013 | Universal Point Sets for Planar Three-Trees. Radoslav Fulek, Csaba D. Tóth |
| 2013 | Visibility and Ray Shooting Queries in Polygonal Domains. Danny Z. Chen, Haitao Wang |
| 2013 | When Is Weighted Satisfiability FPT? Iyad A. Kanj, Ge Xia |