According to our database1, Alantha Newman authored at least 28 papers between 2001 and 2019.
Legend:Book In proceedings Article PhD thesis Other
Towards Improving Christofides Algorithm for Half-Integer TSP.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
The Alternating Stock Size Problem and the Gasoline Puzzle.
ACM Trans. Algorithms, 2018
Rounding semidefinite programs for large-domain problems via Brownian motion.
Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring.
Explicit 3-colorings for exponential graphs.
Domination and Fractional Domination in Digraphs.
Electr. J. Comb., 2018
Complex Semidefinite Programming and Max-k-Cut.
Proceedings of the 1st Symposium on Simplicity in Algorithms, 2018
Coloring dense digraphs.
Electron. Notes Discret. Math., 2017
Cover and Conquer: Augmenting Decompositions for Connectivity Problems.
Encyclopedia of Algorithms, 2016
On the configuration LP for maximum budgeted allocation.
Math. Program., 2015
Graph-TSP from Steiner Cycles.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
An Improved Analysis of the Mömke-Svensson Algorithm for Graph-TSP on Subquartic Graphs.
Proceedings of the Algorithms - ESA 2014, 2014
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
A counterexample to Beck's conjecture on the discrepancy of three permutations
Tight Hardness Results for Minimizing Discrepancy.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011
Complex Semidefinite Programming Revisited and the Assembly of Circular Genomes.
Proceedings of the Innovations in Computer Science, 2011
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008
Traveling salesman path problems.
Math. Program., 2008
Aggregating inconsistent information: Ranking and clustering.
J. ACM, 2008
Decision-making based on approximate and smoothed Pareto curves.
Theor. Comput. Sci., 2007
Algorithms for string and graph layout.
PhD thesis, 2004
Combinatorial Problems on Strings with Applications to Protein Folding.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
Cuts and Orderings: On Semidefinite Relaxations for the Linear Ordering Problem.
Proceedings of the Approximation, 2004
A new algorithm for protein folding in the HP model.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
The Maximum Acyclic Subgraph Problem and Degree-3 Graphs.
Proceedings of the Approximation, 2001
Fences Are Futile: On Relaxations for the Linear Ordering Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001