default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakeshi Shirabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Lindsi Seegmiller
, Takeshi Shirabe:
A method for finding a maximum value region with a minimum width in raster space. Int. J. Geogr. Inf. Sci. 38(4): 675-698 (2024)- 2023
- [j14]Lindsi Seegmiller, Takeshi Shirabe:
A method for finding a least-cost corridor on an ordinal-scaled raster cost surface. Ann. GIS 29(2): 205-225 (2023) - 2022
- [j13]Lindsi Seegmiller, Takeshi Shirabe:
A method for finding least-cost corridors in three-dimensional raster space. Trans. GIS 26(2): 1098-1115 (2022) - 2021
- [j12]Rachel Mundeli Murekatete, Takeshi Shirabe:
An experimental analysis of least-cost path models on ordinal-scaled raster surfaces. Int. J. Geogr. Inf. Sci. 35(8): 1545-1569 (2021) - [j11]Lindsi Seegmiller, Takeshi Shirabe, C. Dana Tomlin:
A method for finding least-cost corridors with reduced distortion in raster space. Int. J. Geogr. Inf. Sci. 35(8): 1570-1591 (2021)
2010 – 2019
- 2018
- [j10]Takeshi Shirabe:
Buffered or bundled, least-cost paths are not least-cost corridors: Computational experiments on path-based and wide-path-based models for conservation corridor design and effective distance estimation. Ecol. Informatics 44: 109-116 (2018) - [j9]Rachel Mundeli Murekatete, Takeshi Shirabe:
A spatial and statistical analysis of the impact of transformation of raster cost surfaces on the variation of least-cost paths. Int. J. Geogr. Inf. Sci. 32(11): 2169-2188 (2018) - 2016
- [j8]Takeshi Shirabe:
A method for finding a least-cost wide path in raster space. Int. J. Geogr. Inf. Sci. 30(8): 1469-1485 (2016) - [c10]Takeshi Shirabe:
On Distortion of Raster-Based Least-Cost Corridors. GIScience 2016: 101-113 - 2015
- [c9]Takeshi Shirabe:
Drawing with Geography. AGILE Conf. 2015: 327-341 - 2014
- [j7]Takeshi Shirabe:
A path that buys time to decide where to go. Int. J. Geogr. Inf. Sci. 28(2): 314-325 (2014) - [c8]Adrian C. Prelipcean, Falko Schmid, Takeshi Shirabe:
A Space Time Alarm. LBS 2014: 187-198 - 2012
- [j6]Takeshi Shirabe:
Prescriptive modeling with map algebra for multi-zone allocation with size constraints. Comput. Environ. Urban Syst. 36(5): 456-469 (2012) - 2011
- [j5]Takeshi Shirabe:
A heuristic for the maximum value region problem in raster space. Int. J. Geogr. Inf. Sci. 25(7): 1097-1116 (2011) - [c7]Takeshi Shirabe:
Information on the Consequence of a Move and Its Use for Route Improvisation Support. COSIT 2011: 57-72
2000 – 2009
- 2009
- [c6]Takeshi Shirabe:
Map Algebraic Characterization of Self-adapting Neighborhoods. COSIT 2009: 280-294 - 2008
- [j4]Takeshi Shirabe:
Minimum work paths in elevated networks. Networks 52(2): 88-97 (2008) - 2006
- [j3]Marc Benkert, Alexander Wolff, Florian Widmann, Takeshi Shirabe:
The minimum Manhattan network problem: Approximations and exact solutions. Comput. Geom. 35(3): 188-208 (2006) - [c5]Takeshi Shirabe:
Correlation Analysis of Discrete Motions. GIScience 2006: 370-382 - 2005
- [j2]Takeshi Shirabe:
Classification of Spatial Properties for Spatial Allocation Modeling. GeoInformatica 9(3): 269-287 (2005) - [c4]Takeshi Shirabe:
Shortest Path Search from a Physical Perspective. COSIT 2005: 83-95 - 2004
- [j1]Felipe Caro, Takeshi Shirabe, Monique Guignard, Andrés Weintraub:
School redistricting: embedding GIS tools with integer programming. J. Oper. Res. Soc. 55(8): 836-849 (2004) - [c3]Takeshi Shirabe:
Towards a Temporal Extension of Spatial Allocation Modeling. GIScience 2004: 285-298 - [c2]Takeshi Shirabe:
Modeling Topological Properties of a Raster Region for Spatial Optimization. SDH 2004: 407-420 - 2002
- [c1]Takeshi Shirabe, C. Dana Tomlin:
Decomposing Integer Programming Models for Spatial Allocation. GIScience 2002: 300-312
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 2024-06-10 21:24 CEST 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:
