On the Configuration LP for Maximum Budgeted Allocation
with Christos Kalaitzis, Aleksander
Lukáš Poláček and Ola Svensson IPCO 2014.
Beck's three permutations conjecture: A counterexample and some
with Ofer Neiman and Aleksandar Nikolov FOCS 2012,
previous version: arXiv.
Tight hardness results for minimizing discrepancy
with Moses Charikar and Aleksandar Nikolov
Proc. of the 22nd ACM-SIAM Symposium on Discrete Algorithms
Complex semidefinite programming revisited and the assembly of
circular genomes [ps]
with Konstantin Makarychev
Proceedings of Innovations in Computer Science
Traveling salesman path problems [ps]
with Fumei Lam
Mathematical Programming, Series A, 113(1): 39-59 (2008)
Decision making based on approximate and smoothed pareto curves
with Heiner Ackermann, Heiko Röglin and Berthold Vöcking
Theoretical Computer Science, 378(3): 253-270 (2007)
Aggregating inconsistent information: Ranking and clustering
with Nir Ailon and Moses Charikar
Journal of the ACM, 55(5): (2008) (ACM link)
(STOC 2005 conference
Bounding a protein's free energy
via linear programming [ps]
with Robert D. Carr and William E. Hart
Abstract appeared as a
poster in RECOMB 2004. Results also appeared in a Sandia
Cuts and orderings: On semidefinite
relaxations for the linear ordering problem
Proceedings of APPROX 2004.
(A more comprehensive version of these results is contained in Chapters
3 and 6 of my PhD thesis (see below).)
Combinatorial problems on strings with
applications to protein folding
with Matthias Ruhl
Proceedings of LATIN 2004.
A new algorithm for protein folding in the
Proceedings of SODA 2002.
The maximum acyclic subgraph problem
and degree-3 graphs
Proceedings of APPROX 2001.
Fences are futile: On relaxations for the linear
with Santosh Vempala
Proceedings of IPCO 2001.
Protein structure prediction
with lattice models
with William E. Hart
Book chapter in Handbook of Computational Molecular Biology,
Srinivas Aluru (Editor), Chapman & Hall CRC Computer and Information
Science Series, 2006
Semidefinite programming and Unique Games
Lecture notes for DIMACS tutorial on limits of