Junya Takahashi

Assistant Professor

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
1990 …2018

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 1993

    Finding shortest non-crossing rectilinear paths in plane regions

    Takahashi, J. Y., Suzuki, H. & Nishizeki, T., 1993, Algorithms and Computation - 4th International Symposium, ISAAC 1993, Proceedings. Ng, K. W., Raghavan, P., Balasubramanian, N. V. & Chin, F. Y. L. (eds.). Springer Verlag, p. 98-107 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 762 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    12 Citations (Scopus)
  • 1992

    Algorithms for finding non-crossing paths with minimum total length in plane graphs

    Takahashi, J. Y., Suzuki, H. & Nishizeki, T., 1992, Algorithms and Computation - 3rd International Symposium, ISAAC 1992, Proceedings. Nishizeki, T., Ibaraki, T., Iwama, K., Yamashita, M. & Inagaki, Y. (eds.). Springer Verlag, p. 400-409 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 650 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Citations (Scopus)