Pavel Paták

Orcid: 0000-0003-3016-0278

According to our database1, Pavel Paták authored at least 13 papers between 2015 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Helly-type problems from a topological perspective.
CoRR, February, 2026

2025
A Sharper Ramsey Theorem for Constrained Drawings.
J. Graph Theory, 2025

2024
Jordan-Hölder Theorem with Uniqueness for Semimodular Lattices.
Order, December, 2024

Embeddings of k-Complexes into 2k-Manifolds.
Discret. Comput. Geom., April, 2024

2023
Shellability Is Hard Even for Balls.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022
Disjoint Compatibility via Graph Classes.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2018
Shellability is NP-Complete.
Proceedings of the 34th International Symposium on Computational Geometry, 2018

2016
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex.
Discret. Comput. Geom., 2015

Three-Monotone Interpolation.
Discret. Comput. Geom., 2015

Simplifying Inclusion-Exclusion Formulas.
Comb. Probab. Comput., 2015

Bounding Helly Numbers via Betti Numbers.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result.
Proceedings of the 31st International Symposium on Computational Geometry, 2015


  Loading...