Lale Özkahya

According to our database, Lale Özkahya authored at least 16 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2024

Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length.

Alaittin Kirtisoglu, Lale Özkahya

Graphs Comb., February, 2024

2022

Low-Rank Representations Towards Classification Problem of Complex Networks.

Murat Çelik, Ali Baran Tasdemir, Lale Özkahya

Proceedings of the 30th Signal Processing and Communications Applications Conference, 2022

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

Ali Baran Tasdemir, Tuna Karacan, Emir Kaan Kirmaci, Lale Özkahya

Proceedings of the Computational Data and Social Networks - 11th International Conference, 2022

2021

Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures.

Ali Baran Tasdemir, Lale Özkahya

Proceedings of the 29th Signal Processing and Communications Applications Conference, 2021

2019

A Fast Counting Method for 6-Motifs with Low Connectivity.

Taha Sevim, Muhammet Selçuk Güvel, Lale Özkahya

Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2017

Minimum rainbow H-decompositions of graphs.

Lale Özkahya, Yury Person

Electron. Notes Discret. Math., 2017

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

Zoltán Füredi, Lale Özkahya

Discret. Appl. Math., 2017

2015

On a Covering Problem in the Hypercube.

Lale Özkahya, Brendon Stanton

Graphs Comb., 2015

2013

Anti-Ramsey number of matchings in hypergraphs.

Lale Özkahya, Michael Young

Discret. Math., 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

On homometric sets in graphs.

Maria Axenovich, Lale Özkahya

Australas. J Comb., 2013

2012

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

Lale Özkahya, Yury Person

J. Comb. Theory B, 2012

2011

Unavoidable subhypergraphs: a-clusters.

Zoltán Füredi, Lale Özkahya

J. Comb. Theory A, 2011

On even-cycle-free subgraphs of the hypercube.

Zoltán Füredi, Lale Özkahya

J. Comb. Theory A, 2011

2009

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

Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall

Discret. Math., 2009

On 14-Cycle-Free Subgraphs of the Hypercube.

Zoltán Füredi, Lale Özkahya

Comb. Probab. Comput., 2009