Konrad J. Swanepoel

Orcid: 0000-0002-1668-887X

According to our database1, Konrad J. Swanepoel authored at least 36 papers between 1999 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The Number of Small-Degree Vertices in Matchstick Graphs.
Australas. J Comb., 2023

2022
Bounding the Number of Edges of Matchstick Graphs.
SIAM J. Discret. Math., 2022

A tight bound for the number of edges of matchstick graphs.
CoRR, 2022

2020
Shortest Directed Networks in the Plane.
Graphs Comb., 2020

Almost-Equidistant Sets.
Graphs Comb., 2020

Favourite Distances in 3-Space.
Electron. J. Comb., 2020

2019
Ordinary planes, coplanar quadruples, and space quartics.
J. Lond. Math. Soc., 2019

Bounding the Size of an Almost-Equidistant Set in Euclidean Space.
Comb. Probab. Comput., 2019

2018
On Sets Defining Few Ordinary Circles.
Discret. Comput. Geom., 2018

Arrangements of Homothets of a Convex Body II.
Contributions Discret. Math., 2018

2017
Approximate Euclidean Steiner Trees.
J. Optim. Theory Appl., 2017

Embedding graphs in Euclidean space.
Electron. Notes Discret. Math., 2017

2015
Generalised k-Steiner Tree Problems in Normed Planes.
Algorithmica, 2015

2013
The Gilbert arborescence problem.
Networks, 2013

Maximal Equilateral Sets.
Discret. Comput. Geom., 2013

2011
Embedding a Latin square with transversal into a projective space.
J. Comb. Theory, Ser. A, 2011

2010
Large Convexly Independent Subsets of Minkowski Sums.
Electron. J. Comb., 2010

2009
Large antipodal families.
Period. Math. Hung., 2009

The Sylvester-Gallai theorem, colourings and algebra.
Discret. Math., 2009

Simultaneous Packing and Covering in Sequence Spaces.
Discret. Comput. Geom., 2009

Unit Distances and Diameters in Euclidean Spaces.
Discret. Comput. Geom., 2009

2008
Elementary Incidence Theorems for Complex Numbers and Quaternions.
SIAM J. Discret. Math., 2008

A new proof of Vázsonyi's conjecture.
J. Comb. Theory, Ser. A, 2008

2007
Upper bounds for edge-antipodal and subequilateral polytopes.
Period. Math. Hung., 2007

The Local Steiner Problem in Finite-Dimensional Normed Spaces.
Discret. Comput. Geom., 2007

2006
Blocking sets in small finite linear spaces.
Ars Comb., 2006

Low-degree minimal spanning trees in normed spaces.
Appl. Math. Lett., 2006

2005
Largest family without <i>A</i> union <i>B</i> subset of <i>C</i> intersection <i>D</i>.
J. Comb. Theory, Ser. A, 2005

2004
An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines.
Am. Math. Mon., 2004

2002
Helly-type theorems for polygonal curves.
Discret. Math., 2002

Independence Numbers of Planar Contact Graphs.
Discret. Comput. Geom., 2002

2001
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set.
Discret. Comput. Geom., 2001

2000
The local Steiner problem in normed planes.
Networks, 2000

Balancing Unit Vectors.
J. Comb. Theory, Ser. A, 2000

1999
Cardinalities of k-distance sets in Minkowski spaces.
Discret. Math., 1999

Vertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces.
Discret. Comput. Geom., 1999


  Loading...