---
res:
  bibo_abstract:
  - We show an (1+ϵ)-approximation algorithm for maintaining maximum s-t flow under
    m edge insertions in m1/2+o(1)ϵ−1/2 amortized update time for directed, unweighted
    graphs. This constitutes the first sublinear dynamic maximum flow algorithm in
    general sparse graphs with arbitrarily good approximation guarantee.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Gramoz
      foaf_name: Goranci, Gramoz
      foaf_surname: Goranci
  - foaf_Person:
      foaf_givenName: Monika H
      foaf_name: Henzinger, Monika H
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=540c9bbd-f2de-11ec-812d-d04a5be85630
    orcid: 0000-0002-5008-6530
  bibo_doi: 10.4230/LIPIcs.ICALP.2023.69
  bibo_volume: 261
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959772785
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: Efficient data structures for incremental exact and approximate maximum
    flow@
...