default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZeynep Nihan Berberler
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Zeynep Nihan Berberler
:
Generalized entropies of subdivision-corona networks. Discret. Math. Algorithms Appl. 16(6): 2350079:1-2350079:11 (2024)- [j14]Zeynep Nihan Berberler, Aysun Aytaç:
Node and Link Vulnerability in Complete Multipartite Networks. Int. J. Found. Comput. Sci. 35(4): 375-385 (2024) - 2023
- [j13]Zeynep Nihan Berberler:
Quasi-Laplacian energy of composite graphs. Discret. Math. Algorithms Appl. 15(4): 2250112:1-2250112:11 (2023) - [j12]Halil Ibrahim Yildirim, Zeynep Nihan Berberler:
Isolated Rupture in Composite Networks. Int. J. Found. Comput. Sci. 34(4): 363-371 (2023) - 2022
- [j11]Halil Ibrahim Yildirim, Zeynep Nihan Berberler:
Isolated Rupture in Thorny Networks. Int. J. Found. Comput. Sci. 33(5): 429-438 (2022) - 2021
- [j10]Zeynep Nihan Berberler, Halil Ibrahim Yildirim, Tolga Iltüzer, Izzet Tunç:
Agglomeration-Based Node Importance Analysis in Wheel-Type Networks. Int. J. Found. Comput. Sci. 32(3): 269-288 (2021) - 2020
- [j9]Murat Ersen Berberler, Onur Ugurlu, Zeynep Nihan Berberler:
Independent strong weak domination: A mathematical programming approach. Discret. Math. Algorithms Appl. 12(5): 2050062:1-2050062:8 (2020) - [j8]Zeynep Nihan Berberler, Murat Ersen Berberler:
Independent strong domination in complementary prisms. Electron. J. Graph Theory Appl. 8(1): 1-8 (2020) - [j7]Aysun Asena Kunt, Zeynep Nihan Berberler:
Efficient Identification of Node Importance Based on Agglomeration in Cycle-Related Networks. Int. J. Found. Comput. Sci. 31(7): 969-978 (2020)
2010 – 2019
- 2019
- [j6]Esin Yigit, Zeynep Nihan Berberler:
A Note on the Link Residual Closeness of Graphs Under Join Operation. Int. J. Found. Comput. Sci. 30(3): 417-424 (2019) - 2018
- [j5]Zeynep Nihan Berberler, Esin Yigit:
Link Vulnerability in Networks. Int. J. Found. Comput. Sci. 29(3): 447-456 (2018) - [j4]Aysun Aytaç, Zeynep Nihan Berberler:
Network robustness and residual closeness. RAIRO Oper. Res. 52(3): 839-847 (2018) - 2017
- [j3]Murat Ersen Berberler, Zeynep Nihan Berberler:
Measuring the vulnerability in networks: a heuristic approach. Ars Comb. 135: 3-15 (2017) - [j2]Vecdi Aytaç, Zeynep Nihan Berberler:
Binding Number and Wheel Related Graphs. Int. J. Found. Comput. Sci. 28(1): 29-38 (2017) - [j1]Aysun Aytaç, Zeynep Nihan Berberler:
Robustness of Regular Caterpillars. Int. J. Found. Comput. Sci. 28(7): 835-842 (2017)
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-09-22 00:39 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:
