| Publication | Date of Publication | Type |
|---|
A duality based 2-approximation algorithm for maximum agreement forest
Mathematical Programming. Series A. Series B | 2023-03-01 | Paper |
The salesman's improved paths through forests
Journal of the ACM | 2020-02-11 | Paper |
Rank aggregation: together we're strong
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Layers and matroids for the traveling salesman's paths
Operations Research Letters | 2019-06-11 | Paper |
A proof of the Boyd-Carr conjecture
| 2019-05-10 | Paper |
Improved approximations for cubic bipartite and cubic TSP
Mathematical Programming. Series A. Series B | 2018-10-26 | Paper |
Minimizing worst-case and average-case makespan over scenarios
Journal of Scheduling | 2018-02-28 | Paper |
A duality based 2-approximation algorithm for maximum agreement forest
| 2017-12-19 | Paper |
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds
SIAM Journal on Computing | 2017-06-28 | Paper |
Layers and Matroids for the Traveling Salesman's Paths
| 2017-03-21 | Paper |
Improved Approximations for Cubic Bipartite and Cubic TSP
Integer Programming and Combinatorial Optimization | 2016-08-10 | Paper |
A tight upper bound on the number of cyclically adjacent transpositions to sort a permutation
Information Processing Letters | 2016-07-27 | Paper |
The Salesman's Improved Paths: 3/2+1/34 Integrality Gap and Approximation Ratio
| 2016-04-08 | Paper |
Split scheduling with uniform setup times
Journal of Scheduling | 2015-04-24 | Paper |
On the integrality gap of the subtour LP for the 1,2-TSP
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
Scheduling over scenarios on two machines
Lecture Notes in Computer Science | 2014-09-26 | Paper |
2-matchings, the traveling salesman problem, and the subtour LP: a proof of the Boyd-Carr conjecture
Mathematics of Operations Research | 2014-07-11 | Paper |
Popular ranking
Discrete Applied Mathematics | 2014-05-05 | Paper |
Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
Discrete Applied Mathematics | 2014-04-22 | Paper |
On Some Recent Approximation Algorithms for MAX SAT
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Clustering with or without the approximation
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
Improved approximation algorithms for bipartite correlation clustering
SIAM Journal on Computing | 2013-02-04 | Paper |
Simpler approximation of the maximum asymmetric traveling salesman problem
| 2012-08-23 | Paper |
Simpler 3/4-approximation algorithms for MAX SAT
Approximation and Online Algorithms | 2012-07-16 | Paper |
On the integrality gap of the subtour LP for the \(1,2\)-TSP
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
An improved monotone algorithm for scheduling related machines with precedence constraints
Operations Research Letters | 2012-04-05 | Paper |
Improved Approximation Algorithms for Bipartite Correlation Clustering
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Deterministic sampling algorithms for network design
Algorithmica | 2011-07-01 | Paper |
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Theoretical Computer Science | 2011-05-18 | Paper |
Deterministic pivoting algorithms for constrained ranking and clustering problems
Mathematics of Operations Research | 2011-04-27 | Paper |
Clustering with or without the approximation
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
Lecture Notes in Computer Science | 2009-06-03 | Paper |
Deterministic Sampling Algorithms for Network Design
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
Approximation and Online Algorithms | 2008-02-20 | Paper |
A simpler and better derandomization of an approximation algorithm for single source rent-or-buy
Operations Research Letters | 2008-01-21 | Paper |
THE ACHILLES' HEEL OF THE GSR SHUFFLE: A NOTE ON NEW AGE SOLITAIRE
Probability in the Engineering and Informational Sciences | 2005-03-21 | Paper |
