Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
126 Publications
2013 | Conference Paper | IST-REx-ID: 11791 | 
Dütting, Paul, et al. “Valuation Compressions in VCG-Based Combinatorial Auctions.” 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.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 11792 |
Dvořák, Wolfgang, et al. “Maximizing a Submodular Function with Viability Constraints.” 21st Annual European Symposium on Algorithms, vol. 8125, Springer Nature, 2013, pp. 409–20, doi:10.1007/978-3-642-40450-4_35.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Book Chapter | IST-REx-ID: 5747 |
Dragoi, Cezara, et al. “Automatic Linearizability Proofs of Concurrent Objects with Cooperating Updates.” Computer Aided Verification, vol. 8044, Springer Berlin Heidelberg, 2013, pp. 174–90, doi:10.1007/978-3-642-39799-8_11.
View
| Files available
| DOI
2013 | Conference Paper | IST-REx-ID: 10902
Chatterjee, Krishnendu, et al. “How to Travel between Languages.” 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.
View
| DOI
2013 | Conference Paper | IST-REx-ID: 10897
Edelsbrunner, Herbert. “Persistent Homology in Image Processing.” Graph-Based Representations in Pattern Recognition, vol. 7877, Springer Nature, 2013, pp. 182–83, doi:10.1007/978-3-642-38221-5_19.
View
| DOI
2012 | Conference Paper | IST-REx-ID: 11794 |
Dütting, Paul, et al. “Auctions with Heterogeneous Items and Budget Limits.” 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.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 10904
Chatterjee, Krishnendu, et al. “Strategy Synthesis for Multi-Dimensional Quantitative Objectives.” 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.
[Preprint]
View
| Files available
| DOI
| arXiv
2012 | Conference Paper | IST-REx-ID: 10903
Bouajjani, Ahmed, et al. “Accurate Invariant Checking for Programs Manipulating Lists and Arrays with Infinite Data.” Automated Technology for Verification and Analysis, vol. 7561, Springer, 2012, pp. 167–82, doi:10.1007/978-3-642-33386-6_14.
View
| DOI
2012 | Conference Paper | IST-REx-ID: 10905 |
Chatterjee, Krishnendu, et al. “Polynomial-Time Algorithms for Energy Games with Special Weight Structures.” Algorithms – ESA 2012, vol. 7501, Springer, 2012, pp. 301–12, doi:10.1007/978-3-642-33090-2_27.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 10906 |
Grebenshchikov, Sergey, et al. “HSF(C): A Software Verifier Based on Horn Clauses.” 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.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2012 | Book Chapter | IST-REx-ID: 5745 |
Gupta, Ashutosh. “Improved Single Pass Algorithms for Resolution Proof Reduction.” Automated Technology for Verification and Analysis, vol. 7561, Springer Berlin Heidelberg, 2012, pp. 107–21, doi:10.1007/978-3-642-33386-6_10.
View
| Files available
| DOI
2011 | Conference Paper | IST-REx-ID: 11796
Henzinger, Monika H., and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” 19th Annual European Symposium on Algorithms, vol. 6942, Springer Nature, 2011, pp. 192–202, doi:10.1007/978-3-642-23719-5_17.
View
| DOI
2011 | Conference Paper | IST-REx-ID: 10907
Artner, Nicole M., et al. “Spatio-Temporal Extraction of Articulated Models in a Graph Pyramid.” 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.
View
| DOI
2010 | Conference Paper | IST-REx-ID: 10908 |
Blanc, Régis, et al. “ABC: Algebraic Bound Computation for Loops.” 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.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2010 | Conference Paper | IST-REx-ID: 11797 |
Feldman, Jon, et al. “Online Stochastic Packing Applied to Display Ad Allocation.” 18th Annual European Symposium on Algorithms, vol. 6346, Springer Nature, 2010, pp. 182–194, doi:10.1007/978-3-642-15775-2_16.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2010 | Conference Paper | IST-REx-ID: 11798
Dütting, Paul, and Monika H. Henzinger. “Mechanisms for the Marriage and the Assignment Game.” 7th International Conference on Algorithms and Complexity, vol. 6078, Springer Nature, 2010, pp. 6–12, doi:10.1007/978-3-642-13073-1_2.
View
| DOI
2010 | Book Chapter | IST-REx-ID: 5940
Juhás, Gabriel, et al. “Instance Deadlock: A Mystery behind Frozen Programs.” Applications and Theory of Petri Nets, Springer Berlin Heidelberg, 2010, pp. 1–17, doi:10.1007/978-3-642-13675-7_1.
View
| DOI
2009 | Conference Paper | IST-REx-ID: 11799
Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” 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.
View
| Files available
| DOI
2004 | Conference Paper | IST-REx-ID: 11801
Henzinger, Monika H. “Algorithmic Aspects of Web Search Engines.” 2th Annual European Symposium on Algorithms, vol. 3221, Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-30140-0_2.
View
| DOI
2004 | Conference Paper | IST-REx-ID: 11800
Henzinger, Monika H. “The Past, Present, and Future of Web Search Engines.” 31st International Colloquium on Automata, Languages and Programming, vol. 3142, Springer Nature, 2004, p. 3, doi:10.1007/978-3-540-27836-8_2.
View
| DOI
2000 | Conference Paper | IST-REx-ID: 11802
Henzinger, Monika H. “Web Information Retrieval - an Algorithmic Perspective.” 8th Annual European Symposium on Algorithms, vol. 1879, Springer Nature, 2000, pp. 1–8, doi:10.1007/3-540-45253-2_1.
View
| DOI
1997 | Conference Paper | IST-REx-ID: 11803
Henzinger, Monika H., and Valerie King. “Maintaining Minimum Spanning Trees in Dynamic Graphs.” 24th International Colloquium on Automata, Languages and Programming, vol. 1256, Springer Nature, 1997, pp. 594–604, doi:10.1007/3-540-63165-8_214.
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11804
Henzinger, Monika H., and Jan Arne Telle. “Faster Algorithms for the Nonemptiness of Streett Automata and for Communication Protocol Pruning.” 5th Scandinavian Workshop on Algorithm Theory, vol. 1097, Springer Nature, 1996, pp. 16–27, doi:10.1007/3-540-61422-2_117.
View
| DOI
1996 | Conference Paper | IST-REx-ID: 11910
Henzinger, Monika H., and Mikkel Thorup. “Improved Sampling with Applications to Dynamic Graph Algorithms.” 23rd International Colloquium on Automata, Languages, and Programming, vol. 1099, Springer Nature, 1996, pp. 290–99, doi:10.1007/3-540-61440-0_136.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11806
Henzinger, Monika H. “Approximating Minimum Cuts under Insertions.” 22nd International Colloquium on Automata, Languages and Programming, vol. 944, Springer Nature, 1995, pp. 280–291, doi:10.1007/3-540-60084-1_81.
View
| DOI
1995 | Conference Paper | IST-REx-ID: 11805
Henzinger, Monika H., and Han Poutré. “Certificates and Fast Algorithms for Biconnectivity in Fully-Dynamic Graphs.” 3rd Annual European Symposium on Algorithms, vol. 979, Springer Nature, 1995, pp. 171–184, doi:10.1007/3-540-60313-1_142.
View
| DOI