| 2012 | A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks. Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno, Yushi Uno |
| 2012 | A Framework for Succinct Labeled Ordinal Trees over Large Alphabets. Meng He, J. Ian Munro, Gelin Zhou |
| 2012 | A General Method for Improving Insertion-Based Adaptive Sorting. Riku Saikkonen, Eljas Soisalon-Soininen |
| 2012 | A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings. Nanao Kita |
| 2012 | A Space-Efficient Framework for Dynamic Point Location. Meng He, Patrick K. Nicholson, Norbert Zeh |
| 2012 | A Strongly Polynomial Time Algorithm for the Shortest Path Problem on Coherent Planar Periodic Graphs. Norie Fu |
| 2012 | A Time-Efficient Output-Sensitive Quantum Algorithm for Boolean Matrix Multiplication. François Le Gall |
| 2012 | Abstract Flows over Time: A First Step towards Solving Dynamic Packing Problems. Jan-Philipp W. Kappmeier, Jannik Matuschke, Britta Peis |
| 2012 | Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph. Danny Hermelin, Romeo Rizzi, Stéphane Vialette |
| 2012 | Algorithms and Computation - 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings Kun-Mao Chao, Tsan-sheng Hsu, Der-Tsai Lee |
| 2012 | An 8/3 Lower Bound for Online Dynamic Bin Packing. Prudence W. H. Wong, Fencol C. C. Yung, Mihai Burcea |
| 2012 | An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine. Christos Makris, Konstantinos Tsakalidis |
| 2012 | Area Bounds of Rectilinear Polygons Realized by Angle Sequences. Sang Won Bae, Yoshio Okamoto, Chan-Su Shin |
| 2012 | Beyond Homothetic Polygons: Recognition and Maximum Clique. Konstanty Junosza-Szaniawski, Jan Kratochvíl, Martin Pergel, Pawel Rzazewski |
| 2012 | Closing Complexity Gaps for Coloring Problems on H-Free Graphs. Petr A. Golovach, Daniël Paulusma, Jian Song |
| 2012 | Combinatorial Geometry and Approximation Algorithms. Timothy M. Chan |
| 2012 | Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem. Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter, Dorothea Wagner |
| 2012 | Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights. Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song |
| 2012 | Computing k-center over Streaming Data for Small k. Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim, Wanbin Son |
| 2012 | Computing the Longest Common Subsequence of Two Run-Length Encoded Strings. Yoshifumi Sakai |
| 2012 | Constant Unary Constraints and Symmetric Real-Weighted Counting CSPs. Tomoyuki Yamakami |
| 2012 | Counting Partitions of Graphs. Pavol Hell, Miki Hermann, Mayssam Mohammadi Nevisi |
| 2012 | Cubic Augmentation of Planar Graphs. Tanja Hartmann, Jonathan Rollin, Ignaz Rutter |
| 2012 | Degree-Constrained Orientations of Embedded Graphs. Yann Disser, Jannik Matuschke |
| 2012 | Detecting Induced Minors in AT-Free Graphs. Petr A. Golovach, Dieter Kratsch, Daniël Paulusma |
| 2012 | Efficient Computation of Power Indices for Weighted Majority Games. Takeaki Uno |
| 2012 | Efficient Counting of Square Substrings in a Tree. Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen |
| 2012 | Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs. Andreas Brandstädt, Arne Leitert, Dieter Rautenbach |
| 2012 | Extending Partial Representations of Subclasses of Chordal Graphs. Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh |
| 2012 | Fast and Simple Fully-Dynamic Cut Tree Construction. Tanja Hartmann, Dorothea Wagner |
| 2012 | Fence Patrolling by Mobile Agents with Distinct Speeds. Akitoshi Kawamura, Yusuke Kobayashi |
| 2012 | Finger Search in the Implicit Model. Gerth Stølting Brodal, Jesper Sindahl Nielsen, Jakob Truelsen |
| 2012 | Future Directions in Computer Science Research. John E. Hopcroft |
| 2012 | Green Scheduling, Flows and Matchings. Evripidis Bampis, Dimitrios Letsios, Giorgio Lucarelli |
| 2012 | How Many Potatoes Are in a Mesh? Marc J. van Kreveld, Maarten Löffler, János Pach |
| 2012 | Induced Immersions. Rémy Belmonte, Pim van 't Hof, Marcin Kaminski |
| 2012 | Interval Graph Representation with Given Interval and Intersection Lengths. Johannes Köbler, Sebastian Kuhnert, Osamu Watanabe |
| 2012 | Interval Scheduling and Colorful Independent Sets. René van Bevern, Matthias Mnich, Rolf Niedermeier, Mathias Weller |
| 2012 | Isomorphism for Graphs of Bounded Connected-Path-Distance-Width. Yota Otachi |
| 2012 | Kernelization and Parameterized Complexity of Star Editing and Union Editing. Jiong Guo, Yash Raj Shrestha |
| 2012 | Linear Layouts in Submodular Systems. Hiroshi Nagamochi |
| 2012 | More on a Problem of Zarankiewicz. Chinmoy Dutta, Jaikumar Radhakrishnan |
| 2012 | Multi-unit Auctions with Budgets and Non-uniform Valuations. H. F. Ting, Xiangzhong Xiang |
| 2012 | On Almost Disjunct Matrices for Group Testing. Arya Mazumdar |
| 2012 | On Higher Order Voronoi Diagrams of Line Segments. Evanthia Papadopoulou, Maksym Zavershynskyi |
| 2012 | On the Advice Complexity of Buffer Management. Reza Dorrigiv, Meng He, Norbert Zeh |
| 2012 | On the Complexity of the Maximum Common Subgraph Problem for Partial k-Trees of Bounded Degree. Tatsuya Akutsu, Takeyuki Tamura |
| 2012 | On the Farthest Line-Segment Voronoi Diagram. Evanthia Papadopoulou, Sandeep K. Dey |
| 2012 | On the Hyperbolicity of Small-World and Tree-Like Random Graphs. Wei Chen, Wenjie Fang, Guangda Hu, Michael W. Mahoney |
| 2012 | On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets. Mamadou Moustapha Kanté, Vincent Limouzy, Arnaud Mary, Lhouari Nourine |
| 2012 | On the Number of Upward Planar Orientations of Maximal Planar Graphs. Fabrizio Frati, Joachim Gudmundsson, Emo Welzl |
| 2012 | Optimal Point Movement for Covering Circular Regions. Danny Z. Chen, Xuehou Tan, Haitao Wang, Gangshan Wu |
| 2012 | Origami Robots and Star Trek Replicators. Erik D. Demaine |
| 2012 | Parameterized Clique on Scale-Free Networks. Tobias Friedrich, Anton Krohmer |
| 2012 | Popular and Clan-Popular b-Matchings. Katarzyna E. Paluch |
| 2012 | Precision vs Confidence Tradeoffs for ℓ2-Based Frequency Estimation in Data Streams. Sumit Ganguly |
| 2012 | Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors. Ching-Chen Kuo, Hsueh-I Lu |
| 2012 | Reconfiguration of List L(2, 1)-Labelings in a Graph. Takehiro Ito, Kazuto Kawamura, Hirotaka Ono, Xiao Zhou |
| 2012 | Rectilinear Covering for Imprecise Input Points - (Extended Abstract). Hee-Kap Ahn, Sang Won Bae, Shin-ichi Tanigawa |
| 2012 | Revenue Maximization in a Bayesian Double Auction Market. Xiaotie Deng, Paul W. Goldberg, Bo Tang, Jinshan Zhang |
| 2012 | Robust Nonparametric Data Approximation of Point Sets via Data Reduction. Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala |
| 2012 | Segmental Mapping and Distance for Rooted Labeled Ordered Trees. Tomohiro Kan, Shoichi Higuchi, Kouichi Hirata |
| 2012 | Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting. Tsvi Kopelowitz, Nimrod Talmon |
| 2012 | Solving Circular Integral Block Decomposition in Polynomial Time. Yunlong Liu, Xiaodong Wu |
| 2012 | Speeding Up Shortest Path Algorithms. Andrej Brodnik, Marko Grgurovic |
| 2012 | Strong Conflict-Free Coloring for Intervals. Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno, Shakhar Smorodinsky |
| 2012 | The Canadian Traveller Problem Revisited. Yamming Huang, Chung-Shou Liao |
| 2012 | The Minimum Vulnerability Problem. Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod, Hamid Zarrabi-Zadeh |
| 2012 | The Multi-Service Center Problem. Hung-I Yu, Cheng-Chung Li |
| 2012 | Universal Point Subsets for Planar Graphs. Patrizio Angelini, Carla Binucci, William S. Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer, Yoshio Okamoto |
| 2012 | Vehicle Scheduling on a Graph Revisited. Wei Yu, Mordecai J. Golin, Guochuan Zhang |
| 2012 | Weak Visibility Queries of Line Segments in Simple Polygons. Danny Z. Chen, Haitao Wang |