Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




133 Publications

2019 | Draft | Preprint | IST-REx-ID: 7950 | OA
Token swapping on trees
A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Draft | Preprint | IST-REx-ID: 8182 | OA [Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Draft | Preprint | IST-REx-ID: 8184 | OA
Stronger counterexamples to the topological Tverberg conjecture
S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Draft | Preprint | IST-REx-ID: 8185 | OA
Envy-free division using mapping degree
S. Avvakumov, R. Karasev, ArXiv (n.d.).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 7401 | OA
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
 
2019 | Published | Conference Paper | IST-REx-ID: 6647 | OA
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
 
2019 | Published | Journal Article | IST-REx-ID: 6982 | OA
Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019).
[Preprint] View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 5857 | OA
Thrackles: An improved upper bound
R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.
[Preprint] View | Files available | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 7034 | OA
Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
R. Fulek, J. Kynčl, Combinatorica 39 (2019) 1267–1279.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 5790 | OA
Extending partial representations of circle graphs
S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 5986 | OA
A proof of the orbit conjecture for flipping edge-labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, Discrete & Computational Geometry 61 (2019) 880–898.
[Published Version] View | Files available | DOI | WoS | arXiv
 
2019 | Published | Conference Paper | IST-REx-ID: 7230 | OA
Extending simple drawings
A.M. Arroyo Guevara, M. Derka, I. Parada, in:, 27th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2019, pp. 230–243.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Journal Article | IST-REx-ID: 6638 | OA
Graphs with at most one crossing
A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342 (2019) 3201–3207.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2019 | Published | Thesis | IST-REx-ID: 6681 | OA
Algorithmic aspects of homotopy theory and embeddability
S.Y. Zhechev, Algorithmic Aspects of Homotopy Theory and Embeddability, Institute of Science and Technology Austria, 2019.
[Published Version] View | Files available | DOI
 
2019 | Published | Journal Article | IST-REx-ID: 7093 | OA
On the treewidth of triangulated 3-manifolds
K. Huszár, J. Spreer, U. Wagner, Journal of Computational Geometry 10 (2019) 70–98.
[Published Version] View | Files available | DOI | arXiv
 
2018 | Published | Journal Article | IST-REx-ID: 5960 | OA
Proving the existence of loops in robot trajectories
S. Rohou, P. Franek, C. Aubry, L. Jaulin, The International Journal of Robotics Research 37 (2018) 1500–1516.
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 184 | OA
Shellability is NP-complete
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 41:1-41:16.
[Published Version] View | Files available | DOI
 
2018 | Published | Conference Paper | IST-REx-ID: 5791 | OA
Crossing minimization in perturbed drawings
Fulek, Radoslav, Crossing minimization in perturbed drawings. 11282 . 2018
[Preprint] View | DOI | Download Preprint (ext.) | WoS | arXiv
 
2018 | Published | Journal Article | IST-REx-ID: 6355 | OA
Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).
[Published Version] View | Files available | DOI | WoS | arXiv
 
2018 | Published | Conference Paper | IST-REx-ID: 185 | OA
Hanani-Tutte for approximating maps of graphs
R. Fulek, J. Kynčl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
[Published Version] View | Files available | DOI
 

Search

Filter Publications

Display / Sort

Export / Embed