ISAAC 2012 Accepted Papers (in the order of their submissions)

Jakob Truelsen, Jesper Sindahl Nielsen and Gerth Stølting Brodal. Finger Search in the Implicit Model
Hiroshi Nagamochi. Linear Layouts in Submodular Systems
Yoshifumi Sakai. Computing the longest common subsequence of two run-length encoded strings
Takeaki Uno. Efficient Computation of Power Indices for Weighted Majority Games
Ching-Chen Kuo and Hsueh-I Lu. Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
Francois Le Gall. A Time-Efficient Output-Sensitive Quantum Algorithm for  Boolean Matrix Multiplication
Wei Chen, Weijie Fang, Guangda Hu and Michael W. Mahoney. On the Hyperbolicity of Small-World and Tree-Like Random Graphs
Akitoshi Kawamura and Yusuke Kobayashi. Fence patrolling by mobile agents with distinct speeds
Tobias Friedrich and Anton Krohmer. Parameterized Clique on Scale-Free Networks
Hee-Kap Ahn, Hyo-Sil Kim, Sang-Sub Kim and Wanbin Son. Computing 2, 3-centers over Streaming Data
Danny Z. Chen and Haitao Wang. Weak Visibility Queries of Line Segments in Simple Polygons
Johannes Koebler, Sebastian Kuhnert and Osamu Watanabe. Interval graph representation with given interval and intersection lengths
Tatsuya Akutsu and Takeyuki Tamura. On the Complexity of the Maximum Common Subgraph Problem for Partial $k$-Trees of Bounded Degree
Sumit Ganguly. Precision vs Confidence Tradeoffs for l2-Based Frequency Estimation in Data Streams
Meng He, J. Ian Munro and Gelin Zhou. A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
Christos Makris and Konstantinos Tsakalidis. An Improved Algorithm for Static 3D Dominance Reporting in the Pointer Machine
Andreas Brandstädt, Arne Leitert and Dieter Rautenbach. Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
Hung-I Yu and Cheng-Chung Li. The Multi-Service Center Problem
Tomasz Kociumaka, Jakub Pachocki, Jakub Radoszewski, Wojciech Rytter and Tomasz Walen. Efficient Counting of Square Substrings in a Tree
Sang Won Bae, Yoshio Okamoto and Chan-Su Shin. Area bounds of rectilinear polygons realized by angle sequences
Danny Z. Chen, Xuehou Tan, Haitao Wang and Gangshan Wu. Optimal Point Movement for Covering Circular Regions
Nanao Kita. A Partially Ordered Structure and a Generalization of the Canonical Partition for General Graphs with Perfect Matchings
Yamming Huang and Chung-Shou Liao. The Canadian Traveller Problem Revisited
Tomohiro Kan, Shoichi Higuchi and Kouichi Hirata. Segmental Mapping and Distance for Rooted Labeled Ordered Trees
Tanja Hartmann, Jonathan Rollin and Ignaz Rutter. Cubic Augmentation of Planar Graphs
Nimrod Talmon and Tsvi Kopelowitz. Selection in the Presence of Memory Faults, with Applications to In-place Resilient Sorting
Takehiro Ito, Kazuto Kawamura, Hirotaka Ono and Xiao Zhou. Reconfiguration of List $L(2,1)$-Labelings in a Graph
Marc Van Kreveld, Maarten Löffler and Janos Pach. How Many Potatoes are in a Mesh?
Norie Fu. A strongly polynomial time algorithm for the shortest path problem on coherent planar periodic graphs
Ting H.F. and Xiang Xiangzhong. Multi-Unit Auctions with Budgets and Non-uniform Valuations
Xiaotie Deng, Paul Goldberg, Bo Tang and Jinshan Zhang. Revenue Maximization in a Bayesian Double Auction Market
Petr Golovach, Dieter Kratsch and Daniel Paulusma. Detecting Induced Minors in AT-free Graphs
Danny Hermelin, Romeo Rizzi and Stéphane Vialette. Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph
Jiong Guo and Yash Raj Shrestha. Kernelization and Parameterized Complexity of Star Editing and Union Editing
Rémy Belmonte, Pim van 'T Hof and Marcin Kaminski. Induced Immersions
Patrizio Angelini, Carla Binucci, William Evans, Ferran Hurtado, Giuseppe Liotta, Tamara Mchedlidze, Henk Meijer and Yoshio Okamoto. Universal Point Subsets for Planar Graphs
Petr Golovach, Daniel Paulusma and Jian Song. Closing Complexity Gaps for Coloring Problems on H-Free Graphs
Mamadou Moustapha Kante, Vincent Limouzy, Arnaud Mary and Lhouari Nourine. On the Neighbourhood Helly of some Graph Classes and   Applications to the Enumeration of Minimal Dominating Sets
Evanthia Papadopoulou and Maksym Zavershynskyi. On higher order Voronoi diagrams of line segments
Tomoyuki Yamakami. Constant Unary Constraints and   Symmetric Real-Weighted Counting CSPs
René Van Bevern, Matthias Mnich, Rolf Niedermeier and Mathias Weller. Interval Scheduling and Colorful Independent Sets
Evripidis Bampis, Dimitrios Letsios and Giorgio Lucarelli. Green scheduling, flows and matchings
Riku Saikkonen and Eljas Soisalon-Soininen. A General Method for Improving Insertion-Based Adaptive Sorting
Meng He, Patrick K. Nicholson and Norbert Zeh. A Space-Efficient Framework for Dynamic Point Location
Tanja Hartmann and Dorothea Wagner. Fast and Simple Fully-Dynamic Cut Tree Construction
Prudence W.H. Wong, Fencol C.C. Yung and Mihai Burcea. An 8/3 Lower Bound for Online Dynamic Bin Packing
Reza Dorrigiv, Meng He and Norbert Zeh. On the Advice Complexity of Buffer Management
Konstanty Junosza-Szaniawski, Jan Kratochvil, Martin Pergel and Paweł Rzążewski. Beyond homothetic polygons: recognition and maximum clique.
Yann Disser and Jannik Matuschke. Degree-constrained orientations of embedded graphs
Evanthia Papadopoulou and Sandeep Kumar Dey. On the Farthest Line-Segment Voronoi Diagram
Jan-Philipp W. Kappmeier, Jannik Matuschke and Britta Peis. Abstract flows over time: A first step towards solving dynamic packing problems
Stephane Durocher, Alexandre Leblanc, Jason Morrison and Matthew Skala. Robust Nonparametric Data Approximation of Point Sets via Data Reduction
Wei Yu, Mordecai Golin and Guochuan Zhang. Vehicle Scheduling on a Graph Revisited
Pavol Hell, Miki Hermann and Mayssam Mohammadi Nevisi. Counting Partitions of Graphs
Hee-Kap Ahn, Sang Won Bae and Shin-Ichi Tanigawa. Rectilinear Covering for Imprecise Input Points
Mong-Jen Kao, Jian-Jia Chen, Ignaz Rutter and Dorothea Wagner. Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
Yunlong Liu and Xiaodong Wu. Solving Circular Integral Block Decomposition in Polynomial Time
Binay Bhattacharya, Tsunehiko Kameda and Zhao Song. Computing Minmax Regret 1-Median on a Tree Network with Positive/Negative Vertex Weights
Takehiro Ito, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Ryuhei Uehara, Takeaki Uno and Yushi Uno. A 4.31-Approximation for the Geometric Unique Coverage Problem on Unit Disks
Arya Mazumdar. On Almost Disjunct Matrices for Group Testing
Pavel Klavík, Jan Kratochvil, Yota Otachi and Toshiki Saitoh. Extending Partial Representations of Subclasses of Chordal Graphs
Yota Otachi. Isomorphism for Graphs of Bounded Connected-Path-Distance-Width
Andrej Brodnik and Marko Grgurovič. Speeding up shortest path algorithms
Katarzyna Paluch. Popular and Clan-Popular b-Matchings
Fabrizio Frati, Joachim Gudmundsson and Emo Welzl. On the Number of Upward Planar Orientations of Maximal Planar Graphs
Chinmoy Dutta and Jaikumar Radhakrishnan. More on a Problem of Zarankiewicz
Sepehr Assadi, Ehsan Emamjomeh-Zadeh, Ashkan Norouzi-Fard, Sadra Yazdanbod and Hamid Zarrabi-Zadeh. The Minimum Vulnerability Problem
Panagiotis Cheilaris, Luisa Gargano, Adele A. Rescigno and Shakhar Smorodinsky. Strong conflict-free coloring for intervals