default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMárton Naszódi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Gergely Ambrus, Martin Balko
, Nóra Frankl, Attila Jung, Márton Naszódi:
On Helly numbers of exponential lattices. Eur. J. Comb. 116: 103884 (2024)- 2023
- [c2]Gergely Ambrus, Martin Balko, Nóra Frankl, Attila Jung, Márton Naszódi:
On Helly Numbers of Exponential Lattices. SoCG 2023: 8:1-8:16 - [i5]Márton Naszódi, Zsombor Szilágyi, Mihály Weiner:
Higher rank antipodality. CoRR abs/2307.16857 (2023) - 2022
- [j24]Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura:
Computing the Covering Radius of a Polytope with an Application to Lonely Runners. Comb. 42(4): 463-490 (2022) - [j23]Márton Naszódi, Moritz Venzin:
Covering Convex Bodies and the Closest Vector Problem. Discret. Comput. Geom. 67(4): 1191-1210 (2022) - [j22]Attila Jung, Márton Naszódi:
Quantitative Fractional Helly and (p, q)-Theorems. Eur. J. Comb. 99: 103424 (2022) - [j21]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) - [j20]Grigory Ivanov, Márton Naszódi:
A Quantitative Helly-Type Theorem: Containment in a Homothet. SIAM J. Discret. Math. 36(2): 951-957 (2022) - 2021
- [j19]Márton Naszódi, Alexandr Polyanskii:
Perron and Frobenius Meet Carathéodory. Electron. J. Comb. 28(3): 3 (2021) - [j18]Gábor Damásdi, Viktória Földvári, Márton Naszódi:
Colorful Helly-type theorems for the volume of intersections of convex bodies. J. Comb. Theory A 178: 105361 (2021) - 2020
- [i4]Jana Cslovjecsek, Romanos-Diogenes Malikiosis, Márton Naszódi, Matthias Schymura:
Computing the covering radius of a polytope with an application to lonely runners. CoRR abs/2009.12080 (2020)
2010 – 2019
- 2019
- [j17]Márton Naszódi:
Approximating a Convex Body by a Polytope Using the Epsilon-Net Theorem. Discret. Comput. Geom. 61(3): 686-693 (2019) - [i3]Márton Naszódi, Moritz Venzin:
Covering convex bodies and the Closest Vector Problem. CoRR abs/1908.08384 (2019) - 2018
- [j16]Károly Bezdek, Márton Naszódi:
On contact graphs of totally separable packings in low dimensions. Adv. Appl. Math. 101: 266-280 (2018) - [j15]Márton Naszódi, Konrad J. Swanepoel:
Arrangements of Homothets of a Convex Body II. Contributions Discret. Math. 13(2) (2018) - [j14]Károly Bezdek, Márton Naszódi:
The Kneser-Poulsen Conjecture for Special Contractions. Discret. Comput. Geom. 60(4): 967-980 (2018) - [j13]Nóra Frankl, Janos Nagy, Márton Naszódi:
Coverings: Variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl. Discret. Math. 341(3): 863-874 (2018) - [j12]Márton Naszódi, Alexandr Polyanskii:
Approximating set multi-covers. Eur. J. Comb. 67: 174-180 (2018) - 2017
- [j11]Radoslav Fulek, Hossein Nassajian Mojarrad, Márton Naszódi, József Solymosi, Sebastian U. Stich, May Szedlák:
On the existence of ordinary triangles. Comput. Geom. 66: 28-31 (2017) - [i2]Márton Naszódi, Leonardo Martínez-Sandoval, Shakhar Smorodinsky:
Bounding a global red-blue proportion using local conditions. CoRR abs/1701.02200 (2017) - 2016
- [j10]Márton Naszódi:
Proof of a Conjecture of Bárány, Katchalski and Pach. Discret. Comput. Geom. 55(1): 243-248 (2016) - [j9]Zsolt Lángi, Márton Naszódi, János Pach, Gábor Tardos, Géza Tóth:
Separation with restricted families of sets. J. Comb. Theory A 144: 292-305 (2016) - [i1]Márton Naszódi, Alexandr Polyanskii:
Multiple Transversals Greedily. CoRR abs/1608.01292 (2016) - 2013
- [j8]Károly Bezdek, Márton Naszódi:
Rigid Ball-Polyhedra in Euclidean 3-Space. Discret. Comput. Geom. 49(2): 189-199 (2013) - 2012
- [c1]Károly Bezdek, Márton Naszódi:
Rigidity of Ball-polyhedra via Truncated Voronoi and Delaunay Complexes. ISVD 2012: 75-79 - 2010
- [j7]Márton Naszódi, Steven Taschuk:
On the transversal number and VC-dimension of families of positive homothets of a convex body. Discret. Math. 310(1): 77-82 (2010)
2000 – 2009
- 2009
- [j6]Márton Naszódi:
Fractional illumination of convex bodies. Contributions Discret. Math. 4(2) (2009) - 2008
- [j5]Zsolt Lángi, Márton Naszódi:
Kirchberger-type theorems for separation by convex domains. Period. Math. Hung. 57(2): 185-196 (2008) - 2007
- [j4]Károly Bezdek, Zsolt Lángi, Márton Naszódi, Peter Papez:
Ball-Polyhedra. Discret. Comput. Geom. 38(2): 201-230 (2007) - 2006
- [j3]Károly Bezdek, Márton Naszódi:
Rigidity of ball-polyhedra in Euclidean 3-space. Eur. J. Comb. 27(2): 255-268 (2006) - [j2]Balázs Csikós, Zsolt Lángi, Márton Naszódi:
A generalization of the Discrete Isoperimetric Inequality for Piecewise Smooth Curves of Constant Geodesic Curvature. Period. Math. Hung. 53(1-2): 121-131 (2006) - [j1]Márton Naszódi:
On a conjecture of Károly Bezdek and János Pach. Period. Math. Hung. 53(1-2): 227-230 (2006)
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 2025-01-21 00:10 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:
