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.

Parameterized Complexity of Min-Power Asymmetric Connectivity

Matthias Bentert, Roman Haag, Christian Hofer, Tomohiro Koana, André Nichterlein. Parameterized Complexity of Min-Power Asymmetric Connectivity. In Charles J. Colbourn, Roberto Grossi, Nadia Pisanti, editors, Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23-25, 2019, Proceedings. Volume 11638 of Lecture Notes in Computer Science, pages 85-96, Springer, 2019. [doi]

Authors

Matthias Bentert

This author has not been identified. Look up 'Matthias Bentert' in Google

Roman Haag

This author has not been identified. Look up 'Roman Haag' in Google

Christian Hofer

This author has not been identified. It may be one of the following persons: Look up 'Christian Hofer' in Google

Tomohiro Koana

This author has not been identified. Look up 'Tomohiro Koana' in Google

André Nichterlein

This author has not been identified. Look up 'André Nichterlein' in Google
runs on