Avner Magen
ScholarGPS® ID: 80564490142278
Affiliation History
Discipline
Computer Science
Top Specialties
Combinatorial Optimization | Mathematical Optimization | Combinatorics | Dimensionality Reduction | Discrete Mathematics
Metrics Summary
Publication Count
44
Predicted Citations
970
Predicted h-index
17
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
|
Add
Delete
|
|---|
On quadratic threshold CSPs (journal article) Discrete Mathematics & Theoretical Computer Science, volume Vol. 14 no. 2, issue Discrete Algorithms (2012). |
Toward a Model for Backtracking and Dynamic Programming (journal article) computational complexity, volume 20, issue 4, pages 679-740 (2011). |
How well can primal-dual and local-ratio algorithms perform? (journal article) ACM Transactions on Algorithms, volume 7, issue 3, pages 1-26 (2011). |
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (2011) |
Foundations of Software Technology and Theoretical Computer Science (2011) Bombay, India |
Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy (journal article) SIAM Journal on Computing, volume 39, issue 8, pages 3553-3570 (2010). |
Online Embeddings (book chapter) In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Springer Berlin Heidelberg (2010) |
Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain (book chapter) In Integer Programming and Combinatorial Optimization Springer Berlin Heidelberg (2010) |
On Quadratic Threshold CSPs (book chapter) In LATIN 2010: Theoretical Informatics Springer Berlin Heidelberg (2010) |
Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy (book chapter) In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Springer Berlin Heidelberg (2009) |
Foundations of Software Technology and Theoretical Computer Science (2009) |
Optimal Sherali-Adams Gaps from Pairwise Independence (book chapter) In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Springer Berlin Heidelberg (2009) |
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to $\ell_1$ Embeddability of Negative Type Metrics (journal article) SIAM Journal on Discrete Mathematics, volume 23, issue 1, pages 178-194 (2009). |
Analysis of set-up time models: A metric perspective (journal article) Theoretical Computer Science, volume 401, issue 1-3, pages 172-180 (2008). |
Near Optimal Dimensionality Reductions That Preserve Volumes (book chapter) In Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques Springer Berlin Heidelberg (2008) |
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities (book chapter) In Integer Programming and Combinatorial Optimization Springer Berlin Heidelberg (2008) |
Approximate range searching in higher dimension (journal article) Computational Geometry, volume 39, issue 1, pages 24-29 (2008). |
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07) (2007) Providence, RI, USA |
Dimensionality Reductions in ℓ2 that Preserve Volumes and Distance to Affine Spaces (journal article) Discrete & Computational Geometry, volume 38, issue 1, pages 139-153 (2007). |
Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics (book chapter) In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Springer Berlin Heidelberg (2007) |