ACM Symposium on Discrete Algorithms, SODA 2015


Article Details
Title: An exact characterization of tractable demand patterns for maximum disjoint path problems
Article URLs:
Alternative Article URLs:
Authors: Dániel Marx
  • Hungarian Academy of Sciences (MTA SZTAKI), Institute for Computer Science and Control
Paul Wollan
  • University of Rome, Department of Computer Science
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/MarxW15
Author Comments:

Discuss this paper and its artifacts below