Talks
2018

Semidefinite Programming Relaxations of the Traveling Salesman Problem
University of Massachusetts Amherst, Discrete Math Seminar. Amherst, MA, USA.
October 24, 2018.

Vector Representations of Graphs and the Maximum Cut Problem
University of California at Berkeley, Berkeley Institute for Data Science. Berkeley, CA, USA.
February 27, 2018.

The Subtour LP for the Traveling Salesman Problem
Google. Mountain View, CA, USA.
January 24, 2018.
2016

The Subtour LP for the Traveling Salesman Problem
University of Illinois, Industrial and Enterprise Systems Engineering. Champaign, IL, USA.
April 21, 2016.

A Simple 3/4Approximation Algorithm for the Maximum Satisfiability Problem
University of Pennsylvania, Theory CS Seminar. Philadelphia, PA, USA.
April 01, 2016.
2015

An Experimental Evaluation of the BestofMany Christofides' Algorithm for the Traveling Salesman Problem
6th Workshop on Combinatorial Optimization. Cargèse, Corsica, France.
September 17, 2015.

An Experimental Evaluation of the BestofMany Christofides' Algorithm for the Traveling Salesman Problem
International Symposium on Mathematical Programming. Pittsburgh, PA, USA.
July 14, 2015.

The Subtour LP for the Traveling Salesman Problem
University of Michigan, Industrial and Operations Engineering. Ann Arbor, MI, USA.
April 08, 2015.
2014

A Simple, Greedy Approximation Algorithm for MAX SAT
DIMACS Workshop in Honor of Alan Hoffman, Rutgers University. Piscataway, NJ, USA.
September 20, 2014.

The Traveling Salesman Problem: An Overview
Ebay Research. San Jose, CA, USA.
January 21, 2014.
2012

The Rank Aggregation Problem
InWeb Workshop, Universidade Federal de Minas Gerais. Belo Horizonte, Brazil.
December 10, 2012.

A 3/2Approximation Algorithm for Some MinimumCost Graph Problems
International Symposium on Mathematical Programming. Berlin, Germany.
August 23, 2012.

The Subtour LP for the Traveling Salesman Problem
Universität Wien. Vienna, Austria.
June 18, 2012.

The Subtour LP for the Traveling Salesman Problem
5th International Conference on High Performance Scientific Computing (HPSC 2012). Hanoi, Vietnam.
March 06, 2012.

What Computers Can Compute (Approximately)
University of Hawaii. Honolulu, HI, USA.
January 06, 2012.
2011

The Subtour LP for the Traveling Salesman Problem
Cornell University. Ithaca, NY, USA.
November 22, 2011.

The Subtour LP for the Traveling Salesman Problem
Georgia Tech. Atlanta, GA, USA.
October 12, 2011.

Some Open Problems in Approximation Algorithms
APPROX 2011. Princeton, NJ, USA.
Invited speaker.
August 18, 2011.

What Computers Can Compute (Approximately)
TU Chemnitz. Chemnitz, Germany.
June 09, 2011.

The Subtour LP for the Traveling Salesman Problem
TU Berlin. Berlin, Germany.
May 30, 2011.

An experimental evaluation of incremental and hierarchical kmedian algorithms
10th International Symposium on Experimental Algorithms (SEA 2011). Chania, Greece.
May 06, 2011.

Some Open Problems in Approximation Algorithms
University of Bonn. Bonn, Germany.
February 28, 2011.

What Computers Can Compute (Approximately)
Berlin Mathematical School. Berlin, Germany.
von Humboldt Lecture.
February 11, 2011.
2010

Some Open Problems in Approximation Algorithms
ELTE, Computer Science Department. Budapest, Hungary.
November 03, 2010.