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.

Diverse fair allocations: complexity and algorithms: Label: en
Rectilinear Voronoi games with a simple rectilinear obstacle in plane: Label: en
Arbitrary-oriented color spanning region for line segments: Label: en
Algorithms for \(k\)-dispersion for points in convex position in the plane: Label: en
Resource management in device-to-device communications: Label: en
Fault-tolerant dispersion of mobile robots: Label: en
Optimal length cutting plane refutations of integer programs: Label: en
Efficient reductions and algorithms for subset product: Label: en
Structural parameterization of alliance problems: Label: en
Axiomatic characterization of the toll walk function of some graph classes: Label: en
Graph covering using bounded size subgraphs: Label: en
Maximum subgraph problem for 3-regular Knödel graphs and its wirelength: Label: en
Transitivity on subclasses of chordal graphs: Label: en
Minimum maximal acyclic matching in proper interval graphs: Label: en
Algorithms and complexity of strongly stable non-crossing matchings: Label: en
Latin hexahedra and related combinatorial structures: Label: en
Complexity results on cosecure domination in graphs: Label: en
Mind the gap: edge facility location problems in theory and practice: Label: en
Cops and robber on oriented graphs with respect to push operation: Label: en
Relation between broadcast domination and multipacking numbers on chordal graphs: Label: en
Computational aspects of double dominating sequences in graphs: Label: en
On three domination-based identification problems in block graphs: Label: en
Cyclability, connectivity and circumference: Label: en
Monitoring edge-geodetic sets in graphs: Label: en
Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs: Label: en
Short cycles dictate dichotomy status of the Steiner tree problem on bisplit graphs: Label: en
The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures: Label: en
Coloring of a superclass of \(2K_2\)-free graphs: Label: en
On coupon coloring of Cayley graphs: Label: en
Perfectness of \(G\)-generalized join of graphs: Label: en
On structural parameterizations of star coloring: Label: en
On locally identifying coloring of graphs: Label: en
5-list coloring toroidal 6-regular triangulations in linear time: Label: en
New bounds and constructions for neighbor-locating colorings of graphs: Label: en
Approximation algorithms in graphs with known broadcast time of the base graph: Label: en
On the approximability of path and cycle problems in arc-dependent networks: Label: en
Parameterized intractability of defensive alliance problem: Label: en
On fair division with binary valuations respecting social networks: Label: en
Hardness and approximation results for some variants of stable marriage problem: Label: en
Algebraic algorithms for variants of subset sum: Label: en
Algorithms for online car-sharing problem: Label: en
Approximation and parameterized algorithms for balanced connected partition problems: Label: en
Voronoi games using geodesics: Label: en
Bounds and algorithms for geodetic hulls: Label: en
Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance: Label: en
Covering a graph with densest subgraphs: Label: en
An output-sensitive algorithm for all-pairs shortest paths in directed acyclic graphs: Label: en
On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs: Label: en
P versus NPC: minimum Steiner trees in convex split graphs: Label: en
\(B_0\)-VPG representation of AT-free outerplanar graphs: Label: en