Karol Wegrzycki

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 62

Top Topics

Approximation Schemes

Independent Set

Travelling Salesman

Top Venues

Publications

Timothy W. Randolph, Karol Wegrzycki
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. CoRR (2024)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. Algorithmica 86 (1) (2024)
Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR (2024)
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)
Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
Fine-Grained Complexity of Earth Mover's Distance Under Translation. SoCG (2024)
Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
Fine-Grained Complexity of Earth Mover's Distance under Translation. CoRR (2024)
Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR (2024)
Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
Hitting Meets Packing: How Hard Can it Be? CoRR (2024)
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. SODA (2024)
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) (2023)
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR (2023)
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)
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)
Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. 30 (3) (2023)
Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
Dynamic Data Structures for Parameterized String Problems. STACS (2023)
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. CoRR (2023)
Sándor Kisfaludi-Bak, Jana Masarikova, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR (2023)
Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS (2023)
Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
Coverability in 2-VASS with One Unary Counter is in NP. CoRR (2023)
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 (2023)
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) (2023)
Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
Bounding generalized coloring numbers of planar graphs using coin models. CoRR (2022)
Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
Dynamic data structures for parameterized string problems. CoRR (2022)
Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Independence number of intersection graphs of axis-parallel segments. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. CoRR (2022)
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 (2022)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS (2022)
Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR (2022)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation Schemes for Problems on Decomposable Graphs. STACS (2022)
Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
) time. CoRR (2022)
Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
Computing Generalized Convolutions Faster Than Brute Force. IPEC (2022)
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)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Isolation schemes for problems on decomposable graphs. CoRR (2021)
Adam Polak, Lars Rohwedder, Karol Wegrzycki
Knapsack and Subset Sum with Small Items. CoRR (2021)
Adam Polak, Lars Rohwedder, Karol Wegrzycki
Knapsack and Subset Sum with Small Items. ICALP (2021)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS (2021)
Jesper Nederlof, Karol Wegrzycki
Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. STOC (2021)
Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR (2020)
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 (2020)
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)
Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR (2020)
Jesper Nederlof, Karol Wegrzycki
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors. CoRR (2020)
Karl Bringmann, Marvin Künnemann, Karol Wegrzycki
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. STOC (2019)
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR (2019)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms 15 (1) (2019)
Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
A Subquadratic Approximation Scheme for Partition. SODA (2019)
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA (2019)
Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Theory Comput. Syst. 63 (5) (2019)
Karl Bringmann, Marvin Künnemann, Karol Wegrzycki
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. CoRR (2019)
Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
Subquadratic Approximation Scheme for Partition. CoRR (2018)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On problems equivalent to (min, +)-convolution. CoRR (2017)
Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
Why Do Cascade Sizes Follow a Power-Law? CoRR (2017)
Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
Why Do Cascade Sizes Follow a Power-Law? WWW (2017)
Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
On Problems Equivalent to (min, +)-Convolution. ICALP (2017)
Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. STACS (2017)
Piotr Sankowski, Karol Wegrzycki
Improved Distance Queries and Cycle Counting by Frobenius Normal Form. CoRR (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
There is Something Beyond the Twitter Network. CoRR (2016)
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)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
Locality-Sensitive Hashing without False Negatives for l_p. CoRR (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
Locality-Sensitive Hashing Without False Negatives for l_p. COCOON (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. CoRR (2016)
Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
There is Something Beyond the Twitter Network. HT (2016)