%0 Conference Paper %1 conf/spaa/EppsteinV19 %A Eppstein, David %A Vazirani, Vijay V. %B SPAA %D 2019 %E Scheideler, Christian %E Berenbrink, Petra %I ACM %K dblp %P 23-30 %T NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs. %U http://dblp.uni-trier.de/db/conf/spaa/spaa2019.html#EppsteinV19 %@ 978-1-4503-6184-2

@inproceedings{conf/spaa/EppsteinV19, added-at = {2019-06-19T00:00:00.000+0200}, author = {Eppstein, David and Vazirani, Vijay V.}, biburl = {https://www.bibsonomy.org/bibtex/2585231bee01f2d43ca2724996afea78e/dblp}, booktitle = {SPAA}, crossref = {conf/spaa/2019}, editor = {Scheideler, Christian and Berenbrink, Petra}, ee = {https://doi.org/10.1145/3323165.3323206}, interhash = {fb727584ea11d4ad6a18c292aa2feecd}, intrahash = {585231bee01f2d43ca2724996afea78e}, isbn = {978-1-4503-6184-2}, keywords = {dblp}, pages = {23-30}, publisher = {ACM}, timestamp = {2019-06-20T11:38:46.000+0200}, title = {NC Algorithms for Computing a Perfect Matching, the Number of Perfect Matchings, and a Maximum Flow in One-Crossing-Minor-Free Graphs.}, url = {http://dblp.uni-trier.de/db/conf/spaa/spaa2019.html#EppsteinV19}, year = 2019 }