Most significant publications

• Bartłomiej Bosek, Anna Zych-Pawlewicz, Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget, European Symposium on Algorithms [ESA], European Symposium on Algorithms [ESA], (2022), 25:1-25:14
• Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz, A tight bound for shortest augmenting paths on trees, Theoretical Computer Science 901 (2022), 45-61
• Csaba Biró, Bartłomiej 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) (2021), 21-36
• Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych, Online bipartite matching in offline time, (2014), "55th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2014, October 18-21, 2014, Philadelphia, PA, USA", Institute of Electrical and Electronics Engineers (IEEE)
• Bartłomiej Bosek, Tomasz Krawczyk, The Sub-exponential Upper Bound for On-Line Chain Partitioning, (2010), "51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, October 23-26, 2010, Las Vegas, Nevada, USA", Institute of Electrical and Electronics Engineers (IEEE)