Pages that link to "Item:Q5454268"
From MaRDI portal
The following pages link to The Complexity of Combinatorial Optimization Problems on <i>d</i>‐Dimensional Boxes (Q5454268):
Displayed 13 items.
- Combinatorial problems on \(H\)-graphs (Q1689915) (← links)
- On independent set in \(B_1\)-EPG graphs (Q2174555) (← links)
- Hardness and approximation for L-EPG and \(B_1\)-EPG graphs (Q2184686) (← links)
- The maximum clique problem in multiple interval graphs (Q2350898) (← links)
- Bounded clique cover of some sparse graphs (Q2359963) (← links)
- Complexity aspects of variants of independent Roman domination in graphs (Q2666348) (← links)
- Geometric Packing under Nonuniform Constraints (Q4593249) (← links)
- Independent roman $\{3\}$-domination (Q5103952) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- Finding a Maximum Clique in a Grounded 1-Bend String Graph (Q5886042) (← links)
- On \(H\)-topological intersection graphs (Q5925535) (← links)
- On the kernel and related problems in interval digraphs (Q6103517) (← links)