On problems equivalent to (min,+)-convolution M Cygan, M Mucha, K Węgrzycki, M Włodarczyk ACM Transactions on Algorithms (TALG) 15 (1), 1-25, 2019 | 99 | 2019 |
A Subquadratic Approximation Scheme for Partition M Mucha, K Węgrzycki, M Włodarczyk Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 39 | 2019 |
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting A Pacuk, P Sankowski, K Węgrzycki, A Witkowski, P Wygocki Proceedings of the Recommender Systems Challenge '16, 10:1--10:4, 2016 | 30 | 2016 |
Knapsack and subset sum with small items A Polak, L Rohwedder, K Węgrzycki 48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021 | 28 | 2021 |
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max K Bringmann, M Künnemann, K Węgrzycki Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 25 | 2019 |
Equal-Subset-Sum Faster Than the Meet-in-the-Middle M Mucha, J Nederlof, J Pawlewicz, K Węgrzycki 27th Annual European Symposium on Algorithms (ESA 2019) 144 (LIPIcs), 73:1-73:16, 2019 | 20 | 2019 |
Why do cascade sizes follow a power-law? K Wegrzycki, P Sankowski, A Pacuk, P Wygocki Proceedings of the 26th international conference on World Wide Web, 569-576, 2017 | 18 | 2017 |
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space J Nederlof, M Pilipczuk, CMF Swennenhuis, K Węgrzycki SIAM Journal on Discrete Mathematics 37 (3), 1566 - 1586, 2023 | 17 | 2023 |
A Gap-ETH-Tight approximation scheme for Euclidean TSP S Kisfaludi-Bak, J Nederlof, K Węgrzycki 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021 …, 2022 | 12 | 2022 |
Locality-Sensitive Hashing Without False Negatives for A Pacuk, P Sankowski, K Wegrzycki, P Wygocki International Computing and Combinatorics Conference, 105-118, 2016 | 11 | 2016 |
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality M Künnemann, F Mazowiecki, L Schütze, H Sinclair-Banks, K Węgrzycki 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 10 | 2023 |
Improving Schroeppel and Shamir’s Algorithm for Subset Sum via Orthogonal Vectors J Nederlof, K Węgrzycki Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 10 | 2021 |
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics J Nederlof, J Pawlewicz, CMF Swennenhuis, K Węgrzycki SIAM Journal on Computing 52 (6), https://doi.org/10.1137/22M1478112, 2023 | 6 | 2023 |
Independence number of intersection graphs of axis-parallel segments M Caoduro, J Cslovjecsek, M Pilipczuk, K Węgrzycki Journal of Computational Geometry 14 (1), https://doi.org/10.20382/jocg.v14i1a5, 2023 | 5 | 2023 |
Isolation schemes for problems on decomposable graphs J Nederlof, M Pilipczuk, CMF Swennenhuis, K Węgrzycki 39th International Symposium on Theoretical Aspects of Computer Science …, 2022 | 5 | 2022 |
There is something beyond the twitter network A Pacuk, P Sankowski, K Wegrzycki, P Wygocki Proceedings of the 27th ACM Conference on Hypertext and Social Media, 279-284, 2016 | 5 | 2016 |
Dynamic data structures for parameterized string problems J Olkowski, M Pilipczuk, M Rychlicki, K Węgrzycki, A Zych-Pawlewicz 40th International Symposium on Theoretical Aspects of Computer Science, 50 …, 2023 | 4 | 2023 |
Separator Theorem and Algorithms for Planar Hyperbolic Graphs S Kisfaludi-Bak, J Masaříková, EJ van Leeuwen, B Walczak, K Węgrzycki 40th International Symposium on Computational Geometry (SoCG 2024), 2024 | 2 | 2024 |
A polynomial-time OPTɛ-approximation algorithm for maximum independent set of connected subgraphs in a planar graph J Cslovjecsek, M Pilipczuk, K Węgrzycki Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2024 | 2 | 2024 |
Bounding generalized coloring numbers of planar graphs using coin models J Nederlof, M Pilipczuk, K Węgrzycki Electronic Journal of Combinatorics 30 (3), 2023 | 2 | 2023 |