Resch N, Yuan C, Zhang Y. Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.ICALP.2023.99
LibreCat: https://research-explorer.ista.ac.at/record/14083
DOI: 10.4230/LIPIcs.ICALP.2023.99
arXiv: 2210.07754

Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost: Universal batching for concurrent data structures. In: 37th International Symposium on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35
LibreCat: https://research-explorer.ista.ac.at/record/14485
DOI: 10.4230/LIPIcs.DISC.2023.35

Beaver D, Kelkar M, Lewi K, et al. STROBE: Streaming Threshold Random Beacons. In: 5th Conference on Advances in Financial Technologies. Vol 282. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.AFT.2023.7
LibreCat: https://research-explorer.ista.ac.at/record/14516
DOI: 10.4230/LIPIcs.AFT.2023.7

Alistarh D-A, Gelashvili R, Rybicki J. Fast graphical population protocols. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.14
LibreCat: https://research-explorer.ista.ac.at/record/11184
DOI: 10.4230/LIPIcs.OPODIS.2021.14
arXiv: 2102.08808

Nikabadi A, Korhonen J. Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In: Bramas Q, Gramoli V, Milani A, eds. 25th International Conference on Principles of Distributed Systems. Vol 217. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.OPODIS.2021.15
LibreCat: https://research-explorer.ista.ac.at/record/11183
DOI: 10.4230/LIPIcs.OPODIS.2021.15

Chambers E, Fillmore CD, Stephenson ER, Wintraecken M. A cautionary tale: Burning the medial axis is unstable. In: Goaoc X, Kerber M, eds. 38th International Symposium on Computational Geometry. Vol 224. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:66:1-66:9. doi:10.4230/LIPIcs.SoCG.2022.66
LibreCat: https://research-explorer.ista.ac.at/record/11428
DOI: 10.4230/LIPIcs.SoCG.2022.66

Hanauer K, Henzinger MH, Hua QC. Fully dynamic four-vertex subgraph counting. In: 1st Symposium on Algorithmic Foundations of Dynamic Networks. Vol 221. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.SAND.2022.18
LibreCat: https://research-explorer.ista.ac.at/record/11812
DOI: 10.4230/LIPIcs.SAND.2022.18
arXiv: 2106.15524

Ahmadi A, Chatterjee K, Goharshady AK, Meggendorfer T, Safavi Hemami R, Zikelic D. Algorithms and hardness results for computing cores of Markov chains. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.29
LibreCat: https://research-explorer.ista.ac.at/record/12102
DOI: 10.4230/LIPIcs.FSTTCS.2022.29

Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.FSTTCS.2022.11
LibreCat: https://research-explorer.ista.ac.at/record/12101
DOI: 10.4230/LIPIcs.FSTTCS.2022.11

Henzinger TA, Lehtinen K, Totzke P. History-deterministic timed automata. In: 33rd International Conference on Concurrency Theory. Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:14:1-14:21. doi:10.4230/LIPIcs.CONCUR.2022.14
LibreCat: https://research-explorer.ista.ac.at/record/12508
DOI: 10.4230/LIPIcs.CONCUR.2022.14

Avni G, Henzinger TA. An updated survey of bidding games on graphs. In: 47th International Symposium on Mathematical Foundations of Computer Science. Vol 241. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022:3:1-3:6. doi:10.4230/LIPIcs.MFCS.2022.3
LibreCat: https://research-explorer.ista.ac.at/record/12509
DOI: 10.4230/LIPIcs.MFCS.2022.3

Grover K, Kretinsky J, Meggendorfer T, Weininger M. Anytime guarantees for reachability in uncountable Markov decision processes. In: 33rd International Conference on Concurrency Theory . Vol 243. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:10.4230/LIPIcs.CONCUR.2022.11
LibreCat: https://research-explorer.ista.ac.at/record/12775
DOI: 10.4230/LIPIcs.CONCUR.2022.11
arXiv: 2008.04824

Jecker IR, Mazzocchi N, Wolf P. Decomposing permutation automata. In: 32nd International Conference on Concurrency Theory. Vol 203. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.CONCUR.2021.18
LibreCat: https://research-explorer.ista.ac.at/record/10052
DOI: 10.4230/LIPIcs.CONCUR.2021.18
arXiv: 2107.04683

Chatterjee K, Henzinger MH, Kale SS, Svozil A. Faster algorithms for bounded liveness in graphs and game graphs. In: 48th International Colloquium on Automata, Languages, and Programming. Vol 198. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ICALP.2021.124
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Harris DG, Iliopoulos F, Kolmogorov V. A new notion of commutativity for the algorithmic Lovász Local Lemma. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Vol 207. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31
LibreCat: https://research-explorer.ista.ac.at/record/10072
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.31
arXiv: 2008.05569

Guha S, Jecker IR, Lehtinen K, Zimmermann M. A bit of nondeterminism makes pushdown automata expressive and succinct. In: 46th International Symposium on Mathematical Foundations of Computer Science. Vol 202. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.MFCS.2021.53
LibreCat: https://research-explorer.ista.ac.at/record/10075
DOI: 10.4230/LIPIcs.MFCS.2021.53
arXiv: 2105.02611

Alistarh D-A, Gelashvili R, Rybicki J. Brief announcement: Fast graphical population protocols. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.43
LibreCat: https://research-explorer.ista.ac.at/record/10218
DOI: 10.4230/LIPIcs.DISC.2021.43
arXiv: 2102.08808

Alistarh D-A, Gelashvili R, Nadiradze G. Lower bounds for shared-memory leader election under bounded write contention. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.4
LibreCat: https://research-explorer.ista.ac.at/record/10217
DOI: 10.4230/LIPIcs.DISC.2021.4

Chatterjee B, Peri S, Sa M. Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.52
LibreCat: https://research-explorer.ista.ac.at/record/10216
DOI: 10.4230/LIPIcs.DISC.2021.52
arXiv: 2003.01697

Korhonen J, Paz A, Rybicki J, Schmid S, Suomela J. Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In: 35th International Symposium on Distributed Computing. Vol 209. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.DISC.2021.58
LibreCat: https://research-explorer.ista.ac.at/record/10219
DOI: 10.4230/LIPIcs.DISC.2021.58
arXiv: 2108.02655

Arrighi E, Fernau H, Hoffmann S, et al. On the complexity of intersection non-emptiness for star-free language classes. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.34
LibreCat: https://research-explorer.ista.ac.at/record/10630
DOI: 10.4230/LIPIcs.FSTTCS.2021.34
arXiv: 2110.01279

Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Quantitative verification on product graphs of small treewidth. In: 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 213. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.FSTTCS.2021.42
LibreCat: https://research-explorer.ista.ac.at/record/10629
DOI: 10.4230/LIPIcs.FSTTCS.2021.42

Fichtenberger H, Henzinger MH, Ost W. Differentially private algorithms for graphs under continual observation. In: 29th Annual European Symposium on Algorithms. Vol 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ESA.2021.42
LibreCat: https://research-explorer.ista.ac.at/record/11814
DOI: 10.4230/LIPIcs.ESA.2021.42
arXiv: 2106.14756

Edelsbrunner H, Heiss T,10.4230/LIPIcs.SoCG.2021.32__Kurlin10.4230/LIPIcs.SoCG.2021.32__V, Smith P, Wintraecken M. The density fingerprint of a periodic point set. In: 37th International Symposium on Computational Geometry (SoCG 2021). Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:32:1-32:16. doi:10.4230/LIPIcs.SoCG.2021.32
LibreCat: https://research-explorer.ista.ac.at/record/9345
DOI: 10.4230/LIPIcs.SoCG.2021.32

Jecker IR. A Ramsey theorem for finite monoids. In: 38th International Symposium on Theoretical Aspects of Computer Science. Vol 187. Schloss Dagstuhl - Leibniz Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.STACS.2021.44
LibreCat: https://research-explorer.ista.ac.at/record/10055
DOI: 10.4230/LIPIcs.STACS.2021.44
WoS: 000635691700044

Boissonnat J-D, Kachanovich S, Wintraecken M. Tracing isomanifolds in Rd in time polynomial in d using Coxeter-Freudenthal-Kuhn triangulations. In: 37th International Symposium on Computational Geometry (SoCG 2021). Vol 189. Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:17:1-17:16. doi:10.4230/LIPIcs.SoCG.2021.17
LibreCat: https://research-explorer.ista.ac.at/record/9441
DOI: 10.4230/LIPIcs.SoCG.2021.17

Henzinger MH, Kale S. Fully-dynamic coresets. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.57
LibreCat: https://research-explorer.ista.ac.at/record/11818
DOI: 10.4230/LIPIcs.ESA.2020.57
arXiv: 2004.14891

Henzinger MH, Shahbaz K, Paul R, Schulz C. Dynamic matching algorithms in practice. In: 8th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.58
LibreCat: https://research-explorer.ista.ac.at/record/11816
DOI: 10.4230/LIPIcs.ESA.2020.58
arXiv: 2004.09099

Henzinger MH, Neumann S, Wiese A. Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.51
LibreCat: https://research-explorer.ista.ac.at/record/11824
DOI: 10.4230/LIPIcs.SoCG.2020.51
arXiv: 2003.02605

Hanauer K, Henzinger MH, Schulz C. Faster fully dynamic transitive closure in practice. In: 18th International Symposium on Experimental Algorithms. Vol 160. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SEA.2020.14
LibreCat: https://research-explorer.ista.ac.at/record/11822
DOI: 10.4230/LIPIcs.SEA.2020.14
arXiv: 2002.00813

Henzinger MH, Peng P. Constant-time dynamic (+1)-coloring. In: 37th International Symposium on Theoretical Aspects of Computer Science. Vol 154. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.STACS.2020.53
LibreCat: https://research-explorer.ista.ac.at/record/11825
DOI: 10.4230/LIPIcs.STACS.2020.53
arXiv: 1907.04745

Henzinger MH, Noe A, Schulz C, Strash D. Finding all global minimum cuts in practice. In: 28th Annual European Symposium on Algorithms. Vol 173. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.ESA.2020.59
LibreCat: https://research-explorer.ista.ac.at/record/11819
DOI: 10.4230/LIPIcs.ESA.2020.59
arXiv: 2002.06948

Ferrere T, Henzinger TA, Kragl B. Monitoring event frequencies. In: 28th EACSL Annual Conference on Computer Science Logic. Vol 152. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.CSL.2020.20
LibreCat: https://research-explorer.ista.ac.at/record/7348
DOI: 10.4230/LIPIcs.CSL.2020.20
arXiv: 1910.06097

Aksenov V, Alistarh D-A, Drozdova A, Mohtashami A. The splay-list: A distribution-adaptive concurrent skip-list. In: 34th International Symposium on Distributed Computing. Vol 179. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020:3:1-3:18. doi:10.4230/LIPIcs.DISC.2020.3
LibreCat: https://research-explorer.ista.ac.at/record/8725
DOI: 10.4230/LIPIcs.DISC.2020.3
arXiv: 2008.01009

Boissonnat J-D, Wintraecken M. The topological correctness of PL-approximations of isomanifolds. In: 36th International Symposium on Computational Geometry. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:10.4230/LIPIcs.SoCG.2020.20
LibreCat: https://research-explorer.ista.ac.at/record/7952
DOI: 10.4230/LIPIcs.SoCG.2020.20

Ancona B, Henzinger MH, Roditty L, Williams VV, Wein N. Algorithms and hardness for diameter in dynamic graphs. In: 46th International Colloquium on Automata, Languages, and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ICALP.2019.13
LibreCat: https://research-explorer.ista.ac.at/record/11826
DOI: 10.4230/LIPICS.ICALP.2019.13
arXiv: 811.12527

Pietrzak KZ. Simple verifiable delay functions. In: 10th Innovations in Theoretical Computer Science Conference. Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.ITCS.2019.60
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77
LibreCat: https://research-explorer.ista.ac.at/record/6725
DOI: 10.4230/LIPICS.ICALP.2019.77
arXiv: 1803.02289

Fulek R, Kyncl J. Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In: 35th International Symposium on Computational Geometry (SoCG 2019). Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019. doi:10.4230/LIPICS.SOCG.2019.39
LibreCat: https://research-explorer.ista.ac.at/record/7401
DOI: 10.4230/LIPICS.SOCG.2019.39
arXiv: 1903.08637

Huszár K, Spreer J. 3-manifold triangulations with small treewidth. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:44:1-44:20. doi:10.4230/LIPIcs.SoCG.2019.44
LibreCat: https://research-explorer.ista.ac.at/record/6556
DOI: 10.4230/LIPIcs.SoCG.2019.44
arXiv: 1812.05528

Fulek R, Gärtner B, Kupavskii A, Valtr P, Wagner U. The crossing Tverberg theorem. In: 35th International Symposium on Computational Geometry. Vol 129. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:38:1-38:13. doi:10.4230/LIPICS.SOCG.2019.38
LibreCat: https://research-explorer.ista.ac.at/record/6647
DOI: 10.4230/LIPICS.SOCG.2019.38
arXiv: 1812.04911

Goranci G, Henzinger MH, Peng P. Dynamic effective resistances and approximate schur complement on separable graphs. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.40
LibreCat: https://research-explorer.ista.ac.at/record/11828
DOI: 10.4230/LIPICS.ESA.2018.40
arXiv: 1802.09111

Goranci G, Henzinger MH, Leniowski D. A tree structure for dynamic facility location. In: 26th Annual European Symposium on Algorithms. Vol 112. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.ESA.2018.39
LibreCat: https://research-explorer.ista.ac.at/record/11827
DOI: 10.4230/LIPICS.ESA.2018.39
arXiv: 1909.06653

Biedermann S, Henzinger MH, Schulz C, Schuster B. Memetic graph clustering. In: 17th International Symposium on Experimental Algorithms. Vol 103. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.SEA.2018.3
LibreCat: https://research-explorer.ista.ac.at/record/11911
DOI: 10.4230/LIPICS.SEA.2018.3
arXiv: 1802.07034

Pietrzak KZ. Proofs of catalytic space. In: 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019). Vol 124. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018:59:1-59:25. doi:10.4230/LIPICS.ITCS.2019.59
LibreCat: https://research-explorer.ista.ac.at/record/7407
DOI: 10.4230/LIPICS.ITCS.2019.59

Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:10.4230/LIPICS.MFCS.2018.23
LibreCat: https://research-explorer.ista.ac.at/record/6005
DOI: 10.4230/LIPICS.MFCS.2018.23

Henzinger MH, Lincoln A, Neumann S, Vassilevska Williams V. Conditional hardness for sensitivity problems. In: 8th Innovations in Theoretical Computer Science Conference. Vol 67. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ITCS.2017.26
LibreCat: https://research-explorer.ista.ac.at/record/11829
DOI: 10.4230/LIPICS.ITCS.2017.26
arXiv: 1703.01638

Goranci G, Henzinger MH, Peng P. The power of vertex sparsifiers in dynamic graph algorithms. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.45
LibreCat: https://research-explorer.ista.ac.at/record/11833
DOI: 10.4230/LIPICS.ESA.2017.45
arXiv: 1712.06473

Henzinger MH, Leniowski D, Mathieu C. Dynamic clustering to minimize the sum of radii. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.48
LibreCat: https://research-explorer.ista.ac.at/record/11832
DOI: 10.4230/LIPICS.ESA.2017.48
arXiv: 1707.02577

Goranci G, Henzinger MH, Peng P. Improved guarantees for vertex sparsification in planar graphs. In: 25th Annual European Symposium on Algorithms. Vol 87. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPICS.ESA.2017.44
LibreCat: https://research-explorer.ista.ac.at/record/11831
DOI: 10.4230/LIPICS.ESA.2017.44
arXiv: 1702.01136

Avni G, Henzinger TA, Chonev VK. Infinite-duration bidding games. In: Vol 85. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2017. doi:10.4230/LIPIcs.CONCUR.2017.21
LibreCat: https://research-explorer.ista.ac.at/record/950
DOI: 10.4230/LIPIcs.CONCUR.2017.21
arXiv: 1705.01433

Cheung YK, Goranci G, Henzinger MH. Graph minors for preserving terminal distances approximately - lower and upper bounds. In: 43rd International Colloquium on Automata, Languages, and Programming. Vol 55. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ICALP.2016.131
LibreCat: https://research-explorer.ista.ac.at/record/11836
DOI: 10.4230/LIPICS.ICALP.2016.131
arXiv: 1604.08342

Goranci G, Henzinger MH, Thorup M. Incremental exact min-cut in poly-logarithmic amortized update time. In: 24th Annual European Symposium on Algorithms. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.46
LibreCat: https://research-explorer.ista.ac.at/record/11834
DOI: 10.4230/LIPICS.ESA.2016.46
arXiv: 1611.06500

Henzinger MH, Neumann S. Incremental and fully dynamic subgraph connectivity for emergency planning. In: 24th Annual European Symposium on Algorithms. Vol 57. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2016. doi:10.4230/LIPICS.ESA.2016.48
LibreCat: https://research-explorer.ista.ac.at/record/11835
DOI: 10.4230/LIPICS.ESA.2016.48
arXiv: 1611.05248

Bhattacharya S, Dvorák W, Henzinger MH, Starnberger10.4230/LIPICS.STACS.2015.90__Martin. Welfare maximization with friends-of-friends network externalities. In: 32nd International Symposium on Theoretical Aspects of Computer Science. Vol 30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2015:90-102. doi:10.4230/LIPICS.STACS.2015.90
LibreCat: https://research-explorer.ista.ac.at/record/11837
DOI: 10.4230/LIPICS.STACS.2015.90

Dütting P, Henzinger MH, Weber I. Sponsored search, market equilibria, and the Hungarian Method. In: 27th International Symposium on Theoretical Aspects of Computer Science. Vol 5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2010:287-298. doi:10.4230/LIPICS.STACS.2010.2463
LibreCat: https://research-explorer.ista.ac.at/record/11838
DOI: 10.4230/LIPICS.STACS.2010.2463
arXiv: 0912.1934

Baykan10.4230/LIPICS.STACS.2009.1809__Eda, Henzinger MH, Keller SF, de Castelberg S, Kinzler M. A comparison of techniques for sampling web pages. In: 26th International Symposium on Theoretical Aspects of Computer Science. Vol 3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2009:13-30. doi:10.4230/LIPICS.STACS.2009.1809
LibreCat: https://research-explorer.ista.ac.at/record/11912
DOI: 10.4230/LIPICS.STACS.2009.1809
arXiv: 0902.1604