Karol Wegrzycki

According to our database, Karol Wegrzycki authored at least 30 papers between 2016 and 2024.

Collaborative distances:

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

2024

Computing Generalized Convolutions Faster Than Brute Force.

Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki

Algorithmica, January, 2024

Fine-Grained Complexity of Earth Mover's Distance under Translation.

Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen

CoRR, 2024

Hitting Meets Packing: How Hard Can it Be?

Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki

CoRR, 2024

A polynomial-time OPT^ɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.

Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics.

Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki

SIAM J. Comput., December, 2023

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.

Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki

SIAM J. Discret. Math., September, 2023

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints.

Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki

CoRR, 2023

A polynomial-time OPT^ε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph.

Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

CoRR, 2023

Separator Theorem and Algorithms for Planar Hyperbolic Graphs.

Sándor Kisfaludi-Bak, Jana Masarikova, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki

CoRR, 2023

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models.

Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki

Electron. J. Comb., 2023

Dynamic Data Structures for Parameterized String Problems.

Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.

François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.

Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki

Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Coverability in 2-VASS with One Unary Counter is in NP.

Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki

Proceedings of the Foundations of Software Science and Computation Structures, 2023

2022

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments.

Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

CoRR, 2022

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995ⁿ) time.

Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki

CoRR, 2022

Independence number of intersection graphs of axis-parallel segments.

Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki

CoRR, 2022

Isolation Schemes for Problems on Decomposable Graphs.

Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021

Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors.

Jesper Nederlof, Karol Wegrzycki

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Knapsack and Subset Sum with Small Items.

Adam Polak, Lars Rohwedder, Karol Wegrzycki

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.

Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2019

On Problems Equivalent to (min, +)-Convolution.

Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk

ACM Trans. Algorithms, 2019

Improved Distance Queries and Cycle Counting by Frobenius Normal Form.

Piotr Sankowski, Karol Wegrzycki

Theory Comput. Syst., 2019

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max.

Karl Bringmann, Marvin Künnemann, Karol Wegrzycki

Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A Subquadratic Approximation Scheme for Partition.

Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Equal-Subset-Sum Faster Than the Meet-in-the-Middle.

Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2017

Why Do Cascade Sizes Follow a Power-Law?

Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki

Proceedings of the 26th International Conference on World Wide Web, 2017

2016

RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.

Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki

Proceedings of the 2016 Recommender Systems Challenge, 2016

There is Something Beyond the Twitter Network.

Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki

Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016

Locality-Sensitive Hashing Without False Negatives for l_p.

Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016