Hiroshi Maehara

Orcid: 0000-0001-9957-8141

According to our database1, Hiroshi Maehara authored at least 83 papers between 1980 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Kissing Numbers for Balls with Varying Radii.
Graphs Comb., 2022

Tangent Spheres of Tetrahedra and a Theorem of Grace.
Am. Math. Mon., 2020

Planar lattices and equilateral polygons.
Eur. J. Comb., 2019

On the Structure of Discrete Metric Spaces Isometric to Circles.
Proceedings of the Algorithmic Aspects in Information and Management, 2019

On Lexell's Theorem.
Am. Math. Mon., 2017

Separating n-point sets from quasi-finite ones via polyhedral surfaces.
Eur. J. Comb., 2017

Another exploration problem.
Discret. Math., 2016

Circle lattice point problem, revisited.
Discret. Math., 2015

Euclidean embeddings of finite metric spaces.
Discret. Math., 2013

Generating Polygons with Triangles.
Proceedings of the Discrete and Computational Geometry and Graphs, 2013

Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame.
Comput. Geom., 2012

Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism.
Graphs Comb., 2011

Lattice Points on Similar Figures and Conics.
Graphs Comb., 2011

A Note on Lights-Out-Puzzle: Parity-State Graphs.
Graphs Comb., 2011

On a proper acute triangulation of a polyhedral surface.
Discret. Math., 2011

Reversing a polyhedral surface by origami-deformation.
Eur. J. Comb., 2010

On a sphere that passes through n lattice points.
Eur. J. Comb., 2010

Problem section.
Eur. J. Comb., 2010

On the Diameter of a Circle to Hold a Cube.
Proceedings of the Computational Geometry, Graphs and Applications, 2010

Large regular simplices contained in a hypercube.
Period. Math. Hung., 2009

From line-systems to sphere-systems - Schläfli's double six, Lie's line-sphere transformation, and Grace's theorem.
Eur. J. Comb., 2009

Planar unit-distance graphs having planar unit-distance complement.
Discret. Math., 2008

On Configurations of Solid Balls in 3-Space: Chromatic Numbers and Knotted Cycles.
Graphs Comb., 2007

The problem of thirteen spheres - a proof for undergraduates.
Eur. J. Comb., 2007

Partial order on a family of <i>k</i>-subsets of a linearly ordered set.
Discret. Math., 2006

On the Perimeter of a Triangle in a Minkowski Plane.
Am. Math. Mon., 2005

On the intersection graph of random caps on a sphere.
Eur. J. Comb., 2004

Plane graphs with straight edges whose bounded faces are acute triangles.
J. Comb. Theory B, 2003

On a condition for the union of spherical caps to be connected.
J. Comb. Theory A, 2003

Arranging Solid Balls to Represent a Graph.
Graphs Comb., 2002

An Inequality on the Size of a Set in a Cartesian Product.
Eur. J. Comb., 2002

The Length of the Shortest Edge of a Graph on a Sphere.
Eur. J. Comb., 2002

Acute Triangulations of Polygons.
Eur. J. Comb., 2002

Observing an Angle from Various Viewpoints.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

When does a planar bipartite framework admit a continuous deformation?
Theor. Comput. Sci., 2001

On the Total Edge-Length of a Tetrahedron.
Am. Math. Mon., 2001

Piercing a Set of Disjoint Balls by a Line.
J. Comb. Theory A, 2001

Cutting a Bunch of Grapes by a Plane.
Eur. J. Comb., 2001

A Pair in a Crowd of Unit Balls.
Eur. J. Comb., 2001

Can a convex polyhedron have a developable face-cycle?
Theor. Comput. Sci., 2000

Cutting a Set of Disks by a Line with Leaving Many Intact Disks in Both Sides.
J. Comb. Theory A, 2000

Piercing Balls Sitting on a Table by a Vertical Line.
Eur. J. Comb., 2000

Subdividing a Graph Toward a Unit-distance Graph in the Plane.
Eur. J. Comb., 2000

On Acute Triangulations of Quadrilaterals.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph.
J. Comb. Theory B, 1999

On Knotted Necklaces of Pearls.
Eur. J. Comb., 1999

Configuration Spaces of Pentagonal Frameworks.
Eur. J. Comb., 1999

Is There a Circle that Passes Through a Given Number of Lattice Points?
Eur. J. Comb., 1998

Embedding a set of rational points in lower dimensions.
Discret. Math., 1998

On Soddy's Hexlet and a Linked 4-Pair.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998

Every Graph Is an Integral Distance Graph in the Plane.
J. Comb. Theory A, 1997

A spatial unit-bar-framework which is rigid and triangle-free.
Graphs Comb., 1996

On sqrt(Q)-Distances.
Eur. J. Comb., 1996

On the section of a convex polyhedron.
Discret. Math., 1995

Embedding a Polytope in a Lattice.
Discret. Comput. Geom., 1995

A few applications of negative- type inequalities.
Graphs Comb., 1994

Projecting a Simplex onto Another One.
Eur. J. Comb., 1994

Metric extensions and the L<sup>1</sup> hierarchy.
Discret. Math., 1994

Reflecting a triangle in the plane.
Graphs Comb., 1993

Extending a flexible unit-bar framework to a rigid one.
Discret. Math., 1992

The intersection graph of random sets.
Discret. Math., 1991

On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
Discret. Comput. Geom., 1991

Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
Discret. Comput. Geom., 1991

Distances in a rigid unit-distance graph in the plane.
Discret. Appl. Math., 1991

On the dimension to represent a graph by a unit distance graph.
Graphs Comb., 1990

Simplices with Given 2-Face Areas.
Eur. J. Comb., 1990

Helly-Type Theorems for Spheres.
Discret. Comput. Geom., 1989

Note on Induced Subgraphs of the Unit Distance Graph E<sup>n</sup>.
Discret. Comput. Geom., 1989

The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
J. Comb. Theory B, 1988

Embedding of trees in euclidean spaces.
Graphs Comb., 1988

On the euclidean dimension of a complete multipartite graph.
Discret. Math., 1988

On the Contact Dimensions of Graphs.
Discret. Comput. Geom., 1988

On the number of induced subgraphs of a random graph.
Discret. Math., 1987

Open-interval graphs versus closed-interval graphs.
Discret. Math., 1987

Sphericity exceeds cubicity for almost all complete bipartite graphs.
J. Comb. Theory B, 1986

Embedding the n-cube in Lower Dimensions.
Eur. J. Comb., 1986

Metric transforms of finite spaces and connected graphs.
Discret. Math., 1986

On the sphericity of the graphs of semiregular polyhedra.
Discret. Math., 1986

Contact patterns of equal nonoverlapping spheres.
Graphs Comb., 1985

A digraph represented by a family of boxes or spheres.
J. Graph Theory, 1984

On the sphericity for the join of many graphs.
Discret. Math., 1984

Space graphs and sphericity.
Discret. Appl. Math., 1984

On time graphs.
Discret. Math., 1980