4 citations · 7 across the 2 of their papers we have counts for
4 papers
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs
Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski
We consider the problem of computing shortest paths in weighted unit-disk graphs in constant dimension . Although the single-source and all-pairs variants of this problem are we…
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics
Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis +1
In the Bin Packing problem one is given items with weights and bins with capacities . The goal is to find a partition of the items into set…
Equal-Subset-Sum Faster Than the Meet-in-the-Middle
Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz +1
In the Equal-Subset-Sum problem, we are given a set of integers and the problem is to decide if there exist two disjoint nonempty subsets , whose elements…
Counting Square-Free Numbers
Jakub Pawlewicz
The main topic of this contribution is the problem of counting square-free numbers not exceeding . Before this work we were able to do it in time (Comparing to the Big-O notatio…