Cemil Dibek

Cited by

	All	Since 2019
Citations	92	90
h-index	5	5
i10-index	3	3

2016201720182019202020212022202320242 3 3 5 15 41 17

Public access

View all

8 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Maria ChudnovskyPrinceton UniversityVerified email at math.princeton.edu
Tara AbrishamiPrinceton UniversityVerified email at princeton.edu
Paweł RzążewskiWarsaw University of Technology, Faculty of Mathematics and Information ScienceVerified email at mini.pw.edu.pl
Tınaz EkimEndüstri Mühendisliği, Boğaziçi ÜniversitesiVerified email at boun.edu.tr
Sophie SpirklUniversity of WaterlooVerified email at uwaterloo.ca
Didem GözüpekDepartment of Computer Engineering, Gebze Technical UniversityVerified email at gtu.edu.tr
Nicolas TrotignonVerified email at ens-lyon.fr
Stéphan ThomasséÉcole Normale Supérieure de LyonVerified email at ens-lyon.fr
Mordechai ShalomTel Hai Academic CollegeVerified email at telhai.ac.il
Pinar HeggernesProfessor of computer science, University of BergenVerified email at ii.uib.no
Georgina HallINSEADVerified email at insead.edu
Matthew AndrewsNokia Bell LabsVerified email at nokia-bell-labs.com
Nina ChiarelliUniversity of PrimorskaVerified email at famnit.upr.si
Štefko MiklavičUniversity of PrimorskaVerified email at upr.si

Cemil Dibek

Princeton University

Verified email at princeton.edu - Homepage

Graph Theory Combinatorial Optimization Polynomial Optimization


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree T Abrishami, M Chudnovsky, C Dibek, S Hajebi, P Rzążewski, S Spirkl, ... Journal of Combinatorial Theory, Series B 164, 371-403, 2024	24	2024
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws T Abrishami, M Chudnovsky, C Dibek, P Rzążewski Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022	20	2022
Graphs with polynomially many minimal separators T Abrishami, M Chudnovsky, C Dibek, S Thomassé, N Trotignon, ... Journal of Combinatorial Theory, Series B 152, 248-280, 2022	13	2022
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded C Dibek, T Ekim, P Heggernes Discrete Mathematics 340 (5), 927-934, 2017	7	2017
Equimatchable graphs are C2k+ 1-free for k≥ 4 C Dibek, T Ekim, D Gözüpek, M Shalom Discrete Mathematics 339 (12), 2964-2969, 2016	7	2016
Submodular functions and perfect graphs T Abrishami, M Chudnovsky, C Dibek, K Vušković Mathematics of Operations Research, 2024	4	2024
Sums of separable and quadratic polynomials AA Ahmadi, C Dibek, G Hall Mathematics of Operations Research 48 (3), 1316-1343, 2023	4	2023
Strongly perfect claw‐free graphs—A short proof M Chudnovsky, C Dibek Journal of Graph Theory 97 (3), 359-381, 2021	4	2021
Evolution of Q Values for Deep Q Learning in Stable Baselines M Andrews, C Dibek, K Palyutina arXiv preprint arXiv:2004.11766, 2020	4	2020
A sum of squares characterization of perfect graphs AA Ahmadi, C Dibek SIAM Journal on Applied Algebra and Geometry 7 (4), 685-715, 2023	3	2023
New examples of minimal non-strongly-perfect graphs M Chudnovsky, C Dibek, P Seymour Discrete Mathematics 344 (5), 112334, 2021	1	2021
On matching extendability of lexicographic products N Chiarelli, C Dibek, T Ekim, D Gözüpek, Š Miklavič RAIRO-Operations Research 51 (3), 857-873, 2017	1	2017
Perfect Graphs and Sums of Squares C Dibek Princeton University, 2021		2021
Edge-extremal graphs under degree and matching number restrictions C Dibek Fen Bilimleri Enstitüsü, 2016		2016

The system can't perform the operation now. Try again later.

Articles 1–14

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors