default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHiroshi Maehara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j77]Hiroshi Maehara
, Horst Martini:
Kissing Numbers for Balls with Varying Radii. Graphs Comb. 38(6): 183 (2022)- 2020
- [j76]Hiroshi Maehara, Horst Martini:
Tangent Spheres of Tetrahedra and a Theorem of Grace. Am. Math. Mon. 127(10): 897-910 (2020)
2010 – 2019
- 2019
- [j75]Hiroshi Maehara:
Planar lattices and equilateral polygons. Eur. J. Comb. 80: 277-286 (2019) - [c6]Andreas W. M. Dress, Hiroshi Maehara, Sabrina Xing Mei Pang, Zhenbing Zeng:
On the Structure of Discrete Metric Spaces Isometric to Circles. AAIM 2019: 83-94 - 2017
- [j74]Hiroshi Maehara, Horst Martini:
Separating n-point sets from quasi-finite ones via polyhedral surfaces. Eur. J. Comb. 61: 85-90 (2017) - [j73]Hiroshi Maehara, Horst Martini:
On Lexell's Theorem. Am. Math. Mon. 124(4): 337-344 (2017) - 2016
- [j72]Takayasu Kuwata, Hiroshi Maehara:
Another exploration problem. Discret. Math. 339(5): 1543-1550 (2016) - 2015
- [j71]Hiroshi Maehara:
Circle lattice point problem, revisited. Discret. Math. 338(3): 164-167 (2015) - 2013
- [j70]Hiroshi Maehara:
Euclidean embeddings of finite metric spaces. Discret. Math. 313(23): 2848-2856 (2013) - [c5]Takayasu Kuwata, Hiroshi Maehara:
Generating Polygons with Triangles. JCDCGG 2013: 112-121 - 2012
- [j69]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
- [j68]Hiroshi Maehara:
On a proper acute triangulation of a polyhedral surface. Discret. Math. 311(17): 1903-1909 (2011) - [j67]Severino Villanueva Gervacio, Hiroshi Maehara:
A Note on Lights-Out-Puzzle: Parity-State Graphs. Graphs Comb. 27(1): 109-119 (2011) - [j66]Takayasu Kuwata, Hiroshi Maehara:
Lattice Points on Similar Figures and Conics. Graphs Comb. 27(3): 441-450 (2011) - [j65]Hiroshi Maehara, Norihide Tokushige:
Classification of the Congruent Embeddings of a Tetrahedron into a Triangular Prism. Graphs Comb. 27(3): 451-463 (2011) - 2010
- [j64]Hiroshi Maehara:
On a sphere that passes through n lattice points. Eur. J. Comb. 31(2): 617-621 (2010) - [j63]Hiroshi Maehara:
Reversing a polyhedral surface by origami-deformation. Eur. J. Comb. 31(4): 1171-1180 (2010) - [j62]Victor Alexandrov, Hiroshi Maehara, Anatoliy D. Milka, Idzhad Kh. Sabitov, Jean-Marc Schlenker, Brigitte Servatius, Herman Servatius:
Problem section. Eur. J. Comb. 31(4): 1196-1204 (2010) - [c4]Hiroshi Maehara:
On the Diameter of a Circle to Hold a Cube. CGGA 2010: 147-153
2000 – 2009
- 2009
- [j61]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) - [j60]Hiroshi Maehara, Imre Z. Ruzsa, Norihide Tokushige:
Large regular simplices contained in a hypercube. Period. Math. Hung. 58(1): 121-126 (2009) - 2008
- [j59]Severino Villanueva Gervacio, Yvette Fajardo-Lim, Hiroshi Maehara:
Planar unit-distance graphs having planar unit-distance complement. Discret. Math. 308(10): 1973-1984 (2008) - 2007
- [j58]Hiroshi Maehara:
The problem of thirteen spheres - a proof for undergraduates. Eur. J. Comb. 28(6): 1770-1778 (2007) - [j57]Hiroshi Maehara:
On Configurations of Solid Balls in 3-Space: Chromatic Numbers and Knotted Cycles. Graphs Comb. 23(Supplement-1): 307-320 (2007) - 2006
- [j56]Severino Villanueva Gervacio, Hiroshi Maehara:
Partial order on a family of k-subsets of a linearly ordered set. Discret. Math. 306(4): 413-419 (2006) - 2005
- [j55]Hiroshi Maehara, Tudor Zamfirescu:
On the Perimeter of a Triangle in a Minkowski Plane. Am. Math. Mon. 112(6): 521-522 (2005) - 2004
- [j54]Hiroshi Maehara:
On the intersection graph of random caps on a sphere. Eur. J. Comb. 25(5): 707-718 (2004) - 2003
- [j53]Hiroshi Maehara:
Plane graphs with straight edges whose bounded faces are acute triangles. J. Comb. Theory B 88(2): 237-245 (2003) - [j52]Hiroshi Maehara:
On a condition for the union of spherical caps to be connected. J. Comb. Theory A 101(2): 264-270 (2003) - 2002
- [j51]Hiroshi Maehara:
Acute Triangulations of Polygons. Eur. J. Comb. 23(1): 45-55 (2002) - [j50]Hiroshi Maehara:
The Length of the Shortest Edge of a Graph on a Sphere. Eur. J. Comb. 23(6): 713-717 (2002) - [j49]Hiroshi Maehara:
An Inequality on the Size of a Set in a Cartesian Product. Eur. J. Comb. 23(8): 1055-1059 (2002) - [j48]Hiroshi Maehara, Ai Oshiro:
Arranging Solid Balls to Represent a Graph. Graphs Comb. 18(2): 343-365 (2002) - [c3]Yoichi Maeda, Hiroshi Maehara:
Observing an Angle from Various Viewpoints. JCDCG 2002: 200-203 - 2001
- [j47]Hiroshi Maehara, Ai Oshiro:
Cutting a Bunch of Grapes by a Plane. Eur. J. Comb. 22(6): 847-853 (2001) - [j46]Kiyoshi Hosono, Hiroshi Maehara, Katsumi Matsuda:
A Pair in a Crowd of Unit Balls. Eur. J. Comb. 22(8): 1083-1092 (2001) - [j45]Hiroshi Maehara, Ai Oshiro:
Piercing a Set of Disjoint Balls by a Line. J. Comb. Theory A 94(2): 393-398 (2001) - [j44]Hiroshi Maehara:
On the Total Edge-Length of a Tetrahedron. Am. Math. Mon. 108(10): 967-969 (2001) - [j43]Hiroshi Maehara, Norihide Tokushige:
When does a planar bipartite framework admit a continuous deformation? Theor. Comput. Sci. 263(1-2): 345-354 (2001) - 2000
- [j42]Severino Villanueva Gervacio, Hiroshi Maehara:
Subdividing a Graph Toward a Unit-distance Graph in the Plane. Eur. J. Comb. 21(2): 223-229 (2000) - [j41]Hiroshi Maehara, Ai Oshiro:
Piercing Balls Sitting on a Table by a Vertical Line. Eur. J. Comb. 21(4): 509-517 (2000) - [j40]Hiroshi Maehara, Ai Oshiro:
Cutting a Set of Disks by a Line with Leaving Many Intact Disks in Both Sides. J. Comb. Theory A 90(1): 235-240 (2000) - [j39]Hiroshi Maehara:
Can a convex polyhedron have a developable face-cycle? Theor. Comput. Sci. 235(2): 267-270 (2000) - [c2]Hiroshi Maehara:
On Acute Triangulations of Quadrilaterals. JCDCG 2000: 237-243
1990 – 1999
- 1999
- [j38]Hiroshi Maehara, Ai Oshiro:
On Knotted Necklaces of Pearls. Eur. J. Comb. 20(5): 411-420 (1999) - [j37]Hiroshi Maehara:
Configuration Spaces of Pentagonal Frameworks. Eur. J. Comb. 20(8): 839-844 (1999) - [j36]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 B 75(1): 110-115 (1999) - 1998
- [j35]Hiroshi Maehara:
Embedding a set of rational points in lower dimensions. Discret. Math. 192(1-3): 273-279 (1998) - [j34]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) - [c1]Hiroshi Maehara, Ai Oshiro:
On Soddy's Hexlet and a Linked 4-Pair. JCDCG 1998: 188-193 - 1997
- [j33]Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige:
Every Graph Is an Integral Distance Graph in the Plane. J. Comb. Theory A 80(2): 290-294 (1997) - 1996
- [j32]Hiroshi Maehara:
On sqrt(Q)-Distances. Eur. J. Comb. 17(2-3): 271-277 (1996) - [j31]Hiroshi Maehara, Norihide Tokushige:
A spatial unit-bar-framework which is rigid and triangle-free. Graphs Comb. 12(1): 341-344 (1996) - 1995
- [j30]Hiroshi Maehara:
Embedding a Polytope in a Lattice. Discret. Comput. Geom. 13: 585-592 (1995) - [j29]Peter Frankl, Hiroshi Maehara, Junichiro Nakashima:
On the section of a convex polyhedron. Discret. Math. 140(1-3): 265-267 (1995) - 1994
- [j28]David Avis, Hiroshi Maehara:
Metric extensions and the L1 hierarchy. Discret. Math. 131(1-3): 17-28 (1994) - [j27]Michel Deza, Hiroshi Maehara:
Projecting a Simplex onto Another One. Eur. J. Comb. 15(1): 13-16 (1994) - [j26]Michel Deza, Hiroshi Maehara:
A few applications of negative- type inequalities. Graphs Comb. 10(2-4): 255-262 (1994) - 1993
- [j25]Imre Bárány, Peter Frankl, Hiroshi Maehara:
Reflecting a triangle in the plane. Graphs Comb. 9(2-4): 97-104 (1993) - 1992
- [j24]Hiroshi Maehara:
Extending a flexible unit-bar framework to a rigid one. Discret. Math. 108(1-3): 167-174 (1992) - 1991
- [j23]Hiroshi Maehara:
Distances in a rigid unit-distance graph in the plane. Discret. Appl. Math. 31(2): 193-200 (1991) - [j22]Hiroshi Maehara:
Dispersed Points and Geometric Embedding of Complete Bipartite Graphs. Discret. Comput. Geom. 6: 57-67 (1991) - [j21]Hiroshi Maehara:
On Graver's Conjecture Concerning the Rigidity Problem of Graphs. Discret. Comput. Geom. 6: 339-342 (1991) - [j20]Hiroshi Maehara:
The intersection graph of random sets. Discret. Math. 87(1): 97-104 (1991) - 1990
- [j19]Peter Frankl, Hiroshi Maehara:
Simplices with Given 2-Face Areas. Eur. J. Comb. 11(3): 241-247 (1990) - [j18]Hiroshi Maehara, Vojtech Rödl:
On the dimension to represent a graph by a unit distance graph. Graphs Comb. 6(4): 365-367 (1990)
1980 – 1989
- 1989
- [j17]Hiroshi Maehara:
Note on Induced Subgraphs of the Unit Distance Graph En. Discret. Comput. Geom. 4: 15-18 (1989) - [j16]Hiroshi Maehara:
Helly-Type Theorems for Spheres. Discret. Comput. Geom. 4: 279-285 (1989) - 1988
- [j15]Peter Frankl, Hiroshi Maehara:
On the Contact Dimensions of Graphs. Discret. Comput. Geom. 3: 89-96 (1988) - [j14]Hiroshi Maehara:
On the euclidean dimension of a complete multipartite graph. Discret. Math. 72(1-3): 285-289 (1988) - [j13]Hiroshi Maehara, Jan Reiterman, Vojtech Rödl, Edita Sinajová:
Embedding of trees in euclidean spaces. Graphs Comb. 4(1): 43-47 (1988) - [j12]Peter Frankl, Hiroshi Maehara:
The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory B 44(3): 355-362 (1988) - 1987
- [j11]Peter Frankl, Hiroshi Maehara:
Open-interval graphs versus closed-interval graphs. Discret. Math. 63(1): 97-100 (1987) - [j10]Hiroshi Maehara:
On the number of induced subgraphs of a random graph. Discret. Math. 64(2-3): 309-312 (1987) - 1986
- [j9]Hiroshi Maehara:
On the sphericity of the graphs of semiregular polyhedra. Discret. Math. 58(3): 311-315 (1986) - [j8]Hiroshi Maehara:
Metric transforms of finite spaces and connected graphs. Discret. Math. 61(2-3): 235-246 (1986) - [j7]Peter Frankl, Hiroshi Maehara:
Embedding the n-cube in Lower Dimensions. Eur. J. Comb. 7(3): 221-225 (1986) - [j6]Hiroshi Maehara:
Sphericity exceeds cubicity for almost all complete bipartite graphs. J. Comb. Theory B 40(2): 231-235 (1986) - 1985
- [j5]Hiroshi Maehara:
Contact patterns of equal nonoverlapping spheres. Graphs Comb. 1(1): 271-282 (1985) - 1984
- [j4]Hiroshi Maehara:
Space graphs and sphericity. Discret. Appl. Math. 7(1): 55-64 (1984) - [j3]Hiroshi Maehara:
On the sphericity for the join of many graphs. Discret. Math. 49(3): 311-313 (1984) - [j2]Hiroshi Maehara:
A digraph represented by a family of boxes or spheres. J. Graph Theory 8(3): 431-439 (1984) - 1980
- [j1]Hiroshi Maehara:
On time graphs. Discret. Math. 32(3): 281-289 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
