Items where authors include "Henzinger, M."

Article

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2020) Improved guarantees for vertex sparsification in planar graphs. SIAM Journal on Discrete Mathematics (SIDMA), 34 (1). pp. 130-162. ISSN 0895-4801

Proceedings Paper

Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2020) Constant-time dynamic (∆+1)-coloring. In: Paul, C. and Bläser, M., (eds.) 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020). 37th Symposium on Theoretical Aspects of Computer Science (STACS 2020), 10-13 Mar 2020, Montpellier, France. LIPIcs, 154 . Schloss Dagstuhl – Leibniz Center for Informatics , 53:1-53:18. ISBN 9783959771405

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2018) Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs. In: Proceedings of the 26th European Symposium on Algorithms (ESA 2018). The 26th European Symposium on Algorithms (ESA 2018), 20-22 Aug 2018, Helsinki, Finland. LIPIcs, 112 (40). Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Germany . ISBN 978-3-95977-081-1

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2017) Improved guarantees for Vertex Sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms (ESA 2017). 25th Annual European Symposium on Algorithms (ESA 2017), 04-08 Sep 2017, Vienna, Austria. Leibniz International Proceedings in Informatics, 87 . Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 44:1-44:14. ISBN 978-3-95977-049-1

Goranci, G., Henzinger, M. and Peng, P. orcid.org/0000-0003-2700-5699 (2017) The power of vertex sparsifiers in dynamic graph algorithms. In: 25th Annual European Symposium on Algorithms (ESA 2017). 25th Annual European Symposium on Algorithms (ESA 2017), 04-08 Sep 2017, Vienna, Austria. Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 45:1-45:14. ISBN 978-3-95977-049-1