Obserwuj
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
862019
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
332019
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
282016
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
242019
Knapsack and subset sum with small items
A Polak, L Rohwedder, K Węgrzycki
48th International Colloquium on Automata, Languages, and Programming (ICALP …, 2021
212021
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
202019
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
172023
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
172017
Locality-Sensitive Hashing Without False Negatives for
A Pacuk, P Sankowski, K Wegrzycki, P Wygocki
International Computing and Combinatorics Conference, 105-118, 2016
122016
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
92022
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
72021
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
62023
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
52022
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
52021
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
42023
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
Bounding generalized coloring numbers of planar graphs using coin models
J Nederlof, M Pilipczuk, K Węgrzycki
Electronic Journal of Combinatorics 30 (3), 2023
22023
Coverability in 2-VASS with One Unary Counter is in NP
F Mazowiecki, H Sinclair-Banks, K Węgrzycki
International Conference on Foundations of Software Science and Computation …, 2023
22023
Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments
J Cslovjecsek, M Pilipczuk, K Węgrzycki
arXiv preprint arXiv:2212.01620, 2022
22022
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
12023
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20