@InProceedings{gupta:LIPIcs.FSTTCS.2014.227,
  author =	{Gupta, Manoj},
  title =	{{Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time}},
  booktitle =	{34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014)},
  pages =	{227--239},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-77-4},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{29},
  editor =	{Raman, Venkatesh and Suresh, S. P.},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2014.227},
  URN =		{urn:nbn:de:0030-drops-48453},
  doi =		{10.4230/LIPIcs.FSTTCS.2014.227},
  annote =	{Keywords: Graph Algorithm, Dynamic Graph}
}