Avner Magen
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Computer Networks and Communications top 10%
- Computer Graphics and Computer-Aided Design top 5%
- Computer Vision and Pattern Recognition
- Co-authors
- Nathan LinialToniann PitassiShlomo HooryBernard ChazelleRonitt RubinfeldKonstantinos GeorgiouFunda ErgünNicola Galesi
- Topics
- Complexity and Algorithms in Graphs (16 papers)Computational Geometry and Mesh Generation (13 papers)Advanced Graph Theory Research (12 papers)
- Cited by
- Computer Graphics and Computer-Aided DesignComputational Theory and MathematicsDiscrete Mathematics and Combinatorics
- Journals
- SIAM Journal on ComputingTheoretical Computer ScienceJournal of Combinatorial Theory Series B
- Partner nations
- CanadaUnited StatesIsrael
In The Last Decade
Avner Magen
30 papers receiving 292 citations
Peers
Comparison fields: 5 of 47
- Computational Theory and Mathematics 220
- Artificial Intelligence 117
- Computer Networks and Communications 70
- Computer Graphics and Computer-Aided Design 67
- Computer Vision and Pattern Recognition 36
Countries citing papers authored by Avner Magen
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 27 | |
| 2 | The Sherali-Adams System Applied to Vertex Cover: Why Borsuk Graphs Fool Strong LPs and some Tight Integrality Gaps for SDPs. | 1 |
| 3 | 16 | |
| 4 | 9 | |
| 5 | 13 | |
| 6 | Tight integrality gaps for Vertex Cover SDPs in the Lovasz-Schrijver hierarchy. | 2 |
| 7 | 24 | |
| 8 | 14 | |
| 9 | 24 | |
| 10 | Approximate range searching in higher dimension. | 1 |
| 11 | Rank Bounds and Integrality Gaps for Cutting Planes Procedures Joshua. | 0 |
| 12 | 14 | |
| 13 | 2 | |
| 14 | 41 | |
| 15 | 4 | |
| 16 | 3 | |
| 17 | 7 | |
| 18 | 21 | |
| 19 | 3 | |
| 20 | 11 |
About Avner Magen
Avner Magen is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 32 papers that have together received 325 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (16 papers), Computational Geometry and Mesh Generation (13 papers) and Advanced Graph Theory Research (12 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (67 citations), Computational Theory and Mathematics (220 citations) and Discrete Mathematics and Combinatorics (24 citations). Avner Magen has collaborated with scholars based in Canada, United States and Israel. Frequent 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. Their work appears in journals such as SIAM Journal on Computing, Theoretical Computer Science and Journal of Combinatorial Theory Series B.
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.