# Alantha Newman

According to our database

Collaborative distances:

^{1}, Alantha Newman authored at least 28 papers between 2001 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2019

Towards Improving Christofides Algorithm for Half-Integer TSP.

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018

The Alternating Stock Size Problem and the Gasoline Puzzle.

ACM Trans. Algorithms, 2018

Rounding semidefinite programs for large-domain problems via Brownian motion.

CoRR, 2018

Polynomial-time algorithms for 2-edge-connected subgraphs on fundamental classes by top-down coloring.

CoRR, 2018

Explicit 3-colorings for exponential graphs.

CoRR, 2018

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

2017

Coloring dense digraphs.

Electron. Notes Discret. Math., 2017

Cover and Conquer: Augmenting Decompositions for Connectivity Problems.

CoRR, 2017

2016

Max Cut.

Encyclopedia of Algorithms, 2016

2015

On the configuration LP for maximum budgeted allocation.

Math. Program., 2015

2014

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

2012

Beck's Three Permutations Conjecture: A Counterexample and Some Consequences.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

A counterexample to Beck's conjecture on the discrepancy of three permutations

CoRR, 2011

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

2010

Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes)

CoRR, 2010

2008

Max Cut.

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

2007

Decision-making based on approximate and smoothed Pareto curves.

Theor. Comput. Sci., 2007

2004

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

2002

A new algorithm for protein folding in the HP model.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

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