| Invited Talks |
| Regular Labelings and Geometric Structures (Abstract) / David Eppstein |
| Algorithmic Aspects of Secure Computation and Communication (Abstract) / Matt Franklin |
| Approximation Algorithm I / Session 1A： |
| Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / Marek Karpinski ; Warren Schudy |
| A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 / Piotr Berman ; Alexander Zelikovsky |
| Approximate Periodicity / Amihood Amir ; Estrella Eisenberg ; Avivit Levy |
| Approximating the Average Stretch Factor of Geometric Graphs / Siu-Wing Cheng ; Christian Knauer ; Stefan Langerman ; Michiel Smid |
| Complexity I / Session 1B： |
| Satisfiability with Index Dependency / Hongyu Liang ; Jing He |
| Anonymous Fuzzy Identity-Based Encryption for Similarity Search / David W. Cheung ; Nikos Mamoulis ; W.K. Wong ; S.M. Yiu ; Ye Zhang |
| Improved Randomized Algorithms for 3-SAT / Kazuo Iwama ; Kazuhisa Seto ; Tadashi Takai ; Suguru Tamaki |
| Quantum Counterfeit Coin Problems / Harumichi Nishimura ; Rudy Raymond ; Junichi Teruyama |
| Data Structure and Algorithm I / Session 2A： |
| Priority Range Trees / Michael T. Goodrich ; Darren Strash |
| Should Static Search Trees Ever Be Unbalanced? / Prosenjit Bose ; Karim Douïeb |
| Levelwise Mesh Sparsification for Shortest Path Quaries / Yuichiro Miyamoto ; Takeaki Uno ; Mikio Kubo |
| Unit-Time Predecessor Queries on Massive Data Sets / Andrej Brodnik ; John Iacono |
| Combinatorial Optimization / Session 2B： |
| Popularity at Minimum Cost / Telikepalli Kavitha ; Meghana Nasre ; Prajakta Nimbhorkar |
| Structural and (Complexity Aspects of Line Systems of Graphs / Jozef Jirásek ; Pavel KlavÃk |
| Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra / Akiyoshi Shioura |
| Generating Trees on Multisets / Bingbing Zhuang ; Hiroshi Nagamochi |
| Graph Algorithm I / Session 3A： |
| Seidel Minor, Permutation Graphs and Combinatorial Properties / Vincent Limouzy |
| Simultaneous Interval Graphs / Krishnam Raju Jampani ; Anna Lubiw |
| Unbalanced Graph Partitioning / Angsheng Li ; Peng Zhang |
| On the Intersection of Tolerance and Cocomparability Graphs / George B. Mertzios ; Shmuel Zaks |
| Flows in One-Crossing-Minor-Free Graphs / Erin Chambers |
| Complexity II / Session 3B： |
| Computing Sparse Multiples of Polynomials / Jin-Yi Cai ; Sangxia Huang ; Pinyan Lu ; Mark Giesbrecht ; Daniel S. Roche ; Hrushikesh Tilak |
| Fractal Parallelism: Solving SAT in Bounded Space and Time / Denys Duchier ; Jérôme Durand-Lose ; Maxime Senot |
| Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity / Hugo Férée ; Emmanuel Hianry ; Mathieu Hoyrup ; Romain Péchoux |
| New Upper Bounds on the Average PTF Density of Boolean Functions / Kazuyuki Amano |
| Computational Geometry I / Session 4A： |
| An Optimal Algorithm for Computing Angle-Constrained Spanners / Paz Carmi |
| Approximating Minimum Bending Energy Path in a Simple Corridor / Jinhui Xu ; Lei Xu ; Yulai Xie |
| Graph Coloring I / Session 4B： |
| Analysis of an Iterated Local Search Algorithm for Vertex Coloring / Dirk Sudholt ; Christine Zarges |
| Bounded Max-colorings of Graphs / Evripidis Bampis ; Alexander Kononov ; Giorgio Lucarelli ; Ioannis Milis |
| Fixed Parameter Tractability / Session 5A： |
| Parameterized Algorithms for Boxicity / Abhijin Adiga ; Rajesh Chitnis ; Saket Saurabh |
| On Tractable Cases of Target Set Selection / André Nichterlein ; Rolf Niedermeier ; Johannes Uhlmann ; Mathias Weller |
| Combining Two Worlds: Parameterised Approximation for Vertex Cover / Ljiljana Brankovic ; Henning Fernau |
| Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time / Maarten Löffler |
| Optimization / Session 5B： |
| Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles / Thomas Dueholm Hansen ; Uri Zwick |
| Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut / Immanuel Bomze ; Markus Chimani ; Michael Jünger ; Ivana Ljubic ; Petra Mutzel ; Bernd Zey |
| An Optimal Algorithm for Single Maximum Coverage Location on Trees and Related Problems / Joachim Spoerhase |
| A Faster Algorithm for the Maximum Even Factor Problem / Maxim A. Babenko |
| Author Index |
| Invited Talks |
| Regular Labelings and Geometric Structures (Abstract) / David Eppstein |
| Algorithmic Aspects of Secure Computation and Communication (Abstract) / Matt Franklin |
| Approximation Algorithm I / Session 1A： |
| Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament / Marek Karpinski ; Warren Schudy |
| A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2 / Piotr Berman ; Alexander Zelikovsky |
