3 citations · 3 across the 1 of their papers we have counts for
3 papers
cs.DS2009
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
Tamara Mchedlidze, Antonios Symvonis
In this paper we study the problem of existence of a crossing-free acyclic hamiltonian path completion (for short, HP-completion) set for embedded upward planar digraphs. In the co…
cs.DS2009
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
Tamara Mchedlidze, Antonios Symvonis
Given an embedded planar acyclic digraph G, we define the problem of acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM) to be the problem of determining…
cs.DS2008★ 3 cited
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
Tamara Mchedlidze, Antonios Symvonis
Given an embedded planar acyclic digraph G, we define the problem of "acyclic hamiltonian path completion with crossing minimization (Acyclic-HPCCM)" to be the problem of determini…