default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonrad J. Swanepoel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j38]Jérémy Lavollée, Konrad J. Swanepoel
:
A Tight Bound for the Number of Edges of Matchstick Graphs. Discret. Comput. Geom. 72(4): 1530-1544 (2024)- 2023
- [j37]Jérémy Lavollée, Konrad J. Swanepoel:
The Number of Small-Degree Vertices in Matchstick Graphs. Australas. J Comb. 85: 92-99 (2023) - 2022
- [j36]Márton Naszódi, Konrad J. Swanepoel:
Contacts in totally separable packings in the plane and in high dimensions. J. Comput. Geom. 13(1): 471-483 (2022) - [j35]Jérémy Lavollée, Konrad J. Swanepoel:
Bounding the Number of Edges of Matchstick Graphs. SIAM J. Discret. Math. 36(1): 777-785 (2022) - [i7]Jérémy Lavollée, Konrad J. Swanepoel:
The number of small-degree vertices in matchstick graphs. CoRR abs/2206.03956 (2022) - [i6]Jérémy Lavollée, Konrad J. Swanepoel:
A tight bound for the number of edges of matchstick graphs. CoRR abs/2209.09800 (2022) - 2021
- [i5]Jérémy Lavollée, Konrad J. Swanepoel:
Bounding the number of edges of matchstick graphs. CoRR abs/2108.07522 (2021) - 2020
- [j34]Konrad J. Swanepoel:
Favourite Distances in 3-Space. Electron. J. Comb. 27(2): 2 (2020) - [j33]Martin Balko, Attila Pór, Manfred Scheucher, Konrad J. Swanepoel, Pavel Valtr:
Almost-Equidistant Sets. Graphs Comb. 36(3): 729-754 (2020) - [j32]Alastair Maxwell, Konrad J. Swanepoel:
Shortest Directed Networks in the Plane. Graphs Comb. 36(5): 1457-1475 (2020) - [j31]Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel:
Embedding graphs in Euclidean space. J. Comb. Theory A 171 (2020)
2010 – 2019
- 2019
- [j30]Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the Size of an Almost-Equidistant Set in Euclidean Space. Comb. Probab. Comput. 28(2): 280-286 (2019) - [j29]Aaron Lin, Konrad J. Swanepoel:
Ordinary planes, coplanar quadruples, and space quartics. J. Lond. Math. Soc. 100(3): 937-956 (2019) - [i4]Alastair Maxwell, Konrad J. Swanepoel:
Shortest directed networks in the plane. CoRR abs/1903.07172 (2019) - [i3]Konrad J. Swanepoel:
Favourite distances in 3-space. CoRR abs/1907.08402 (2019) - 2018
- [j28]Márton Naszódi, Konrad J. Swanepoel:
Arrangements of Homothets of a Convex Body II. Contributions Discret. Math. 13(2) (2018) - [j27]Aaron Lin, Mehdi Makhul, Hossein Nassajian Mojarrad, Josef Schicho, Konrad J. Swanepoel, Frank de Zeeuw:
On Sets Defining Few Ordinary Circles. Discret. Comput. Geom. 59(1): 59-87 (2018) - 2017
- [j26]Nóra Frankl, Andrey Kupavskii, Konrad J. Swanepoel:
Embedding graphs in Euclidean space. Electron. Notes Discret. Math. 61: 475-481 (2017) - [j25]Charl J. Ras, Konrad J. Swanepoel, Doreen Anne Thomas:
Approximate Euclidean Steiner Trees. J. Optim. Theory Appl. 172(3): 845-873 (2017) - [i2]Andrey Kupavskii, Nabil H. Mustafa, Konrad J. Swanepoel:
Bounding the size of an almost-equidistant set in Euclidean space. CoRR abs/1708.01590 (2017) - 2015
- [j24]Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
Generalised k-Steiner Tree Problems in Normed Planes. Algorithmica 71(1): 66-86 (2015) - 2013
- [j23]Konrad J. Swanepoel, Rafael Villa:
Maximal Equilateral Sets. Discret. Comput. Geom. 50(2): 354-373 (2013) - [j22]M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
The Gilbert arborescence problem. Networks 61(3): 238-247 (2013) - 2011
- [j21]Lourens M. Pretorius, Konrad J. Swanepoel:
Embedding a Latin square with transversal into a projective space. J. Comb. Theory A 118(5): 1674-1683 (2011) - [i1]Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
Generalised k-Steiner Tree Problems in Normed Planes. CoRR abs/1111.1464 (2011) - 2010
- [j20]Konrad J. Swanepoel, Pavel Valtr:
Large Convexly Independent Subsets of Minkowski Sums. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j19]Konrad J. Swanepoel:
Unit Distances and Diameters in Euclidean Spaces. Discret. Comput. Geom. 41(1): 1-27 (2009) - [j18]Konrad J. Swanepoel:
Simultaneous Packing and Covering in Sequence Spaces. Discret. Comput. Geom. 42(2): 335-340 (2009) - [j17]Lourens M. Pretorius, Konrad J. Swanepoel:
The Sylvester-Gallai theorem, colourings and algebra. Discret. Math. 309(2): 385-399 (2009) - [j16]Balázs Csikós, György Kiss, Konrad J. Swanepoel, Pieter Oloff de Wet:
Large antipodal families. Period. Math. Hung. 58(2): 129-138 (2009) - 2008
- [j15]Konrad J. Swanepoel:
A new proof of Vázsonyi's conjecture. J. Comb. Theory A 115(5): 888-892 (2008) - [j14]József Solymosi, Konrad J. Swanepoel:
Elementary Incidence Theorems for Complex Numbers and Quaternions. SIAM J. Discret. Math. 22(3): 1145-1148 (2008) - 2007
- [j13]Konrad J. Swanepoel:
The Local Steiner Problem in Finite-Dimensional Normed Spaces. Discret. Comput. Geom. 37(3): 419-442 (2007) - [j12]Konrad J. Swanepoel:
Upper bounds for edge-antipodal and subequilateral polytopes. Period. Math. Hung. 54(1): 99-106 (2007) - 2006
- [j11]Horst Martini, Konrad J. Swanepoel:
Low-degree minimal spanning trees in normed spaces. Appl. Math. Lett. 19(2): 122-125 (2006) - [j10]Lourens M. Pretorius, Konrad J. Swanepoel:
Blocking sets in small finite linear spaces. Ars Comb. 80 (2006) - 2005
- [j9]Annalisa De Bonis, Gyula O. H. Katona, Konrad J. Swanepoel:
Largest family without A union B subset of C intersection D. J. Comb. Theory A 111(2): 331-336 (2005) - 2004
- [j8]Lourens M. Pretorius, Konrad J. Swanepoel:
An Algorithmic Proof of the Motzkin-Rabin Theorem on Monochrome Lines. Am. Math. Mon. 111(3): 245-251 (2004) - 2002
- [j7]Konrad J. Swanepoel:
Independence Numbers of Planar Contact Graphs. Discret. Comput. Geom. 28(4): 649-670 (2002) - [j6]Konrad J. Swanepoel:
Helly-type theorems for polygonal curves. Discret. Math. 254(1-3): 527-537 (2002) - 2001
- [j5]Peter Braß, Günter Rote, Konrad J. Swanepoel:
Triangles of Extremal Area or Perimeter in a Finite Planar Point Set. Discret. Comput. Geom. 26(1): 51-58 (2001) - 2000
- [j4]Konrad J. Swanepoel:
Balancing Unit Vectors. J. Comb. Theory A 89(1): 105-112 (2000) - [j3]Konrad J. Swanepoel:
The local Steiner problem in normed planes. Networks 36(2): 104-113 (2000)
1990 – 1999
- 1999
- [j2]Konrad J. Swanepoel:
Vertex Degrees of Steiner Minimal Trees in lpd and Other Smooth Minkowski Spaces. Discret. Comput. Geom. 21(3): 437-447 (1999) - [j1]Konrad J. Swanepoel:
Cardinalities of k-distance sets in Minkowski spaces. Discret. Math. 197-198: 759-767 (1999)
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-12-23 20:35 CET 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:
