The following pages link to Interval graphs and maps of DNA (Q1071684):
Displayed 18 items.
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Some approximation algorithms for the clique partition problem in weighted interval graphs (Q995565) (← links)
- Mapping DNA by stochastic relaxation (Q1099802) (← links)
- Multiple solutions of DNA restriction mapping problems (Q1190148) (← links)
- Convex and isometric domination of (weak) dominating pair graphs (Q1749540) (← links)
- Canonical representations for circular-arc graphs using flip sets (Q1799215) (← links)
- DNA physical mapping and alternating Eulerian cycles in colored graphs (Q1902468) (← links)
- Interval graph limits (Q1950423) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- PATHWIDTH AND LAYERED DRAWINGS OF TREES (Q4652929) (← links)
- Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)