b'@inproceedings{Blikstad_ESA23,'b'\nTITLE = {Incremental $(1-\\epsilon)$-Approximate Dynamic Matching in {$O(poly(1/\\epsilon))$} Update Time},\nAUTHOR = {Blikstad, Joakim and Kiss, Peter},\nLANGUAGE = {eng},\nISSN = {1868-8969},\nURL = {urn:nbn:de:0030-drops-186756},\nDOI = {10.4230/LIPIcs.ESA.2023.22},\nPUBLISHER = {Schloss Dagstuhl},\nYEAR = {2023},\nMARGINALMARK = {$\\bullet$},\nDATE = {2023},\nBOOKTITLE = {31st Annual European Symposium on Algorithms (ESA 2023)},\nEDITOR = {G{\\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz},\nPAGES = {1--16},\nEID = {24},\nSERIES = {Leibniz International Proceedings in Informatics},\nVOLUME = {274},\nADDRESS = {Amsterdam, The Netherlands},\n}\n'