 | 2012 |
|---|
| 62 |       | Imre Bárány,
Hiroshi Maehara,
Norihide Tokushige:
Tetrahedra passing through a triangular hole, and tetrahedra fixed by a planar frame.
Comput. Geom. 45(1-2): 14-20 (2012) |
| 2011 |
|---|
| 61 | | Severino V. Gervacio,
Hiroshi Maehara:
A Note on Lights-Out-Puzzle: Parity-State Graphs.
Graphs and Combinatorics 27(1): 109-119 (2011) |
| 60 | | Takayasu Kuwata,
Hiroshi Maehara:
Lattice Points on Similar Figures and Conics.
Graphs and Combinatorics 27(3): 441-450 (2011) |
| 59 | | Hiroshi Maehara,
Norihide Tokushige:
Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism.
Graphs and Combinatorics 27(3): 451-463 (2011) |
| 2010 |
|---|
| 58 | | Hiroshi Maehara:
On the Diameter of a Circle to Hold a Cube.
CGGA 2010: 147-153 |
| 57 | | Hiroshi Maehara:
Reversing a polyhedral surface by origami-deformation.
Eur. J. Comb. 31(4): 1171-1180 (2010) |
| 2009 |
|---|
| 56 | | Hiroshi Maehara,
Norihide Tokushige:
From line-systems to sphere-systems - Schläfli's double six, Lie's line-sphere transformation, and Grace's theorem.
Eur. J. Comb. 30(5): 1337-1351 (2009) |
| 2008 |
|---|
| 55 | | Severino V. Gervacio,
Yvette F. Lim,
Hiroshi Maehara:
Planar unit-distance graphs having planar unit-distance complement.
Discrete Mathematics 308(10): 1973-1984 (2008) |
| 2007 |
|---|
| 54 | | Hiroshi Maehara:
The problem of thirteen spheres - a proof for undergraduates.
Eur. J. Comb. 28(6): 1770-1778 (2007) |
| 2006 |
|---|
| 53 | | Severino V. Gervacio,
Hiroshi Maehara:
Partial order on a family of k-subsets of a linearly ordered set.
Discrete Mathematics 306(4): 413-419 (2006) |
| 2004 |
|---|
| 52 | | Hiroshi Maehara:
On the intersection graph of random caps on a sphere.
Eur. J. Comb. 25(5): 707-718 (2004) |
| 2003 |
|---|
| 51 | | Hiroshi Maehara:
On a condition for the union of spherical caps to be connected.
J. Comb. Theory, Ser. A 101(2): 264-270 (2003) |
| 50 | | Hiroshi Maehara:
Plane graphs with straight edges whose bounded faces are acute triangles.
J. Comb. Theory, Ser. B 88(2): 237-245 (2003) |
| 2002 |
|---|
| 49 | | Yoichi Maeda,
Hiroshi Maehara:
Observing an Angle from Various Viewpoints.
JCDCG 2002: 200-203 |
| 48 | | Hiroshi Maehara:
Acute Triangulations of Polygons.
Eur. J. Comb. 23(1): 45-55 (2002) |
| 47 | | Hiroshi Maehara:
The Length of the Shortest Edge of a Graph on a Sphere.
Eur. J. Comb. 23(6): 713-717 (2002) |
| 46 | | Hiroshi Maehara:
An Inequality on the Size of a Set in a Cartesian Product.
Eur. J. Comb. 23(8): 1055-1059 (2002) |
| 45 | | Hiroshi Maehara,
Ai Oshiro:
Arranging Solid Balls to Represent a Graph.
Graphs and Combinatorics 18(2): 343-365 (2002) |
| 2001 |
|---|
| 44 | | Hiroshi Maehara,
Ai Oshiro:
Cutting a Bunch of Grapes by a Plane.
Eur. J. Comb. 22(6): 847-853 (2001) |
| 43 | | Kiyoshi Hosono,
Hiroshi Maehara,
Katsumi Matsuda:
A Pair in a Crowd of Unit Balls.
Eur. J. Comb. 22(8): 1083-1092 (2001) |
| 42 | | Hiroshi Maehara,
Ai Oshiro:
Piercing a Set of Disjoint Balls by a Line.
J. Comb. Theory, Ser. A 94(2): 393-398 (2001) |
| 41 | | Hiroshi Maehara,
Norihide Tokushige:
When does a planar bipartite framework admit a continuous deformation?
Theor. Comput. Sci. 263(1-2): 345-354 (2001) |
| 2000 |
|---|
| 40 | | Hiroshi Maehara:
On Acute Triangulations of Quadrilaterals.
JCDCG 2000: 237-243 |
| 39 | | Severino V. Gervacio,
Hiroshi Maehara:
Subdividing a Graph Toward a Unit-distance Graph in the Plane.
Eur. J. Comb. 21(2): 223-229 (2000) |
| 38 | | Hiroshi Maehara,
Ai Oshiro:
Piercing Balls Sitting on a Table by a Vertical Line.
Eur. J. Comb. 21(4): 509-517 (2000) |
| 37 | | Hiroshi Maehara,
Ai Oshiro:
Cutting a Set of Disks by a Line with Leaving Many Intact Disks in Both Sides.
J. Comb. Theory, Ser. A 90(1): 235-240 (2000) |
| 36 | | Hiroshi Maehara:
Can a convex polyhedron have a developable face-cycle?
Theor. Comput. Sci. 235(2): 267-270 (2000) |
| 1999 |
|---|
| 35 | | Hiroshi Maehara,
Ai Oshiro:
On Knotted Necklaces of Pearls.
Eur. J. Comb. 20(5): 411-420 (1999) |
| 34 | | Hiroshi Maehara:
Configuration Spaces of Pentagonal Frameworks.
Eur. J. Comb. 20(8): 839-844 (1999) |
| 33 | | Atsushi Kaneko,
Hiroshi Maehara,
Mamoru Watanabe:
On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph.
J. Comb. Theory, Ser. B 75(1): 110-115 (1999) |
| 1998 |
|---|
| 32 | | Hiroshi Maehara,
Ai Oshiro:
On Soddy's Hexlet and a Linked 4-Pair.
JCDCG 1998: 188-193 |
| 31 | | Hiroshi Maehara:
Embedding a set of rational points in lower dimensions.
Discrete Mathematics 192(1-3): 273-279 (1998) |
| 30 | | Hiroshi Maehara,
Makoto Matsumoto:
Is There a Circle that Passes Through a Given Number of Lattice Points?
Eur. J. Comb. 19(5): 591-592 (1998) |
| 1997 |
|---|
| 29 | | Hiroshi Maehara,
Katsuhiro Ota,
Norihide Tokushige:
Every Graph Is an Integral Distance Graph in the Plane.
J. Comb. Theory, Ser. A 80(2): 290-294 (1997) |
| 1996 |
|---|
| 28 | | Hiroshi Maehara:
On sqrt(Q)-Distances.
Eur. J. Comb. 17(2-3): 271-277 (1996) |
| 27 | | Hiroshi Maehara,
Norihide Tokushige:
A spatial unit-bar-framework which is rigid and triangle-free.
Graphs and Combinatorics 12(1): 341-344 (1996) |
| 1995 |
|---|
| 26 | | Hiroshi Maehara:
Embedding a Polytope in a Lattice.
Discrete & Computational Geometry 13: 585-592 (1995) |
| 25 | | Peter Frankl,
Hiroshi Maehara,
Junichiro Nakashima:
On the section of a convex polyhedron.
Discrete Mathematics 140(1-3): 265-267 (1995) |
| 1994 |
|---|
| 24 | | David Avis,
Hiroshi Maehara:
Metric extensions and the L1 hierarchy.
Discrete Mathematics 131(1-3): 17-28 (1994) |
| 23 | | Michel Deza,
Hiroshi Maehara:
Projecting a Simplex onto Another One.
Eur. J. Comb. 15(1): 13-16 (1994) |
| 22 | | Michel Deza,
Hiroshi Maehara:
A few applications of negative- type inequalities.
Graphs and Combinatorics 10(2-4): 255-262 (1994) |
| 1993 |
|---|
| 21 | | Imre Bárány,
Peter Frankl,
Hiroshi Maehara:
Reflecting a triangle in the plane.
Graphs and Combinatorics 9(2-4): 97-104 (1993) |
| 1992 |
|---|
| 20 | | Hiroshi Maehara:
Extending a flexible unit-bar framework to a rigid one.
Discrete Mathematics 108(1-3): 167-174 (1992) |
| 1991 |
|---|
| 19 | | Hiroshi Maehara:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs.
Discrete & Computational Geometry 6: 339-342 (1991) |
| 18 | | Hiroshi Maehara:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs.
Discrete & Computational Geometry 6: 57-67 (1991) |
| 17 | | Hiroshi Maehara:
Distances in a rigid unit-distance graph in the plane.
Discrete Applied Mathematics 31(2): 193-200 (1991) |
| 16 | | Hiroshi Maehara:
The intersection graph of random sets.
Discrete Mathematics 87(1): 97-104 (1991) |
| 1990 |
|---|
| 15 | | Hiroshi Maehara,
Vojtech Rödl:
On the dimension to represent a graph by a unit distance graph.
Graphs and Combinatorics 6(4): 365-367 (1990) |
| 1989 |
|---|
| 14 | | Hiroshi Maehara:
Note on Induced Subgraphs of the Unit Distance Graph En.
Discrete & Computational Geometry 4: 15-18 (1989) |
| 13 | | Hiroshi Maehara:
Helly-Type Theorems for Spheres.
Discrete & Computational Geometry 4: 279-285 (1989) |
| 1988 |
|---|
| 12 | | Peter Frankl,
Hiroshi Maehara:
On the Contact Dimensions of Graphs.
Discrete & Computational Geometry 3: 89-96 (1988) |
| 11 | | Hiroshi Maehara:
On the euclidean dimension of a complete multipartite graph.
Discrete Mathematics 72(1-3): 285-289 (1988) |
| 10 | | Hiroshi Maehara,
Jan Reiterman,
Vojtech Rödl,
Edita Sinajová:
Embedding of trees in euclidean spaces.
Graphs and Combinatorics 4(1): 43-47 (1988) |
| 9 | | Peter Frankl,
Hiroshi Maehara:
The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
J. Comb. Theory, Ser. B 44(3): 355-362 (1988) |
| 1987 |
|---|
| 8 | | Peter Frankl,
Hiroshi Maehara:
Open-interval graphs versus closed-interval graphs.
Discrete Mathematics 63(1): 97-100 (1987) |
| 7 | | Hiroshi Maehara:
On the number of induced subgraphs of a random graph.
Discrete Mathematics 64(2-3): 309-312 (1987) |
| 1986 |
|---|
| 6 | | Hiroshi Maehara:
On the sphericity of the graphs of semiregular polyhedra.
Discrete Mathematics 58(3): 311-315 (1986) |
| 5 | | Hiroshi Maehara:
Metric transforms of finite spaces and connected graphs.
Discrete Mathematics 61(2-3): 235-246 (1986) |
| 4 | | Hiroshi Maehara:
Sphericity exceeds cubicity for almost all complete bipartite graphs.
J. Comb. Theory, Ser. B 40(2): 231-235 (1986) |
| 1985 |
|---|
| 3 | | Hiroshi Maehara:
Contact patterns of equal nonoverlapping spheres.
Graphs and Combinatorics 1(1): 271-282 (1985) |
| 1984 |
|---|
| 2 | | Hiroshi Maehara:
On the sphericity for the join of many graphs.
Discrete Mathematics 49(3): 311-313 (1984) |
| 1980 |
|---|
| 1 | | Hiroshi Maehara:
On time graphs.
Discrete Mathematics 32(3): 281-289 (1980) |
Data released under the ODC-BY 1.0 license — See also our legal information page