| 2014 | 3D Rectangulations and Geometric Matrix Multiplication. Peter Floderus, Jesper Jansson, Christos Levcopoulos, Andrzej Lingas, Dzmitry Sledneu |
| 2014 | A Geometric Approach to Graph Isomorphism. Pawan Aurora, Shashank K. Mehta |
| 2014 | A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi |
| 2014 | A Short Implicant of a CNF Formula with Many Satisfying Assignments. Daniel M. Kane, Osamu Watanabe |
| 2014 | A Simple Efficient Interior Point Method for Min-Cost Flow. Ruben Becker, Andreas Karrenbauer |
| 2014 | Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings Hee-Kap Ahn, Chan-Su Shin |
| 2014 | An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. Haitao Jiang, Haodi Feng, Daming Zhu |
| 2014 | An Efficient Method for Indexing All Topological Orders of a Directed Graph. Yuma Inoue, Shin-ichi Minato |
| 2014 | An FPTAS for the Volume Computationof 0-1 Knapsack Polytopes Based on Approximate Convolution Integral. Ei Ando, Shuji Kijima |
| 2014 | An Improved Approximation Algorithm for the Minimum Common Integer Partition Problem. Weitian Tong, Guohui Lin |
| 2014 | An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs. Piotr Micek, Veit Wiechert |
| 2014 | Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover. Xingfu Li, Daming Zhu |
| 2014 | Approximation Algorithms Inspired by Kernelization Methods. Faisal N. Abu-Khzam, Cristina Bazgan, Morgan Chopin, Henning Fernau |
| 2014 | Average-Case Complexity of the Min-Sum Matrix Product Problem. Ken C. K. Fong, Minming Li, Hongyu Liang, Linji Yang, Hao Yuan |
| 2014 | Bottleneck Partial-Matching Voronoi Diagrams and Applications. Matthias Henze, Rafel Jaume |
| 2014 | Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization. Norman Huang, Allan Borodin |
| 2014 | Co-Clustering Under the Maximum Norm. Laurent Bulteau, Vincent Froese, Sepp Hartung, Rolf Niedermeier |
| 2014 | Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs. Mingyu Xiao, Hiroshi Nagamochi |
| 2014 | Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift. Per Kristian Lehre, Carsten Witt |
| 2014 | Covering Problems for Partial Words and for Indeterminate Strings. Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2014 | Decremental All-Pairs ALL Shortest Paths and Betweenness Centrality. Meghana Nasre, Matteo Pontecorvi, Vijaya Ramachandran |
| 2014 | Depth-First Search Using O(n) Bits. Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui, Ryuhei Uehara |
| 2014 | Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. Pavel Kolev, He Sun |
| 2014 | Dynamic Interval Scheduling for Multiple Machines. Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho, Jiamou Liu |
| 2014 | Dynamic Path Counting and Reporting in Linear Space. Meng He, J. Ian Munro, Gelin Zhou |
| 2014 | Dynamic and Multi-Functional Labeling Schemes. Søren Dahlgaard, Mathias Bæk Tejs Knudsen, Noy Rotbart |
| 2014 | Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. Kunihiro Wasa, Hiroki Arimura, Takeaki Uno |
| 2014 | Efficiently Correcting Matrix Products. Leszek Gasieniec, Christos Levcopoulos, Andrzej Lingas |
| 2014 | Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. Andre Droschinsky, Bernhard Heinemann, Nils M. Kriege, Petra Mutzel |
| 2014 | Euclidean TSP with Few Inner Points in Linear Space. Pawel Gawrychowski, Damian Rusak |
| 2014 | Faster Algorithms for Computing the R* Consensus Tree. Jesper Jansson, Wing-Kin Sung, Hoa Vu, Siu-Ming Yiu |
| 2014 | Faster Existential FO Model Checking on Posets. Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Sebastian Ordyniak |
| 2014 | Fixed-Parameter Tractability of Token Jumping on Planar Graphs. Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono |
| 2014 | Graph Orientation and Flows over Time. Ashwin Arulselvan, Martin Groß, Martin Skutella |
| 2014 | Ham-Sandwich Cuts for Abstract Order Types. Stefan Felsner, Alexander Pilz |
| 2014 | Hashing and Indexing: Succinct DataStructures and Smoothed Analysis. Alberto Policriti, Nicola Prezza |
| 2014 | Line-Constrained k -Median, k -Means, and k -Center Problems in the Plane. Haitao Wang, Jingru Zhang |
| 2014 | Linear-Time Algorithms for Proportional Apportionment. Zhanpeng Cheng, David Eppstein |
| 2014 | Lower Bounds for On-line Graph Colorings. Grzegorz Gutowski, Jakub Kozik, Piotr Micek, Xuding Zhu |
| 2014 | Minimal Obstructions for Partial Representations of Interval Graphs. Pavel Klavík, Maria Saumell |
| 2014 | Minimum-Cost b -Edge Dominating Sets on Trees. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2014 | On the Computational Complexity of Vertex Integrity and Component Order Connectivity. Pål Grønås Drange, Markus Sortland Dregi, Pim van 't Hof |
| 2014 | On the Most Likely Voronoi Diagramand Nearest Neighbor Searching. Subhash Suri, Kevin Verbeek |
| 2014 | Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries. Meng He, Ganggui Tang, Norbert Zeh |
| 2014 | Planar Embeddings with Small and Uniform Faces. Giordano Da Lozzo, Vít Jelínek, Jan Kratochvíl, Ignaz Rutter |
| 2014 | Planar Matchings for Weighted Straight Skeletons. Therese Biedl, Stefan Huber, Peter Palfrader |
| 2014 | Polynomial-Time Algorithm for Sliding Tokens on Trees. Erik D. Demaine, Martin L. Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara, Takeshi Yamada |
| 2014 | Positive Semidefinite Relaxation and Approximation Algorithm for Triple Patterning Lithography. Tomomi Matsui, Yukihide Kohira, Chikaaki Kodama, Atsushi Takahashi |
| 2014 | Range Queries on Uncertain Data. Jian Li, Haitao Wang |
| 2014 | Rank-Maximal Matchings - Structure and Algorithms. Pratik Ghosal, Meghana Nasre, Prajakta Nimbhorkar |
| 2014 | Reconstructing Point Set Order Typesfrom Radial Orderings. Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr |
| 2014 | Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties. Nevzat Onur Domaniç, C. Gregory Plaxton |
| 2014 | Solving Multi-choice Secretary Problem in Parallel: An Optimal Observation-Selection Protocol. Xiaoming Sun, Jia Zhang, Jialin Zhang |
| 2014 | Speed-Scaling with No Preemptions. Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli |
| 2014 | The Generalized Popular Condensation Problem. Yen-Wei Wu, Wei-Yin Lin, Hung-Lung Wang, Kun-Mao Chao |
| 2014 | The Power and Limitations of Static Binary Search Trees with Lazy Finger. Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman |
| 2014 | The Price of Order. Prosenjit Bose, Pat Morin, André van Renssen |
| 2014 | Throughput Maximization in Multiprocessor Speed-Scaling. Eric Angel, Evripidis Bampis, Vincent Chau, Kim Thang Nguyen |
| 2014 | Top- k Term-Proximity in Succinct Space. J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah, Sharma V. Thankachan |
| 2014 | Tradeoff Between Label Space and Auxiliary Space for Representation of Equivalence Classes. Hicham El-Zein, J. Ian Munro, Venkatesh Raman |
| 2014 | Vertex Cover Reconfiguration and Beyond. Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman |