default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPavel Paták
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Pavel Paták, Martin Tancer
:
Embeddings of k-Complexes into 2k-Manifolds. Discret. Comput. Geom. 71(3): 960-991 (2024)- [j6]Pavel Paták:
Jordan-Hölder Theorem with Uniqueness for Semimodular Lattices. Order 41(3): 749-752 (2024) - [i7]Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber:
Disjoint Compatibility via Graph Classes. CoRR abs/2409.03579 (2024) - 2023
- [c6]Pavel Paták, Martin Tancer:
Shellability Is Hard Even for Balls. STOC 2023: 1271-1284 - 2022
- [c5]Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber:
Disjoint Compatibility via Graph Classes. WG 2022: 16-28 - [i6]Pavel Paták, Martin Tancer:
Shellability is hard even for balls. CoRR abs/2211.07978 (2022)
2010 – 2019
- 2019
- [j5]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-complete. J. ACM 66(3): 21:1-21:18 (2019) - [i5]Pavel Paták, Martin Tancer:
Embeddings of k-complexes into 2k-manifolds. CoRR abs/1904.02404 (2019) - 2018
- [c4]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-Complete. SoCG 2018: 41:1-41:15 - 2017
- [j4]Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer:
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. J. Graph Algorithms Appl. 21(5): 939-981 (2017) - [i4]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Shellability is NP-complete. CoRR abs/1711.08436 (2017) - 2016
- [c3]Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer:
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. GD 2016: 454-467 - [i3]Éric Colin de Verdière, Vojtech Kaluza, Pavel Paták, Zuzana Patáková, Martin Tancer:
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane. CoRR abs/1608.07855 (2016) - 2015
- [j3]Xavier Goaoc, Jirí Matousek, Pavel Paták, Zuzana Safernová, Martin Tancer:
Simplifying Inclusion-Exclusion Formulas. Comb. Probab. Comput. 24(2): 438-456 (2015) - [j2]Josef Cibulka, Jirí Matousek, Pavel Paták:
Three-Monotone Interpolation. Discret. Comput. Geom. 54(1): 3-21 (2015) - [j1]Roman N. Karasev, Jan Kyncl, Pavel Paták, Zuzana Patáková, Martin Tancer:
Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex. Discret. Comput. Geom. 54(3): 610-636 (2015) - [c2]Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result. SoCG 2015: 476-490 - [c1]Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, Uli Wagner:
Bounding Helly Numbers via Betti Numbers. SoCG 2015: 507-521 - 2014
- [i2]Josef Cibulka, Jirí Matousek, Pavel Paták:
Three-monotone interpolation. CoRR abs/1404.4731 (2014) - 2013
- [i1]Xavier Goaoc, Pavel Paták, Zuzana Safernová, Martin Tancer, Uli Wagner:
Bounding Helly numbers via Betti numbers. CoRR abs/1310.4613 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
