default search action
Jakub Pawlewicz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j7]Jesper Nederlof
, Jakub Pawlewicz, Céline M. F. Swennenhuis
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SIAM J. Comput. 52(6): 1369-1412 (2023) - 2021
- [c13]Adam Karczmarz
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. SoCG 2021: 46:1-46:15 - [c12]Jesper Nederlof, Jakub Pawlewicz
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. SODA 2021: 1682-1701 - [i4]Adam Karczmarz, Jakub Pawlewicz, Piotr Sankowski:
Sublinear Average-Case Shortest Paths in Weighted Unit-Disk Graphs. CoRR abs/2103.09684 (2021) - 2020
- [c11]Bartlomiej Bosek
Recoloring Interval Graphs with Limited Recourse Budget. SWAT 2020: 17:1-17:23 - [i3]Jesper Nederlof, Jakub Pawlewicz, Céline M. F. Swennenhuis, Karol Wegrzycki:
A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics. CoRR abs/2007.08204 (2020)
2010 – 2019
- 2019
- [c10]Marcin Mucha
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. ESA 2019: 73:1-73:16 - [i2]Marcin Mucha, Jesper Nederlof, Jakub Pawlewicz, Karol Wegrzycki:
Equal-Subset-Sum Faster Than the Meet-in-the-Middle. CoRR abs/1905.02424 (2019) - 2017
- [j6]Ryan Hayward, Jakub Pawlewicz
Mohex Wins 2015 Hex 11×11 and Hex 13×13 Tournaments. J. Int. Comput. Games Assoc. 39(1): 60-64 (2017) - 2016
- [j5]Jakub Pawlewicz
Conspiracy number search with relative sibling scores. Theor. Comput. Sci. 644: 127-142 (2016) - [c9]Henryk Michalewski, Andrzej Nagórko, Jakub Pawlewicz:
An upper bound of 84 for Morpion Solitaire 5D. CCCG 2016: 270-278 - 2015
- [j4]Jakub Pawlewicz
Stronger Virtual Connections in Hex. IEEE Trans. Comput. Intell. AI Games 7(2): 156-166 (2015) - [c8]Jakub Pawlewicz
Feature Strength and Parallelization of Sibling Conspiracy Number Search. ACG 2015: 198-209 - [c7]Henryk Michalewski, Andrzej Nagórko, Jakub Pawlewicz
485 - A New Upper Bound for Morpion Solitaire. CGW/GIGA@IJCAI 2015: 44-59 - [c6]Jakub Pawlewicz, Ryan B. Hayward:
Sibling Conspiracy Number Search. SOCS 2015: 105-112 - 2013
- [j3]Ryan Hayward, Broderick Arneson, Shih-Chieh Huang, Jakub Pawlewicz
MOHEX Wins Hex Tournament. J. Int. Comput. Games Assoc. 36(3): 180-183 (2013) - [c5]Shih-Chieh Huang, Broderick Arneson, Ryan B. Hayward, Martin Müller, Jakub Pawlewicz
MoHex 2.0: A Pattern-Based MCTS Hex Player. Computers and Games 2013: 60-71 - [c4]Jakub Pawlewicz
Scalable Parallel DFPN Search. Computers and Games 2013: 138-150 - 2011
- [j2]Jakub Pawlewicz
Towards Optimal Play in Multi-Player Yahtzee. J. Int. Comput. Games Assoc. 34(1): 7-21 (2011) - [i1]Jakub Pawlewicz:
Counting Square-Free Numbers. CoRR abs/1107.4890 (2011) - 2010
- [c3]Jakub Pawlewicz
Nearly Optimal Computer Play in Multi-player Yahtzee. Computers and Games 2010: 250-262
2000 – 2009
- 2009
- [j1]Jakub Pawlewicz
Order Statistics in the Farey Sequences in Sublinear Time and Counting Primitive Lattice Points in Polygons. Algorithmica 55(2): 271-282 (2009) - 2007
- [c2]Jakub Pawlewicz
Order Statistics in the Farey Sequences in Sublinear Time. ESA 2007: 218-229 - 2006
- [c1]Jakub Pawlewicz
Improving Depth-First PN-Search: 1 + epsilon Trick. Computers and Games 2006: 160-171
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: