#### Filter Results:

- Full text PDF available (2)

#### Publication Year

2014

2017

- This year (1)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

The k-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed k when restricted to the class of planar digraphs and it was a long standing open question whether it is fixed-parameter tractable (with respect to parameter k) on… (More)

- Ali Golshani, Dara Moazzami, Saeed Akhoondian Amiri
- Ars Comb.
- 2017

- Mohammadreza Ashouri, Ali Golshani, Dara Moazzami, Mandana Ghasemi
- ArXiv
- 2016

Many problems can be presented in an abstract form through a wide range of binary objects and relations which are defined over problem’s domain. In these problems, graphical demonstration of defined binary objects and solutions is the most suitable representation approach. In this regard, graph drawing problem discusses the methods for transforming… (More)

- ‹
- 1
- ›