Solution of Steinhaus's Problem with Plus and Minus Signs. - Heiko Harborth (J. Comb. Theory A, 1972)

An upper bound for the ramsey number r(K5 - e). - Heiko Harborth; Ingrid Mengersen (J. Graph Theory, 1985)

Point sets with many unit circles. - Heiko Harborth; Ingrid Mengersen (Discret. Math., 1986)

Universal tilings of the plane by 0-1-matrices. - Knut Dehnhardt; Heiko Harborth (Discret. Math., 1989)

All Ramsey numbers for five vertices and seven or eight edges. - Heiko Harborth; Ingrid Mengersen (Discret. Math., 1989)

No-three-in-line for seventeen and nineteen. - Heiko Harborth; Philipp Oertel; Thomas Prellberg (Discret. Math., 1989)

The ramsey number of k5 - e. - C. R. J. Clapham; Geoffrey Exoo; Heiko Harborth; Ingrid Mengersen; J. Sheehan (J. Graph Theory, 1989)

Points Sets with Small Integral Distances. - Heiko Harborth; Lothar Piepmeyer (Applied Geometry And Discrete Mathematics, 1990)

Minimum sets of partial polyominoes. - Heiko Harborth; Hartmut Weiss (Australas. J Comb., 1991)

Plane four-regular graphs with vertex-to-vertex unit triangles. - Heiko Harborth (Discret. Math., 1991)

An Upper Bound for the Minimum Diameter of Integral Point Sets. - Heiko Harborth; Arnfried Kemnitz; Meinhard Möller (Discret. Comput. Geom., 1993)

Ramsey numbers for sets of small graphs. - Holger Brandes; Heiko Harborth; Hans-Dietrich O. F. Gronau; Christian Schwahn (Discret. Math., 1994)

The drawing Ramsey number Dr(Kn). - Heiko Harborth; Ingrid Mengersen; Richard H. Schelp (Australas. J Comb., 1995)

On the maximum number of edges in a c4-free subgraph of qn. - Peter Brass; Heiko Harborth; Hauke Nienborg (J. Graph Theory, 1995)

Zero-Sum Ramsey Numbers modulo 3. - Heiko Harborth; Lothar Piepmeyer (J. Comb. Theory A, 1996)

Rado Numbers fora(x+y)=bz. - Heiko Harborth; Silke Maasberg (J. Comb. Theory A, 1997)

Empty triangles in drawings of the complete graph. - Heiko Harborth (Discret. Math., 1998)

Weakened Ramsey Numbers. - Heiko Harborth; Meinhard Möller (Discret. Appl. Math., 1999)

All two-color Rado numbers for a(x + y) = bz. - Heiko Harborth; Silke Maasberg (Discret. Math., 1999)

Hexagonal polyomino achievement. - Jens-P. Bode; Heiko Harborth (Discret. Math., 2000)

Coloring arcs of convex sets. - Heiko Harborth; Hanno Lefmann (Discret. Math., 2000)

Eulerian straight ahead cycles in drawings of complete bipartite graphs. - Heiko Harborth (Discret. Math., 2001)

Ramsey numbers in octahedron graphs. - Heiko Harborth; Ingrid Mengersen (Discret. Math., 2001)

Smallest limited snakes in d-grids. - Heiko Harborth; Christian Thürmann (Discret. Math., 2001)

Plane integral drawings of planar graphs. - Arnfried Kemnitz; Heiko Harborth (Discret. Math., 2001)

Special numbers of crossings for complete graphs. - Heiko Harborth (Discret. Math., 2002)

Independence for knights on hexagon and triangle boards. - Jens-P. Bode; Heiko Harborth (Discret. Math., 2003)

King independence on triangle boards. - Jens-P. Bode; Heiko Harborth; Martin Harborth (Discret. Math., 2003)

Some Ramsey Schur Numbers. - Jens-P. Bode; Hans-Dietrich O. F. Gronau; Heiko Harborth (Comb. Probab. Comput., 2005)

Directed paths of diagonals within polygons. - Jens-P. Bode; Heiko Harborth (Discret. Math., 2005)

Rainbows in the Hypercube. - Maria Axenovich; Heiko Harborth; Arnfried Kemnitz; Meinhard Möller; Ingo Schiermeyer (Graphs Comb., 2007)

The Maximum of the Maximum Rectilinear Crossing Numbers of d-Regular Graphs of Order n. - Matthew Alpert; Elie Feder; Heiko Harborth (Electron. J. Comb., 2009)

The minimum size of kk-rainbow connected graphs of given order. - Jens-P. Bode; Heiko Harborth (Discret. Math., 2013)

On Path Convex Ramsey Numbers. - Chula J. Jayawardene; Cecil C. Rousseau; Heiko Harborth (J. Graph Theory, 2017)