Bartlomiej Bosek

According to our database, Bartlomiej Bosek authored at least 37 papers between 2004 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Majority choosability of countable graphs.

Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk

Eur. J. Comb., March, 2024

2022

A tight bound for shortest augmenting paths on trees.

Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz

Theor. Comput. Sci., 2022

Graph polynomials and group coloring of graphs.

Bartlomiej Bosek, Jaroslaw Grytczuk, Grzegorz Gutowski, Oriol Serra, Mariusz Zajac

Eur. J. Comb., 2022

Recoloring Unit Interval Graphs with Logarithmic Recourse Budget.

Bartlomiej Bosek, Anna Zych-Pawlewicz

CoRR, 2022

Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget.

Bartlomiej Bosek, Anna Zych-Pawlewicz

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

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

On-line partitioning of width w posets into wO(loglogw) chains.

Bartlomiej Bosek, Tomasz Krawczyk

Eur. J. Comb., 2021

Hat chromatic number of graphs.

Bartlomiej Bosek, Andrzej Dudek, Michal Farnik, Jaroslaw Grytczuk, Przemyslaw Mazur

Discret. Math., 2021

2020

Local Dimension is Unbounded for Planar Posets.

Bartlomiej Bosek, Jaroslaw Grytczuk, William T. Trotter

Electron. J. Comb., 2020

Recoloring Interval Graphs with Limited Recourse Budget.

Bartlomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

2019

Generalized arboricity of graphs with large girth.

Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Michal Farnik, Jaroslaw Grytczuk, Zofia Miechowicz

Discret. Math., 2019

Majority coloring game.

Bartlomiej Bosek, Jaroslaw Grytczuk, Gabriel Jakóbczak

Discret. Appl. Math., 2019

Weight choosability of oriented hypergraphs.

Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk

Ars Math. Contemp., 2019

2018

Shortest Augmenting Paths for Online Matchings on Trees.

Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz

Theory Comput. Syst., 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

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

On-line partitioning of width w posets into w^O(log log w) chains.

Bartlomiej Bosek, Tomasz Krawczyk

CoRR, 2018

On-line Chain Partitioning Approach to Scheduling.

Bartlomiej Bosek

CoRR, 2018

An Easy Subexponential Bound for Online Chain Partitioning.

Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith

Electron. J. Comb., 2018

Centroidal Localization Game.

Bartlomiej Bosek, Przemyslaw Gordinowicz, Jaroslaw Grytczuk, Nicolas Nisse, Joanna Sokól, Malgorzata Sleszynska-Nowak

Electron. J. Comb., 2018

2017

Majority Choosability of Digraphs.

Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk

Electron. J. Comb., 2017

2016

On the Duality of Semiantichains and Unichain Coverings.

Bartlomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki

Order, 2016

2015

A subexponential upper bound for the on-line chain partitioning problem.

Bartlomiej Bosek, Tomasz Krawczyk

Comb., 2015

2014

Additive Coloring of Planar Graphs.

Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Jaroslaw Grytczuk, Grzegorz Matecki, Wiktor Zelazny

Graphs Comb., 2014

An Improved Subexponential Bound for On-line Chain Partitioning.

Bartlomiej Bosek, Hal A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew E. Smith

CoRR, 2014

Online Bipartite Matching in Offline Time.

Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych

Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014

2013

First-Fit Coloring of Incomparability Graphs.

Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki

SIAM J. Discret. Math., 2013

On-Line Dimension of Semi-Orders.

Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek

Order, 2013

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 version of Rabinovitch theorem for proper intervals.

Bartlomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek

Discret. Math., 2012

High performance GPGPU based system for matching people in a live video feed.

Bartlomiej Bosek, Leszek Horwath, Grzegorz Matecki, Arkadiusz Pawlik

Proceedings of the 3rd International Conference on Image Processing Theory Tools and Applications, 2012

News about Semiantichains and Unichain Coverings.

Bartlomiej Bosek, Stefan Felsner, Kolja B. Knauer, Grzegorz Matecki

Proceedings of the Computer Science - Theory and Applications, 2012

2011

Forbidden structures for efficient First-Fit chain partitioning (extended abstract).

Bartlomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki

Electron. Notes Discret. Math., 2011

2010

First-Fit Algorithm for the On-Line Chain Partitioning Problem.

Bartlomiej Bosek, Tomasz Krawczyk, Edward Szczypka

SIAM J. Discret. Math., 2010

The Sub-exponential Upper Bound for On-Line Chain Partitioning.

Bartlomiej Bosek, Tomasz Krawczyk

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2007

On-line Chain Partitioning of Up-growing Interval Orders.

Patrick Baier, Bartlomiej Bosek, Piotr Micek

Order, 2007

2004

Variants of Online Chain Partition Problem of Posets.

Bartlomiej Bosek, Piotr Micek

Proceedings of the Second Workshop on Computational Logic and Applications, 2004