Karol Węgrzycki
Karol Węgrzycki
Saarland University and Max Planck Institute for Informatics
Zweryfikowany adres z cs.uni-saarland.de - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
422019
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
172016
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
122019
Locality-Sensitive Hashing Without False Negatives for
A Pacuk, P Sankowski, K Wegrzycki, P Wygocki
International Computing and Combinatorics Conference, 105-118, 2016
102016
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
92019
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
72017
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
52019
Improved Distance Queries and Cycle Counting by Frobenius Normal Form
P Sankowski, K Węgrzycki
Theory of Computing Systems 63 (5), 1049--1067, 2018
42018
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
42016
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
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021
12021
Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors
J Nederlof, K Węgrzycki
arXiv preprint arXiv:2010.08576, 2020
12020
Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space
J Nederlof, M Pilipczuk, CMF Swennenhuis, K Węgrzycki
Graph-Theoretic Concepts in Computer Science - 46th International Workshop …, 2020
12020
Provably Optimal Dynamic Programming
K Węgrzycki
University of Warsaw, 2021
2021
A Gap-ETH-Tight Approximation Scheme for Euclidean TSP
S Kisfaludi-Bak, J Nederlof, K Węgrzycki
arXiv preprint arXiv:2011.03778, 2020
2020
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–14