Entity usage

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

Showing below up to 50 results in range #1 to #50.

Efficient Low-Redundancy Codes for Correcting Multiple Deletions: Label: en
Lower bounds for the parameterized complexity of Minimum Fill-In and other completion problems: Label: en
Directed multicut is W[1]-hard, even for four terminal pairs: Label: en
Algorithmic and Enumerative Aspects of the Moser-Tardos Distribution: Label: en
Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform: Label: en
Approximately Efficient Double Auctions with Strong Budget Balance: Label: en
On the Economic Efficiency of the Combinatorial Clock Auction: Label: en
Gowers Norm, Function Limits, and Parameter Estimation: Label: en
Clustering Problems on Sliding Windows: Label: en
Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover: Label: en
Maximum Matchings in Dynamic Graph Streams and the Simultaneous Communication Model: Label: en
Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams: Label: en
Algorithmic Complexity of Power Law Networks: Label: en
A Faster Subquadratic Algorithm for Finding Outlier Correlations: Label: en
Higher Lower Bounds from the 3SUM Conjecture: Label: en
Subtree Isomorphism Revisited: Label: en
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky: Label: en
Persistent Homology and Nested Dissection: Label: en
A Fast and Simple Algorithm for Computing Approximate Euclidean Minimum Spanning Trees: Label: en
Improved Deterministic Algorithms for Linear Programming in Low Dimensions: Label: en
Approximating the k-Level in Three-Dimensional Plane Arrangements: Label: en
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles: Label: en
Raising The Bar For V<scp>ertex</scp> C<scp>over</scp>: Fixed-parameter Tractability Above A Higher Guarantee: Label: en
Subexponential parameterized algorithm for Interval Completion: Label: en
Linear Recognition of Almost Interval Graphs: Label: en
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique: Label: en
The matching problem has no small symmetric SDP: Label: en
An Improved Approximation Guarantee for the Maximum Budgeted Allocation Problem: Label: en
Finding a Stable Allocation in Polymatroid Intersection: Label: en
Online Contention Resolution Schemes: Label: en
Multiscale Mapper: Topological Summarization via Codomain Covers: Label: en
Windrose Planarity: Embedding Graphs with Direction-Constrained Edges: Label: en
Treetopes and their Graphs: Label: en
Beyond the Richter-Thomassen Conjecture: Label: en
Computing in continuous space with self-assembling polygonal tiles (extended abstract): Label: en
Permutation patterns are hard to count: Label: en
Efficient Quantum Algorithms for (Gapped) Group Testing and Junta Testing: Label: en
Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields: Label: en
Near-Optimal Light Spanners: Label: en
On Notions of Distortion and an Almost Minimum Spanning Tree with Constant Average Distortion: Label: en
Better Distance Preservers and Additive Spanners: Label: en
Error Amplification for Pairwise Spanner Lower Bounds: Label: en
Approximating Low-Stretch Spanners: Label: en
Constant Factor Approximation for Subset Feedback Set Problems via a new LP relaxation: Label: en
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut: Label: en
Approximating capacitated k-median with (1 + ∊)k open facilities: Label: en
Clustering time series under the Fréchet distance: Label: en
Reducing Curse of Dimensionality: Improved PTAS for TSP (with Neighborhoods) in Doubling Metrics: Label: en
On Dynamic Approximate Shortest Paths for Planar Graphs with Worst-Case Costs: Label: en
Dynamic DFS in Undirected Graphs: breaking the O(m) barrier: Label: en