I’ve participated in many Matchings with Preferences (MATCH-UP) conferences. In MATCH-UP 2015, I gave an invited talk on Fair Stable Matchings, summarizing my contributions up to that point. I was also a program committee member of MATCH-UP 2019, 2022 and 2024.

Together with Jiehua Chen (TU Wien), David Manlove (University of Glasgow) and Ildi Schlotter (HUN-REN KRTK – Budapest), we organized the Dagstuhl Seminar 25342 on Frontiers of Parameterized Algorithmics of Matching under Preferences in August 2025. I gave a survey talk on The Structure of Stable Matchings.

• Stable Matchings with Restricted Preferences: Structure and Complexity.  With W. Rosenbaum.  ACM Transactions on Economics and Computation,  Vol 18 (2023), Article No. 13, pp 1 – 45.  Preliminary version appeared in EC ’21:  Proceedings of the 22nd ACM Conference on Economics and Computation, July 2021, pages 319-339.
• On the Stable Matchings that can be Reached When the Agents Go Marching in One by One.  SIAM Journal on Discrete Mathematics 30(4) (2016), pp. 2047-2063.
• Eccentricity, Center and Radius Computations on the Cover Graphs of Distributive Lattices with Applications to Stable Matchings.  With E. McDermid and I. Suzuki. Discrete Applied Mathematics 205 (2016) pp. 27-34.    A preliminary version of the paper is The center stable matchings and the centers of cover graphs of distributive lattices, ICALP 2011.
• Maximum Locally Stable Matchings. With E. McDermid. Algorithms 2013, 6(3) 383-395.  A preliminary version of the paper appeared in MATCH-UP 2012.
• Stable Roommates Matchings, Mirror Posets, Median Graphs and the Local/Global Median Phenomenon in Stable Matchings.  With A. Lin. SIAM Journal on Discrete Mathematics 25:1 (2011) pp. 72-94.
• Understanding the Generalized Median Stable Matchings, Algorithmica 58:1 (2010) pp. 34-51.  A preliminary version of the paper is The Generalized Median Stable Matchings: finding them is not that easy, LATIN 2008, LNCS Vol. 4957, pp. 568-579.
• A Unified Approach to Finding Good Stable Matchings in the Hospitals/Residents Setting. With E. McDermid and I. Suzuki. Theoretical Computer Science 400:1-3 (2008) pp. 84-99.
• Hardness Results on the Man-Exchange Stable Marriage Problem with Short Preference Lists. With E. McDermid and I. Suzuki. Information Processing Letters 101:1 (2007) pp. 13-19.

It may seem strange that these papers are related to Stable Matchings – but they are!  The ideas came about from my work in the field, especially the connection between mirror posets and median graphs. Mirror posets play a prominent role in describing the stable matchings of a solvable stable roommates problem.

• A Poset-based Approach to Embedding Median Graphs in Hypercubes and Lattices, Order 29 (2012), pp. 147-163. 
• Weak Sense of Direction Labelings and Graph Embeddings, with I. Suzuki. Discrete Applied Mathematics 159 (2011), pp. 303-310.