Karol Wegrzycki
According to our database^{1},
Karol Wegrzycki
authored at least 13 papers
between 2016 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Online presence:

on orcid.org
On csauthors.net:
Bibliography
2020
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 GraphTheoretic Concepts in Computer Science, 2020
2019
ACM Trans. Algorithms, 2019
Theory Comput. Syst., 2019
Approximating APSP without scaling: equivalence of approximate minplus and exact minmax.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
2017
Proceedings of the 26th International Conference on World Wide Web, 2017
2016
RecSys Challenge 2016: job recommendations based on preselection of offers and gradient boosting.
Proceedings of the 2016 Recommender Systems Challenge, 2016
Proceedings of the 27th ACM Conference on Hypertext and Social Media, 2016
Proceedings of the Computing and Combinatorics  22nd International Conference, 2016