Approximately Counting Locally-Optimal Structures

Counting Homomorphisms to Square-Free Graphs, Modulo 2

Big Data on the Rise: Testing monotonicity of distributions

Approximately Counting H-Colourings is #BIS-Hard

Serving in the Dark should be done Non-Uniformly

Weighted Reordering Buffer Improved via Variants of Knapsack Covering Inequalities

Query Complexity in expectation

Uniform Kernelization Complexity of Hitting Forbidden Minors

On the Randomized Competitive Ratio of Reordering Buffer Management with Non-Uniform Costs

Unit Interval Editing is Fixed-Parameter Tractable

A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs

On Planar Boolean CSP

Shortest reconfiguration paths in the solution space of Boolean formulas

Quantifying Competitiveness in Paging with Locality of Reference

Hollow heaps

Replacing Mark Bits with Randomness in Fibonacci Heaps

On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace

Tighter Fourier Transform Complexity Tradeoffs

The Parity of Set Systems under Random Restrictions with Applications to Exponential Time Problems

Spotting Trees with Few Leaves

Taylor Polynomial Estimator for Estimating Frequency Moments

Solving Linear Programming with Constraints Unknown

Parameterized single-exponential time polynomial space algorithm for Steiner Tree

Lower Bounds for the Graph Homomorphism Problem

Near-optimal Upper Bound on Fourier dimension of Boolean Functions in terms of Fourier sparsity

Comparator Circuits over Finite Bounded Posets

Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources

The Simultaneous Communication of Disjointness with Applications to Data Streams

A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs

Fully Dynamic Matching in Bipartite Graphs

Deterministic Truncation of Linear Matroids

A (2+epsilon)-Approximation Algorithm for the Storage Allocation Problem

Finding the Median (Obliviously) with Bounded Space

Popular matchings with one-sided ties

Near-Linear Query Complexity for Graph Inference

Ground state connectivity of local Hamiltonians

An Optimal Algorithm for Minimum-Link Rectilinear Paths in Rectilinear Domains

Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic

Hardness Amplification and the Approximate Degree of Constant-Depth Circuits

Fast Algorithms for Diameter-Optimally Augmenting Trees

Batched Point Location in SINR Diagrams via Algebraic Tools

Linear-time list recovery of high-rate expander codes

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median

Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs

Finding a Path in Group-Labeled Graphs with Two Labels Forbidden

Approximating CSPs using LP Relaxation

Design of Dynamic Algorithms via Primal-Dual Method

An Improved Combinatorial Algorithm for Boolean Matrix Multiplication

2-Vertex Connectivity in Directed Graphs

Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points

Separate, Measure and Conquer: Faster Algorithms for Max 2-CSP and Counting Dominating Sets

On Temporal Graph Exploration

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time

A PTAS for the Weighted Unit Disk Cover Problem

Feasible Interpolation for QBF Resolution Calculi

ETR-Completeness for Decision Versions of Multi-Player (Symmetric) Nash Equilibria

Relative discrepancy does not separate information and communication complexity

Block interpolation: A framework for tight exponential-time counting complexity

Mind Your Coins: Fully Leakage-Resilient Signatures with Graceful Degradation

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy

Binary pattern tile set synthesis is NP-hard

Multilinear Pseudorandom Functions

Linear Time Parameterized Algorithms for SUBSET FEEDBACK VERTEX SET

What percentage of programs halt?

Local reductions

Streaming Algorithms for Submodular Function Maximization

Envy-Free Pricing in Large Markets: Approximating Revenue and Welfare

Constraint Satisfaction Problems Over The Integers with Successor

Limitations of Algebraic Approaches to Graph Isomorphism Testing

Scheduling Bidirectional Traffic on a Path

A Galois Connection for Valued Constraint Languages of Infinite Size

Zero-Fixing Extractors for Sub-Logarithmic Entropy

Condensed Unpredictability

Approximation Algorithms for Computing Maximin Share Allocations

Submatrix Maximum Queries in Monge Matrices are Equivalent to Predecessor Searching

Computing Frechet distance between higher-dimensional objects

Sherali-Adams relaxations for valued CSPs

Lower Bounds for sums of powers of low degree univariates

Statistical Randomized Encodings: A Complexity Theoretic View

Simultaneous Approximation of Constraint Satisfaction Problems

Algebraic Properties of Valued Constraint Satisfaction Problem

Amplification of One-Way Information Complexity via Codes and Noise Sensitivity

Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm

An Improved Private Mechanism for Small Databases

On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols

Interactive proofs with approximately commuting provers

Algorithms and complexity for Turaev-Viro invariants

Optimal Encodings for Range Top-k, Selection, and Min-Max