- Approximability of open k-monopoly problemsmst, 65(5):798-814, 2021. [doi]

- On approximability of optimization problems related to Red/Blue-split graphsTCS, 690:104-113, 2017. [doi]

- Complexity of majority monopoly and signed domination problemsjda, 10:49-60, 2012. [doi]

- On the Maximum Uniquely Restricted Matching for Bipartite Graphsendm, 37:345-350, 2011. [doi]
- The Complexity of König Subgraph Problems and Above-Guarantee Vertex Coveralgorithmica, 61(4):857-881, 2011. [doi]

- On approximability of linear ordering and related NP-optimization problems on graphsDAM, 136(2-3):249-269, 2004. [doi]

- Optimizing register spills for eager functional languagesfgcs, 18(5):699-708, 2002. [doi]