The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable

MLA

Cygan, Marek, et al. The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable. 2013. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1304.4207&authtype=sso&custid=ns315887.

APA

Cygan, M., Marx, D., Pilipczuk, M., & Pilipczuk, M. (2013). The planar directed k-Vertex-Disjoint Paths problem is fixed-parameter tractable.

Chicago

Cygan, Marek, Dániel Marx, Marcin Pilipczuk, and Michał Pilipczuk. 2013. “The Planar Directed K-Vertex-Disjoint Paths Problem Is Fixed-Parameter Tractable.” http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsarx&AN=edsarx.1304.4207&authtype=sso&custid=ns315887.