| On 3-uniform hypergraphs without a cycle of a given length Z Füredi, L Özkahya Discrete Applied Mathematics 216, 582-588, 2017 | 53 | 2017 |
| Anti-Ramsey number of matchings in hypergraphs L Özkahya, M Young Discrete Mathematics 313 (20), 2359-2364, 2013 | 37 | 2013 |
| On 14-cycle-free subgraphs of the hypercube Z Füredi, L Özkahya Combinatorics, Probability and Computing 18 (5), 725-729, 2009 | 26 | 2009 |
| Unavoidable subhypergraphs: a-clusters Z Füredi, L Özkahya Journal of Combinatorial Theory, Series A 118 (8), 2246-2256, 2011 | 19 | 2011 |
| On even-cycle-free subgraphs of the hypercube Z Füredi, L Özkahya Journal of Combinatorial Theory, Series A 118 (6), 1816-1819, 2011 | 19 | 2011 |
| Minimum H-decompositions of graphs: edge-critical case L Özkahya, Y Person Journal of Combinatorial Theory, Series B 102 (3), 715-725, 2012 | 16 | 2012 |
| On homometric sets in graphs M Axenovich, L Özkahya Electronic Notes in Discrete Mathematics 38, 83-86, 2011 | 15 | 2011 |
| On even-cycle-free subgraphs of the hypercube Z Füredi, L Özkahya Electronic Notes in Discrete Mathematics 34, 515-517, 2009 | 15 | 2009 |
| On a covering problem in the hypercube L Özkahya, B Stanton Graphs and Combinatorics 31, 235-242, 2015 | 10 | 2015 |
| Unavoidable subhypergraphs: a-clusters Z Füredi, L Özkahya Electronic Notes in Discrete Mathematics 34, 63-67, 2009 | 7 | 2009 |
| A Brooks-type bound for squares of K4-minor-free graphs AV Kostochka, L Özkahya, DR Woodall Discrete mathematics 309 (23-24), 6572-6584, 2009 | 3 | 2009 |
| On a covering problem in the hypercube B Stanton, L Özkahya arXiv preprint arXiv:1110.0224, 2011 | 1 | 2011 |
| Degree-Splittability of Regular Multigraphs and Caterpillars J Choi, L Ozkahya, DB West preprint, 2008 | 1 | 2008 |
| Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length A Kırtışoğlu, L Özkahya Graphs and Combinatorics 40 (1), 1-11, 2024 | | 2024 |
| Coloring Grids Avoiding Bicolored Paths D Keskinkilic, L Ozkahya arXiv preprint arXiv:2312.12919, 2023 | | 2023 |
| Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations AB Taşdemir, T Karacan, EK Kırmacı, L Özkahya International Conference on Computational Data and Social Networks, 236-244, 2022 | | 2022 |
| Low-Rank Representations Towards Classification Problem of Complex Networks M Çelik, AB Taşdemir, L Özkahya 2022 30th Signal Processing and Communications Applications Conference (SIU …, 2022 | | 2022 |
| Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length A Ki̇rti̇şoğlu, L Özkahya | | 2021 |
| Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures AB Taşdemir, L Özkahya 2021 29th Signal Processing and Communications Applications Conference (SIU …, 2021 | | 2021 |
| Classification of Complex Networks Using Structural Analysis of Random Graph Models AB Taşdemir, B Atasay, L Özkahya 2020 28th Signal Processing and Communications Applications Conference (SIU …, 2021 | | 2021 |
Zoltan FurediVerified email at illinois.edu
