Multiple interval graphs are a well-known generalization of interval gra...
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
Feature generation is an open topic of investigation in graph machine
le...
Longest Run Subsequence is a problem introduced recently in the context ...
We study the complexity of the two dual covering and packing distance-ba...
The first-fit coloring is a heuristic that assigns to each vertex, arriv...
Optimization problems consist of either maximizing or minimizing an obje...
We consider extension variants of the classical graph problems Vertex Co...
The question if a given partial solution to a problem can be extended
re...
A graph is d-orientable if its edges can be oriented so that the maximum...
We show that the independent set reconfiguration problem on split graphs...
Finding cohesive subgraphs in a network is a well-known problem in graph...
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
An RNA sequence is a word over an alphabet on four elements {A,C,G,U}
ca...
What if {a tourist, a train addict, Dr. Sheldon Cooper, somebody who lik...