( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
First-Fit Coloring of Forests in Random Arrival Model.

, , , и . MFCS, том 306 из LIPIcs, стр. 33:1-33:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Bartłomiej Krawczyk

Bartlomiej Albinski

Bartłomiej Tomaszewski

Amalie Böseke

Bartlomiej Tomaszewski

 

Другие публикации лиц с тем же именем

Shortest Augmenting Paths for Online Matchings on Trees., , , и . Theory Comput. Syst., 62 (2): 337-348 (2018)The Sub-exponential Upper Bound for On-Line Chain Partitioning., и . FOCS, стр. 347-354. IEEE Computer Society, (2010)A Tight Bound for Shortest Augmenting Paths on Trees., , , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 201-216. Springer, (2018)Dynamic Coloring of Unit Interval Graphs with Limited Recourse Budget., и . ESA, том 244 из LIPIcs, стр. 25:1-25:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Recoloring Interval Graphs with Limited Recourse Budget., , , , и . SWAT, том 162 из LIPIcs, стр. 17:1-17:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)On-line partitioning of width w posets into w^O(log log w) chains., и . CoRR, (2018)Local Dimension is Unbounded for Planar Posets., , и . Electron. J. Comb., 27 (4): 4 (2020)Majority coloring game., , и . Discret. Appl. Math., (2019)Shortest Augmenting Paths for Online Matchings on Trees., , , и . WAOA, том 9499 из Lecture Notes in Computer Science, стр. 59-71. Springer, (2015)A tight bound for shortest augmenting paths on trees., , , и . Theor. Comput. Sci., (2022)