| 2014 | Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol. | Xiaoming Sun, Jia Zhang, Jialin Zhang |
| 2014 | Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. | Alberto Policriti, Nicola Prezza |
| 2014 | Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. | Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran |
| 2014 | Top- k Term-Proximity in Succinct Space. | J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan |
| 2014 | Vertex Cover Reconfiguration and Beyond. | Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman |
| 2014 | An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. | Piotr Micek, Veit Wiechert |
| 2014 | Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography. | Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi |
| 2014 | Planar Embeddings with Small and Uniform Faces. | Giordano Da Lozzo, Vt Jelnek, Jan Kratochvl, Ignaz Rutter |
| 2014 | Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover. | Xingfu Li, Daming Zhu |
| 2014 | Range Queries on Uncertain Data. | Jian Li, Haitao Wang |
| 2014 | Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. | Per Kristian Lehre, Carsten Witt |
| 2014 | Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. | Pavel Kolev, He Sun |
| 2014 | Minimal Obstructions for Partial Representations of Interval Graphs. | Pavel Klavk, Maria Saumell |
| 2014 | A Short Implicant of a CNF Formula with Many Satisfying Assignments. | Daniel M. Kane, Osamu Watanabe |
| 2014 | An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. | Haitao Jiang, Haodi Feng, Daming Zhu |
| 2014 | Faster Algorithms for Computing the R* Consensus Tree. | Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu |
| 2014 | Fixed-Parameter Tractability of Token Jumping on Planar Graphs. | Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono |
| 2014 | Minimum-Cost b -Edge Dominating Sets on Trees. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2014 | An Efficient Method for Indexing All Topological Orders of a Directed Graph. | Yuma Inoue, Shin-ichi Minato |
| 2014 | Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization. | Norman Huang, Allan Borodin |
| 2014 | Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. | Meng He, Ganggui Tang, Norbert Zeh |
| 2014 | Bottleneck Partial-Matching Voronoi Diagrams and Applications. | Matthias Henze, Rafel Jaume |
| 2014 | Dynamic Path Counting and Reporting in Linear Space. | Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | Lower Bounds for On-line Graph Colorings. | Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu |
| 2014 | Rank-Maximal Matchings - Structure and Algorithms. | Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar |