Bouajjani, Ahmed, Cezara Dragoi, Constantin Enea, and Mihaela Sighireanu. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”https://doi.org/10.1007/978-3-642-33386-6_14__In Automated Technology for Verification and Analysis, 7561:167–82. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-33386-6_14 .

Chatterjee, Krishnendu, Monika H Henzinger, Sebastian Krinninger, and Danupon Nanongkai. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”https://doi.org/10.1007/978-3-642-33090-2_27__In Algorithms – ESA 2012, 7501:301–12. Springer, 2012.https://doi.org/10.1007/978-3-642-33090-2_27 .

Grebenshchikov, Sergey, Ashutosh Gupta, Nuno P. Lopes, Corneliu Popeea, and Andrey Rybalchenko. “HSF(C): A Software Verifier Based on Horn Clauses.”https://doi.org/10.1007/978-3-642-28756-5_46__In Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, 7214:549–51. LNCS. Berlin, Heidelberg: Springer, 2012.https://doi.org/10.1007/978-3-642-28756-5_46 .

Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.”https://doi.org/10.1007/978-3-642-33386-6_10__In Automated Technology for Verification and Analysis, 7561:107–21. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012.https://doi.org/10.1007/978-3-642-33386-6_10 .

Henzinger, Monika H, and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.”https://doi.org/10.1007/978-3-642-23719-5_17__In 19th Annual European Symposium on Algorithms, 6942:192–202. Springer Nature, 2011.https://doi.org/10.1007/978-3-642-23719-5_17 .

Artner, Nicole M., Adrian Ion, and Walter G. Kropatsch. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.”https://doi.org/10.1007/978-3-642-20844-7_22__In Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang, Miquel Ferrer, and Andrea Torsello, 6658:215–24. LNIP. Berlin, Heidelberg: Springer, 2011.https://doi.org/10.1007/978-3-642-20844-7_22 .

Blanc, Régis, Thomas A Henzinger, Thibaud Hottelier, and Laura Kovács. “ABC: Algebraic Bound Computation for Loops.”https://doi.org/10.1007/978-3-642-17511-4_7__In Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, 6355:103–18. LNCS. Berlin, Heidelberg: Springer Nature, 2010.https://doi.org/10.1007/978-3-642-17511-4_7 .

Feldman, Jon, Monika H Henzinger, Nitish Korula, Vahab S. Mirrokni, and Cliff Stein. “Online Stochastic Packing Applied to Display Ad Allocation.”https://doi.org/10.1007/978-3-642-15775-2_16__In 18th Annual European Symposium on Algorithms, 6346:182–194. Springer Nature, 2010.https://doi.org/10.1007/978-3-642-15775-2_16 .

Dütting, Paul, and Monika H Henzinger. “Mechanisms for the Marriage and the Assignment Game.”https://doi.org/10.1007/978-3-642-13073-1_2__In 7th International Conference on Algorithms and Complexity, 6078:6–12. Springer Nature, 2010.https://doi.org/10.1007/978-3-642-13073-1_2 .

Juhás, Gabriel, Igor Kazlov, and Ana Juhásová. “Instance Deadlock: A Mystery behind Frozen Programs.”https://doi.org/10.1007/978-3-642-13675-7_1__In Applications and Theory of Petri Nets, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010.https://doi.org/10.1007/978-3-642-13675-7_1 .

Dütting, Paul, Monika H Henzinger, and Ingmar Weber. “Bidder Optimal Assignments for General Utilities.”https://doi.org/10.1007/978-3-642-10841-9_58__In 5th International Workshop on Internet and Network Economics, 5929:575–82. Springer Nature, 2009.https://doi.org/10.1007/978-3-642-10841-9_58 .

Henzinger, Monika H. “Algorithmic Aspects of Web Search Engines.”https://doi.org/10.1007/978-3-540-30140-0_2__In 2th Annual European Symposium on Algorithms, 3221:3. Springer Nature, 2004.https://doi.org/10.1007/978-3-540-30140-0_2 .

Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.”https://doi.org/10.1007/978-3-540-27836-8_2__In 31st International Colloquium on Automata, Languages and Programming, 3142:3. Springer Nature, 2004.https://doi.org/10.1007/978-3-540-27836-8_2 .

Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.”https://doi.org/10.1007/3-540-45253-2_1__In 8th Annual European Symposium on Algorithms, 1879:1–8. Springer Nature, 2000.https://doi.org/10.1007/3-540-45253-2_1 .

Henzinger, Monika H, and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”https://doi.org/10.1007/3-540-63165-8_214__In 24th International Colloquium on Automata, Languages and Programming, 1256:594–604. Springer Nature, 1997.https://doi.org/10.1007/3-540-63165-8_214 .

Henzinger, Monika H, and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.”https://doi.org/10.1007/3-540-61422-2_117__In 5th Scandinavian Workshop on Algorithm Theory, 1097:16–27. Springer Nature, 1996.https://doi.org/10.1007/3-540-61422-2_117 .

Henzinger, Monika H, and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.”https://doi.org/10.1007/3-540-61440-0_136__In 23rd International Colloquium on Automata, Languages, and Programming, 1099:290–99. Springer Nature, 1996.https://doi.org/10.1007/3-540-61440-0_136 .

Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.”https://doi.org/10.1007/3-540-60084-1_81__In 22nd International Colloquium on Automata, Languages and Programming, 944:280–291. Springer Nature, 1995.https://doi.org/10.1007/3-540-60084-1_81 .

Henzinger, Monika H, and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.”https://doi.org/10.1007/3-540-60313-1_142__In 3rd Annual European Symposium on Algorithms, 979:171–184. Springer Nature, 1995.https://doi.org/10.1007/3-540-60313-1_142 .