default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDToshinori Sakai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j13]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Twenty Years of Progress of ${JCDCG}^3$. Graphs Comb. 36(2): 181-203 (2020)- [j12]Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia:
Searching for a non-adversarial, uncooperative agent on a cycle. Theor. Comput. Sci. 806: 531-542 (2020)
2010 – 2019
- 2019
- [j11]Jorge Cravioto-Lagos, Alejandro Corinto González-Martínez, Toshinori Sakai
, Jorge Urrutia:
On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets. Graphs Comb. 35(6): 1475-1493 (2019) - 2017
- [c9]Jurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia:
Searching for a Non-adversarial, Uncooperative Agent on a Cycle. ALGOSENSORS 2017: 114-126 - [i1]Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On balanced 4-holes in bichromatic point sets. CoRR abs/1708.01321 (2017) - 2016
- [e3]Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno:
Discrete and Computational Geometry and Graphs - 18th Japan Conference, JCDCGG 2015, Kyoto, Japan, September 14-16, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9943, Springer 2016, ISBN 978-3-319-48531-7 [contents] - 2015
- [j10]Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On balanced 4-holes in bichromatic point sets. Comput. Geom. 48(3): 169-179 (2015) - [j9]Javier Cano, Alfredo García Olaverri, Ferran Hurtado, Toshinori Sakai, Javier Tejel, Jorge Urrutia:
Blocking the k-Holes of Point Sets in the Plane. Graphs Comb. 31(5): 1271-1287 (2015) - 2014
- [e2]Jin Akiyama, Hiro Ito, Toshinori Sakai:
Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers. Lecture Notes in Computer Science 8845, Springer 2014, ISBN 978-3-319-13286-0 [contents] - 2013
- [e1]Jin Akiyama, Mikio Kano, Toshinori Sakai:
Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers. Lecture Notes in Computer Science 8296, Springer 2013, ISBN 978-3-642-45280-2 [contents] - 2011
- [c8]Toshinori Sakai, Jorge Urrutia:
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets. EGC 2011: 175-184 - 2010
- [c7]Toshinori Sakai, Jorge Urrutia:
Monotonic Polygons and Paths in Weighted Point Sets. CGGA 2010: 164-175
2000 – 2009
- 2009
- [j8]Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On Polygons Enclosing Point Sets II. Graphs Comb. 25(3): 327-339 (2009) - 2008
- [j7]Jin Akiyama, Hiroshi Fukuda, Chie Nara, Toshinori Sakai, Jorge Urrutia:
Universal Measuring Boxes with Triangular Bases. Am. Math. Mon. 115(3): 195-201 (2008) - 2007
- [j6]Victor Alvarez, Toshinori Sakai, Jorge Urrutia:
Bichromatic Quadrangulations with Steiner Points. Graphs Comb. 23(Supplement-1): 85-98 (2007) - [j5]Toshinori Sakai, Jorge Urrutia:
Covering the Convex Quadrilaterals of Point Sets. Graphs Comb. 23(Supplement-1): 343-357 (2007) - 2003
- [j4]Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa, Toshinori Sakai:
The optimality of a certain purely recursive dissection for a sequentially n-divisible square. Comput. Geom. 24(1): 27-39 (2003) - [c6]Toshinori Sakai, Chie Nara, Jorge Urrutia:
Equal Area Polygons in Convex Bodies. IJCCGGT 2003: 146-158 - 2002
- [j3]Toshinori Sakai:
Long Paths Through Specified Vertices In 3-Connected Graphs. Electron. Notes Discret. Math. 11: 550-561 (2002) - [j2]Toshinori Sakai:
Balanced Convex Partitions of Measures in R2. Graphs Comb. 18(1): 169-192 (2002) - [c5]Chie Nara, Toshinori Sakai, Jorge Urrutia:
Maximal Number of Edges in Geometric Graphs without Convex Polygons. JCDCG 2002: 215-220 - [c4]Toshinori Sakai:
Long Paths through Specified Vertices in 3-Connected Graphs. JCDCG 2002: 251-260 - 2001
- [j1]Toshinori Sakai:
Long Paths and Cycles Through Specified Vertices in k-Connected Graphs. Ars Comb. 58 (2001) - 2000
- [c3]Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura:
Universal Measuring Devices without Gradations. JCDCG 2000: 31-40 - [c2]Jin Akiyama, Toshinori Sakai, Jorge Urrutia:
Sequentially Divisible Dissections of Simple Polygons. JCDCG 2000: 53-66
1990 – 1999
- 1998
- [c1]Toshinori Sakai:
Embeddings of Equilateral Polygons in Unit Lattices. JCDCG 1998: 278-289
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-05-08 21:48 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:
