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.

Approximation Algorithms for Multiprocessor Scheduling with Testing to Minimize the Total Job Completion Time: Label: en
Theoretical Analysis of Git Bisect: Label: en
Stochastic Variance Reduction for DR-Submodular Maximization: Label: en
Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs: Label: en
Exploration of High-Dimensional Grids by Finite State Machines: Label: en
Improved FPT Algorithms for Deletion to Forest-Like Structures: Label: en
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity: Label: en
Truthful Matching with Online Items and Offline Agents: Label: en
Predecessor on the Ultra-Wide Word RAM: Label: en
Approximations for Throughput Maximization: Label: en
On Structural Parameterizations of the Harmless Set Problem: Label: en
Domination and Cut Problems on Chordal Graphs with Bounded Leafage: Label: en
Computing generalized convolutions faster than brute force: Label: en
On parameterized complexity of binary networked public goods game: Label: en
Computing and listing avoidable vertices and paths: Label: en
The need for seed (in the abstract Tile Assembly Model): Label: en
Refined bounds on the number of Eulerian tours in undirected graphs: Label: en
Fully dynamic \(k\)-center clustering with outliers: Label: en
Extended MSO model checking via small vertex integrity: Label: en
A semi brute-force search approach for (balanced) clustering: Label: en
Runtime analysis for permutation-based evolutionary algorithms: Label: en
Simulated annealing is a polynomial-time approximation scheme for the minimum spanning tree problem: Label: en
Analysis of surrogate-assisted information-geometric optimization algorithms: Label: en
An extended jump functions benchmark for the analysis of randomized search heuristics: Label: en
Counting cycles on planar graphs in subexponential time: Label: en
Token sliding on graphs of girth five: Label: en
Recognizing map graphs of bounded treewidth: Label: en
A meta-theorem for distributed certification: Label: en
Randomized strategies for robust combinatorial optimization with approximate separation: Label: en
Self-adjusting population sizes for non-elitist evolutionary algorithms: why success rates matter: Label: en
On the \(d\)-claw vertex deletion problem: Label: en
Polynomial-time combinatorial algorithm for general max-min fair allocation: Label: en
Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution: Label: en
More precise runtime analyses of non-elitist evolutionary algorithms in uncertain environments: Label: en
Lower bounds from fitness levels made easy: Label: en
Computing balanced convex partitions of lines: Label: en
Algorithms for \(p\)-Faulty Search on a half-line: Label: en
Guest editorial: Special issue on theoretical informatics: Label: en
Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs: Label: en
Unique assembly verification in two-handed self-assembly: Label: en
Improved Merlin-Arthur protocols for central problems in fine-grained complexity: Label: en
Resource-constrained scheduling algorithms for stochastic independent tasks with unknown probability distribution: Label: en
Intersecting longest cycles in Archimedean tilings: Label: en
A color-avoiding approach to subgraph counting in bounded expansion classes: Label: en
Near-optimal quantum algorithms for string problems: Label: en
Online minimization of the maximum starting time: migration helps: Label: en
Farthest-point Voronoi diagrams in the presence of rectangular obstacles: Label: en
On the complexity of binary polynomial optimization over acyclic hypergraphs: Label: en
On maximizing sums of non-monotone submodular and linear functions: Label: en
A deterministic parallel reduction from weighted matroid intersection search to decision: Label: en