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.
368 Publications
2013 | Conference Paper | IST-REx-ID: 11793 |
Henzinger, Monika H., et al. “Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks.” 40th International Colloquium on Automata, Languages, and Programming, vol. 7966, Springer Nature, 2013, pp. 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, 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 | Conference Paper | IST-REx-ID: 11856 |
Henzinger, Monika H., et al. “Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(Mn) Barrier and Derandomization.” 54th Annual Symposium on Foundations of Computer Science, Institute of Electrical and Electronics Engineers, 2013, pp. 538–47, doi:10.1109/focs.2013.64.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Journal Article | IST-REx-ID: 11902
Dütting, Paul, et al. “Bidder Optimal Assignments for General Utilities.” Theoretical Computer Science, vol. 478, no. 3, Elsevier, 2013, pp. 22–32, doi:10.1016/j.tcs.2013.01.030.
View
| Files available
| DOI