Corporate creators

Number of items: 2.
Association for Computing Machinery (2012-05-19 - 2012-05-22) Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives [Paper]. STOC 2012 - 44th ACM Symposium on Theory of Computing, New York, United States, USA. Association for Computing Machinery (2010-06-06 - 2010-06-08) Augmenting undirected node-connectivity by one [Paper]. STOC 2010 - 42nd ACM Symposium on Theory of Computing, Cambridge, United States, USA. https://doi.org/10.1145/1806689.1806767