The following pages link to Karol Węgrzycki (Q2110606):
Displayed 17 items.
- Hamiltonian cycle parameterized by treedepth in single exponential time and polynomial space (Q2110607) (← links)
- Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
- Locality-Sensitive Hashing Without False Negatives for $$l_p$$ (Q2817854) (← links)
- On Problems Equivalent to (min,+)-Convolution (Q4629984) (← links)
- Improved Distance Queries and Cycle Counting by Frobenius Normal Form (Q4636657) (← links)
- (Q5075820) (← links)
- On Problems Equivalent to (min,+)-Convolution (Q5111352) (← links)
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max (Q5212835) (← links)
- A Subquadratic Approximation Scheme for Partition (Q5236186) (← links)
- (Q6057540) (← links)
- Improving Schroeppel and Shamir’s algorithm for subset sum via orthogonal vectors (Q6065284) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
- Coverability in 2-VASS with one unary counter is in NP (Q6091190) (← links)
- (Q6147357) (← links)
- Hamiltonian Cycle Parameterized by Treedepth in Single Exponential Time and Polynomial Space (Q6170447) (← links)
- Computing generalized convolutions faster than brute force (Q6185947) (← links)
- Bounding generalized coloring numbers of planar graphs using coin models (Q6199193) (← links)