Parameterized model checking of token-passing systems
B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
LibreCat: https://research-explorer.ista.ac.at/record/10884
DOI: 10.1007/978-3-642-54013-4_15
arXiv: 1311.4425

Planar matchings for weighted straight skeletons
T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.
LibreCat: https://research-explorer.ista.ac.at/record/10892
DOI: 10.1007/978-3-319-13075-0_10

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

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

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

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

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

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

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

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

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

Spatio-temporal extraction of articulated models in a graph pyramid
N.M. Artner, A. Ion, W.G. Kropatsch, in:, X. Jiang, M. Ferrer, A. Torsello (Eds.), Graph-Based Representations in Pattern Recognition, Springer, Berlin, Heidelberg, 2011, pp. 215–224.
LibreCat: https://research-explorer.ista.ac.at/record/10907
DOI: 10.1007/978-3-642-20844-7_22

ABC: Algebraic Bound Computation for loops
R. Blanc, T.A. Henzinger, T. Hottelier, L. Kovács, in:, E.M. Clarke, A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning, Springer Nature, Berlin, Heidelberg, 2010, pp. 103–118.
LibreCat: https://research-explorer.ista.ac.at/record/10908
DOI: 10.1007/978-3-642-17511-4_7

Algorithmic aspects of web search engines
M.H. Henzinger, in:, 2th Annual European Symposium on Algorithms, Springer Nature, 2004, p. 3.
LibreCat: https://research-explorer.ista.ac.at/record/11801
DOI: 10.1007/978-3-540-30140-0_2

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

Web information retrieval - an algorithmic perspective
M.H. Henzinger, in:, 8th Annual European Symposium on Algorithms, Springer Nature, 2000, pp. 1–8.
LibreCat: https://research-explorer.ista.ac.at/record/11802
DOI: 10.1007/3-540-45253-2_1

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

Faster algorithms for the nonemptiness of streett automata and for communication protocol pruning
M.H. Henzinger, J.A. Telle, in:, 5th Scandinavian Workshop on Algorithm Theory, Springer Nature, 1996, pp. 16–27.
LibreCat: https://research-explorer.ista.ac.at/record/11804
DOI: 10.1007/3-540-61422-2_117

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

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