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.

On the parameterized complexity of compact set packing: Label: en
Roman \(k\)-domination: hardness, approximation and parameterized results: Label: en
Groups burning: analyzing spreading processes in community-based networks: Label: en
Recognizing when a preference system is close to admitting a master list: Label: en
Interweaving real-time jobs with energy harvesting to maximize throughput: Label: en
Parameterized complexity of path set packing: Label: en
Parameterized complexity of optimizing list vertex-coloring through reconfiguration: Label: en
On star-multi-interval pairwise compatibility graphs: Label: en
On the complexity of distance-\(d\) independent set reconfiguration: Label: en
Some algorithmic results for eternal vertex cover problem in graphs: Label: en
Certifying induced subgraphs in large graphs: Label: en
Splitting plane graphs to outerplanarity: Label: en
\(k\)-Transmitter watchman routes: Label: en
Reconfiguration of vertex-disjoint shortest paths on graphs: Label: en
Energy efficient sorting, selection and searching: Label: en
Better hardness results for the minimum spanning tree congestion problem: Label: en
Efficient non-isomorphic graph enumeration algorithms for subclasses of perfect graphs: Label: en
Finding the cyclic covers of a string: Label: en
Inferring strings from position heaps in linear time: Label: en
On the longest flip sequence to untangle segments in the plane: Label: en
Improved and generalized algorithms for burning a planar point set: Label: en
Reflective guarding a gallery: Label: en
Piercing diametral disks induced by edges of maximum spanning trees: Label: en
Away from each other: Label: en
Flipping plane spanning paths: Label: en
Overlapping edge unfoldings for Archimedean solids and (anti)prisms: Label: en
Minimum ply covering of points with unit squares: Label: en
The family of fan-planar graphs: Label: en
Parity permutation pattern matching: Label: en
Structural parameterization of cluster deletion: Label: en
Graph covers: where topology meets computer science, and simple means difficult: Label: en
Linear-Time 3-Approximation Algorithm for the r-Star Covering Problem: Label: en
Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs: Label: en
Four-Connected Spanning Subgraphs of Doughnut Graphs: Label: en
A Compact Encoding of Plane Triangulations with Efficient Query Supports: Label: en
Computing Nice Projections of Convex Polyhedra: Label: en
Guarding Exterior Region of a Simple Polygon: Label: en
Upward Drawings of Trees on the Minimum Number of Layers: Label: en
Computing β-Drawings of 2-Outerplane Graphs in Linear Time: Label: en
Cover Ratio of Absolute Neighbor: Label: en
A Fast Algorithm to Calculate Powers of a Boolean Matrix for Diameter Computation of Random Graphs: Label: en
Indexing Circular Patterns: Label: en
On the Approximability of Comparing Genomes with Duplicates: Label: en
Simple Geometrical Intersection Graphs: Label: en
Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis: Label: en
Vertex Domination in Dynamic Networks: Label: en
Multilevel Bandwidth and Radio Labelings of Graphs: Label: en
Pairwise Compatibility Graphs: Label: en
Listing All Plane Graphs: Label: en
On Certain New Models for Paging with Locality of Reference: Label: en