default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLubov Bazylevych
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c13]Roman P. Bazylevych, Lubov Bazylevych:
A set of nets planarization with two chains of contacts. CSIT (1) 2021: 202-205- 2020
- [c12]Roman P. Bazylevych, Mariusz Wrzesien
, Lubov Bazylevych:
A Set of Nets Planarization for Electronic Devices' Physical Design Automation. CSIT (1) 2020: 192-195
2010 – 2019
- 2019
- [c11]Roman P. Bazylevych, Mariusz Wrzesien, Lubov Bazylevych:
Power System Islanding by the Hierarchical Clustering. CSIT (1) 2019: 145-148 - 2016
- [c10]Roman P. Bazylevych, Marek Palasinski, Lubov Bazylevych:
Topologically-Geometric Routing. SLIP 2016: 5:1-5:6 - 2014
- [c9]Roman P. Bazylevych, Sergii Byelyayev, Lubov Bazylevych, Alexandr Nikolaevich Kolesenkov, Boris Kostrov, Ekaterina Ruchkina, Vladimir Ruchkin:
The analysis and optimization algorithms of the electronic circuits design. MECO 2014: 189-192 - 2013
- [c8]Roman P. Bazylevych, Lubov Bazylevych:
The methodology and algorithms for solving the very large-scale physical design automation problems: Partitioning, packaging, placement and routing. MECO 2013: 1-2 - [c7]Roman P. Bazylevych, Marek Palasinski, Lubov Bazylevych, Dmytro Yanush:
Partitioning optimization by iterative reassignment of the hierarchically built clusters with border elements. MECO 2013: 219-222 - [c6]Roman P. Bazylevych, Lubov Bazylevych:
Tutorial: Macro-modeling for solving SOC physical design automation problems. SoCC 2013: 314 - 2011
- [c5]Roman P. Bazylevych, Rémy Dupas, Bhanu Prasad, Bohdan Kuz, Roman Kutelmakh, Lubov Bazylevych:
A Parallel Approach for Solving a Large-Scale Traveling Salesman Problem. IICAI 2011: 566-579
2000 – 2009
- 2009
- [c4]Roman P. Bazylevych, Bhanu Prasad, Roman Kutelmakh, Rémy Dupas, Lubov Bazylevych:
A Decomposition Algorithm for Uniform Traveling Salesman Problem. IICAI 2009: 47-56 - 2008
- [c3]Roman P. Bazylevych, Bhanu Prasad, Roman Kutelmakh, Lubov Bazylevych:
Decomposition and Scanning Optimization Algorithms for TSP. TMFCS 2008: 110-116 - 2007
- [c2]Roman P. Bazylevych, Ihor Podolskyy, Lubov Bazylevych:
Partitioning Optimization by Recursive Moves of Hierarchically Built Clusters. DDECS 2007: 235-238 - [c1]Roman P. Bazylevych, Roman Kutelmakh, Rémy Dupas, Lubov Bazylevych:
Decomposition Algorithms for Large-scale Clustered TSP. IICAI 2007: 255-267
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-04-24 23:09 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:
