Publications
- On the Hardness of Switching to a Small Number of Edges2016 | Faculty of Mathematics and Physics
- On Switching to H-Free Graphs +22014 | 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
- Three NP-Complete Optimization Problems in Seidel's Switching +12008 | Faculty of Mathematics and Physics
- The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree +12013 | Faculty of Mathematics and Physics
- The Möbius function of separable and decomposable permutations2011 | Faculty of Mathematics and Physics
- An efficient implementation of the equilibrium algorithm for housing markets with duplicate houses2011 | Faculty of Mathematics and Physics
- Pattern avoidance in partial permutations2011 | Faculty of Mathematics and Physics
- Approximability of Economic Equilibrium for Housing Markets with Duplicate Houses2011 | Faculty of Mathematics and Physics
Loading network view...