Publications

Bartłomiej Bosek

Number of publications: 25

2024

• Bartłomiej Bosek , Grzegorz Gutowski, Michał Lasoń, Jakub Przybyło, First-fit coloring of forests in random arrival model, Leibniz International Proceedings in Informatics, LIPIcs, 49th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovakia, 26 August 2024 - 30 August 2024. See in PBN
• Paweł Kropiński, Mikołaj Pudo, Bartłomiej Bosek , State ownership, probability of informed trading, and profitability potential : evidence from the Warsaw Stock Exchange, International Review of Financial Analysis, 95, Part B 2024. See in PBN

2022

• Anna Zych-Pawlewicz , Piotr Sankowski , Dariusz Leniowski, Bartłomiej Bosek , A tight bound for shortest augmenting paths on trees, Theoretical Computer Science, 901 2022, p. 45-61. See in PBN
• Bartłomiej Bosek , Anna Zych-Pawlewicz , Dynamic coloring of unit interval graphs with limited recourse budget, 30TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, Berlin/Potsdam, Germany, 5 September 2022 - 7 September 2022. See in PBN

2021

• Stephen J. Young, Ruidong Wang, William T. Trotter, Heather C. Smith, Bartłomiej Bosek , Csaba Biró, Planar posets that are accessible from below have dimension at most 6, ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 38 2021, p. 21-36. See in PBN

2020

• Tomasz Krawczyk, Bartłomiej Bosek , On-line partitioning of width $w$ posets into $w^{O(log log w)}$ chains, European Journal of Combinatorics, 91 2020. See in PBN
• Bartłomiej Bosek , Yann Disser, Andreas Emil, Jakub Pawlewicz , Anna Zych-Pawlewicz , Recoloring interval graphs with limited recourse budget, Leibniz International Proceedings in Informatics, LIPIcs, 17th Scandinavian Symposium and Workshops on Algorithm Theory, Torshavn, the Faroe Islands, 22 June 2020 - 24 June 2020. See in PBN

2019

• Tomasz Bartnicki, Bartłomiej Bosek , Sebastian Czerwiński, Michał Farnik, Jarosław Grytczuk, Zofia Miechowicz, Generalized arboricity of graphs with large girth, Discrete Mathematics, 342 (5) 2019, p. 1343-1350. See in PBN
• Bartłomiej Bosek , Jarosław Grytczuk, Gabriel Jakóbczak, Majority coloring game, DISCRETE APPLIED MATHEMATICS, 255 2019, p. 15-20. See in PBN
• Marcin Anholcer, Jarosław Grytczuk, Bartłomiej Bosek , Majority coloring of infinite digraphs, Acta Mathematica Universitatis Comenianae, 88 (3) 2019, p. 371-376. See in PBN
• Marcin Anholcer, Bartłomiej Bosek , Jarosław Grytczuk, Weight choosability of oriented hypergraphs, ARS Mathematica Contemporanea, 16 (1) 2019, p. 111-117. See in PBN

2018

• Bartłomiej Bosek , Tomasz Krawczyk, Grzegorz Matecki, An easy subexponential bound for online chain partitioning, The Electronic Journal of Combinatorics, 25 (2) 2018, p. P2.28. See in PBN
• Bartłomiej Bosek , Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Chybowska-Sokół, Małgorzata Śleszyńska-Nowak, Centroidal Localization Game, The Electronic Journal of Combinatorics, 25 (4) 2018, p. 1-19. See in PBN
• Bartłomiej Bosek , Michał Dębski, Jarosław Grytczuk, Joanna Chybowska-Sokół, Małgorzata Śleszyńska-Nowak, Wiktor Żelazny, Graph coloring and Graham′s greatest common divisor problem, Discrete Mathematics, 341 (3) 2018, p. 781-785. See in PBN
• Bartłomiej Bosek , Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Chybowska-Sokół, Małgorzata Śleszyńska-Nowak, Localization game on geometric and planar graphs, DISCRETE APPLIED MATHEMATICS, 251 2018, p. 30-39. See in PBN
• Bartłomiej Bosek , Dariusz Leniowski, Anna Zych-Pawlewicz , Piotr Sankowski , Shortest augmenting paths for online matchings on trees, Theory of Computing Systems, 62 (2) 2018, p. 337-348. See in PBN

2017

• Marcin Anholcer, Bartłomiej Bosek , Jarosław Grytczuk, Majority choosability of digraphs, The Electronic Journal of Combinatorics, 24 (3) 2017, p. 1-5. See in PBN

2016

• Bartłomiej Bosek , Grzegorz Matecki, On the duality of semiantichains and unichain coverings, ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 33 (1) 2016, p. 29-38. See in PBN

2015

• Bartłomiej Bosek , Tomasz Krawczyk, A subexponential upper bound for the on-line chain partitioning problem, Combinatorica, 35 (1) 2015, p. 1-38. See in PBN
• Bartłomiej Bosek , Shortest augmenting paths for online matchings on trees, 13th International Workshop on Approximation and Online Algorithms WAOA 2015, Patras, Greece, 17 September 2015 - 18 September 2015. See in PBN

2014

• Dariusz Leniowski, Piotr Sankowski , Anna Zych-Pawlewicz , Bartłomiej Bosek , Online Bipartite Matching in Offline Time, 55th IEEE Symposium on Foundations of Computer Science (FOCS14), Filadelfia, the United States of America, 18 October 2014 - 21 October 2014. See in PBN

2013

• Bartłomiej Bosek , Tomasz Krawczyk, Grzegorz Matecki, First-fit coloring of incomparability graphs, SIAM JOURNAL ON DISCRETE MATHEMATICS, 27 (1) 2013, p. 126-140. See in PBN
• Bartłomiej Bosek , Tomasz Krawczyk, Piotr Micek, On-line dimension of semi-orders, ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 30 (2) 2013, p. 593-615. See in PBN

Others

• Bartłomiej Bosek , A tight bound for shortest augmenting paths on trees, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), , p. 201-216. See in PBN
• Bartłomiej Bosek , Sebastian Czerwiński, Michał Dębski, Jarosław Grytczuk, Zbigniew Lonc, Paweł Rzążewski , Coloring chain hypergraphs, 20 Years of the Faculty of Mathematics and Information Science. A collection of research papers in mathematics, , p. 41--53. See in PBN