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.

Nondecreasing paths in a weighted graph or: how to optimally read a train schedule: Label: en
Geodesic Delaunay triangulations in bounded planar domains: Label: en
On the bichromatic \(k\)-set problem: Label: en
Competitive weighted throughput analysis of greedy protocols on dags: Label: en
An explicit universal cycle for the \((n-1)\)-permutations of an \(n\)-set: Label: en
Finding heaviest \(H\)-subgraphs in real weighted graphs, with applications: Label: en
Dial a ride from \(k\)-forest: Label: en
A \(4k^2\) kernel for feedback vertex set: Label: en
Shortest paths in directed planar graphs with negative lengths: a linear-space \(O(n\log^{2} n)\)-time algorithm: Label: en
Editorial note: Label: en
Inverse auctions, injecting unique minima into random sets: Label: en
Exponential time algorithms for the \textsc{minimum dominating set} problem on some graph classes: Label: en
Minimum cycle bases, faster and simpler: Label: en
Updating relaxed \(K\)-d trees: Label: en
A generalized minimum cost \(k\)-clustering: Label: en
An \(O(n\log n)\) approximation scheme for Steiner tree in planar graphs: Label: en
Squarepants in a tree, sum of subtree clustering and hyperbolic pants decomposition: Label: en
Compacting cuts. A new linear formulation for minimum cut: Label: en
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