Practical minimum cut algorithms
M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22.
LibreCat: https://research-explorer.ista.ac.at/record/11657
DOI: 10.1145/3274662
arXiv: 1708.06127

Valuation compressions in VCG-based combinatorial auctions
P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/11667
DOI: 10.1145/3232860
arXiv: 1310.3153

Incremental exact min-cut in polylogarithmic amortized update time
G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/11664
DOI: 10.1145/3174803
arXiv: 1611.06500

Dynamic algorithms via the primal-dual method
S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.
LibreCat: https://research-explorer.ista.ac.at/record/11757
DOI: 10.1016/j.ic.2018.02.005

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

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

Decremental single-source shortest paths on undirected graphs in near-linear total update time
M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.
LibreCat: https://research-explorer.ista.ac.at/record/11768
DOI: 10.1145/3218657
arXiv: 1512.08148

Dynamic algorithms for graph coloring
S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20.
LibreCat: https://research-explorer.ista.ac.at/record/11872
DOI: 10.1137/1.9781611975031.1
arXiv: 1711.04355

Practical minimum cut algorithms
M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61.
LibreCat: https://research-explorer.ista.ac.at/record/11882
DOI: 10.1137/1.9781611975055.5
arXiv: 1708.06127

Deterministic fully dynamic data structures for vertex cover and matching
S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.
LibreCat: https://research-explorer.ista.ac.at/record/11890
DOI: 10.1137/140998925
arXiv: 1412.1318

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

Infinite-dimensional calculus under weak spatial regularity of the processes
F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.
LibreCat: https://research-explorer.ista.ac.at/record/1215
DOI: 10.1007/s10959-016-0724-2

Averages of arithmetic functions over principal ideals
T.D. Browning, E. Sofos, International Journal of Nuber Theory 15 (2018) 547–567.
LibreCat: https://research-explorer.ista.ac.at/record/176
DOI: 10.1142/S1793042119500283
arXiv: 1706.04331

Counting rational points on quadric surfaces
T.D. Browning, R. Heath-Brown, Discrete Analysis 15 (2018) 1–29.
LibreCat: https://research-explorer.ista.ac.at/record/178
DOI: 10.19086/da.4375
arXiv: 1801.00979

Hanani-Tutte for approximating maps of graphs
R. Fulek, J. Kyndl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/185
DOI: 10.4230/LIPIcs.SoCG.2018.39

Smallest enclosing spheres and Chernoff points in Bregman geometry
H. Edelsbrunner, Z. Virk, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 35:1-35:13.
LibreCat: https://research-explorer.ista.ac.at/record/188
DOI: 10.4230/LIPIcs.SoCG.2018.35

Learning directed acyclic graphs based on sparsest permutations
G. Raskutti, C. Uhler, STAT 7 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/2015
DOI: 10.1002/sta4.183
arXiv: 1307.0366

An introduction to the maximum entropy approach and its application to inference problems in biology
A. De Martino, D. De Martino, Heliyon 4 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/306
DOI: 10.1016/j.heliyon.2018.e00596

Measuring dorsoventral pattern and morphogen signaling profiles in the growing neural tube
M.P. Zagórski, A. Kicheva, in:, Morphogen Gradients , Springer Nature, 2018, pp. 47–63.
LibreCat: https://research-explorer.ista.ac.at/record/37
DOI: 10.1007/978-1-4939-8772-6_4

Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs
S. Agrawal, K. Chatterjee, P. Novotný, in:, ACM, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/325
DOI: 10.1145/3158122
arXiv: 1709.04037