Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Daniel P. Kennedy
Roland Zumkeller
Maximilian Dürr
Dan Graur
Liangliang Shang
Chen Ma
Mats Bogren
Barbara Aquilani
Marta C. Gonzalez
Shuran Sheng
Home
/
Author
/
TOSHINORI SAKAI
Author Info
Open Visualization
Name
Affiliation
Papers
TOSHINORI SAKAI
Tokai University, Research Institute of Educational Development, 2-28-4 Tomigaya, 151-8677, Tokyo, Shibuya-ku, Japan
19
Collaborators
Citations
PageRank
36
54
9.64
Referers
Referees
References
108
98
54
Search Limit
100
108
Publications (19 rows)
Collaborators (36 rows)
Referers (100 rows)
Referees (98 rows)
Title
Citations
PageRank
Year
Searching for a non-adversarial, uncooperative agent on a cycle
0
0.34
2020
Twenty Years of Progress of $$hbox {JCDCG}^3$$JCDCG3
0
0.34
2020
On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets.
1
0.35
2019
On balanced 4-holes in bichromatic point sets.
1
0.35
2015
Blocking the $$k$$k-Holes of Point Sets in the Plane
1
0.40
2015
Discrete and Computational Geometry and Graphs - 16th Japanese Conference, JCDCGG 2013, Tokyo, Japan, September 17-19, 2013, Revised Selected Papers
0
0.34
2014
Computational Geometry and Graphs - Thailand-Japan Joint Conference, TJJCCGG 2012, Bangkok, Thailand, December 6-8, 2012, Revised Selected Papers
15
1.22
2013
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets.
0
0.34
2011
Monotonic polygons and paths in weighted point sets
1
0.40
2010
Universal Measuring Boxes with Triangular Bases.
0
0.34
2008
Covering the Convex Quadrilaterals of Point Sets
8
0.62
2007
Bichromatic Quadrangulations with Steiner Points.
4
0.55
2007
The optimality of a certain purely recursive dissection for a sequentially n-divisible square
5
0.75
2003
Balanced Convex Partitions of Measures in R2
7
0.75
2002
Long Paths Through Specified Vertices In 3-Connected Graphs
0
0.34
2002
Long Paths And Cycles Through Specified Vertices In K-Connected Graphs
8
0.83
2001
Universal Measuring Devices without Gradations
2
0.67
2000
Sequentially Divisible Dissections of Simple Polygons
1
0.38
2000
Embeddings of Equilateral Polygons in Unit Lattices
0
0.34
1998
1