The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hiroshi Maehara: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yoichi Maeda, Hiroshi Maehara
    Observing an Angle from Various Viewpoints. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:200-203 [Conf]
  2. Hiroshi Maehara
    On Acute Triangulations of Quadrilaterals. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:237-243 [Conf]
  3. Hiroshi Maehara, Ai Oshiro
    On Soddy's Hexlet and a Linked 4-Pair. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:188-193 [Conf]
  4. Peter Frankl, Hiroshi Maehara
    On the Contact Dimensions of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:89-96 [Journal]
  5. Hiroshi Maehara
    Note on Induced Subgraphs of the Unit Distance Graph En. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:15-18 [Journal]
  6. Hiroshi Maehara
    Helly-Type Theorems for Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:279-285 [Journal]
  7. Hiroshi Maehara
    Dispersed Points and Geometric Embedding of Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:57-67 [Journal]
  8. Hiroshi Maehara
    On Graver's Conjecture Concerning the Rigidity Problem of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1991, v:6, n:, pp:339-342 [Journal]
  9. Hiroshi Maehara
    Embedding a Polytope in a Lattice. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:585-592 [Journal]
  10. Severino V. Gervacio, Hiroshi Maehara
    Partial order on a family of k-subsets of a linearly ordered set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:4, pp:413-419 [Journal]
  11. Michel Deza, Hiroshi Maehara
    Projecting a Simplex onto Another One. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1994, v:15, n:1, pp:13-16 [Journal]
  12. Severino V. Gervacio, Hiroshi Maehara
    Subdividing a Graph Toward a Unit-distance Graph in the Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:2, pp:223-229 [Journal]
  13. Kiyoshi Hosono, Hiroshi Maehara, Katsumi Matsuda
    A Pair in a Crowd of Unit Balls. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:8, pp:1083-1092 [Journal]
  14. Hiroshi Maehara
    Acute Triangulations of Polygons. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:1, pp:45-55 [Journal]
  15. Hiroshi Maehara
    The Length of the Shortest Edge of a Graph on a Sphere. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:6, pp:713-717 [Journal]
  16. Hiroshi Maehara
    An Inequality on the Size of a Set in a Cartesian Product. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:8, pp:1055-1059 [Journal]
  17. Hiroshi Maehara
    On the intersection graph of random caps on a sphere. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2004, v:25, n:5, pp:707-718 [Journal]
  18. Hiroshi Maehara
    On sqrt(Q)-Distances. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:2-3, pp:271-277 [Journal]
  19. Hiroshi Maehara
    Configuration Spaces of Pentagonal Frameworks. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:8, pp:839-844 [Journal]
  20. Hiroshi Maehara, Makoto Matsumoto
    Is There a Circle that Passes Through a Given Number of Lattice Points? [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:5, pp:591-592 [Journal]
  21. Hiroshi Maehara, Ai Oshiro
    Piercing Balls Sitting on a Table by a Vertical Line. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:4, pp:509-517 [Journal]
  22. Hiroshi Maehara, Ai Oshiro
    Cutting a Bunch of Grapes by a Plane. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2001, v:22, n:6, pp:847-853 [Journal]
  23. Hiroshi Maehara, Ai Oshiro
    On Knotted Necklaces of Pearls. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:5, pp:411-420 [Journal]
  24. Hiroshi Maehara, Ai Oshiro
    Arranging Solid Balls to Represent a Graph. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2002, v:18, n:2, pp:343-365 [Journal]
  25. Peter Frankl, Hiroshi Maehara
    The Johnson-Lindenstrauss lemma and the sphericity of some graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1988, v:44, n:3, pp:355-362 [Journal]
  26. Atsushi Kaneko, Hiroshi Maehara, Mamoru Watanabe
    On the Number of Acute Triangles in a Straight-Line Embedding of a Maximal Planar Graph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1999, v:75, n:1, pp:110-115 [Journal]
  27. Hiroshi Maehara
    On a condition for the union of spherical caps to be connected. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:101, n:2, pp:264-270 [Journal]
  28. Hiroshi Maehara
    Plane graphs with straight edges whose bounded faces are acute triangles. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:237-245 [Journal]
  29. Hiroshi Maehara
    Sphericity exceeds cubicity for almost all complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:2, pp:231-235 [Journal]
  30. Hiroshi Maehara, Ai Oshiro
    Cutting a Set of Disks by a Line with Leaving Many Intact Disks in Both Sides. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2000, v:90, n:1, pp:235-240 [Journal]
  31. Hiroshi Maehara, Ai Oshiro
    Piercing a Set of Disjoint Balls by a Line. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:2, pp:393-398 [Journal]
  32. Hiroshi Maehara, Katsuhiro Ota, Norihide Tokushige
    Every Graph Is an Integral Distance Graph in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:290-294 [Journal]
  33. Hiroshi Maehara
    Can a convex polyhedron have a developable face-cycle? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:235, n:2, pp:267-270 [Journal]
  34. Hiroshi Maehara, Norihide Tokushige
    When does a planar bipartite framework admit a continuous deformation? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:263, n:1-2, pp:345-354 [Journal]
  35. Hiroshi Maehara
    On time graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1980, v:32, n:3, pp:281-289 [Journal]
  36. Hiroshi Maehara
    On the sphericity of the graphs of semiregular polyhedra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:311-315 [Journal]
  37. Hiroshi Maehara
    Metric transforms of finite spaces and connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:2-3, pp:235-246 [Journal]
  38. Peter Frankl, Hiroshi Maehara
    Open-interval graphs versus closed-interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:63, n:1, pp:97-100 [Journal]
  39. Hiroshi Maehara
    On the number of induced subgraphs of a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:309-312 [Journal]
  40. Hiroshi Maehara
    On the sphericity for the join of many graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:3, pp:311-313 [Journal]
  41. Hiroshi Maehara
    On the euclidean dimension of a complete multipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:72, n:1-3, pp:285-289 [Journal]
  42. Hiroshi Maehara
    Embedding a set of rational points in lower dimensions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:192, n:1-3, pp:273-279 [Journal]
  43. Hiroshi Maehara
    The intersection graph of random sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:1, pp:97-104 [Journal]
  44. Hiroshi Maehara
    Extending a flexible unit-bar framework to a rigid one. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:108, n:1-3, pp:167-174 [Journal]
  45. David Avis, Hiroshi Maehara
    Metric extensions and the L1 hierarchy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:131, n:1-3, pp:17-28 [Journal]
  46. Peter Frankl, Hiroshi Maehara, Junichiro Nakashima
    On the section of a convex polyhedron. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:140, n:1-3, pp:265-267 [Journal]

  47. Distances in a rigid unit-distance graph in the plane. [Citation Graph (, )][DBLP]


  48. Planar unit-distance graphs having planar unit-distance complement. [Citation Graph (, )][DBLP]


  49. The problem of thirteen spheres - a proof for undergraduates. [Citation Graph (, )][DBLP]


  50. Reversing a polyhedral surface by origami-deformation. [Citation Graph (, )][DBLP]


  51. From line-systems to sphere-systems - Schläfli's double six, Lie's line-sphere transformation, and Grace's theorem. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002