( en | de | ru )

 

Disambiguation of "Wegrzycki, Karol"

Author of the publication

copydeleteadd this publication to your clipboard
On Problems Equivalent to (min, +)-Convolution.

, , , and . ACM Trans. Algorithms, 15 (1): 14:1-14:25 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Helga Karolewski

August Karolus

Martin Karollus

Lásló Károlyi

Richard Karoli

 

Other publications of authors with the same name

Improved Distance Queries and Cycle Counting by Frobenius Normal Form., and . Theory Comput. Syst., 63 (5): 1049-1067 (2019)Improving Schroeppel and Shamir's Algorithm for Subset Sum via Orthogonal Vectors., and . CoRR, (2020)Parameterized Approximation for Maximum Weight Independent Set of Rectangles and Segments., , and . CoRR, (2022)Bounding Generalized Coloring Numbers of Planar Graphs Using Coin Models., , and . Electron. J. Comb., (2023)Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max., , and . STOC, page 943-954. ACM, (2019)A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics., , , and . SODA, page 1682-1701. SIAM, (2021)Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours., , , and . SODA, page 1433-1463. SIAM, (2023)A Gap-ETH-Tight Approximation Scheme for Euclidean TSP., , and . CoRR, (2020)On Problems Equivalent to (min, +)-Convolution., , , and . ACM Trans. Algorithms, 15 (1): 14:1-14:25 (2019)A polynomial-time OPTε-approximation algorithm for maximum independent set of connected subgraphs in a planar graph., , and . CoRR, (2023)