Invited Lectures |
Additive Approximation for Edge-Deletion Problems / Noga Alon ; Asaf Shapira ; Benny Sudakov |
Graph Theory I |
Testing Graph Isomorphism in Parallel by Playing a Game / Martin Grohe ; Oleg Verbitsky |
The Spectral Gap of Random Graphs with Given Expected Degrees / Amin Coja-Oghlan ; Andre Lanka |
Embedding Bounded Bandwidth Graphs into l[subscript 1] / Douglas E. Carroll ; Ashish Goel ; Adam Meyerson |
On Counting Homomorphisms to Directed Acyclic Graphs / Martin Dyer ; Leslie Ann Goldberg ; Mike Paterson |
Quantum Computing |
Fault-Tolerance Threshold for a Distance-Three Quantum Code / Ben W. Reichardt |
Lower Bounds on Matrix Rigidity Via a Quantum Argument / Ronald de Wolf |
Self-testing of Quantum Circuits / Frederic Magniez ; Dominic Mayers ; Michele Mosca ; Harold Ollivier |
Randomness |
Deterministic Extractors for Independent-Symbol Sources / Chia-Jung Lee ; Chi-Jen Lu ; Shi-Chun Tsai |
Gap Amplification in PCPs Using Lazy Random Walks / Jaikumar Radhakrishnan |
Stopping Times, Metrics and Approximate Counting / Magnus Bordewich ; Marek Karpinski |
Formal Languages |
Algebraic Characterization of the Finite Power Property / Michal Kunc |
P-completeness of Cellular Automaton Rule 110 / Turlough Neary ; Damien Woods |
Small Sweeping 2NFAs Are Not Closed Under Complement / Christos A. Kapoutsis |
Expressive Power of Pebble Automata / Mikotaj Bojanczyk ; Mathias Samuelides ; Thomas Schwentick ; Luc Segoufin |
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs / R. Ravi ; Mohit SinghApproximation Algorithms I: |
Better Algorithms for Minimizing Average Flow-Time on Related Machines / Naveen Garg ; Amit Kumar |
A Push-Relabel Algorithm for Approximating Degree Bounded MSTs / Kamalika Chaudhuri ; Satish Rao ; Samantha Riesenfeld ; Kunal Talwar |
Edge Disjoint Paths in Moderately Connected Graphs / Shuheng Zhou |
A Robust APTAS for the Classical Bin Packing Problem / Leah Epstein ; Asaf LevinApproximation Algorithms II: |
Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion / Subhash Khot ; Ashok Kumar Ponnuswami |
Approximating the Orthogonal Knapsack Problem for Hypercubes / Rolf Harren |
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs / Ramesh Hariharan ; Telikepalli Kavitha ; Kurt MehlhornGraph Algorithms I: |
Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems / Virginia Vassilevska ; Ryan Williams ; Raphael Yuster |
Weighted Bipartite Matching in Matrix Multiplication Time / Piotr Sankowski |
Optimal Resilient Sorting and Searching in the Presence of Memory Faults / Irene Finocchi ; Fabrizio Grandoni ; Giuseppe F. ItalianoAlgorithms I: |
Reliable and Efficient Computational Geometry Via Controlled Perturbation / Ralf Osbild ; Michael Sagraloff |
Tight Bounds for Selfish and Greedy Load Balancing / Ioannis Caragiannis ; Michele Flammini ; Christos Kaklamanis ; Panagiotis Kanellopoulos ; Luca Moscardelli |
Lower Bounds of Static Lovasz-Schrijver Calculus Proofs for Tseitin Tautologies / Arist Kojevnikov ; Dmitry ItsyksonComplexity I: |
Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws / Lance Fortnow ; John M. Hitchcock ; A. Pavan ; N. V. Vinodchandran ; Fengming Wang |
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / Parikshit Gopalan ; Phokion G. Kolaitis ; Elitza N. Maneva ; Christos H. Papadimitriou |
Data Structures and Linear Algebra |
Suffix Trays and Suffix Trists: Structures for Faster Text Indexing / Richard Cole ; Tsvi Kopelowitz ; Moshe Lewenstein |
Optimal Lower Bounds for Rank and Select Indexes / Alexander Golynski |
Dynamic Interpolation Search Revisited / Alexis Kaporis ; Christos Makris ; Spyros Sioutas ; Athanasios Tsakalidis ; Kostas Tsichlas ; Christos Zaroliagis |
Dynamic Matrix Rank / Gudmund Skovbjerg Frandsen ; Peter Frands Frandsen |
Graphs |
Nearly Optimal Visibility Representations of Plane Graphs / Xin He ; Huaming Zhang |
Planar Crossing Numbers of Genus g Graphs / Hristo Djidjev ; Imrich Vrt'o |
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover / Toshihiro Fujito |
Tight Approximation Algorithm for Connectivity Augmentation Problems / Guy Kortsarz ; Zeev Nutov |
On the Bipartite Unique Perfect Matching Problem / Thanh Minh Hoang ; Meena Mahajan ; Thomas ThieraufComplexity II: |
Comparing Reductions to NP-Complete Sets |
Design Is as Easy as Optimization / Deeparnab Chakrabarty ; Aranyak Mehta ; Vijay V. Vazirani |
On the Complexity of 2D Discrete Fixed Point Problem / Xi Chen ; Xiaotie Deng |
Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions / Martin Gairing ; Burkhard Monien ; Karsten TiemannGame Theory I: |
The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games / Constantinos Daskalakis ; Alex Fabrikant |
Network Games with Atomic Players / Roberto Cominetti ; Jose R. Correa ; Nicolas E. Stier-Moses |
Finite-State Dimension and Real Arithmetic / David Doty ; Jack H. Lutz ; Satyadev NandakumarAlgorithms II: |
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings / Andreas Bjorklund ; Thore Husfeldt |
The Myriad Virtues of Wavelet Trees / Paolo Ferragina ; Raffaele Giancarlo ; Giovanni Manzini |
Atomic Congestion Games Among Coalitions / Dimitris Fotakis ; Spyros Kontogiannis ; Paul SpirakisGame Theory II: |
Computing Equilibrium Prices in Exchange Economies with Tax Distortions / Bruno Codenotti ; Luis Rademacher ; Kasturi Varadarajan |
New Constructions of Mechanisms with Verification / Vincenzo Auletta ; Roberto De Prisco ; Paolo Penna ; Giuseppe Persiano ; Carmine Ventre |
Networks, Circuits and Regular Expressions |
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations / Amos Fiat ; Haim Kaplan ; Meital Levy ; Svetlana Olonetsky ; Ronen Shabo |
Dynamic Routing Schemes for General Graphs / Amos Korman ; David Peleg |
Energy Complexity and Entropy of Threshold Circuits / Kei Uchizawa ; Rodney Douglas ; Wolfgang Maass |
New Algorithms for Regular Expression Matching / Philip Bille |
Fixed Parameter Complexity and Approximation Algorithms |
A Parameterized View on Matroid Optimization Problems / Daniel Marx |
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction / Guy E. Blelloch ; Kedar Dhamdhere ; Eran Halperin ; Russell Schwartz ; Srinath Sridhar |
Length-Bounded Cuts and Flows / Georg Baier ; Thomas Erlebach ; Alexander Hall ; Ekkehard Kohler ; Heiko Schilling ; Martin Skutella |
An Adaptive Spectral Heuristic for Partitioning Random Graphs / Graph Algorithms II: |
Some Results on Matchgates and Holographic Algorithms / Jin- Yi Cai ; Vinay Choudhary |
Weighted Popular Matchings / Julian Mestre |
Author Index |
Invited Lectures |
Additive Approximation for Edge-Deletion Problems / Noga Alon ; Asaf Shapira ; Benny Sudakov |
Graph Theory I |