Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.”10.1007/978-3-642-45046-4_13__9th International Conference on Web and Internet Economics, vol. 8289, Springer Nature, 2013, pp. 146–159, doi:10.1007/978-3-642-45046-4_13.

Dvoák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.”10.1007/978-3-642-40450-4_35__21st Annual European Symposium on Algorithms, vol. 8125, Springer Nature, 2013, pp. 409–20, doi:10.1007/978-3-642-40450-4_35.

Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”10.1007/978-3-642-39799-8_11__Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.

Chatterjee, Krishnendu, et al. “How to Travel between Languages.”10.1007/978-3-642-37064-9_20__7th International Conference on Language and Automata Theory and Applications, vol. 7810, Springer Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.

Edelsbrunner, Herbert. “Persistent Homology in Image Processing.”10.1007/978-3-642-38221-5_19__Graph-Based Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:10.1007/978-3-642-38221-5_19.

Dütting, Paul, et al. “Auctions with Heterogeneous Items and Budget Limits.”10.1007/978-3-642-35311-6_4__8th International Workshop on Internet and Network Economics, vol. 7695, Springer Nature, 2012, pp. 44–57, doi:10.1007/978-3-642-35311-6_4.

Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.”10.1007/978-3-642-32940-1_10__CONCUR 2012 - Concurrency Theory, edited by Maciej Koutny and Irek Ulidowski, vol. 7454, Springer, 2012, pp. 115–31, doi:10.1007/978-3-642-32940-1_10.

Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.”10.1007/978-3-642-33386-6_14__Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.

Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.”10.1007/978-3-642-33090-2_27__Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.

Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.”10.1007/978-3-642-28756-5_46__Tools and Algorithms for the Construction and Analysis of Systems, edited by Cormac Flanagan and Barbara König, vol. 7214, Springer, 2012, pp. 549–51, doi:10.1007/978-3-642-28756-5_46.

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

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

Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.”10.1007/978-3-642-20844-7_22__Graph-Based Representations in Pattern Recognition, edited by Xiaoyi Jiang et al., vol. 6658, Springer, 2011, pp. 215–24, doi:10.1007/978-3-642-20844-7_22.

Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.”10.1007/978-3-642-17511-4_7__Logic for Programming, Artificial Intelligence, and Reasoning, edited by Edmund M Clarke and Andrei Voronkov, vol. 6355, Springer Nature, 2010, pp. 103–18, doi:10.1007/978-3-642-17511-4_7.

Feldman, Jon, et al. “Online Stochastic Packing Applied to Display Ad Allocation.”10.1007/978-3-642-15775-2_16__18th Annual European Symposium on Algorithms, vol. 6346, Springer Nature, 2010, pp. 182–194, doi:10.1007/978-3-642-15775-2_16.

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

Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.”10.1007/978-3-642-13675-7_1__Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010, pp. 1–17, doi:10.1007/978-3-642-13675-7_1.

Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.”10.1007/978-3-642-10841-9_58__5th International Workshop on Internet and Network Economics, vol. 5929, Springer Nature, 2009, pp. 575–82, doi:10.1007/978-3-642-10841-9_58.

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

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

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

Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.”10.1007/3-540-63165-8_214__24th International Colloquium on Automata, Languages and Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, doi: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.”10.1007/3-540-61422-2_117__5th Scandinavian Workshop on Algorithm Theory, vol. 1097, Springer Nature, 1996, pp. 16–27, doi:10.1007/3-540-61422-2_117.

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

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

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