49 citations · 71 across the 10 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.DS2020
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
Katarzyna Paluch, Mateusz Wasylkiewicz
We consider three variants of the problem of finding a maximum weight restricted -matching in a subcubic graph . (A -matching is any subset of the edges such that each ver…
cs.CG2020
Rectangle Tiling Binary Arrays
Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch
The problem of rectangle tiling binary arrays is defined as follows. Given an array of zeros and ones and a natural number , our task is to partition into a…
cs.DS2020
New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring
Katarzyna Paluch
In the maximum asymmetric traveling salesman problem (Max ATSP) we are given a complete directed graph with nonnegative weights on the edges and we wish to compute a traveling sale…