Avner Magen

938 total citations
32 papers, 325 citations indexed

About

Avner Magen is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Artificial Intelligence. According to data from OpenAlex, Avner Magen has authored 32 papers receiving a total of 325 indexed citations (citations by other indexed papers that have themselves been cited), including 20 papers in Computational Theory and Mathematics, 13 papers in Computer Graphics and Computer-Aided Design and 7 papers in Artificial Intelligence. Recurrent topics in Avner Magen's work include Complexity and Algorithms in Graphs (16 papers), Computational Geometry and Mesh Generation (13 papers) and Advanced Graph Theory Research (12 papers). Avner Magen is often cited by papers focused on Complexity and Algorithms in Graphs (16 papers), Computational Geometry and Mesh Generation (13 papers) and Advanced Graph Theory Research (12 papers). Avner Magen collaborates with scholars based in Canada, United States and Israel. Avner Magen's co-authors include Nathan Linial, Toniann Pitassi, Shlomo Hoory, Bernard Chazelle, Ronitt Rubinfeld, Konstantinos Georgiou, Funda Ergün, Nicola Galesi, Ding Liu and Assaf Naor and has published in prestigious journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Combinatorial Theory Series B.

In The Last Decade

Avner Magen

30 papers receiving 292 citations

Peers

Avner Magen

CTM

AI

CNC

CGCD

CVPR

Eden Chlamtáč United States

Ofer Neiman Israel

Sushant Sachdeva United States

Y. N. Lakshman United States

Amir Abboud United States

Daniel Dadush Netherlands

D. Yu. Grigor'ev Russia

George Purdy United States

Nicolai Vorobjov United Kingdom

Rishi Saket United States

Eden Chlamtáč United States

Avner Magen

212 ×1.0

CTM

72 ×0.6

AI

85 ×1.2

CNC

60 ×0.9

CGCD

24 ×0.7

CVPR

Citations per year, relative to Avner Magen Avner Magen (= 1×) peers Eden Chlamtáč

Countries citing papers authored by Avner Magen

Since Specialization

Citations

This map shows the geographic impact of Avner Magen's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Avner Magen with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Avner Magen more than expected).

Fields of papers citing papers by Avner Magen

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Avner Magen. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Avner Magen. The network helps show where Avner Magen may publish in the future.

Co-authorship network of co-authors of Avner Magen

This figure shows the co-authorship network connecting the top 25 collaborators of Avner Magen. A scholar is included among the top collaborators of Avner Magen based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Avner Magen. Avner Magen is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Benabbas, Siavosh, Konstantinos Georgiou, Avner Magen, & Madhur Tulsiani. (2012). . Theory of Computing. 8(1). 269–289. 27 indexed citations

2.

Benabbas, Siavosh, Konstantinos Georgiou, & Avner Magen. (2010). The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs.. Electronic colloquium on computational complexity. 17. 169. 1 indexed citations

3.

Georgiou, Konstantinos, et al.. (2010). Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy. SIAM Journal on Computing. 39(8). 3553–3570. 16 indexed citations

4.

Chazelle, Bernard, Ding Liu, & Avner Magen. (2007). Approximate range searching in higher dimension. Computational Geometry. 39(1). 24–29. 9 indexed citations

5.

Magen, Avner. (2007). Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces. Discrete & Computational Geometry. 38(1). 139–153. 13 indexed citations

6.

Georgiou, Konstantinos, et al.. (2006). Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy.. Electronic colloquium on computational complexity. 13. 2 indexed citations

7.

Galesi, Nicola, et al.. (2006). . Theory of Computing. 2(1). 65–90. 24 indexed citations

8.

Hoory, Shlomo, Avner Magen, Steven Myers, & Charles Rackoff. (2005). Simple permutations mix well. Theoretical Computer Science. 348(2-3). 251–261. 14 indexed citations

9.

Czumaj, Artur, Funda Ergün, Lance Fortnow, et al.. (2005). Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time. SIAM Journal on Computing. 35(1). 91–109. 24 indexed citations

10.

Liu, Ding, Bernard Chazelle, & Avner Magen. (2004). Approximate range searching in higher dimension.. Canadian Conference on Computational Geometry. 154–157. 1 indexed citations

11.

Galesi, Nicola, et al.. (2003). Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua.. 318–327.

12.

Czumaj, Artur, Funda Ergün, Lance Fortnow, et al.. (2003). Sublinear-time approximation of Euclidean minimum spanning tree. Symposium on Discrete Algorithms. 813–822. 14 indexed citations

13.

Chazelle, Bernard, Ding Liu, & Avner Magen. (2003). Sublinear geometric algorithms. 2 indexed citations

14.

Batu, Tuğkan, Funda Ergün, Joe Kilian, et al.. (2003). A sublinear algorithm for weakly approximating edit distance. 316–324. 41 indexed citations

15.

Batu, Tuğkan, Funda Ergün, Joe Kilian, et al.. (2003). A sublinear algorithm for weakly approximating edit distance. 4 indexed citations

16.

Linial, Nathan, Avner Magen, & Assaf Naor. (2002). Girth and euclidean distortion. 705–711. 3 indexed citations

17.

Linial, Nathan, Avner Magen, & Assaf Naor. (2002). Girth and euclidean distortion. 7 indexed citations

18.

Linial, Nathan, Avner Magen, & Assaf Naor. (2002). Girth and Euclidean distortion. Geometric and Functional Analysis. 12(2). 380–394. 21 indexed citations

19.

Magen, Avner, et al.. (2001). <title>Designing oligo libraries taking alternative splicing into account</title>. Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE. 4266. 86–95. 3 indexed citations

20.

Linial, Nathan & Avner Magen. (2000). Least-Distortion Euclidean Embeddings of Graphs: Products of Cycles and Expanders. Journal of Combinatorial Theory Series B. 79(2). 157–171. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact