| The Complexity of Cake Cutting with Unequal Shares | 0 | 0.34 | 2020 |
| Pareto optimal coalitions of fixed size. | 0 | 0.34 | 2019 |
| The complexity of cake cutting with unequal shares. | 2 | 0.41 | 2018 |
| A Note on Restricted List Edge-Colourings. | 0 | 0.34 | 2018 |
| Complexity of Stability in Trading Networks. | 0 | 0.34 | 2018 |
| Trading Networks with Frictions. | 1 | 0.37 | 2018 |
| Stable Matching with Uncertain Pairwise Preferences. | 4 | 0.45 | 2017 |
| Pareto optimal matchings with lower quotas. | 3 | 0.42 | 2017 |
| Possible and Necessary Allocations Under Serial Dictatorship with Incomplete Preference Lists. | 0 | 0.34 | 2017 |
| On the core and nucleolus of directed acyclic graph games. | 0 | 0.34 | 2017 |
| Coloring signed graphs using DFS. | 2 | 0.41 | 2016 |
| House-swapping with divorcing and engaged pairs. | 0 | 0.34 | 2016 |
| Trading Networks with Bilateral Contracts. | 2 | 0.43 | 2016 |
| Stable matchings of teachers to schools. | 2 | 0.40 | 2015 |
| Choice Function-Based Two-Sided Markets: Stability, Lattice Property, Path Independence And Algorithms | 0 | 0.34 | 2014 |
| On Stable Matchings and Flows | 10 | 0.71 | 2014 |
| Pareto optimality in many-to-many matching problems. | 8 | 0.75 | 2014 |
| Assigning evaluators to research grant applications: the case of Slovak Research and Development Agency. | 1 | 0.34 | 2014 |
| The Nucleolus Of The Bankruptcy Problem By Hydraulic Rationing | 0 | 0.34 | 2012 |
| A matroid approach to stable matchings with lower quotas | 4 | 0.54 | 2012 |
| An algorithm for a super-stable roommates problem. | 1 | 0.35 | 2011 |
| Optimization of an SMD placement machine and flows in parametric networks. | 0 | 0.34 | 2011 |
| The College Admissions problem with lower and common quotas | 39 | 1.78 | 2010 |
| Housing Markets Through Graphs | 3 | 0.55 | 2010 |
| The Stable Roommates Problem with Choice Functions | 0 | 0.34 | 2010 |
| Balanced list edge-colourings of bipartite graphs | 0 | 0.34 | 2010 |
| The integral stable allocation problem on graphs | 1 | 0.35 | 2010 |
| The dynamics of stable matchings and half-matchings for the stable marriage and roommates problems | 8 | 0.57 | 2008 |
| Efficient algorithms for generalized Stable Marriage and Roommates problems | 12 | 0.65 | 2007 |
| On a generalization of the stable roommates problem | 30 | 1.69 | 2005 |
| A constrained independent set problem for matroids | 2 | 0.40 | 2004 |
| A fixed-point approach to stable matchings and some applications | 72 | 5.23 | 2003 |
| On the stable b-matching polytope | 5 | 0.71 | 2003 |
| Note - Uncrossing a Family of Set-Pairs | 4 | 0.55 | 2001 |
| A Matroid Generalization of the Stable Matching Polytope | 5 | 0.57 | 2001 |
| The Size of 3-Cross-Free Families | 5 | 1.44 | 2001 |
| Upper Bounds on the Maximal Number of Facets of 0/1-Polytopes | 9 | 1.97 | 2000 |
| Cycle bases for lattices of binary matroids with no Fano dual Minor and their one-element extensions | 1 | 0.42 | 1999 |
| Coverings and structure of crossing families | 2 | 0.42 | 1999 |
| Covering A Symmetric Poset By Symmetric Chains | 3 | 0.50 | 1997 |
