Toshinori Sakai

Orcid: 0000-0002-3796-9910

According to our database1, Toshinori Sakai authored at least 20 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Searching for a non-adversarial, uncooperative agent on a cycle.
Theor. Comput. Sci., 2020

Twenty Years of Progress of ${JCDCG}^3$.
Graphs Comb., 2020

2019
On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets.
Graphs Comb., 2019

2015
Blocking the k-Holes of Point Sets in the Plane.
Graphs Comb., 2015

On balanced 4-holes in bichromatic point sets.
Comput. Geom., 2015

2011
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

2010
Monotonic Polygons and Paths in Weighted Point Sets.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

2009
On Polygons Enclosing Point Sets II.
Graphs Comb., 2009

2008
Universal Measuring Boxes with Triangular Bases.
Am. Math. Mon., 2008

2007
Covering the Convex Quadrilaterals of Point Sets.
Graphs Comb., 2007

Bichromatic Quadrangulations with Steiner Points.
Graphs Comb., 2007

2003
The optimality of a certain purely recursive dissection for a sequentially n-divisible square.
Comput. Geom., 2003

Equal Area Polygons in Convex Bodies.
Proceedings of the Combinatorial Geometry and Graph Theory, 2003

2002
Balanced Convex Partitions of Measures in R<sup>2</sup>.
Graphs Comb., 2002

Long Paths Through Specified Vertices In 3-Connected Graphs.
Electron. Notes Discret. Math., 2002

Maximal Number of Edges in Geometric Graphs without Convex Polygons.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2001
Long Paths and Cycles Through Specified Vertices in k-Connected Graphs.
Ars Comb., 2001

2000
Sequentially Divisible Dissections of Simple Polygons.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

Universal Measuring Devices without Gradations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1998
Embeddings of Equilateral Polygons in Unit Lattices.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998


  Loading...