Lale Özkahya

Orcid: 0000-0001-6105-1694

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length.
Graphs Comb., February, 2024

2022
Low-Rank Representations Towards Classification Problem of Complex Networks.
Proceedings of the 30th Signal Processing and Communications Applications Conference, 2022

Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations.
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.
Proceedings of the 29th Signal Processing and Communications Applications Conference, 2021

2019
A Fast Counting Method for 6-Motifs with Low Connectivity.
Proceedings of the Mathematical Aspects of Computer and Information Sciences, 2019

2017
Minimum rainbow H-decompositions of graphs.
Electron. Notes Discret. Math., 2017

On 3-uniform hypergraphs without a cycle of a given length.
Discret. Appl. Math., 2017

2015
On a Covering Problem in the Hypercube.
Graphs Comb., 2015

2013
Anti-Ramsey number of matchings in hypergraphs.
Discret. Math., 2013

On the ratio of maximum and minimum degree in maximal intersecting families.
Discret. Math., 2013

2012
Minimum H-decompositions of graphs: Edge-critical case.
J. Comb. Theory, Ser. B, 2012

2011
On homometric sets in graphs.
Electron. Notes Discret. Math., 2011

2009
On even-cycle-free subgraphs of the hypercube.
Electron. Notes Discret. Math., 2009

Unavoidable subhypergraphs: a-clusters.
Electron. Notes Discret. Math., 2009

A Brooks-type bound for squares of K<sub>4</sub>-minor-free graphs.
Discret. Math., 2009

On 14-Cycle-Free Subgraphs of the Hypercube.
Comb. Probab. Comput., 2009


  Loading...