External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth

Hasna Mohsen Alqahtani, Thomas Erlebach. Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. In Viliam Geffert, Bart Preneel, Branislav Rovan, Julius Stuller, A Min Tjoa, editors, SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings. Volume 8327 of Lecture Notes in Computer Science, pages 65-76, Springer, 2014. [doi]

Authors

Hasna Mohsen Alqahtani

This author has not been identified. Look up 'Hasna Mohsen Alqahtani' in Google

Thomas Erlebach

This author has not been identified. Look up 'Thomas Erlebach' in Google
runs on