default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas F. Holmsen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j20]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen
:
Some New Results on Geometric Transversals. Discret. Comput. Geom. 72(2): 674-703 (2024)- [c6]Michael Gene Dobbins, Andreas F. Holmsen, Dohyeon Lee:
Colorful Intersections and Tverberg Partitions. SoCG 2024: 52:1-52:13 - 2022
- [j19]Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection Theorems for Triangles. Discret. Comput. Geom. 68(3): 728-737 (2022) - [j18]Andreas F. Holmsen, Seunghun Lee:
Leray numbers of complexes of graphs with bounded matching number. J. Comb. Theory A 189: 105618 (2022) - 2021
- [c5]Xavier Goaoc, Andreas F. Holmsen, Zuzana Patáková:
A Stepping-Up Lemma for Topological Set Systems. SoCG 2021: 40:1-40:17 - [i7]Xavier Goaoc, Andreas F. Holmsen, Zuzana Patáková:
A Stepping-Up Lemma for Topological Set Systems. CoRR abs/2103.09286 (2021) - 2020
- [j17]Andreas F. Holmsen:
Large Cliques in Hypergraphs with Forbidden Substructures. Comb. 40(4): 527-537 (2020) - [j16]Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An experimental study of forbidden patterns in geometric permutations by combinatorial lifting. J. Comput. Geom. 11(2): 131-161 (2020) - [i6]Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection theorems for triangles. CoRR abs/2009.14560 (2020)
2010 – 2019
- 2019
- [c4]Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. SoCG 2019: 40:1-40:16 - [i5]Xavier Goaoc, Andreas F. Holmsen, Cyril Nicaud:
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting. CoRR abs/1903.03014 (2019) - [i4]Michael Gene Dobbins, Andreas F. Holmsen, Tillmann Miltzow:
A Universality Theorem for Nested Polytopes. CoRR abs/1908.02213 (2019) - 2018
- [i3]Michael Gene Dobbins, Andreas F. Holmsen, Tillmann Miltzow:
Smoothed Analysis of the Art Gallery Problem. CoRR abs/1811.01177 (2018) - 2017
- [j15]Andreas F. Holmsen, Jan Kyncl, Claudiu Valculescu:
Near equipartitions of colored point sets. Comput. Geom. 65: 35-42 (2017) - [j14]Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. Discret. Comput. Geom. 58(1): 1-29 (2017) - 2016
- [j13]Andreas F. Holmsen, Edgardo Roldán-Pensado:
The colored Hadwiger transversal theorem in ℝ d. Comb. 36(4): 417-429 (2016) - [j12]Andreas F. Holmsen, János Kincses, Edgardo Roldán-Pensado:
Cutting convex curves. Eur. J. Comb. 58: 34-37 (2016) - 2015
- [j11]Imre Bárány, Andreas F. Holmsen, Roman N. Karasev:
Topology of Geometric Joins. Discret. Comput. Geom. 53(2): 402-413 (2015) - [c3]Michael Gene Dobbins, Andreas F. Holmsen, Alfredo Hubard:
Realization Spaces of Arrangements of Convex Bodies. SoCG 2015: 599-614
2000 – 2009
- 2009
- [j10]Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting Convex Sets by Rays. Discret. Comput. Geom. 42(3): 343-358 (2009) - [j9]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen:
Lower Bounds for Pinning Lines by Balls (Extended Abstract). Electron. Notes Discret. Math. 34: 567-571 (2009) - [i2]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen:
Lower Bounds for Pinning Lines by Balls. CoRR abs/0906.2924 (2009) - 2008
- [j8]Andreas F. Holmsen, János Pach, Helge Tverberg:
Points surrounding the origin. Comb. 28(6): 633-644 (2008) - [j7]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen, Sylvain Petitjean:
Helly-Type Theorems for Line Transversals to Disjoint Unit Balls. Discret. Comput. Geom. 39(1-3): 194-212 (2008) - [c2]Radoslav Fulek, Andreas F. Holmsen, János Pach:
Intersecting convex sets by rays. SCG 2008: 385-391 - 2007
- [j6]Andreas F. Holmsen:
The Katchalski-Lewis Transversal Problem in Rn. Discret. Comput. Geom. 37(3): 341-349 (2007) - [j5]Raghavan Dhandapani, Jacob E. Goodman, Andreas F. Holmsen, Richard Pollack, Shakhar Smorodinsky:
Convexity in Topological Affine Planes. Discret. Comput. Geom. 38(2): 243-257 (2007) - [i1]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen, Sylvain Petitjean:
Hadwiger and Helly-type theorems for disjoint unit spheres. CoRR abs/cs/0702039 (2007) - 2005
- [c1]Otfried Cheong, Xavier Goaoc, Andreas F. Holmsen:
Hadwiger and Helly-type theorems for disjoint unit spheres in R3. SCG 2005: 10-15 - 2004
- [j4]Andreas F. Holmsen, Jirí Matousek:
No Helly Theorem for Stabbing Translates by Lines in R 3. Discret. Comput. Geom. 31(3): 405-410 (2004) - 2003
- [j3]Andreas F. Holmsen:
New Bounds on the Katchalski-Lewis Transversal Problem. Discret. Comput. Geom. 29(3): 395-408 (2003) - [j2]Andreas F. Holmsen, Meir Katchalski, Ted Lewis:
A Helly-Type Theorem for Line Transversals to Disjoint Unit Balls. Discret. Comput. Geom. 29(4): 595-602 (2003) - 2001
- [j1]Andrei Asinowski, Andreas F. Holmsen, Meir Katchalski:
The triples of geometric permutations for families of disjoint translates. Discret. Math. 241(1-3): 23-32 (2001)
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-10-23 20:30 CEST 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:
