External Links

Cite Key

Statistics

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

PDF

Tags

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.

Genus Characterizes the Complexity of Graph Problems: Some Tight Results

Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia. Genus Characterizes the Complexity of Graph Problems: Some Tight Results. In Jos C. M. Baeten, Jan Karel Lenstra, Joachim Parrow, Gerhard J. Woeginger, editors, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. Volume 2719 of Lecture Notes in Computer Science, pages 845-856, Springer, 2003. [doi]

Authors

Jianer Chen

This author has not been identified. Look up 'Jianer Chen' in Google

Iyad A. Kanj

This author has not been identified. Look up 'Iyad A. Kanj' in Google

Ljubomir Perkovic

This author has not been identified. Look up 'Ljubomir Perkovic' in Google

Eric Sedgwick

This author has not been identified. Look up 'Eric Sedgwick' in Google

Ge Xia

This author has not been identified. Look up 'Ge Xia' in Google
runs on