Vladimir Boginski

1.6k total citations
49 papers, 922 citations indexed

About

Vladimir Boginski is a scholar working on Statistical and Nonlinear Physics, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Vladimir Boginski has authored 49 papers receiving a total of 922 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Statistical and Nonlinear Physics, 11 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Vladimir Boginski's work include Complex Network Analysis Techniques (25 papers), Facility Location and Emergency Management (10 papers) and Opinion Dynamics and Social Influence (8 papers). Vladimir Boginski is often cited by papers focused on Complex Network Analysis Techniques (25 papers), Facility Location and Emergency Management (10 papers) and Opinion Dynamics and Social Influence (8 papers). Vladimir Boginski collaborates with scholars based in United States, Finland and Switzerland. Vladimir Boginski's co-authors include Sergiy Butenko, Alexander Veremyev, Pãnos M. Pardalos, Eduardo L. Pasiliao, Eduardo Pasiliao, Shiblu Sarker, Arvind Singh, Foad Mahdavi Pajouh, Oleg A. Prokopyev and Alexey V. Sorokin and has published in prestigious journals such as SHILAP Revista de lepidopterología, PLoS ONE and Analytical Chemistry.

In The Last Decade

Vladimir Boginski

48 papers receiving 888 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Vladimir Boginski United States 16 363 227 188 160 127 49 922
A. J. Lawrance United Kingdom 20 262 0.7× 243 1.1× 112 0.6× 152 0.9× 182 1.4× 72 1.4k
Sukono Sukono Indonesia 14 248 0.7× 238 1.0× 51 0.3× 134 0.8× 93 0.7× 154 971
Dean Isaacson United States 13 129 0.4× 68 0.3× 175 0.9× 154 1.0× 223 1.8× 34 1.1k
Christine Thomas‐Agnan France 16 86 0.2× 319 1.4× 89 0.5× 29 0.2× 407 3.2× 50 1.6k
Raisa E. Feldman United States 5 117 0.3× 204 0.9× 31 0.2× 150 0.9× 126 1.0× 12 926
Silviu Guiaşu Canada 12 246 0.7× 94 0.4× 73 0.4× 55 0.3× 270 2.1× 48 1.1k
Christiane Lemieux Canada 17 68 0.2× 153 0.7× 117 0.6× 21 0.1× 102 0.8× 64 1.2k
Mihai Cucuringu United Kingdom 14 132 0.4× 117 0.5× 55 0.3× 43 0.3× 100 0.8× 68 568
Vladas Pipiras United States 20 148 0.4× 463 2.0× 46 0.2× 84 0.5× 120 0.9× 97 1.4k
Iosif Il’ich Gihman Russia 7 137 0.4× 141 0.6× 150 0.8× 58 0.4× 113 0.9× 7 1.2k

Countries citing papers authored by Vladimir Boginski

Since Specialization
Citations

This map shows the geographic impact of Vladimir Boginski'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 Vladimir Boginski with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Vladimir Boginski more than expected).

Fields of papers citing papers by Vladimir Boginski

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Vladimir Boginski. 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 Vladimir Boginski. The network helps show where Vladimir Boginski may publish in the future.

Co-authorship network of co-authors of Vladimir Boginski

This figure shows the co-authorship network connecting the top 25 collaborators of Vladimir Boginski. A scholar is included among the top collaborators of Vladimir Boginski 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 Vladimir Boginski. Vladimir Boginski is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Veremyev, Alexander, Vladimir Boginski, Eduardo L. Pasiliao, & Oleg A. Prokopyev. (2025). Ultra-small world detection in networks: subgraphs with prescribed distance distributions. Computational Optimization and Applications. 92(3). 1069–1121.
2.
Sarker, Shiblu, Arvind Singh, Alexander Veremyev, Vladimir Boginski, & S. D. Peckham. (2025). Controllability and heterogeneity of river networks using spectral graph theory approach. Scientific Reports. 15(1). 13196–13196. 1 indexed citations
3.
Pasiliao, Eduardo, et al.. (2023). A polyhedral approach to least cost influence maximization in social networks. Journal of Combinatorial Optimization. 45(1). 1 indexed citations
4.
Semenov, Alexander, et al.. (2022). Networks of causal relationships in the U.S. stock market. SHILAP Revista de lepidopterología. 10(1). 177–190. 4 indexed citations
5.
Semenov, Alexander, Alexander Veremyev, Alexander Nikolaev, Eduardo L. Pasiliao, & Vladimir Boginski. (2020). Network-based indices of individual and collective advising impacts in mathematics. SHILAP Revista de lepidopterología. 7(1). 4 indexed citations
6.
Veremyev, Alexander, Alexander Semenov, Eduardo L. Pasiliao, & Vladimir Boginski. (2019). Graph-based exploration and clustering analysis of semantic spaces. Applied Network Science. 4(1). 16 indexed citations
7.
Nam, Nguyen Mau, et al.. (2018). A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique. Journal of Global Optimization. 72(4). 705–729. 4 indexed citations
8.
Veremyev, Alexander, et al.. (2017). On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches. Networks. 71(2). 136–152. 24 indexed citations
9.
Butenko, Sergiy, et al.. (2016). Detecting robust cliques in graphs subject to uncertain edge failures. Annals of Operations Research. 262(1). 109–132. 5 indexed citations
10.
Veremyev, Alexander, Oleg A. Prokopyev, Vladimir Boginski, & Eduardo L. Pasiliao. (2014). Finding maximum subgraphs with relatively large vertex connectivity. European Journal of Operational Research. 239(2). 349–362. 16 indexed citations
11.
Boginski, Vladimir, et al.. (2013). A network-based data mining approach to portfolio selection via weighted clique relaxations. Annals of Operations Research. 216(1). 23–34. 26 indexed citations
12.
Veremyev, Alexander, Vladimir Boginski, & Eduardo L. Pasiliao. (2013). Exact identification of critical nodes in sparse networks via new compact formulations. Optimization Letters. 8(4). 1245–1259. 72 indexed citations
13.
Sorokin, Alexey V., et al.. (2013). A note on transmission switching in electric grids with uncertain line failures. Energy Systems. 4(4). 419–430. 2 indexed citations
14.
Veremyev, Alexander, et al.. (2012). On the maximum quasi-clique problem. Discrete Applied Mathematics. 161(1-2). 244–257. 77 indexed citations
15.
Veremyev, Alexander, et al.. (2012). Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably “Explosive”. PLoS ONE. 7(12). e51883–e51883. 5 indexed citations
16.
Veremyev, Alexander, et al.. (2012). Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. Journal of Combinatorial Optimization. 27(3). 462–486. 4 indexed citations
18.
Boginski, Vladimir, et al.. (2009). Polynomial-time identification of robust network flows under uncertain arc failures. Optimization Letters. 3(3). 461–473. 19 indexed citations
19.
Boginski, Vladimir, et al.. (2009). Robust multi-sensor scheduling for multi-site surveillance. Journal of Combinatorial Optimization. 22(1). 35–51. 7 indexed citations
20.
Boginski, Vladimir, Sergiy Butenko, & Pãnos M. Pardalos. (2004). Statistical analysis of financial networks. Computational Statistics & Data Analysis. 48(2). 431–443. 250 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026