Henzinger, M. H., Noe, A., Schulz, C., &; Strash, D. (2018). Practical minimum cut algorithms. ACM Journal of Experimental Algorithmics. Association for Computing Machinery.https://doi.org/10.1145/3274662 

Dütting, P., Henzinger, M. H., &; Starnberger, M. (2018). Valuation compressions in VCG-based combinatorial auctions. ACM Transactions on Economics and Computation. Association for Computing Machinery.https://doi.org/10.1145/3232860 

Goranci, G., Henzinger, M. H., &; Thorup, M. (2018). Incremental exact min-cut in polylogarithmic amortized update time. ACM Transactions on Algorithms. Association for Computing Machinery.https://doi.org/10.1145/3174803 

Bhattacharya, S., Henzinger, M. H., &; Italiano, G. (2018). Dynamic algorithms via the primal-dual method. Information and Computation. Elsevier.https://doi.org/10.1016/j.ic.2018.02.005 

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 

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 

Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2018). Decremental single-source shortest paths on undirected graphs in near-linear total update time. Journal of the ACM. Association for Computing Machinery.https://doi.org/10.1145/3218657 

Bhattacharya, S., Chakrabarty, D., Henzinger, M. H., &; Nanongkai, D. (2018). Dynamic algorithms for graph coloring. In 29th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1–20). New Orleans, LA, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611975031.1 

Henzinger, M. H., Noe, A., Schulz, C., &; Strash, D. (2018). Practical minimum cut algorithms. In 20th Workshop on Algorithm Engineering and Experiments (pp. 48–61). New Orleans, LA, United States: Society for Industrial and Applied Mathematics.https://doi.org/10.1137/1.9781611975055.5 

Bhattacharya, S., Henzinger, M. H., &; Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. Society for Industrial &; Applied Mathematics.https://doi.org/10.1137/140998925 

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 

Flandoli, F., Russo, F., &; Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. Springer.https://doi.org/10.1007/s10959-016-0724-2 

Browning, T. D., &; Sofos, E. (2018). Averages of arithmetic functions over principal ideals. International Journal of Nuber Theory. World Scientific Publishing.https://doi.org/10.1142/S1793042119500283 

Browning, T. D., &; Heath-Brown, R. (2018). Counting rational points on quadric surfaces. Discrete Analysis. Alliance of Diamond Open Access Journals.https://doi.org/10.19086/da.4375 

Fulek, R., &; Kyndl, J. (2018). Hanani-Tutte for approximating maps of graphs (Vol. 99). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.39 

Edelsbrunner, H., Virk, Z., &; Wagner, H. (2018). Smallest enclosing spheres and Chernoff points in Bregman geometry (Vol. 99, p. 35:1-35:13). Presented at the SoCG: Symposium on Computational Geometry, Budapest, Hungary: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPIcs.SoCG.2018.35 

Raskutti, G., &; Uhler, C. (2018). Learning directed acyclic graphs based on sparsest permutations. STAT. Wiley.https://doi.org/10.1002/sta4.183 

De Martino, A., &; De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. Elsevier.https://doi.org/10.1016/j.heliyon.2018.e00596 

Zagórski, M. P., &; Kicheva, A. (2018). Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube. In Morphogen Gradients  (Vol. 1863, pp. 47–63). Springer Nature.https://doi.org/10.1007/978-1-4939-8772-6_4 

Agrawal, S., Chatterjee, K., &; Novotný, P. (2018). Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs (Vol. 2). Presented at the POPL: Principles of Programming Languages, Los Angeles, CA, USA: ACM.https://doi.org/10.1145/3158122