Pages that link to "Item:Q1338883"
From MaRDI portal
The following pages link to On the complexity of DNA physical mapping (Q1338883):
Displayed 43 items.
- Exact algorithms for intervalizing coloured graphs (Q255264) (← links)
- Planar disjoint-paths completion (Q329285) (← links)
- Threshold-coloring and unit-cube contact representation of planar graphs (Q344821) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- Complexity issues for the sandwich homogeneous set problem (Q531596) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Additive approximation of generalized Turán questions (Q832525) (← links)
- Near-optimal solutions for the generalized max-controlled set problem (Q976048) (← links)
- Hardness of edge-modification problems (Q1034612) (← links)
- Matrix sandwich problems (Q1307537) (← links)
- Characterizations and algorithmic applications of chordal graph embeddings (Q1372739) (← links)
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- The graph sandwich problem for 1-join composition is NP-complete (Q1613390) (← links)
- Interval graph limits (Q1950423) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- A general method for forbidden induced subgraph sandwich problem NP-completeness (Q2132372) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Obtaining matrices with the consecutive ones property by row deletions (Q2343088) (← links)
- Tractability and hardness of flood-filling games on trees (Q2344738) (← links)
- Can transitive orientation make sandwich problems easier? (Q2370442) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- A polynomial-time algorithm for outerplanar diameter improvement (Q2402366) (← links)
- Good characterizations and linear time recognition for 2-probe block graphs (Q2403805) (← links)
- Recognition of probe proper interval graphs (Q2440119) (← links)
- NP-completeness results for edge modification problems (Q2500532) (← links)
- Characterizing and recognizing probe block graphs (Q2513611) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
- An integer programming model for the Minimum Interval Graph Completion Problem (Q2883618) (← links)
- Planar Disjoint-Paths Completion (Q2891339) (← links)
- Polynomial Kernels for Proper Interval Completion and Related Problems (Q3088286) (← links)
- A Polynomial-Time Algorithm for Outerplanar Diameter Improvement (Q3194712) (← links)
- The Proper Interval Colored Graph problem for caterpillar trees (Q3439122) (← links)
- On the proper intervalization of colored caterpillar trees (Q3653091) (← links)
- Intervalizing k-colored graphs (Q4645169) (← links)
- The interval order polytope of a digraph (Q5101405) (← links)
- (Q5708487) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)
- On Physical Mapping and the consecutive ones property for sparse matrices (Q5961616) (← links)
- On intervalizing \(k\)-colored graphs for DNA physical mapping (Q5961618) (← links)
- Edge deletion to tree-like graph classes (Q6124427) (← links)
- A Survey on the Complexity of Flood-Filling Games (Q6163636) (← links)
- Algorithms and complexity of sandwich problems in graphs (extended abstract) (Q6184393) (← links)