Day 1 (December 15) - ISAAC 2014

Line-Constrained k-Median, k-Means, and k-Center Problems in the Plane. Haitao Wang and Jingru Zhang

Reconstructing Point Set Order Types from Radial Orderings. Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman and Pavel Valtr

A Randomized Divide and Conquer Algorithm for Higher-Order Abstract Voronoi Diagrams. Cecilia Bohler, Chih-Hung Liu, Evanthia Papadopoulou and Maksym Zavershynskyi

Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay. Andre Droschinsky, Bernhard Heinemann, Nils Kriege and Petra Mutzel

Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph. Kunihiro Wasa, Hiroki Arimura and Takeaki Uno

An Efficient Method for Indexing All Topological Orders of a Directed Graph. Yuma Inoue and Shin-Ichi Minato

Hashing and Indexing: succinct data structures and smoothed analysis Alberto Policriti and Nicola Prezza

Top-k Term-Proximity in Succinct Space. J. Ian Munro, Gonzalo Navarro, Jesper Sindahl Nielsen, Rahul Shah and Sharma V. Thankachan

The Power and Limitations of Static Binary Search Trees with Lazy Finger. Prosenjit Bose, Karim Douieb, John Iacono and Stefan Langerman

Dynamic Interval Scheduling for Multiple Machines. Alexander Gavruskin, Bakhadyr Khoussainov, Mikhail Kokho and Jiamou Liu

Throughput Maximization in Multiprocessor Speed-Scaling. Eric Angel, Evripidis Bampis, Vincent Chau and Kim Thang Nguyen

Speed-scaling with no Preemptions. Evripidis Bampis, Dimitrios Letsios and Giorgio Lucarelli

Day 2 (December 16) - ISAAC 2014

The Price of Order. Prosenjit Bose, Pat Morin and Andre van Renssen

Range Queries on Uncertain Data. Jian Li and Haitao Wang

On the Most Likely Voronoi Diagram and Nearest Neighbor Searching. Subhash Suri and Kevin Verbeek

Polynomial-Time Algorithm for Sliding Tokens on Trees. Erik D. Demaine, Martin Demaine, Eli Fox-Epstein, Duc A. Hoang, Takehiro Ito, Hirotaka Ono, Yota Otachi, Ryuhei Uehara and Takeshi Yamada

Minimal Obstructions for Partial Representations of Interval Graphs. Pavel Klavik and Maria Saumell

Faster Algorithms for Computing the R* Consensus Tree. Jesper Jansson, Wing-Kin Sung, Hoa Vu and Siu-Ming Yiu

Approximating the Maximum Internal Spanning Tree Via a Maximum Path-Cycle Cover. Xingfu Li and Daming Zhu

Approximation Algorithms Inspired by Kernelization Methods. Faisal Abu-Khzam, Cristina Bazgan, Morgan Chopin and Henning Fernau

An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves. Haitao Jiang, Haodi Feng and Daming Zhu

Day 3 (December 17) - ISAAC 2014

Tradeoff between label space and auxiliary space for representation of equivalence classes. Hicham El-Zein, J. Ian Munro and Venkatesh Raman

Depth-First Search Using O(n) bits. Tetsuo Asano, Taisuke Izumi, Masashi Kiyomi, Matsuo Konagaya, Hirotaka Ono, Yota Otachi, Pascal Schweitzer, Jun Tarui and Ryuhei Uehara

Dynamic Path Counting and Reporting in Linear Space. Meng He, J. Ian Munro and Gelin Zhou

Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs. Pavel Kolev and He Sun

Planar Embeddings with Small and Uniform Faces. Giordano Da Lozzo, Vit Jelinek, Jan Kratochvil and Ignaz Rutter

Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties. Nevzat Onur Domanic and C. Gregory Plaxton

Euclidean TSP with few inner points in linear space. Pawel Gawrychowski and Damian Rusak

Bottleneck Partial-Matching Voronoi Diagrams and Applications. Matthias Henze and Rafel Jaume

Ham-Sandwich Cuts for Abstract Order Types. Stefan Felsner and Alexander Pilz