- Some Parameterized Problems Related to Seidel's Switching +22007 | Faculty of Mathematics and Physics
- Three NP-Complete Optimization Problems in Seidel's Switching +12008 | Faculty of Mathematics and Physics
- Complexity of hypergraph coloring and Seidel's switching2003 | Faculty of Mathematics and Physics
- Parameterized Problems Related to Seidel''s Switching2011 | Faculty of Mathematics and Physics
- Switching to Hedgehog-Free Graphs is NP-Complete2011 | Faculty of Mathematics and Physics
- On the Hardness of Switching to a Small Number of Edges2016 | Faculty of Mathematics and Physics
- On Switching to H-Free Graphs2014 | Faculty of Mathematics and Physics