default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAtsushi Takizawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i1]Atsushi Takizawa:
Extracting real estate values of rental apartment floor plans using graph convolutional networks. CoRR abs/2303.13568 (2023)
2010 – 2019
- 2019
- [j7]Ryo Yamamoto, Atsushi Takizawa
:
Partitioning Vertical Evacuation Areas in Umeda Underground Mall to Minimize the Evacuation Completion Time. Rev. Socionetwork Strateg. 13(2): 209-225 (2019) - 2018
- [j6]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The mixed evacuation problem. J. Comb. Optim. 36(4): 1299-1314 (2018) - 2016
- [c6]Yosuke Hanawa, Yuya Higashikawa, Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
The Mixed Evacuation Problem. COCOA 2016: 18-32 - 2013
- [p1]Naoki Katoh, Atsushi Takizawa:
Emerging Pattern Based Crime Spots Analysis and Rental Price Prediction. Contrast Data Mining 2013: 337-350 - 2012
- [j5]Atsushi Takizawa, Masaki Inoue, Naoki Katoh:
An Emergency Evacuation Planning Model Using the Universally Quickest Flow. Rev. Socionetwork Strateg. 6(1): 15-28 (2012) - 2011
- [c5]Atsushi Takizawa, Akira Tanaka, Masaaki Miyakoshi:
Performance improvement of metric reconstruction based on partial joint diagonalization. GrC 2011: 625-629
2000 – 2009
- 2009
- [j4]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. Comb. 29(2): 197-214 (2009) - [j3]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. 157(17): 3665-3677 (2009) - 2008
- [c4]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
Arc-disjoint in-trees in directed graphs. SODA 2008: 518-526 - 2007
- [j2]Atsushi Takizawa, Fumie Kawaguchi, Naoki Katoh, Kenji Mori, Kazuo Yoshida:
Risk discovery of car-related crimes from urban spatial attributes using emerging patterns. Int. J. Knowl. Based Intell. Eng. Syst. 11(5): 301-311 (2007) - [c3]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths. AAIM 2007: 178-190 - [c2]Atsushi Takizawa, Kazuma Yoshida, Naoki Katoh:
Applying graph mining to discover substructures of room layouts which affect the rent of apartments. SMC 2007: 3512-3518 - 2006
- [j1]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problem in Dynamic Network Flows with Uniform Arc Capacity. IEICE Trans. Inf. Syst. 89-D(8): 2372-2379 (2006) - [c1]Naoyuki Kamiyama, Naoki Katoh, Atsushi Takizawa:
An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity. AAIM 2006: 231-242
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
