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.

Maximizing Symmetric Submodular Functions: Label: en
Mixing Color Coding-Related Techniques: Label: en
Trip-Based Public Transit Routing: Label: en
Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms: Label: en
Ignorant vs. Anonymous Recommendations: Label: en
D 3-Tree: A Dynamic Deterministic Decentralized Structure: Label: en
Incidences with Curves in ℝ d: Label: en
A Multivariate Approach for Weighted FPT Algorithms: Label: en
Improved Approximation Algorithms for Weighted 2-Path Partitions: Label: en
I/O-Efficient Similarity Join: Label: en
Efficient Computation of Middle Levels Gray Codes: Label: en
Geometric Hitting Sets for Disks: Theory and Practice: Label: en
Compressed Data Structures for Dynamic Sequences: Label: en
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty: Label: en
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams: Label: en
A Lasserre Lower Bound for the Min-Sum Single Machine Scheduling Problem: Label: en
Maximum Matching in Turnstile Streams: Label: en
Quicksort, Largest Bucket, and Min-Wise Hashing with Limited Independence: Label: en
On the Pathwidth of Almost Semicomplete Digraphs: Label: en
Welfare Maximization with Deferred Acceptance Auctions in Reallocation Problems: Label: en
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity: Label: en
Fast Output-Sensitive Matrix Multiplication: Label: en
On the Equivalence among Problems of Bounded Width: Label: en
Faster Fully-Dynamic Minimum Spanning Forest: Label: en
Monotone Drawings of 3-Connected Plane Graphs: Label: en
Approximation Algorithms for Polynomial-Expansion and Low-Density Graphs: Label: en
The Offset Filtration of Convex Objects: Label: en
Online Appointment Scheduling in the Random Order Model: Label: en
Structural Parameterizations of the Mixed Chinese Postman Problem: Label: en
Improved Analysis of Complete-Linkage Clustering: Label: en
How to Sort by Walking on a Tree: Label: en
The Temp Secretary Problem: Label: en
Faster and More Dynamic Maximum Flow by Incremental Breadth-First Search: Label: en
A Characterization of Visibility Graphs for Pseudo-polygons: Label: en
A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations: Label: en
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs: Label: en
Medial Axis Based Routing Has Constant Load Balancing Factor: Label: en
Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints: Label: en
Approximating LZ77 via Small-Space Multiple-Pattern Matching: Label: en
Smoothed Analysis of the Squared Euclidean Maximum-Cut Problem: Label: en
Prophet Secretary: Label: en
Approximate Deadline-Scheduling with Precedence Constraints: Label: en
Selfish Vector Packing: Label: en
The Price of Matching with Metric Preferences: Label: en
Node-Balancing by Edge-Increments: Label: en
Polymatroid Prophet Inequalities: Label: en
A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface: Label: en
Dictionary Matching in a Stream: Label: en
On the Efficiency of All-Pay Mechanisms: Label: en
A Characterization of Consistent Digital Line Segments in ℤ2: Label: en