Cemil Dibek

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