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 #51 to #100.

Min orderings and list homomorphism dichotomies for graphs and signed graphs: Label: en
Conflict-free coloring: graphs of bounded clique-width and intersection graphs: Label: en
The impacts of dimensionality, diffusion, and directedness on intrinsic cross-model simulation in tile-based self-assembly: Label: en
Generalized coloring of permutations: Label: en
Extending partial representations of circle graphs in near-linear time: Label: en
On the closures of monotone algebraic classes and variants of the determinant: Label: en
\( \alpha_i\)-metric graphs: radius, diameter and all eccentricities: Label: en
Embedding arbitrary Boolean circuits into fungal automata: Label: en
Analysing equilibrium states for population diversity: Label: en
Editor's note: special issue with GECCO 2021: Label: en
Diverse pairs of matchings: Label: en
Linear space data structures for finite groups with constant query-time: Label: en
Pattern masking for dictionary matching: theory and practice: Label: en
Finding optimal solutions with neighborly help: Label: en
Stable matchings, one-sided ties, and approximate popularity: Label: en
Minimal Roman dominating functions: extensions and enumeration: Label: en
The time complexity of consensus under oblivious message adversaries: Label: en
On the parameterized intractability of determinant maximization: Label: en
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