Pages that link to "Item:Q1254855"
From MaRDI portal
The following pages link to The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two (Q1254855):
Displaying 39 items.
- On enumerating monomials and other combinatorial structures by polynomial interpolation (Q385504) (← links)
- On the complexity of the Eulerian closed walk with precedence path constraints problem (Q441867) (← links)
- Gaming is a hard job, but someone has to do it! (Q489749) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- An algorithmic study of switch graphs (Q715049) (← links)
- Complexity of token swapping and its variants (Q722547) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- On the complexity of graph self-assembly in accretive systems (Q934978) (← links)
- On a simple randomized algorithm for finding a 2-factor in sparse graphs (Q1041775) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- The multi-stripe travelling salesman problem (Q1698268) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- The complexity of routing with collision avoidance (Q1741493) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Counting substrate cycles in topologically restricted metabolic networks (Q2011645) (← links)
- Hamiltonian problems in directed graphs with simple row patterns (Q2143132) (← links)
- The complexity of approximate pattern matching on de Bruijn graphs (Q2170154) (← links)
- Topologically trivial closed walks in directed surface graphs (Q2223623) (← links)
- Domino sequencing: scheduling with state-based sequence-dependent setup times (Q2294316) (← links)
- Boundary classes for graph problems involving non-local properties (Q2401761) (← links)
- Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs (Q2429344) (← links)
- Parameterized complexity of Eulerian deletion problems (Q2441593) (← links)
- Arc-disjoint paths and trees in 2-regular digraphs (Q2444565) (← links)
- Moving coins (Q2489547) (← links)
- Reconfiguring (non-spanning) arborescences (Q2680989) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- (Q2861508) (← links)
- Sorting by Cuts, Joins and Whole Chromosome Duplications (Q2942277) (← links)
- Parameterized Complexity of Eulerian Deletion Problems (Q3104771) (← links)
- A Framework for Exponential-Time-Hypothesis--Tight Algorithms and Lower Bounds in Geometric Intersection Graphs (Q3387760) (← links)
- Feasible Bases for a Polytope Related to the Hamilton Cycle Problem (Q5026442) (← links)
- Shortest Reconfiguration of Perfect Matchings via Alternating Cycles (Q5074950) (← links)
- (Q5075806) (← links)
- (Q5116496) (← links)
- Simple Geometrical Intersection Graphs (Q5452149) (← links)
- Flip distances between graph orientations (Q5919075) (← links)
- The Asymmetric Travelling Salesman Problem In Sparse Digraphs. (Q6089670) (← links)
- Traversability, reconfiguration, and reachability in the gadget framework (Q6090541) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
