Removing popular faces in curve arrangements
P. De Nooijer, S. Terziadis, A. Weinberger, Z. Masárová, T. Mchedlidze, M. Löffler, G. Rote, in:, 31st International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2024, pp. 18–33.

Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
M. Filakovský, T.V. Nakajima, J. Oprsal, G. Tasinato, U. Wagner, in:, 41st International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.

A constructive algorithm for building rectifiable curves in weakly convex sets
M. Lopushanski, G. Ivanov, in:, AIP Conference Proceedings, AIP Publishing, 2024.

Topology and adjunction in promise constraint satisfaction
A. Krokhin, J. Oprsal, M. Wrochna, S. divný, SIAM Journal on Computing 52 (2023) 38–79.

Highly irregular separated nets
M. Dymond, V. Kaluza, Israel Journal of Mathematics 253 (2023) 501–554.

Inserting one edge into a simple drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, B. Vogtenhuber, R. Seidel, T. Wiedera, Discrete and Computational Geometry 69 (2023) 745–770.

Approximating the bundled crossing number
A.M. Arroyo Guevara, S. Felsner, Journal of Graph Algorithms and Applications 27 (2023) 433–457.

Exterior algebra and combinatorics
S. Köse, Exterior Algebra and Combinatorics, Institute of Science and Technology Austria, 2023.

Erds-Ko-Rado and Hilton-Milner theorems for two-forms
G. Ivanov, S. Köse, Discrete Mathematics 346 (2023).

Quantitative Steinitz theorem: A polynomial bound
G. Ivanov, M. Naszódi, Bulletin of the London Mathematical Society (2023).

The crossing Tverberg theorem
R. Fulek, B. Gärtner, A. Kupavskii, P. Valtr, U. Wagner, Discrete and Computational Geometry (2023).

Coboundary expansion, equivariant overlap, and crossing numbers of simplicial complexes
U. Wagner, P. Wild, Israel Journal of Mathematics 256 (2023) 675–717.

Token swapping on trees
A. Biniaz, K. Jain, A. Lubiw, Z. Masárová, T. Miltzow, D. Mondal, A.M. Naredla, J. Tkadlec, A. Turcotte, Discrete Mathematics and Theoretical Computer Science 24 (2023).

Functional John and Löwner conditions for pairs of log-concave functions
G. Ivanov, M. Naszódi, International Mathematics Research Notices 2023 (2023) 20613–20669.

Divergence of separated nets with respect to displacement equivalence
M. Dymond, V. Kaluza, Geometriae Dedicata (2023).

Iterated medial triangle subdivision in surfaces of constant curvature
F.R. Brunck, Discrete and Computational Geometry 70 (2023) 1059–1089.

An invitation to the promise constraint satisfaction problem
A. Krokhin, J. Oprsal, ACM SIGLOG News 9 (2022) 30–59.

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, Journal of Graph Algorithms and Applications 26 (2022) 225–240.

High-dimensional expansion and crossing numbers of simplicial complexes
P. Wild, High-Dimensional Expansion and Crossing Numbers of Simplicial Complexes, Institute of Science and Technology, 2022.

Even maps, the Colin de Verdière number and representations of graphs
V. Kaluza, M. Tancer, Combinatorica 42 (2022) 1317–1345.

Barycentric cuts through a convex body
Z. Patakova, M. Tancer, U. Wagner, Discrete and Computational Geometry 68 (2022) 1133–1154.

Functional John ellipsoids
G. Ivanov, M. Naszódi, Journal of Functional Analysis 282 (2022).

Connectivity of triangulation flip graphs in the plane
U. Wagner, E. Welzl, Discrete &; Computational Geometry 68 (2022) 1227–1284.

The Z2-Genus of Kuratowski minors
R. Fulek, J. Kyndl, Discrete and Computational Geometry 68 (2022) 425–447.

Approximating the bundled crossing number
A.M. Arroyo Guevara, S. Felsner, in:, WALCOM 2022: Algorithms and Computation, Springer Nature, 2022, pp. 383–395.

High-dimensional expanders (after Gromov, Kaufman, Kazhdan, Lubotzky, and others)
U. Wagner, Bulletin de La Societe Mathematique de France 438 (2022) 281–294.

A quantitative Helly-type theorem: Containment in a homothet
G. Ivanov, M. Naszodi, SIAM Journal on Discrete Mathematics 36 (2022) 951–957.

On compatible matchings
O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233.

No-dimension Tverberg's theorem and its corollaries in Banach spaces of type p
G. Ivanov, Bulletin of the London Mathematical Society 53 (2021) 631–641.

On the volume of projections of the cross-polytope
G. Ivanov, Discrete Mathematics 344 (2021).

Drawings of complete graphs in the projective plane
A.M. Arroyo Guevara, D. Mcquillan, R.B. Richter, G. Salazar, M. Sullivan, Journal of Graph Theory 97 (2021) 426–440.

Extending drawings of complete graphs into arrangements of pseudocircles
A.M. Arroyo Guevara, R.B. Richter, M. Sunohara, SIAM Journal on Discrete Mathematics 35 (2021) 1050–1076.

Functional Löwner ellipsoids
G. Ivanov, I. Tsiutsiurupa, Journal of Geometric Analysis 31 (2021) 11493–11528.

Rectifiable curves in proximally smooth sets
G. Ivanov, M.S. Lopushanski, Set-Valued and Variational Analysis (2021).

Eliminating higher-multiplicity intersections. III. Codimension 2
S. Avvakumov, I. Mabillard, A.B. Skopenkov, U. Wagner, Israel Journal of Mathematics 245 (2021) 501–534.

On the volume of sections of the cube
G. Ivanov, I. Tsiutsiurupa, Analysis and Geometry in Metric Spaces 9 (2021) 1–18.

Tight frames and related geometric problems
G. Ivanov, Canadian Mathematical Bulletin 64 (2021) 942–963.

Embeddability of simplicial complexes is undecidable
M. Filakovský, U. Wagner, S.Y. Zhechev, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 767–785.

Homotopic curve shortening and the affine curve-shortening flow
S. Avvakumov, G. Nivasch, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Bounding radon number via Betti numbers
Z. Patakova, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Barycentric cuts through a convex body
Z. Patakova, M. Tancer, U. Wagner, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Extending drawings of graphs to arrangements of pseudolines
A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Connectivity of triangulation flip graphs in the plane (Part II: Bistellar flips)
U. Wagner, E. Welzl, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.

Connectivity of triangulation flip graphs in the plane (Part I: Edge flips)
U. Wagner, E. Welzl, in:, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2020, pp. 2823–2841.

Eliminating higher-multiplicity intersections, III. Codimension 2
S. Avvakumov, U. Wagner, I. Mabillard, A.B. Skopenkov, Russian Mathematical Surveys 75 (2020) 1156–1158.

Are two given maps homotopic? An algorithmic viewpoint
M. Filakovský, L. Vokínek, Foundations of Computational Mathematics 20 (2020) 311–330.

Intersection patterns of planar sets
G. Kalai, Z. Patakova, Discrete and Computational Geometry 64 (2020) 304–323.

Inserting one edge into a simple drawing is hard
A.M. Arroyo Guevara, F. Klute, I. Parada, R. Seidel, B. Vogtenhuber, T. Wiedera, in:, Graph-Theoretic Concepts in Computer Science, Springer Nature, 2020, pp. 325–338.

Reconfiguration problems
Z. Masárová, Reconfiguration Problems, Institute of Science and Technology Austria, 2020.

Combinatorial width parameters for 3-dimensional manifolds
K. Huszár, Combinatorial Width Parameters for 3-Dimensional Manifolds, Institute of Science and Technology Austria, 2020.

Topological methods in geometry and discrete mathematics
S. Avvakumov, Topological Methods in Geometry and Discrete Mathematics, Institute of Science and Technology Austria, 2020.

Disjoint tree-compatible plane perfect matchings
O. Aichholzer, J. Obmann, P. Patak, D. Perz, J. Tkadlec, in:, 36th European Workshop on Computational Geometry, 2020.

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.

Extending partial representations of circle graphs
S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.

Thrackles: An improved upper bound
R. Fulek, J. Pach, Discrete Applied Mathematics 259 (2019) 266–231.

Graphs with at most one crossing
A. Silva, A.M. Arroyo Guevara, B. Richter, O. Lee, Discrete Mathematics 342 (2019) 3201–3207.

Counterexample to an extension of the Hanani-Tutte theorem on the surface of genus 4
R. Fulek, J. Kyndl, Combinatorica 39 (2019) 1267–1279.

Shellability is NP-complete
X. Goaoc, P. Patak, Z. Patakova, M. Tancer, U. Wagner, Journal of the ACM 66 (2019).

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.

Algorithmic aspects of homotopy theory and embeddability
S.Y. Zhechev, Algorithmic Aspects of Homotopy Theory and Embeddability, Institute of Science and Technology Austria, 2019.

Vanishing of all equivariant obstructions and the mapping degree
S. Avvakumov, S. Kudrya, ArXiv (n.d.).

Envy-free division using mapping degree
S. Avvakumov, R. Karasev, ArXiv (n.d.).

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.

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.

On the treewidth of triangulated 3-manifolds
K. Huszár, J. Spreer, U. Wagner, Journal of Computational Geometry 10 (2019) 70–98.

Stronger counterexamples to the topological Tverberg conjecture
S. Avvakumov, R. Karasev, A. Skopenkov, ArXiv (n.d.).

Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, ACM Transactions on Algorithms 15 (2019).

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.

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.).

Hanani-Tutte for approximating maps of graphs
R. Fulek, J. Kyndl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

The 2-Genus of Kuratowski minors
R. Fulek, J. Kyndl, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, p. 40.1-40.14.

Thrackles: An improved upper bound
R. Fulek, J. Pach, in:, Springer, 2018, pp. 160–166.

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.

On the treewidth of triangulated 3-manifolds
K. Huszár, J. Spreer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Computing simplicial representatives of homotopy group elements
M. Filakovský, P. Franek, U. Wagner, S.Y. Zhechev, Journal of Applied and Computational Topology 2 (2018) 177–231.

Crossing minimization in perturbed drawings
R. Fulek, C.D. Tóth, in:, Springer, 2018, pp. 229–241.

Embeddability in the 3-Sphere is decidable
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Journal of the ACM 65 (2018).

Recognizing weak embeddings of graphs
H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.

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.

Any cyclic quadrilateral can be inscribed in any closed convex smooth curve
A. Akopyan, S. Avvakumov, Forum of Mathematics, Sigma 6 (2018).

On expansion and topological overlap
D. Dotterrer, T. Kaufman, U. Wagner, Geometriae Dedicata 195 (2018) 307–317.

Hanani-Tutte for radial planarity
R. Fulek, M. Pelsmajer, M. Schaefer, Journal of Graph Algorithms and Applications 21 (2017) 135–154.

Finding non-orientable surfaces in 3-Manifolds
B. Burton, A.N. de Mesmay, U. Wagner, Discrete &; Computational Geometry 58 (2017) 871–888.

Persistence of zero sets
P. Franek, M. Krcál, Homology, Homotopy and Applications 19 (2017) 313–342.

On generalized Heawood inequalities for manifolds: A van Kampen–Flores type nonembeddability result
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, Israel Journal of Mathematics 222 (2017) 841–866.

Embedding graphs into embedded graphs
R. Fulek, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Topological data analysis with Bregman divergences
H. Edelsbrunner, H. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017, pp. 391–3916.

On the nonexistence of k reptile simplices in d^3 and d^4
J. Kyndl, Z. Patakova, The Electronic Journal of Combinatorics 24 (2017) 1–44.

Unified Hanani Tutte theorem
R. Fulek, J. Kyndl, D. Pálvölgyi, Electronic Journal of Combinatorics 24 (2017).

A proof of the orbit conjecture for flipping edge labelled triangulations
A. Lubiw, Z. Masárová, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Algorithmic solvability of the lifting extension problem
M. cadek, M. Krcál, L. Vokínek, Discrete &; Computational Geometry 54 (2017) 915–965.

On the existence of ordinary triangles
R. Fulek, H. Mojarrad, M. Naszódi, J. Solymosi, S. Stich, M. Szedlák, Computational Geometry: Theory and Applications 66 (2017) 28–31.

C-planarity of embedded cyclic c-graphs
R. Fulek, Computational Geometry: Theory and Applications 66 (2017) 1–13.

Bounding helly numbers via betti numbers
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, M. Loebl, J. Nesetil, R. Thomas (Eds.), A Journey through Discrete Mathematics: A Tribute to Jiri Matousek, Springer, 2017, pp. 407–447.

Computation of cubical Steenrod squares
M. Krcál, P. Pilarczyk, in:, Springer, 2016, pp. 140–151.

On eigenvalues of random complexes
A. Gundert, U. Wagner, Israel Journal of Mathematics 216 (2016) 545–582.

Bounded embeddings of graphs in the plane
R. Fulek, in:, Springer, 2016, pp. 31–42.

Eliminating higher-multiplicity intersections, II. The deleted product criterion in the r-metastable range
I. Mabillard, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 2016, p. 51.1-51.12.

On computability and triviality of well groups
P. Franek, M. Krcál, Discrete &; Computational Geometry 56 (2016) 126–164.

The classification of certain linked 3-manifolds in 6-space
S. Avvakumov, Moscow Mathematical Journal 16 (2016) 1–25.

On topological minors in random simplicial complexes
A. Gundert, U. Wagner, Proceedings of the American Mathematical Society 144 (2016) 1815–1828.

Hanani-Tutte for radial planarity II
R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2016, pp. 468–481.

Untangling two systems of noncrossing curves
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, Israel Journal of Mathematics 212 (2016) 37–79.

Finding non-orientable surfaces in 3-manifolds
B. Burton, A.N. de Mesmay, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 24.1-24.15.

Eliminating higher-multiplicity intersections: an r-fold Whitney trick for the topological Tverberg conjecture
I. Mabillard, Eliminating Higher-Multiplicity Intersections: An r-Fold Whitney Trick for the Topological Tverberg Conjecture, Institute of Science and Technology Austria, 2016.

C-planarity of embedded cyclic c-graphs
R. Fulek, in:, Springer, 2016, pp. 94–106.

On expansion and topological overlap
D. Dotterrer, T. Kaufman, U. Wagner, in:, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016, p. 35.1-35.10.

On computability and triviality of well groups
P. Franek, M. Krcál, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 842–856.

Hanani-Tutte for radial planarity
R. Fulek, M. Pelsmajer, M. Schaefer, in:, Springer, 2015, pp. 99–110.

Vertical visibility among parallel polygons in three dimensions
R. Fulek, R. Radoidi, in:, Graph Drawing and Network Visualization, Springer Nature, 2015, pp. 373–379.

Clustered planarity testing revisited
R. Fulek, J. Kyndl, I. Malinovid, D. Pálvölgyi, Electronic Journal of Combinatorics 22 (2015).

A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
V. Cohen Addad, A.N. de Mesmay, in:, Springer, 2015, pp. 386–398.

Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
R. Karasev, J. Kyndl, P. Paták, Z. Patakova, M. Tancer, Discrete &; Computational Geometry 54 (2015) 610–636.

Robust satisfiability of systems of equations
P. Franek, M. Krcál, Journal of the ACM 62 (2015).

Discrete systolic inequalities and decompositions of triangulated surfaces
É. Colin De Verdière, A. Hubard, A.N. de Mesmay, Discrete &; Computational Geometry 53 (2015) 587–620.

On generalized Heawood inequalities for manifolds: A Van Kampen–Flores-type nonembeddability result
X. Goaoc, I. Mabillard, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 476–490.

Eliminating higher-multiplicity intersections, III. Codimension 2
S. Avvakumov, I. Mabillard, A. Skopenkov, U. Wagner, ArXiv (n.d.).

Bounding Helly numbers via Betti numbers
X. Goaoc, P. Paták, Z. Patakova, M. Tancer, U. Wagner, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 507–521.

Clustered planarity testing revisited
R. Fulek, J. Kyndl, I. Malinovi, D. Pálvölgyi, in:, International Symposium on Graph Drawing, Springer Nature, Cham, 2014, pp. 428–436.

On the geometric ramsey number of outerplanar graphs
J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete &; Computational Geometry 53 (2014) 64–79.

On Gromov's method of selecting heavily covered points
J. Matousek, U. Wagner, Discrete &; Computational Geometry 52 (2014) 1–33.

Computing all maps into a sphere
M. cadek, M. Krcál, J. Matousek, F. Sergeraert, L. Vokínek, U. Wagner, Journal of the ACM 61 (2014).

Playful Math - An introduction to mathematical games
K. Huszár, M. Rolinek, Playful Math - An Introduction to Mathematical Games, IST Austria, n.d.

Eliminating Tverberg points, I. An analogue of the Whitney trick
I. Mabillard, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 171–180.

Embeddability in the 3 sphere is decidable
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, in:, Proceedings of the Annual Symposium on Computational Geometry, ACM, 2014, pp. 78–84.

Untangling two systems of noncrossing curves
J. Matousek, E. Sedgwick, M. Tancer, U. Wagner, 8242 (2013) 472–483.

Extending continuous maps: Polynomiality and undecidability
M. cadek, M. Krcál, J. Matousek, L. Vokínek, U. Wagner, in:, 45th Annual ACM Symposium on Theory of Computing, ACM, 2013, pp. 595–604.