Yayınlar & Eserler

Yayın Ağı
Makaleler 12
Tümü (12)
SCI-E, SSCI, AHCI (11)
SCI-E, SSCI, AHCI, ESCI (11)
Scopus (12)

1. Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length

Kırtışoğlu A., ÖZKAHYA L.
Graphs and Combinatorics , cilt.40, sa.1, 2024 (SCI-Expanded, Scopus) identifier identifier

2. Minimum rainbow H-decompositions of graphs

ÖZKAHYA L., Person Y.
EUROPEAN JOURNAL OF COMBINATORICS , cilt.71, ss.111-124, 2018 (SCI-Expanded, Scopus) identifier identifier

3. On 3-uniform hypergraphs without a cycle of a given length

Furedi Z., ÖZKAHYA L.
DISCRETE APPLIED MATHEMATICS , cilt.216, ss.582-588, 2017 (SCI-Expanded, Scopus) identifier identifier

4. On a Covering Problem in the Hypercube

ÖZKAHYA L., Stanton B.
GRAPHS AND COMBINATORICS , cilt.31, sa.1, ss.235-242, 2015 (SCI-Expanded, Scopus) Creative Commons License identifier identifier

5. Anti-Ramsey number of matchings in hypergraphs

Ozkahya L., Young M.
DISCRETE MATHEMATICS , cilt.313, sa.20, ss.2359-2364, 2013 (SCI-Expanded, Scopus) identifier identifier

6. On the ratio of maximum and minimum degree in maximal intersecting families

Nagy Z. L., Oezkahya L., Patkos B., Vizer M.
DISCRETE MATHEMATICS , cilt.313, sa.2, ss.207-211, 2013 (SCI-Expanded, Scopus) identifier identifier

7. Minimum H-decompositions of graphs: Edge-critical case

Ozkahya L., Person Y.
JOURNAL OF COMBINATORIAL THEORY SERIES B , cilt.102, sa.3, ss.715-725, 2012 (SCI-Expanded, Scopus) identifier identifier

8. On homometric sets in graphs

Axenovich M., Özkahya L.
Electronic Notes in Discrete Mathematics , cilt.38, ss.83-86, 2011 (Scopus) identifier

9. Unavoidable subhypergraphs: a-clusters

Fueredi Z., Oezkahya L.
JOURNAL OF COMBINATORIAL THEORY SERIES A , cilt.118, sa.8, ss.2246-2256, 2011 (SCI-Expanded, Scopus) identifier identifier

10. On even-cycle-free subgraphs of the hypercube

Fueredi Z., Ozkahya L.
JOURNAL OF COMBINATORIAL THEORY SERIES A , cilt.118, sa.6, ss.1816-1819, 2011 (SCI-Expanded, Scopus) identifier identifier

11. A Brooks-type bound for squares of K-4-minor-free graphs

Kostochka A. V., Ozkahya L., Woodall D. R.
DISCRETE MATHEMATICS , cilt.309, ss.6572-6584, 2009 (SCI-Expanded, Scopus) identifier identifier

12. On 14-Cycle-Free Subgraphs of the Hypercube

Furedi Z., Ozkahya L.
COMBINATORICS PROBABILITY & COMPUTING , cilt.18, sa.5, ss.725-729, 2009 (SCI-Expanded, Scopus) identifier identifier
Hakemli Bilimsel Toplantılarda Yayımlanmış Bildiriler 4

1. Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations

TAŞDEMİR A. B., Karacan T., Kırmacı E. K., ÖZKAHYA L.
11th International Conference on Computational Data and Social Networks, CSoNet 2022, Virtual, Online, 5 - 07 Aralık 2022, cilt.13831 LNCS, ss.236-244, (Tam Metin Bildiri) Creative Commons License identifier

2. Low-Rank Representations Towards Classification Problem of Complex Networks Karmaşik Aǧlarin Siniflandirma Sorusuna Yönelik Düşük-Dereceli Temsiliyeti

Celik M., TAŞDEMİR A. B., ÖZKAHYA L.
30th Signal Processing and Communications Applications Conference, SIU 2022, Safranbolu, Türkiye, 15 - 18 Mayıs 2022, (Tam Metin Bildiri) identifier

3. Learning heuristics for the maximum clique enumeration problem using higher-order graph structures Yüksek-derece çizge yapilari ile maksimum klik sayma problemine yönelik buluşsal yöntemleri öǧrenme

TAŞDEMİR A. B., ÖZKAHYA L.
29th IEEE Conference on Signal Processing and Communications Applications, SIU 2021, Virtual, Istanbul, Türkiye, 9 - 11 Haziran 2021, (Tam Metin Bildiri) identifier identifier

4. Classification of Complex Networks Using Structural Analysis of Random Graph Models Rastsal Cizge Modellerinin Yapisal Analizi ile Karmasik Aglarin Siniflandirilmasi

TAŞDEMİR A. B., Atasay B., ÖZKAHYA L.
28th Signal Processing and Communications Applications Conference, SIU 2020, Gaziantep, Türkiye, 5 - 07 Ekim 2020, (Tam Metin Bildiri) identifier
Metrikler

Yayın

16

Yayın (WoS)

12

Yayın (Scopus)

16

Atıf (WoS)

55

H-İndeks (WoS)

5

Atıf (Scopus)

47

H-İndeks (Scopus)

4

Proje

3

Açık Erişim

2