- Jens M. Schmidt. Certifying 3-Connectivitiy in Linear Time
- Stacey Jeffery, Robin Kothari and Frédéric Magniez. Improving Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision
- Leslie Ann Goldberg and Mark Jerrum. The Complexity of Computing the Sign of the Tutte Polynomial (and consequent #P-hardness of Approximation)
- Volker Diekert, Manfred Kufleitner, Klaus Reinhardt and Tobias Walter. Regular Languages are Church-Rosser Congruential
- John Fearnley and Sven Schewe. Time and Parallelizability Results for Parity Games with Bounded Treewidth
- Jesper Jansson, Kunihiko Sadakane and Wing-Kin Sung. CRAM: Compressed Random Access Memory
- Anastasios Zouzias. A Matrix Hyperbolic Cosine Algorithm and Applications
- Elad Verbin and Qin Zhang. Rademacher-Sketch: A Dimensionality-Reducing Embedding for Sum-Product Norms, with an Application to Earth-Mover Distance
- Sungjin Im, Viswanath Nagarajan and Ruben Van Der Zwaan. Minimum Latency Submodular Cover
- Hongfei Fu. Computing Game Metrics on Markov Decision Processes
- Yaron Velner. The Complexity of Mean-Payoff Automaton Expression
- Denis Kuperberg and Michael Vanden Boom. On the Expressive Power of Cost Logics over Infinite Words.
- Shelby Kimmel. Quantum Adversary (Upper) Bound
- Ran Gelles, Rafail Ostrovsky and Kina Winoto. Multi-User Equality Testing and Its Applications
- Marcel Ochel, Klaus Radke and Berthold Voecking. Online Packing with Gradually Improving Capacity Estimations with Applications to Network Lifetime Maximization
- László Babai, Paolo Codenotti and Youming Qiao. Polynomial-Time Isomorphism Test for Groups with no Abelian Normal Subgroups
- Pushkar Tripathi, Prasad Tetali and Kevin Costello. Stochastic Matching with Commitment
- Michael Goodrich and Michael Mitzenmacher. Anonymous Card Shuffling and its Applications to Parallel Mixnets
- Magnus M. Halldorsson, Xiaoming Sun, Mario Szegedy and Chengu Wang. Streaming and Communication Complexity of Clique Approximation
- Marek Cygan, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk and Magnus Wahlstrom. Clique cover and graph separation: New incompressibility results
- Tomáš Gavenčiak, Daniel Kral and Sang-Il Oum. Deciding first order logic properties of matroids
- Robert Krauthgamer and Tamar Zondiner. Preserving Terminal Distances using Minors
- Marco Molinaro and R Ravi. Geometry of Online Packing Linear Programs
- Adrian Kosowski, Bi Li, Nicolas Nisse and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth
- Yoann Dieudonne and Andrzej Pelc. Deterministic network exploration by anonymous silent agents with local traffic reports
- Bingkai Lin and Yijia Chen. The parameterized complexity of k-edge induced subgraphs
- Fedor Fomin, Petr Golovach, Jesper Nederlof and Michał Pilipczuk. Minimizing Rosenthal Potential in Multicast Games
- Yuval Emek, Magnus M. Halldorsson and Adi Rosen. Space-Constrained Interval Selection
- T-H. Hubert Chan, Mingfei Li and Li Ning. Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree
- Lukas Polacek and Ola Svensson. Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
- Justin Hsu, Sanjeev Khanna and Aaron Roth. Distributed Private Heavy Hitters
- Ilias Diakonikolas, Christos Papadimitriou, George Pierrakos and Yaron Singer. Efficiency-Revenue Trade-offs in Auctions
- Inge Li Gørtz, Viswanath Nagarajan and Rishi Saket. Stochastic Vehicle Routing with Recourse
- Daniel M. Kane, Kurt Mehlhorn, Thomas Sauerwald and He Sun. Counting Arbitrary Subgraphs in Data Streams
- Nicole Megow, Martin Skutella, Jose Verschae and Andreas Wiese. The Power of Recourse for Online MST and TSP
- Piotr Krysta and Berthold Voecking. Online Mechanism Design (Randomized Rounding on the Fly)
- Anupam Gupta and Viswanath Nagarajan. Approximating Sparse Covering Integer Programs Online
- Bundit Laekhanukit, Shayan Oveis Gharan and Mohit Singh. An Improved Approximation Algorithm for The Minimum Size k-Arc Connected Subgraph Problem
- Andrew Hughes, A Pavan, Nathan Russell and Alan Selman. A Thirty Year Old Conjecture about Promise Problems
- Maria Florina Balcan and Yingyu Liang. Clustering under Perturbation Resilience
- Rajesh Chitnis, Marek Cygan, Mohammadtaghi Hajiaghayi and Dániel Marx. Directed Subset Feedback Vertex Set is Fixed-Parameter Tractable
- Hiro Ito, Shin-Ichi Tanigawa and Yuichi Yoshida. Constant-Time Algorithms for Sparsity Matroids
- Bruno Bauwens. Complexity of complexity and maximal plain versus prefix-free Kolmogorov complexity
- Joshua Baron, Rafail Ostrovsky and Ivan Visconti. Nearly Simultaneously Resettable Black-Box Zero Knowledge
- Sevag Gharibian and Julia Kempe. Hardness of approximation for quantum problems
- Michael Fellows, Ariel Kulik, Frances Rosamond and Hadas Shachnai. Parameterized Approximation via Fidelity Preserving Transformations
- Niv Buchbinder, Seffi Naor, R. Ravi and Mohit Singh. Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
- Yossi Azar and Iftah Gamzu. Efficient Submodular Function Maximization under Linear Packing Constraints
- Ning Chen, Xiaotie Deng, Hongyang Zhang and Jie Zhang. Incentive Ratios of Fisher Markets
- Uriel Feige and Shlomo Jozeph. Universal Factor Graphs
- Leonid Barenboim. On the Locality of NP-Complete Problems
- Khaled Elbassioni. A QPTAS for $\eps$-Envy-Free Profit-Maximizing Pricing on Line Graphs
- C.-H. Luke Ong and Takeshi Tsukada. Two-Level Game Semantics, Intersection Types and Recursion Schemes
- Andris Ambainis, Artūrs Bačkurs, Kaspars Balodis, Dmitry Kravchenko, Raitis Ozols, Juris Smotrovs and Madars Virza. Quantum strategies are better than classical in almost any XOR game
- Reut Levi, Dana Ron and Ronitt Rubinfeld. Testing Similar Means
- Yishay Mansour, Aviad Rubinstein, Shai Vardi and Ning Xie. Converting Online Algorithms To Local Computation Algorithms
- Reuven Bar-Yehuda, Erez Kantor, Shay Kutten and Dror Rawitz. Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs
- Stanislav Kikot, Roman Kontchakov, Vladimir Podolskii and Michael Zakharyaschev. Exponential Lower Bounds and Separation for Query Rewriting
- Deeparnab Chakrabarty and Zhiyi Huang. Testing Coverage Functions
- S. Laplante, V. Lerays and J. Roland. Classical and quantum partition bound and detector inefficiency
- Michael Dinitz, Guy Kortsarz and Ran Raz. Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner
- Sylvain Salvati, Giulio Manzonetto, Mai Gehrke and Henk Barendregt. Urzyczyn and Loader are Logically Related
- Michael Benedikt, Pierre Bourhis and Pierre Senellart. Monadic Datalog Containment
- Danny Z. Chen and Haitao Wang. Computing the Visibility Polygon of an Island in a Polygonal Domain
- Amit Deshpande, Ravindran Kannan and Nikhil Srivastava. Zero-One Rounding of Singular Vectors
- Mikolaj Bojańczyck and Thomas Place. Regular Languages of Infinite Trees that are Boolean Combinations of Open Sets
- Mikolaj Bojanczyk and Thomas Place. Model theory in nominal sets
- Patricia Bouyer, Nicolas Markey and Ocan Sankur. Robust Reachability in Timed Automata: A Game-based Approach
- Nishanth Chandran, Juan Garay and Rafail Ostrovsky. Edge Fault Tolerance on Sparse Networks
- Serge Gaspers and Stefan Szeider. Backdoors to Acyclic SAT
- Alberto Marchetti-Spaccamela, Cyriel Rutten, Suzanne van der Ster and Andreas Wiese. Assigning Sporadic Tasks to Unrelated Parallel Machines
- Rajeev Alur and Loris D'Antoni. Streaming Tree Transducers
- Elias Koutsoupias and Katia Papakonstantinopoulou. Contention issues in congestion games
- Luca Aceto, Arnaud Carayol, Zoltan Esik and Anna Ingolfsdottir. Algebraic Synchronization Trees and Processes
- Artur Jeż. Faster fully compressed pattern matching by recompression
- Ramanujan M. S. and Daniel Lokshtanov. Parameterized Tractability of Multiway Cut with Parity Constraints
- Karl Bringmann and Konstantinos Panagiotou. Efficient Sampling Methods for Discrete Distributions
- Robert Crowston, Mark Jones and Matthias Mnich. Max-Cut Parameterized Above the Edwards-Erdős Bound
- Chris Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre. A Saturation Method for Collapsible Pushdown Systems
- Tomas Brazdil, Antonin Kucera, Petr Novotný and Dominik Wojtczak. Minimizing Expected Termination Time in One-Counter Markov Decision Processes
- Gilles Dowek and Pablo Arrighi. Causal graph dynamics
- Manfred Kufleitner and Alexander Lauser. Lattices of Logical Fragments over Words
- Bjarki Holm and Anuj Dawar. Pebble Games with Algebraic Rules
- Mikołaj Bojańczyk and Sławomir Lasota. Application of nominal sets to machine-independent characterization of timed languages
- Stefan Kratsch, Marcin Pilipczuk, Michał Pilipczuk and Magnus Wahlström. Fixed-parameter tractability of multicut in directed acyclic graphs
- Moses Charikar and Shi Li. A Dependent LP-rounding Approach for the $k$-Median Problem
- Loukas Georgiadis and Robert Tarjan. Dominators, Directed Bipolar Orders, and Independent Spanning Trees
- Chandra Chekuri, Alina Ene and Ali Vakilian. Node-weighted Network Design in Planar and Minor-closed Families of Graphs
- Anindya De, Ilias Diakonikolas and Rocco Servedio. The Inverse Shapley Value Problem
- Andrzej Murawski and Nikos Tzevelekos. Algorithmic games for full ground references
- Arash Farzan, Ian Munro and Rajeev Raman. Succinct Indices for Range Queries with applications to Orthogonal Range Maxima
- Michael Rabin, Yishay Mansour, Muthu Muthuikrishnan and Moti Yung. Strictly-Black-Box Zero-Knowledge and Efficient Validation of Financial Transactions
- Marcelo Fiore. Generalised Polynomial Functors: Theory and Applications
- Siddharth Barman, Shuchi Chawla, David Malec and Seeun Umboh. Secretary Problems with Convex Costs
- Michael Kapralov and Rina Panigrahy. NNS lower bounds via metric expansion for $l_\infty$ and $EMD$
- Rahul Santhanam and Srikanth Srinivasan. On the Limits of Sparsification
- Szymon Toruńczyk. Languages of profinite words and the limitedness problem
- Matthew Patitz, Robert Schweller, Bin Fu and Robert Sheline. Self-Assembly with Geometric Tiles
- David Peleg, Liam Roditty and Elad Tal. Distributed Algorithms for Network Diameter and Girth
- Navendu Jain, Ishai Menache, Joseph Naor and F. Bruce Shepherd. Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks
- Barna Saha and Samir Khuller. Set Cover Revisited: Hypergraph Cover with Hard Capacities
- Yaoyun Shi and Xiaodi Wu. Epsilon-net method for optimizations over separable states
- Aditya Bhaskara, Moses Charikar, Rajsekar Manokaran and Aravindan Vijayaraghavan. Quadratic Programming with a Ratio Objective
- Tadeusz Litak, Dirk Pattinson, Katsuhiko Sano and Lutz Schröder. Coalgebraic Predicate Logic
- Dániel Marx. A Tight Lower Bound for Planar Multiway Cut with Fixed Number of Terminals
- Grigore Rosu and Andrei Stefanescu. Towards a Unified Theory of Operational and Axiomatic Semantics
- Maribel Fernandez and Albert Rubio. Nominal Completion for Rewrite Systems with Binders
- Andrew Berns, Sriram Pemmaraju and James Hegeman. Super-Fast Distributed Algorithms for Metric Facility Location
- Jaroslaw Byrka and Bartosz Rybicki. Improved LP-rounding approximation algorithm for $k$-level uncapacitated facility location
- Luca Gugelmann, Konstantinos Panagiotou and Ueli Peter. Hyperbolic Random Graphs: Degree Sequence and Clustering
- Marco Chiesa, Giuseppe Di Battista, Thomas Erlebach and Maurizio Patrignani. Computational Complexity of Traffic Hijacking under BGP and S-BGP
- Philip Klein and Dániel Marx. Solving planar $k$-terminal cut in $O(n^{c \sqrt{k}})$ time
- Adam Groce, Jonathan Katz, Aishwarya Thiruvengadam and Vassilis Zikas. Byzantine Agreement with a Rational Adversary
- Kshipra Bhawalkar, Jon Kleinberg, Kevin Lewi, Tim Roughgarden and Aneesh Sharma. Preventing Unraveling in Social Networks: The Anchored k-Core Problem
- Anupam Gupta and Kevin Lewi. The Online Metric Matching Problem for Doubling Metrics
- Dimitris Achlioptas and Ricardo Menchaca-Mendez. Unsatisfiability Bounds for Random CSPs from an Energetic Interpolation Method
- Prosenjit Bose, Sebastien Collette, Rolf Fagerberg and Stefan Langerman. De-amortizing Binary Search Trees
- Anil Ada, Arkadev Chattopadhyay, Omar Fawzi and Phuong Nguyen. The NOF Multiparty Communication Complexity of Composed Functions
- Christopher Broadbent. Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata
- Justin Thaler, Jonathan Ullman and Salil Vadhan. Faster Algorithms for Privately Releasing Marginals
- Anuj Dawar and Albert Atserias. Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers
- Uday Reddy and Brian Dunphy. An automata-theoretic model of Idealized Algol An automata-theoretic model of Idealized Algol