Öznur Yaşar Diner

activity

20172022

collaborators

Showing 2021Show all

2 papers · 1 filter

cs.CC2021

The Multicolored Graph Realization Problem

Josep Díaz, Öznur Yaşar Diner, Maria Serna +1

We introduce the Multicolored Graph Realization problem (MGRP). The input to the problem is a colored graph $(G, φ)$ , i.e., a graph together with a coloring on its vertices. We can…

cs.DM2021

Block Elimination Distance

Öznur Yaşar Diner, Archontia C. Giannopoulou, Giannos Stamoulis +1

We introduce the block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class $G$ , the class ${\cal B}({\cal…