LL-Regular Grammars. - Stanislaw Jarzabek; Tomasz Krawczyk (Inf. Process. Lett., 1975)

Error Correction by Mutational Grammars. - Tomasz Krawczyk (Inf. Process. Lett., 1980)

Semiretracts–a counterexample and some results. - Wit Forys; Tomasz Krawczyk; James A. Anderson (Theor. Comput. Sci., 2003)

An algorithmic approach to the problem of a semiretract base. - Wit Forys; Tomasz Krawczyk (Theor. Comput. Sci., 2006)

The Sub-exponential Upper Bound for On-Line Chain Partitioning. - Bartlomiej Bosek; Tomasz Krawczyk (FOCS, 2010)

First-Fit Algorithm for the On-Line Chain Partitioning Problem. - Bartlomiej Bosek; Tomasz Krawczyk; Edward Szczypka (SIAM J. Discret. Math., 2010)

Forbidden structures for efficient First-Fit chain partitioning (extended abstract). - Bartlomiej Bosek; Tomasz Krawczyk; Grzegorz Matecki (Electron. Notes Discret. Math., 2011)

Extending Partial Representations of Function Graphs and Permutation Graphs. - Pavel Klavík; Jan Kratochvíl; Tomasz Krawczyk; Bartosz Walczak (ESA, 2012)

On-line version of Rabinovitch theorem for proper intervals. - Bartlomiej Bosek; Kamil Kloch; Tomasz Krawczyk; Piotr Micek (Discret. Math., 2012)

On-Line Chain Partitions of Orders: A Survey. - Bartlomiej Bosek; Stefan Felsner; Kamil Kloch; Tomasz Krawczyk; Grzegorz Matecki; Piotr Micek (Order, 2012)

Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors. - Tomasz Krawczyk; Arkadiusz Pawlik; Bartosz Walczak (WG, 2013)

Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors - Tomasz Krawczyk; Arkadiusz Pawlik; Bartosz Walczak (CoRR, 2013)

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (Discret. Comput. Geom., 2013)

On-Line Dimension of Semi-Orders. - Bartlomiej Bosek; Kamil Kloch; Tomasz Krawczyk; Piotr Micek (Order, 2013)

On-Line Dimension for Posets Excluding Two Long Incomparable Chains. - Stefan Felsner; Tomasz Krawczyk; William T. Trotter (Order, 2013)

First-Fit Coloring of Incomparability Graphs. - Bartlomiej Bosek; Tomasz Krawczyk; Grzegorz Matecki (SIAM J. Discret. Math., 2013)

Coloring Relatives of Interval Overlap Graphs via On-line Games. - Tomasz Krawczyk; Bartosz Walczak (ICALP (1), 2014)

An Improved Subexponential Bound for On-line Chain Partitioning. - Bartlomiej Bosek; Hal A. Kierstead; Tomasz Krawczyk; Grzegorz Matecki; Matthew E. Smith 001 (CoRR, 2014)

Triangle-free intersection graphs of line segments with large chromatic number. - Arkadiusz Pawlik; Jakub Kozik; Tomasz Krawczyk; Michal Lason; Piotr Micek; William T. Trotter; Bartosz Walczak (J. Comb. Theory B, 2014)

A subexponential upper bound for the on-line chain partitioning problem. - Bartlomiej Bosek; Tomasz Krawczyk (Comb., 2015)

Coloring Triangle-Free Rectangle Overlap Graphs with $$O( log log n)$$ O ( log log n ) Colors. - Tomasz Krawczyk; Arkadiusz Pawlik; Bartosz Walczak (Discret. Comput. Geom., 2015)

Asymmetric Coloring Games on Incomparability Graphs. - Tomasz Krawczyk; Bartosz Walczak (Electron. Notes Discret. Math., 2015)

Extending Partial Representations of Trapezoid Graphs. - Tomasz Krawczyk; Bartosz Walczak (WG, 2017)

On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations. - Tomasz Krawczyk; Bartosz Walczak (Comb., 2017)

The Partial Visibility Representation Extension Problem. - Steven Chaplick; Grzegorz Guspiel; Grzegorz Gutowski; Tomasz Krawczyk; Giuseppe Liotta (Algorithmica, 2018)

An Easy Subexponential Bound for Online Chain Partitioning. - Bartlomiej Bosek; Hal A. Kierstead; Tomasz Krawczyk; Grzegorz Matecki; Matthew E. Smith 001 (Electron. J. Comb., 2018)

Defective 3-Paintability of Planar Graphs. - Grzegorz Gutowski; Ming Han; Tomasz Krawczyk; Xuding Zhu (Electron. J. Comb., 2018)

On-line partitioning of width w posets into w^O(log log w) chains. - Bartlomiej Bosek; Tomasz Krawczyk (CoRR, 2018)

Testing isomorphism of circular-arc graphs - Hsu's approach revisited. - Tomasz Krawczyk (CoRR, 2019)

Colouring Polygon Visibility Graphs and Their Generalizations. - James Davies; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (SoCG, 2021)

On-line partitioning of width w posets into wO(loglogw) chains. - Bartlomiej Bosek; Tomasz Krawczyk (Eur. J. Comb., 2021)

Vertex Deletion into Bipartite Permutation Graphs. - Lukasz Bozyk; Jan Derbisz; Tomasz Krawczyk; Jana Novotná 001; Karolina Okrasa (Algorithmica, 2022)

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (CoRR, 2022)

Recognizing H-Graphs - Beyond Circular-Arc Graphs. - Deniz Agaoglu Çagirici; Onur Çagirici; Jan Derbisz; Tim A. Hartmann; Petr Hlinený; Jan Kratochvíl; Tomasz Krawczyk; Peter Zeman 001 (MFCS, 2023)

Coloring polygon visibility graphs and their generalizations. - James Davies; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (J. Comb. Theory B, 2023)

Grounded L-Graphs Are Polynomially χ-Bounded. - James Davies; Tomasz Krawczyk; Rose McCarty; Bartosz Walczak (Discret. Comput. Geom., 2023)

Characterization of Chordal Circular-arc Graphs: I. Split Graphs. - Yixin Cao 001; Jan Derbisz; Tomasz Krawczyk (CoRR, 2024)

Circular-arc graphs and the Helly property. - Jan Derbisz; Tomasz Krawczyk (CoRR, 2024)

Characterization of Circular-arc Graphs: II. McConnell Flipping. - Yixin Cao 001; Tomasz Krawczyk (CoRR, 2024)

Characterization of Circular-arc Graphs: III. Chordal Graphs. - Yixin Cao 001; Tomasz Krawczyk (CoRR, 2024)

On the structure of normalized models of circular-arc graphs - Hsu's approach revisited. - Tomasz Krawczyk (CoRR, 2024)

Comments on "𝒪(m·n) algorithms for the recognition and isomorphism problems on circular-arc graphs". - Tomasz Krawczyk (CoRR, 2024)

A Note on the Complexity of Defensive Domination. - Steven Chaplick; Grzegorz Gutowski; Tomasz Krawczyk (MFCS, 2025)