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.

Routing in multimodal transportation networks with non-scheduled lines: Label: en
Random projections for linear programming: an improved retrieval phase: Label: en
An experimental evaluation of semidefinite programming and spectral algorithms for max cut: Label: en
Finding the \(k\) shortest simple paths: time and space trade-offs: Label: en
Experimental comparison of PC-trees and PQ-trees: Label: en
A constructive heuristic for the uniform capacitated vertex \(k\)-center problem: Label: en
A data-dependent approach for high-dimensional (robust) Wasserstein alignment: Label: en
Algorithms for efficiently computing structural anonymity in complex networks: Label: en
Minimum partition into plane subgraphs: the CG:SHOP challenge 2022: Label: en
SAT-boosted tabu search for coloring massive graphs: Label: en
Fingerprinting-based minimal perfect hashing revisited: Label: en
Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring: Label: en
A practical algorithm for volume estimation based on billiard trajectories and simulated annealing: Label: en
Bounded-degree plane geometric spanners in practice: Label: en
Optimal Area Polygonization by Triangulation and Visibility Search: Label: en
Coordinated Path Planning through Local Search and Simulated Annealing: Label: en
Coordinated Motion Planning Through Randomized k -Opt: Label: en
Shadoks Approach to Low-Makespan Coordinated Motion Planning: Label: en
Using Incremental Many-to-One Queries to Build a Fast and Tight Heuristic for A* in Road Networks: Label: en
Incremental Updates of Generalized Hypertree Decompositions: Label: en
High-Quality Hypergraph Partitioning: Label: en
On Computing the Diameter of (Weighted) Link Streams: Label: en
Minimum Scan Cover and Variants: Theory and Experiments: Label: en
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity: Label: en
Parallel Five-cycle Counting Algorithms: Label: en
O’Reach: Even Faster Reachability in Large Graphs: Label: en
Toward an Understanding of Long-tailed Runtimes of SLS Algorithms: Label: en
Enumeration of Far-apart Pairs by Decreasing Distance for Faster Hyperbolicity Computation: Label: en
Algorithms and Data Structures for Hyperedge Queries: Label: en
Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis: Label: en
Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide: Label: en
Grammar Compression by Induced Suffix Sorting: Label: en
Buffered Streaming Graph Partitioning: Label: en
Comments on “An Exact Method for the Minimum Feedback Arc Set Problem”: Label: en
On Symmetric Rectilinear Partitioning: Label: en
An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling: Label: en
A Batch-dynamic Suitor Algorithm for Approximating Maximum Weighted Matching: Label: en
Computing Autotopism Groups of Partial Latin Rectangles: Label: en
Minimum Spanning Tree under Explorable Uncertainty in Theory and Experiments: Label: en
Hyperbolic Embeddings for Near-Optimal Greedy Routing: Label: en
An Experimental Study of Algorithms for Online Bipartite Matching: Label: en
Adaptive Cuckoo Filters: Label: en
Generating Difficult CNF Instances in Unexplored Constrainedness Regions: Label: en
Dynamic Path-decomposed Tries: Label: en
Better Process Mapping and Sparse Quadratic Assignment: Label: en
ILP-Based Local Search for Graph Partitioning: Label: en
Property Suffix Array with Applications in Indexing Weighted Sequences: Label: en
Xor Filters: Label: en
A Sequential Importance Sampling Algorithm for Counting Linear Extensions: Label: en
New heuristic and interactive approaches to 2D rectangular strip packing: Label: en