- Shellability is NP-complete +12018 | Faculty of Mathematics and Physics
- Recognition of Collapsible Complexes is NP-Complete2016 | Faculty of Mathematics and Physics
- Switching to Hedgehog-Free Graphs is NP-Complete2011 | Faculty of Mathematics and Physics
- Three NP-Complete Optimization Problems in Seidel's Switching +12008 | Faculty of Mathematics and Physics
- d-collapsibility is NP-complete for d greater or equal to 42009 | Faculty of Mathematics and Physics
- Recognition of Polygon-circle Graphs and Graphs of Interval Filaments is NP-complete +12007 | Faculty of Mathematics and Physics
- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-complete +12007 | Faculty of Mathematics and Physics
- L(2,1,1)-Labeling Is NP-Complete for Trees2010 | Faculty of Mathematics and Physics
- d-collapsibility is NP complete for d greater or equal to 42010 | Faculty of Mathematics and Physics
- NP-completeness of the edge precoloring extension problem on bipartite graphs2003 | Faculty of Mathematics and Physics
- Probabilistic proofs and NP-completeness (A course on the PCP theorem and its consequences)Publication without faculty affiliation
- A special planar statifiability problem and some consequences of its NP-completeness1994 | Publication without faculty affiliation
- On the Complexity of Planar Covering of Small Graphs2011 | Faculty of Mathematics and Physics
- The complexity of the partial order dimension problem: Closing the gap2017 | Faculty of Mathematics and Physics
- General Caching Is Hard: Even with Small Pages2015 | Faculty of Mathematics and Physics
- Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata2017 | Faculty of Mathematics and Physics
- Testing Planarity of Partially Embedded Graphs2010 | Faculty of Mathematics and Physics
- Two complexity results on c-optimality in experimental design2012 | Faculty of Mathematics and Physics
- Complexity of necessary efficiency in interval linear programming and multiobjective linear programming2012 | Faculty of Mathematics and Physics
- Can They Cross? And How? (The Hitchhiker''s Guide to the Universe of Geometric Intersection Graphs)2011 | Faculty of Mathematics and Physics
- Eckhardt, Stefan; Kosub, Sven; Maaß, Moritz G.; Täubig, Hanjo; Wernicke, Sebastian: Combinatorial network abstraction by trees and distances2010 | Faculty of Mathematics and Physics
- Graph isomorphism restricted by lists2021 | Faculty of Mathematics and Physics
- Upward Point Set Embeddings of Paths and Trees2021 | Faculty of Mathematics and Physics
- Irreversible 2-conversion set in graphs of bounded degree2017 | Faculty of Mathematics and Physics
- On Edge Intersection Graphs of Paths with 2 Bends2016 | Faculty of Mathematics and Physics
- IV-matching is strongly NP-hard2017 | Faculty of Mathematics and Physics