- d-collapsibility is NP complete for d greater or equal to 42010 | Faculty of Mathematics and Physics
- On the Computational Complexity of the L(2,1)-Labeling Problem for Regular Graphs +12005 | Faculty of Mathematics and Physics
- Computing the branchwidth of interval graphs2005 | Faculty of Mathematics and Physics
- On the computation of the hull number of a graph2009 | Faculty of Mathematics and Physics
- Interval Representations of Boolean Functions2007 | Faculty of Mathematics and Physics
- Hardness of Embedding Simplicial Complexes in R^d2009 | Faculty of Mathematics and Physics