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.
62 Publications
2018 | Conference Paper | IST-REx-ID: 6005 | 
Avni, Guy, et al. Timed Network Games with Clocks. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.MFCS.2018.23.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 11829 |
Henzinger, Monika H., et al. “Conditional Hardness for Sensitivity Problems.” 8th Innovations in Theoretical Computer Science Conference, vol. 67, 26, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ITCS.2017.26.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 11833 |
Goranci, Gramoz, et al. “The Power of Vertex Sparsifiers in Dynamic Graph Algorithms.” 25th Annual European Symposium on Algorithms, vol. 87, 45, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.45.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 11832 |
Henzinger, Monika H., et al. “Dynamic Clustering to Minimize the Sum of Radii.” 25th Annual European Symposium on Algorithms, vol. 87, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.48.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 11831 |
Goranci, Gramoz, et al. “Improved Guarantees for Vertex Sparsification in Planar Graphs.” 25th Annual European Symposium on Algorithms, vol. 87, 44, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPICS.ESA.2017.44.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 950 |
Avni, Guy, et al. Infinite-Duration Bidding Games. Vol. 85, 17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, doi:10.4230/LIPIcs.CONCUR.2017.21.
[Published Version]
View
| Files available
| DOI
| arXiv
2016 | Conference Paper | IST-REx-ID: 11836 |
Cheung, Yun Kuen, et al. “Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds.” 43rd International Colloquium on Automata, Languages, and Programming, vol. 55, 131, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ICALP.2016.131.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 11834 |
Goranci, Gramoz, et al. “Incremental Exact Min-Cut in Poly-Logarithmic Amortized Update Time.” 24th Annual European Symposium on Algorithms, vol. 57, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.46.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2016 | Conference Paper | IST-REx-ID: 11835 |
Henzinger, Monika H., and Stefan Neumann. “Incremental and Fully Dynamic Subgraph Connectivity for Emergency Planning.” 24th Annual European Symposium on Algorithms, vol. 57, 48, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2016, doi:10.4230/LIPICS.ESA.2016.48.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 11837 |
Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.” 32nd International Symposium on Theoretical Aspects of Computer Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:10.4230/LIPICS.STACS.2015.90.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)