E-LIB Suche - Ergebnisse für: Pawlewicz, Jakub

1

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/..

2

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..

3

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/..

4

Conspiracy number search with relative sibling scores:

Pawlewicz, Jakub ; Hayward, Ryan B.
Theoretical Computer Science. 644 (2016) - p. 127-142 , 2016

Link: https://doi.org/10.1016/..

5

Stronger Virtual Connections in Hex:

Pawlewicz, Jakub ; Hayward, Ryan ; Henderson, Philip.
IEEE Transactions on Computational Intelligence and AI in Games. 7 (2015) 2 - p. 156-166 , 2015

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

6

Order Statistics in the Farey Sequences in Sublinear Time a..:

Pawlewicz, Jakub ; Pătraşcu, Mihai
Algorithmica. 55 (2008) 2 - p. 271-282 , 2008

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

7

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

Nederlof, Jesper ; Pawlewicz, Jakub ; Swennenhuis, Céline M. F.
https://dspace.library.uu.nl/handle/1874/416102. , 2021

Link: https://dspace.library.u..

8

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk..:

Karczmarz, Adam ; Pawlewicz, Jakub ; Sankowski, Piotr
http://arxiv.org/abs/2103.09684. , 2021

Link: http://arxiv.org/abs/210..

9

Sublinear Average-Case Shortest Paths in Weighted Unit-Disk..:

Karczmarz, Adam ; Pawlewicz, Jakub ; Sankowski, Piotr
doi:10.4230/LIPIcs.SoCG.2021.46. , 2021

Link: https://doi.org/10.4230/..

10

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

Nederlof, Jesper ; Pawlewicz, Jakub ; Swennenhuis, Céline M. F.
http://arxiv.org/abs/2007.08204. , 2020

Link: http://arxiv.org/abs/200..

11

Recoloring interval graphs with limited recourse budget:

Bosek, Bartłomiej ; Disser, Yann ; Feldmann, Andreas Emil..
17th Scandinavian symposium and workshops on algorithm theory (SWAT 2020) s. 17:1-17:23. , 2020

Link: https://ruj.uj.edu.pl/xm..

12

Recoloring Interval Graphs with Limited Recourse Budget:

Bosek, Bart?omiej ; Disser, Yann ; Feldmann, Andreas Emil..
doi:10.4230/LIPIcs.SWAT.2020.17. , 2020

Link: https://doi.org/10.4230/..

13

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

Nederlof, Jesper ; Pawlewicz, Jakub ; Swennenhuis, Céline M. F.
https://dspace.library.uu.nl/handle/1874/416092. , 2020

Link: https://dspace.library.u..

14

Equal-subset-sum faster than the meet-in-the-middle:

Mucha, Marcin ; Nederlof, Jesper ; Pawlewicz, Jakub.
Mucha , M , Nederlof , J , Pawlewicz , J & Węgrzycki , K 2019 , Equal-subset-sum faster than the meet-in-the-middle . in M A Bender , O Svensson & G Herman (eds) , 27th Annual European Symposium on Algorithms, ESA 2019 . , 73 , Leibniz International Proceedings in Informatics, LIPIcs , vol. 144 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , 27th Annual European Symposium on Algorithms, ESA 2019 , Munich/Garching , Germany , 9/09/19 . https://doi.org/10.4230/LIPIcs.ESA.2019.73. , 2019

Link: https://research.tue.nl/..

15

Equal-Subset-Sum Faster Than the Meet-in-the-Middle:

Mucha, Marcin ; Nederlof, Jesper ; Pawlewicz, Jakub.
http://arxiv.org/abs/1905.02424. , 2019

Link: http://arxiv.org/abs/190..