Alantha Newman
Orcid: 0009-0009-7353-7734Affiliations:
- Max Planck Institute for Informatics, Saarbrücken, Germany
According to our database1,
Alantha Newman
authored at least 43 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Comb., August, 2024
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
A PTAS for <i>ℓ</i><sub>0</sub>-Low Rank Approximation: Solving Dense CSPs over Reals.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024
2023
A decision aid algorithm for long-haul parcel transportation based on hierarchical network structure.
Int. J. Prod. Res., November, 2023
Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours.
Math. Program., March, 2023
CoRR, 2023
Proceedings of the 2023 Symposium on Simplicity in Algorithms, 2023
Handling Correlated Rounding Error via Preclustering: A 1.73-approximation for Correlation Clustering.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Math. Program., 2021
Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes.
Discret. Optim., 2021
Proceedings of the Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems, 2021
2020
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs.
SIAM J. Discret. Math., 2020
2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2018
ACM Trans. Algorithms, 2018
CoRR, 2018
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring.
CoRR, 2018
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
2017
2016
2015
2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
2012
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
CoRR, 2011
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Proceedings of the Innovations in Computer Science, 2011
2010
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
CoRR, 2010
2008
2007
Theor. Comput. Sci., 2007
2004
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Proceedings of the Approximation, 2004
2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
Proceedings of the Approximation, 2001
Proceedings of the Integer Programming and Combinatorial Optimization, 2001