12 citations · 21 across the 8 of their papers we have counts for
10 papers
Generalized Ellipsoids
Amir Ali Ahmadi, Abraar Chaudhry, Cemil Dibek
We introduce a family of symmetric convex bodies called generalized ellipsoids of degree (GE-s), with ellipsoids corresponding to the case of . Generalized ellipsoids (…
A Sum of Squares Characterization of Perfect Graphs
Amir Ali Ahmadi, Cemil Dibek
We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a gr…
Submodular functions and perfect graphs
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +1
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four…
Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +4
This paper is motivated by the following question: what are the unavoidable induced subgraphs of graphs with large treewidth? Aboulker et al. made a conjecture which answers this q…
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +1
For graphs and , we say that is -free if it does not contain as an induced subgraph. Already in the early 1980s Alekseev observed that if is connected, then t…
Sums of Separable and Quadratic Polynomials
Amir Ali Ahmadi, Cemil Dibek, Georgina Hall
We study separable plus quadratic (SPQ) polynomials, i.e., polynomials that are the sum of univariate polynomials in different variables and a quadratic polynomial. Motivated by th…
Graphs with polynomially many minimal separators
Tara Abrishami, Maria Chudnovsky, Cemil Dibek +3
We show that graphs that do not contain a theta, pyramid, prism, or turtle as an induced subgraph have polynomially many minimal separators. This result is the best possible in the…
Evolution of Q Values for Deep Q Learning in Stable Baselines
Matthew Andrews, Cemil Dibek, Karina Palyutina
We investigate the evolution of the Q values for the implementation of Deep Q Learning (DQL) in the Stable Baselines library. Stable Baselines incorporates the latest Reinforcement…
New Examples of Minimal Non-Strongly-Perfect Graphs
Maria Chudnovsky, Cemil Dibek, Paul Seymour
A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of…
Strongly Perfect Claw-free Graphs -- A Short Proof
Maria Chudnovsky, Cemil Dibek
A graph is strongly perfect if every induced subgraph H has a stable set that meets every maximal clique of H. A graph is claw-free if no vertex has three pairwise non-adjacent nei…