Balanced Convex Partitions of Measures in ℝ2 T Sakai Graphs and Combinatorics 18 (1), 169-192, 2002 | 66 | 2002 |

Covering the convex quadrilaterals of point sets T Sakai, J Urrutia Graphs and Combinatorics 23 (1), 343-357, 2007 | 17 | 2007 |

Radial partitions of point sets in R2 T Sakai Manuscript, Tokoha Gakuen University, 1998 | 13 | 1998 |

The optimality of a certain purely recursive dissection for a sequentially n-divisible square J Akiyama, G Nakamura, A Nozaki, K Ozawa, T Sakai Computational Geometry 24 (1), 27-39, 2003 | 10 | 2003 |

On balanced 4-holes in bichromatic point sets S Bereg, JM Díaz-Báñez, R Fabila-Monroy, P Pérez-Lantero, ... Proc. EuroCGʼ12, Assisi, Italy, 201-204, 2012 | 9 | 2012 |

Blocking the k-holes of point sets on the plane J Cano, A García, F Hurtado, T Sakai, J Tejel, J Urrutia XIV SPANISH MEETING ON COMPUTATIONAL GEOMETRY, 27–30 JUNE 2011, 2011 | 9* | 2011 |

Convex decompositions of point sets in the plane T Sakai, J Urrutia Proc. 7th Japan Conf. on Comput. Geom. and Graphs, 2009 | 9* | 2009 |

Nonstandard ways of teaching standard mathematics J Akiyama, Y Hirano, T Sakai Proceedings of the Southeast Asian Conference in Mathematics Education …, 1999 | 9 | 1999 |

Bichromatic quadrangulations with Steiner points V Alvarez, T Sakai, J Urrutia Graphs and Combinatorics 23 (1), 85-98, 2007 | 8 | 2007 |

On polygons enclosing point sets II F Hurtado, C Merino, D Oliveros, T Sakai, J Urrutia, I Ventura Graphs and Combinatorics 25 (3), 327-339, 2009 | 7 | 2009 |

Universal measuring devices without gradations J Akiyama, H Fukuda, G Nakamura, T Sakai, J Urrutia, C Zamora-Cura Discrete and Computational Geometry, 31-40, 2001 | 7 | 2001 |

Long paths and cycles through specified vertices in k-connected graphs T Sakai Ars Combinatoria 58, 33-65, 2001 | 7 | 2001 |

On edge-disjoint empty triangles of point sets J Cano, LF Barba, T Sakai, J Urrutia Thirty Essays on Geometric Graph Theory, 83-100, 2013 | 6 | 2013 |

Discrete and Computational Geometry and Graphs J Akiyama, H Ito, T Sakai Springer, 0 | 5* | |

Maximal number of edges in geometric graphs without convex polygons C Nara, T Sakai, J Urrutia Discrete and Computational Geometry, 215-220, 2003 | 4 | 2003 |

Degree-sum conditions for graphs to have 2-factors with cycles through specified vertices T Sakai SUT Journal of Mathematics 38 (2), 211-222, 2002 | 4 | 2002 |

Monotonic polygons and paths in weighted point sets T Sakai, J Urrutia Computational Geometry, Graphs and Applications, 164-175, 2011 | 3 | 2011 |

Universal measuring boxes with triangular bases J Akiyama, H Fukuda, C Nara, T Sakai, J Urrutia American Mathematical Monthly 115 (3), 195-201, 2008 | 3 | 2008 |

Sequentially divisible dissections of simple polygons J Akiyama, T Sakai, J Urrutia Discrete and Computational Geometry, 53-66, 2001 | 3 | 2001 |

What Does it Take to Get Students Excited About Mathematics? J Akiyama, C Nara, T Sakai 東海大学紀要. 教育研究所 10, 15-27, 2003 | 2 | 2003 |