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.
125 Publications
2019 |
Published |
Journal Article |
IST-REx-ID: 7108 |
Goaoc, Xavier, et al. “Shellability Is NP-Complete.” Journal of the ACM, vol. 66, no. 3, 21, ACM, 2019, doi:10.1145/3314024.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 7230 |
Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.” 27th International Symposium on Graph Drawing and Network Visualization, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:10.1007/978-3-030-35802-0_18.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 7401 |
Fulek, Radoslav, and Jan Kyncl. “Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices.” 35th International Symposium on Computational Geometry (SoCG 2019), vol. 129, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, doi:10.4230/LIPICS.SOCG.2019.39.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 5790 |
Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.” Journal of Graph Theory, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:10.1002/jgt.22436.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 5857 |
Fulek, Radoslav, and János Pach. “Thrackles: An Improved Upper Bound.” Discrete Applied Mathematics, vol. 259, no. 4, Elsevier, 2019, pp. 266–231, doi:10.1016/j.dam.2018.12.025.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 |
Published |
Journal Article |
IST-REx-ID: 5986 |
Lubiw, Anna, et al. “A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations.” Discrete & Computational Geometry, vol. 61, no. 4, Springer Nature, 2019, pp. 880–98, doi:10.1007/s00454-018-0035-8.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 |
Published |
Conference Paper |
IST-REx-ID: 6556 |
Huszár, Kristóf, and Jonathan Spreer. “3-Manifold Triangulations with Small Treewidth.” 35th International Symposium on Computational Geometry, vol. 129, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 44:1-44:20, doi:10.4230/LIPIcs.SoCG.2019.44.
[Published Version]
View
| Files available
| DOI
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 285 |
Huszár, Kristóf, et al. On the Treewidth of Triangulated 3-Manifolds. Vol. 99, 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.46.
[Submitted Version]
View
| Files available
| DOI
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 309 |
Akitaya, Hugo, et al. Recognizing Weak Embeddings of Graphs. ACM, 2018, pp. 274–92, doi:10.1137/1.9781611975031.20.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 184 |
Goaoc, Xavier, et al. Shellability Is NP-Complete. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16, doi:10.4230/LIPIcs.SoCG.2018.41.
[Published Version]
View
| Files available
| DOI
2018 |
Published |
Conference Paper |
IST-REx-ID: 185 |
Fulek, Radoslav, and Jan Kynčl. Hanani-Tutte for Approximating Maps of Graphs. Vol. 99, 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:10.4230/LIPIcs.SoCG.2018.39.
[Published Version]
View
| Files available
| DOI
2018 |
Published |
Conference Paper |
IST-REx-ID: 186 |
Fulek, Radoslav, and Jan Kynčl. The ℤ2-Genus of Kuratowski Minors. Vol. 99, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14, doi:10.4230/LIPIcs.SoCG.2018.40.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 6774 |
Filakovský, Marek, et al. “Computing Simplicial Representatives of Homotopy Group Elements.” Journal of Applied and Computational Topology, vol. 2, no. 3–4, Springer, 2018, pp. 177–231, doi:10.1007/s41468-018-0021-5.
[Published Version]
View
| Files available
| DOI
2018 |
Published |
Journal Article |
IST-REx-ID: 742 |
Dotterrer, Dominic, et al. “On Expansion and Topological Overlap.” Geometriae Dedicata, vol. 195, no. 1, Springer, 2018, pp. 307–317, doi:10.1007/s10711-017-0291-4.
[Published Version]
View
| Files available
| DOI
| WoS
2018 |
Published |
Conference Paper |
IST-REx-ID: 5791 |
Fulek, Radoslav, and Csaba D. Tóth. Crossing Minimization in Perturbed Drawings. Vol. 11282, Springer, 2018, pp. 229–41, doi:10.1007/978-3-030-04414-5_16.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 5960 |
Rohou, Simon, et al. “Proving the Existence of Loops in Robot Trajectories.” The International Journal of Robotics Research, vol. 37, no. 12, SAGE Publications, 2018, pp. 1500–16, doi:10.1177/0278364918808367.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 6355 |
Akopyan, Arseniy, and Sergey Avvakumov. “Any Cyclic Quadrilateral Can Be Inscribed in Any Closed Convex Smooth Curve.” Forum of Mathematics, Sigma, vol. 6, e7, Cambridge University Press, 2018, doi:10.1017/fms.2018.7.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2018 |
Published |
Journal Article |
IST-REx-ID: 425 |
Matoušek, Jiří, et al. “Embeddability in the 3-Sphere Is Decidable.” Journal of the ACM, vol. 65, no. 1, 5, ACM, 2018, doi:10.1145/3078632.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |
Published |
Conference Paper |
IST-REx-ID: 433 |
Fulek, Radoslav, and János Pach. Thrackles: An Improved Upper Bound. Vol. 10692, Springer, 2018, pp. 160–66, doi:10.1007/978-3-319-73915-1_14.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| arXiv
2017 |
Published |
Journal Article |
IST-REx-ID: 1073 |
Čadek, Martin, et al. “Algorithmic Solvability of the Lifting Extension Problem.” Discrete & Computational Geometry, vol. 54, no. 4, Springer, 2017, pp. 915–65, doi:10.1007/s00454-016-9855-6.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS