Yu. N. Sotskov
- Industrial and Manufacturing Engineering top 1%
- Computer Networks and Communications top 10%
- Control and Systems Engineering
- Management Science and Operations Research
- Management Information Systems
- Topics
- Scheduling and Optimization Algorithms (18 papers)Advanced Manufacturing and Logistics Optimization (10 papers)Optimization and Packing Problems (8 papers)
- Cited by
- Industrial and Manufacturing EngineeringComputer Networks and CommunicationsManagement Information Systems
In The Last Decade
Yu. N. Sotskov
20 papers receiving 381 citations
Peers
Comparison fields: 5 of 47
- Industrial and Manufacturing Engineering 375
- Computer Networks and Communications 111
- Control and Systems Engineering 44
- Management Science and Operations Research 36
- Management Information Systems 34
Countries citing papers authored by Yu. N. Sotskov
This map shows the geographic impact of Yu. N. Sotskov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Yu. N. Sotskov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Yu. N. Sotskov more than expected).
Fields of papers citing papers by Yu. N. Sotskov
This network shows the impact of papers produced by Yu. N. Sotskov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Yu. N. Sotskov. The network helps show where Yu. N. Sotskov may publish in the future.
Co-authorship network of co-authors of Yu. N. Sotskov
This figure shows the co-authorship network connecting the top 25 collaborators of Yu. N. Sotskov. A scholar is included among the top collaborators of Yu. N. Sotskov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Yu. N. Sotskov. Yu. N. Sotskov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 5 | |
| 3 | 1 | |
| 4 | 30 | |
| 5 | 9 | |
| 6 | 34 | |
| 7 | 36 | |
| 8 | 36 | |
| 9 | 7 | |
| 10 | 23 | |
| 11 | 84 | |
| 12 | 18 | |
| 13 | 64 | |
| 14 | 3 | |
| 15 | 1 | |
| 16 | 10 | |
| 17 | The stability of the approximate Boolean minimization of a linear form | 5 |
| 18 | 2 | |
| 19 | 58 | |
| 20 | 3 |
About Yu. N. Sotskov
Yu. N. Sotskov is a scholar working on Industrial and Manufacturing Engineering, Computer Networks and Communications and Numerical Analysis, having authored 20 papers that have together received 430 indexed citations. Recurring topics across this work include Scheduling and Optimization Algorithms (18 papers), Advanced Manufacturing and Logistics Optimization (10 papers) and Optimization and Packing Problems (8 papers). The work is most often cited by research in Industrial and Manufacturing Engineering (375 citations), Computer Networks and Communications (111 citations) and Management Information Systems (34 citations). Yu. N. Sotskov has collaborated with scholars based in Belarus, Germany and Taiwan. Frequent co-authors include Natalia V. Shakhlevich, Tsung-Chyan Lai, Frank Werner, Peter Brucker and Svetlana A. Kravchenko. Their work appears in journals such as European Journal of Operational Research, Computers & Operations Research and Mathematical and Computer Modelling.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.