default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorgiy Yaskov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Yuriy Stoyan, Georgiy Yaskov
, Tetyana Romanova, Igor S. Litvinchev, José Manuel Velarde Cantú, Mauricio López Acosta:
Packing Spheres into a Minimum-Height Parabolic Container. Axioms 13(6): 396 (2024)- [j9]Andreas Fischer, Igor S. Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov:
Packing spheres with quasi-containment conditions. J. Glob. Optim. 90(3): 671-689 (2024) - [c6]Georgiy Yaskov, Andrii Chuhai, Yelyzaveta Yaskova, Andrii Zhuravka:
Intelligent System for Planning Treatment of Retinopathy with Laser Technology. COLINS (1) 2024: 59-69 - [c5]Andrii Chuhai, Georgiy Yaskov, Olha Starkova:
Optimization geometric design in intelligent systems for ensuring safety. ICST 2024: 519-531 - 2021
- [j8]Yuriy Stoyan, Georgiy Yaskov:
Optimized packing unequal spheres into a multiconnected domain: mixed-integer non-linear programming approach. Int. J. Comput. Math. Comput. Syst. Theory 6(1): 94-111 (2021) - [c4]Oleksii Kartashov, Kyryl Korobchynskyi, Iryna Yakovleva, Georgiy Yaskov, Olga Yarovaya:
Synthesis of Spherical Object Configurations: Models and Information Technologies. CMIS 2021: 287-298 - [c3]Georgiy Yaskov, Andrey Chugay, Tatiyana Romanova, Sergey Shekhovtsov:
Bi-objective Circular-Hole Based Topology Optimization Problem in Additive Manufacturing. CMIS 2021: 434-444 - 2020
- [j7]Igor Yanchevskyi, Roland Lachmayer, Iryna Mozgova, René-Bastian Lippert, Georgiy Yaskov, Tatiana E. Romanova, Igor S. Litvinchev:
Circular packing for support-free structures. EAI Endorsed Trans. Energy Web 7(30): e3 (2020) - [c2]Georgiy Yaskov, Andrey Chugay:
Packing equal spheres by means of the block coordinate descent method. CMIS 2020: 156-168
2010 – 2019
- 2019
- [c1]Georgiy Yaskov, Tetyana Romanova, Igor S. Litvinchev, Sergey Shekhovtsov:
Optimal Packing Problems: From Knapsack Problem to Open Dimension Problem. ICO 2019: 671-678 - 2014
- [j6]Yuriy Stoyan, Georgiy Yaskov:
Packing unequal circles into a strip of minimal length with a jump algorithm. Optim. Lett. 8(3): 949-970 (2014) - 2013
- [j5]Yu. G. Stoyan, Georgiy Yaskov:
Packing congruent spheres into a multi-connected polyhedral domain. Int. Trans. Oper. Res. 20(1): 79-99 (2013) - 2012
- [j4]Yuriy Stoyan, Georgiy Yaskov:
Packing equal circles into a circle with circular prohibited areas. Int. J. Comput. Math. 89(10): 1355-1369 (2012) - [j3]Yuriy Stoyan, Georgiy Yaskov:
Packing congruent hyperspheres into a hypersphere. J. Glob. Optim. 52(4): 855-868 (2012) - 2010
- [j2]Yu. G. Stoyan, G. N. Yaskov:
Packing identical spheres into a cylinder. Int. Trans. Oper. Res. 17(1): 51-70 (2010)
2000 – 2009
- 2004
- [j1]Yu. G. Stoyan, Georgiy Yaskov:
A mathematical model and a solution method for the problem of placing various-sized circles into a strip. Eur. J. Oper. Res. 156(3): 590-600 (2004)
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:45 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:
