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.

Better hardness results for the minimum spanning tree congestion problem: Label: en
Euclidean maximum matchings in the plane -- local to global: Label: en
Online paging with heterogeneous cache slots: Label: en
AntiFactor is FPT parameterized by treewidth and list size (but counting is hard): Label: en
On scheduling mechanisms beyond the worst case: Label: en
Energy constrained depth first search: Label: en
Recovering the original simplicity: succinct and exact quantum algorithm for the welded tree problem: Label: en
Permutation-constrained common string partitions with applications: Label: en
Reachability of fair allocations via sequential exchanges: Label: en
On flipping the Fréchet distance: Label: en
Semi-streaming algorithms for submodular function maximization under \(b\)-matching, matroid, and matchoid constraints: Label: en
On the parameterized complexity of compact set packing: Label: en
Ultimate greedy approximation of independent sets in subcubic graphs: Label: en
Testing connectedness of images: Label: en
Romeo and Juliet meeting in forest like regions: Label: en
Connected \(k\)-center and \(k\)-diameter clustering: Label: en
Algorithmic meta-theorems for combinatorial reconfiguration revisited: Label: en
A framework for adversarial streaming via differential privacy and difference estimators: Label: en
Reconfiguring shortest paths in graphs: Label: en
Parameterized complexity of reconfiguration of atoms: Label: en
Runtime analysis of quality diversity algorithms: Label: en
On the parameterized complexity of bend-minimum orthogonal planarity: Label: en
The complexity of finding and enumerating optimal subgraphs to represent spatial correlation: Label: en
Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs: Label: en
Tight runtime bounds for static unary unbiased evolutionary algorithms on linear functions: Label: en
Minimizing energy consumption for real-time tasks on heterogeneous platforms under deadline and reliability constraints: Label: en
On a traveling salesman problem for points in the unit cube: Label: en
Non-crossing Hamiltonian paths and cycles in output-polynomial time: Label: en
New partitioning techniques and faster algorithms for approximate interval scheduling: Label: en
Sublinear algorithms in \(T\)-interval dynamic networks: Label: en
Stagnation detection in highly multimodal fitness landscapes: Label: en
Parameterized complexity of streaming diameter and connectivity problems: Label: en
Approximation algorithms for the two-watchman route in a simple polygon: Label: en
Algorithms for matrix multiplication via sampling and opportunistic matrix multiplication: Label: en
Online unit profit knapsack with predictions: Label: en
Approximate and randomized algorithms for computing a second Hamiltonian cycle: Label: en
Online geometric covering and piercing: Label: en
Slim tree-cut width: Label: en
Approximating long cycle above Dirac's guarantee: Label: en
New algorithms for Steiner tree reoptimization: Label: en
Approximation algorithms for covering vertices by long paths: Label: en
Parity permutation pattern matching: Label: en
Improved approximation algorithms by generalizing the primal-dual method beyond uncrossable functions: Label: en
Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants: Label: en
Sample-based distance-approximation for subsequence-freeness: Label: en
Fourier analysis meets runtime analysis: precise runtimes on plateaus: Label: en
Nearly time-optimal kernelization algorithms for the line-cover problem with big data: Label: en
Planar drawings with few slopes of Halin graphs and nested pseudotrees: Label: en
Online multiset submodular cover: Label: en
Runtime analysis of competitive co-evolutionary algorithms for maximin optimisation of a bilinear function: Label: en