default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBartlomiej Bosek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Marcin Anholcer
, Bartlomiej Bosek, Jaroslaw Grytczuk:
Majority choosability of countable graphs. Eur. J. Comb. 117: 103829 (2024)- [c10]Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo:
First-Fit Coloring of Forests in Random Arrival Model. MFCS 2024: 33:1-33:10 - [i11]Bartlomiej Bosek, Grzegorz Gutowski, Michal Lason, Jakub Przybylo:
First-Fit Coloring of Forests in Random Arrival Model. CoRR abs/2404.17011 (2024) - [i10]Bartlomiej Bosek, Aleksander Katan:
A Note About Majority Colorings of Countable DAGs. CoRR abs/2406.04189 (2024) - 2022
- [j25]Bartlomiej Bosek, Jaroslaw Grytczuk, Grzegorz Gutowski, Oriol Serra, Mariusz Zajac:
Graph polynomials and group coloring of graphs. Eur. J. Comb. 102: 103505 (2022) - [j24]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A tight bound for shortest augmenting paths on trees. Theor. Comput. Sci. 901: 45-61 (2022) - [c9]Bartlomiej Bosek, Anna Zych-Pawlewicz:
Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. ESA 2022: 25:1-25:14 - [i9]Bartlomiej Bosek, Anna Zych-Pawlewicz:
Recoloring Unit Interval Graphs with Logarithmic Recourse Budget. CoRR abs/2202.08006 (2022) - 2021
- [j23]Bartlomiej Bosek, Andrzej Dudek, Michal Farnik, Jaroslaw Grytczuk, Przemyslaw Mazur:
Hat chromatic number of graphs. Discret. Math. 344(12): 112620 (2021) - [j22]Bartlomiej Bosek, Tomasz Krawczyk:
On-line partitioning of width w posets into wO(loglogw) chains. Eur. J. Comb. 91: 103202 (2021) - [j21]Csaba Biró, Bartlomiej Bosek, Heather C. Smith, William T. Trotter, Ruidong Wang, Stephen J. Young:
Planar Posets that are Accessible from Below Have Dimension at Most 6. Order 38(1): 21-36 (2021) - 2020
- [j20]Bartlomiej Bosek, Jaroslaw Grytczuk, William T. Trotter:
Local Dimension is Unbounded for Planar Posets. Electron. J. Comb. 27(4): 4 (2020) - [c8]Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz:
Recoloring Interval Graphs with Limited Recourse Budget. SWAT 2020: 17:1-17:23
2010 – 2019
- 2019
- [j19]Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk:
Weight choosability of oriented hypergraphs. Ars Math. Contemp. 16(1): 111-117 (2019) - [j18]Bartlomiej Bosek, Jaroslaw Grytczuk, Gabriel Jakóbczak:
Majority coloring game. Discret. Appl. Math. 255: 15-20 (2019) - [j17]Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Michal Farnik, Jaroslaw Grytczuk, Zofia Miechowicz:
Generalized arboricity of graphs with large girth. Discret. Math. 342(5): 1343-1350 (2019) - 2018
- [j16]Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith:
An Easy Subexponential Bound for Online Chain Partitioning. Electron. J. Comb. 25(2): 2 (2018) - [j15]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Centroidal Localization Game. Electron. J. Comb. 25(4): 4 (2018) - [j14]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Localization game on geometric and planar graphs. Discret. Appl. Math. 251: 30-39 (2018) - [j13]Bartlomiej Bosek, Michal Debski, Jaroslaw Grytczuk, Joanna Sokól, Malgorzata Sleszynska-Nowak, Wiktor Zelazny:
Graph coloring and Graham's greatest common divisor problem. Discret. Math. 341(3): 781-785 (2018) - [j12]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
Shortest Augmenting Paths for Online Matchings on Trees. Theory Comput. Syst. 62(2): 337-348 (2018) - [c7]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz:
A Tight Bound for Shortest Augmenting Paths on Trees. LATIN 2018: 201-216 - [i8]Bartlomiej Bosek:
On-line Chain Partitioning Approach to Scheduling. CoRR abs/1804.01567 (2018) - [i7]Bartlomiej Bosek, Tomasz Krawczyk:
On-line partitioning of width w posets into w^O(log log w) chains. CoRR abs/1810.00270 (2018) - 2017
- [j11]Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk:
Majority Choosability of Digraphs. Electron. J. Comb. 24(3): 3 (2017) - [i6]Bartlomiej Bosek, Dariusz Leniowski, Anna Zych, Piotr Sankowski:
The Shortest Augmenting Paths for Online Matchings on Trees. CoRR abs/1704.02093 (2017) - [i5]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Localization game on geometric and planar graphs. CoRR abs/1709.05904 (2017) - [i4]Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak:
Centroidal localization game. CoRR abs/1711.08836 (2017) - [i3]Bartlomiej Bosek, Jaroslaw Grytczuk, William T. Trotter:
Local Dimension is Unbounded for Planar Posets. CoRR abs/1712.06099 (2017) - 2016
- [j10]Bartlomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki:
On the Duality of Semiantichains and Unichain Coverings. Order 33(1): 29-38 (2016) - 2015
- [j9]Bartlomiej Bosek, Tomasz Krawczyk:
A subexponential upper bound for the on-line chain partitioning problem. Comb. 35(1): 1-38 (2015) - [c6]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Shortest Augmenting Paths for Online Matchings on Trees. WAOA 2015: 59-71 - 2014
- [j8]Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Jaroslaw Grytczuk, Grzegorz Matecki, Wiktor Zelazny:
Additive Coloring of Planar Graphs. Graphs Comb. 30(5): 1087-1098 (2014) - [c5]Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych:
Online Bipartite Matching in Offline Time. FOCS 2014: 384-393 - [i2]Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
On the Duality of Semiantichains and Unichain Coverings. CoRR abs/1401.1225 (2014) - [i1]Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith:
An Improved Subexponential Bound for On-line Chain Partitioning. CoRR abs/1410.3247 (2014) - 2013
- [j7]Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-Line Dimension of Semi-Orders. Order 30(2): 593-615 (2013) - [j6]Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki:
First-Fit Coloring of Incomparability Graphs. SIAM J. Discret. Math. 27(1): 126-140 (2013) - 2012
- [j5]Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek:
On-line version of Rabinovitch theorem for proper intervals. Discret. Math. 312(23): 3426-3436 (2012) - [j4]Bartlomiej Bosek, Stefan Felsner, Kamil Kloch, Tomasz Krawczyk, Grzegorz Matecki, Piotr Micek:
On-Line Chain Partitions of Orders: A Survey. Order 29(1): 49-73 (2012) - [c4]Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki:
News about Semiantichains and Unichain Coverings. CSR 2012: 43-51 - [c3]Bartlomiej Bosek, Leszek Horwath, Grzegorz Matecki, Arkadiusz Pawlik:
High performance GPGPU based system for matching people in a live video feed. IPTA 2012: 448-454 - 2011
- [j3]Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki:
Forbidden structures for efficient First-Fit chain partitioning (extended abstract). Electron. Notes Discret. Math. 38: 173-179 (2011) - 2010
- [j2]Bartlomiej Bosek, Tomasz Krawczyk, Edward Szczypka:
First-Fit Algorithm for the On-Line Chain Partitioning Problem. SIAM J. Discret. Math. 23(4): 1992-1999 (2010) - [c2]Bartlomiej Bosek, Tomasz Krawczyk:
The Sub-exponential Upper Bound for On-Line Chain Partitioning. FOCS 2010: 347-354
2000 – 2009
- 2007
- [j1]Patrick Baier, Bartlomiej Bosek, Piotr Micek:
On-line Chain Partitioning of Up-growing Interval Orders. Order 24(1): 1-13 (2007) - 2004
- [c1]Bartlomiej Bosek, Piotr Micek:
Variants of Online Chain Partition Problem of Posets. CLA 2004: 3-13
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-10-07 21:24 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:
