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.
8978 Publications
2013 | Conference Paper | IST-REx-ID: 11793 |
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 11791 |
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
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 11792 |
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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 11856 |
Henzinger MH, Krinninger S, Nanongkai D. Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization. In: 54th Annual Symposium on Foundations of Computer Science. Institute of Electrical and Electronics Engineers; 2013:538-547. doi:10.1109/focs.2013.64
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Journal Article | IST-REx-ID: 11902
Dütting P, Henzinger MH, Weber I. Bidder optimal assignments for general utilities. Theoretical Computer Science. 2013;478(3):22-32. doi:10.1016/j.tcs.2013.01.030
View
| Files available
| DOI