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.

73 Publications


2019 | Published | Conference Paper | IST-REx-ID: 6647 | OA
Fulek, Radoslav, et al. “The Crossing Tverberg Theorem.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13, doi:10.4230/LIPICS.SOCG.2019.38.
[Published Version] View | Files available | DOI | arXiv
 

2019 | Published | Conference Paper | IST-REx-ID: 6725 | OA
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi:10.4230/LIPICS.ICALP.2019.77.
[Published Version] View | Files available | DOI | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 6005 | OA
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
 

2018 | Published | Conference Paper | IST-REx-ID: 11911 | OA
Biedermann, Sonja, et al. “Memetic Graph Clustering.” 17th International Symposium on Experimental Algorithms, vol. 103, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.SEA.2018.3.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 11827 | OA
Goranci, Gramoz, et al. “A Tree Structure for Dynamic Facility Location.” 26th Annual European Symposium on Algorithms, vol. 112, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.39.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2018 | Published | Conference Paper | IST-REx-ID: 7407 | OA
Pietrzak, Krzysztof Z. “Proofs of Catalytic Space.” 10th Innovations in Theoretical Computer Science  Conference (ITCS 2019), vol. 124, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 59:1-59:25, doi:10.4230/LIPICS.ITCS.2019.59.
[Published Version] View | Files available | DOI | Download Published Version (ext.)
 

2018 | Published | Conference Paper | IST-REx-ID: 11828 | OA
Goranci, Gramoz, et al. “Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs.” 26th Annual European Symposium on Algorithms, vol. 112, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPICS.ESA.2018.40.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

2017 | Published | Conference Paper | IST-REx-ID: 950 | OA
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
 

2017 | Published | Conference Paper | IST-REx-ID: 11829 | OA
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 | Published | Conference Paper | IST-REx-ID: 11831 | OA
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 | Published | Conference Paper | IST-REx-ID: 11833 | OA
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 | Published | Conference Paper | IST-REx-ID: 11832 | OA
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
 

2016 | Published | Conference Paper | IST-REx-ID: 11836 | OA
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 | Published | Conference Paper | IST-REx-ID: 11834 | OA
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 | Published | Conference Paper | IST-REx-ID: 11835 | OA
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 | Published | Conference Paper | IST-REx-ID: 11837 | OA
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.)
 

2010 | Published | Conference Paper | IST-REx-ID: 11838 | OA
Dütting, Paul, et al. “Sponsored Search, Market Equilibria, and the Hungarian Method.” 27th International Symposium on Theoretical Aspects of Computer Science, vol. 5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2010, pp. 287–98, doi:10.4230/LIPICS.STACS.2010.2463.
[Published Version] View | Files available | DOI | Download Published Version (ext.) | arXiv
 

2009 | Published | Conference Paper | IST-REx-ID: 11912 | OA
Baykan, Eda, et al. “A Comparison of Techniques for Sampling Web Pages.” 26th International Symposium on Theoretical Aspects of Computer Science, vol. 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2009, pp. 13–30, doi:10.4230/LIPICS.STACS.2009.1809.
[Published Version] View | DOI | Download Published Version (ext.) | arXiv
 

Filters and Search Terms

issn=1868-8969

Search

Filter Publications

Display / Sort

Citation Style: MLA

Export / Embed