Tomasz Krawczyk

Orcid: 0000-0002-8777-269X

According to our database1, Tomasz Krawczyk authored at least 37 papers between 1975 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Characterization of Chordal Circular-arc Graphs: I. Split Graphs.
CoRR, 2024

2023
Grounded L-Graphs Are Polynomially χ-Bounded.
Discret. Comput. Geom., December, 2023

Coloring polygon visibility graphs and their generalizations.
J. Comb. Theory, Ser. B, July, 2023

Recognizing H-Graphs - Beyond Circular-Arc Graphs.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs.
CoRR, 2022

Vertex Deletion into Bipartite Permutation Graphs.
Algorithmica, 2022

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

Colouring Polygon Visibility Graphs and Their Generalizations.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

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

2018
On-line partitioning of width w posets into w^O(log log w) chains.
CoRR, 2018

Defective 3-Paintability of Planar Graphs.
Electron. J. Comb., 2018

An Easy Subexponential Bound for Online Chain Partitioning.
Electron. J. Comb., 2018

The Partial Visibility Representation Extension Problem.
Algorithmica, 2018

2017
On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations.
Comb., 2017

Extending Partial Representations of Trapezoid Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2015
Asymmetric Coloring Games on Incomparability Graphs.
Electron. Notes Discret. Math., 2015

Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors.
Discret. Comput. Geom., 2015

A subexponential upper bound for the on-line chain partitioning problem.
Comb., 2015

2014
Triangle-free intersection graphs of line segments with large chromatic number.
J. Comb. Theory, Ser. B, 2014

An Improved Subexponential Bound for On-line Chain Partitioning.
CoRR, 2014

Coloring Relatives of Interval Overlap Graphs via On-line Games.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
First-Fit Coloring of Incomparability Graphs.
SIAM J. Discret. Math., 2013

On-Line Dimension for Posets Excluding Two Long Incomparable Chains.
Order, 2013

On-Line Dimension of Semi-Orders.
Order, 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.
Discret. Comput. Geom., 2013

Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors
CoRR, 2013

Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012
On-Line Chain Partitions of Orders: A Survey.
Order, 2012

On-line version of Rabinovitch theorem for proper intervals.
Discret. Math., 2012

Extending Partial Representations of Function Graphs and Permutation Graphs.
Proceedings of the Algorithms - ESA 2012, 2012

2011
Forbidden structures for efficient First-Fit chain partitioning (extended abstract).
Electron. Notes Discret. Math., 2011

2010
First-Fit Algorithm for the On-Line Chain Partitioning Problem.
SIAM J. Discret. Math., 2010

The Sub-exponential Upper Bound for On-Line Chain Partitioning.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2006
An algorithmic approach to the problem of a semiretract base.
Theor. Comput. Sci., 2006

2003
Semiretracts--a counterexample and some results.
Theor. Comput. Sci., 2003

1980
Error Correction by Mutational Grammars.
Inf. Process. Lett., 1980

1975
LL-Regular Grammars.
Inf. Process. Lett., 1975


  Loading...