dr hab. Bartłomiej Bosek
Jednostki:
- Wydział Matematyki i Informatyki UJ
- Instytut Informatyki Analitycznej
- Katedra Algorytmiki
Doktorat Otwarcie: 2006-06-29, Zamknięcie: 2008-12-18
Habilitacja Otwarcie: 2019-04-25, Zamknięcie: 2019-11-14
Publikacje:
	43.
		Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski,  Jakub Przybyło, Mariusz Zając	
	
		Mrs. Correct and Majority Colorings, Discrete Mathematics vol. 348 (11) (2025), 114577	
	42.
		Paweł Kropiński, Bartłomiej Bosek, Mikołaj Pudo	
	
	41.
		First-Fit Coloring of Forests in Random Arrival Model, International Symposium on Mathematical Foundations of Computer Science [MFCS] vol. 306 (2024), 33:1-33:10	
	40.
		Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk	
	
		Majority choosability of countable graphs, European Journal of Combinatorics vol. 117 (2024), 103829	
	39.
		Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski,  Jakub Przybyło, Rafał Pyzik, Mariusz Zając	
	
		On a problem of Steinhaus, Bulletin of the London Mathematical Society vol. 55 (6) (2023), 2635-2652	
	38.
		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	
	37.
		Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Oriol Serra, Mariusz Zając	
	
		Graph Polynomials and Group Coloring of Graphs, European Journal of Combinatorics vol. 102 (2022), 103505	
	36.
		Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz	
	
		A tight bound for shortest augmenting paths on trees, Theoretical Computer Science vol. 901 (2022), 45-61	
	35.
		Bartłomiej Bosek, Jarosław Grytczuk, Barbara Nayar, Bartosz Zaleski	
	
		Nonrepetitive List Colorings of the Integers, Annals of Combinatorics vol. 25(2) (2021), 393-403	
	34.
		Hat chromatic number of graphs, Discrete Mathematics vol. 344(12) (2021), 112620	
	33.
		Bartłomiej Bosek, Tomasz Krawczyk	
	
		On-line partitioning of width w posets into w^O(log log w) chains, European Journal of Combinatorics vol. 91 (2021), 103202	
	32.
		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 vol. 38(1) (2021), 21-36	
	31.
		Bartłomiej Bosek, Jarosław Grytczuk, William T. Trotter	
	
		Local dimension is unbounded for planar posets, Electronic Journal of Combinatorics vol. 27(4) (2020), P4.28	
	30.
		Bartłomiej Bosek, Yann Disser, Andreas Emil Feldmann, Jakub Pawlewicz, Anna Zych-Pawlewicz	
	
		Recoloring Interval Graphs with Limited Recourse Budget vol. 162 (2020), "17th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2020, June 22-24, 2020, Tórshavn, Faroe Islands", Schloss Dagstuhl – Leibniz-Zentrum für Informatik	
	29.
		Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk	
	
		Majority coloring of infinite digraphs, Acta Mathematica Universitatis Comenianae vol. 88 (3) (2019), 371-376	
	28.
		Bartłomiej Bosek, Michał Farnik, Jarosław Grytczuk,  Sebastian Czerwiński,  Tomasz Bartnicki,  Zofia Miechowicz	
	
		Generalized arboricity of graphs with large girth, Discrete Mathematics vol. 342(5) (2019), 1343-1350	
	27.
		Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk	
	
		Weight choosability of oriented hypergraphs, ARS Mathematica Contemporanea vol. 16 (1) (2019), 111-117	
	26.
		Bartłomiej Bosek, Jarosław Grytczuk, Gabriel Jakóbczak	
	
		Majority coloring game, Discrete Applied Mathematics vol. 255 (2019), 15-20	
	25.
		Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak	
	
		Centroidal Localization Game, Electronic Journal of Combinatorics vol. 25 (4) (2018), 1-19	
	24.
		Bartłomiej Bosek, Przemysław Gordinowicz, Jarosław Grytczuk, Nicolas Nisse, Joanna Sokół, Małgorzata Śleszyńska-Nowak	
	
		Localization game on geometric and planar graphs, Discrete Applied Mathematics vol. 251 (2018), 30-39	
	23.
		Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz	
	
		A Tight Bound for Shortest Augmenting Paths on Trees vol. 10870 (2018), "LATIN 2018: Theoretical Informatics", Springer	
	22.
		Bartłomiej Bosek, H. A. Kierstead, Tomasz Krawczyk, Grzegorz Matecki, Matthew Smith	
	
		An Easy Subexponential Bound for Online Chain Partitioning, Electronic Journal of Combinatorics vol. 25(2) (2018), #P2.28	
	21.
		Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz	
	
		Shortest Augmenting Paths for Online Matchings on Trees, Theory of Computing Systems vol. 62(2) (2018), 337-348	
	20.
		Bartłomiej Bosek, Michał Dębski, Jarosław Grytczuk, Joanna Sokół, Małgorzata Śleszyńska-Nowak, Wiktor Żelazny	
	
		Graph coloring and Graham’s greatest common divisor problem, Discrete Mathematics vol. 341(3) (2018), 781-785	
	19.
		Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk	
	
		Majority Choosability of Digraphs, Electronic Journal of Combinatorics vol. 24(3) (2017), #P3.57	
	18.
		Bartłomiej Bosek, Jarosław Grytczuk, Paweł Rzążewski,  Sebastian Czerwiński	
	
		Harmonious coloring of uniform hypergraphs, Applicable Analysis and Discrete Mathematics vol. 10(1) (2016), 73-87	
	17.
		Bartłomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych	
	
		Shortest Augmenting Paths for Online Matchings on Trees, Lecture Notes in Computer Science vol. 9499 (2016), 59-71	
	16.
		Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki	
	
		On the Duality of Semiantichains and Unichain Coverings, Order vol. 33(1) (2016), 29-38	
	15.
		Bartłomiej Bosek, Tomasz Krawczyk	
	
		A subexponential upper bound for the on-line chain partitioning problem, Combinatorica vol. 35 (2015), 1-38	
	14.
		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)	
	13.
		Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Matecki,  Sebastian Czerwiński,  Tomasz Bartnicki, Wiktor Żelazny	
	
		Additive Coloring of Planar Graphs, Graphs and Combinatorics vol. 30(5) (2014), 1087-1098	
	12.
		Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek	
	
		On-Line Dimension of Semi-Orders, Order vol. 30(2) (2013), 593-615	
	11.
		Bartłomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki	
	
		First-Fit Coloring of Incomparability Graphs, SIAM Journal on Discrete Mathematics vol. 27(1) (2013), 126-140	
	10.
		High performance GPGPU based system for matching people in a live video feed, (2012), "Proceedings of 3rd International Conference on Image Processing Theory, Tools and Applications (IEEE-IPTA 2012)", Institute of Electrical and Electronics Engineers (IEEE)	
	9.
		Bartłomiej Bosek, Stefan Felsner, Kolja Knaur, Grzegorz Matecki	
	
		News about Semiantichains and Unichain Coverings, Lecture Notes in Computer Science vol. 7353 (2012), 43-51	
	8.
		Bartłomiej Bosek, Kamil Kloch, Tomasz Krawczyk, Piotr Micek	
	
		On-line version of Rabinovitch theorem for proper intervals, Discrete Mathematics vol. 312(23) (2012), 3426-3436	
	7.
		On-Line Chain Partitions of Orders: A Survey, Order vol. 29(1) (2012), 49-73	
	6.
		Bartłomiej Bosek, Tomasz Krawczyk, Grzegorz Matecki	
	
		Forbidden structures for efficient First-Fit chain partitioning (extended abstract), Electronic Notes in Discrete Mathematics vol. 38 (2011), 173-179	
	5.
		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)	
	4.
		Bartłomiej Bosek, Tomasz Krawczyk, Edward Szczypka	
	
		First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM Journal on Discrete Mathematics vol. 23(4) (2010), 1992-1999	
	3.
		Patrick Baier, Bartłomiej Bosek, Piotr Micek	
	
		On-line Chain Partitioning of Up-growing Interval Orders, Order vol. 24(1) (2007), 1-13	
	2.
		On-line adaptive chain covering of upgrowing posets, Discrete Mathematics & Theoretical Computer Science Proceedings vol. AF (2006), 37-48	
	1.
		Variants of Online Chain Partition Problem of Posets, Electronic Notes in Theoretical Computer Science vol. 140 (2005), 3-13	
Konferencje:
	17.
		International Symposium on Mathematical Foundations of Computer Science [MFCS], Comenius University, Bratysława, Słowacja, 2024-08-26 - 2024-08-30	
	16.
		Canadian Discrete and Algorithmic Mathematics Conference (CanaDAM 2023), University of Manitoba and the University of Winnipeg, Winnipeg, Manitoba, Kanada, 2021-05-25 - 2021-05-27	
	15.
		SIAM Conference on Discrete Mathematics (DM18), Society of Industrial and Applied Mathematics, Denver, CO, Stany Zjednoczone, 2018-06-04 - 2018-06-08	
	14.
		Latin American Theoretical Informatics 2018, Fundación Ciencias Exactas y Naturales, Buenos Aires, Argentyna, 2018-04-16 - 2018-04-19	
	13.
		Berlin-Poznań-Hamburg Seminar, University of Hamburg, Hamburg, Niemcy, 2017-04-20 - 2017-04-22	
	12.
		International conference dedicated to the 120th anniversary of Kazimierz Kuratowski, Ivan Franko National University of Lviv and Lviv Polytechnic National University, Lwów, Ukraina, 2016-09-27 - 2016-10-01	
	11.
		6th Polish Combinatorial Conference, UAM, Będlewo, Polska, 2016-09-19 - 2016-09-23	
	10.
		24th Workshop '3in1', Akademia Górniczo-Hutnicza, Krynica, Polska, 2015-11-26 - 2015-11-28	
	9.
		13th Workshop on Approximation and Online Algorithms, University of Patras, Department of Computer Engineering and Informatics & EATCS, Patras, Grecja, 2015-09-17 - 2015-09-18	
	8.
		55th IEEE Symposium on Foundations of Computer Science (FOCS14), The IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, Filadelfia, Stany Zjednoczone, 2014-10-18 - 2014-10-21	
	7.
		Marcin Bilski, Halszka Tutaj-Gasińska, Sławomir Rams, Bartłomiej Bosek, Łucja Farnik, Martha Łącka, Szymon Peszat.	
	
		Joint Meeting of the German Mathematical Society (DMV) and the Polish Mathematical Society (PTM), German Mathematical Society; Polish Mathematical Society; Faculty of Mathematics and Computer Scienc, Poznań, Polska, 2014-09-17 - 2014-09-20	
	6.
		3rd International Conference on Image Processing Theory, Tools and Applications, Istanbul Aydin University, Istambuł, Turcja, 2012-10-15 - 2012-10-18	
	5.
		SIAM Conference on Discrete Mathematics (DM12), Society of Industrial and Applied Mathematics, Halifax, Kanada, 2012-06-18 - 2012-08-21	
	4.
		European Conference on Combinatorics (EuroComb11), Rényi Institute, Budapeszt, Węgry, 2011-08-29 - 2011-09-02	
	3.
		51st Annual Symposium on Foundations of Computer Science (FOCS10), The IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, Las Vegas, Stany Zjednoczone, 2010-10-23 - 2010-10-26	
	2.
		3rd Polish Combinatorial Conference, Stefan Banach Center; Adam Mickiewicz University; Jagiellonian University; Warsaw University of Tech, Będlewo, Polska, 2010-09-24 - 2010-09-30	
	1.
		SIAM Conference on Discrete Mathematics (DM10), Society of Industrial and Applied Mathematics, Austin, TX, Stany Zjednoczone, 2010-06-14 - 2010-06-17	
Granty (realizowane po maju 2009 roku)
| Tytuł | Rola | Rozpoczęcie | Zakończenie | 
|---|---|---|---|
| Algorytmiczny Nullstellensatz | Kierownik | 2020-07-27 | 2025-07-26 | 
| Nowe techniki dla algorytmów skojarzeniowych i przepływowych | Kierownik | 2014-07-29 | 2018-07-28 | 
| Rozgrywane kolorowanie grafów i zbiorów częściowo uporządkowanych | Wykonawca | 2012-08-28 | 2015-05-27 | 
| Śledzenie poruszających się osób w monitorowanych strefach | Wykonawca | 2010-09-17 | 2013-09-16 | 
| Algorytmy on-line i gry kombinatoryczne | Wykonawca | 2010-04-14 | 2012-10-13 | 

