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.
103 Publications
2020 | Published | Conference Paper | IST-REx-ID: 7989 | 
Bounding radon number via Betti numbers
Patakova, Zuzana, Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry 164. 2020
[Published Version]
View
| Files available
| DOI
| arXiv
Patakova, Zuzana, Bounding radon number via Betti numbers. 36th International Symposium on Computational Geometry 164. 2020
2020 | Published | Conference Paper | IST-REx-ID: 7992 |
Barycentric cuts through a convex body
Patakova, Zuzana, Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry 164. 2020
[Published Version]
View
| Files available
| DOI
| arXiv
Patakova, Zuzana, Barycentric cuts through a convex body. 36th International Symposium on Computational Geometry 164. 2020
2020 | Published | Conference Paper | IST-REx-ID: 7991 |
Homotopic curve shortening and the affine curve-shortening flow
Avvakumov, Sergey, Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry 164. 2020
[Published Version]
View
| Files available
| DOI
| arXiv
Avvakumov, Sergey, Homotopic curve shortening and the affine curve-shortening flow. 36th International Symposium on Computational Geometry 164. 2020
2020 | Published | Conference Paper | IST-REx-ID: 8703 |
Generalizing CGAL periodic Delaunay triangulations
Osang, Georg F, Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms 173. 2020
[Published Version]
View
| Files available
| DOI
Osang, Georg F, Generalizing CGAL periodic Delaunay triangulations. 28th Annual European Symposium on Algorithms 173. 2020
2020 | Published | Conference Paper | IST-REx-ID: 8725 |
The splay-list: A distribution-adaptive concurrent skip-list
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.
[Published Version]
View
| Files available
| DOI
| arXiv
V. Aksenov, D.-A. Alistarh, A. Drozdova, A. Mohtashami, in:, 34th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, p. 3:1-3:18.
2020 | Published | Conference Paper | IST-REx-ID: 8599 |
A survey of bidding games on graphs
Avni, Guy, A survey of bidding games on graphs. 31st International Conference on Concurrency Theory 171. 2020
[Published Version]
View
| Files available
| DOI
Avni, Guy, A survey of bidding games on graphs. 31st International Conference on Concurrency Theory 171. 2020
2020 | Published | Conference Paper | IST-REx-ID: 7994 |
Extending drawings of graphs to arrangements of pseudolines
Arroyo Guevara, Alan M, Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry 164. 2020
[Published Version]
View
| Files available
| DOI
| arXiv
Arroyo Guevara, Alan M, Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry 164. 2020
2020 | Published | Conference Paper | IST-REx-ID: 8534 |
Unary prime languages
Jecker, Ismael R, Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
[Published Version]
View
| Files available
| DOI
Jecker, Ismael R, Unary prime languages. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
2020 | Published | Conference Paper | IST-REx-ID: 8533 |
Simplified game of life: Algorithms and complexity
Chatterjee, Krishnendu, Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
[Published Version]
View
| Files available
| DOI
| arXiv
Chatterjee, Krishnendu, Simplified game of life: Algorithms and complexity. 45th International Symposium on Mathematical Foundations of Computer Science 170. 2020
2020 | Published | Conference Paper | IST-REx-ID: 7348 |
Monitoring event frequencies
T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version]
View
| Files available
| DOI
| arXiv
T. Ferrere, T.A. Henzinger, B. Kragl, in:, 28th EACSL Annual Conference on Computer Science Logic, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
2020 | Published | Conference Paper | IST-REx-ID: 8600 |
Multi-dimensional long-run average problems for vector addition systems with states
Chatterjee, Krishnendu, Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory 171. 2020
[Published Version]
View
| Files available
| DOI
| arXiv
Chatterjee, Krishnendu, Multi-dimensional long-run average problems for vector addition systems with states. 31st International Conference on Concurrency Theory 171. 2020
2020 | Published | Conference Paper | IST-REx-ID: 7952 |
The topological correctness of PL-approximations of isomanifolds
J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
[Published Version]
View
| Files available
| DOI
J.-D. Boissonnat, M. Wintraecken, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
2019 | Published | Conference Paper | IST-REx-ID: 11826 |
Algorithms and hardness for diameter in dynamic graphs
B. Ancona, M. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
B. Ancona, M. Henzinger, L. Roditty, V.V. Williams, N. Wein, in:, 46th International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
2019 | Published | Conference Paper | IST-REx-ID: 6556 |
3-manifold triangulations with small treewidth
K. Huszár, J. Spreer, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20.
[Published Version]
View
| Files available
| DOI
| arXiv
K. Huszár, J. Spreer, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20.
2019 | Published | Conference Paper | IST-REx-ID: 6725 |
Testing the complexity of a valued CSP language
Kolmogorov, Vladimir, Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming 132. 2019
[Published Version]
View
| Files available
| DOI
| arXiv
Kolmogorov, Vladimir, Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming 132. 2019
2019 | Published | Conference Paper | IST-REx-ID: 7401 |
Z_2-Genus of graphs and minimum rank of partial symmetric matrices
R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
[Published Version]
View
| Files available
| DOI
| arXiv
R. Fulek, J. Kyncl, in:, 35th International Symposium on Computational Geometry (SoCG 2019), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.
2019 | Published | Conference Paper | IST-REx-ID: 6647 |
The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.
[Published Version]
View
| Files available
| DOI
| arXiv
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, in:, 35th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 38:1-38:13.
2019 | Published | Conference Paper | IST-REx-ID: 6528 |
Simple verifiable delay functions
Pietrzak, Krzysztof Z, Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference 124. 2019
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
Pietrzak, Krzysztof Z, Simple verifiable delay functions. 10th Innovations in Theoretical Computer Science Conference 124. 2019
2018 | Published | Conference Paper | IST-REx-ID: 11827 |
A tree structure for dynamic facility location
G. Goranci, M. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
G. Goranci, M. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
2018 | Published | Conference Paper | IST-REx-ID: 11828 |
Dynamic effective resistances and approximate schur complement on separable graphs
G. Goranci, M. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
G. Goranci, M. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.