| Publication | Date of Publication | Type |
|---|
| Parameterized complexity of untangling knots | 2024-06-24 | Paper |
Embeddings of \(k\)-complexes into \(2k\)-manifolds
Discrete & Computational Geometry | 2024-04-02 | Paper |
Weak saturation of multipartite hypergraphs
Combinatorica | 2024-01-25 | Paper |
| scientific article; zbMATH DE number 7760191 (Why is no real title available?) | 2023-11-02 | Paper |
| Simpler algorithmically unrecognizable 4-manifolds | 2023-10-11 | Paper |
NP-Hardness of Computing PL Geometric Category in Dimension 2
SIAM Journal on Discrete Mathematics | 2023-09-27 | Paper |
Barycentric cuts through a convex body
Discrete & Computational Geometry | 2022-12-08 | Paper |
| Shellability is hard even for balls | 2022-11-15 | Paper |
| scientific article; zbMATH DE number 7559249 (Why is no real title available?) | 2022-07-18 | Paper |
| Parameterized complexity of untangling knots | 2021-11-09 | Paper |
Shellings and sheddings induced by collapses
SIAM Journal on Discrete Mathematics | 2021-09-17 | Paper |
The unbearable hardness of unknotting
Advances in Mathematics | 2021-03-10 | Paper |
The unbearable hardness of unknotting
Advances in Mathematics | 2021-03-10 | Paper |
Even maps, the Colin de Verdière number and representations of graphs
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Embeddability in \(R^3\) is NP-hard
Journal of the ACM | 2020-11-11 | Paper |
| Optimal bounds for the colorful fractional Helly theorem | 2020-10-29 | Paper |
| Shellability is NP-complete | 2020-08-18 | Paper |
On Betti numbers of flag complexes with forbidden induced subgraphs
Mathematical Proceedings of the Cambridge Philosophical Society | 2020-08-16 | Paper |
Shellability is NP-complete
Journal of the ACM | 2020-02-11 | Paper |
Shellability is NP-complete
Journal of the ACM | 2020-02-11 | Paper |
On the growth of the Möbius function of permutations
Journal of Combinatorial Theory. Series A | 2019-11-27 | Paper |
Even maps, the Colin de~Verdi\`ere number and representations of graphs
(available as arXiv preprint) | 2019-07-11 | Paper |
| scientific article; zbMATH DE number 7051255 (Why is no real title available?) | 2019-05-06 | Paper |
Hardness of almost embedding simplicial complexes in \(\mathbb {R}^d\)
Discrete & Computational Geometry | 2019-01-29 | Paper |
Pach's selection theorem does not admit a topological extension
Discrete & Computational Geometry | 2018-10-30 | Paper |
Pach's selection theorem does not admit a topological extension
Discrete & Computational Geometry | 2018-10-30 | Paper |
Embeddability in the 3-sphere is decidable
Journal of the ACM | 2018-08-02 | Paper |
Embeddability in the 3-sphere is decidable
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
| Embeddability in \(\mathbb R^3\) is NP-hard | 2018-03-15 | Paper |
Embeddability in \(\mathbb R^3\) is NP-hard
(available as arXiv preprint) | 2018-03-15 | Paper |
Bounding Helly numbers via Betti numbers
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
| Shortest path embeddings of graphs on surfaces | 2018-01-30 | Paper |
Shortest path embeddings of graphs on surfaces
Discrete & Computational Geometry | 2018-01-11 | Paper |
Shortest path embeddings of graphs on surfaces
Discrete & Computational Geometry | 2018-01-11 | Paper |
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
Israel Journal of Mathematics | 2017-12-22 | Paper |
A Direct Proof of the Strong Hanani-Tutte Theorem on the Projective Plane
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
On generalized Heawood inequalities for manifolds: a van Kampen-Flores-type nonembeddability result
(available as arXiv preprint) | 2017-10-10 | Paper |
Bounding Helly numbers via Betti numbers
(available as arXiv preprint) | 2017-10-10 | Paper |
Simplifying Inclusion–Exclusion Formulas
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
$d$-representability of simplicial complexes of fixed dimension
(available as arXiv preprint) | 2017-03-09 | Paper |
A direct proof of the strong Hanani-Tutte theorem on the projective plane
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Untangling two systems of noncrossing curves
Israel Journal of Mathematics | 2016-07-22 | Paper |
Recognition of collapsible complexes is NP-complete
Discrete & Computational Geometry | 2016-02-29 | Paper |
Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
Discrete & Computational Geometry | 2015-10-14 | Paper |
Bounds for Pach's selection theorem and for the minimum solid angle in a simplex
Discrete & Computational Geometry | 2015-10-14 | Paper |
| scientific article; zbMATH DE number 6470115 (Why is no real title available?) | 2015-08-05 | Paper |
Shellability of the higher pinched Veronese posets
Journal of Algebraic Combinatorics | 2014-11-19 | Paper |
Non-embeddability of geometric lattices and buildings
Discrete & Computational Geometry | 2014-09-12 | Paper |
| Simplifying inclusion-exclusion formulas | 2014-06-11 | Paper |
\(d\)-collapsibility is NP-complete for \(d \geq 4\)
Chicago Journal of Theoretical Computer Science | 2014-05-06 | Paper |
Untangling two systems of noncrossing curves
Lecture Notes in Computer Science | 2013-12-20 | Paper |
Nerves of good covers are algorithmically unrecognizable
SIAM Journal on Computing | 2013-11-14 | Paper |
\(D\)-collapsibility is NP-complete for \(d \geq 4\)
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Intersection Patterns of Convex Sets via Simplicial Complexes: A Survey
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
A geometric proof of the colored Tverberg theorem
Discrete & Computational Geometry | 2012-03-01 | Paper |
A counterexample to Wegner's conjecture on good covers
Discrete & Computational Geometry | 2012-03-01 | Paper |
Hardness of embedding simplicial complexes in \(\mathbb R^d\)
Journal of the European Mathematical Society (JEMS) | 2011-01-28 | Paper |
Non-representability of finite projective planes by convex sets
Proceedings of the American Mathematical Society | 2010-09-27 | Paper |
Backbone colorings and generalized Mycielski graphs
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Backbone colorings of graphs with bounded degree
Discrete Applied Mathematics | 2010-05-05 | Paper |
Injective colorings of planar graphs with few colors
Discrete Mathematics | 2009-12-15 | Paper |
Note: Combinatorial Alexander duality -- a short and elementary proof
Discrete & Computational Geometry | 2009-12-14 | Paper |
Dimension gaps between representability and collapsibility
Discrete & Computational Geometry | 2009-12-14 | Paper |
The maximum piercing number for some classes of convex sets with the \((4,3)\)-property
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
The maximum piercing number for some classes of convex sets with the \((4,3)\)-property
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
List-Coloring Squares of Sparse Subcubic Graphs
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
Construction of Large Graphs with No Optimal Surjective L(2,1)-Labelings
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
An engine breaking the \(\Omega\)EP-property
Topology and its Applications | 2007-01-09 | Paper |
Pach's animal problem within the bounding box
(available as arXiv preprint) | N/A | Paper |
