| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6146254 | 2024-02-05 | Paper |
| Popular Roommates in Simply Exponential Time. | 2023-02-03 | Paper |
| Popular Branchings and Their Dual Certificates | 2022-10-14 | Paper |
| Popular Matchings in Complete Graphs | 2022-07-21 | Paper |
| Popular Matchings: Good, Bad, and Mixed (Invited Talk) | 2022-07-21 | Paper |
| Quasi-Popular Matchings, Optimality, and Extended Formulations | 2022-05-17 | Paper |
| Popular branchings and their dual certificates | 2022-03-22 | Paper |
| Understanding Popular Matchings via Stable Matchings | 2022-02-09 | Paper |
| A Little Charity Guarantees Almost Envy-Freeness | 2021-09-10 | Paper |
| Popularity, Mixed Matchings, and Self-Duality | 2021-07-15 | Paper |
| Popular matchings in complete graphs | 2021-04-19 | Paper |
| Quasi-popular Matchings, Optimality, and Extended Formulations | 2021-02-02 | Paper |
| A Little Charity Guarantees Almost Envy-Freeness | 2021-02-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136309 | 2020-11-25 | Paper |
| Popular Matchings and Limits to Tractability | 2019-10-15 | Paper |
| Upper neighbours of Čech closure operators | 2019-06-24 | Paper |
| Two problems in max-size popular matchings | 2019-05-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743383 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743485 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4614345 | 2019-01-31 | Paper |
| Popular matchings of desired size | 2018-11-22 | Paper |
| Popular edges and dominant matchings | 2018-10-26 | Paper |
| Distributed construction of purely additive spanners | 2018-08-16 | Paper |
| Popularity, Mixed Matchings, and Self-duality | 2018-07-16 | Paper |
| Distributed construction of purely additive spanners | 2018-06-01 | Paper |
| Lattice of generalized closure operators | 2018-03-01 | Paper |
| New pairwise spanners | 2018-02-01 | Paper |
| Popular Half-Integral Matchings. | 2017-12-19 | Paper |
| Popular Matchings with Two-Sided Preferences and One-Sided Ties | 2017-10-24 | Paper |
| New Algorithms for Maximum Weight Matching and a Decomposition Theorem | 2017-06-02 | Paper |
| Fair Matchings and Related Problems | 2017-02-21 | Paper |
| On Pairwise Spanners | 2017-01-30 | Paper |
| New Pairwise Spanners | 2017-01-24 | Paper |
| Group of closure isomorphisms of Cech closure spaces | 2017-01-19 | Paper |
| Popular edges and dominant matchings | 2016-08-10 | Paper |
| Fair matchings and related problems | 2016-04-06 | Paper |
| Improved approximation algorithms for two variants of the stable marriage problem with ties | 2015-12-09 | Paper |
| Small Stretch Pairwise Spanners and Approximate $D$-Preservers | 2015-11-18 | Paper |
| Maintaining Near-Popular Matchings | 2015-11-04 | Paper |
| Popular Matchings with Two-Sided Preferences and One-Sided Ties | 2015-10-27 | Paper |
| Rank-maximal matchings | 2015-09-02 | Paper |
| Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501244 | 2015-08-03 | Paper |
| Dynamic matrix rank with partial lookahead | 2015-02-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934590 | 2014-12-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921697 | 2014-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2921727 | 2014-10-13 | Paper |
| Cycle bases in graphs characterization, algorithms, complexity, and applications | 2014-10-07 | Paper |
| Additive spanners and (α, β)-spanners | 2014-09-09 | Paper |
| Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance | 2014-09-09 | Paper |
| Popularity at minimum cost | 2014-06-24 | Paper |
| A Size-Popularity Tradeoff in the Stable Marriage Problem | 2014-06-04 | Paper |
| An Improved Approximation Algorithm for the Stable Marriage Problem with One-Sided Ties | 2014-06-02 | Paper |
| An improved heuristic for computing short integral cycle bases | 2014-04-01 | Paper |
| Small Stretch Pairwise Spanners | 2013-08-06 | Paper |
| Near-Popular Matchings in the Roommates Problem | 2013-06-27 | Paper |
| Popular matchings in the stable marriage problem | 2013-06-06 | Paper |
| Dynamic matrix rank with partial lookahead | 2012-10-19 | Paper |
| Max-coloring paths: tight bounds and extensions | 2012-10-01 | Paper |
| Faster algorithms for all-pairs small stretch distances in weighted graphs | 2012-04-26 | Paper |
| Properties of Gomory-Hu co-cycle bases | 2012-03-13 | Paper |
| Bounded unpopularity matchings | 2011-11-07 | Paper |
| Near-Popular Matchings in the Roommates Problem | 2011-09-16 | Paper |
| Popular Matchings in the Stable Marriage Problem | 2011-07-06 | Paper |
| Popular mixed matchings | 2011-06-07 | Paper |
| Voting Paths | 2011-04-15 | Paper |
| Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs | 2011-04-04 | Paper |
| New approximation algorithms for minimum cycle bases of graphs | 2011-03-30 | Paper |
| Isoperimetric Inequalities and the Width Parameters of Graphs | 2011-03-18 | Paper |
| Popular matchings with variable item copies | 2011-03-14 | Paper |
| Popularity at minimum cost | 2010-12-09 | Paper |
| Assigning papers to referees | 2010-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579486 | 2010-08-06 | Paper |
| Optimal popular matchings | 2010-04-28 | Paper |
| Max-Coloring Paths: Tight Bounds and Extensions | 2009-12-17 | Paper |
| Popular Matchings with Variable Job Capacities | 2009-12-17 | Paper |
| Faster Algorithms for Minimum Cycle Basis in Directed Graphs | 2009-08-20 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Popular Mixed Matchings | 2009-07-14 | Paper |
| An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs | 2009-03-24 | Paper |
| A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs | 2009-03-12 | Paper |
| An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs | 2009-01-05 | Paper |
| Faster Algorithms for Incremental Topological Ordering | 2008-08-28 | Paper |
| Popular Matchings | 2008-08-14 | Paper |
| Bounded Unpopularity Matchings | 2008-07-15 | Paper |
| On a Special Co-cycle Basis of Graphs | 2008-07-15 | Paper |
| Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs | 2008-04-24 | Paper |
| Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems | 2008-04-24 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| Dynamic Matching Markets and Voting Paths | 2007-09-07 | Paper |
| New Approximation Algorithms for Minimum Cycle Bases of Graphs | 2007-09-03 | Paper |
| Linear time algorithms for Abelian group isomorphism and related problems | 2007-08-23 | Paper |
| Algorithms to compute minimum cycle basis in directed graphs | 2007-08-23 | Paper |
| The carvingwidth of hypercubes | 2006-10-19 | Paper |
| The treewidth and pathwidth of hypercubes | 2006-03-29 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| STACS 2005 | 2005-12-02 | Paper |
| Lower bounds for adaptive locally decodable codes | 2005-11-15 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| An algorithm for computing a convex and simple path of bounded curvature in a simple polygon | 2002-09-25 | Paper |
