| Publication | Date of Publication | Type |
|---|
| Capacity-insensitive algorithms for online facility assignment problems on a line | 2024-11-13 | Paper |
| Maximally satisfying lower quotas in the hospitals/residents problem with ties | 2024-04-23 | Paper |
| Refined computational complexities of hospitals/residents problem with regional caps | 2024-02-20 | Paper |
| Approximation of coNP sets by NP-complete sets | 2023-12-12 | Paper |
| Marriage and Roommate | 2023-11-16 | Paper |
| Refined computational complexities of hospitals/residents problem with regional caps | 2023-08-10 | Paper |
| Incomplete list setting of the hospitals/residents problem with maximally satisfying lower quotas | 2023-07-28 | Paper |
| Competitive analysis for two variants of online metric matching problem | 2023-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875569 | 2023-02-03 | Paper |
| Strongly Stable and Maximum Weakly Stable Noncrossing Matchings | 2022-10-13 | Paper |
| Competitive analysis for two variants of online metric matching problem | 2022-02-01 | Paper |
| Strongly stable and maximum weakly stable noncrossing matchings | 2021-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5136277 | 2020-11-25 | Paper |
| An improved fixed-parameter algorithm for max-cut parameterized by crossing number | 2020-02-25 | Paper |
| Jointly stable matchings | 2019-06-25 | Paper |
| Improving man-optimal stable matchings by minimum change of preference lists | 2019-03-26 | Paper |
| Improving the competitive ratio of the online OVSF code assignment problem | 2018-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4635972 | 2018-04-23 | Paper |
| Total Stability in Stable Matching Games | 2017-10-17 | Paper |
| A Tight Approximation Bound for the Stable Marriage Problem with Restricted Ties | 2017-08-31 | Paper |
| A 25/17-approximation algorithm for the stable marriage problem with one-sided ties | 2017-05-17 | Paper |
| Competitive buffer management for multi-queue switches in QoS networks using packet buffering algorithms | 2017-05-12 | Paper |
| Better bounds for online \(k\)-frame throughput maximization in network switches | 2016-12-05 | Paper |
| The hospitals/residents problem with lower quotas | 2016-03-23 | Paper |
| Approximability of Two Variants of Multiple Knapsack Problems | 2015-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934607 | 2014-12-18 | Paper |
| Approximation algorithms for the sex-equal stable marriage problem | 2014-09-09 | Paper |
| On the advice complexity of online bipartite matching and online stable marriage | 2014-08-28 | Paper |
| Better Bounds for Online k-Frame Throughput Maximization in Network Switches | 2014-01-14 | Paper |
| Improved approximation bounds for the student-project allocation problem with preferences over projects | 2012-09-13 | Paper |
| The Hospitals/Residents Problem with Quota Lower Bounds | 2011-09-16 | Paper |
| Improved approximation bounds for the student-project allocation problem with preferences over projects | 2011-07-01 | Paper |
| Randomized approximation of the stable marriage problem | 2011-03-18 | Paper |
| Improving the competitive ratios of the seat reservation problem | 2010-10-27 | Paper |
| A 25/17-approximation algorithm for the stable marriage problem with one-sided ties | 2010-09-06 | Paper |
| Weighted nearest neighbor algorithms for the graph exploration problem on cycles | 2010-09-02 | Paper |
| An improved approximation lower bound for finding almost stable maximum matchings | 2010-08-20 | Paper |
| Improved approximation of the stable marriage problem | 2010-03-03 | Paper |
| Approximation Algorithms for the Sex-Equal Stable Marriage Problem | 2009-02-17 | Paper |
| Improving the Competitive Ratio of the Online OVSF Code Assignment Problem | 2009-01-29 | Paper |
| A \((2-c\frac{1}{\sqrt{N}})\)-approximation algorithm for the stable marriage problem | 2008-07-01 | Paper |
| Weighted Nearest Neighbor Algorithms for the Graph Exploration Problem on Cycles | 2008-03-07 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Parallelizing local search for CNF satisfiability using vectorization and PVM | 2005-08-04 | Paper |
| Randomized approximation of the stable marriage problem | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044355 | 2004-08-11 | Paper |
| Approximability results for stable marriage problems with ties. | 2004-03-14 | Paper |
| Online independent sets. | 2003-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766829 | 2002-07-22 | Paper |
| Hard variants of stable marriage. | 2002-07-15 | Paper |
| On the approximability of the stable marriage problem | 2001-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761867 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4511222 | 2000-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938640 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4937225 | 2000-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4253337 | 1999-11-08 | Paper |
