E-LIB Suche - Ergebnisse für: Wegrzycki, Karol

1

Hamiltonian Cycle Parameterized by Treedepth in Single Expo..:

Nederlof, Jesper ; Pilipczuk, Michał ; Swennenhuis, Celine M. F..
SIAM Journal on Discrete Mathematics. 37 (2023) 3 - p. 1566-1586 , 2023

Link: https://doi.org/10.1137/..

2

Coverability in 2-VASS with One Unary Counter is in NP:

, In: Lecture Notes in Computer Science; Foundations of Software Science and Computation Structures,

Mazowiecki, Filip ; Sinclair-Banks, Henry ; Węgrzycki, Karol - p. 196-217 , 2023

Link: https://doi.org/10.1007/..

3

A Faster Exponential Time Algorithm for Bin Packing With a ..:

Nederlof, Jesper ; Pawlewicz, Jakub ; Swennenhuis, Céline M. F..
SIAM Journal on Computing. 52 (2023) 6 - p. 1369-1412 , 2023

Link: https://doi.org/10.1137/..

4

Computing Generalized Convolutions Faster Than Brute Force:

Esmer, Barış Can ; Kulik, Ariel ; Marx, Dániel..
Algorithmica. 86 (2023) 1 - p. 334-366 , 2023

Link: https://doi.org/10.1007/..

5

A Gap-ETH-Tight Approximation Scheme for Euclidean TSP:

, In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS),

Kisfaludi-Bak, Sandor ; Nederlof, Jesper ; Wegrzycki, Karol - p. 351-362 , 2022

Link: https://doi.org/10.1109/..

6

A faster exponential time algorithm for bin packing with a ..:

, In: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms,

Nederlof, Jesper ; Pawlewicz, Jakub ; Swennenhuis, Céline M. F.. - p. 1682-1701 , 2021

Link: https://dl.acm.org/doi/1..

7

Improving Schroeppel and Shamir's algorithm for subset sum ..:

, In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,

Nederlof, Jesper ; Węgrzycki, Karol - p. 1670-1683 , 2021

Link: https://dl.acm.org/doi/1..

8

A Faster Exponential Time Algorithm for Bin Packing With a ..:

, In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA),

Nederlof, Jesper ; Pawlewicz, Jakub ; Swennenhuis, Céline M. F.. - p. 1682-1701 , 2021

Link: https://doi.org/10.1137/..

9

Hamiltonian Cycle Parameterized by Treedepth in Single Expo..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Nederlof, Jesper ; Pilipczuk, Michał ; Swennenhuis, Céline M. F.. - p. 27-39 , 2020

Link: https://doi.org/10.1007/..

10

On Problems Equivalent to (min,+)-Convolution:

Cygan, Marek ; Mucha, Marcin ; Węgrzycki, Karol.
ACM Transactions on Algorithms (TALG). 15 (2019) 1 - p. 1-25 , 2019

Link: https://dl.acm.org/doi/1..

11

On Problems Equivalent to (min,+)-Convolution:

Cygan, Marek ; Mucha, Marcin ; Węgrzycki, Karol.
ACM Transactions on Algorithms. 15 (2019) 1 - p. 1-25 , 2019

Link: https://doi.org/10.1145/..

12

Approximating APSP without scaling: equivalence of approxim..:

, In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing,

Bringmann, Karl ; Künnemann, Marvin ; Węgrzycki, Karol - p. 943-954 , 2019

Link: https://dl.acm.org/doi/1..

13

A subquadratic approximation scheme for partition:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,

Mucha, Marcin ; Węgrzycki, Karol ; Włodarczyk, Michał - p. 70-88 , 2019

Link: https://dl.acm.org/doi/1..

14

Improved Distance Queries and Cycle Counting by Frobenius N..:

Sankowski, Piotr ; Węgrzycki, Karol
Theory of Computing Systems. 63 (2018) 5 - p. 1049-1067 , 2018

Link: https://doi.org/10.1007/..

15

Why Do Cascade Sizes Follow a Power-Law?:

, In: Proceedings of the 26th International Conference on World Wide Web,

Wegrzycki, Karol ; Sankowski, Piotr ; Pacuk, Andrzej. - p. 569-576 , 2017

Link: https://dl.acm.org/doi/1..