Variants of Online Chain Partition Problem of Posets. - Bartlomiej Bosek; Piotr Micek (CLA, 2004)

On-line Chain Partitioning of Up-growing Interval Orders. - Patrick Baier; Bartlomiej Bosek; Piotr Micek (Order, 2007)

The Sub-exponential Upper Bound for On-Line Chain Partitioning. - Bartlomiej Bosek; Tomasz Krawczyk (FOCS, 2010)

First-Fit Algorithm for the On-Line Chain Partitioning Problem. - Bartlomiej Bosek; Tomasz Krawczyk; Edward Szczypka (SIAM J. Discret. Math., 2010)

Forbidden structures for efficient First-Fit chain partitioning (extended abstract). - Bartlomiej Bosek; Tomasz Krawczyk; Grzegorz Matecki (Electron. Notes Discret. Math., 2011)

News about Semiantichains and Unichain Coverings. - Bartlomiej Bosek; Stefan Felsner; Kolja B. Knauer; Grzegorz Matecki (CSR, 2012)

High performance GPGPU based system for matching people in a live video feed. - Bartlomiej Bosek; Leszek Horwath; Grzegorz Matecki; Arkadiusz Pawlik (IPTA, 2012)

On-line version of Rabinovitch theorem for proper intervals. - Bartlomiej Bosek; Kamil Kloch; Tomasz Krawczyk; Piotr Micek (Discret. Math., 2012)

On-Line Chain Partitions of Orders: A Survey. - Bartlomiej Bosek; Stefan Felsner; Kamil Kloch; Tomasz Krawczyk; Grzegorz Matecki; Piotr Micek (Order, 2012)

On-Line Dimension of Semi-Orders. - Bartlomiej Bosek; Kamil Kloch; Tomasz Krawczyk; Piotr Micek (Order, 2013)

First-Fit Coloring of Incomparability Graphs. - Bartlomiej Bosek; Tomasz Krawczyk; Grzegorz Matecki (SIAM J. Discret. Math., 2013)

Online Bipartite Matching in Offline Time. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych (FOCS, 2014)

An Improved Subexponential Bound for On-line Chain Partitioning. - Bartlomiej Bosek; Hal A. Kierstead; Tomasz Krawczyk; Grzegorz Matecki; Matthew E. Smith 001 (CoRR, 2014)

Additive Coloring of Planar Graphs. - Tomasz Bartnicki; Bartlomiej Bosek; Sebastian Czerwinski; Jaroslaw Grytczuk; Grzegorz Matecki; Wiktor Zelazny (Graphs Comb., 2014)

A subexponential upper bound for the on-line chain partitioning problem. - Bartlomiej Bosek; Tomasz Krawczyk (Comb., 2015)

On the Duality of Semiantichains and Unichain Coverings. - Bartlomiej Bosek; Stefan Felsner; Kolja Knauer; Grzegorz Matecki (Order, 2016)

Majority Choosability of Digraphs. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk (Electron. J. Comb., 2017)

Centroidal Localization Game. - Bartlomiej Bosek; Przemyslaw Gordinowicz; Jaroslaw Grytczuk; Nicolas Nisse; Joanna Sokól; Malgorzata Sleszynska-Nowak (Electron. J. Comb., 2018)

An Easy Subexponential Bound for Online Chain Partitioning. - Bartlomiej Bosek; Hal A. Kierstead; Tomasz Krawczyk; Grzegorz Matecki; Matthew E. Smith 001 (Electron. J. Comb., 2018)

On-line Chain Partitioning Approach to Scheduling. - Bartlomiej Bosek (CoRR, 2018)

On-line partitioning of width w posets into w^O(log log w) chains. - Bartlomiej Bosek; Tomasz Krawczyk (CoRR, 2018)

Localization game on geometric and planar graphs. - Bartlomiej Bosek; Przemyslaw Gordinowicz; Jaroslaw Grytczuk; Nicolas Nisse; Joanna Sokól; Malgorzata Sleszynska-Nowak (Discret. Appl. Math., 2018)

Graph coloring and Graham's greatest common divisor problem. - Bartlomiej Bosek; Michal Debski; Jaroslaw Grytczuk; Joanna Sokól; Malgorzata Sleszynska-Nowak; Wiktor Zelazny (Discret. Math., 2018)

Shortest Augmenting Paths for Online Matchings on Trees. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych-Pawlewicz (Theory Comput. Syst., 2018)

Weight choosability of oriented hypergraphs. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk (Ars Math. Contemp., 2019)

Majority coloring game. - Bartlomiej Bosek; Jaroslaw Grytczuk; Gabriel Jakóbczak (Discret. Appl. Math., 2019)

Generalized arboricity of graphs with large girth. - Tomasz Bartnicki; Bartlomiej Bosek; Sebastian Czerwinski; Michal Farnik; Jaroslaw Grytczuk; Zofia Miechowicz (Discret. Math., 2019)

Recoloring Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Yann Disser; Andreas Emil Feldmann; Jakub Pawlewicz; Anna Zych-Pawlewicz (SWAT, 2020)

Local Dimension is Unbounded for Planar Posets. - Bartlomiej Bosek; Jaroslaw Grytczuk; William T. Trotter (Electron. J. Comb., 2020)

Hat chromatic number of graphs. - Bartlomiej Bosek; Andrzej Dudek; Michal Farnik; Jaroslaw Grytczuk; Przemyslaw Mazur (Discret. Math., 2021)

On-line partitioning of width w posets into wO(loglogw) chains. - Bartlomiej Bosek; Tomasz Krawczyk (Eur. J. Comb., 2021)

Planar Posets that are Accessible from Below Have Dimension at Most 6. - Csaba Biró; Bartlomiej Bosek; Heather C. Smith; William T. Trotter; Ruidong Wang; Stephen J. Young (Order, 2021)

Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget. - Bartlomiej Bosek; Anna Zych-Pawlewicz (ESA, 2022)

Recoloring Unit Interval Graphs with Logarithmic Recourse Budget. - Bartlomiej Bosek; Anna Zych-Pawlewicz (CoRR, 2022)

Graph polynomials and group coloring of graphs. - Bartlomiej Bosek; Jaroslaw Grytczuk; Grzegorz Gutowski; Oriol Serra; Mariusz Zajac (Eur. J. Comb., 2022)

A tight bound for shortest augmenting paths on trees. - Bartlomiej Bosek; Dariusz Leniowski; Piotr Sankowski; Anna Zych-Pawlewicz (Theor. Comput. Sci., 2022)

First-Fit Coloring of Forests in Random Arrival Model. - Bartlomiej Bosek; Grzegorz Gutowski; Michal Lason; Jakub Przybylo (MFCS, 2024)

A Note About Majority Colorings of Countable DAGs. - Bartlomiej Bosek; Aleksander Katan (CoRR, 2024)

Majority choosability of countable graphs. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk (Eur. J. Comb., 2024)

Mrs. Correct and majority colorings. - Marcin Anholcer; Bartlomiej Bosek; Jaroslaw Grytczuk; Grzegorz Gutowski; Jakub Przybylo; Mariusz Zajac (Discret. Math., 2025)

Alon-Tarsi for hypergraphs. - Marcin Anholcer; Bartlomiej Bosek; Grzegorz Gutowski; Michal Lason; Jakub Przybylo; Oriol Serra; Michal Tuczynski; Lluís Vena; Mariusz Zajac (CoRR, 2025)