default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAysegül Altin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Derya Nurcan-Atceken, Aysegül Altin-Kayhan
, Bülent Tavli:
A novel differentiated coverage-based lifetime metric for wireless sensor networks. Ad Hoc Networks 164: 103636 (2024)- 2023
- [j14]Cansu Cav, Aysegül Altin-Kayhan:
Coverage hole optimization with a mobile sensor in wireless sensor networks for smart grid. Ad Hoc Networks 140: 103039 (2023) - [j13]Busra Gultekin, Derya Nurcan-Atceken, Aysegül Altin-Kayhan, Huseyin Ugur Yildiz, Bülent Tavli:
Exploring the tradeoff between energy dissipation, delay, and the number of backbones for broadcasting in wireless sensor networks through goal programming. Ad Hoc Networks 149: 103223 (2023) - 2022
- [j12]Elif Zeynep Serper, Aysegül Altin-Kayhan:
Coverage and connectivity based lifetime maximization with topology update for WSN in smart grid applications. Comput. Networks 209: 108940 (2022)
2010 – 2019
- 2019
- [j11]Tugçe Yücel, Aysegül Altin-Kayhan:
A copy-at-neighbouring-node retransmission strategy for improved wireless sensor network lifetime and reliability. J. Oper. Res. Soc. 70(7): 1193-1202 (2019) - 2017
- [j10]Merve Ekmen, Aysegül Altin-Kayhan:
Reliable and energy efficient wireless sensor network design via conditional multi-copying for multiple central nodes. Comput. Networks 126: 57-68 (2017) - 2016
- [j9]Merve Ekmen, Aysegül Altin-Kayhan:
A Conditional Multi-copy Strategy with Multiple Central Nodes for More Secure Wireless Sensor Networks. Electron. Notes Discret. Math. 52: 261-268 (2016) - [j8]Aysegül Altin-Kayhan, Melek Sendil:
Optimal path selection under different data. INFOR Inf. Syst. Oper. Res. 54(2): 121-146 (2016) - 2013
- [j7]Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. Ann. Oper. Res. 204(1): 65-95 (2013) - [j6]Davut Incebacak, Bülent Tavli, Kemal Bicakci, Aysegül Altin-Kayhan:
Optimal number of routing paths in multi-path routing to minimize energy consumption in wireless sensor networks. EURASIP J. Wirel. Commun. Netw. 2013: 252 (2013) - 2012
- [j5]Aysegül Altin, Bernard Fortz, Hakan Ümit:
Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Networks 60(2): 132-139 (2012) - 2011
- [j4]Aysegül Altin, Hande Yaman, Mustafa Ç. Pinar:
The Robust Network Loading Problem Under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations. INFORMS J. Comput. 23(1): 75-89 (2011)
2000 – 2009
- 2009
- [j3]Aysegül Altin, Bernard Fortz, Mikkel Thorup, Hakan Ümit:
Intra-domain traffic engineering with shortest path routing protocols. 4OR 7(4): 301-335 (2009) - 2007
- [j2]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007) - 2004
- [j1]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty. Electron. Notes Discret. Math. 17: 19-22 (2004) - [c1]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27
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-10 02:07 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:
