default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKarol Wegrzycki
Person information
- affiliation: Saarland University, Saarbrücken, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Baris Can Esmer
, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86(1): 334-366 (2024)- [c26]Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen:
Fine-Grained Complexity of Earth Mover's Distance Under Translation. SoCG 2024: 25:1-25:17 - [c25]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG 2024: 67:1-67:17 - [c24]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. ESA 2024: 43:1-43:18 - [c23]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can It Be? ESA 2024: 55:1-55:21 - [c22]Tim Randolph, Karol Wegrzycki:
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. ESA 2024: 96:1-96:19 - [c21]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA 2024: 625-638 - [i34]Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki:
Hitting Meets Packing: How Hard Can it Be? CoRR abs/2402.14927 (2024) - [i33]Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen:
Fine-Grained Complexity of Earth Mover's Distance under Translation. CoRR abs/2403.04356 (2024) - [i32]Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki:
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR abs/2404.03747 (2024) - [i31]Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki:
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR abs/2407.05435 (2024) - [i30]Timothy W. Randolph, Karol Wegrzycki:
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. CoRR abs/2407.18228 (2024) - [i29]Antoine Joux, Karol Wegrzycki:
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach. CoRR abs/2408.16108 (2024) - [i28]Lars Rohwedder, Karol Wegrzycki:
Fine-Grained Equivalence for Problems Related to Integer Linear Programming. CoRR abs/2409.03675 (2024) - [i27]Lars Rohwedder, Karol Wegrzycki:
Space-Efficient Algorithm for Integer Programming with Few Constraints. CoRR abs/2409.03681 (2024) - 2023
- [j5]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki:
Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. 30(3) (2023) - [j4]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. 52(6): 1369-1412 (2023) - [j3]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. 37(3): 1566-1586 (2023) - [c20]Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS 2023: 196-217 - [c19]Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ICALP 2023: 131:1-131:20 - [c18]François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz:
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA 2023: 1433-1463 - [c17]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic Data Structures for Parameterized String Problems. STACS 2023: 50:1-50:22 - [i26]Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in 2-VASS with One Unary Counter is in NP. CoRR abs/2301.13543 (2023) - [i25]Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki:
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. CoRR abs/2305.01581 (2023) - [i24]Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki:
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR abs/2310.11283 (2023) - [i23]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
A polynomial-time OPTε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. CoRR abs/2310.20325 (2023) - [i22]Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR abs/2312.03495 (2023) - 2022
- [c16]Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. IPEC 2022: 12:1-12:22 - [c15]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation Schemes for Problems on Decomposable Graphs. STACS 2022: 50:1-50:20 - [i21]Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki:
Bounding generalized coloring numbers of planar graphs using coin models. CoRR abs/2201.09340 (2022) - [i20]Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz:
Dynamic data structures for parameterized string problems. CoRR abs/2205.00441 (2022) - [i19]Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Independence number of intersection graphs of axis-parallel segments. CoRR abs/2205.15189 (2022) - [i18]Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki:
Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time. CoRR abs/2208.02664 (2022) - [i17]Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. CoRR abs/2209.01623 (2022) - [i16]François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz:
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. CoRR abs/2209.08904 (2022) - [i15]Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki:
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR abs/2212.01620 (2022) - 2021
- [c14]Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki:
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS 2021: 351-362 - [c13]Adam Polak, Lars Rohwedder, Karol Wegrzycki:
Knapsack and Subset Sum with Small Items. ICALP 2021: 106:1-106:19 - [c12]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA 2021: 1682-1701 - [c11]Jesper Nederlof, Karol Wegrzycki:
Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. STOC 2021: 1670-1683 - [i14]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Isolation schemes for problems on decomposable graphs. CoRR abs/2105.01465 (2021) - [i13]Adam Polak, Lars Rohwedder, Karol Wegrzycki:
Knapsack and Subset Sum with Small Items. CoRR abs/2105.04035 (2021) - 2020
- [c10]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG 2020: 27-39 - [i12]Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki:
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR abs/2002.04368 (2020) - [i11]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR abs/2007.08204 (2020) - [i10]Jesper Nederlof, Karol Wegrzycki:
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors. CoRR abs/2010.08576 (2020) - [i9]Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki:
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR abs/2011.03778 (2020)
2010 – 2019
- 2019
- [j2]Piotr Sankowski, Karol Wegrzycki:
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Theory Comput. Syst. 63(5): 1049-1067 (2019) - [j1]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15(1): 14:1-14:25 (2019) - [c9]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA 2019: 73:1-73:16 - [c8]Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
A Subquadratic Approximation Scheme for Partition. SODA 2019: 70-88 - [c7]Karl Bringmann, Marvin Künnemann, Karol Wegrzycki:
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. STOC 2019: 943-954 - [i8]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR abs/1905.02424 (2019) - [i7]Karl Bringmann, Marvin Künnemann, Karol Wegrzycki:
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. CoRR abs/1907.11078 (2019) - 2018
- [i6]Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
Subquadratic Approximation Scheme for Partition. CoRR abs/1804.02269 (2018) - 2017
- [c6]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On Problems Equivalent to (min, +)-Convolution. ICALP 2017: 22:1-22:15 - [c5]Piotr Sankowski, Karol Wegrzycki:
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. STACS 2017: 56:1-56:14 - [c4]Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki:
Why Do Cascade Sizes Follow a Power-Law? WWW 2017: 569-576 - [i5]Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki:
Why Do Cascade Sizes Follow a Power-Law? CoRR abs/1702.05913 (2017) - [i4]Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk:
On problems equivalent to (min, +)-convolution. CoRR abs/1702.07669 (2017) - 2016
- [c3]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
Locality-Sensitive Hashing Without False Negatives for l_p. COCOON 2016: 105-118 - [c2]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
There is Something Beyond the Twitter Network. HT 2016: 279-284 - [c1]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki:
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. RecSys Challenge 2016: 10:1-10:4 - [i3]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
Locality-Sensitive Hashing without False Negatives for l_p. CoRR abs/1611.09317 (2016) - [i2]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki:
There is Something Beyond the Twitter Network. CoRR abs/1611.09387 (2016) - [i1]Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki:
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. CoRR abs/1612.00959 (2016)
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-10-10 21:13 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:
