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.

Recognizing k -Leaf Powers in Polynomial Time, for Constant k: Label: en
Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings: Label: en
Synchronized Planarity with Applications to Constrained Planarity Problems: Label: en
String Indexing with Compressed Patterns: Label: en
A Polynomial-Time Algorithm for 1/3-Approximate Nash Equilibria in Bimatrix Games: Label: en
Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable: Label: en
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs: Label: en
On the Complexity of String Matching for Graphs: Label: en
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension: Label: en
Online Metric Algorithms with Untrusted Predictions: Label: en
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?: Label: en
A PTAS for Capacitated Vehicle Routing on Trees: Label: en
Approximating Pathwidth for Graphs of Small Treewidth: Label: en
Universal Algorithms for Clustering Problems: Label: en
PTAS for Sparse General-valued CSPs: Label: en
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions: Label: en
Robust Algorithms for TSP and Steiner Tree: Label: en
Polynomial Kernel for Interval Vertex Deletion: Label: en
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden: Label: en
A Linear-Time n ^0.4 -Approximation for Longest Common Subsequence: Label: en
Competitive Algorithms for Generalized k -Server in Uniform Metrics: Label: en
Reliable Spanners for Metric Spaces: Label: en
Tightening Curves on Surfaces Monotonically with Applications: Label: en
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes: Label: en
Detecting Feedback Vertex Sets of Size k in O ^⋆ (2.7 k ) Time: Label: en
Sticky Brownian Rounding and its Applications to Constraint Satisfaction Problems: Label: en
Exponential Separations in Local Privacy: Label: en
A Lower Bound on Cycle-Finding in Sparse Digraphs: Label: en
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020: Label: en
A Generalization of Self-Improving Algorithms: Label: en
Rapid Mixing from Spectral Independence beyond the Boolean Domain: Label: en
Hypergraph Isomorphism for Groups with Restricted Composition Factors: Label: en
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead: Label: en
Deterministic Leader Election in Anonymous Radio Networks: Label: en
A Learned Approach to Design Compressed Rank/Select Data Structures: Label: en
A Faster Algorithm for Finding Tarski Fixed Points: Label: en
Network Design for s - t Effective Resistance: Label: en
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms: Label: en
Improving the Dilation of a Metric Graph by Adding Edges: Label: en
Efficient Shortest Paths in Scale-Free Networks with Underlying Hyperbolic Geometry: Label: en
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time: Label: en
Constant-time Dynamic (Δ +1)-Coloring: Label: en
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems: Label: en
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth: Label: en
Time Dependent Biased Random Walks: Label: en
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n ^4/3: Label: en
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time: Label: en
Max Flows in Planar Graphs with Vertex Capacities: Label: en
Tight Bounds for ℓ ₁ Oblivious Subspace Embeddings: Label: en
Optimal Las Vegas Approximate Near Neighbors in ℓ _p : Label: en