| 2013 | A Probabilistic Analysis of Kademlia Networks. Xing Shi Cai, Luc Devroye |
| 2013 | Abstract Voronoi Diagrams with Disconnected Regions. Cecilia Bohler, Rolf Klein |
| 2013 | Algorithms and Computation - 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings Leizhen Cai, Siu-Wing Cheng, Tak Wah Lam |
| 2013 | Algorithms for Tolerated Tverberg Partitions. Wolfgang Mulzer, Yannik Stein |
| 2013 | Algorithms to Measure Diversity and Clustering in Social Networks through Dot Product Graphs. Matthew Johnson, Daniël Paulusma, Erik Jan van Leeuwen |
| 2013 | An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter |
| 2013 | Approximate Čech Complex in Low and High Dimensions. Michael Kerber, R. Sharathkumar |
| 2013 | Approximating the Generalized Minimum Manhattan Network Problem. Aparna Das, Krzysztof Fleszar, Stephen G. Kobourov, Joachim Spoerhase, Sankar Veeramoni, Alexander Wolff |
| 2013 | Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. Søren Kristoffer Stiil Frederiksen, Peter Bro Miltersen |
| 2013 | Asynchronous Rumor Spreading on Random Graphs. Konstantinos Panagiotou, Leo Speidel |
| 2013 | Augmenting Graphs to Minimize the Diameter. Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson |
| 2013 | Beating $\mathcal{O}(nm)$ in Approximate LZW-Compressed Pattern Matching. Pawel Gawrychowski, Damian Straszak |
| 2013 | Better Bounds for Online k-Frame Throughput Maximization in Network Switches. Jun Kawahara, Koji M. Kobayashi, Shuichi Miyazaki |
| 2013 | Bounded Representations of Interval and Proper Interval Graphs. Martin Balko, Pavel Klavík, Yota Otachi |
| 2013 | Computing Minimum Tile Sets to Self-Assemble Color Patterns. Aleck C. Johnsen, Ming-Yang Kao, Shinnosuke Seki |
| 2013 | Computing Plurality Points and Condorcet Points in Euclidean Space. Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao |
| 2013 | Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. Kazuo Murota, Akiyoshi Shioura, Zaifu Yang |
| 2013 | Computing the Smallest Color-Spanning Axis-Parallel Square. Payam Khanteimouri, Ali Mohades, Mohammad Ali Abam, Mohammad Reza Kazemi |
| 2013 | Cops and Robbers on Intersection Graphs. Tomas Gavenciak, Vít Jelínek, Pavel Klavík, Jan Kratochvíl |
| 2013 | Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. Angsheng Li, Pan Peng |
| 2013 | Detecting and Counting Small Pattern Graphs. Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell |
| 2013 | Determinantal Complexities and Field Extensions. Youming Qiao, Xiaoming Sun, Nengkun Yu |
| 2013 | Dynamic Point Labeling is Strongly PSPACE-Complete. Kevin Buchin, Dirk H. P. Gerrits |
| 2013 | Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. Jiehua Chen, Christian Komusiewicz, Rolf Niedermeier, Manuel Sorge, Ondrej Suchý, Mathias Weller |
| 2013 | Euclidean Traveling Salesman Tours through Stochastic Neighborhoods. Pegah Kamousi, Subhash Suri |
| 2013 | Exact Algorithms for Maximum Independent Set. Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | Exact Sublinear Binomial Sampling. Martin Farach-Colton, Meng-Tsung Tsai |
| 2013 | Faster Rumor Spreading with Multiple Calls. Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald |
| 2013 | Faster, Space-Efficient Selection Algorithms in Read-Only Memory for Integers. Timothy M. Chan, J. Ian Munro, Venkatesh Raman |
| 2013 | Geodesic-Preserving Polygon Simplification. Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Birgit Vogtenhuber |
| 2013 | Hardness and Algorithms for Variants of Line Graphs of Directed Graphs. Mourad Baïou, Laurent Beaudou, Zhentao Li, Vincent Limouzy |
| 2013 | Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. Yota Otachi, Pascal Schweitzer |
| 2013 | Less Space: Indexing for Queries with Wildcards. Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan |
| 2013 | Market Approach to Social Ads: The MyLikes Example and Related Problems. Darja Krushevskaja, S. Muthukrishnan |
| 2013 | Minmax Regret 1-Facility Location on Uncertain Path Networks. Haitao Wang |
| 2013 | Model Counting for Formulas of Bounded Clique-Width. Friedrich Slivovsky, Stefan Szeider |
| 2013 | Myhill-Nerode Methods for Hypergraphs. René van Bevern, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond |
| 2013 | New Inapproximability Bounds for TSP. Marek Karpinski, Michael Lampis, Richard Schmied |
| 2013 | New Results on the Online Pricing Problem. Xiangzhong Xiang |
| 2013 | On Determining Deep Holes of Generalized Reed-Solomon Codes. Qi Cheng, Jiyou Li, Jincheng Zhuang |
| 2013 | On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa |
| 2013 | On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine, Takeaki Uno |
| 2013 | On the Number of Edges of Fan-Crossing Free Graphs. Otfried Cheong, Sariel Har-Peled, Heuna Kim, Hyo-Sil Kim |
| 2013 | Pattern Matching with Non Overlapping Reversals - Approximation and On-line Algorithms. Amihood Amir, Benny Porat |
| 2013 | Performance Guarantees for Scheduling Algorithms under Perturbed Machine Speeds. Michael Etscheid |
| 2013 | Pursuit Evasion on Polyhedral Surfaces. Kyle Klein, Subhash Suri |
| 2013 | RAM-Efficient External Memory Sorting. Lars Arge, Mikkel Thorup |
| 2013 | SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs. Patrizio Angelini, William S. Evans, Fabrizio Frati, Joachim Gudmundsson |
| 2013 | Single and Multiple Consecutive Permutation Motif Search. Djamal Belazzougui, Adeline Pierrot, Mathieu Raffinot, Stéphane Vialette |
| 2013 | Sliding Bloom Filters. Moni Naor, Eylon Yogev |
| 2013 | Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise. Bodo Manthey, Rianne Veenstra |
| 2013 | Space-Efficient and Data-Sensitive Polygon Reconstruction Algorithms from Visibility Angle Information. Jinhee Chun, Ricardo Garcia de Gonzalo, Takeshi Tokuyama |
| 2013 | Structure and Computation of Straight Skeletons in 3-Space. Franz Aurenhammer, Gernot Walzl |
| 2013 | Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs. Marc Lelarge, Hang Zhou |
| 2013 | Succinct Data Structures for Representing Equivalence Classes. Moshe Lewenstein, J. Ian Munro, Venkatesh Raman |
| 2013 | Terrain Visibility with Multiple Viewpoints. Ferran Hurtado, Maarten Löffler, Inês Matos, Vera Sacristán, Maria Saumell, Rodrigo I. Silveira, Frank Staals |
| 2013 | Testing Mutual Duality of Planar Graphs. Patrizio Angelini, Thomas Bläsius, Ignaz Rutter |
| 2013 | The Complexity of Finding a Large Subgraph under Anonymity Constraints. Robert Bredereck, Sepp Hartung, André Nichterlein, Gerhard J. Woeginger |
| 2013 | The Distance 4-Sector of Two Points Is Unique. Robert Fraser, Meng He, Akitoshi Kawamura, Alejandro López-Ortiz, J. Ian Munro, Patrick K. Nicholson |
| 2013 | The Number of Different Unfoldings of Polyhedra. Takashi Horiyama, Wataru Shoji |
| 2013 | The Solvable Cases of a Scheduling Algorithm. Sam Walker, Yakov Zinder |
| 2013 | The Train Delivery Problem Revisited. Jing Chen, He Guo, Xin Han, Kazuo Iwama |
| 2013 | Tight Approximation Bounds for Connectivity with a Color-Spanning Set. Chenglin Fan, Jun Luo, Binhai Zhu |
| 2013 | Top-k Document Retrieval in Compact Space and Near-Optimal Time. Gonzalo Navarro, Sharma V. Thankachan |
| 2013 | Trajectory-Based Dynamic Map Labeling. Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg |
| 2013 | Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. Dominik Scheder |
| 2013 | Unit Cost Buyback Problem. Yasushi Kawase, Xin Han, Kazuhisa Makino |
| 2013 | Unsatisfiable CNF Formulas contain Many Conflicts. Dominik Scheder |
| 2013 | Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs. C. Gregory Plaxton |