default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCemil Dibek
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]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 B 164: 371-403 (2024)- [i5]Amir Ali Ahmadi, Abraar Chaudhry, Cemil Dibek:
Generalized Ellipsoids. CoRR abs/2407.20362 (2024) - 2023
- [j8]Amir Ali Ahmadi, Cemil Dibek, Georgina Hall:
Sums of Separable and Quadratic Polynomials. Math. Oper. Res. 48(3): 1316-1343 (2023) - [j7]Amir Ali Ahmadi, Cemil Dibek:
A Sum of Squares Characterization of Perfect Graphs. SIAM J. Appl. Algebra Geom. 7(4): 685-715 (2023) - 2022
- [j6]Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Stéphan Thomassé, Nicolas Trotignon, Kristina Vuskovic:
Graphs with polynomially many minimal separators. J. Comb. Theory B 152: 248-280 (2022) - [c1]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: 1448-1470 - 2021
- [j5]Maria Chudnovsky, Cemil Dibek, Paul D. Seymour:
New examples of minimal non-strongly-perfect graphs. Discret. Math. 344(5): 112334 (2021) - [j4]Maria Chudnovsky, Cemil Dibek:
Strongly perfect claw-free graphs - A short proof. J. Graph Theory 97(3): 359-381 (2021) - [i4]Amir Ali Ahmadi, Cemil Dibek, Georgina Hall:
Sums of Separable and Quadratic Polynomials. CoRR abs/2105.04766 (2021) - [i3]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 abs/2107.05434 (2021) - 2020
- [i2]Matthew Andrews, Cemil Dibek, Karina Palyutina:
Evolution of Q Values for Deep Q Learning in Stable Baselines. CoRR abs/2004.11766 (2020)
2010 – 2019
- 2017
- [j3]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): 927-934 (2017) - [j2]Nina Chiarelli, Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Stefko Miklavic:
On matching extendability of lexicographic products. RAIRO Oper. Res. 51(3): 857-873 (2017) - 2016
- [j1]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable graphs are C2k+1-free for k≥4. Discret. Math. 339(12): 2964-2969 (2016) - 2015
- [i1]Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable Graphs are C_2k+1-free for k ≥ 4. CTW 2015: 125-128
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
