On 14-Cycle-Free Subgraphs of the Hypercube. - Zoltán Füredi; Lale Özkahya (Comb. Probab. Comput., 2009)

A Brooks-type bound for squares of K4-minor-free graphs. - Alexandr V. Kostochka; Lale Özkahya; Douglas R. Woodall (Discret. Math., 2009)

On even-cycle-free subgraphs of the hypercube. - Zoltán Füredi; Lale Özkahya (J. Comb. Theory A, 2011)

Unavoidable subhypergraphs: a-clusters. - Zoltán Füredi; Lale Özkahya (J. Comb. Theory A, 2011)

Minimum H-decompositions of graphs: Edge-critical case. - Lale Özkahya; Yury Person (J. Comb. Theory B, 2012)

On homometric sets in graphs. - Maria Axenovich; Lale Özkahya (Australas. J Comb., 2013)

On the ratio of maximum and minimum degree in maximal intersecting families. - Zoltán Lóránt Nagy; Lale Özkahya; Balázs Patkós; Máté Vizer (Discret. Math., 2013)

Anti-Ramsey number of matchings in hypergraphs. - Lale Özkahya; Michael Young (Discret. Math., 2013)

On a Covering Problem in the Hypercube. - Lale Özkahya; Brendon Stanton (Graphs Comb., 2015)

On 3-uniform hypergraphs without a cycle of a given length. - Zoltán Füredi; Lale Özkahya (Discret. Appl. Math., 2017)

Minimum rainbow H-decompositions of graphs. - Lale Özkahya; Yury Person (Electron. Notes Discret. Math., 2017)

A Fast Counting Method for 6-Motifs with Low Connectivity. - Taha Sevim; Muhammet Selçuk Güvel; Lale Özkahya (MACIS, 2019)

Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures. - Ali Baran Tasdemir; Lale Özkahya (SIU, 2021)

Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations. - Ali Baran Tasdemir; Tuna Karacan; Emir Kaan Kirmaci; Lale Özkahya (CSoNet, 2022)

Low-Rank Representations Towards Classification Problem of Complex Networks. - Murat Çelik; Ali Baran Tasdemir; Lale Özkahya (SIU, 2022)

Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length. - Alaittin Kirtisoglu; Lale Özkahya (Graphs Comb., 2024)