---
res:
  bibo_abstract:
  - In recent years, significant advances have been made in the design and analysis
    of fully dynamic maximal matching algorithms. However, these theoretical results
    have received very little attention from the practical perspective. Few of the
    algorithms are implemented and tested on real datasets, and their practical potential
    is far from understood. In this paper, we attempt to bridge the gap between theory
    and practice that is currently observed for the fully dynamic maximal matching
    problem. We engineer several algorithms and empirically study those algorithms
    on an extensive set of dynamic instances.@eng
  bibo_authorlist:
  - 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
  - foaf_Person:
      foaf_givenName: Khan
      foaf_name: Shahbaz, Khan
      foaf_surname: Shahbaz
  - foaf_Person:
      foaf_givenName: Richard
      foaf_name: Paul, Richard
      foaf_surname: Paul
  - foaf_Person:
      foaf_givenName: Christian
      foaf_name: Schulz, Christian
      foaf_surname: Schulz
  bibo_doi: 10.4230/LIPIcs.ESA.2020.58
  bibo_volume: 173
  dct_date: 2020^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1868-8969
  - http://id.crossref.org/issn/9783959771627
  dct_language: eng
  dct_publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik@
  dct_title: Dynamic matching algorithms in practice@
...
