Katarzyna E. Paluch

According to our database, Katarzyna E. Paluch authored at least 30 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Clique-free t-matchings in degree-bounded graphs.

Katarzyna E. Paluch, Mateusz Wasylkiewicz

CoRR, 2024

Rectangle Tiling Binary Arrays.

Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch

Proceedings of the Approximation, 2024

2023

The dynamics of rank-maximal and popular matchings.

Pratik Ghosal, Adam Kunysz, Katarzyna Paluch

Theor. Comput. Sci., September, 2023

Triangle-free 2-matchings.

Katarzyna Paluch

CoRR, 2023

2021

A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges.

Katarzyna Paluch, Mateusz Wasylkiewicz

Inf. Process. Lett., 2021

Restricted t-Matchings via Half-Edges.

Katarzyna Paluch, Mateusz Wasylkiewicz

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2020

New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.

Katarzyna Paluch

CoRR, 2020

2018

Maximum ATSP with Weights Zero and One via Half-Edges.

Katarzyna E. Paluch

Theory Comput. Syst., 2018

Optimal General Matchings.

Szymon Dudycz, Katarzyna Paluch

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018

New Approximation Algorithms for (1, 2)-TSP.

Anna Adamaszek, Matthias Mnich, Katarzyna Paluch

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

Manipulation Strategies for the Rank-Maximal Matching Problem.

Pratik Ghosal, Katarzyna E. Paluch

Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017

A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem.

Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki

Proceedings of the Integer Programming and Combinatorial Optimization, 2017

2016

Characterisation of Strongly Stable Matchings.

Adam Kunysz, Katarzyna E. Paluch, Pratik Ghosal

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

2015

Balanced matchings, unbalanced ones and related problems.

Katarzyna E. Paluch

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Popular and clan-popular b-matchings.

Katarzyna E. Paluch

Theor. Comput. Sci., 2014

Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring.

Katarzyna E. Paluch

CoRR, 2014

Faster and Simpler Approximation of Stable Matchings.

Katarzyna E. Paluch

Algorithms, 2014

2013

Capacitated Rank-Maximal Matchings.

Katarzyna E. Paluch

Proceedings of the Algorithms and Complexity, 8th International Conference, 2013

2012

Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem.

Katarzyna E. Paluch, Khaled M. Elbassioni, Anke van Zuylen

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

2011

Popular b-matchings

Katarzyna E. Paluch

CoRR, 2011

2009

A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem.

Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry

Proceedings of the Approximation, 2009

2008

An [(<i>O</i>)\tilde](<i>m</i>²<i>n</i>)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Algorithmica, 2008

2007

Strongly stable matchings in time <i>O</i>(<i>nm</i>) and extension to the hospitals-residents problem.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

ACM Trans. Algorithms, 2007

2006

Rank-maximal matchings.

Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

ACM Trans. Algorithms, 2006

A New Approximation Algorithm for Multidimensional Rectangle Tiling.

Katarzyna E. Paluch

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2004

Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Proceedings of the STACS 2004, 2004

A 2(1/8)-Approximation Algorithm for Rectangle Tiling.

Katarzyna E. Paluch

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

A Faster Algorithm for Minimum Cycle Basis of Graphs.

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch

Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003

New approximation algorithm for RTILE problem.

Krzysztof Lorys, Katarzyna E. Paluch

Theor. Comput. Sci., 2003

2000

Rectangle tiling.

Krzysztof Lorys, Katarzyna E. Paluch

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000