default search action
Katarzyna E. Paluch 0001
Person information
- affiliation: University of Wroclaw, Poland
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
Other persons with the same name
- Katarzyna Paluch 0002
— Polish Academy of Sciences, Nencki Institute of Experimental Biology, Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c19]Pratik Ghosal, Syed Mohammad Meesum, Katarzyna Paluch:
Rectangle Tiling Binary Arrays. APPROX/RANDOM 2024: 28:1-28:17 - [i16]Katarzyna E. Paluch, Mateusz Wasylkiewicz:
Clique-free t-matchings in degree-bounded graphs. CoRR abs/2405.00429 (2024) - 2023
- [j9]Pratik Ghosal
The dynamics of rank-maximal and popular matchings. Theor. Comput. Sci. 972: 114083 (2023) - [i15]Katarzyna Paluch:
Triangle-free 2-matchings. CoRR abs/2311.13590 (2023) - 2021
- [j8]Katarzyna Paluch, Mateusz Wasylkiewicz
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges. Inf. Process. Lett. 171: 106146 (2021) - [c18]Katarzyna Paluch, Mateusz Wasylkiewicz:
Restricted t-Matchings via Half-Edges. ESA 2021: 73:1-73:17 - 2020
- [i14]Katarzyna Paluch:
New Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring. CoRR abs/2005.10800 (2020) - [i13]Pratik Ghosal
Rectangle Tiling Binary Arrays. CoRR abs/2007.14142 (2020) - [i12]Katarzyna Paluch, Mateusz Wasylkiewicz:
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges. CoRR abs/2012.15775 (2020)
2010 – 2019
- 2018
- [j7]Katarzyna E. Paluch
Maximum ATSP with Weights Zero and One via Half-Edges. Theory Comput. Syst. 62(2): 319-336 (2018) - [c17]Pratik Ghosal
Manipulation Strategies for the Rank-Maximal Matching Problem. COCOON 2018: 316-327 - [c16]Anna Adamaszek, Matthias Mnich
New Approximation Algorithms for (1, 2)-TSP. ICALP 2018: 9:1-9:14 - [c15]Szymon Dudycz
Optimal General Matchings. WG 2018: 176-189 - 2017
- [c14]Szymon Dudycz
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. IPCO 2017: 173-185 - [i11]Pratik Ghosal
The Dynamics of Rank-Maximal and Popular Matchings. CoRR abs/1703.10594 (2017) - [i10]Szymon Dudycz, Katarzyna E. Paluch:
Optimal General Matchings. CoRR abs/1706.07418 (2017) - [i9]Pratik Ghosal, Katarzyna E. Paluch:
Manipulation Strategies for the Rank Maximal Matching Problem. CoRR abs/1710.11462 (2017) - 2016
- [c13]Adam Kunysz, Katarzyna E. Paluch
Characterisation of Strongly Stable Matchings. SODA 2016: 107-119 - 2015
- [c12]Katarzyna E. Paluch
Maximum ATSP with Weights Zero and One via Half-Edges. WAOA 2015: 25-34 - [i8]Katarzyna E. Paluch:
Balanced matchings, unbalanced ones and related problems. CTW 2015: 269-272 - [i7]Pratik Ghosal, Adam Kunysz, Katarzyna E. Paluch:
Characterisation of Strongly Stable Matchings. CoRR abs/1506.00677 (2015) - [i6]Szymon Dudycz, Jan Marcinkowski, Katarzyna E. Paluch, Bartosz Rybicki:
A 4/5 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR abs/1512.09236 (2015) - 2014
- [j6]Katarzyna E. Paluch
Faster and Simpler Approximation of Stable Matchings. Algorithms 7(2): 189-202 (2014) - [j5]Katarzyna E. Paluch
Popular and clan-popular b-matchings. Theor. Comput. Sci. 544: 3-13 (2014) - [i5]Katarzyna E. Paluch:
Better Approximation Algorithms for Maximum Asymmetric Traveling Salesman and Shortest Superstring. CoRR abs/1401.3670 (2014) - [i4]Katarzyna E. Paluch:
Maximum ATSP with Weights Zero and One via Half-Edges. CoRR abs/1408.1431 (2014) - 2013
- [c11]Katarzyna E. Paluch
Capacitated Rank-Maximal Matchings. CIAC 2013: 324-335 - 2012
- [c10]Katarzyna E. Paluch
Popular and Clan-Popular b-Matchings. ISAAC 2012: 116-125 - [c9]Katarzyna E. Paluch
Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem. STACS 2012: 501-506 - 2011
- [c8]Katarzyna E. Paluch
Faster and Simpler Approximation of Stable Matchings. WAOA 2011: 176-187 - [i3]Katarzyna E. Paluch:
Popular b-matchings. CoRR abs/1101.0021 (2011)
2000 – 2009
- 2009
- [c7]Katarzyna E. Paluch
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. APPROX-RANDOM 2009: 298-311 - [i2]Katarzyna E. Paluch:
Faster and simpler approximation of stable matchings. CoRR abs/0911.5660 (2009) - 2008
- [j4]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
An [(O)\tilde](m2n)\tilde{O}(m^{2}n) Algorithm for Minimum Cycle Basis of Graphs. Algorithmica 52(3): 333-349 (2008) - [i1]Katarzyna E. Paluch, Marcin Mucha, Aleksander Madry:
A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. CoRR abs/0812.5101 (2008) - 2007
- [j3]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem. ACM Trans. Algorithms 3(2): 15 (2007) - 2006
- [j2]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
Rank-maximal matchings. ACM Trans. Algorithms 2(4): 602-610 (2006) - [c6]Katarzyna E. Paluch
A New Approximation Algorithm for Multidimensional Rectangle Tiling. ISAAC 2006: 712-721 - 2004
- [c5]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
A Faster Algorithm for Minimum Cycle Basis of Graphs. ICALP 2004: 846-857 - [c4]Katarzyna E. Paluch
A 2(1/8)-Approximation Algorithm for Rectangle Tiling. ICALP 2004: 1054-1065 - [c3]Robert W. Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna E. Paluch:
Rank-maximal matchings. SODA 2004: 68-75 - [c2]Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem. STACS 2004: 222-233 - 2003
- [j1]Krzysztof Lorys, Katarzyna E. Paluch
New approximation algorithm for RTILE problem. Theor. Comput. Sci. 303(2-3): 517-537 (2003) - 2000
- [c1]Krzysztof Lorys, Katarzyna E. Paluch
Rectangle tiling. APPROX 2000: 206-213
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-18 00:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: