default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSelda Küçükçifçi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j21]Paola Bonacini
, Selda Küçükçifçi, Salvatore Milici, Emine Sule Yazici:
On uniformly resolvable $(C_4,K_{1,3})$-designs. Contributions Discret. Math. 17(2): 1-22 (2022)
2010 – 2019
- 2019
- [j20]Selda Küçükçifçi, Charles Curtis Lindner, Sibel Özkan, Emine Sule Yazici:
Maximum packings of inside perfect 8-cycle systems. Australas. J Comb. 75: 146-157 (2019) - 2018
- [j19]Mario Gionfriddo, Selda Küçükçifçi, Salvatore Milici, Emine Sule Yazici:
Uniformly resolvable $(C_4, K_{1, 3})$-designs of order v and. Contributions Discret. Math. 13(1) (2018) - 2017
- [j18]Selda Küçükçifçi, Salvatore Milici:
Decomposition of λKv into kites and 4-cycles. Ars Comb. 131: 299-319 (2017) - 2016
- [j17]Fatih Demirkale, Diane M. Donovan, Selda Küçükçifçi, Emine Sule Yazici:
Orthogonal Trades and the Intersection Problem for Orthogonal Arrays. Graphs Comb. 32(3): 903-912 (2016) - 2015
- [j16]Selda Küçükçifçi, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
Resolvable 3-star designs. Discret. Math. 338(4): 608-614 (2015) - [j15]Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza:
Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles. Discret. Math. 338(10): 1667-1673 (2015) - 2014
- [j14]Selda Küçükçifçi:
Metamorphosis problems for graph designs. Ars Comb. 113: 47-64 (2014) - 2013
- [j13]Selda Küçükçifçi:
Metamorphosis problems for block designs. Electron. Notes Discret. Math. 40: 199-204 (2013) - 2012
- [j12]Selda Küçükçifçi, Emine Sule Yazici, Charles Curtis Lindner:
The full metamorphosis of λ-fold block designs with block size four into λ-fold 4-cycle systems. Ars Comb. 104: 81-96 (2012) - [j11]Selda Küçükçifçi, Emine Sule Yazici, Curt Lindner:
The full metamorphosis of λ-fold block designs with block size four into λ-fold triple systems. Ars Comb. 106: 337-351 (2012) - 2010
- [j10]Öznur Özkasap, Mine Çaglar, Emine Sule Yazici, Selda Küçükçifçi:
An analytical framework for self-organizing peer-to-peer anti-entropy algorithms. Perform. Evaluation 67(3): 141-159 (2010)
2000 – 2009
- 2009
- [j9]Selda Küçükçifçi, Curt Lindner, Gaetano Quattrocchi:
Embeddings of P3-designs into bowtie and almost bowtie systems. Discret. Math. 309(18): 5675-5677 (2009) - 2008
- [j8]Selda Küçükçifçi:
The intersection problem for PBD(5*, 3)s. Discret. Math. 308(2-3): 382-385 (2008) - [j7]Selda Küçükçifçi, Güven Yücetürk:
Maximum packing for perfect four-triple configurations. Discret. Math. 308(5-6): 753-762 (2008) - 2006
- [j6]Selda Küçükçifçi, Curt Lindner, Christopher A. Rodger:
A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9. Ars Comb. 79 (2006) - [j5]Emine Sule Yazici, Selda Küçükçifçi, Öznur Özkasap, Mine Çaglar:
Exact probability distributions for peer-to-peer epidemic information diffusion. SIGMETRICS Perform. Evaluation Rev. 34(3): 6-8 (2006) - [c1]Öznur Özkasap, Emine Sule Yazici, Selda Küçükçifçi, Mine Çaglar:
Exact Performance Measures for Peer-to-Peer Epidemic Information Diffusion. ISCIS 2006: 866-876 - 2004
- [j4]Selda Küçükçifçi, Charles C. Lindner:
Minimum Covering for Hexagon Triple Systems. Des. Codes Cryptogr. 32(1-3): 251-265 (2004) - [j3]Selda Küçükçifçi, Charles C. Lindner, Alexander Rosa:
The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles. Discret. Math. 278(1-3): 175-193 (2004) - [j2]Selda Küçükçifçi, Charles C. Lindner:
Perfect hexagon triple systems. Discret. Math. 279(1-3): 325-335 (2004) - 2000
- [j1]Selda Küçükçifçi:
The number of 8-cycles in 2-factorizations of Kn. Australas. J Comb. 22: 201-218 (2000)
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-08-05 21:16 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:
