Toshinori Sakai - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 22 from 22

2020

Twenty Years of Progress of ${JCDCG}^3$Jin Akiyama, Hiro Ito, Toshinori Sakai, Yushi Uno. gc, 36(2):181-203, 2020. [doi]

Searching for a non-adversarial, uncooperative agent on a cycleJurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia. TCS, 806:531-542, 2020. [doi]

2019

On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point SetsJorge Cravioto-Lagos, Alejandro Corinto González-Martínez, Toshinori Sakai, Jorge Urrutia. gc, 35(6):1475-1493, 2019. [doi]

2017

Searching for a Non-adversarial, Uncooperative Agent on a CycleJurek Czyzowicz, Stefan Dobrev, Maxime Godon, Evangelos Kranakis, Toshinori Sakai, Jorge Urrutia. algosensors 2017: 114-126 [doi]

2015

2011

On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point SetsToshinori Sakai, Jorge Urrutia. s-egc 2012: 175-184 [doi]

2010

Monotonic Polygons and Paths in Weighted Point SetsToshinori Sakai, Jorge Urrutia. cgga 2011: 164-175 [doi]

2009

On Polygons Enclosing Point Sets IIFerran Hurtado, Criel Merino, D. Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura. gc, 25(3):327-339, 2009. [doi]

2008

Universal Measuring Boxes with Triangular BasesJin Akiyama, Hiroshi Fukuda, Chie Nara, Toshinori Sakai, Jorge Urrutia. tamm, 115(3):195-201, 2008. [doi]

2007

Bichromatic Quadrangulations with Steiner PointsVictor Alvarez, Toshinori Sakai, Jorge Urrutia. gc, 23(Supplement-1):85-98, 2007. [doi]

Covering the Convex Quadrilaterals of Point SetsToshinori Sakai, Jorge Urrutia. gc, 23(Supplement-1):343-357, 2007. [doi]

2003

The optimality of a certain purely recursive dissection for a sequentially n-divisible squareJin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken ichi Ozawa, Toshinori Sakai. comgeo, 24(1):27-39, 2003.

Equal Area Polygons in Convex BodiesToshinori Sakai, Chie Nara, Jorge Urrutia. jcdcg 2005: 146-158 [doi]

2002

Maximal Number of Edges in Geometric Graphs without Convex PolygonsChie Nara, Toshinori Sakai, Jorge Urrutia. jcdcg 2003: 215-220 [doi]

Long Paths Through Specified Vertices In 3-Connected GraphsToshinori Sakai. endm, 11:550-561, 2002. [doi]

Balanced Convex Partitions of Measures in R:::2:::Toshinori Sakai. gc, 18(1):169-192, 2002. [doi]

Long Paths through Specified Vertices in 3-Connected GraphsToshinori Sakai. jcdcg 2003: 251-260 [doi]

2001

Long Paths and Cycles Through Specified Vertices in k-Connected GraphsToshinori Sakai. arscom, 58, 2001.

2000

Sequentially Divisible Dissections of Simple PolygonsJin Akiyama, Toshinori Sakai, Jorge Urrutia. jcdcg 2001: 53-66 [doi]

Universal Measuring Devices without GradationsJin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura. jcdcg 2001: 31-40 [doi]

1998

Embeddings of Equilateral Polygons in Unit LatticesToshinori Sakai. jcdcg 2000: 278-289

Sign in or sign up to see more results.

runs on WebDSL