@article{DBLP:journals/corr/BosekLZS17,
  author       = {Bartlomiej Bosek and
                  Dariusz Leniowski and
                  Anna Zych and
                  Piotr Sankowski},
  title        = {The Shortest Augmenting Paths for Online Matchings on Trees},
  journal      = {CoRR},
  volume       = {abs/1704.02093},
  year         = {2017},
  url          = {http://arxiv.org/abs/1704.02093},
  eprinttype    = {arXiv},
  eprint       = {1704.02093},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BosekLZS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"a3PPkYnAqWsT4iPtm","bibbaseid":"bosek-leniowski-zych-sankowski-theshortestaugmentingpathsforonlinematchingsontrees-2017","downloads":0,"creationDate":"2017-05-04T13:49:42.247Z","title":"The Shortest Augmenting Paths for Online Matchings on Trees","author_short":["Bosek, B.","Leniowski, D.","Zych, A.","Sankowski, P."],"year":2017,"bibtype":"article","biburl":"http://dblp.org/pers/tb2/s/Sankowski:Piotr","bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Bartlomiej"],"propositions":[],"lastnames":["Bosek"],"suffixes":[]},{"firstnames":["Dariusz"],"propositions":[],"lastnames":["Leniowski"],"suffixes":[]},{"firstnames":["Anna"],"propositions":[],"lastnames":["Zych"],"suffixes":[]},{"firstnames":["Piotr"],"propositions":[],"lastnames":["Sankowski"],"suffixes":[]}],"title":"The Shortest Augmenting Paths for Online Matchings on Trees","journal":"CoRR","volume":"abs/1704.02093","year":"2017","url":"http://arxiv.org/abs/1704.02093","eprinttype":"arXiv","eprint":"1704.02093","timestamp":"Mon, 13 Aug 2018 01:00:00 +0200","biburl":"https://dblp.org/rec/journals/corr/BosekLZS17.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/BosekLZS17,\n author = {Bartlomiej Bosek and\n Dariusz Leniowski and\n Anna Zych and\n Piotr Sankowski},\n title = {The Shortest Augmenting Paths for Online Matchings on Trees},\n journal = {CoRR},\n volume = {abs/1704.02093},\n year = {2017},\n url = {http://arxiv.org/abs/1704.02093},\n eprinttype = {arXiv},\n eprint = {1704.02093},\n timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/journals/corr/BosekLZS17.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Bosek, B.","Leniowski, D.","Zych, A.","Sankowski, P."],"key":"DBLP:journals/corr/BosekLZS17","id":"DBLP:journals/corr/BosekLZS17","bibbaseid":"bosek-leniowski-zych-sankowski-theshortestaugmentingpathsforonlinematchingsontrees-2017","role":"author","urls":{"Paper":"http://arxiv.org/abs/1704.02093"},"metadata":{"authorlinks":{"sankowski, p":"https://duch.mimuw.edu.pl/~sank/wordpress/"}},"downloads":0},"search_terms":["shortest","augmenting","paths","online","matchings","trees","bosek","leniowski","zych","sankowski"],"keywords":[],"authorIDs":["5de6d1c6abd988de010000a5","5dfce6812eb8b2de01000090","5e02a8a464e549de010000aa","5e3e2441546544df0100001e","5e4227cb70cecede01000149","5e43b404a3f5a4de010000ec","5e5d22e5168391de010000bb","5e6a5f25d37d43de010001f5","CjFap2PDtauEPd2Hu","ogWodGepFrk8QD9gc","y9qEPeyD78TRX8Pp7"],"dataSources":["YTqCu4ZwBgzPtoQwj","cZqX5Q2YyDsGWz96c"]}