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.

Average Case Analysis of Java 7’s Dual Pivot Quicksort: Label: en
Maximum Flow Networks for Stability Analysis of LEGO®Structures: Label: en
FPT Algorithms for Domination in Biclique-Free Graphs: Label: en
TSP Tours in Cubic Graphs: Beyond 4/3: Label: en
A Self-adjusting Data Structure for Multidimensional Point Sets: Label: en
On Computing Straight Skeletons by Means of Kinetic Triangulations: Label: en
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives: Label: en
Succinct Posets: Label: en
Colouring AT-Free Graphs: Label: en
Minimum Average Distance Triangulations: Label: en
A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization: Label: en
Extending Partial Representations of Function Graphs and Permutation Graphs: Label: en
Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates: Label: en
Efficient Communication Protocols for Deciding Edit Distance: Label: en
Solving Simple Stochastic Games with Few Coin Toss Positions: Label: en
Parameterized Complexity of Induced H-Matching on Claw-Free Graphs: Label: en
Improved Implementation of Point Location in General Two-Dimensional Subdivisions: Label: en
Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness: Label: en
Approximation of Minimum Cost Homomorphisms: Label: en
Succinct Data Structures for Path Queries: Label: en
Resource Buying Games: Label: en
Approximating Earliest Arrival Flows in Arbitrary Networks: Label: en
Maximum Multicommodity Flows over Time without Intermediate Storage: Label: en
On Min-Power Steiner Tree: Label: en
Induced Disjoint Paths in Claw-Free Graphs: Label: en
Optimizing over the Growing Spectrahedron: Label: en
An Experimental Study of Dynamic Dominators: Label: en
A Polynomial Kernel for Proper Interval Vertex Deletion: Label: en
Lines through Segments in 3D Space: Label: en
Faster Geometric Algorithms via Dynamic Determinant Computation: Label: en
Embedding Paths into Trees: VM Placement to Minimize Congestion: Label: en
On the Complexity of Metric Dimension: Label: en
Better Bounds for Graph Bisection: Label: en
Finding Social Optima in Congestion Games with Positive Externalities: Label: en
Kinetic Compressed Quadtrees in the Black-Box Model with Applications to Collision Detection for Low-Density Scenes: Label: en
A Dual-Fitting $\frac{3}{2}$ -Approximation Algorithm for Some Minimum-Cost Graph Problems: Label: en
A Path-Decomposition Theorem with Applications to Pricing and Covering on Trees: Label: en
The Quantum Query Complexity of Read-Many Formulas: Label: en
Improved Distance Oracles and Spanners for Vertex-Labeled Graphs: Label: en
Optimal Lower Bound for Differentially Private Multi-party Aggregation: Label: en
Optimizing Social Welfare for Network Bargaining Games in the Face of Unstability, Greed and Spite: Label: en
Revenue Guarantees in Sponsored Search Auctions: Label: en
The Clique Problem in Ray Intersection Graphs: Label: en
Two Dimensional Range Minimum Queries and Fibonacci Lattices: Label: en
The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations: Label: en
Span Programs and Quantum Algorithms for st-Connectivity and Claw Detection: Label: en
New Lower and Upper Bounds for Representing Sequences: Label: en
Time-Dependent Route Planning with Generalized Objective Functions: Label: en
A Bicriteria Approximation for the Reordering Buffer Problem: Label: en
Weighted Geometric Set Multi-cover via Quasi-uniform Sampling: Label: en