%0 Conference Paper %1 conf/focs/ChandrasekaranVV12 %A Chandrasekaran, Karthekeyan %A Végh, László A. %A Vempala, Santosh S. %B FOCS %D 2012 %I IEEE Computer Society %K dblp %P 571-580 %T The Cutting Plane Method Is Polynomial for Perfect Matchings. %U http://dblp.uni-trier.de/db/conf/focs/focs2012.html#ChandrasekaranVV12 %@ 978-1-4673-4383-1

@inproceedings{conf/focs/ChandrasekaranVV12, added-at = {2023-03-23T00:00:00.000+0100}, author = {Chandrasekaran, Karthekeyan and Végh, László A. and Vempala, Santosh S.}, biburl = {https://www.bibsonomy.org/bibtex/26f40de9e49ecb4f6fc296183da666ddd/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2012}, ee = {https://doi.ieeecomputersociety.org/10.1109/FOCS.2012.35}, interhash = {69ddacb36f127466099327f3d76beeb6}, intrahash = {6f40de9e49ecb4f6fc296183da666ddd}, isbn = {978-1-4673-4383-1}, keywords = {dblp}, pages = {571-580}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T14:13:42.000+0200}, title = {The Cutting Plane Method Is Polynomial for Perfect Matchings.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2012.html#ChandrasekaranVV12}, year = 2012 }