Katarzyna E. Paluch

activity

20082020

most citedA 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem

49 citations · 71 across the 10 of their papers we have counts for

collaborators

Showing 2017Show all

3 papers · 1 filter

cs.DS2017

Manipulation Strategies for the Rank Maximal Matching Problem

Pratik Ghosal, Katarzyna Paluch

We consider manipulation strategies for the rank-maximal matching problem. In the rank-maximal matching problem we are given a bipartite graph $G = (A \cup P, E)$ such that $A$ den…

cs.DS2017★ 2 cited

Optimal General Matchings

Szymon Dudycz, Katarzyna Paluch

Given a graph $G = (V, E)$ and for each vertex $v \in V$ a subset $B (v)$ of the set ${0, 1, \dots, d_{G} (v)}$ a $B$ -matching of $G$ is any set $F \subseteq E$ such that $d_F(v) \in B(v…

cs.DS2017★ 2 cited

The Dynamics of Rank-Maximal and Popular Matchings

Pratik Ghosal, Adam Kunysz, Katarzyna Paluch

Given a bipartite graph, where the two sets of vertices are applicants and posts and ranks on the edges represent preferences of applicants over posts, a {\em rank-maximal} matchin…