| Publication | Date of Publication | Type |
|---|
Recognizing \(H\)-graphs -- beyond circular-arc graphs
| 2024-12-03 | Paper |
Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded
Discrete \& Computational Geometry | 2023-12-21 | Paper |
Vertex deletion into bipartite permutation graphs
| 2023-11-13 | Paper |
Coloring polygon visibility graphs and their generalizations
Journal of Combinatorial Theory. Series B | 2023-05-02 | Paper |
Vertex deletion into bipartite permutation graphs
Algorithmica | 2022-08-03 | Paper |
The slow-coloring game on sparse graphs: \(k\)-degenerate, planar, and outerplanar
Journal of Combinatorics | 2021-07-23 | Paper |
On-line partitioning of width \(w\) posets into \(w^{O(\log\log w)}\) chains
European Journal of Combinatorics | 2021-02-08 | Paper |
Testing isomorphism of circular-arc graphs -- Hsu's approach revisited
| 2019-04-09 | Paper |
The partial visibility representation extension problem
Algorithmica | 2018-07-25 | Paper |
On-line approach to off-line coloring problems on graphs with geometric representations
Combinatorica | 2018-07-23 | Paper |
An easy subexponential bound for online chain partitioning
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Defective 3-paintability of planar graphs
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Extending partial representations of trapezoid graphs
| 2018-01-04 | Paper |
The partial visibility representation extension problem
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Asymmetric coloring games on incomparability graphs
Electronic Notes in Discrete Mathematics | 2016-10-14 | Paper |
A subexponential upper bound for the on-line chain partitioning problem
Combinatorica | 2016-05-03 | Paper |
Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
Discrete \& Computational Geometry | 2015-02-19 | Paper |
Triangle-free intersection graphs of line segments with large chromatic number
Journal of Combinatorial Theory. Series B | 2014-08-27 | Paper |
Coloring relatives of interval overlap graphs via on-line games
Lecture Notes in Computer Science | 2014-07-01 | Paper |
Coloring triangle-free rectangular frame intersection graphs with \(O(\log \log n)\) colors
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Triangle-free geometric intersection graphs with large chromatic number
Discrete \& Computational Geometry | 2013-11-06 | Paper |
Forbidden structures for efficient first-fit chain partitioning (extended abstract)
| 2013-11-01 | Paper |
First-fit coloring of incomparability graphs
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
On-line dimension of semi-orders
Order | 2013-06-26 | Paper |
On-line dimension for posets excluding two long incomparable chains
Order | 2013-03-20 | Paper |
On-line version of Rabinovitch theorem for proper intervals
Discrete Mathematics | 2012-11-15 | Paper |
Extending partial representations of function graphs and permutation graphs
Algorithms – ESA 2012 | 2012-09-25 | Paper |
On-line chain partitions of orders: a survey
Order | 2012-03-23 | Paper |
First-Fit Algorithm for the On-Line Chain Partitioning Problem
SIAM Journal on Discrete Mathematics | 2010-12-03 | Paper |
An algorithmic approach to the problem of a semiretract base
Theoretical Computer Science | 2007-01-09 | Paper |
Semiretracts -- a counterexample and some results.
Theoretical Computer Science | 2004-03-14 | Paper |
Error correction by mutational grammars
Information Processing Letters | 1980-01-01 | Paper |
LL-regular grammars
Information Processing Letters | 1975-01-01 | Paper |
scientific article; zbMATH DE number 3513354 (Why is no real title available?)
| 1974-01-01 | Paper |
Characterization of Chordal Circular-arc Graphs: I. Split Graphs
| N/A | Paper |
