default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLale Özkahya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Alaittin Kirtisoglu
, Lale Özkahya:
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length. Graphs Comb. 40(1): 11 (2024)- 2022
- [c4]Ali Baran Tasdemir, Tuna Karacan, Emir Kaan Kirmaci, Lale Özkahya:
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations. CSoNet 2022: 236-244 - [c3]Murat Çelik, Ali Baran Tasdemir, Lale Özkahya:
Low-Rank Representations Towards Classification Problem of Complex Networks. SIU 2022: 1-4 - [i4]Murat Çelik, Ali Baran Tasdemir, Lale Özkahya:
Low-Rank Representations Towards Classification Problem of Complex Networks. CoRR abs/2210.11561 (2022) - [i3]Ali Baran Tasdemir, Tuna Karacan, Emir Kaan Kirmaci, Lale Özkahya:
Learning Heuristics for the Maximum Clique Enumeration Problem Using Low Dimensional Representations. CoRR abs/2210.16963 (2022) - 2021
- [c2]Ali Baran Tasdemir, Lale Özkahya:
Learning Heuristics for the Maximum Clique Enumeration Problem Using Higher-Order Graph Structures. SIU 2021: 1-4 - 2020
- [i2]Taha Sevim, Muhammet Selçuk Güvel, Lale Özkahya:
A Fast Counting Method for 6-motifs with Low Connectivity. CoRR abs/2002.06957 (2020)
2010 – 2019
- 2019
- [c1]Taha Sevim, Muhammet Selçuk Güvel, Lale Özkahya:
A Fast Counting Method for 6-Motifs with Low Connectivity. MACIS 2019: 324-332 - 2018
- [j15]Lale Özkahya, Yury Person:
Minimum rainbow H-decompositions of graphs. Eur. J. Comb. 71: 111-124 (2018) - 2017
- [j14]Zoltán Füredi, Lale Özkahya:
On 3-uniform hypergraphs without a cycle of a given length. Discret. Appl. Math. 216: 582-588 (2017) - [j13]Lale Özkahya, Yury Person:
Minimum rainbow H-decompositions of graphs. Electron. Notes Discret. Math. 61: 955-961 (2017) - [i1]Lale Özkahya, Yury Person:
Minimum Rainbow H-Decompositions of Graphs. CoRR abs/1704.01000 (2017) - 2015
- [j12]Lale Özkahya, Brendon Stanton:
On a Covering Problem in the Hypercube. Graphs Comb. 31(1): 235-242 (2015) - 2013
- [j11]Maria Axenovich, Lale Özkahya:
On homometric sets in graphs. Australas. J Comb. 55: 175-188 (2013) - [j10]Zoltán Lóránt Nagy, Lale Özkahya, Balázs Patkós, Máté Vizer:
On the ratio of maximum and minimum degree in maximal intersecting families. Discret. Math. 313(2): 207-211 (2013) - [j9]Lale Özkahya, Michael Young:
Anti-Ramsey number of matchings in hypergraphs. Discret. Math. 313(20): 2359-2364 (2013) - 2012
- [j8]Lale Özkahya, Yury Person:
Minimum H-decompositions of graphs: Edge-critical case. J. Comb. Theory B 102(3): 715-725 (2012) - 2011
- [j7]Maria Axenovich, Lale Özkahya:
On homometric sets in graphs. Electron. Notes Discret. Math. 38: 83-86 (2011) - [j6]Zoltán Füredi, Lale Özkahya:
On even-cycle-free subgraphs of the hypercube. J. Comb. Theory A 118(6): 1816-1819 (2011) - [j5]Zoltán Füredi, Lale Özkahya:
Unavoidable subhypergraphs: a-clusters. J. Comb. Theory A 118(8): 2246-2256 (2011)
2000 – 2009
- 2009
- [j4]Zoltán Füredi, Lale Özkahya:
On 14-Cycle-Free Subgraphs of the Hypercube. Comb. Probab. Comput. 18(5): 725-729 (2009) - [j3]Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall:
A Brooks-type bound for squares of K4-minor-free graphs. Discret. Math. 309(23-24): 6572-6584 (2009) - [j2]Zoltán Füredi, Lale Özkahya:
Unavoidable subhypergraphs: a-clusters. Electron. Notes Discret. Math. 34: 63-67 (2009) - [j1]Zoltán Füredi, Lale Özkahya:
On even-cycle-free subgraphs of the hypercube. Electron. Notes Discret. Math. 34: 515-517 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
