Öznur Yaşar Diner

activity

20172022

collaborators

Showing cs.DSShow all

2 papers · 1 filter

cs.DS2022

On Vertex Bisection Width of Random $d$ -Regular Graphs

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

Vertex bisection is a graph partitioning problem in which the aim is to find a partition into two equal parts that minimizes the number of vertices in one partition set that have a…

cs.DS2017

Contraction and Deletion Blockers for Perfect Graphs and $H$ -free Graphs

Öznur Yaşar Diner, Daniël Paulusma, Christophe Picouleau +1

We study the following problem: for given integers $d$ , $k$ and graph $G$ , can we reduce some fixed graph parameter $π$ of $G$ by at least $d$ via at most $k$ graph operations from…

On Vertex Bisection Width of Random d-Regular Graphs

Contraction and Deletion Blockers for Perfect Graphs and H-free Graphs

On Vertex Bisection Width of Random $d$ -Regular Graphs

Contraction and Deletion Blockers for Perfect Graphs and $H$ -free Graphs