Author of the publication

NC Algorithms for Perfect Matching and Maximum Flow in One-Crossing-Minor-Free Graphs.

, and . CoRR, (2018)

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.

 

Other publications of authors with the same name

Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees., , and . Algorithmica, 18 (1): 3-20 (1997)The Investment Management Game: Extending the Scope of the Notion of Core.. CoRR, (2023)Combinatorial Algorithms for Matching Markets via Nash Bargaining: One-Sided, Two-Sided and Non-Bipartite., , and . CoRR, (2021)A New Class of Combinatorial Markets with Covering Constraints: Algorithms and Applications., , , , and . SODA, page 2311-2325. SIAM, (2018)Probabilistic estimation of overlap graphs for large sequence datasets., , , , and . BIBM, page 247-252. IEEE Computer Society, (2017)A Graph Theoretic Approach to Software Watermarking., , and . Information Hiding, volume 2137 of Lecture Notes in Computer Science, page 157-168. Springer, (2001)Market equilibria for homothetic, quasi-concave utilities and economies of scale in production., , and . SODA, page 63-71. SIAM, (2005)Finding separator cuts in planar graphs within twice the optimal, , and . FOCS, page 14-23. IEEE Computer Society, (1994)AdWords and Generalized On-line Matching., , , and . FOCS, page 264-273. IEEE Computer Society, (2005)Algorithmic Game Theory, , , and . Cambridge University Press, (2007)