Tomasz Krawczyk

Proceedings of the 50th International Symposium on Mathematical Foundations of Computer Science, 2025

2024

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

[BibT_eX]

[DOI]

CoRR, 2024

On the structure of normalized models of circular-arc graphs - Hsu's approach revisited.

[BibT_eX]

[DOI]

CoRR, 2024

Characterization of Circular-arc Graphs: III. Chordal Graphs.

[BibT_eX]

[DOI]

Yixin Cao

CoRR, 2024

Characterization of Circular-arc Graphs: II. McConnell Flipping.

[BibT_eX]

[DOI]

Yixin Cao

CoRR, 2024

Circular-arc graphs and the Helly property.

[BibT_eX]

[DOI]

Jan Derbisz

CoRR, 2024

Characterization of Chordal Circular-arc Graphs: I. Split Graphs.

[BibT_eX]

[DOI]

Yixin Cao

Jan Derbisz

CoRR, 2024

2023

Grounded L-Graphs Are Polynomially χ-Bounded.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

Coloring polygon visibility graphs and their generalizations.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Recognizing H-Graphs - Beyond Circular-Arc Graphs.

[BibT_eX]

[DOI]

Deniz Agaoglu Çagirici

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Beyond circular-arc graphs - recognizing lollipop graphs and medusa graphs.

[BibT_eX]

[DOI]

Deniz Agaoglu Çagirici

CoRR, 2022

Vertex Deletion into Bipartite Permutation Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2022

2021

On-line partitioning of width w posets into wO(loglogw) chains.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Colouring Polygon Visibility Graphs and Their Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2019

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

[BibT_eX]

[DOI]

CoRR, 2019

2018

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

[BibT_eX]

[DOI]

CoRR, 2018

Defective 3-Paintability of Planar Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

An Easy Subexponential Bound for Online Chain Partitioning.

[BibT_eX]

[DOI]

Electron. J. Comb., 2018

The Partial Visibility Representation Extension Problem.

[BibT_eX]

[DOI]

Algorithmica, 2018

2017

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

[BibT_eX]

[DOI]

Comb., 2017

Extending Partial Representations of Trapezoid Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2015

Asymmetric Coloring Games on Incomparability Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors.

[BibT_eX]

[DOI]

Arkadiusz Pawlik

Discret. Comput. Geom., 2015

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

[BibT_eX]

[DOI]

Comb., 2015

2014

Triangle-free intersection graphs of line segments with large chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

An Improved Subexponential Bound for On-line Chain Partitioning.

[BibT_eX]

[DOI]

CoRR, 2014

Coloring Relatives of Interval Overlap Graphs via On-line Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

First-Fit Coloring of Incomparability Graphs.

[BibT_eX]

[DOI]

Grzegorz Matecki

SIAM J. Discret. Math., 2013

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

[BibT_eX]

[DOI]

Stefan Felsner

William T. Trotter

Order, 2013

On-Line Dimension of Semi-Orders.

[BibT_eX]

[DOI]

Order, 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

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

[BibT_eX]

[DOI]

Arkadiusz Pawlik

CoRR, 2013

Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors.

[BibT_eX]

[DOI]

Arkadiusz Pawlik

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012

On-Line Chain Partitions of Orders: A Survey.

[BibT_eX]

[DOI]

Order, 2012

On-line version of Rabinovitch theorem for proper intervals.

[BibT_eX]

[DOI]

Discret. Math., 2012

Extending Partial Representations of Function Graphs and Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

Forbidden structures for efficient First-Fit chain partitioning (extended abstract).

[BibT_eX]

[DOI]

Grzegorz Matecki

Electron. Notes Discret. Math., 2011

2010

First-Fit Algorithm for the On-Line Chain Partitioning Problem.

[BibT_eX]

[DOI]

Edward Szczypka

SIAM J. Discret. Math., 2010

The Sub-exponential Upper Bound for On-Line Chain Partitioning.

[BibT_eX]

[DOI]

Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

2006

An algorithmic approach to the problem of a semiretract base.

[BibT_eX]

[DOI]

Wit Forys

Theor. Comput. Sci., 2006

2003

Semiretracts--a counterexample and some results.

[BibT_eX]

[DOI]

Wit Forys

James A. Anderson

Theor. Comput. Sci., 2003

1980

Error Correction by Mutational Grammars.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

1975

LL-Regular Grammars.

[BibT_eX]

[DOI]

Stanislaw Jarzabek