Alantha Newman

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 34

Top Venues

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl
Understanding the Cluster Linear Program for Correlation Clustering. STOC (2024)
Felix Klingelhöfer, Alantha Newman
Bounding the Chromatic Number of Dense Digraphs by Arc Neighborhoods. Comb. 44 (4) (2024)
Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang
-Low Rank Approximation: Solving Dense CSPs over Reals. SODA (2024)
Anand Louis, Alantha Newman, Arka Ray
Improved linearly ordered colorings of hypergraphs via SDP rounding. CoRR (2024)
Nairen Cao, Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman, Lukas Vogl
Understanding the Cluster LP for Correlation Clustering. CoRR (2024)
Felix Klingelhöfer, Alantha Newman
Coloring tournaments with few colors: Algorithms and complexity. CoRR (2023)
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman
Voting algorithms for unique games on complete graphs. SOSA (2023)
Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. FOCS (2023)
Felix Klingelhöfer, Alantha Newman
Bounding the chromatic number of dense digraphs by arc neighborhoods. CoRR (2023)
Arash Haddadan, Alantha Newman
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours. Math. Program. 198 (1) (2023)
Vincent Cohen-Addad, Euiwoong Lee, Shi Li, Alantha Newman
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering. CoRR (2023)
Vincent Cohen-Addad, Chenglin Fan, Suprovat Ghoshal, Euiwoong Lee, Arnaud de Mesmay, Alantha Newman, Tony Chang Wang
-Low Rank Approximation: Solving Dense CSPs over Reals. CoRR (2023)
Camille Gras, Nathalie Herr, Alantha Newman
A decision aid algorithm for long-haul parcel transportation based on hierarchical network structure. Int. J. Prod. Res. 61 (21) (2023)
Felix Klingelhöfer, Alantha Newman
Coloring Tournaments with Few Colors: Algorithms and Complexity. ESA (2023)
Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman
Correlation Clustering with Sherali-Adams. CoRR (2022)
Vincent Cohen-Addad, Euiwoong Lee, Alantha Newman
Correlation Clustering with Sherali-Adams. FOCS (2022)
Camille Gras, Van-Dat Cung, Nathalie Herr, Alantha Newman
A Hierarchical Network Approach for Long-Haul Parcel Transportation. APMS (5) (2021)
Arash Haddadan, Alantha Newman
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes. Discret. Optim. 42 (2021)
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler, Alantha Newman
Voting algorithms for unique games on complete graphs. CoRR (2021)
Arash Haddadan, Alantha Newman, R. Ravi
Shorter tours and longer detours: uniform covers and a bit beyond. Math. Program. 185 (1-2) (2021)
Alantha Newman
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs. SIAM J. Discret. Math. 34 (1) (2020)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring Dense Digraphs. Comb. 39 (5) (2019)
Arash Haddadan, Alantha Newman
Towards Improving Christofides Algorithm for Half-Integer TSP. ESA (2019)
Arash Haddadan, Alantha Newman
Towards improving Christofides algorithm for half-integer TSP. CoRR (2019)
Arash Haddadan, Alantha Newman
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring. CoRR (2018)
Kevin L. Chang, Alantha Newman
Rounding semidefinite programs for large-domain problems via Brownian motion. CoRR (2018)
Alantha Newman
Complex Semidefinite Programming and Max-k-Cut. SOSA (2018)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Domination and Fractional Domination in Digraphs. Electron. J. Comb. 25 (3) (2018)
Adrien Argento, Alantha Newman
Explicit 3-colorings for exponential graphs. CoRR (2018)
Alantha Newman
Complex Semidefinite Programming and Max-k-Cut. CoRR (2018)
Alantha Newman, Heiko Röglin, Johanna Seif
The Alternating Stock Size Problem and the Gasoline Puzzle. ACM Trans. Algorithms 14 (2) (2018)
Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé
Coloring dense digraphs. Electron. Notes Discret. Math. 61 (2017)
Arash Haddadan, Alantha Newman, R. Ravi
Cover and Conquer: Augmenting Decompositions for Connectivity Problems. CoRR (2017)
Alantha Newman, Heiko Röglin, Johanna Seif
The Alternating Stock Size Problem and the Gasoline Puzzle. ESA (2016)
Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson
On the configuration LP for maximum budgeted allocation. Math. Program. 154 (1-2) (2015)
Alantha Newman, Heiko Röglin, Johanna Seif
The Alternating Stock Size Problem and the Gasoline Puzzle. CoRR (2015)
Satoru Iwata, Alantha Newman, R. Ravi
Graph-TSP from Steiner Cycles. WG (2014)
Alantha Newman
An improved analysis of the Mömke-Svensson algorithm for graph-TSP on subquartic graphs. CoRR (2014)
Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson
On the Configuration LP for Maximum Budgeted Allocation. IPCO (2014)
Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson
On the Configuration LP for Maximum Budgeted Allocation. CoRR (2014)
Alantha Newman
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs. ESA (2014)
Satoru Iwata, Alantha Newman, R. Ravi
Graph-TSP from Steiner Cycles. CoRR (2014)
Alantha Newman, Ofer Neiman, Aleksandar Nikolov
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences. FOCS (2012)
Moses Charikar, Alantha Newman, Aleksandar Nikolov
Tight Hardness Results for Minimizing Discrepancy. SODA (2011)
Alantha Newman, Aleksandar Nikolov
A counterexample to Beck's conjecture on the discrepancy of three permutations CoRR (2011)
Konstantin Makarychev, Alantha Newman
Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes. ICS (2011)
Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) CoRR (2010)
Nir Ailon, Moses Charikar, Alantha Newman
Aggregating inconsistent information: Ranking and clustering. J. ACM 55 (5) (2008)
Fumei Lam, Alantha Newman
Traveling salesman path problems. Math. Program. 113 (1) (2008)
Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
Decision-making based on approximate and smoothed Pareto curves. Theor. Comput. Sci. 378 (3) (2007)
Heiner Ackermann, Alantha Newman, Heiko Röglin, Berthold Vöcking
Decision Making Based on Approximate and Smoothed Pareto Curves. ISAAC (2005)
Nir Ailon, Moses Charikar, Alantha Newman
Aggregating inconsistent information: ranking and clustering. STOC (2005)
Alantha Newman, Matthias Ruhl
Combinatorial Problems on Strings with Applications to Protein Folding. LATIN (2004)
Alantha Newman
Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem. APPROX-RANDOM (2004)
Alantha Newman
A new algorithm for protein folding in the HP model. SODA (2002)
Alantha Newman, Santosh S. Vempala
Fences Are Futile: On Relaxations for the Linear Ordering Problem. IPCO (2001)
Alantha Newman
The Maximum Acyclic Subgraph Problem and Degree-3 Graphs. RANDOM-APPROX (2001)

Alantha Newman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Alantha Newman