Skip to main content

Search

Show all results for

Home

Person

Márton Naszódi

This person is no longer with EPFL

About
Privacy
Disclaimer

Copyright © 2026 EPFL, all rights reserved

Graph Chatbot

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.

Covering Convex Bodies and the Closest Vector Problem

Moritz Andreas Venzin, Márton Naszódi

We present algorithms for the (1+epsilon)-approximate version of the closest vector problem for certain norms. The currently fastest algorithm (Dadush and Kun 2016) for general norms in dimension n has running time of 2(O(n)) (1/epsilon)(n) . We improve th ...

2022

Sphere-of-Influence Graphs in Normed Spaces

János Pach, Márton Naszódi

We showthat any k-th closed sphere-of-influence graph in a d-dimensional normed space has a vertex of degree less than 5dk, thus obtaining a common generalization of results of Furedi and Loeb (Proc AmMath Soc 121(4): 1063-1073, 1994 [1]) and Guibas et al. ...

SPRINGER2018

Separation with restricted families of sets

János Pach, Gábor Tardos, Márton Naszódi, Zsolt Langi

Given a finite n-element set X, a family of subsets F subset of 2(X) is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if vertical bar F vertical bar > 2(n-1), then one can select vertical bar log n ...

Academic Press Inc Elsevier Science2016