Computing Minimum Geodetic Sets of Proper Interval Graphs. - Tínaz Ekim; Aysel Erey; Pinar Heggernes; Pim van 't Hof; Daniel Meister 001 (LATIN, 2012)

A note on the real part of complex chromatic roots. - Jason I. Brown; Aysel Erey (Discret. Math., 2014)

Block decomposition approach to compute a minimum geodetic set. - Tínaz Ekim; Aysel Erey (RAIRO Oper. Res., 2014)

New bounds for chromatic polynomials and chromatic roots. - Jason I. Brown; Aysel Erey (Discret. Math., 2015)

On the Real Roots of σ -Polynomials. - Jason I. Brown; Aysel Erey (Graphs Comb., 2016)

On the Roots of σ-Polynomials. - Jason I. Brown; Aysel Erey (J. Graph Theory, 2016)

On the Wiener index, distance cospectrality and transmission-regular graphs. - Aida Abiad; Boris Brimkov; Aysel Erey; Lorinda Leshock; Xavier Martínez-Rivera; Suil O; Sung-Yell Song; Jason Williford (Discret. Appl. Math., 2017)

Restraints permitting the largest number of colourings. - Jason I. Brown; Aysel Erey (Discret. Appl. Math., 2017)

Maximizing the number of x-colorings of 4-chromatic graphs. - Aysel Erey (Discret. Math., 2018)

Extremal Colorings and Independent Sets. - John Engbers; Aysel Erey (Graphs Comb., 2018)

Uniform Length Dominating Sequence Graphs. - Aysel Erey (Graphs Comb., 2020)

Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. - John Engbers; Aysel Erey; Jacob Fox; Xiaoyu He (SIAM J. Discret. Math., 2021)

On the average order of a dominating set of a forest. - Aysel Erey (Discret. Math., 2023)

Extremal graphs for average sizes of maximal matchings. - John Engbers; Aysel Erey (Discret. Appl. Math., 2023)

Spreading in graphs. - Bostjan Bresar; Tanja Dravec; Aysel Erey; Jaka Hedzet (Discret. Appl. Math., 2024)

Extremal Graphs for Widom-Rowlinson Colorings in k-Chromatic Graphs. - John Engbers; Aysel Erey (Graphs Comb., 2024)

On the roots of maximal matching polynomials. - Matt Burnham; Aysel Erey (Discret. Math., 2025)