| Publication | Date of Publication | Type |
|---|
Parameterized complexity of submodular minimization under uncertainty
Journal of Computer and System Sciences | 2026-06-11 | Paper |
| Parameterized complexity of submodular minimization under uncertainty | 2025-12-02 | Paper |
| Shortest two disjoint paths in conservative graphs | 2025-11-10 | Paper |
The core of housing markets from an agent's perspective: is it worth sprucing up your home?
Mathematics of Operations Research | 2025-09-30 | Paper |
Popular arborescences and their matroid generalization
ACM Transactions on Algorithms | 2025-07-22 | Paper |
Maximum-utility popular matchings with bounded instability
ACM Transactions on Computation Theory | 2025-04-23 | Paper |
Odd paths, cycles, and T-joins: connections and algorithms
SIAM Journal on Discrete Mathematics | 2025-03-04 | Paper |
| Arborescences, colorful forests, and popularity | 2024-11-28 | Paper |
Shortest odd paths in undirected graphs with conservative weight functions
Discrete Applied Mathematics | 2024-09-26 | Paper |
| The popular assignment problem: when cardinality is more important than popularity | 2024-07-19 | Paper |
Computational complexity of necessary envy-freeness
Mathematical Social Sciences | 2024-04-09 | Paper |
Recognizing when a preference system is close to admitting a master list
Theoretical Computer Science | 2024-03-28 | Paper |
Recognizing when a preference system is close to admitting a master list
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Complexity of stability in trading networks
International Journal of Game Theory | 2023-09-25 | Paper |
| Odd Paths, Cycles and T-joins: Connections and Algorithms | 2022-11-23 | Paper |
Popular branchings and their dual certificates
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
The core of housing markets from an agent's perspective: Is it worth sprucing up your home?
(available as arXiv preprint) | 2022-07-06 | Paper |
Popular branchings and their dual certificates
Mathematical Programming. Series A. Series B | 2022-03-22 | Paper |
Obtaining a proportional allocation by deleting items
Algorithmica | 2021-04-19 | Paper |
Stable matchings with covering constraints: a complete computational trichotomy
Algorithmica | 2020-04-01 | Paper |
Correction to: ``A connection between sports and matroids: how many teams can we beat?''
Algorithmica | 2019-01-11 | Paper |
| Possible and necessary allocations under serial dictatorship with incomplete preference lists | 2018-10-25 | Paper |
Obtaining a proportional allocation by deleting items
Algorithmic Decision Theory | 2018-10-25 | Paper |
A connection between sports and matroids: how many teams can we beat?
Algorithmica | 2018-02-28 | Paper |
Stable marriage with covering constraints -- a complete computational trichotomy
(available as arXiv preprint) | 2018-02-13 | Paper |
Campaign management under approval-driven voting rules
Algorithmica | 2017-03-06 | Paper |
Campaign management under approval-driven voting rules
Algorithmica | 2017-03-06 | Paper |
Refining the complexity of the sports elimination problem
Discrete Applied Mathematics | 2015-12-10 | Paper |
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
Journal of Discrete Algorithms | 2015-02-13 | Paper |
Stable matching with couples: an empirical study
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Parameterized complexity of Eulerian deletion problems
Algorithmica | 2014-03-25 | Paper |
Cleaning interval graphs
Algorithmica | 2013-03-05 | Paper |
Bin packing with fixed number of bins revisited
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Multivariate complexity analysis of Swap Bribery
Algorithmica | 2012-11-21 | Paper |
Stable assignment with couples: parameterized complexity and local search
Discrete Optimization | 2012-10-16 | Paper |
Obtaining a planar graph by vertex deletion
Algorithmica | 2012-04-26 | Paper |
Parameterized complexity of Eulerian deletion problems
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
Computing the Deficiency of Housing Markets with Duplicate Houses
Parameterized and Exact Computation | 2010-12-07 | Paper |
Multivariate complexity analysis of swap bribery
Parameterized and Exact Computation | 2010-12-07 | Paper |
Parameterized complexity of the arc-preserving subsequence problem
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Parameterized complexity and local search approaches for the stable marriage problem with ties
Algorithmica | 2010-10-07 | Paper |
Bin packing with fixed number of bins revisited
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Parameterized graph cleaning problems
Discrete Applied Mathematics | 2010-04-28 | Paper |
Stable assignment with couples: parameterized complexity and local search
Parameterized and Exact Computation | 2010-01-14 | Paper |
Parameterized Graph Cleaning Problems
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Obtaining a Planar Graph by Vertex Deletion
Graph-Theoretic Concepts in Computer Science | 2008-07-01 | Paper |
