| 2014 | Throughput Maximization in Multiprocessor Speed-Scaling. | Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen |
| 2014 | An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. | Ei Ando, Shuji Kijima |
| 2014 | Reconstructing Point Set Order Typesfrom Radial Orderings. | Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr |
| 2014 | Approximation Algorithms Inspired by Kernelization Methods. | Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau |
| 2013 | Exact Algorithms for Maximum Independent Set. | Mingyu Xiao, Hiroshi Nagamochi |
| 2013 | New Results on the Online Pricing Problem. | Xiangzhong Xiang |
| 2013 | Computing Plurality Points and Condorcet Points in Euclidean Space. | Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao |
| 2013 | Minmax Regret 1-Facility Location on Uncertain Path Networks. | Haitao Wang |
| 2013 | The Solvable Cases of a Scheduling Algorithm. | Sam Walker, Yakov Zinder |
| 2013 | Model Counting for Formulas of Bounded Clique-Width. | Friedrich Slivovsky, Stefan Szeider |
| 2013 | Unsatisfiable CNF Formulas contain Many Conflicts. | Dominik Scheder |
| 2013 | Trivial, Tractable, Hard. A Not So Sudden Complexity Jump in Neighborhood Restricted CNF Formulas. | Dominik Scheder |
| 2013 | Determinantal Complexities and Field Extensions. | Youming Qiao, Xiaoming Sun, Nengkun Yu |
| 2013 | Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs. | C. Gregory Plaxton |
| 2013 | Asynchronous Rumor Spreading on Random Graphs. | Konstantinos Panagiotou, Leo Speidel |
| 2013 | Faster Rumor Spreading with Multiple Calls. | Konstantinos Panagiotou, Ali Pourmiri, Thomas Sauerwald |
| 2013 | Isomorphism on Subgraph-Closed Graph Classes: A Complexity Dichotomy and Intermediate Graph Classes. | Yota Otachi, Pascal Schweitzer |
| 2013 | Top-k Document Retrieval in Compact Space and Near-Optimal Time. | Gonzalo Navarro, Sharma V. Thankachan |
| 2013 | Sliding Bloom Filters. | Moni Naor, Eylon Yogev |
| 2013 | Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items. | Kazuo Murota, Akiyoshi Shioura, Zaifu Yang |
| 2013 | Algorithms for Tolerated Tverberg Partitions. | Wolfgang Mulzer, Yannik Stein |
| 2013 | Smoothed Analysis of the 2-Opt Heuristic for the TSP: Polynomial Bounds for Gaussian Noise. | Bodo Manthey, Rianne Veenstra |
| 2013 | Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure. | Angsheng Li, Pan Peng |
| 2013 | An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. | Min Chih Lin, Michel J. Mizrahi, Jayme Luiz Szwarcfiter |
| 2013 | Less Space: Indexing for Queries with Wildcards. | Moshe Lewenstein, J. Ian Munro, Venkatesh Raman, Sharma V. Thankachan |