Cemil Dibek

According to our database, Cemil Dibek authored at least 13 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.

Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic

J. Comb. Theory B, January, 2024

Generalized Ellipsoids.

Amir Ali Ahmadi, Abraar Chaudhry, Cemil Dibek

CoRR, 2024

2023

A Sum of Squares Characterization of Perfect Graphs.

Amir Ali Ahmadi, Cemil Dibek

SIAM J. Appl. Algebra Geom., December, 2023

Sums of Separable and Quadratic Polynomials.

Amir Ali Ahmadi, Cemil Dibek, Georgina Hall

Math. Oper. Res., August, 2023

2022

Graphs with polynomially many minimal separators.

Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic

J. Comb. Theory B, 2022

Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws.

Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2021

Strongly perfect claw-free graphs - A short proof.

Maria Chudnovsky, Cemil Dibek

J. Graph Theory, 2021

New examples of minimal non-strongly-perfect graphs.

Maria Chudnovsky, Cemil Dibek, Paul D. Seymour

Discret. Math., 2021

2020

Evolution of Q Values for Deep Q Learning in Stable Baselines.

Matthew Andrews, Cemil Dibek, Karina Palyutina

CoRR, 2020

2017

On matching extendability of lexicographic products.

Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic

RAIRO Oper. Res., 2017

Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded.

Cemil Dibek, Tínaz Ekim, Pinar Heggernes

Discret. Math., 2017

2016

Equimatchable graphs are C_2k+1-free for k≥4.

Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom

Discret. Math., 2016

2015

Equimatchable Graphs are C_2k+1-free for k ≥ 4.

Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015