Karol Wegrzycki

According to our database1, Karol Wegrzycki authored at least 13 papers between 2016 and 2020.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


A Gap-ETH-Tight Approximation Scheme for Euclidean TSP.
CoRR, 2020

Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors.
CoRR, 2020

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

Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2020

On Problems Equivalent to (min, +)-Convolution.
ACM Trans. Algorithms, 2019

Improved Distance Queries and Cycle Counting by Frobenius Normal Form.
Theory Comput. Syst., 2019

Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

A Subquadratic Approximation Scheme for Partition.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Equal-Subset-Sum Faster Than the Meet-in-the-Middle.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Why Do Cascade Sizes Follow a Power-Law?
Proceedings of the 26th International Conference on World Wide Web, 2017

RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.
Proceedings of the 2016 Recommender Systems Challenge, 2016

There is Something Beyond the Twitter Network.
Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016

Locality-Sensitive Hashing Without False Negatives for l_p.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016