Locality-Sensitive Hashing Without False Negatives for l_p. - Andrzej Pacuk; Piotr Sankowski; Karol Wegrzycki; Piotr Wygocki (COCOON, 2016)

There is Something Beyond the Twitter Network. - Andrzej Pacuk; Piotr Sankowski; Karol Wegrzycki; Piotr Wygocki (HT, 2016)

RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. - Andrzej Pacuk; Piotr Sankowski; Karol Wegrzycki; Adam Witkowski; Piotr Wygocki (RecSys Challenge, 2016)

Why Do Cascade Sizes Follow a Power-Law? - Karol Wegrzycki; Piotr Sankowski; Andrzej Pacuk; Piotr Wygocki (WWW, 2017)

Equal-Subset-Sum Faster Than the Meet-in-the-Middle. - Marcin Mucha; Jesper Nederlof; Jakub Pawlewicz; Karol Wegrzycki (ESA, 2019)

A Subquadratic Approximation Scheme for Partition. - Marcin Mucha; Karol Wegrzycki; Michal Wlodarczyk 001 (SODA, 2019)

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. - Karl Bringmann; Marvin Künnemann; Karol Wegrzycki (STOC, 2019)

Improved Distance Queries and Cycle Counting by Frobenius Normal Form. - Piotr Sankowski; Karol Wegrzycki (Theory Comput. Syst., 2019)

On Problems Equivalent to (min, +)-Convolution. - Marek Cygan; Marcin Mucha; Karol Wegrzycki; Michal Wlodarczyk 001 (ACM Trans. Algorithms, 2019)

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. - Sándor Kisfaludi-Bak; Jesper Nederlof; Karol Wegrzycki (FOCS, 2021)

Knapsack and Subset Sum with Small Items. - Adam Polak 001; Lars Rohwedder; Karol Wegrzycki (ICALP, 2021)

Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. - Jesper Nederlof; Karol Wegrzycki (STOC, 2021)

Isolation Schemes for Problems on Decomposable Graphs. - Jesper Nederlof; Michal Pilipczuk; Céline M. F. Swennenhuis; Karol Wegrzycki (STACS, 2022)

Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995n) time. - Jesper Nederlof; Céline M. F. Swennenhuis; Karol Wegrzycki (CoRR, 2022)

Coverability in 2-VASS with One Unary Counter is in NP. - Filip Mazowiecki; Henry Sinclair-Banks; Karol Wegrzycki (FoSSaCS, 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 (ICALP, 2023)

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. - François Dross; Krzysztof Fleszar 001; Karol Wegrzycki; Anna Zych-Pawlewicz (SODA, 2023)

Dynamic Data Structures for Parameterized String Problems. - Jedrzej Olkowski; Michal Pilipczuk; Mateusz Rychlicki; Karol Wegrzycki; Anna Zych-Pawlewicz (STACS, 2023)

Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. - Jesper Nederlof; Michal Pilipczuk; Karol Wegrzycki (Electron. J. Comb., 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)

On the independence number of intersection graphs of axis-parallel segments. - Marco Caoduro; Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (J. Comput. Geom., 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., 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., 2023)

Fine-Grained Complexity of Earth Mover's Distance Under Translation. - Karl Bringmann; Frank Staals; Karol Wegrzycki; Geert van Wordragen (SoCG, 2024)

Separator Theorem and Algorithms for Planar Hyperbolic Graphs. - Sándor Kisfaludi-Bak; Jana Masaríková; Erik Jan van Leeuwen; Bartosz Walczak; Karol Wegrzycki (SoCG, 2024)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. - Tim Randolph 001; Karol Wegrzycki (ESA, 2024)

Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. - Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (ESA, 2024)

Hitting Meets Packing: How Hard Can It Be? - Jacob Focke; Fabian Frei; Shaohua Li 005; Dániel Marx; Philipp Schepper; Roohani Sharma; Karol Wegrzycki (ESA, 2024)

The Tractability Border of Reachability in Simple Vector Addition Systems with States. - Dmitry Chistikov 001; Wojciech Czerwinski; Filip Mazowiecki; Lukasz Orlikowski; Henry Sinclair-Banks; Karol Wegrzycki (FOCS, 2024)

Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. - Friedrich Eisenbrand; Lars Rohwedder; Karol Wegrzycki (FOCS, 2024)

A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph. - Jana Cslovjecsek; Michal Pilipczuk; Karol Wegrzycki (SODA, 2024)

Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. - Divesh Aggarwal; Antoine Joux; Miklos Santha; Karol Wegrzycki (CoRR, 2024)

Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach. - Antoine Joux; Karol Wegrzycki (CoRR, 2024)

Computing Generalized Convolutions Faster Than Brute Force. - Baris Can Esmer; Ariel Kulik; Dániel Marx; Philipp Schepper; Karol Wegrzycki (Algorithmica, 2024)

Fine-Grained Equivalence for Problems Related to Integer Linear Programming. - Lars Rohwedder; Karol Wegrzycki (ITCS, 2025)

Space-Efficient Algorithm for Integer Programming with Few Constraints. - Lars Rohwedder; Karol Wegrzycki (IPCO, 2025)

A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. - Jesper Nederlof; Céline M. F. Swennenhuis; Karol Wegrzycki (SODA, 2025)

Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs. - Karolina Drabik; Anita Dürr; Fabian Frei; Filip Mazowiecki; Karol Wegrzycki (CoRR, 2025)

Faster algorithms for k-Orthogonal Vectors in low dimension. - Anita Dürr; Evangelos Kipouridis; Karol Wegrzycki (CoRR, 2025)