Katarzyna Paluch

Available identifiers

zbMath Open paluch.katarzyna-eMaRDI QIDQ1006381

List of research outcomes

Publication	Date of Publication	Type
Restricted t-Matchings via Half-Edges.	2023-09-20	Paper
The dynamics of rank-maximal and popular matchings	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	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	2019-03-26	Paper
Optimal general matchings	2018-11-22	Paper
Manipulation strategies for the rank-maximal matching problem	2018-10-04	Paper
Characterisation of strongly stable matchings	2018-07-16	Paper
Maximum ATSP with weights zero and one via half-edges	2018-04-12	Paper
A 4/5 -- approximation algorithm for the maximum traveling salesman problem	2017-08-31	Paper
Maximum ATSP with weights zero and one via half-edges	2016-02-26	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
Popular and clan-popular \(b\)-matchings	2014-07-07	Paper
Capacitated Rank-Maximal Matchings	2013-06-07	Paper
Popular and Clan-Popular b-Matchings	2013-03-21	Paper
Simpler approximation of the maximum asymmetric traveling salesman problem	2012-08-23	Paper
Faster and simpler approximation of stable matchings	2012-07-16	Paper
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem	2009-10-28	Paper
An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs	2009-03-24	Paper
A New Approximation Algorithm for Multidimensional Rectangle Tiling	2008-04-24	Paper
STACS 2004	2007-10-01	Paper
Automata, Languages and Programming	2005-08-24	Paper
Automata, Languages and Programming	2005-08-24	Paper
New approximation algorithm for RTILE problem.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q2753741	2001-11-11	Paper
Clique-free t-matchings in degree-bounded graphs	N/A	Paper

Research outcomes over time

This page was built for person: Katarzyna Paluch