![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Evren Güney
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j9]Kübra Taninmis
, Necati Aras
, Evren Güney
, Markus Sinnl
:
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. Comput. Oper. Res. 167: 106675 (2024) - 2023
- [i1]Kübra Taninmis, Necati Aras, Evren Güney, Markus Sinnl:
Benders decomposition algorithms for minimizing the spread of harmful contagions in networks. CoRR abs/2303.12402 (2023) - 2021
- [j8]Evren Güney
, Markus Leitner
, Mario Ruthmair
, Markus Sinnl:
Large-scale influence maximization via maximal covering location. Eur. J. Oper. Res. 289(1): 144-164 (2021) - 2020
- [j7]Kübra Taninmis
, Necati Aras, I. Kuban Altinel, Evren Güney
:
Minimizing the misinformation spread in social networks. IISE Trans. 52(8): 850-863 (2020) - [j6]Evren Güney:
Erratum to "An Efficient Linear Programming Based Method for the Influence Maximization Problem in Social Networks" [Information Sciences 503C (201911) 589-605]. Inf. Sci. 511: 309 (2020)
2010 – 2019
- 2019
- [j5]Evren Güney
:
An efficient linear programming based method for the influence maximization problem in social networks. Inf. Sci. 503: 589-605 (2019) - [j4]Evren Güney
:
On the optimal solution of budgeted influence maximization problem in social networks. Oper. Res. 19(3): 817-831 (2019) - 2017
- [c3]Evren Güney:
A Mixed Integer Linear Program for Election Campaign Optimization Under D'Hondt Rule. OR 2017: 73-79 - 2012
- [j3]Evren Güney
, Necati Aras
, I. Kuban Altinel, Cem Ersoy
:
Efficient solution techniques for the integrated coverage, sink location and routing problem in wireless sensor networks. Comput. Oper. Res. 39(7): 1530-1539 (2012) - 2010
- [j2]Evren Güney
, Necati Aras
, I. Kuban Altinel, Cem Ersoy
:
Efficient integer programming formulations for optimum sink location and routing in heterogeneous wireless sensor networks. Comput. Networks 54(11): 1805-1822 (2010) - [c2]Evren Güney, I. Kuban Altinel, Necati Aras, Cem Ersoy
:
A Tabu Search Heuristic for Point Coverage, Sink Location, and Data Routing in Wireless Sensor Networks. EvoCOP 2010: 83-94
2000 – 2009
- 2008
- [j1]I. Kuban Altinel, Necati Aras
, Evren Güney
, Cem Ersoy
:
Binary integer programming formulation and heuristics for differentiated coverage in heterogeneous sensor networks. Comput. Networks 52(12): 2419-2431 (2008) - 2006
- [c1]I. Kuban Altinel, Necati Aras
, Evren Güney
, Cem Ersoy
:
Effective coverage in sensor networks: Binary integer programming formulations and heuristics. ICC 2006: 4014-4019
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint