<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>conference paper</genre>

<titleInfo><title>Dynamic matching algorithms in practice</title></titleInfo>

  
  
<titleInfo type="alternative">
  
  <title>LIPIcs</title>
</titleInfo>

<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Monika H</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">540c9bbd-f2de-11ec-812d-d04a5be85630</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-5008-6530</description></name>
<name type="personal">
  <namePart type="given">Khan</namePart>
  <namePart type="family">Shahbaz</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Richard</namePart>
  <namePart type="family">Paul</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>
<name type="personal">
  <namePart type="given">Christian</namePart>
  <namePart type="family">Schulz</namePart>
  <role><roleTerm type="text">author</roleTerm> </role></name>









<name type="conference">
  <namePart>ESA: Annual European Symposium on Algorithms</namePart>
</name>






<abstract lang="eng">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.</abstract>

<originInfo><publisher>Schloss Dagstuhl - Leibniz-Zentrum für Informatik</publisher><dateIssued encoding="w3cdtf">2020</dateIssued><place><placeTerm type="text">Pisa, Italy</placeTerm></place>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>8th Annual European Symposium on Algorithms</title></titleInfo>
  <identifier type="issn">1868-8969</identifier>
  <identifier type="isbn">9783959771627</identifier>
  <identifier type="arXiv">2004.09099</identifier><identifier type="doi">10.4230/LIPIcs.ESA.2020.58</identifier>
<part><detail type="volume"><number>173</number></detail>
</part>
</relatedItem>

<note type="extern">yes</note>
<extension>
<bibliographicCitation>
<ista>Henzinger M, Shahbaz K, Paul R, Schulz C. 2020. Dynamic matching algorithms in practice. 8th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 173, 58.</ista>
<short>M. Henzinger, K. Shahbaz, R. Paul, C. Schulz, in:, 8th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.</short>
<apa>Henzinger, M., Shahbaz, K., Paul, R., &amp;#38; Schulz, C. (2020). Dynamic matching algorithms in practice. In &lt;i&gt;8th Annual European Symposium on Algorithms&lt;/i&gt; (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.58&quot;&gt;https://doi.org/10.4230/LIPIcs.ESA.2020.58&lt;/a&gt;</apa>
<chicago>Henzinger, Monika, Khan Shahbaz, Richard Paul, and Christian Schulz. “Dynamic Matching Algorithms in Practice.” In &lt;i&gt;8th Annual European Symposium on Algorithms&lt;/i&gt;, Vol. 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. &lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.58&quot;&gt;https://doi.org/10.4230/LIPIcs.ESA.2020.58&lt;/a&gt;.</chicago>
<ieee>M. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms in practice,” in &lt;i&gt;8th Annual European Symposium on Algorithms&lt;/i&gt;, Pisa, Italy, 2020, vol. 173.</ieee>
<mla>Henzinger, Monika, et al. “Dynamic Matching Algorithms in Practice.” &lt;i&gt;8th Annual European Symposium on Algorithms&lt;/i&gt;, vol. 173, 58, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.58&quot;&gt;10.4230/LIPIcs.ESA.2020.58&lt;/a&gt;.</mla>
<ama>Henzinger M, Shahbaz K, Paul R, Schulz C. Dynamic matching algorithms in practice. In: &lt;i&gt;8th Annual European Symposium on Algorithms&lt;/i&gt;. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:&lt;a href=&quot;https://doi.org/10.4230/LIPIcs.ESA.2020.58&quot;&gt;10.4230/LIPIcs.ESA.2020.58&lt;/a&gt;</ama>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>11816</recordIdentifier><recordCreationDate encoding="w3cdtf">2022-08-12T07:13:25Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2024-11-06T08:23:03Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
