KW
Karol Węgrzycki
cs.DScs.CCcs.CGcs.FLcs.DMcs.SImath.COAll-nodes shortest cyclescs.AIcs.CR
On Valency
published · living versionsW_xk98k3d7·v1 · currentpublished
Counting over Unbreakable Decompositions: A Single-Exponential Parameterized Algorithm for Minimum Bisection
with Aditya Anand, Evangelos Kipouridis
1 version
W_p5qwcp2k·v1published
W_k6htykwp·v1published
Preprints & journals
48 papers in the corpus · 2016–2026Subexponential Algorithms for Total Search Problems in the Dense Pigeonhole Regime2610.25338v1 · Jadwiga Czyżewska, Karolina Drabik, Marek Soko\lowski et al.2026 · 0 citationsarXivon Valency
A Simple Algorithm for Counting Solutions to Integer Programs2610.19200v1 · Daniel Dadush, Anita Durr, Thekla Hamm et al.2026 · 0 citationsarXiv
Metric Planarity Testing is Hard2610.15682v1 · Anubhav Dhar, Debajyoti Kar, S'andor Kisfaludi-Bak et al.2026 · 0 citationsarXiv
Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Bicriteria Optimality in 2D2608.27600v1 · Karl Bringmann, Ariel Kulik, Karol Wegrzycki2026 · 0 citationsarXiv
Faster Exponential Algorithms for Multi-Machine Scheduling Problems2608.12224v1 · Anubhav Dhar, Anita Durr, Ahmed Ghazy et al.2026 · 0 citationsarXiv
Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling2603.12999v1 · Karl Bringmann, Anita Durr, Karol Wegrzycki2026 · 1 citationarXiv
Dynamic data structures for twin-ordered matrices2602.18770v1 · Bart\lomiej Bosek, Jadwiga Czyżewska, Evangelos Kipouridis et al.2026 · 0 citationsarXiv
Euclidean Noncrossing Steiner Spanners of Nearly Optimal Sparsity2602.17801v1 · Sujoy Bhore, S'andor Kisfaludi-Bak, Lazar Milenkovi'c et al.2026 · 0 citationsarXiv
Beating Meet-in-the-Middle for Subset Balancing Problems2511.10823v1 · Tim Randolph, Karol Wegrzycki2025 · 0 citationsarXiv
On Subexponential Parameterized Algorithms for Steiner Tree on Intersection Graphs of Geometric Objects2511.07346v1 · Sujoy Bhore, Baris Can Esmer, Daniel Marx et al.2025 · 0 citationsarXiv
Faster algorithms for k-Orthogonal Vectors in low dimension2507.11098v2 · Anita Durr, Evangelos Kipouridis, Michael Lampis et al.2025 · 0 citationsarXiv
Fine-Grained Complexity of Ambiguity Problems on Automata and Directed Graphs2501.14725v3 · Karolina Drabik, Anita Durr, Fabian Frei et al.2025 · 0 citationsarXiv
The Tractability Border of Reachability in Simple Vector Addition Systems with States2412.16612v1 · Dmitry Chistikov, Wojciech Czerwi'nski, Filip Mazowiecki et al.2024 · 1 citationarXiv
Fine-Grained Equivalence for Problems Related to Integer Linear Programming2409.03675v1 · Lars Rohwedder, Karol Wegrzycki2024 · 0 citationsarXiv
Space-Efficient Algorithm for Integer Programming with Few Constraints2409.03681v1 · Lars Rohwedder, Karol Wegrzycki2024 · 0 citationsarXiv
Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach2408.16108v1 · Antoine Joux, Karol Wegrzycki2024 · 0 citationsarXiv
Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM2407.18228v1 · Tim Randolph, Karol Wegrzycki2024 · 1 citationarXiv
Polynomial Time Algorithms for Integer Programming and Unbounded Subset Sum in the Total Regime2407.05435v2 · Divesh Aggarwal, Antoine Joux, Miklos Santha et al.2024 · 0 citationsarXiv
Sensitivity, Proximity and FPT Algorithms for Exact Matroid Problems2404.03747v2 · Friedrich Eisenbrand, Lars Rohwedder, Karol Wegrzycki2024 · 2 citationsarXiv
Hitting Meets Packing: How Hard Can it Be?2402.14927v1 · Jacob Focke, Fabian Frei, Shaohua Li et al.2024 · 1 citationarXiv
A Subexponential Time Algorithm for Makespan Scheduling of Unit Jobs with Precedence Constraints2312.03495v1 · Jesper Nederlof, C'eline M. F. Swennenhuis, Karol Wegrzycki2023 · 2 citationsarXiv
A polynomial-time -approximation algorithm for maximum independent set of connected subgraphs in a planar graph2310.20325v1 · Jana Cslovjecsek, MichałPilipczuk, Karol Wegrzycki2023 · 0 citationsarXiv
Separator Theorem and Algorithms for Planar Hyperbolic Graphs2310.11283v1 · S'andor Kisfaludi-Bak, Jana Masar'ikov'a, Erik Jan van Leeuwen et al.2023 · 2 citationsarXiv
Computing Generalized Convolutions Faster Than Brute Force.38188497 · Esmer, Barış Can, Kulik, Ariel, Marx, Dániel et al.2024 · 0 citationsAlgorithmica. 2024;86(1):334-366
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality2305.01581v1 · Marvin Kunnemann, Filip Mazowiecki, Lia Schutze et al.2023 · 2 citationsarXiv
Coverability in 2-VASS with One Unary Counter is in NP2301.13543v1 · Filip Mazowiecki, Henry Sinclair-Banks, Karol Wegrzycki2023 · 1 citationarXiv
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments2212.01620v1 · Jana Cslovjecsek, MichałPilipczuk, Karol Wegrzycki2022 · 0 citationsarXiv
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours2209.08904v1 · Francois Dross, Krzysztof Fleszar, Karol Wegrzycki et al.2022 · 0 citationsarXiv
Computing Generalized Convolutions Faster Than Brute Force2209.01623v2 · Bar\is Can Esmer, Ariel Kulik, D'aniel Marx et al.2022 · 0 citationsarXiv
Makespan Scheduling of Unit Jobs with Precedence Constraints in time2208.02664v1 · Jesper Nederlof, C'eline M. F. Swennenhuis, Karol Wegrzycki2022 · 0 citationsarXiv
Independence number of intersection graphs of axis-parallel segments2205.15189v1 · Marco Caoduro, Jana Cslovjecsek, MichałPilipczuk et al.2022 · 0 citationsarXiv
Dynamic data structures for parameterized string problems2205.00441v1 · Jedrzej Olkowski, MichałPilipczuk, Mateusz Rychlicki et al.2022 · 1 citationarXiv
Bounding generalized coloring numbers of planar graphs using coin models2201.09340v1 · Jesper Nederlof, MichałPilipczuk, Karol Wegrzycki2022 · 2 citationsarXiv
Knapsack and Subset Sum with Small Items2105.04035v1 · Adam Polak, Lars Rohwedder, Karol Wegrzycki2021 · 10 citationsarXiv
Isolation schemes for problems on decomposable graphs2105.01465v1 · Jesper Nederlof, MichałPilipczuk, C'eline M. F. Swennenhuis et al.2021 · 1 citationarXiv
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP2011.03778v3 · S'andor Kisfaludi-Bak, Jesper Nederlof, Karol Wegrzycki2020 · 6 citationsarXiv
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors2010.08576v2 · Jesper Nederlof, Karol Wegrzycki2020 · 8 citationsarXiv
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics2007.08204v4 · Jesper Nederlof, Jakub Pawlewicz, C'eline M. F. Swennenhuis et al.2020 · 3 citationsarXiv
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space2002.04368v2 · Jesper Nederlof, MichałPilipczuk, C'eline M. F. Swennenhuis et al.2020 · 10 citationsarXiv
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max1907.11078v1 · Karl Bringmann, Marvin Kunnemann, Karol Wegrzycki2019 · 6 citationsarXiv
Equal-Subset-Sum Faster Than the Meet-in-the-Middle1905.02424v2 · Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz et al.2019 · 7 citationsarXiv
Improved Distance Queries and Cycle Counting by Frobenius Normal Form.31396014 · Sankowski, Piotr, Węgrzycki, Karol2020 · 9 citationsTheory of computing systems. 2019;63(5):1049-1067
A Subquadratic Approximation Scheme for Partition1804.02269v2 · Marcin Mucha, Karol Wegrzycki, MichałW\lodarczyk2018 · 23 citationsarXiv
On problems equivalent to (min,+)-convolution1702.07669v2 · Marek Cygan, Marcin Mucha, Karol Wegrzycki et al.2017 · 56 citationsACM Transactions on Algorithms 2019
Why Do Cascade Sizes Follow a Power-Law?1702.05913v1 · Karol Wegrzycki, Piotr Sankowski, Andrzej Pacuk et al.2017 · 13 citationsarXiv
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting1612.00959v1 · Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki et al.2016 · 16 citationsProceedings of the Recommender Systems Challenge, RecSys Challenge '16, Boston, Massachusetts - September 15 - 15, 2016, pages 10:1--10:4
Locality-Sensitive Hashing without False Negatives for l_p1611.09317v1 · Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki et al.2016 · 7 citationsComputing and Combinatorics - 22nd International Conference, {COCOON} 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, pages 105--118
There is Something Beyond the Twitter Network1611.09387v1 · Andrzej Pacuk, Piotr Sankowski, Karol Wegrzycki et al.2016 · 2 citationsProceedings of the 27th {ACM} Conference on Hypertext and Social Media, {HT} 2016, Halifax, NS, Canada, July 10-13, 2016, pages 279--284
Career total: at least 76 works. 48 are in this corpus.
Profile built from the corpus for this byline.
Author records are still filling in while the Hub is in alpha. If this is your page, you'll be able to claim it soon. Spot a mistake? Tell us.