| Publication | Date of Publication | Type |
|---|
| Restricted t-Matchings via Half-Edges. | 2023-09-20 | Paper |
The dynamics of rank-maximal and popular matchings
Theoretical Computer Science | 2023-09-07 | Paper |
| New approximation algorithms for \((1,2)\)-TSP | 2021-07-28 | Paper |
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
Information Processing Letters | 2021-06-16 | Paper |
| New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring | 2020-05-21 | Paper |
Faster and simpler approximation of stable matchings
Algorithms | 2019-03-26 | Paper |
Optimal general matchings
(available as arXiv preprint) | 2018-11-22 | Paper |
Manipulation strategies for the rank-maximal matching problem
(available as arXiv preprint) | 2018-10-04 | Paper |
Characterisation of strongly stable matchings
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Maximum ATSP with weights zero and one via half-edges
Theory of Computing Systems | 2018-04-12 | Paper |
A 4/5 -- approximation algorithm for the maximum traveling salesman problem
(available as arXiv preprint) | 2017-08-31 | Paper |
Maximum ATSP with weights zero and one via half-edges
Lecture Notes in Computer Science | 2016-02-26 | Paper |
Rank-maximal matchings
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| scientific article; zbMATH DE number 6469133 (Why is no real title available?) | 2015-08-03 | Paper |
Popular and clan-popular \(b\)-matchings
Theoretical Computer Science | 2014-07-07 | Paper |
Capacitated Rank-Maximal Matchings
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Popular and Clan-Popular b-Matchings
Algorithms and Computation | 2013-03-21 | Paper |
| Simpler approximation of the maximum asymmetric traveling salesman problem | 2012-08-23 | Paper |
Faster and simpler approximation of stable matchings
Approximation and Online Algorithms | 2012-07-16 | Paper |
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-10-28 | Paper |
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs
Algorithmica | 2009-03-24 | Paper |
A New Approximation Algorithm for Multidimensional Rectangle Tiling
Algorithms and Computation | 2008-04-24 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
New approximation algorithm for RTILE problem.
Theoretical Computer Science | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1670543 (Why is no real title available?) | 2001-11-11 | Paper |
Clique-free t-matchings in degree-bounded graphs
(available as arXiv preprint) | N/A | Paper |
