Karol Wegrzycki

84 papers A* 16A 9B 4Misc 1Journal 52Unranked 2

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Dynamic data structures for twin-ordered matrices. CoRR Bartlomiej Bosek, Jadwiga Czyzewska, Evangelos Kipouridis, Wojciech Nadara, Michal Pilipczuk, Karol Wegrzycki, Anna Zych-Pawlewicz
2026	J	`jnl`	Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity. CoRR Sujoy Bhore, Sándor Kisfaludi-Bak, Lazar Milenkovic, Csaba D. Tóth, Karol Wegrzycki, Sampson Wong
2026	A	`conf`	Improving Lagarias-Odlyzko Algorithm for Average-Case Subset Sum: Modular Arithmetic Approach. STACS Antoine Joux, Karol Wegrzycki
2026	J	`jnl`	Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling. CoRR Karl Bringmann, Anita Dürr, Karol Wegrzycki
2025	J	`jnl`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. J. ACM Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2025	A*	`conf`	A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. SODA Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
2025	J	`jnl`	Beating Meet-in-the-Middle for Subset Balancing Problems. CoRR Timothy W. Randolph, Karol Wegrzycki
2025	J	`jnl`	Coverability in VASS Revisited: Improving Rackoff's Bounds to Obtain Conditional Optimality. J. ACM Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
2025	J	`jnl`	Faster algorithms for k-Orthogonal Vectors in low dimension. CoRR Anita Dürr, Evangelos Kipouridis, Karol Wegrzycki
2025	A	`conf`	Fine-Grained Equivalence for Problems Related to Integer Linear Programming. ITCS Lars Rohwedder, Karol Wegrzycki
2025	J	`jnl`	Fined-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs. CoRR Karolina Drabik, Anita Dürr, Fabian Frei, Filip Mazowiecki, Karol Wegrzycki
2025	J	`jnl`	On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects. CoRR Sujoy Bhore, Baris Can Esmer, Dániel Marx, Karol Wegrzycki
2025	B	`conf`	Space-Efficient Algorithm for Integer Programming with Few Constraints. IPCO Lars Rohwedder, Karol Wegrzycki
2024	A*	`conf`	A polynomial-time OPT SODA Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2024	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. Algorithmica Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2024	A*	`conf`	Fine-Grained Complexity of Earth Mover's Distance Under Translation. SoCG Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
2024	J	`jnl`	Fine-Grained Complexity of Earth Mover's Distance under Translation. CoRR Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
2024	J	`jnl`	Fine-Grained Equivalence for Problems Related to Integer Linear Programming. CoRR Lars Rohwedder, Karol Wegrzycki
2024	J	`jnl`	Fine-grained complexity of Earth Mover's distance under translation. J. Comput. Geom. Karl Bringmann, Frank Staals, Karol Wegrzycki, Geert van Wordragen
2024	A	`conf`	Hitting Meets Packing: How Hard Can It Be? ESA Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
2024	J	`jnl`	Hitting Meets Packing: How Hard Can it Be? CoRR Jacob Focke, Fabian Frei, Shaohua Li, Dániel Marx, Philipp Schepper, Roohani Sharma, Karol Wegrzycki
2024	J	`jnl`	Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach. CoRR Antoine Joux, Karol Wegrzycki
2024	A	`conf`	Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. ESA Tim Randolph, Karol Wegrzycki
2024	J	`jnl`	Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM. CoRR Timothy W. Randolph, Karol Wegrzycki
2024	A	`conf`	Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. ESA Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2024	J	`jnl`	Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime. CoRR Divesh Aggarwal, Antoine Joux, Miklos Santha, Karol Wegrzycki
2024	A*	`conf`	Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. FOCS Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
2024	J	`jnl`	Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems. CoRR Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki
2024	A*	`conf`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. SoCG Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2024	J	`jnl`	Space-Efficient Algorithm for Integer Programming with Few Constraints. CoRR Lars Rohwedder, Karol Wegrzycki
2024	A*	`conf`	The Tractability Border of Reachability in Simple Vector Addition Systems with States. FOCS Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki
2024	J	`jnl`	The Tractability Border of Reachability in Simple Vector Addition Systems with States. CoRR Dmitry Chistikov, Wojciech Czerwinski, Filip Mazowiecki, Lukasz Orlikowski, Henry Sinclair-Banks, Karol Wegrzycki
2023	J	`jnl`	A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	J	`jnl`	A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints. CoRR Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	J	`jnl`	A polynomial-time OPT CoRR Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2023	J	`jnl`	Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models. Electron. J. Comb. Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
2023	B	`conf`	Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
2023	J	`jnl`	Coverability in 2-VASS with One Unary Counter is in NP. CoRR Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki
2023	A*	`conf`	Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ICALP Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
2023	J	`jnl`	Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. CoRR Marvin Künnemann, Filip Mazowiecki, Lia Schütze, Henry Sinclair-Banks, Karol Wegrzycki
2023	A	`conf`	Dynamic Data Structures for Parameterized String Problems. STACS Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
2023	A*	`conf`	Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
2023	J	`jnl`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. SIAM J. Discret. Math. Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2023	J	`jnl`	On the independence number of intersection graphs of axis-parallel segments. J. Comput. Geom. Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2023	J	`jnl`	Separator Theorem and Algorithms for Planar Hyperbolic Graphs. CoRR Sándor Kisfaludi-Bak, Jana Masaríková, Erik Jan van Leeuwen, Bartosz Walczak, Karol Wegrzycki
2022	J	`jnl`	Bounding generalized coloring numbers of planar graphs using coin models. CoRR Jesper Nederlof, Michal Pilipczuk, Karol Wegrzycki
2022	B	`conf`	Computing Generalized Convolutions Faster Than Brute Force. IPEC Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Computing Generalized Convolutions Faster Than Brute Force. CoRR Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki
2022	J	`jnl`	Dynamic data structures for parameterized string problems. CoRR Jedrzej Olkowski, Michal Pilipczuk, Mateusz Rychlicki, Karol Wegrzycki, Anna Zych-Pawlewicz
2022	J	`jnl`	Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. CoRR François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
2022	J	`jnl`	Independence number of intersection graphs of axis-parallel segments. CoRR Marco Caoduro, Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2022	A	`conf`	Isolation Schemes for Problems on Decomposable Graphs. STACS Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2022	J	`jnl`	Makespan Scheduling of Unit Jobs with Precedence Constraints in O(1.995 CoRR Jesper Nederlof, Céline M. F. Swennenhuis, Karol Wegrzycki
2022	J	`jnl`	Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments. CoRR Jana Cslovjecsek, Michal Pilipczuk, Karol Wegrzycki
2021	A*	`conf`	A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
2021	A*	`conf`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. FOCS Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2021	A*	`conf`	Improving Schroeppel and Shamir's algorithm for subset sum via orthogonal vectors. STOC Jesper Nederlof, Karol Wegrzycki
2021	J	`jnl`	Isolation schemes for problems on decomposable graphs. CoRR Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2021	A*	`conf`	Knapsack and Subset Sum with Small Items. ICALP Adam Polak, Lars Rohwedder, Karol Wegrzycki
2021	J	`jnl`	Knapsack and Subset Sum with Small Items. CoRR Adam Polak, Lars Rohwedder, Karol Wegrzycki
2020	J	`jnl`	A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	A Gap-ETH-Tight Approximation Scheme for Euclidean TSP. CoRR Sándor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki
2020	B	`conf`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. WG Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space. CoRR Jesper Nederlof, Michal Pilipczuk, Céline M. F. Swennenhuis, Karol Wegrzycki
2020	J	`jnl`	Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors. CoRR Jesper Nederlof, Karol Wegrzycki
2019	A*	`conf`	A Subquadratic Approximation Scheme for Partition. SODA Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2019	J	`jnl`	Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. CoRR Karl Bringmann, Marvin Künnemann, Karol Wegrzycki
2019	A*	`conf`	Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. STOC Karl Bringmann, Marvin Künnemann, Karol Wegrzycki
2019	A	`conf`	Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
2019	J	`jnl`	Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki
2019	J	`jnl`	Improved Distance Queries and Cycle Counting by Frobenius Normal Form. Theory Comput. Syst. Piotr Sankowski, Karol Wegrzycki
2019	J	`jnl`	On Problems Equivalent to (min, +)-Convolution. ACM Trans. Algorithms Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2018	J	`jnl`	Subquadratic Approximation Scheme for Partition. CoRR Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2017	A	`conf`	Improved Distance Queries and Cycle Counting by Frobenius Normal Form. STACS Piotr Sankowski, Karol Wegrzycki
2017	A*	`conf`	On Problems Equivalent to (min, +)-Convolution. ICALP Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2017	J	`jnl`	On problems equivalent to (min, +)-convolution. CoRR Marek Cygan, Marcin Mucha, Karol Wegrzycki, Michal Wlodarczyk
2017	A*	`conf`	Why Do Cascade Sizes Follow a Power-Law? WWW Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
2017	J	`jnl`	Why Do Cascade Sizes Follow a Power-Law? CoRR Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk, Piotr Wygocki
2016	Misc	`conf`	Locality-Sensitive Hashing Without False Negatives for l_p. COCOON Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2016	J	`jnl`	Locality-Sensitive Hashing without False Negatives for l_p. CoRR Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2016	—	`conf`	RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. RecSys Challenge Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
2016	J	`jnl`	RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting. CoRR Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Adam Witkowski, Piotr Wygocki
2016	—	`conf`	There is Something Beyond the Twitter Network. HT Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki
2016	J	`jnl`	There is Something Beyond the Twitter Network. CoRR Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki