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 28 results in range #1 to #28.

Approximate Counting of Matchings in (3,3)-Hypergraphs: Label: en
Reduction Techniques for Graph Isomorphism in the Context of Width Parameters: Label: en
Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments: Label: en
Ranked Document Selection: Label: en
Quantum Algorithms for Matrix Products over Semirings: Label: en
Linear Time LexDFS on Cocomparability Graphs.: Label: en
Consistent Subset Sampling: Label: en
Assigning Channels via the Meet-in-the-Middle Approach: Label: en
Additive Spanners: A Simple Construction: Label: en
Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams: Label: en
Fast Dynamic Graph Algorithms for Parameterized Problems: Label: en
Colored Range Searching in Linear Space: Label: en
On Matchings and b-Edge Dominating Sets: A 2-Approximation Algorithm for the 3-Edge Dominating Set Problem: Label: en
Win-Win Kernelization for Degree Sequence Completion Problems: Label: en
Colorful Bin Packing: Label: en
Line-Distortion, Bandwidth and Path-Length of a Graph: Label: en
Separability of Imprecise Points: Label: en
Approximately Minwise Independence with Twisted Tabulation: Label: en
B-slack Trees: Space Efficient B-Trees: Label: en
Optimal Planar Orthogonal Skyline Counting Queries: Label: en
Competitive Online Routing on Delaunay Triangulations: Label: en
Reconfiguring Independent Sets in Claw-Free Graphs: Label: en
Approximating the Revenue Maximization Problem with Sharp Demands: Label: en
Trees and Co-trees with Bounded Degrees in Planar 3-connected Graphs: Label: en
New Approximability Results for the Robust k-Median Problem: Label: en
Amortized Analysis of Smooth Quadtrees in All Dimensions: Label: en
Expected Linear Time Sorting for Word Size Ω(log2 n loglogn): Label: en
I/O-Efficient Range Minima Queries: Label: en