Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.”https://doi.org/10.1007/978-3-642-54013-4_15__In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014.https://doi.org/10.1007/978-3-642-54013-4_15 .
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.”https://doi.org/10.1007/978-3-319-13075-0_10__In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014.https://doi.org/10.1007/978-3-319-13075-0_10 .
LibreCat: https://research-explorer.ista.ac.at/record/10892
DOI: 10.1007/978-3-319-13075-0_10

Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.”https://doi.org/10.1007/978-3-642-54013-4_5__In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014.https://doi.org/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, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.”https://doi.org/10.1007/978-3-662-44199-2_24__In ICMS 2014: International Congress on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014.https://doi.org/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

Dragoi, Cezara, Ashutosh Gupta, and Thomas A Henzinger. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.”https://doi.org/10.1007/978-3-642-39799-8_11__In Computer Aided Verification, 8044:174–90. CAV. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.https://doi.org/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, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel between Languages.”https://doi.org/10.1007/978-3-642-37064-9_20__In 7th International Conference on Language and Automata Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature, 2013.https://doi.org/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, Herbert. “Persistent Homology in Image Processing.”https://doi.org/10.1007/978-3-642-38221-5_19__In Graph-Based Representations in Pattern Recognition, 7877:182–83. LNCS. Berlin, Heidelberg: Springer Nature, 2013.https://doi.org/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

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 .
LibreCat: https://research-explorer.ista.ac.at/record/10903
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/10905
DOI: 10.1007/978-3-642-33090-2_27
arXiv: 1604.08234

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 .
LibreCat: https://research-explorer.ista.ac.at/record/10906
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/5745
DOI: 10.1007/978-3-642-33386-6_10

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 .
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

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 .
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11800
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11803
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.”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 .
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11910
DOI: 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 .
LibreCat: https://research-explorer.ista.ac.at/record/11806
DOI: 10.1007/3-540-60084-1_81