dr hab. Tomasz Krawczyk

Coloring polygon visibility graphs and their generalizations, Journal of Combinatorial Theory. Series B vol. 161 (2023), 268-300

Vertex Deletion into Bipartite Permutation Graphs, Algorithmica (2022),

The Slow-Coloring Game on Sparse Graphs: k-Degenerate, Planar, and Outerplanar, Journal of Combinatorics vol. 12 (2021) (2021), 283 – 302

Colouring polygon visibility graphs and their generalizations, International Symposium on Computational Geometry [SoCG] vol. 189 of Leibniz International Proceedings in Informatics (LIPIcs) (2021), 29:1-29:16

On-line partitioning of width w posets into w^O(log log w) chains, European Journal of Combinatorics vol. 91 (2021), 103202

Vertex Deletion into Bipartite Permutation Graphs, International Symposium on Parameterized and Exact Computation (was IWPEC pre 2004) [IPEC] vol. 180 of Leibniz International Proceedings in Informatics, 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference) (2020), 5:1-5:16

Defective 3-Paintability of Planar Graphs, Electronic Journal of Combinatorics vol. 25 (2) (2018), 20

An Easy Subexponential Bound for Online Chain Partitioning, Electronic Journal of Combinatorics vol. 25(2) (2018), #P2.28

The Partial Visibility Representation Extension Problem, Algorithmica vol. 80 (8) (2018), 2286-2323

On-line approach to off-line coloring problems on graphs with geometric representations, Combinatorica vol. 37 (2017), 1139-1179

Extending partial representations of trapezoid graphs vol. 10520 of Lecture Notes in Computer Science (2017), "Graph-Theoretic Concepts in Computer Science, 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers", Springer

The Partial Visibility Representation Extension Problem vol. 9801 (Lecture Notes in Computer Science) (2016), "Graph Drawing and Network Visualization, 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers", Springer

Asymmetric coloring games on incomparability graphs vol. 49 of Electronic Notes in Discrete Mathematics (2015), "The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015", Elsevier Science

A subexponential upper bound for the on-line chain partitioning problem, Combinatorica vol. 35 (2015), 1-38

Coloring triangle-free rectangle overlap graphs with O(log log n) colors, Discrete and Computational Geometry vol. 53 (2015), 199-220

Coloring relatives of interval overlap graphs via on-line games vol. 8572 of Lecture Notes in Computer Science (2014), "Automata, Languages, and Programming, 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part I", Springer

Triangle-free intersection graphs of line segments with large chromatic number, Journal of Combinatorial Theory. Series B vol. 105 (2014), 6-10

Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors vol. 8165 of Lecture Notes in Computer Science (2013), "Graph-Theoretic Concepts in Computer Science, 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers", Springer

Triangle-free geometric intersection graphs with large chromatic number, Discrete and Computational Geometry vol. 50 (2013), 714-726

On-Line Dimension of Semi-Orders, Order vol. 30(2) (2013), 593-615

On-line dimension for posets excluding two long incomparable chains, Order vol. 30(1) (2013), 1-12

First-Fit Coloring of Incomparability Graphs, SIAM Journal on Discrete Mathematics vol. 27(1) (2013), 126-140

Extending partial representations of function graphs and permutation graphs vol. 7501 of Lecture Notes in Computer Science (2012), "Algorithms – ESA 2012, 20th Annual European Symposium on Algorithms, Ljubljana, Slovenia, September 10-12, 2012, Proceedings", Springer

On-line version of Rabinovitch theorem for proper intervals, Discrete Mathematics vol. 312(23) (2012), 3426-3436

On-Line Chain Partitions of Orders: A Survey, Order vol. 29(1) (2012), 49-73

Forbidden structures for efficient First-Fit chain partitioning (extended abstract), Electronic Notes in Discrete Mathematics vol. 38 (2011), 173-179

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)

First-Fit Algorithm for the On-Line Chain Partitioning Problem, SIAM Journal on Discrete Mathematics vol. 23(4) (2010), 1992-1999

An algorithmic approach to the problem of a semiretract base, Theoretical Computer Science vol. 369 (2006), 314-322

An automaton that recognizes the base of a semiretract, Words 2005, 5-th International Conference On Words (2005), 235-247

Semiretracts – a counterexample and some results , Theoretical Computer Science vol. 307 (2003), 117-127