Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5
LibreCat: https://research-explorer.ista.ac.at/record/10885
DOI: 10.1007/978-3-642-54013-4_5
arXiv: 1311.3238

Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: ICMS 2014: International Congress on Mathematical Software. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:10.1007/978-3-662-44199-2_24
LibreCat: https://research-explorer.ista.ac.at/record/10894
DOI: 10.1007/978-3-662-44199-2_24

Henzinger MH, Krinninger S, Nanongkai D. Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks. In: 40th International Colloquium on Automata, Languages, and Programming. Vol 7966. Springer Nature; 2013:607–619. doi:10.1007/978-3-642-39212-2_53
LibreCat: https://research-explorer.ista.ac.at/record/11793
DOI: 10.1007/978-3-642-39212-2_53
arXiv: 1512.08147

Dütting P, Henzinger MH, Starnberger M. Valuation compressions in VCG-based combinatorial auctions. In: 9th International Conference on Web and Internet Economics. Vol 8289. Springer Nature; 2013:146–159. doi:10.1007/978-3-642-45046-4_13
LibreCat: https://research-explorer.ista.ac.at/record/11791
DOI: 10.1007/978-3-642-45046-4_13
arXiv: 1310.3153

Dvoák W, Henzinger MH, Williamson DP. Maximizing a submodular function with viability constraints. In: 21st Annual European Symposium on Algorithms. Vol 8125. Springer Nature; 2013:409-420. doi:10.1007/978-3-642-40450-4_35
LibreCat: https://research-explorer.ista.ac.at/record/11792
DOI: 10.1007/978-3-642-40450-4_35
arXiv: 1611.05753

Dragoi C, Gupta A, Henzinger TA. Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates. In: Computer Aided Verification. Vol 8044. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013:174-190. doi:10.1007/978-3-642-39799-8_11
LibreCat: https://research-explorer.ista.ac.at/record/5747
DOI: 10.1007/978-3-642-39799-8_11

Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th International Conference on Language and Automata Theory and Applications. Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20
LibreCat: https://research-explorer.ista.ac.at/record/10902
DOI: 10.1007/978-3-642-37064-9_20

Edelsbrunner H. Persistent homology in image processing. In: Graph-Based Representations in Pattern Recognition. Vol 7877. LNCS. Berlin, Heidelberg: Springer Nature; 2013:182-183. doi:10.1007/978-3-642-38221-5_19
LibreCat: https://research-explorer.ista.ac.at/record/10897
DOI: 10.1007/978-3-642-38221-5_19

Dütting P, Henzinger MH, Starnberger M. Auctions with heterogeneous items and budget limits. In: 8th International Workshop on Internet and Network Economics. Vol 7695. Springer Nature; 2012:44–57. doi:10.1007/978-3-642-35311-6_4
LibreCat: https://research-explorer.ista.ac.at/record/11794
DOI: 10.1007/978-3-642-35311-6_4
arXiv: 1209.6448

Chatterjee K, Randour M, Raskin J-F. Strategy synthesis for multi-dimensional quantitative objectives. In: Koutny M, Ulidowski I, eds. CONCUR 2012 - Concurrency Theory. Vol 7454. Berlin, Heidelberg: Springer; 2012:115-131. doi:10.1007/978-3-642-32940-1_10
LibreCat: https://research-explorer.ista.ac.at/record/10904
DOI: 10.1007/978-3-642-32940-1_10
arXiv: 1201.5073

Bouajjani A, Dragoi C, Enea C, Sighireanu M. Accurate invariant checking for programs manipulating lists and arrays with infinite data. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer; 2012:167-182. doi:10.1007/978-3-642-33386-6_14
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 10.1007/978-3-642-33386-6_14

Chatterjee K, Henzinger MH, Krinninger S, Nanongkai D. Polynomial-time algorithms for energy games with special weight structures. In: Algorithms – ESA 2012. Vol 7501. Springer; 2012:301-312. doi:10.1007/978-3-642-33090-2_27
LibreCat: https://research-explorer.ista.ac.at/record/10905
DOI: 10.1007/978-3-642-33090-2_27
arXiv: 1604.08234

Grebenshchikov S, Gupta A, Lopes NP, Popeea C, Rybalchenko A. HSF(C): A software verifier based on Horn clauses. In: Flanagan C, König B, eds. Tools and Algorithms for the Construction and Analysis of Systems. Vol 7214. LNCS. Berlin, Heidelberg: Springer; 2012:549-551. doi:10.1007/978-3-642-28756-5_46
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 10.1007/978-3-642-28756-5_46

Gupta A. Improved Single Pass Algorithms for Resolution Proof Reduction. In: Automated Technology for Verification and Analysis. Vol 7561. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2012:107-121. doi:10.1007/978-3-642-33386-6_10
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 10.1007/978-3-642-33386-6_10

Henzinger MH, Vidali A. Multi-parameter mechanism design under budget and matroid constraints. In: 19th Annual European Symposium on Algorithms. Vol 6942. Springer Nature; 2011:192–202. doi:10.1007/978-3-642-23719-5_17
LibreCat: https://research-explorer.ista.ac.at/record/11796
DOI: 10.1007/978-3-642-23719-5_17

Artner NM, Ion A, Kropatsch WG. Spatio-temporal extraction of articulated models in a graph pyramid. In: Jiang X, Ferrer M, Torsello A, eds. Graph-Based Representations in Pattern Recognition. Vol 6658. LNIP. Berlin, Heidelberg: Springer; 2011:215-224. doi:10.1007/978-3-642-20844-7_22
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 10.1007/978-3-642-20844-7_22

Blanc R, Henzinger TA, Hottelier T, Kovács L. ABC: Algebraic Bound Computation for loops. In: Clarke EM, Voronkov A, eds. Logic for Programming, Artificial Intelligence, and Reasoning. Vol 6355. LNCS. Berlin, Heidelberg: Springer Nature; 2010:103-118. doi:10.1007/978-3-642-17511-4_7
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

Feldman J, Henzinger MH, Korula N, Mirrokni VS, Stein C. Online stochastic packing applied to display ad allocation. In: 18th Annual European Symposium on Algorithms. Vol 6346. Springer Nature; 2010:182–194. doi:10.1007/978-3-642-15775-2_16
LibreCat: https://research-explorer.ista.ac.at/record/11797
DOI: 10.1007/978-3-642-15775-2_16
arXiv: 1001.5076

Dütting P, Henzinger MH. Mechanisms for the marriage and the assignment game. In: 7th International Conference on Algorithms and Complexity. Vol 6078. Springer Nature; 2010:6–12. doi:10.1007/978-3-642-13073-1_2
LibreCat: https://research-explorer.ista.ac.at/record/11798
DOI: 10.1007/978-3-642-13073-1_2

Juhás G, Kazlov I, Juhásová A. Instance Deadlock: A Mystery behind Frozen Programs. In: Applications and Theory of Petri Nets. Berlin, Heidelberg: Springer Berlin Heidelberg; 2010:1-17. doi:10.1007/978-3-642-13675-7_1
LibreCat: https://research-explorer.ista.ac.at/record/5940
DOI: 10.1007/978-3-642-13675-7_1

Dütting P, Henzinger MH, Weber I. Bidder optimal assignments for general utilities. In: 5th International Workshop on Internet and Network Economics. Vol 5929. Springer Nature; 2009:575-582. doi:10.1007/978-3-642-10841-9_58
LibreCat: https://research-explorer.ista.ac.at/record/11799
DOI: 10.1007/978-3-642-10841-9_58

Henzinger MH. Algorithmic aspects of web search engines. In: 2th Annual European Symposium on Algorithms. Vol 3221. Springer Nature; 2004:3. doi:10.1007/978-3-540-30140-0_2
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 10.1007/978-3-540-30140-0_2

Henzinger MH. The past, present, and future of web search engines. In: 31st International Colloquium on Automata, Languages and Programming. Vol 3142. Springer Nature; 2004:3. doi:10.1007/978-3-540-27836-8_2
LibreCat: https://research-explorer.ista.ac.at/record/11800
DOI: 10.1007/978-3-540-27836-8_2

Henzinger MH. Web information retrieval - an algorithmic perspective. In: 8th Annual European Symposium on Algorithms. Vol 1879. Springer Nature; 2000:1–8. doi:10.1007/3-540-45253-2_1
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 10.1007/3-540-45253-2_1

Henzinger MH, King V. Maintaining minimum spanning trees in dynamic graphs. In: 24th International Colloquium on Automata, Languages and Programming. Vol 1256. Springer Nature; 1997:594–604. doi:10.1007/3-540-63165-8_214
LibreCat: https://research-explorer.ista.ac.at/record/11803
DOI: 10.1007/3-540-63165-8_214

Henzinger MH, Telle JA. Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning. In: 5th Scandinavian Workshop on Algorithm Theory. Vol 1097. Springer Nature; 1996:16–27. doi:10.1007/3-540-61422-2_117
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

Henzinger MH, Thorup M. Improved sampling with applications to dynamic graph algorithms. In: 23rd International Colloquium on Automata, Languages, and Programming. Vol 1099. Springer Nature; 1996:290-299. doi:10.1007/3-540-61440-0_136
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 10.1007/3-540-61440-0_136

Henzinger MH. Approximating minimum cuts under insertions. In: 22nd International Colloquium on Automata, Languages and Programming. Vol 944. Springer Nature; 1995:280–291. doi:10.1007/3-540-60084-1_81
LibreCat: https://research-explorer.ista.ac.at/record/11806
DOI: 10.1007/3-540-60084-1_81

Henzinger MH, Poutré H. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In: 3rd Annual European Symposium on Algorithms. Vol 979. Springer Nature; 1995:171–184. doi:10.1007/3-540-60313-1_142
LibreCat: https://research-explorer.ista.ac.at/record/11805
DOI: 10.1007/3-540-60313-1_142