default search action
Maciej Rysz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Maciej Rysz
, Alexander Semenov
A key distribution technique for wireless sensor networks using spanning trees. Expert Syst. Appl. 257: 124997 (2024) - [j12]Alexander Semenov
Deep Learning Approach for SAR Image Retrieval for Reliable Positioning in GPS-Challenged Environments. IEEE Trans. Geosci. Remote. Sens. 62: 1-11 (2024) - 2022
- [j11]Alexander Semenov
Diversity in news recommendations using contextual bandits. Expert Syst. Appl. 195: 116478 (2022) - [j10]Arsenios Tsokas
SAR data applications in earth observation: An overview. Expert Syst. Appl. 205: 117342 (2022) - 2021
- [j9]Maciej Rysz, Siddhartha S. Mehta:
A risk-averse optimization approach to human-robot collaboration in robotic fruit harvesting. Comput. Electron. Agric. 182: 106018 (2021) - [i2]Seonho Park, Maciej Rysz, Kathleen M. Dipple, Panos M. Pardalos:
Homography augumented momentum constrastive learning for SAR image retrieval. CoRR abs/2109.10329 (2021) - 2020
- [j8]Guanglin Xu, Alexander Semenov, Maciej Rysz
An integer programming formulation of the key management problem in wireless sensor networks. Optim. Lett. 14(5): 1037-1051 (2020)
2010 – 2019
- 2019
- [j7]Siddhartha S. Mehta
New approach to visual servo control using terminal constraints. J. Frankl. Inst. 356(10): 5001-5026 (2019) - [j6]Maciej Rysz
A Two-Stage Stochastic Optimization Approach for Detecting Structurally Stable Clusters in Randomly Changing Graphs. IEEE Trans. Netw. Sci. Eng. 6(4): 671-683 (2019) - [i1]Guanglin Xu, Alexander Semenov, Maciej Rysz:
An Integer Programming Formulation of the Key Management Problem in Wireless Sensor Networks. CoRR abs/1901.07314 (2019) - 2018
- [j5]Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights. Ann. Oper. Res. 262(1): 89-108 (2018) - [j4]Maciej Rysz, Foad Mahdavi Pajouh
Finding clique clusters with the highest betweenness centrality. Eur. J. Oper. Res. 271(1): 155-164 (2018) - 2017
- [j3]Maciej Rysz, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach. Networks 69(2): 189-204 (2017) - 2015
- [j2]Maciej Rysz, Alexander Vinel, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
A Scenario Decomposition Algorithm for Stochastic Programming Problems with a Class of Downside Risk Measures. INFORMS J. Comput. 27(2): 416-430 (2015) - 2014
- [j1]Maciej Rysz, Mohammad Mirghorbani, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
On risk-averse maximum weighted subgraph problems. J. Comb. Optim. 28(1): 167-185 (2014) - [p1]Maciej Rysz, Foad Mahdavi Pajouh, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
On Risk-Averse Weighted k-Club Problems. Examining Robustness and Vulnerability of Networked Systems 2014: 231-242
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-12-10 21:41 CET 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: