Cemil Dibek

Publication Activity (10 Years)

Years Active: 2015-2024
Publications (10 Years): 15

Top Topics

Independent Set

Tree Decompositions

Graph Theoretic

Pseudo Boolean Functions

Top Venues

J. Comb. Theory, Ser. B

SIAM J. Appl. Algebra Geom.

Publications

Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. J. Comb. Theory, Ser. B 164 (2024)
Amir Ali Ahmadi, Abraar Chaudhry, Cemil Dibek
Generalized Ellipsoids. CoRR (2024)
Amir Ali Ahmadi, Cemil Dibek, Georgina Hall
Sums of Separable and Quadratic Polynomials. Math. Oper. Res. 48 (3) (2023)
Amir Ali Ahmadi, Cemil Dibek
A Sum of Squares Characterization of Perfect Graphs. SIAM J. Appl. Algebra Geom. 7 (4) (2023)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic
Graphs with polynomially many minimal separators. J. Comb. Theory, Ser. B 152 (2022)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. SODA (2022)
Maria Chudnovsky, Cemil Dibek
Strongly perfect claw-free graphs - A short proof. J. Graph Theory 97 (3) (2021)
Amir Ali Ahmadi, Cemil Dibek, Georgina Hall
Sums of Separable and Quadratic Polynomials. CoRR (2021)
Maria Chudnovsky, Cemil Dibek, Paul D. Seymour
New examples of minimal non-strongly-perfect graphs. Discret. Math. 344 (5) (2021)
Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Pawel Rzazewski
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws. CoRR (2021)
Matthew Andrews, Cemil Dibek, Karina Palyutina
Evolution of Q Values for Deep Q Learning in Stable Baselines. CoRR (2020)
Cemil Dibek, Tínaz Ekim, Pinar Heggernes
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. Discret. Math. 340 (5) (2017)
Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic
On matching extendability of lexicographic products. RAIRO Oper. Res. 51 (3) (2017)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
-free for k≥4. Discret. Math. 339 (12) (2016)
Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW (2015)