55 citations · 62 across the 5 of their papers we have counts for
4 papers · 1 filter
Efficient enumeration of non-isomorphic interval graphs
Patryk Mikos
Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on vertices with an time delay. In this paper, we improve their algo…
Online Coloring of Short Intervals
Joanna Chybowska-Sokół, Grzegorz Gutowski, Konstanty Junosza-Szaniawski +2
We study the online graph coloring problem restricted to the intersection graphs of intervals with lengths in . For it is the class of unit interval graphs, and for $σ…
A new lower bound for the on-line coloring of intervals with bandwidth
Patryk Mikos
The on-line interval coloring and its variants are important combinatorial problems with many applications in network multiplexing, resource allocation and job scheduling. In this…
Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints
Grzegorz Gutowski, Patryk Mikos
We propose two strategies for Presenter in the on-line interval graph coloring games. Specifically, we consider a setting in which each interval is associated with a -dimensiona…