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 #51 to #100.

SETH-based Lower Bounds for Subset Sum and Bicriteria Path: Label: en
I/O-Efficient Algorithms for Topological Sort and Related Problems: Label: en
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue: Label: en
Polynomial-time Algorithm for Maximum Weight Independent Set on P ₆ -free Graphs: Label: en
Dynamic Distribution-Sensitive Point Location: Label: en
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons: Label: en
Algorithms for Weighted Independent Transversals and Strong Colouring: Label: en
Dynamic Geometric Set Cover and Hitting Set: Label: en
Online Algorithms for Weighted Paging with Predictions: Label: en
Generic Techniques for Building Top- k Structures: Label: en
Tolerant Testers of Image Properties: Label: en
Tiling with Squares and Packing Dominos in Polynomial Time: Label: en
Fréchet Distance for Uncertain Curves: Label: en
Matching on the Line Admits no \(o(\sqrt {\log n})\) -Competitive Algorithm: Label: en
Towards Optimal Moment Estimation in Streaming and Distributed Models: Label: en
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs: Label: en
Competitive Online Search Trees on Trees: Label: en
Load Thresholds for Cuckoo Hashing with Overlapping Blocks: Label: en
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams: Label: en
Ranked Document Retrieval in External Memory: Label: en
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves: Label: en
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter: Label: en
Counting Homomorphic Cycles in Degenerate Graphs: Label: en
The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication: Label: en
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle: Label: en
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix: Label: en
Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election: Label: en
Point-Width and Max-CSPs: Label: en
A Complexity Theoretical Study of Fuzzy K -Means: Label: en
Edge Estimation with Independent Set Oracles: Label: en
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems: Label: en
Deterministic Sparse Suffix Sorting in the Restore Model: Label: en
Maximum Matching in the Online Batch-arrival Model: Label: en
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can): Label: en
A Colored Path Problem and Its Applications: Label: en
The Non-Uniform k -Center Problem: Label: en
Dynamic Parameterized Problems and Algorithms: Label: en
Approximate Single-Source Fault Tolerant Shortest Path: Label: en
Symmetry Exploitation for Online Machine Covering with Bounded Migration: Label: en
Parameterized Hardness of Art Gallery Problems: Label: en
Computing the Distance between Piecewise-Linear Bivariate Functions: Label: en
A Linear-Time Algorithm for Seeds Computation: Label: en
Race to idle: Label: en
Dynamic programming for graphs on surfaces: Label: en
Envy-free pricing in multi-item markets: Label: en
Socially desirable approximations for dodgson’s voting rule: Label: en
Price-based protocols for fair resource allocation: Label: en
Geometric optimization and sums of algebraic functions: Label: en
Weighted popular matchings: Label: en
A logarithmic approximation for unsplittable flow on line graphs: Label: en