( en | de | ru )

 

Disambiguation of "Svensson, Ola"

Author of the publication

copydeleteadd this publication to your clipboard
The Matching Problem in General Graphs Is in Quasi-NC.

, and . FOCS, page 696-707. IEEE Computer Society, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vladislava Ola

Axel Svensson

Uwe Svensson

Ola Ajaj

Ola Agevall

 

Other publications of authors with the same name

Linear Programming Polytope and Algorithm for Mean Payoff Games., and . AAIM, volume 4041 of Lecture Notes in Computer Science, page 64-78. Springer, (2006)Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper).. FSTTCS, volume 122 of LIPIcs, page 3:1-3:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , and . CoRR, (2014)A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem., , and . CoRR, (2017)Conditional hardness of precedence constrained scheduling on identical machines.. STOC, page 745-754. ACM, (2010)Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits., , , and . Theory of Computing, 14 (1): 1-29 (2018)Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut, , and . SIAM J. Comput., 40 (2): 567-596 (2011)Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits., , , and . SODA, page 2326-2341. SIAM, (2017)The Exact Bipartite Matching Polytope Has Exponential Extension Complexity., , and . CoRR, (2022)Towards Non-Uniform k-Center with Constant Types of Radii., , , and . CoRR, (2021)