Monika Henzinger

Henzinger_Monika Group

199 Publications

Mark all

[199]
2024 | Conference Paper | IST-REx-ID: 15008 | OA
G. Goranci, M. H. Henzinger, H. Räcke, S. Sachdeva, and A. R. Sricharan, “Electrical flows for polylogarithmic competitive oblivious routing,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287.
[Published Version] View | Files available | DOI | arXiv
 
[198]
2024 | Conference Paper | IST-REx-ID: 14769 | OA
M. H. Henzinger, D. Saulpic, and L. Sidl, “Experimental evaluation of fully dynamic k-means via coresets,” in 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2024, pp. 220–233.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[197]
2024 | Journal Article | IST-REx-ID: 15121 | OA
D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” Mathematical Programming. Springer Nature, 2024.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[196]
2024 | Conference Paper | IST-REx-ID: 15093 | OA
S. Cultrera di Montesano, H. Edelsbrunner, M. H. Henzinger, and L. Ost, “Dynamically maintaining the persistent homology of time series,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, VA, USA, 2024, pp. 243–295.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[195]
2024 | Conference Paper | IST-REx-ID: 15253 | OA
M. H. Henzinger, J. Upadhyay, and S. Upadhyay, “A unifying framework for differentially private sums under continual observation,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2024, vol. 2024, pp. 995–1018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[194]
2023 | Conference Paper | IST-REx-ID: 12760 | OA
M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.
[Published Version] View | Files available | DOI | arXiv
 
[193]
2023 | Conference Paper | IST-REx-ID: 14085 | OA
G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version] View | Files available | DOI
 
[192]
2023 | Conference Paper | IST-REx-ID: 14086 | OA
M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version] View | Files available | DOI | arXiv
 
[191]
2023 | Conference Paper | IST-REx-ID: 14462 | OA
H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.
[Published Version] View | Download Published Version (ext.)
 
[190]
2023 | Journal Article | IST-REx-ID: 14558
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Deterministic near-optimal approximation algorithms for dynamic set cover,” SIAM Journal on Computing, vol. 52, no. 5. Society for Industrial and Applied Mathematics, pp. 1132–1192, 2023.
View | DOI
 
[189]
2023 | Journal Article | IST-REx-ID: 14043 | OA
M. H. Henzinger, B. Jin, R. Peng, and D. P. Williamson, “A combinatorial cut-toggling algorithm for solving Laplacian linear systems,” Algorithmica, vol. 85. Springer Nature, pp. 2680–3716, 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[188]
2023 | Conference Paper | IST-REx-ID: 13236 | OA
D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” in International Conference on Integer Programming and Combinatorial Optimization, Madison, WI, United States, 2023, vol. 13904, pp. 453–465.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[187]
2022 | Journal Article | IST-REx-ID: 11662
M. H. Henzinger and P. Peng, “Constant-time Dynamic (Δ +1)-Coloring,” ACM Transactions on Algorithms, vol. 18, no. 2. Association for Computing Machinery (ACM), 2022.
View | DOI
 
[186]
2022 | Conference Paper | IST-REx-ID: 11812 | OA
K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[185]
2022 | Conference Paper | IST-REx-ID: 11808 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[184]
2022 | Conference Paper | IST-REx-ID: 11918
M. H. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2022, pp. 459–498.
View | DOI
 
[183]
2022 | Conference Paper | IST-REx-ID: 11930 | OA
M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2022, pp. 13–26.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[182]
2022 | Preprint | IST-REx-ID: 14236 | OA
G. Goranci and M. H. Henzinger, “Incremental approximate maximum flow in m1/2+o(1) update time,” arXiv. .
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[181]
2021 | Conference Paper | IST-REx-ID: 10054 | OA
K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
[Published Version] View | Files available | DOI
 
[180]
2021 | Conference Paper | IST-REx-ID: 11649 | OA
M. H. Henzinger, A. Paz, and S. Schmid, “On the complexity of weight-dynamic network algorithms,” in IFIP Networking Conference, Espoo and Helsinki, Finland, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[179]
2021 | Journal Article | IST-REx-ID: 11663 | OA
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” ACM Transactions on Algorithms, vol. 17, no. 4. Association for Computing Machinery, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[178]
2021 | Journal Article | IST-REx-ID: 11756 | OA
M. H. Henzinger and P. Peng, “Constant-time dynamic weight approximation for minimum spanning forest,” Information and Computation, vol. 281, no. 12. Elsevier, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[177]
2021 | Conference Paper | IST-REx-ID: 11771 | OA
M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[176]
2021 | Conference Paper | IST-REx-ID: 11814 | OA
H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in 29th Annual European Symposium on Algorithms, Lisbon, Portual, 2021, vol. 204.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[175]
2021 | Journal Article | IST-REx-ID: 11886 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” SIAM Journal on Computing, vol. 50, no. 3. Society for Industrial & Applied Mathematics, pp. STOC16-98-STOC16-137, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[174]
2021 | Conference Paper | IST-REx-ID: 11919 | OA
T. Bergamaschi, M. H. Henzinger, M. P. Gutenberg, V. V. Williams, and N. Wein, “New techniques and fine-grained hardness for dynamic near-additive spanners,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 1836–1855.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[173]
2021 | Conference Paper | IST-REx-ID: 11923 | OA
M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Tight bounds for online graph partitioning,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2799–2818.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[172]
2021 | Conference Paper | IST-REx-ID: 11920 | OA
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover: Improved amortized and worst-case update time,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2537–2549.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[171]
2021 | Conference Paper | IST-REx-ID: 11931 | OA
G. Goranci, M. H. Henzinger, D. Leniowski, C. Schulz, and A. Svozil, “Fully dynamic k-center clustering in low dimensional metrics,” in 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2021, pp. 143–153.
[Published Version] View | DOI | Download Published Version (ext.)
 
[170]
2021 | Conference Paper | IST-REx-ID: 10002 | OA
K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[169]
2021 | Journal Article | IST-REx-ID: 9293 | OA
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[168]
2020 | Journal Article | IST-REx-ID: 11675 | OA
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic dynamic matching in O(1) update time,” Algorithmica, vol. 82, no. 4. Springer Nature, pp. 1057–1080, 2020.
[Published Version] View | DOI | Download Published Version (ext.)
 
[167]
2020 | Journal Article | IST-REx-ID: 11674 | OA
M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” Algorithmica, vol. 82, no. 11. Springer Nature, pp. 3183–3194, 2020.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[166]
2020 | Conference Paper | IST-REx-ID: 11818 | OA
M. H. Henzinger and S. Kale, “Fully-dynamic coresets,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[165]
2020 | Conference Paper | IST-REx-ID: 11816 | OA
M. H. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms in practice,” in 8th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[164]
2020 | Conference Paper | IST-REx-ID: 11824 | OA
M. H. Henzinger, S. Neumann, and A. Wiese, “Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles,” in 36th International Symposium on Computational Geometry, Zurich, Switzerland, 2020, vol. 164.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[163]
2020 | Conference Paper | IST-REx-ID: 11822 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Faster fully dynamic transitive closure in practice,” in 18th International Symposium on Experimental Algorithms, Pisa, Italy, 2020, vol. 160.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[162]
2020 | Conference Paper | IST-REx-ID: 11825 | OA
M. H. Henzinger and P. Peng, “Constant-time dynamic (Δ+1)-coloring,” in 37th International Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 2020, vol. 154.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[161]
2020 | Conference Paper | IST-REx-ID: 11819 | OA
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Finding all global minimum cuts in practice,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[160]
2020 | Conference Paper | IST-REx-ID: 11852 | OA
L. Chen, G. Goranci, M. H. Henzinger, R. Peng, and T. Saranurak, “Fast dynamic cuts, distances and effective resistances via vertex sparsifiers,” in 61st Annual Symposium on Foundations of Computer Science, Durham, NC, United States, 2020, pp. 1135–1146.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[159]
2020 | Conference Paper | IST-REx-ID: 11880 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Fully dynamic single-source reachability in practice: An experimental study,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 106–119.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[158]
2020 | Conference Paper | IST-REx-ID: 11881 | OA
M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for multiterminal cuts,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 42–55.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[157]
2020 | Journal Article | IST-REx-ID: 11889
M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” SIAM Journal on Computing, vol. 49, no. 1. Society for Industrial & Applied Mathematics, pp. 1–36, 2020.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[156]
2020 | Journal Article | IST-REx-ID: 11894 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” SIAM Journal on Discrete Mathematics, vol. 34, no. 1. Society for Industrial & Applied Mathematics, pp. 130–162, 2020.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[155]
2019 | Conference Paper | IST-REx-ID: 11826 | OA
B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[154]
2019 | Conference Paper | IST-REx-ID: 11850 | OA
M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[153]
2019 | Book Chapter | IST-REx-ID: 11847
S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.
View | DOI | PubMed | Europe PMC
 
[152]
2019 | Conference Paper | IST-REx-ID: 11853 | OA
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[151]
2019 | Conference Paper | IST-REx-ID: 11851
M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[150]
2019 | Conference Paper | IST-REx-ID: 11865 | OA
M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[149]
2019 | Conference Paper | IST-REx-ID: 11871 | OA
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[148]
2019 | Journal Article | IST-REx-ID: 11898 | OA
S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[147]
2019 | Conference Paper | IST-REx-ID: 6887 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
[Published Version] View | Files available | DOI
 
[146]
2018 | Conference Paper | IST-REx-ID: 10883 | OA
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.
[Published Version] View | Files available | DOI | arXiv
 
[145]
2018 | Journal Article | IST-REx-ID: 11657 | OA
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” ACM Journal of Experimental Algorithmics, vol. 23. Association for Computing Machinery, pp. 1–22, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[144]
2018 | Journal Article | IST-REx-ID: 11667 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” ACM Transactions on Economics and Computation, vol. 6, no. 2. Association for Computing Machinery, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[143]
2018 | Journal Article | IST-REx-ID: 11664 | OA
G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in polylogarithmic amortized update time,” ACM Transactions on Algorithms, vol. 14, no. 2. Association for Computing Machinery, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[142]
2018 | Journal Article | IST-REx-ID: 11757 | OA
S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018.
[Published Version] View | DOI | Download Published Version (ext.)
 
[141]
2018 | Conference Paper | IST-REx-ID: 11828 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[140]
2018 | Conference Paper | IST-REx-ID: 11827 | OA
G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[139]
2018 | Journal Article | IST-REx-ID: 11768 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[138]
2018 | Conference Paper | IST-REx-ID: 11872 | OA
S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[137]
2018 | Conference Paper | IST-REx-ID: 11882 | OA
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in 20th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2018, pp. 48–61.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[136]
2018 | Journal Article | IST-REx-ID: 11890 | OA
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” SIAM Journal on Computing, vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[135]
2018 | Conference Paper | IST-REx-ID: 11911 | OA
S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[134]
2018 | Conference Paper | IST-REx-ID: 310 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[133]
2018 | Conference Paper | IST-REx-ID: 141 | OA
K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
[Published Version] View | Files available | DOI | WoS
 
[132]
2018 | Conference Paper | IST-REx-ID: 35 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View | Files available | Download None (ext.) | WoS | arXiv
 
[131]
2017 | Conference Paper | IST-REx-ID: 11651 | OA
D. Wang, K. Fountoulakis, M. H. Henzinger, M. W. Mahoney, and Satish Rao , “Capacity releasing diffusion for speed and locality,” in Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 3598–3607.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[130]
2017 | Journal Article | IST-REx-ID: 11665 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” ACM Transactions on Algorithms, vol. 13, no. 4. Association for Computing Machinery, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[129]
2017 | Journal Article | IST-REx-ID: 11676 | OA
W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” Algorithmica, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[128]
2017 | Conference Paper | IST-REx-ID: 11772
M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.
View | DOI
 
[127]
2017 | Conference Paper | IST-REx-ID: 11829 | OA
M. H. Henzinger, A. Lincoln, S. Neumann, and V. Vassilevska Williams, “Conditional hardness for sensitivity problems,” in 8th Innovations in Theoretical Computer Science Conference, Berkley, CA, United States, 2017, vol. 67.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[126]
2017 | Conference Paper | IST-REx-ID: 11833 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “The power of vertex sparsifiers in dynamic graph algorithms,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[125]
2017 | Conference Paper | IST-REx-ID: 11832 | OA
M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[124]
2017 | Conference Paper | IST-REx-ID: 11874 | OA
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, vol. 0, pp. 470–489.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[123]
2017 | Conference Paper | IST-REx-ID: 11873 | OA
M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 1919–1938.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[122]
2017 | Conference Paper | IST-REx-ID: 11831 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[121]
2017 | Journal Article | IST-REx-ID: 11903 | OA
S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” Theory of Computing Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[120]
2017 | Conference Paper | IST-REx-ID: 12571 | OA
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[119]
2017 | Journal Article | IST-REx-ID: 464 | OA
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI | arXiv
 
[118]
2017 | Conference Paper | IST-REx-ID: 552 | OA
K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
[117]
2017 | Conference Paper | IST-REx-ID: 6519 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.
[Published Version] View | Files available | DOI
 
[116]
2016 | Conference Paper | IST-REx-ID: 1068 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.
[Published Version] View | Files available | DOI
 
[115]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
K. Chatterjee, W. Dvoák, M. H. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[114]
2016 | Conference Paper | IST-REx-ID: 11836 | OA
Y. K. Cheung, G. Goranci, and M. H. Henzinger, “Graph minors for preserving terminal distances approximately - lower and upper bounds,” in 43rd International Colloquium on Automata, Languages, and Programming, Rome, Italy, 2016, vol. 55.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[113]
2016 | Conference Paper | IST-REx-ID: 11834 | OA
G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[112]
2016 | Conference Paper | IST-REx-ID: 11835 | OA
M. H. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity for emergency planning,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[111]
2016 | Conference Paper | IST-REx-ID: 11866 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” in 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, United States, 2016, pp. 489–498.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[110]
2016 | Conference Paper | IST-REx-ID: 11867 | OA
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “New deterministic approximation algorithms for fully dynamic matching,” in 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, United States, 2016, pp. 398–411.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[109]
2016 | Journal Article | IST-REx-ID: 11891 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” SIAM Journal on Computing, vol. 45, no. 3. Society for Industrial & Applied Mathematics, pp. 947–1006, 2016.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[108]
2015 | Journal Article | IST-REx-ID: 11668 | OA
R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2015 | Journal Article | IST-REx-ID: 11669 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions for heterogeneous items and budget limits,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[106]
2015 | Journal Article | IST-REx-ID: 11670
P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
View | DOI
 
[105]
2015 | Conference Paper | IST-REx-ID: 11774 | OA
Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial auctions with conflict-based externalities,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 230–243.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[104]
2015 | Conference Paper | IST-REx-ID: 11773 | OA
O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions with mediators,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[103]
2015 | Conference Paper | IST-REx-ID: 11785 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental single-source reachability on directed graphs,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 725–736.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[102]
2015 | Conference Paper | IST-REx-ID: 11787 | OA
M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex strongly connected components in quadratic time,” in 2nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 713–724.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[101]
2015 | Conference Paper | IST-REx-ID: 11788 | OA
W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,” in 12th International Workshop of Approximation and Online Algorithms, Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[100]
2015 | Conference Paper | IST-REx-ID: 11786 | OA
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms via primal-dual method,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[99]
2015 | Journal Article | IST-REx-ID: 11845 | OA
O. Chernomor et al., “Split diversity in constrained conservation prioritization using integer linear programming,” Methods in Ecology and Evolution, vol. 6, no. 1. Wiley, pp. 83–91, 2015.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[98]
2015 | Conference Paper | IST-REx-ID: 11868 | OA
M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[97]
2015 | Conference Paper | IST-REx-ID: 11869 | OA
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015, pp. 173–182.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[96]
2015 | Conference Paper | IST-REx-ID: 11837 | OA
S. Bhattacharya, W. Dvorák, M. H. Henzinger, and Martin Starnberger, “Welfare maximization with friends-of-friends network externalities,” in 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015, vol. 30, pp. 90–102.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[95]
2015 | Journal Article | IST-REx-ID: 11901 | OA
M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.
View | DOI | Download None (ext.)
 
[94]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[93]
2014 | Conference Paper | IST-REx-ID: 11789 | OA
M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in 22nd Annual European Symposium on Algorithms, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[92]
2014 | Conference Paper | IST-REx-ID: 11790
L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in 10th International Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877, pp. 44–57.
View | DOI
 
[91]
2014 | Conference Paper | IST-REx-ID: 11855 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United States, 2014, pp. 146–155.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[90]
2014 | Conference Paper | IST-REx-ID: 11870 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United States, 2014.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[89]
2014 | Conference Paper | IST-REx-ID: 11876 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.
[Published Version] View | DOI | Download Published Version (ext.)
 
[88]
2014 | Conference Paper | IST-REx-ID: 11875 | OA
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[87]
2014 | Journal Article | IST-REx-ID: 1375 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[86]
2014 | Journal Article | IST-REx-ID: 2141 | OA
K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[85]
2014 | Journal Article | IST-REx-ID: 535 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[84]
2013 | Journal Article | IST-REx-ID: 11671
E. Baykan, I. Weber, and M. H. Henzinger, “A comprehensive study of techniques for URL-based web page language classification,” ACM Transactions on the Web, vol. 7, no. 1. Association for Computing Machinery, 2013.
View | DOI
 
[83]
2013 | Journal Article | IST-REx-ID: 11759 | OA
P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” Information Processing Letters, vol. 113, no. 3. Elsevier, pp. 67–73, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[82]
2013 | Conference Paper | IST-REx-ID: 11793 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in 40th International Colloquium on Automata, Languages, and Programming, Riga, Latvia, 2013, vol. 7966, pp. 607–619.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[81]
2013 | Conference Paper | IST-REx-ID: 11791 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in 9th International Conference on Web and Internet Economics, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[80]
2013 | Conference Paper | IST-REx-ID: 11792 | OA
W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in 21st Annual European Symposium on Algorithms, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[79]
2013 | Conference Paper | IST-REx-ID: 11856 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, United States, 2013, pp. 538–547.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[78]
2013 | Journal Article | IST-REx-ID: 11902
P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” Theoretical Computer Science, vol. 478, no. 3. Elsevier, pp. 22–32, 2013.
View | Files available | DOI
 
[77]
2013 | Journal Article | IST-REx-ID: 11758
L. Aceto, M. H. Henzinger, and J. Sgall, “38th International Colloquium on Automata, Languages and Programming,” Information and Computation, vol. 222, no. 1. Elsevier, p. 1, 2013.
View | DOI
 
[76]
2013 | Journal Article | IST-REx-ID: 2831 | OA
K. Chatterjee, M. H. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3. Springer, pp. 301–327, 2013.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[75]
2012 | Conference Paper | IST-REx-ID: 11656
P. Dütting, M. H. Henzinger, and I. Weber, “Maximizing revenue from strategic recommendations under decaying trust,” in Proceedings of the 21st ACM international conference on Information and knowledge management, Maui, HI, United States, 2012, pp. 2268–2286.
View | DOI
 
[74]
2012 | Conference Paper | IST-REx-ID: 11794 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions with heterogeneous items and budget limits,” in 8th International Workshop on Internet and Network Economics, Liverpool, United Kingdom, 2012, vol. 7695, pp. 44–57.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[73]
2012 | Conference Paper | IST-REx-ID: 11795
R. Colini-Baldeschi, M. H. Henzinger, S. Leonardi, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” in 39th International Colloquium on Automata, Languages, and Programming, Warwick, United Kingdom, 2012, vol. 7392, pp. 1–12.
View | Files available | DOI
 
[72]
2012 | Conference Paper | IST-REx-ID: 3165 | OA
K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
View | Files available | DOI | Download None (ext.) | arXiv
 
[71]
2012 | Conference Paper | IST-REx-ID: 10905 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[70]
2011 | Journal Article | IST-REx-ID: 11673
E. Baykan, M. H. Henzinger, L. Marian, and I. Weber, “A comprehensive study of features and algorithms for URL-based topic classification,” ACM Transactions on the Web, vol. 5, no. 3. Association for Computing Machinery, 2011.
View | DOI
 
[69]
2011 | Journal Article | IST-REx-ID: 11760
P. Dütting, M. H. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” Information Processing Letters, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.
View | DOI
 
[68]
2011 | Conference Paper | IST-REx-ID: 11796
M. H. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget and matroid constraints,” in 19th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.
View | DOI
 
[67]
2011 | Conference Paper | IST-REx-ID: 11864
P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” in Proceedings of the 20th international conference on World wide web, Hyderabad, India, 2011, pp. 127–136.
View | DOI
 
[66]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[65]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[64]
2011 | Technical Report | IST-REx-ID: 5379 | OA
K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
[63]
2010 | Conference Paper | IST-REx-ID: 11797 | OA
J. Feldman, M. H. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein, “Online stochastic packing applied to display ad allocation,” in 18th Annual European Symposium on Algorithms, Liverpool, United Kingdom, 2010, vol. 6346, pp. 182–194.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[62]
2010 | Conference Paper | IST-REx-ID: 11798
P. Dütting and M. H. Henzinger, “Mechanisms for the marriage and the assignment game,” in 7th International Conference on Algorithms and Complexity, Rome, Italy, 2010, vol. 6078, pp. 6–12.
View | DOI
 
[61]
2010 | Conference Paper | IST-REx-ID: 11838 | OA
P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” in 27th International Symposium on Theoretical Aspects of Computer Science, Nancy, France, 2010, vol. 5, pp. 287–298.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[60]
2010 | Conference Paper | IST-REx-ID: 11863
P. Dütting, M. H. Henzinger, and I. Weber, “How much is your personal recommendation worth?,” in Proceedings of the 19th international conference on World wide web , Raleigh, NC, United States, 2010, pp. 1085–1086.
View | DOI
 
[59]
2010 | Journal Article | IST-REx-ID: 11885
M. H. Henzinger, J. Suñol, and I. Weber, “The stability of the h-index,” Scientometrics, vol. 84, no. 2. Springer Nature, pp. 465–479, 2010.
View | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 11799
P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” in 5th International Workshop on Internet and Network Economics, Rome, Italy, 2009, vol. 5929, pp. 575–582.
View | Files available | DOI
 
[57]
2009 | Conference Paper | IST-REx-ID: 11912 | OA
Eda Baykan, M. H. Henzinger, S. F. Keller, S. de Castelberg, and M. Kinzler, “A comparison of techniques for sampling web pages,” in 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, 2009, vol. 3, pp. 13–30.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[56]
2009 | Conference Paper | IST-REx-ID: 11905
E. Baykan, M. H. Henzinger, L. Marian, and I. Weber, “Purely URL-based topic classification,” in 18th International World Wide Web Conference, New York, NY, United States, 2009, pp. 1109–1110.
View | DOI
 
[55]
2009 | Conference Paper | IST-REx-ID: 11906
O. Abdel Hamid, B. Behzadi, S. Christoph, and M. H. Henzinger, “Detecting the origin of text segments efficiently,” in 18th International World Wide Web Conference, Madrid, Spain, 2009, pp. 61–70.
View | DOI
 
[54]
2008 | Journal Article | IST-REx-ID: 11878
E. Baykan, M. H. Henzinger, and I. Weber, “Web page language identification based on URLs,” Proceedings of the VLDB Endowment, vol. 1, no. 1. Association for Computing Machinery, pp. 176–187, 2008.
View | DOI
 
[53]
2007 | Journal Article | IST-REx-ID: 11884
M. H. Henzinger, “Search technologies for the internet,” Science, vol. 317, no. 5837. American Association for the Advancement of Science, pp. 468–471, 2007.
View | DOI | PubMed | Europe PMC
 
[52]
2007 | Conference Paper | IST-REx-ID: 11924
M. H. Henzinger, “Combinatorial algorithms for web search engines: three success stories,” in 18th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2007, pp. 1022–1026.
View
 
[51]
2006 | Conference Paper | IST-REx-ID: 11929
M. H. Henzinger, “Finding near-duplicate web pages: A large-scale evaluation of algorithms,” in 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, WA, United States, 2006, pp. 284–291.
View | DOI
 
[50]
2005 | Conference Paper | IST-REx-ID: 11698
M. H. Henzinger, “Hyperlink analysis on the world wide web,” in Proceedings of the 16th ACM conference on Hypertext and hypermedia, Salzburg, Austria, 2005, pp. 1–3.
View | DOI
 
[49]
2005 | Journal Article | IST-REx-ID: 11904
M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” World Wide Web, vol. 8, no. 2. Springer Nature, pp. 101–126, 2005.
View | Files available | DOI
 
[48]
2005 | Journal Article | IST-REx-ID: 11763 | OA
A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive algorithm for multicast routing and admission control,” Journal of Algorithms, vol. 55, no. 1. Elsevier, pp. 1–20, 2005.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[47]
2004 | Journal Article | IST-REx-ID: 11762 | OA
M. H. Henzinger, “Algorithmic challenges in web search engines,” Internet Mathematics, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.
[Published Version] View | DOI | Download Published Version (ext.)
 
[46]
2004 | Conference Paper | IST-REx-ID: 11801
M. H. Henzinger, “Algorithmic aspects of web search engines,” in 2th Annual European Symposium on Algorithms, Bergen, Norway, 2004, vol. 3221, p. 3.
View | DOI
 
[45]
2004 | Conference Paper | IST-REx-ID: 11800
M. H. Henzinger, “The past, present, and future of web search engines,” in 31st International Colloquium on Automata, Languages and Programming, Turku, Finland, 2004, vol. 3142, p. 3.
View | DOI
 
[44]
2004 | Conference Paper | IST-REx-ID: 11859
M. H. Henzinger, “The past, present, and future of web information retrieval,” in SPIE Proceedings, San Jose, CA, United States, 2004, vol. 5296, pp. 23–26.
View | DOI
 
[43]
2004 | Journal Article | IST-REx-ID: 11877 | OA
M. H. Henzinger and S. Lawrence, “Extracting knowledge from the World Wide Web,” Proceedings of the National Academy of Sciences, vol. 101, no. suppl_1. Proceedings of the National Academy of Sciences, pp. 5186–5191, 2004.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
[42]
2003 | Journal Article | IST-REx-ID: 11766 | OA
M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees and meshes,” Journal of Computer and System Sciences, vol. 66, no. 3. Elsevier, pp. 567–611, 2003.
[Published Version] View | DOI | Download Published Version (ext.)
 
[41]
2003 | Journal Article | IST-REx-ID: 11764
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” Journal of Algorithms, vol. 48, no. 2. Elsevier, pp. 314–332, 2003.
View | DOI
 
[40]
2003 | Conference Paper | IST-REx-ID: 11897
K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in 21st annual international ACM SIGIR conference on Research and development in information retrieval, Melbourne, Australia, 2003, pp. 104–111.
View | DOI
 
[39]
2003 | Conference Paper | IST-REx-ID: 11860
M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” in Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary, 2003.
View | Files available | DOI
 
[38]
2003 | Conference Paper | IST-REx-ID: 11909 | OA
M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search engines,” in 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 2003, pp. 1573–1579.
[Published Version] View | Download Published Version (ext.)
 
[37]
2001 | Journal Article | IST-REx-ID: 11892
M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” SIAM Journal on Computing, vol. 31, no. 2. Society for Industrial & Applied Mathematics, pp. 364–374, 2001.
View | DOI
 
[36]
2001 | Conference Paper | IST-REx-ID: 11914
K. Bharat, B.-W. Chang, M. H. Henzinger, and M. Ruhl, “Who links to whom: Mining linkage between Web sites,” in 1st IEEE International Conference on Data Mining, San Jose, CA, United States, 2001, pp. 51–58.
View | DOI
 
[35]
2001 | Journal Article | IST-REx-ID: 11755
M. H. Henzinger, “Hyperlink analysis for the Web,” IEEE Internet Computing, vol. 5, no. 1. Institute of Electrical and Electronics Engineers, pp. 45–50, 2001.
View | DOI | WoS
 
[34]
2000 | Journal Article | IST-REx-ID: 11683
M. H. Henzinger, S. Rao, and H. N. Gabow, “Computing vertex connectivity: New bounds from old techniques,” Journal of Algorithms, vol. 34, no. 2. Elsevier, pp. 222–250, 2000.
View | DOI
 
[33]
2000 | Journal Article | IST-REx-ID: 11685
M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “On near-uniform URL sampling,” Computer Networks, vol. 33, no. 1–6. Elsevier, pp. 295–308, 2000.
View | DOI
 
[32]
2000 | Journal Article | IST-REx-ID: 11694
S. Albers and M. H. Henzinger, “Exploring unknown environments,” SIAM Journal on Computing, vol. 29, no. 4. Society for Industrial and Applied Mathematics, pp. 1164–1188, 2000.
View | DOI
 
[31]
2000 | Journal Article | IST-REx-ID: 11770 | OA
K. Bharat, A. Broder, J. Dean, and M. H. Henzinger, “A comparison of techniques to find mirrored hosts on the WWW,” Journal of the American Society for Information Science, vol. 51, no. 12. Wiley, pp. 1114–1122, 2000.
[Published Version] View | DOI | Download Published Version (ext.)
 
[30]
2000 | Conference Paper | IST-REx-ID: 11802
M. H. Henzinger, “Web information retrieval - an algorithmic perspective,” in 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2000, vol. 1879, pp. 1–8.
View | DOI
 
[29]
2000 | Journal Article | IST-REx-ID: 11893
M. H. Henzinger, “Improved data structures for fully dynamic biconnectivity,” SIAM Journal on Computing, vol. 29, no. 6. Society for Industrial & Applied Mathematics, pp. 1761–1815, 2000.
View | DOI
 
[28]
1999 | Conference Paper | IST-REx-ID: 11691
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” in Proceedings of the 31st annual ACM symposium on Theory of computing, Atlanta, GA, United States, 1999, pp. 189–197.
View | DOI
 
[27]
1999 | Journal Article | IST-REx-ID: 11687
J. Dean and M. H. Henzinger, “Finding related pages in the world wide Web,” Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1467–1479, 1999.
View | DOI
 
[26]
1999 | Journal Article | IST-REx-ID: 11688
M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index quality using random walks on the web,” Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1291–1303, 1999.
View | DOI
 
[25]
1999 | Journal Article | IST-REx-ID: 11769
M. H. Henzinger and V. King, “Randomized fully dynamic graph algorithms with polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4. Association for Computing Machinery, pp. 502–516, 1999.
View | DOI
 
[24]
1999 | Journal Article | IST-REx-ID: 11895 | OA
C. Silverstein, H. Marais, M. H. Henzinger, and M. Moricz, “Analysis of a very large web search engine query log,” ACM SIGIR Forum, vol. 33, no. 1. Association for Computing Machinery, pp. 6–12, 1999.
[Published Version] View | DOI | Download Published Version (ext.)
 
[23]
1999 | Journal Article | IST-REx-ID: 11679
M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” Algorithmica, vol. 24. Springer Nature, pp. 1–13, 1999.
View | Files available | DOI
 
[22]
1999 | Conference Paper | IST-REx-ID: 11925
M. H. Henzinger and S. Leonardi  , “Scheduling multicasts on unit-capacity trees and meshes,” in 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, United States, 1999, pp. 438–447.
View
 
[21]
1998 | Conference Paper | IST-REx-ID: 11682
P. K. Agarwal, D. EppsteinL. J. Guibas, and M. H. Henzinger, “Parametric and kinetic minimum spanning trees,” in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, United States, 1998, pp. 596–605.
View | DOI
 
[20]
1998 | Journal Article | IST-REx-ID: 11681
M. H. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity problems in graphs,” Algorithmica, vol. 22, no. 3. Springer Nature, pp. 351–362, 1998.
View | DOI
 
[19]
1998 | Conference Paper | IST-REx-ID: 11926
A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive algorithm for multicast routing and admission control,” in 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, United States, 1998, pp. 97–106.
View | Files available
 
[18]
1998 | Journal Article | IST-REx-ID: 11680
D. Alberts and M. H. Henzinger, “Average-case analysis of dynamic graph algorithms,” Algorithmica, vol. 20. Springer Nature, pp. 31–60, 1998.
View | Files available | DOI
 
[17]
1997 | Journal Article | IST-REx-ID: 11666
J. M. Anderson et al., “Continuous profiling: Where have all the cycles gone?,” ACM Transactions on Computer Systems, vol. 15, no. 4. Association for Computing Machinery, pp. 357–390, 1997.
View | DOI
 
[16]
1997 | Journal Article | IST-REx-ID: 11767 | OA
M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” Journal of Computer and System Sciences, vol. 55, no. 1. Elsevier, pp. 3–23, 1997.
[Published Version] View | DOI | Download Published Version (ext.)
 
[15]
1997 | Journal Article | IST-REx-ID: 11765
M. H. Henzinger, “A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity,” Journal of Algorithms, vol. 24, no. 1. Elsevier, pp. 194–220, 1997.
View | DOI
 
[14]
1997 | Conference Paper | IST-REx-ID: 11803
M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, 1997, vol. 1256, pp. 594–604.
View | DOI
 
[13]
1997 | Journal Article | IST-REx-ID: 11849 | OA
J. M. Anderson et al., “Continuous profiling: Where have all the cycles gone?,” ACM SIGOPS Operating Systems Review, vol. 31, no. 5. Association for Computing Machinery, pp. 1–14, 1997.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[12]
1997 | Journal Article | IST-REx-ID: 11883
M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” Random Structures and Algorithms, vol. 11, no. 4. Wiley, pp. 369–379, 1997.
View | DOI
 
[11]
1996 | Journal Article | IST-REx-ID: 11761
M. H. Henzinger and D. P. Williamson, “On the number of small cuts in a graph,” Information Processing Letters, vol. 59, no. 1. Elsevier, pp. 41–44, 1996.
View | DOI
 
[10]
1996 | Conference Paper | IST-REx-ID: 11804
M. H. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning,” in 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.
View | DOI
 
[9]
1996 | Conference Paper | IST-REx-ID: 11910
M. H. Henzinger and M. Thorup, “Improved sampling with applications to dynamic graph algorithms,” in 23rd International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.
View | DOI
 
[8]
1996 | Conference Paper | IST-REx-ID: 11927 | OA
M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” in 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, United States, 1996, pp. 333–340.
[Published Version] View | Files available | Download Published Version (ext.)
 
[7]
1995 | Journal Article | IST-REx-ID: 11677
M. H. Henzinger, “Fully dynamic biconnectivity in graphs,” Algorithmica, vol. 13, no. 6. Springer Nature, pp. 503–538, 1995.
View | DOI
 
[6]
1995 | Conference Paper | IST-REx-ID: 11684
M. H. Henzinger and V. King, “Fully dynamic biconnectivity and transitive closure,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States, 1995, pp. 664–672.
View | DOI
 
[5]
1995 | Conference Paper | IST-REx-ID: 11806
M. H. Henzinger, “Approximating minimum cuts under insertions,” in 22nd International Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995, vol. 944, pp. 280–291.
View | DOI
 
[4]
1995 | Conference Paper | IST-REx-ID: 11805
M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in 3rd Annual European Symposium on Algorithms, Corfu, Greece, 1995, vol. 979, pp. 171–184.
View | DOI
 
[3]
1995 | Conference Paper | IST-REx-ID: 11928 | OA
D. Alberts and M. H. Henzinger, “Average case analysis of dynamic graph algorithms,” in 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, United States, 1995, pp. 312–321.
[Published Version] View | Files available | Download Published Version (ext.)
 
[2]
1995 | Conference Paper | IST-REx-ID: 4498
M. H. Henzinger, T. A. Henzinger, and P. Kopke, “Computing simulations on finite and infinite graphs,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States of America, 1995, pp. 453–462.
View | DOI
 
[1]
1994 | Conference Paper | IST-REx-ID: 11857
M. H. Henzinger, “Fully dynamic cycle-equivalence in graphs,” in 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, United States, 1994, pp. 744–755.
View | DOI
 
Marked Publication(s)

Search

Filter Publications

199 Publications

Mark all

[199]
2024 | Conference Paper | IST-REx-ID: 15008 | OA
G. Goranci, M. H. Henzinger, H. Räcke, S. Sachdeva, and A. R. Sricharan, “Electrical flows for polylogarithmic competitive oblivious routing,” in 15th Innovations in Theoretical Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287.
[Published Version] View | Files available | DOI | arXiv
 
[198]
2024 | Conference Paper | IST-REx-ID: 14769 | OA
M. H. Henzinger, D. Saulpic, and L. Sidl, “Experimental evaluation of fully dynamic k-means via coresets,” in 2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2024, pp. 220–233.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[197]
2024 | Journal Article | IST-REx-ID: 15121 | OA
D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” Mathematical Programming. Springer Nature, 2024.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[196]
2024 | Conference Paper | IST-REx-ID: 15093 | OA
S. Cultrera di Montesano, H. Edelsbrunner, M. H. Henzinger, and L. Ost, “Dynamically maintaining the persistent homology of time series,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Alexandria, VA, USA, 2024, pp. 243–295.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[195]
2024 | Conference Paper | IST-REx-ID: 15253 | OA
M. H. Henzinger, J. Upadhyay, and S. Upadhyay, “A unifying framework for differentially private sums under continual observation,” in Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2024, vol. 2024, pp. 995–1018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[194]
2023 | Conference Paper | IST-REx-ID: 12760 | OA
M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.
[Published Version] View | Files available | DOI | arXiv
 
[193]
2023 | Conference Paper | IST-REx-ID: 14085 | OA
G. Goranci and M. H. Henzinger, “Efficient data structures for incremental exact and approximate maximum flow,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version] View | Files available | DOI
 
[192]
2023 | Conference Paper | IST-REx-ID: 14086 | OA
M. H. Henzinger, P. Liu, J. Vondrák, and D. W. Zheng, “Faster submodular maximization for several classes of matroids,” in 50th International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 2023, vol. 261.
[Published Version] View | Files available | DOI | arXiv
 
[191]
2023 | Conference Paper | IST-REx-ID: 14462 | OA
H. Fichtenberger, M. H. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained error bound on differentially private continual observation,” in Proceedings of the 40th International Conference on Machine Learning, Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 10072–10092.
[Published Version] View | Download Published Version (ext.)
 
[190]
2023 | Journal Article | IST-REx-ID: 14558
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Deterministic near-optimal approximation algorithms for dynamic set cover,” SIAM Journal on Computing, vol. 52, no. 5. Society for Industrial and Applied Mathematics, pp. 1132–1192, 2023.
View | DOI
 
[189]
2023 | Journal Article | IST-REx-ID: 14043 | OA
M. H. Henzinger, B. Jin, R. Peng, and D. P. Williamson, “A combinatorial cut-toggling algorithm for solving Laplacian linear systems,” Algorithmica, vol. 85. Springer Nature, pp. 2680–3716, 2023.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[188]
2023 | Conference Paper | IST-REx-ID: 13236 | OA
D. W. Zheng and M. H. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” in International Conference on Integer Programming and Combinatorial Optimization, Madison, WI, United States, 2023, vol. 13904, pp. 453–465.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[187]
2022 | Journal Article | IST-REx-ID: 11662
M. H. Henzinger and P. Peng, “Constant-time Dynamic (Δ +1)-Coloring,” ACM Transactions on Algorithms, vol. 18, no. 2. Association for Computing Machinery (ACM), 2022.
View | DOI
 
[186]
2022 | Conference Paper | IST-REx-ID: 11812 | OA
K. Hanauer, M. H. Henzinger, and Q. C. Hua, “Fully dynamic four-vertex subgraph counting,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[185]
2022 | Conference Paper | IST-REx-ID: 11808 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Recent advances in fully dynamic graph algorithms,” in 1st Symposium on Algorithmic Foundations of Dynamic Networks, Virtual, 2022, vol. 221.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[184]
2022 | Conference Paper | IST-REx-ID: 11918
M. H. Henzinger, A. Lincoln, and B. Saha, “The complexity of average-case dynamic subgraph counting,” in 33rd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2022, pp. 459–498.
View | DOI
 
[183]
2022 | Conference Paper | IST-REx-ID: 11930 | OA
M. H. Henzinger, A. Noe, and C. Schulz, “Practical fully dynamic minimum cut algorithms,” in 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2022, pp. 13–26.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[182]
2022 | Preprint | IST-REx-ID: 14236 | OA
G. Goranci and M. H. Henzinger, “Incremental approximate maximum flow in m1/2+o(1) update time,” arXiv. .
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[181]
2021 | Conference Paper | IST-REx-ID: 10054 | OA
K. Chatterjee, M. H. Henzinger, S. S. Kale, and A. Svozil, “Faster algorithms for bounded liveness in graphs and game graphs,” in 48th International Colloquium on Automata, Languages, and Programming, Glasgow, Scotland, 2021, vol. 198.
[Published Version] View | Files available | DOI
 
[180]
2021 | Conference Paper | IST-REx-ID: 11649 | OA
M. H. Henzinger, A. Paz, and S. Schmid, “On the complexity of weight-dynamic network algorithms,” in IFIP Networking Conference, Espoo and Helsinki, Finland, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[179]
2021 | Journal Article | IST-REx-ID: 11663 | OA
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” ACM Transactions on Algorithms, vol. 17, no. 4. Association for Computing Machinery, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[178]
2021 | Journal Article | IST-REx-ID: 11756 | OA
M. H. Henzinger and P. Peng, “Constant-time dynamic weight approximation for minimum spanning forest,” Information and Computation, vol. 281, no. 12. Elsevier, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[177]
2021 | Conference Paper | IST-REx-ID: 11771 | OA
M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[176]
2021 | Conference Paper | IST-REx-ID: 11814 | OA
H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in 29th Annual European Symposium on Algorithms, Lisbon, Portual, 2021, vol. 204.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[175]
2021 | Journal Article | IST-REx-ID: 11886 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” SIAM Journal on Computing, vol. 50, no. 3. Society for Industrial & Applied Mathematics, pp. STOC16-98-STOC16-137, 2021.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[174]
2021 | Conference Paper | IST-REx-ID: 11919 | OA
T. Bergamaschi, M. H. Henzinger, M. P. Gutenberg, V. V. Williams, and N. Wein, “New techniques and fine-grained hardness for dynamic near-additive spanners,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 1836–1855.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[173]
2021 | Conference Paper | IST-REx-ID: 11923 | OA
M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Tight bounds for online graph partitioning,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2799–2818.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[172]
2021 | Conference Paper | IST-REx-ID: 11920 | OA
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover: Improved amortized and worst-case update time,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2537–2549.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[171]
2021 | Conference Paper | IST-REx-ID: 11931 | OA
G. Goranci, M. H. Henzinger, D. Leniowski, C. Schulz, and A. Svozil, “Fully dynamic k-center clustering in low dimensional metrics,” in 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2021, pp. 143–153.
[Published Version] View | DOI | Download Published Version (ext.)
 
[170]
2021 | Conference Paper | IST-REx-ID: 10002 | OA
K. Chatterjee, W. Dvorak, M. H. Henzinger, and A. Svozil, “Symbolic time and space tradeoffs for probabilistic verification,” in Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, Rome, Italy, 2021, pp. 1–13.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[169]
2021 | Journal Article | IST-REx-ID: 9293 | OA
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” Artificial Intelligence, vol. 297, no. 8. Elsevier, 2021.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
[168]
2020 | Journal Article | IST-REx-ID: 11675 | OA
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic dynamic matching in O(1) update time,” Algorithmica, vol. 82, no. 4. Springer Nature, pp. 1057–1080, 2020.
[Published Version] View | DOI | Download Published Version (ext.)
 
[167]
2020 | Journal Article | IST-REx-ID: 11674 | OA
M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” Algorithmica, vol. 82, no. 11. Springer Nature, pp. 3183–3194, 2020.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[166]
2020 | Conference Paper | IST-REx-ID: 11818 | OA
M. H. Henzinger and S. Kale, “Fully-dynamic coresets,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[165]
2020 | Conference Paper | IST-REx-ID: 11816 | OA
M. H. Henzinger, K. Shahbaz, R. Paul, and C. Schulz, “Dynamic matching algorithms in practice,” in 8th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[164]
2020 | Conference Paper | IST-REx-ID: 11824 | OA
M. H. Henzinger, S. Neumann, and A. Wiese, “Dynamic approximate maximum independent set of intervals, hypercubes and hyperrectangles,” in 36th International Symposium on Computational Geometry, Zurich, Switzerland, 2020, vol. 164.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[163]
2020 | Conference Paper | IST-REx-ID: 11822 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Faster fully dynamic transitive closure in practice,” in 18th International Symposium on Experimental Algorithms, Pisa, Italy, 2020, vol. 160.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[162]
2020 | Conference Paper | IST-REx-ID: 11825 | OA
M. H. Henzinger and P. Peng, “Constant-time dynamic (Δ+1)-coloring,” in 37th International Symposium on Theoretical Aspects of Computer Science, Montpellier, France, 2020, vol. 154.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[161]
2020 | Conference Paper | IST-REx-ID: 11819 | OA
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Finding all global minimum cuts in practice,” in 28th Annual European Symposium on Algorithms, Pisa, Italy, 2020, vol. 173.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[160]
2020 | Conference Paper | IST-REx-ID: 11852 | OA
L. Chen, G. Goranci, M. H. Henzinger, R. Peng, and T. Saranurak, “Fast dynamic cuts, distances and effective resistances via vertex sparsifiers,” in 61st Annual Symposium on Foundations of Computer Science, Durham, NC, United States, 2020, pp. 1135–1146.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[159]
2020 | Conference Paper | IST-REx-ID: 11880 | OA
K. Hanauer, M. H. Henzinger, and C. Schulz, “Fully dynamic single-source reachability in practice: An experimental study,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 106–119.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[158]
2020 | Conference Paper | IST-REx-ID: 11881 | OA
M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory branch-and-reduce for multiterminal cuts,” in 2020 Symposium on Algorithm Engineering and Experiments, Salt Lake City, UT, United States, 2020, pp. 42–55.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[157]
2020 | Journal Article | IST-REx-ID: 11889
M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” SIAM Journal on Computing, vol. 49, no. 1. Society for Industrial & Applied Mathematics, pp. 1–36, 2020.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[156]
2020 | Journal Article | IST-REx-ID: 11894 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” SIAM Journal on Discrete Mathematics, vol. 34, no. 1. Society for Industrial & Applied Mathematics, pp. 130–162, 2020.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[155]
2019 | Conference Paper | IST-REx-ID: 11826 | OA
B. Ancona, M. H. Henzinger, L. Roditty, V. V. Williams, and N. Wein, “Algorithms and hardness for diameter in dynamic graphs,” in 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, 2019, vol. 132.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[154]
2019 | Conference Paper | IST-REx-ID: 11850 | OA
M. H. Henzinger, S. Neumann, and S. Schmid, “Efficient distributed workload (re-)embedding,” in SIGMETRICS’19: International Conference on Measurement and Modeling of Computer Systems, Phoenix, AZ, United States, 2019, pp. 43–44.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[153]
2019 | Book Chapter | IST-REx-ID: 11847
S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Vienna Graph Clustering,” in Protein-Protein Interaction Networks, vol. 2074, S. Canzar and F. Rojas Ringeling, Eds. Springer Nature, 2019, pp. 215–231.
View | DOI | PubMed | Europe PMC
 
[152]
2019 | Conference Paper | IST-REx-ID: 11853 | OA
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “A new deterministic algorithm for dynamic set cover,” in 60th Annual Symposium on Foundations of Computer Science, Baltimore, MD, United States, 2019, pp. 406–423.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[151]
2019 | Conference Paper | IST-REx-ID: 11851
M. H. Henzinger, A. Noe, and C. Schulz, “Shared-memory exact minimum cuts,” in 33rd International Parallel and Distributed Processing Symposium, Rio de Janeiro, Brazil, 2019.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[150]
2019 | Conference Paper | IST-REx-ID: 11865 | OA
M. Daga, M. H. Henzinger, D. Nanongkai, and T. Saranurak, “Distributed edge connectivity in sublinear time,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, Phoenix, AZ, United States, 2019, pp. 343–354.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[149]
2019 | Conference Paper | IST-REx-ID: 11871 | OA
A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” in 30th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2019, pp. 1899–1918.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[148]
2019 | Journal Article | IST-REx-ID: 11898 | OA
S. Bhattacharya, M. H. Henzinger, and S. Neumann, “New amortized cell-probe lower bounds for dynamic problems,” Theoretical Computer Science, vol. 779. Elsevier, pp. 72–87, 2019.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[147]
2019 | Conference Paper | IST-REx-ID: 6887 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Near-linear time algorithms for Streett objectives in graphs and MDPs,” in Leibniz International Proceedings in Informatics, Amsterdam, Netherlands, 2019, vol. 140.
[Published Version] View | Files available | DOI
 
[146]
2018 | Conference Paper | IST-REx-ID: 10883 | OA
K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253.
[Published Version] View | Files available | DOI | arXiv
 
[145]
2018 | Journal Article | IST-REx-ID: 11657 | OA
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” ACM Journal of Experimental Algorithmics, vol. 23. Association for Computing Machinery, pp. 1–22, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[144]
2018 | Journal Article | IST-REx-ID: 11667 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” ACM Transactions on Economics and Computation, vol. 6, no. 2. Association for Computing Machinery, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[143]
2018 | Journal Article | IST-REx-ID: 11664 | OA
G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in polylogarithmic amortized update time,” ACM Transactions on Algorithms, vol. 14, no. 2. Association for Computing Machinery, 2018.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[142]
2018 | Journal Article | IST-REx-ID: 11757 | OA
S. Bhattacharya, M. H. Henzinger, and G. Italiano, “Dynamic algorithms via the primal-dual method,” Information and Computation, vol. 261, no. 08. Elsevier, pp. 219–239, 2018.
[Published Version] View | DOI | Download Published Version (ext.)
 
[141]
2018 | Conference Paper | IST-REx-ID: 11828 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Dynamic effective resistances and approximate schur complement on separable graphs,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[140]
2018 | Conference Paper | IST-REx-ID: 11827 | OA
G. Goranci, M. H. Henzinger, and D. Leniowski, “A tree structure for dynamic facility location,” in 26th Annual European Symposium on Algorithms, Helsinki, Finland, 2018, vol. 112.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[139]
2018 | Journal Article | IST-REx-ID: 11768 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” Journal of the ACM, vol. 65, no. 6. Association for Computing Machinery, pp. 1–40, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[138]
2018 | Conference Paper | IST-REx-ID: 11872 | OA
S. Bhattacharya, D. Chakrabarty, M. H. Henzinger, and D. Nanongkai, “Dynamic algorithms for graph coloring,” in 29th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2018, pp. 1–20.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[137]
2018 | Conference Paper | IST-REx-ID: 11882 | OA
M. H. Henzinger, A. Noe, C. Schulz, and D. Strash, “Practical minimum cut algorithms,” in 20th Workshop on Algorithm Engineering and Experiments, New Orleans, LA, United States, 2018, pp. 48–61.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[136]
2018 | Journal Article | IST-REx-ID: 11890 | OA
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” SIAM Journal on Computing, vol. 47, no. 3. Society for Industrial & Applied Mathematics, pp. 859–887, 2018.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[135]
2018 | Conference Paper | IST-REx-ID: 11911 | OA
S. Biedermann, M. H. Henzinger, C. Schulz, and B. Schuster, “Memetic graph clustering,” in 17th International Symposium on Experimental Algorithms, L’Aquila, Italy, 2018, vol. 103.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[134]
2018 | Conference Paper | IST-REx-ID: 310 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
[133]
2018 | Conference Paper | IST-REx-ID: 141 | OA
K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.
[Published Version] View | Files available | DOI | WoS
 
[132]
2018 | Conference Paper | IST-REx-ID: 35 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and A. Svozil, “Algorithms and conditional lower bounds for planning problems,” in 28th International Conference on Automated Planning and Scheduling , Delft, Netherlands, 2018.
View | Files available | Download None (ext.) | WoS | arXiv
 
[131]
2017 | Conference Paper | IST-REx-ID: 11651 | OA
D. Wang, K. Fountoulakis, M. H. Henzinger, M. W. Mahoney, and Satish Rao , “Capacity releasing diffusion for speed and locality,” in Proceedings of the 34th International Conference on Machine Learning, Sydney, Australia, 2017, vol. 70, pp. 3598–3607.
[Published Version] View | Download Published Version (ext.) | arXiv
 
[130]
2017 | Journal Article | IST-REx-ID: 11665 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks,” ACM Transactions on Algorithms, vol. 13, no. 4. Association for Computing Machinery, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[129]
2017 | Journal Article | IST-REx-ID: 11676 | OA
W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” Algorithmica, vol. 77, no. 1. Springer Nature, pp. 152–172, 2017.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[128]
2017 | Conference Paper | IST-REx-ID: 11772
M. H. Henzinger, “The state of the art in dynamic graph algorithms,” in 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, 2017, vol. 10706, pp. 40–44.
View | DOI
 
[127]
2017 | Conference Paper | IST-REx-ID: 11829 | OA
M. H. Henzinger, A. Lincoln, S. Neumann, and V. Vassilevska Williams, “Conditional hardness for sensitivity problems,” in 8th Innovations in Theoretical Computer Science Conference, Berkley, CA, United States, 2017, vol. 67.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[126]
2017 | Conference Paper | IST-REx-ID: 11833 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “The power of vertex sparsifiers in dynamic graph algorithms,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[125]
2017 | Conference Paper | IST-REx-ID: 11832 | OA
M. H. Henzinger, D. Leniowski, and C. Mathieu, “Dynamic clustering to minimize the sum of radii,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[124]
2017 | Conference Paper | IST-REx-ID: 11874 | OA
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, vol. 0, pp. 470–489.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[123]
2017 | Conference Paper | IST-REx-ID: 11873 | OA
M. H. Henzinger, S. Rao, and D. Wang, “Local flow partitioning for faster edge connectivity,” in 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Barcelona, Spain, 2017, pp. 1919–1938.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[122]
2017 | Conference Paper | IST-REx-ID: 11831 | OA
G. Goranci, M. H. Henzinger, and P. Peng, “Improved guarantees for vertex sparsification in planar graphs,” in 25th Annual European Symposium on Algorithms, Vienna, Austria, 2017, vol. 87.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[121]
2017 | Journal Article | IST-REx-ID: 11903 | OA
S. Bhattacharya, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Welfare maximization with friends-of-friends network externalities,” Theory of Computing Systems, vol. 61, no. 4. Springer Nature, pp. 948–986, 2017.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[120]
2017 | Conference Paper | IST-REx-ID: 12571 | OA
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[119]
2017 | Journal Article | IST-REx-ID: 464 | OA
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for parity and Streett objectives,” Logical Methods in Computer Science, vol. 13, no. 3. International Federation of Computational Logic, 2017.
[Published Version] View | Files available | DOI | arXiv
 
[118]
2017 | Conference Paper | IST-REx-ID: 552 | OA
K. Chatterjee, M. H. Henzinger, and A. Svozil, “Faster algorithms for mean-payoff parity games,” in Leibniz International Proceedings in Informatics, Aalborg, Denmark, 2017, vol. 83.
[Published Version] View | Files available | DOI
 
[117]
2017 | Conference Paper | IST-REx-ID: 6519 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Improved set-based symbolic algorithms for parity games,” presented at the CSL: Conference on Computer Science Logic, Stockholm, Sweden, 2017, vol. 82.
[Published Version] View | Files available | DOI
 
[116]
2016 | Conference Paper | IST-REx-ID: 1068 | OA
K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Conditionally optimal algorithms for generalized Büchi Games,” presented at the MFCS: Mathematical Foundations of Computer Science (SG), Krakow, Poland, 2016, vol. 58.
[Published Version] View | Files available | DOI
 
[115]
2016 | Conference Paper | IST-REx-ID: 1140 | OA
K. Chatterjee, W. Dvoák, M. H. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[114]
2016 | Conference Paper | IST-REx-ID: 11836 | OA
Y. K. Cheung, G. Goranci, and M. H. Henzinger, “Graph minors for preserving terminal distances approximately - lower and upper bounds,” in 43rd International Colloquium on Automata, Languages, and Programming, Rome, Italy, 2016, vol. 55.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[113]
2016 | Conference Paper | IST-REx-ID: 11834 | OA
G. Goranci, M. H. Henzinger, and M. Thorup, “Incremental exact min-cut in poly-logarithmic amortized update time,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[112]
2016 | Conference Paper | IST-REx-ID: 11835 | OA
M. H. Henzinger and S. Neumann, “Incremental and fully dynamic subgraph connectivity for emergency planning,” in 24th Annual European Symposium on Algorithms, Aarhus, Denmark, 2016, vol. 57.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[111]
2016 | Conference Paper | IST-REx-ID: 11866 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” in 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, United States, 2016, pp. 489–498.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[110]
2016 | Conference Paper | IST-REx-ID: 11867 | OA
S. Bhattacharya, M. H. Henzinger, and D. Nanongkai, “New deterministic approximation algorithms for fully dynamic matching,” in 48th Annual ACM SIGACT Symposium on Theory of Computing, Cambridge, MA, United States, 2016, pp. 398–411.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[109]
2016 | Journal Article | IST-REx-ID: 11891 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” SIAM Journal on Computing, vol. 45, no. 3. Society for Industrial & Applied Mathematics, pp. 947–1006, 2016.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[108]
2015 | Journal Article | IST-REx-ID: 11668 | OA
R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[107]
2015 | Journal Article | IST-REx-ID: 11669 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions for heterogeneous items and budget limits,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[106]
2015 | Journal Article | IST-REx-ID: 11670
P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
View | DOI
 
[105]
2015 | Conference Paper | IST-REx-ID: 11774 | OA
Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial auctions with conflict-based externalities,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 230–243.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[104]
2015 | Conference Paper | IST-REx-ID: 11773 | OA
O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions with mediators,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[103]
2015 | Conference Paper | IST-REx-ID: 11785 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental single-source reachability on directed graphs,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 725–736.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[102]
2015 | Conference Paper | IST-REx-ID: 11787 | OA
M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex strongly connected components in quadratic time,” in 2nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 713–724.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[101]
2015 | Conference Paper | IST-REx-ID: 11788 | OA
W. Dvořák and M. H. Henzinger, “Online ad assignment with an ad exchange,” in 12th International Workshop of Approximation and Online Algorithms, Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[100]
2015 | Conference Paper | IST-REx-ID: 11786 | OA
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms via primal-dual method,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[99]
2015 | Journal Article | IST-REx-ID: 11845 | OA
O. Chernomor et al., “Split diversity in constrained conservation prioritization using integer linear programming,” Methods in Ecology and Evolution, vol. 6, no. 1. Wiley, pp. 83–91, 2015.
[Published Version] View | Files available | DOI | PubMed | Europe PMC
 
[98]
2015 | Conference Paper | IST-REx-ID: 11868 | OA
M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[97]
2015 | Conference Paper | IST-REx-ID: 11869 | OA
S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015, pp. 173–182.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[96]
2015 | Conference Paper | IST-REx-ID: 11837 | OA
S. Bhattacharya, W. Dvorák, M. H. Henzinger, and Martin Starnberger, “Welfare maximization with friends-of-friends network externalities,” in 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015, vol. 30, pp. 90–102.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[95]
2015 | Journal Article | IST-REx-ID: 11901 | OA
M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.
View | DOI | Download None (ext.)
 
[94]
2015 | Conference Paper | IST-REx-ID: 1661 | OA
K. Chatterjee, M. H. Henzinger, and V. Loitzenbauer, “Improved algorithms for one-pair and k-pair Streett objectives,” in Proceedings - Symposium on Logic in Computer Science, Kyoto, Japan, 2015, vol. 2015–July.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[93]
2014 | Conference Paper | IST-REx-ID: 11789 | OA
M. Charikar, M. H. Henzinger, and H. L. Nguyễn, “Online bipartite matching with decomposable weights,” in 22nd Annual European Symposium on Algorithms, Wroclaw, Poland, 2014, vol. 8737, pp. 260–271.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[92]
2014 | Conference Paper | IST-REx-ID: 11790
L. Cigler, W. Dvořák, M. H. Henzinger, and M. Starnberger, “Limiting price discrimination when selling products with positive network externalities,” in 10th International Conference of Web and Internet Economics, Beijing, China, 2014, vol. 8877, pp. 44–57.
View | DOI
 
[91]
2014 | Conference Paper | IST-REx-ID: 11855 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Decremental single-source shortest paths on undirected graphs in near-linear total update time,” in 55th Annual Symposium on Foundations of Computer Science, Philadelphia, PA, United States, 2014, pp. 146–155.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[90]
2014 | Conference Paper | IST-REx-ID: 11870 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs,” in 46th Annual ACM Symposium on Theory of Computing, New York, NY, United States, 2014.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[89]
2014 | Conference Paper | IST-REx-ID: 11876 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A subquadratic-time algorithm for decremental single-source shortest paths,” in 25th Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, OR, United States, 2014, pp. 1053–1072.
[Published Version] View | DOI | Download Published Version (ext.)
 
[88]
2014 | Conference Paper | IST-REx-ID: 11875 | OA
S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[87]
2014 | Journal Article | IST-REx-ID: 1375 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, V. Loitzenbauer, and M. Raskin, “Approximating the minimum cycle mean,” Theoretical Computer Science, vol. 547, no. C. Elsevier, pp. 104–116, 2014.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[86]
2014 | Journal Article | IST-REx-ID: 2141 | OA
K. Chatterjee and M. H. Henzinger, “Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition,” Journal of the ACM, vol. 61, no. 3. ACM, 2014.
[Submitted Version] View | Files available | DOI | Download Submitted Version (ext.)
 
[85]
2014 | Journal Article | IST-REx-ID: 535 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” Algorithmica, vol. 70, no. 3. Springer, pp. 457–492, 2014.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[84]
2013 | Journal Article | IST-REx-ID: 11671
E. Baykan, I. Weber, and M. H. Henzinger, “A comprehensive study of techniques for URL-based web page language classification,” ACM Transactions on the Web, vol. 7, no. 1. Association for Computing Machinery, 2013.
View | DOI
 
[83]
2013 | Journal Article | IST-REx-ID: 11759 | OA
P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” Information Processing Letters, vol. 113, no. 3. Elsevier, pp. 67–73, 2013.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[82]
2013 | Conference Paper | IST-REx-ID: 11793 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks,” in 40th International Colloquium on Automata, Languages, and Programming, Riga, Latvia, 2013, vol. 7966, pp. 607–619.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[81]
2013 | Conference Paper | IST-REx-ID: 11791 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Valuation compressions in VCG-based combinatorial auctions,” in 9th International Conference on Web and Internet Economics, Cambridge, MA, USA, 2013, vol. 8289, pp. 146–159.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[80]
2013 | Conference Paper | IST-REx-ID: 11792 | OA
W. Dvořák, M. H. Henzinger, and D. P. Williamson, “Maximizing a submodular function with viability constraints,” in 21st Annual European Symposium on Algorithms, Sophia Antipolis, France, 2013, vol. 8125, pp. 409–420.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[79]
2013 | Conference Paper | IST-REx-ID: 11856 | OA
M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization,” in 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, United States, 2013, pp. 538–547.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[78]
2013 | Journal Article | IST-REx-ID: 11902
P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” Theoretical Computer Science, vol. 478, no. 3. Elsevier, pp. 22–32, 2013.
View | Files available | DOI
 
[77]
2013 | Journal Article | IST-REx-ID: 11758
L. Aceto, M. H. Henzinger, and J. Sgall, “38th International Colloquium on Automata, Languages and Programming,” Information and Computation, vol. 222, no. 1. Elsevier, p. 1, 2013.
View | DOI
 
[76]
2013 | Journal Article | IST-REx-ID: 2831 | OA
K. Chatterjee, M. H. Henzinger, M. Joglekar, and N. Shah, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” Formal Methods in System Design, vol. 42, no. 3. Springer, pp. 301–327, 2013.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[75]
2012 | Conference Paper | IST-REx-ID: 11656
P. Dütting, M. H. Henzinger, and I. Weber, “Maximizing revenue from strategic recommendations under decaying trust,” in Proceedings of the 21st ACM international conference on Information and knowledge management, Maui, HI, United States, 2012, pp. 2268–2286.
View | DOI
 
[74]
2012 | Conference Paper | IST-REx-ID: 11794 | OA
P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions with heterogeneous items and budget limits,” in 8th International Workshop on Internet and Network Economics, Liverpool, United Kingdom, 2012, vol. 7695, pp. 44–57.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[73]
2012 | Conference Paper | IST-REx-ID: 11795
R. Colini-Baldeschi, M. H. Henzinger, S. Leonardi, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” in 39th International Colloquium on Automata, Languages, and Programming, Warwick, United Kingdom, 2012, vol. 7392, pp. 1–12.
View | Files available | DOI
 
[72]
2012 | Conference Paper | IST-REx-ID: 3165 | OA
K. Chatterjee and M. H. Henzinger, “An O(n2) time algorithm for alternating Büchi games,” in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, Kyoto, Japan, 2012, pp. 1386–1399.
View | Files available | DOI | Download None (ext.) | arXiv
 
[71]
2012 | Conference Paper | IST-REx-ID: 10905 | OA
K. Chatterjee, M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Polynomial-time algorithms for energy games with special weight structures,” in Algorithms – ESA 2012, Ljubljana, Slovenia, 2012, vol. 7501, pp. 301–312.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[70]
2011 | Journal Article | IST-REx-ID: 11673
E. Baykan, M. H. Henzinger, L. Marian, and I. Weber, “A comprehensive study of features and algorithms for URL-based topic classification,” ACM Transactions on the Web, vol. 5, no. 3. Association for Computing Machinery, 2011.
View | DOI
 
[69]
2011 | Journal Article | IST-REx-ID: 11760
P. Dütting, M. H. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” Information Processing Letters, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.
View | DOI
 
[68]
2011 | Conference Paper | IST-REx-ID: 11796
M. H. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget and matroid constraints,” in 19th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.
View | DOI
 
[67]
2011 | Conference Paper | IST-REx-ID: 11864
P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” in Proceedings of the 20th international conference on World wide web, Hyderabad, India, 2011, pp. 127–136.
View | DOI
 
[66]
2011 | Conference Paper | IST-REx-ID: 3342 | OA
K. Chatterjee, M. H. Henzinger, M. Joglekar, and S. Nisarg, “Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives,” presented at the CAV: Computer Aided Verification, Snowbird, USA, 2011, vol. 6806, pp. 260–276.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
[65]
2011 | Conference Paper | IST-REx-ID: 3343 | OA
K. Chatterjee and M. H. Henzinger, “Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification,” presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States, 2011, pp. 1318–1336.
[Submitted Version] View | DOI | Download Submitted Version (ext.)
 
[64]
2011 | Technical Report | IST-REx-ID: 5379 | OA
K. Chatterjee and M. H. Henzinger, An O(n2) time algorithm for alternating Büchi games. IST Austria, 2011.
[Published Version] View | Files available | DOI
 
[63]
2010 | Conference Paper | IST-REx-ID: 11797 | OA
J. Feldman, M. H. Henzinger, N. Korula, V. S. Mirrokni, and C. Stein, “Online stochastic packing applied to display ad allocation,” in 18th Annual European Symposium on Algorithms, Liverpool, United Kingdom, 2010, vol. 6346, pp. 182–194.
[Preprint] View | DOI | Download Preprint (ext.) | arXiv
 
[62]
2010 | Conference Paper | IST-REx-ID: 11798
P. Dütting and M. H. Henzinger, “Mechanisms for the marriage and the assignment game,” in 7th International Conference on Algorithms and Complexity, Rome, Italy, 2010, vol. 6078, pp. 6–12.
View | DOI
 
[61]
2010 | Conference Paper | IST-REx-ID: 11838 | OA
P. Dütting, M. H. Henzinger, and I. Weber, “Sponsored search, market equilibria, and the Hungarian Method,” in 27th International Symposium on Theoretical Aspects of Computer Science, Nancy, France, 2010, vol. 5, pp. 287–298.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 
[60]
2010 | Conference Paper | IST-REx-ID: 11863
P. Dütting, M. H. Henzinger, and I. Weber, “How much is your personal recommendation worth?,” in Proceedings of the 19th international conference on World wide web , Raleigh, NC, United States, 2010, pp. 1085–1086.
View | DOI
 
[59]
2010 | Journal Article | IST-REx-ID: 11885
M. H. Henzinger, J. Suñol, and I. Weber, “The stability of the h-index,” Scientometrics, vol. 84, no. 2. Springer Nature, pp. 465–479, 2010.
View | DOI
 
[58]
2009 | Conference Paper | IST-REx-ID: 11799
P. Dütting, M. H. Henzinger, and I. Weber, “Bidder optimal assignments for general utilities,” in 5th International Workshop on Internet and Network Economics, Rome, Italy, 2009, vol. 5929, pp. 575–582.
View | Files available | DOI
 
[57]
2009 | Conference Paper | IST-REx-ID: 11912 | OA
Eda Baykan, M. H. Henzinger, S. F. Keller, S. de Castelberg, and M. Kinzler, “A comparison of techniques for sampling web pages,” in 26th International Symposium on Theoretical Aspects of Computer Science, Freiburg, Germany, 2009, vol. 3, pp. 13–30.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 
[56]
2009 | Conference Paper | IST-REx-ID: 11905
E. Baykan, M. H. Henzinger, L. Marian, and I. Weber, “Purely URL-based topic classification,” in 18th International World Wide Web Conference, New York, NY, United States, 2009, pp. 1109–1110.
View | DOI
 
[55]
2009 | Conference Paper | IST-REx-ID: 11906
O. Abdel Hamid, B. Behzadi, S. Christoph, and M. H. Henzinger, “Detecting the origin of text segments efficiently,” in 18th International World Wide Web Conference, Madrid, Spain, 2009, pp. 61–70.
View | DOI
 
[54]
2008 | Journal Article | IST-REx-ID: 11878
E. Baykan, M. H. Henzinger, and I. Weber, “Web page language identification based on URLs,” Proceedings of the VLDB Endowment, vol. 1, no. 1. Association for Computing Machinery, pp. 176–187, 2008.
View | DOI
 
[53]
2007 | Journal Article | IST-REx-ID: 11884
M. H. Henzinger, “Search technologies for the internet,” Science, vol. 317, no. 5837. American Association for the Advancement of Science, pp. 468–471, 2007.
View | DOI | PubMed | Europe PMC
 
[52]
2007 | Conference Paper | IST-REx-ID: 11924
M. H. Henzinger, “Combinatorial algorithms for web search engines: three success stories,” in 18th Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2007, pp. 1022–1026.
View
 
[51]
2006 | Conference Paper | IST-REx-ID: 11929
M. H. Henzinger, “Finding near-duplicate web pages: A large-scale evaluation of algorithms,” in 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, Seattle, WA, United States, 2006, pp. 284–291.
View | DOI
 
[50]
2005 | Conference Paper | IST-REx-ID: 11698
M. H. Henzinger, “Hyperlink analysis on the world wide web,” in Proceedings of the 16th ACM conference on Hypertext and hypermedia, Salzburg, Austria, 2005, pp. 1–3.
View | DOI
 
[49]
2005 | Journal Article | IST-REx-ID: 11904
M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” World Wide Web, vol. 8, no. 2. Springer Nature, pp. 101–126, 2005.
View | Files available | DOI
 
[48]
2005 | Journal Article | IST-REx-ID: 11763 | OA
A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive algorithm for multicast routing and admission control,” Journal of Algorithms, vol. 55, no. 1. Elsevier, pp. 1–20, 2005.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[47]
2004 | Journal Article | IST-REx-ID: 11762 | OA
M. H. Henzinger, “Algorithmic challenges in web search engines,” Internet Mathematics, vol. 1, no. 1. Internet Mathematics, pp. 115–123, 2004.
[Published Version] View | DOI | Download Published Version (ext.)
 
[46]
2004 | Conference Paper | IST-REx-ID: 11801
M. H. Henzinger, “Algorithmic aspects of web search engines,” in 2th Annual European Symposium on Algorithms, Bergen, Norway, 2004, vol. 3221, p. 3.
View | DOI
 
[45]
2004 | Conference Paper | IST-REx-ID: 11800
M. H. Henzinger, “The past, present, and future of web search engines,” in 31st International Colloquium on Automata, Languages and Programming, Turku, Finland, 2004, vol. 3142, p. 3.
View | DOI
 
[44]
2004 | Conference Paper | IST-REx-ID: 11859
M. H. Henzinger, “The past, present, and future of web information retrieval,” in SPIE Proceedings, San Jose, CA, United States, 2004, vol. 5296, pp. 23–26.
View | DOI
 
[43]
2004 | Journal Article | IST-REx-ID: 11877 | OA
M. H. Henzinger and S. Lawrence, “Extracting knowledge from the World Wide Web,” Proceedings of the National Academy of Sciences, vol. 101, no. suppl_1. Proceedings of the National Academy of Sciences, pp. 5186–5191, 2004.
[Published Version] View | DOI | Download Published Version (ext.) | PubMed | Europe PMC
 
[42]
2003 | Journal Article | IST-REx-ID: 11766 | OA
M. H. Henzinger and S. Leonardi, “Scheduling multicasts on unit-capacity trees and meshes,” Journal of Computer and System Sciences, vol. 66, no. 3. Elsevier, pp. 567–611, 2003.
[Published Version] View | DOI | Download Published Version (ext.)
 
[41]
2003 | Journal Article | IST-REx-ID: 11764
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” Journal of Algorithms, vol. 48, no. 2. Elsevier, pp. 314–332, 2003.
View | DOI
 
[40]
2003 | Conference Paper | IST-REx-ID: 11897
K. Bharat and M. H. Henzinger, “Improved algorithms for topic distillation in a hyperlinked environment,” in 21st annual international ACM SIGIR conference on Research and development in information retrieval, Melbourne, Australia, 2003, pp. 104–111.
View | DOI
 
[39]
2003 | Conference Paper | IST-REx-ID: 11860
M. H. Henzinger, B.-W. Chang, B. Milch, and S. Brin, “Query-free news search,” in Proceedings of the 12th international conference on World Wide Web, Budapest, Hungary, 2003.
View | Files available | DOI
 
[38]
2003 | Conference Paper | IST-REx-ID: 11909 | OA
M. H. Henzinger, R. Motwani, and C. Silverstein, “Challenges in web search engines,” in 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 2003, pp. 1573–1579.
[Published Version] View | Download Published Version (ext.)
 
[37]
2001 | Journal Article | IST-REx-ID: 11892
M. H. Henzinger and V. King, “Maintaining minimum spanning forests in dynamic graphs,” SIAM Journal on Computing, vol. 31, no. 2. Society for Industrial & Applied Mathematics, pp. 364–374, 2001.
View | DOI
 
[36]
2001 | Conference Paper | IST-REx-ID: 11914
K. Bharat, B.-W. Chang, M. H. Henzinger, and M. Ruhl, “Who links to whom: Mining linkage between Web sites,” in 1st IEEE International Conference on Data Mining, San Jose, CA, United States, 2001, pp. 51–58.
View | DOI
 
[35]
2001 | Journal Article | IST-REx-ID: 11755
M. H. Henzinger, “Hyperlink analysis for the Web,” IEEE Internet Computing, vol. 5, no. 1. Institute of Electrical and Electronics Engineers, pp. 45–50, 2001.
View | DOI | WoS
 
[34]
2000 | Journal Article | IST-REx-ID: 11683
M. H. Henzinger, S. Rao, and H. N. Gabow, “Computing vertex connectivity: New bounds from old techniques,” Journal of Algorithms, vol. 34, no. 2. Elsevier, pp. 222–250, 2000.
View | DOI
 
[33]
2000 | Journal Article | IST-REx-ID: 11685
M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “On near-uniform URL sampling,” Computer Networks, vol. 33, no. 1–6. Elsevier, pp. 295–308, 2000.
View | DOI
 
[32]
2000 | Journal Article | IST-REx-ID: 11694
S. Albers and M. H. Henzinger, “Exploring unknown environments,” SIAM Journal on Computing, vol. 29, no. 4. Society for Industrial and Applied Mathematics, pp. 1164–1188, 2000.
View | DOI
 
[31]
2000 | Journal Article | IST-REx-ID: 11770 | OA
K. Bharat, A. Broder, J. Dean, and M. H. Henzinger, “A comparison of techniques to find mirrored hosts on the WWW,” Journal of the American Society for Information Science, vol. 51, no. 12. Wiley, pp. 1114–1122, 2000.
[Published Version] View | DOI | Download Published Version (ext.)
 
[30]
2000 | Conference Paper | IST-REx-ID: 11802
M. H. Henzinger, “Web information retrieval - an algorithmic perspective,” in 8th Annual European Symposium on Algorithms, Saarbrücken, Germany, 2000, vol. 1879, pp. 1–8.
View | DOI
 
[29]
2000 | Journal Article | IST-REx-ID: 11893
M. H. Henzinger, “Improved data structures for fully dynamic biconnectivity,” SIAM Journal on Computing, vol. 29, no. 6. Society for Industrial & Applied Mathematics, pp. 1761–1815, 2000.
View | DOI
 
[28]
1999 | Conference Paper | IST-REx-ID: 11691
A. Goel, M. H. Henzinger, S. Plotkin, and E. Tardos, “Scheduling data transfers in a network and the set scheduling problem,” in Proceedings of the 31st annual ACM symposium on Theory of computing, Atlanta, GA, United States, 1999, pp. 189–197.
View | DOI
 
[27]
1999 | Journal Article | IST-REx-ID: 11687
J. Dean and M. H. Henzinger, “Finding related pages in the world wide Web,” Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1467–1479, 1999.
View | DOI
 
[26]
1999 | Journal Article | IST-REx-ID: 11688
M. H. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork, “Measuring index quality using random walks on the web,” Computer Networks, vol. 31, no. 11–16. Elsevier, pp. 1291–1303, 1999.
View | DOI
 
[25]
1999 | Journal Article | IST-REx-ID: 11769
M. H. Henzinger and V. King, “Randomized fully dynamic graph algorithms with polylogarithmic time per operation,” Journal of the ACM, vol. 46, no. 4. Association for Computing Machinery, pp. 502–516, 1999.
View | DOI
 
[24]
1999 | Journal Article | IST-REx-ID: 11895 | OA
C. Silverstein, H. Marais, M. H. Henzinger, and M. Moricz, “Analysis of a very large web search engine query log,” ACM SIGIR Forum, vol. 33, no. 1. Association for Computing Machinery, pp. 6–12, 1999.
[Published Version] View | DOI | Download Published Version (ext.)
 
[23]
1999 | Journal Article | IST-REx-ID: 11679
M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” Algorithmica, vol. 24. Springer Nature, pp. 1–13, 1999.
View | Files available | DOI
 
[22]
1999 | Conference Paper | IST-REx-ID: 11925
M. H. Henzinger and S. Leonardi  , “Scheduling multicasts on unit-capacity trees and meshes,” in 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, MD, United States, 1999, pp. 438–447.
View
 
[21]
1998 | Conference Paper | IST-REx-ID: 11682
P. K. Agarwal, D. EppsteinL. J. Guibas, and M. H. Henzinger, “Parametric and kinetic minimum spanning trees,” in Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, United States, 1998, pp. 596–605.
View | DOI
 
[20]
1998 | Journal Article | IST-REx-ID: 11681
M. H. Henzinger and M. L. Fredman, “Lower bounds for fully dynamic connectivity problems in graphs,” Algorithmica, vol. 22, no. 3. Springer Nature, pp. 351–362, 1998.
View | DOI
 
[19]
1998 | Conference Paper | IST-REx-ID: 11926
A. Goel, M. H. Henzinger, and S. Plotkin, “An online throughput-competitive algorithm for multicast routing and admission control,” in 9th Annual ACM SIAM Symposium on Discrete Algorithms, San Francisco, CA, United States, 1998, pp. 97–106.
View | Files available
 
[18]
1998 | Journal Article | IST-REx-ID: 11680
D. Alberts and M. H. Henzinger, “Average-case analysis of dynamic graph algorithms,” Algorithmica, vol. 20. Springer Nature, pp. 31–60, 1998.
View | Files available | DOI
 
[17]
1997 | Journal Article | IST-REx-ID: 11666
J. M. Anderson et al., “Continuous profiling: Where have all the cycles gone?,” ACM Transactions on Computer Systems, vol. 15, no. 4. Association for Computing Machinery, pp. 357–390, 1997.
View | DOI
 
[16]
1997 | Journal Article | IST-REx-ID: 11767 | OA
M. H. Henzinger, P. Klein, S. Rao, and S. Subramanian, “Faster shortest-path algorithms for planar graphs,” Journal of Computer and System Sciences, vol. 55, no. 1. Elsevier, pp. 3–23, 1997.
[Published Version] View | DOI | Download Published Version (ext.)
 
[15]
1997 | Journal Article | IST-REx-ID: 11765
M. H. Henzinger, “A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity,” Journal of Algorithms, vol. 24, no. 1. Elsevier, pp. 194–220, 1997.
View | DOI
 
[14]
1997 | Conference Paper | IST-REx-ID: 11803
M. H. Henzinger and V. King, “Maintaining minimum spanning trees in dynamic graphs,” in 24th International Colloquium on Automata, Languages and Programming, Bologna, Italy, 1997, vol. 1256, pp. 594–604.
View | DOI
 
[13]
1997 | Journal Article | IST-REx-ID: 11849 | OA
J. M. Anderson et al., “Continuous profiling: Where have all the cycles gone?,” ACM SIGOPS Operating Systems Review, vol. 31, no. 5. Association for Computing Machinery, pp. 1–14, 1997.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 
[12]
1997 | Journal Article | IST-REx-ID: 11883
M. H. Henzinger and M. Thorup, “Sampling to provide or to bound: With applications to fully dynamic graph algorithms,” Random Structures and Algorithms, vol. 11, no. 4. Wiley, pp. 369–379, 1997.
View | DOI
 
[11]
1996 | Journal Article | IST-REx-ID: 11761
M. H. Henzinger and D. P. Williamson, “On the number of small cuts in a graph,” Information Processing Letters, vol. 59, no. 1. Elsevier, pp. 41–44, 1996.
View | DOI
 
[10]
1996 | Conference Paper | IST-REx-ID: 11804
M. H. Henzinger and J. A. Telle, “Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning,” in 5th Scandinavian Workshop on Algorithm Theory, Reykjavik, Iceland, 1996, vol. 1097, pp. 16–27.
View | DOI
 
[9]
1996 | Conference Paper | IST-REx-ID: 11910
M. H. Henzinger and M. Thorup, “Improved sampling with applications to dynamic graph algorithms,” in 23rd International Colloquium on Automata, Languages, and Programming, Paderborn, Germany, 1996, vol. 1099, pp. 290–299.
View | DOI
 
[8]
1996 | Conference Paper | IST-REx-ID: 11927 | OA
M. H. Henzinger, V. King, and T. Warnow, “Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology,” in 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, GA, United States, 1996, pp. 333–340.
[Published Version] View | Files available | Download Published Version (ext.)
 
[7]
1995 | Journal Article | IST-REx-ID: 11677
M. H. Henzinger, “Fully dynamic biconnectivity in graphs,” Algorithmica, vol. 13, no. 6. Springer Nature, pp. 503–538, 1995.
View | DOI
 
[6]
1995 | Conference Paper | IST-REx-ID: 11684
M. H. Henzinger and V. King, “Fully dynamic biconnectivity and transitive closure,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States, 1995, pp. 664–672.
View | DOI
 
[5]
1995 | Conference Paper | IST-REx-ID: 11806
M. H. Henzinger, “Approximating minimum cuts under insertions,” in 22nd International Colloquium on Automata, Languages and Programming, Szeged, Hungary, 1995, vol. 944, pp. 280–291.
View | DOI
 
[4]
1995 | Conference Paper | IST-REx-ID: 11805
M. H. Henzinger and H. Poutré, “Certificates and fast algorithms for biconnectivity in fully-dynamic graphs,” in 3rd Annual European Symposium on Algorithms, Corfu, Greece, 1995, vol. 979, pp. 171–184.
View | DOI
 
[3]
1995 | Conference Paper | IST-REx-ID: 11928 | OA
D. Alberts and M. H. Henzinger, “Average case analysis of dynamic graph algorithms,” in 6th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, United States, 1995, pp. 312–321.
[Published Version] View | Files available | Download Published Version (ext.)
 
[2]
1995 | Conference Paper | IST-REx-ID: 4498
M. H. Henzinger, T. A. Henzinger, and P. Kopke, “Computing simulations on finite and infinite graphs,” in Proceedings of IEEE 36th Annual Foundations of Computer Science, Milwaukee, WI, United States of America, 1995, pp. 453–462.
View | DOI
 
[1]
1994 | Conference Paper | IST-REx-ID: 11857
M. H. Henzinger, “Fully dynamic cycle-equivalence in graphs,” in 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, United States, 1994, pp. 744–755.
View | DOI
 
Marked Publication(s)

Search

Filter Publications