The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Heiko Harborth: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jens-P. Bode, Hans-Dietrich O. F. Gronau, Heiko Harborth
    Some Ramsey Schur Numbers. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2005, v:14, n:1-2, pp:25-30 [Journal]
  2. Heiko Harborth, Meinhard Möller
    Weakened Ramsey Numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:279-284 [Journal]
  3. Heiko Harborth, Arnfried Kemnitz, Meinhard Möller
    An Upper Bound for the Minimum Diameter of Integral Point Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1993, v:9, n:, pp:427-432 [Journal]
  4. Jens-P. Bode, Heiko Harborth
    Hexagonal polyomino achievement. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:5-18 [Journal]
  5. Jens-P. Bode, Heiko Harborth
    Independence for knights on hexagon and triangle boards. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:1, pp:27-35 [Journal]
  6. Jens-P. Bode, Heiko Harborth
    Directed paths of diagonals within polygons. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:299, n:1-3, pp:3-10 [Journal]
  7. Jens-P. Bode, Heiko Harborth, Martin Harborth
    King independence on triangle boards. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:266, n:1-3, pp:101-107 [Journal]
  8. Heiko Harborth
    Eulerian straight ahead cycles in drawings of complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:230, n:1-3, pp:45-48 [Journal]
  9. Heiko Harborth
    Special numbers of crossings for complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:244, n:1-3, pp:95-102 [Journal]
  10. Heiko Harborth, Hanno Lefmann
    Coloring arcs of convex sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:107-117 [Journal]
  11. Heiko Harborth, Ingrid Mengersen
    Ramsey numbers in octahedron graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:241-246 [Journal]
  12. Heiko Harborth, Christian Thürmann
    Smallest limited snakes in d-grids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:145-149 [Journal]
  13. Arnfried Kemnitz, Heiko Harborth
    Plane integral drawings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:236, n:1-3, pp:191-195 [Journal]
  14. Heiko Harborth
    Solution of Steinhaus's Problem with Plus and Minus Signs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1972, v:12, n:2, pp:253-259 [Journal]
  15. Heiko Harborth, Silke Maasberg
    Rado Numbers fora(x+y)=bz. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:80, n:2, pp:356-363 [Journal]
  16. Heiko Harborth, Lothar Piepmeyer
    Zero-Sum Ramsey Numbers modulo 3. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:1, pp:145-147 [Journal]
  17. Heiko Harborth, Ingrid Mengersen
    Point sets with many unit circles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:60, n:, pp:193-197 [Journal]
  18. Heiko Harborth, Ingrid Mengersen
    All Ramsey numbers for five vertices and seven or eight edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:91-98 [Journal]
  19. Heiko Harborth, Philipp Oertel, Thomas Prellberg
    No-three-in-line for seventeen and nineteen. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:89-90 [Journal]
  20. Knut Dehnhardt, Heiko Harborth
    Universal tilings of the plane by 0-1-matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:73, n:1-2, pp:65-70 [Journal]
  21. Heiko Harborth
    Empty triangles in drawings of the complete graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:109-111 [Journal]
  22. Heiko Harborth, Silke Maasberg
    All two-color Rado numbers for a(x + y) = bz. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:397-407 [Journal]
  23. Heiko Harborth
    Plane four-regular graphs with vertex-to-vertex unit triangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:97, n:1-3, pp:219-222 [Journal]
  24. Holger Brandes, Heiko Harborth, Hans-Dietrich O. F. Gronau, Christian Schwahn
    Ramsey numbers for sets of small graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:73-86 [Journal]

Search in 0.003secs, Finished in 0.004secs
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