Goranci, G., Henzinger, M. H., Räcke, H., Sachdeva, S., &; Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ITCS.2024.55 
LibreCat: https://research-explorer.ista.ac.at/record/15008
DOI: 10.4230/LIPIcs.ITCS.2024.55
arXiv: 2303.02491

Alpos, O., Amores-Sesar, I., Cachin, C., &; Yeo, M. X. (2024). Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.OPODIS.2023.12 
LibreCat: https://research-explorer.ista.ac.at/record/15007
DOI: 10.4230/LIPIcs.OPODIS.2023.12
arXiv: 2307.02954

Henzinger, M. H., Neumann, S., Räcke, H., &; Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.STACS.2023.36 
LibreCat: https://research-explorer.ista.ac.at/record/12760
DOI: 10.4230/LIPIcs.STACS.2023.36
arXiv: 2301.01744

Goranci, G., &; Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.69 
LibreCat: https://research-explorer.ista.ac.at/record/14085
DOI: 10.4230/LIPIcs.ICALP.2023.69

Harris, D. G., &; Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2023.72 
LibreCat: https://research-explorer.ista.ac.at/record/14084
DOI: 10.4230/LIPIcs.ICALP.2023.72
arXiv: 2007.10824

Resch, N., Yuan, C., &; Zhang, Y. (2023). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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., Nikolaenko, V., Sonnino, A., Chalkias, K.,https://doi.org/10.4230/LIPIcs.AFT.2023.7__Roy, A. (2023). STROBE: Streaming Threshold Random Beacons. In 5th Conference on Advances in Financial Technologies (Vol. 282). Princeton, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2022). Fast graphical population protocols. In Q. Bramas, V. Gramoli, &; A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2022). Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In Q. Bramas, V. Gramoli, &; A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, C. D., Stephenson, E. R., &; Wintraecken, M. (2022). A cautionary tale: Burning the medial axis is unstable. In X. Goaoc &; M. Kerber (Eds.), 38th International Symposium on Computational Geometry (Vol. 224, p. 66:1-66:9). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, A. K., Meggendorfer, T., Safavi Hemami, R., &; Zikelic, D. (2022). 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). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, I. R., &; Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11 
LibreCat: https://research-explorer.ista.ac.at/record/12101
DOI: 10.4230/LIPIcs.FSTTCS.2022.11

Henzinger, T. A., Lehtinen, K., &; Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory  (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, I. R., Mazzocchi, N., &; Wolf, P. (2021). Decomposing permutation automata. In 32nd International Conference on Concurrency Theory (Vol. 203). Paris, France: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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, M. H., Kale, S. S., &; Svozil, A. (2021). Faster algorithms for bounded liveness in graphs and game graphs. In 48th International Colloquium on Automata, Languages, and Programming (Vol. 198). Glasgow, Scotland: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.ICALP.2021.124 
LibreCat: https://research-explorer.ista.ac.at/record/10054
DOI: 10.4230/LIPIcs.ICALP.2021.124

Harris, D. G., Iliopoulos, F., &; Kolmogorov, V. (2021). A new notion of commutativity for the algorithmic Lovász Local Lemma. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Vol. 207). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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, I. R., Lehtinen, K., &; Zimmermann, M. (2021). A bit of nondeterminism makes pushdown automata expressive and succinct. In 46th International Symposium on Mathematical Foundations of Computer Science (Vol. 202). Tallinn, Estonia: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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. (2021). Brief announcement: Fast graphical population protocols. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2021). Lower bounds for shared-memory leader election under bounded write contention. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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. (2021). Brief announcement: Non-blocking dynamic unbounded graphs with worst-case amortized bounds. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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. (2021). Brief announcement: Sinkless orientation is hard also in the supported LOCAL model. In 35th International Symposium on Distributed Computing (Vol. 209). Freiburg, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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., Holzer, M., Jecker, I. R., De Oliveira Oliveira, M., &; Wolf, P. (2021). 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). Virtual: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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. (2021). Quantitative verification on product graphs of small treewidth. In 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 213). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Ost, W. (2021). Differentially private algorithms for graphs under continual observation. In 29th Annual European Symposium on Algorithms (Vol. 204). Lisbon, Portual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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.,https://doi.org/10.4230/LIPIcs.SoCG.2021.32__Kurlin , V., Smith, P., &; Wintraecken, M. (2021). The density fingerprint of a periodic point set. In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol. 189, p. 32:1-32:16). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2021.32 
LibreCat: https://research-explorer.ista.ac.at/record/9345
DOI: 10.4230/LIPIcs.SoCG.2021.32

Jecker, I. R. (2021). A Ramsey theorem for finite monoids. In 38th International Symposium on Theoretical Aspects of Computer Science (Vol. 187). Saarbrücken, Germany: Schloss Dagstuhl - Leibniz Zentrum für Informatik.https://doi.org/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. (2021). 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, p. 17:1-17:16). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2021.17 
LibreCat: https://research-explorer.ista.ac.at/record/9441
DOI: 10.4230/LIPIcs.SoCG.2021.17

Henzinger, M. H., &; Kale, S. (2020). Fully-dynamic coresets. In 28th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., Shahbaz, K., Paul, R., &; Schulz, C. (2020). Dynamic matching algorithms in practice. In 8th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., Neumann, S., &; Wiese, A. (2020). Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles. In 36th International Symposium on Computational Geometry (Vol. 164). Zurich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Schulz, C. (2020). Faster fully dynamic transitive closure in practice. In 18th International Symposium on Experimental Algorithms (Vol. 160). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Peng, P. (2020). Constant-time dynamic (+1)-coloring. In 37th International Symposium on Theoretical Aspects of Computer Science (Vol. 154). Montpellier, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., Noe, A., Schulz, C., &; Strash, D. (2020). Finding all global minimum cuts in practice. In 28th Annual European Symposium on Algorithms (Vol. 173). Pisa, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, T. A., &; Kragl, B. (2020). Monitoring event frequencies. In 28th EACSL Annual Conference on Computer Science Logic (Vol. 152). Barcelona, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2020). The splay-list: A distribution-adaptive concurrent skip-list. In 34th International Symposium on Distributed Computing (Vol. 179, p. 3:1-3:18). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2020). The topological correctness of PL-approximations of isomanifolds. In 36th International Symposium on Computational Geometry (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., Roditty, L., Williams, V. V., &; Wein, N. (2019). Algorithms and hardness for diameter in dynamic graphs. In 46th International Colloquium on Automata, Languages, and Programming (Vol. 132). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, K. Z. (2019). Simple verifiable delay functions. In 10th Innovations in Theoretical Computer Science Conference (Vol. 124). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.ITCS.2019.60 
LibreCat: https://research-explorer.ista.ac.at/record/6528
DOI: 10.4230/LIPICS.ITCS.2019.60

Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2019). Z_2-Genus of graphs and minimum rank of partial symmetric matrices. In 35th International Symposium on Computational Geometry (SoCG 2019) (Vol. 129). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2019). 3-manifold triangulations with small treewidth. In 35th International Symposium on Computational Geometry (Vol. 129, p. 44:1-44:20). Portland, Oregon, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2019). The crossing Tverberg theorem. In 35th International Symposium on Computational Geometry (Vol. 129, p. 38:1-38:13). Portland, OR, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Peng, P. (2018). Dynamic effective resistances and approximate schur complement on separable graphs. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Leniowski, D. (2018). A tree structure for dynamic facility location. In 26th Annual European Symposium on Algorithms (Vol. 112). Helsinki, Finland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., Schulz, C., &; Schuster, B. (2018). Memetic graph clustering. In 17th International Symposium on Experimental Algorithms (Vol. 103). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, K. Z. (2018). Proofs of catalytic space. In 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019) (Vol. 124, p. 59:1-59:25). San Diego, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.MFCS.2018.23 
LibreCat: https://research-explorer.ista.ac.at/record/6005
DOI: 10.4230/LIPICS.MFCS.2018.23

Henzinger, M. H., Lincoln, A., Neumann, S., &; Vassilevska Williams, V. (2017). Conditional hardness for sensitivity problems. In 8th Innovations in Theoretical Computer Science Conference (Vol. 67). Berkley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Peng, P. (2017). The power of vertex sparsifiers in dynamic graph algorithms. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., Leniowski, D., &; Mathieu, C. (2017). Dynamic clustering to minimize the sum of radii. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Peng, P. (2017). Improved guarantees for vertex sparsification in planar graphs. In 25th Annual European Symposium on Algorithms (Vol. 87). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, T. A., &; Chonev, V. K. (2017). Infinite-duration bidding games (Vol. 85). Presented at the CONCUR: Concurrency Theory, Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, Y. K., Goranci, G., &; Henzinger, M. H. (2016). Graph minors for preserving terminal distances approximately - lower and upper bounds. In 43rd International Colloquium on Automata, Languages, and Programming (Vol. 55). Rome, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Thorup, M. (2016). Incremental exact min-cut in poly-logarithmic amortized update time. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Neumann, S. (2016). Incremental and fully dynamic subgraph connectivity for emergency planning. In 24th Annual European Symposium on Algorithms (Vol. 57). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Starnberger,https://doi.org/10.4230/LIPICS.STACS.2015.90__Martin. (2015). Welfare maximization with friends-of-friends network externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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, M. H., &; Weber, I. (2010). Sponsored search, market equilibria, and the Hungarian Method. In 27th International Symposium on Theoretical Aspects of Computer Science (Vol. 5, pp. 287–298). Nancy, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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

Baykan,https://doi.org/10.4230/LIPICS.STACS.2009.1809__Eda, Henzinger, M. H., Keller, S. F., de Castelberg, S., &; Kinzler, M. (2009). A comparison of techniques for sampling web pages. In 26th International Symposium on Theoretical Aspects of Computer Science (Vol. 3, pp. 13–30). Freiburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/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