Pavel Paták

Orcid: 0000-0003-3016-0278

According to our database¹, Pavel Paták authored at least 11 papers between 2015 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

Jordan-Hölder Theorem with Uniqueness for Semimodular Lattices.

[BibT_eX]

[DOI]

Pavel Paták

Order, December, 2024

Embeddings of k-Complexes into 2k-Manifolds.

[BibT_eX]

[DOI]

Pavel Paták

Martin Tancer

Discret. Comput. Geom., April, 2024

2023

Shellability Is Hard Even for Balls.

[BibT_eX]

[DOI]

Pavel Paták

Martin Tancer

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Disjoint Compatibility via Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2022

2018

Shellability is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

2016

A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane.

[BibT_eX]

[DOI]

Éric Colin de Verdière

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.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Three-Monotone Interpolation.

[BibT_eX]

[DOI]

Josef Cibulka

Jirí Matousek

Pavel Paták

Discret. Comput. Geom., 2015

Simplifying Inclusion-Exclusion Formulas.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Bounding Helly Numbers via Betti Numbers.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Pavel Paták

Timeline

Legend:

Links

On csauthors.net:

Bibliography

Loading...