Takehiro Ito

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Takanori Aoki

> Home > Persons > Takehiro Ito

Publications

2014
[j20]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/UchizawaAIZ14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/UchizawaAIZ14
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized rainbow connectivity of graphs. Theor. Comput. Sci. 555: 35-42 (2014)
2013
[j17]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/UchizawaAISZ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/UchizawaAISZ13
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. Algorithmica 67(2): 161-179 (2013)
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/walcom/UchizawaAIZ13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/walcom/UchizawaAIZ13
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Xiao Zhou:
Generalized Rainbow Connectivity of Graphs. WALCOM 2013: 233-244
2011
[c20]
- view
  authority control:
- export record
  dblp key:
  - conf/cocoon/UchizawaAISZ11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/UchizawaAISZ11
Kei Uchizawa, Takanori Aoki, Takehiro Ito, Akira Suzuki, Xiao Zhou:
On the Rainbow Connectivity of Graphs: Complexity and FPT Algorithms. COCOON 2011: 86-97

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.