A list with abstracts is available here.
An Online Scalable Algorithm for Average Flow Time in Broadcast Scheduling
Benjamin Moseley (University of Illinois Urbana-Champaign), Sungjin Im (University of Illinois Urbana-Champaign)
 
Probabilistic Analysis of the Semidefinite Relaxation Detector in Digital Communications
Anthony Man-Cho So (The Chinese University of Hong Kong)
 
An Improved Construction of Progression-Free Sets
Michael Elkin (Ben-Gurion University of the Negev)
 
Solving the Replacement Paths Problem for Planar Directed Graphs in O(n*log n) Time
Christian Wulff-Nilsen (Department of Computer Science, University of Copenhagen)
 
Correlation Clustering with Noisy Input
Claire Mathieu (Brown University), Warren Schudy (Brown University)
 
A Nearly Optimal Algorithm for Approximating Replacement Paths and k Shortest Simple Paths in General Graphs
Aaron Bernstein (MIT)
 
A QPTAS for TSP with Fat Weakly Disjoint Neighborhoods in Doubling Metrics
T-H. Hubert Chan (Max-Planck-Institut fuer Informatik), Khaled Elbassioni (Max-Planck-Institut fuer Informatik)
 
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing.
Aparna Das (Brown University), Claire Mathieu (Brown University)
 
Fully-Functional Succinct Trees
Kunihiko Sadakane (National Institute of Informatics), Gonzalo Navarro (University of Chile)
 
Online Learning with Queries
Chao-Kai Chiang (Academia Sinica), Chi-Jen Lu (Academia Sinica)
 
On the Exact Space Complexity of Sketching and Streaming Small Norms
Daniel M. Kane (Harvard University), Jelani Nelson (MIT), David P. Woodruff (IBM Almaden)
 
Hardness Results of Homology Localization
Chao Chen (Rensselaer Polytechnic Institute), Daniel Freedman (Rensselaer Polytechnic Institute and Hewlett-Packard Laboratories, Israel)
 
Towards a calculus for non-linear spectral gaps
Manor Mendel (The Open University of Israel), Assaf Naor (Courant Institute)
 
Paired Approximation Problems and Incompatible Inapproximabilities
David Eppstein (University of California, Irvine)
 
Solving Simple Stochastic Tail Games
Hugo Gimbert (CNRS, LaBRI, Bordeaux), Florian Horn (IST Austria, Wien)
 
On the Cell Probe Complexity of Dynamic Membership
KE YI (Hong Kong University of Science and Technology), QIN ZHANG (Hong Kong University of Science and Technology)
 
The $1+\beta$ Choice Process and Weighted Balls-into-Bins
Yuval Peres (Microsoft Research - Redmond), Kunal Talwar (Microsoft Research - SVC), Udi Wieder (Microsoft Research - SVC)
 
Basis Reduction, and the Complexity of Branch-and-Bound
Gabor Pataki (UNC Chapel Hill), Mustafa Tural (UNC Chapel Hill)
 
Approximating the Crossing Number of Graphs Embeddable in Any Orientable Surface
Petr Hlineny (FI MU Brno), Markus Chimani (TU Dortmund)
 
Testing Planarity of Partially Embedded Graphs
Patrizio Angelini (University Rome 3, Italy), Giuseppe Di Battista (University Rome 3, Italy), Fabrizio Frati (University Rome 3, Italy), Vit Jelinek (Charles University, Prague, Czech republic), Jan Kratochvil (Charles University, Prague, Czech republic), Maurizio Patrignani (University Rome 3, Italy), Ignaz Rutter (Karlsruhe University, Germany)
 
Solving MAX-2-SAT Above a Tight Lower Bound
Gregory Gutin (University of London, UK), Eun Jung Kim (University of London, UK), Stefan Szeider (University of Durham, UK), Anders Yeo (University of London, UK)
 
Rumour spreading and graph conductance
Flavio Chierichetti (Sapienza University, Roma, Italy), Silvio Lattanzi (Sapienza University, Roma, Italy), Alessandro Panconesi (Sapienza University, Roma, Italy)
 
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
Elchanan Mossel (Weizmann Institute & UC Berkeley), Christos Papadimitriou (UC Berkeley), Michael Schapira (Yale University & UC Berkeley), Yaron Singer (UB Berkeley)
 
Asymmetric Traveling Salesman Path and Directed Latency Problems
Zachary Friggstad (University of Alberta), Mohammad R. Salavatipour (University of Alberta), Zoya Svitkina (University of Alberta)
 
Data Structures for Range Minimum Queries in Multidimensional Arrays
Hao Yuan (Purdue University), Mikhail J. Atallah (Purdue University)
 
Incentive Compatible Budget Elicitation in Multi-unit Auctions
Sayan Bhattacharya (Duke University), Vincent Conitzer (Duke University), Kamesh Munagala (Duke University), Lirong Xia (Duke University)
 
Sharp kernel clustering algorithms and their associated Grothendieck inequalities
Subhash Khot (Courant Institute), Assaf Naor (Courant Institute)
 
On the Optimality of Spiral Search
Elmar Langetepe (University of Bonn, Institute of Computer Science I)
 
Cell-probe lower bounds for prefix sums and matching brackets
Emanuele Viola (Northeastern University)
 
The focus of attention problem
Dries Goossens (KULeuven), Sergey Polyakovskiy (KULeuven), Frits Spieksma (KULeuven), Gerhard Woeginger (Eindhoven University of Technology)
 
A locality-sensitive hash for real vectors
Tyler Neylon (Bynomial, Inc.)
 
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second Order Logic
Stephan Kreutzer (University of Oxford), Siamak Tazari (Humboldt Universität zu Berlin)
 
Compact Ancestry Labeling Schemes for XML Trees
Fraigniaud Pierre (CNRS and University Paris Diderot), Korman Amos (CNRS and University Paris Diderot)
 
The forest hiding problem
Adrian Dumitrescu (University of Wisconsin-Milwaukee), Minghui Jiang (Utah State University)
 
How to meet asynchronously (almost) everywhere
Jurek Czyzowicz (UQO, Gatineau, Canada), Arnaud Labourel (UQO, Gatineau, Canada), Andrzej Pelc (UQO, Gatineau, Canada)
 
Decomposition, Approximation, and Coloring of Odd-Minor-Free Graphs
Erik D. Demaine (MIT), MohammadTaghi Hajiaghayi (AT&T Labs -- Research), Ken-ichi Kawarabayashi (National Institute for Informatics)
 
Tree Embeddings for Two-Edge-Connected Network Design
Anupam Gupta (Carnegie Mellon University), Ravishankar Krishnaswamy (Carnegie Mellon University), R. Ravi (Carnegie Mellon University)
 
A Constant Factor Approximation Algorithm for Generalized Min-Sum Set Cover
Nikhil Bansal (IBM TJ Watson Research), Anupam Gupta (Carnegie Mellon University), Ravishankar Krishnaswamy (Carnegie Mellon University)
 
Differentially Private Approximation Algorithms
Anupam Gupta (Carnegie Mellon University), Katrina Ligett (Carnegie Mellon University), Frank McSherry (Microsoft Research), Aaron Roth (Carnegie Mellon University), Kunal Talwar (Microsoft Research)
 
Lower Bounds for Testing Triangle-freeness in Boolean Functions
Arnab Bhattacharyya (MIT), Ning Xie (MIT)
 
Efficiently Decodable Non-adaptive Group Testing
Piotr Indyk (MIT), Hung Q. Ngo (University at Buffalo, SUNY), Atri Rudra (University at Buffalo, SUNY)
 
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
Aaron Archer (AT&T Labs -- Research), Anna Blasiak (Cornell University)
 
Phase Transition for the Mixing Time of the Glauber Dynamics for Coloring Regular Trees
Prasad Tetali (School of Mathematics and School of Computer Science, Georgia Institute of Technology), Juan Vera (Department of Management Sciences, University of Waterloo), Eric Vigoda (School of Computer Science, Georgia Institute of Technology), Linji Yang (School of Computer Science, Georgia Institute of Technology)
 
A Space--Time Tradeoff for Permutation Problems
Mikko Koivisto (Helsinki Institute for Information Technology HIIT, Dept. of Computer Science, Univ. of Helsinki), Pekka Parviainen (Helsinki Institute for Information Technology HIIT, Dept. of Computer Science, Univ. of Helsinki)
 
Randomized Shellsort: A Simple Oblivious Sorting Algorithm
Michael T. Goodrich (Univ. of California, Irvine)
 
A Polynomial Time Approximation Scheme for k-Consensus Clustering
Tom Coleman (The University of Melbourne), Anthony Wirth (The University of Melbourne)
 
Correlation Robust Stochastic Optimization
Shipra Agrawal (Stanford University), Yichuan Ding (Stanford University), Amin Saberi (Stanford University), Yinyu Ye (Stanford University)
 
On Nonlinear Forbidden Matrices: A Refutation of a Furedi-Hajnal Conjecture
Seth Pettie (University of Michigan)
 
Convergence, Stability, and Discrete Approximation of Laplace Spectra
Tamal K. Dey (The Ohio State University), Pawas Ranjan (The Ohio State University), Yusu Wang (The Ohio State University)
 
Generating a d-dimensional linear subspace efficiently
Rapahael Yuster (University of Haifa)
 
Classified Stable Matching
Chien-Chung Huang (Max-Planck-Institut)
 
On linear and semidefinite programming relaxations for hypergraph matching
Yuk Hei Chan (The Chinese University of Hong Kong), Lap Chi Lau (The Chinese University of Hong Kong)
 
Counting Stars and Other Small Subgraphs in Sublinear Time
Mira Gonen (Tel-Aviv University), Dana Ron (Tel-Aviv University), Yuval Shavitt (Tel-Aviv University)
 
Deletion Without Rebalancing in Balanced Binary Trees
Siddhartha Sen (Princeton University), Robert E. Tarjan (Princeton University)
 
Regular Expression Matching with Multi-Strings
Philip Bille (Technical University of Denmark), Mikkel Thorup (AT&T Labs-Research)
 
The edge disjoint paths problem in Eulerian graphs and $4$-edge-connected graphs
Ken-ichi Kawarabayashi (National Institute of Informatics), Yusuke Kobayashi (University of Tokyo)
 
Coresets and Sketches for High Dimensional Subspace Approximation Problems
Dan Feldman (School of Computer Science; Tel Aviv University; Tel Aviv 69978, Israel), Morteza Monemizadeh (Department of Computer Science, University of Dortmund; , Germany), Christian Sohler (Department of Computer Science, University of Dortmund; , Germany), David P. Woodruff (IBM Almaden Research Center, San Jose, CA)
 
1-pass Relative-Error L_p-Sampling with Applications
Morteza Monemizadeh (Department of Computer Science, University of Dortmund; , Germany), David P. Woodruff (IBM Almaden Research Center, San Jose, CA)
 
One-Counter Markov Decision Processes
Tomas Brazdil (Faculty of Informatics, Masaryk University), Vaclav Brozek (Faculty of Informatics, Masaryk University), Kousha Etessami (School of Informatics, University of Edinburgh), Antonin Kucera (Faculty of Informatics, Masaryk University), Dominik Wojtczak (CWI, Amsterdam)
 
How far can you reach?
Ciprian Borcea (Dept. of Mathematics, Rider University), Ileana Streinu (Computer Science Department, Smith College)
 
Region growing for multi-route cuts
Shuchi Chawla (University of Wisconsin - Madison), Siddharth Barman (University of Wisconsin - Madison)
 
Faster exponential time algorithms for the shortest vector problem
Daniele Micciancio (University of California, San Diego), Panagiotis Voulgaris (University of California, San Diego)
 
Finding the Jaccard Median
Flavio Chierichetti (Sapienza University of Rome), Ravi Kumar (Yahoo! Research Santa Clara), Sandeep Pandey (Yahoo! Research Santa Clara), Sergei Vassilvitskii (Yahoo! Research New York)
 
The scaling window for a random graph with a given degree sequence
Hamed Hatami (University of Toronto), Michael Molloy (University of Toronto)
 
Energy Efficient Scheduling for Data Centers via Partial Shutdown
Samir Khuller (University of Maryland), Jian Li (University of Maryland), Barna Saha (University of Maryland)
 
Sharp Dichotomies for Regret Minimization in Metric Spaces
Robert Kleinberg (Cornell University), Aleksandrs Slivkins (Microsoft Research (SVC))
 
Lower Bounds for Sparse Recovery
khanh do ba (MIT CSAIL), piotr indyk (MIT CSAIL), eric price (MIT CSAIL)
 
The Complexity of Guarding Terrains
James King (McGill University), Erik Krohn (University of Iowa)
 
An (almost) Linear Time Algorithm For Odd Cycles Transversal
Ken-ichi Kawarabayashi (National Institute of Informatics), Bruce Reed (McGill University)
 
Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
Karthekeyan Chandrasekaran (Georgia Institute of Technology), Daniel Dadush (Georgia Institute of Technology), Santosh Vempala (Georgia Institute of Technology)
 
Resource Minimization for Fire Containment
Parinya Chalermsook (University of Chicago), Julia Chuzhoy (TTI-C)
 
Price of Anarchy for Greedy Auctions
Brendan Lucier (University of Toronto), Allan Borodin (University of Toronto)
 
Inapproximability for planar embedding problems
Jeff Edmonds (York University), Anastasios Sidiropoulos (University of Toronto), Anastasios Zouzias (University of Toronto)
 
How good is the Chord algorithm?
Constantinos Daskalakis (MIT), Ilias Diakonikolas (Columbia University), Mihalis Yannakakis (Columbia University)
 
On the Equilibria of Asynchronous Games
Aaron Roth (Carnegie Mellon University), Nina Balcan (Microsoft Research and Georgia Tech), Adam Kalai (Microsoft Research), Yishay Mansour (Google Research and Tel Aviv University)
 
Recognizing a totally odd K_4-subdivision, parity 2-disjoint rooted paths and a parity cycle through specified elements
Ken-ichi Kawarabayashi (National Institute of Informatics), Zhentao Li (McGill University), Bruce Reed (McGill University and INRIA, Laboratoire I3S, CNRS)
 
Highway Dimension, Shortest Paths, and Provably Efficient Algorithms
Ittai Abraham (Microsoft Research), Amos Fiat (TAU), Andrew Goldberg (Microsoft Research), Renato Werneck (Microsoft Research)
 
Limits on the Social Welfare of Maximal-In-Range Auction Mechanisms
Dave Buchfuhrer (Caltech), Chris Umans (Caltech)
 
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
Timothy M. Chan (U. Waterloo), Mihai Patrascu (AT&T Labs)
 
Near-Tight Bounds for Testing Ulam Distance
Alexandr Andoni (MIT), Huy Le Nguyen (MIT)
 
Data-Specific Analysis of String Sorting
Raimund Seidel (Saarland University)
 
Graph genus and random partitions
James R. Lee (University of Washington), Anastasios Sidiropoulos (University of Toronto)
 
Optimally Reconstructing Weighted Graphs Using Queries
Hanna Mazzawi
 
EDF-schedulability of synchronous periodic task systems is coNP-hard
Friedrich Eisenbrand (Institute of Mathematics, EPFL, Lausanne, Switzerland), Thomas Rothvoß (Institute of Mathematics, EPFL, Lausanne, Switzerland)
 
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Fedor V. Fomin (University of Bergen), Petr A. Golovach (University of Bergen), Daniel Lokshtanov (University of Bergen), Saket Saurabh (University of Bergen)
 
An Improved Competitive Algorithm for Reordering Buffer Management
Noa Avigdor-Elgrabli (Technion), Yuval Rabani (Technion)
 
Deterministic Algorithms for the Lovasz Local Lemma
Karthekeyan Chandrasekaran (Gatech), Navin Goyal (Microsoft Research, India), Bernhard Haeupler (MIT)
 
Streaming Algorithms for extent problems in high dimensions
Pankaj K Agarwal (Department of Computer Science, Duke University), R. Sharathkumar (Department of Computer Science, Duke University)
 
Algorithms and Complexity for Periodic Real-Time Scheduling
Vincenzo Bonifaci (University of L'Aquila and Sapienza University of Rome, Italy), Ho-Leung Chan (Max-Planck-Insitut fuer Informatik, Saarbruecken, Germany), Alberto Marchetti-Spaccamela (Sapienza University of Rome, Italy), Nicole Megow (Max-Planck-Insitut fuer Informatik, Saarbruecken, Germany)
 
Cache-Oblivious Dynamic Dictionaries with Optimal Update/Query Tradeoff
Gerth Stølting Brodal (Aarhus University), Erik D. Demaine (MIT), Jeremy T. Fineman (MIT), John Iacono (Polytechnic Institute of NYU), Stefan Langerman (Université Libre de Bruxelles), J. Ian Munro (University of Waterloo)
 
Testing additive integrality gaps
Friedrich Eisenbrand (EPFL, Switzerland), Nicolai Hähnle (EPFL, Switzerland), Dömötör Pálvölgyi (EPFL, Switzerland), Gennady Shmonin (EPFL, Switzerland)
 
Reconstructing approximate phylogenetic trees from quartet samples
Sagi Snir (University of Haifa), Raphael Yuster (University of Haifa)
 
Fast distance multiplication of unit-Monge matrices
Alexander Tiskin (University of Warwick)
 
Applications of Forbidden 0-1 Matrices to Search Trees and Path Compression-Based Data Structures
Seth Pettie (University of Michigan)
 
A deterministic truthful PTAS for scheduling related machines
George Christodoulou (Max-Planck Institute for Informatics), Annamaria Kovacs (Department of Informatics, Goethe University, Frankfurt M.)
 
PTAS for maximum weight independent set problem with random weights in bounded degree graphs
David Gamarnik (MIT), David Goldberg (MIT), Theophane Weber (MIT)
 
Distributed Agreement with Optimal Communication Complexity
Seth Gilbert (EPFL), Dariusz Kowalski (University of Liverpool)
 
Synchrony and Asynchrony in Neural Networks
Fabian Kuhn (MIT CSAIL), Konstantinos Panagiotou (Max-Planck-Institute for Informatics), Joel Spencer (Courant Institute, New York), Angelika Steger (ETH Zurich)
 
Belief Propagation for Min-cost Network Flow: Convergence & Correctness
David Gamarnik (MIT), Devavrat Shah (MIT), Yehua Wei (MIT)
 
Pricing Randomized Allocations
Patrick Briest (Cornell University), Shuchi Chawla (University of Wisconsin - Madison), Robert Kleinberg (Cornell University), S. Matthew Weinberg (Cornell University)
 
Covering a symmetric crossing supermodular function with partition constraints
Attila Bernáth (MTA-ELTE Egerváry Research Group, Budapest, Hungary), Roland Grappe (Laboratoire G-SCOP, Grenoble, France), Zoltán Szigeti (Laboratoire G-SCOP, Grenoble, France)
 
A Max-Flow/Min-Cut Algorithm for a Class of Wireless Networks
S. M. Sadegh Tabatabaei Yazdi (Student, Texas A&M university), Serap A. Savari (Professor, Texas A&M university)
 
Vertices of Degree k in Random Maps
Daniel Johannsen (Max-Planck-Institute for Informatics), Konstantinos Panagiotou (Max-Planck-Institute for Informatics)
 
Bidimensionality and Kernels
Fedor V. Fomin (Department of Informatics, University of Bergen, Norway), Daniel Lokshtanov (Department of Informatics, University of Bergen, Norway), Saket Saurabh (Department of Informatics, University of Bergen, Norway), Dimitrios M. Thilikos (Department of Mathematics, National and Kapodistrian University of Athens)
 
Flow-Cut Gaps for Integer and Fractional Multiflows
Chandra Chekuri (University of Illinois, Urbana-Champaign), Bruce Shepherd (McGill University), Christophe Weibel (McGill University)
 
Testing monotone high-dimensional distributions
Michal Adamaszek (University of Warwick), Artur Czumaj (University of Warwick), Christian Sohler (TU Dortmund)
 
The rank of diluted random graphs
bordenave (CNRS - Univ. Toulouse), lelarge (INRIA - ENS)
 
Utilitarian Mechanism Design for Multi-Objective Optimization
Fabrizio Grandoni (Universita di Roma Tor Vergata), Piotr Krysta (University of Liverpool), Stefano Leonardi (Sapienza Universita di Roma), Carmine Ventre (University of Liverpool)
 
Property Testing and Parameter Testing for Permutations
Carlos Hoppen (IME, USP, São Paulo, Brazil), Yoshiharu Kohayakawa (IME, USP, São Paulo, Brazil), Carlos G. T. de A. Moreira (IMPA, Rio de Janeiro, Brazil), Rudini M. Sampaio (DC, UFC, Fortaleza, Brazil)
 
Monotonicity in Bargaining Networks
Yossi Azar, Nikhil Devanur, Kamal Jain, Yuval Rabani
 
A Lower Bound for Succinct Rank Queries
Mihai Patrascu (AT&T Labs)
 
Amplified Hardness of Approximation for VCG-Based Mechanisms
Shaddin Dughmi (Stanford University), Hu Fu (Cornell University), Robert Kleinberg (Cornell University)
 
On the possibility of faster SAT algorithms
Mihai Patrascu (IBM Almaden), Ryan Williams (Institute for Advanced Study)
 
Geometric optimization and sums of algebraic functions
Antoine Vigneron (INRA)
 
Quasirandom Load Balancing
Tobias Friedrich (International Computer Science Institute), Martin Gairing (International Computer Science Institute), Thomas Sauerwald (International Computer Science Institute)
 
SRPT is 1.86-Competitive for Completion Time Scheduling
Christine Chung (University of Pittsburgh), Tim Nonner (Albert-Ludwigs-University of Freiburg), Alexander Souza (Albert-Ludwigs-University of Freiburg)
 
Efficient Broadcast on Random Geometric Graphs
Milan Bradonji (Los Alamos National Laboratory), Robert Elsässer (University of Paderborn), Tobias Friedrich (International Computer Science Institute), Thomas Sauerwald (International Computer Science Institute), Alexandre Stauffer (University of California)
 
Maximum Flows and Parametric Shortest Paths in Planar Graphs
Jeff Erickson (University of Illinois, Urbana-Champaign)
 
Towards the Randomized $k$-Server Conjecture: A Primal-Dual Approach
Nikhil Bansal (IBM Research), Niv Buchbinder (Microsoft Research), Seffi Naor (Technion, Israel)
 
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Arash Asadpour (stanford), Michel X. Goemans (mit), Aleksander Madry (mit), Shayan Oveis Gharan (stanford), Amin Saberi (stanford)
 
Algorithms for ray class groups and Hilbert class fields
Sean Hallgren (Penn State University), Kirsten Eisentraeger (Penn State University)
 
Road Network Reconstruction for Organizing Paths
Daniel Chen (Stanford University), Leonidas J. Guibas (Stanford University), John Hershberger (Mentor Graphics), Jian Sun (Stanford University)
 
A Fourier space algorithm for solving quadratic assignment problems
Risi Kondor (Gatsby Computational Neuroscience Unit, University College London)
 
Self-improving Algorithms for Convex Hulls
Kenneth L. Clarkson (IBM Almaden), Wolfgang Mulzer (Princeton University), C. Seshadhri (IBM Almaden)
 
Quantum algorithms for highly non-linear Boolean functions
Martin Roetteler (NEC Laboratories America)
 
Approximability of Robust Network Design
Neil Olver (Department of Mathematics and Statistics, McGill University), F. Bruce Shepherd (Department of Mathematics and Statistics, McGill University)
 
Speeding up random walks with neighborhood exploration
Petra Berenbrink (Simon Fraser University), Colin Cooper (King's College London), Robert Elsaesser (University of Paderborn), Tomasz Radzik (King's College London), Thomas Sauerwald (ICSI Berkeley)
 
A Model of Computation for MapReduce
Howard Karloff (AT&T Labs), Siddharth Suri (Yahoo! Research), Sergei Vassilvitskii (Yahoo! Research)
 
Fast SDP Algorithms for Constraint Satisfaction Problems
David Steurer (Princeton University)
 
Lower bounds for Edit Distance and Product Metrics via Poincare-Type Inequalities
Alexandr Andoni (MIT), T.S. Jayram (IBM Almaden), Mihai Patrascu (IBM Almaden)
 
Shape Replication Through Self-Assembly and RNase Enzymes
Zachary Abel (Harvard University), Nadia Benbernou (Massachusetts Institute of Technology), Mirela Damian (Villanova University), Erik Demaine (Massachusetts Institute of Technology), Robin Flatland (Siena College), Skott Kominers (Harvard University), Robert Schweller (University of Texas Pan American), Martin Demaine (Massachusetts Institute of Technology)
 
Universal $\epsilon$-approximators for integrals
Michael Langberg (The Open University of Israel), Leonard J. Schulman (Caltech)
 
A 1.4-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model
Bahman Bahmani (Stanford University), Aranyak Mehta (Google, Inc.), Rajeev Motwani (Stanford University)
 
Orthogonal Ham-Sandwich Theorem in R3
Sergey Bereg (University of Texas at Dallas)
 
Bounding Variance and Expectation of Longest Path Length in DAGs from Variance and Expectation of Edge Lengths
Jeff Edmonds (York University), Supratik Chakraborty (Indian Institute of Technology Bombay)