default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladimir Boginski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j38]Cheng-Lung Chen
, Eduardo L. Pasiliao, Vladimir Boginski:
A polyhedral approach to least cost influence maximization in social networks. J. Comb. Optim. 45(1): 44 (2023)- 2022
- [j37]Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao, Oleg A. Prokopyev:
On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs. Eur. J. Oper. Res. 297(1): 86-101 (2022) - [j36]Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, Vladimir Boginski:
Continuous cubic formulations for cluster detection problems in networks. Math. Program. 196(1): 279-307 (2022) - 2021
- [j35]Cheng-Lung Chen, Qipeng P. Zheng, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski:
Failure Mitigation and Restoration in Interdependent Networks via Mixed-Integer Optimization. IEEE Trans. Netw. Sci. Eng. 8(2): 1293-1304 (2021) - 2020
- [j34]Jongeun Kim, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev:
On the maximum small-world subgraph problem. Eur. J. Oper. Res. 280(3): 818-831 (2020) - [c10]Henri T. Heinonen, Alexander Semenov, Vladimir Boginski:
Collective Behavior of Price Changes of ERC-20 Tokens. CSoNet 2020: 487-498 - [c9]Cheng-Lung Chen, Eduardo L. Pasiliao, Vladimir Boginski:
A Cutting Plane Method for Least Cost Influence Maximization. CSoNet 2020: 499-511 - [c8]Alexander Semenov, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski:
Double-Threshold Models for Network Influence Propagation. CSoNet 2020: 512-523
2010 – 2019
- 2019
- [j33]Alexander Semenov, Alexander V. Mantzaris, Alexander G. Nikolaev, Alexander Veremyev, Jari Veijalainen, Eduardo L. Pasiliao, Vladimir Boginski:
Exploring Social Media Network Landscape of Post-Soviet Space. IEEE Access 7: 411-426 (2019) - [j32]Alexander Veremyev, Alexander Semenov, Eduardo L. Pasiliao, Vladimir Boginski:
Graph-based exploration and clustering analysis of semantic spaces. Appl. Netw. Sci. 4(1): 104:1-104:26 (2019) - [j31]Alexander Veremyev, Konstantin Pavlikov, Eduardo L. Pasiliao, My T. Thai, Vladimir Boginski:
Critical nodes in interdependent networks with deterministic and probabilistic cascading failures. J. Glob. Optim. 74(4): 803-838 (2019) - [j30]Zhouchun Huang, Qipeng Phil Zheng, Eduardo Pasiliao, Vladimir Boginski, Tao Zhang:
A cutting plane method for risk-constrained traveling salesman problem with random arc costs. J. Glob. Optim. 74(4): 839-859 (2019) - [c7]Alexander Semenov, Vladimir Boginski, Eduardo L. Pasiliao:
Neural Networks with Multidimensional Cross-Entropy Loss Functions. CSoNet 2019: 57-62 - [c6]Mengnan Chen, Qipeng P. Zheng, Vladimir Boginski, Eduardo L. Pasiliao:
Reinforcement Learning in Information Cascades Based on Dynamic User Behavior. CSoNet 2019: 148-154 - [c5]Guanxiang Yun, Qipeng P. Zheng, Vladimir Boginski, Eduardo L. Pasiliao:
Information Network Cascading and Network Re-construction with Bounded Rational User Behaviors. CSoNet 2019: 351-362 - 2018
- [j29]Oleksandra Yezerska, Sergiy Butenko, Vladimir Boginski:
Detecting robust cliques in graphs subject to uncertain edge failures. Ann. Oper. Res. 262(1): 109-132 (2018) - [j28]Wondi Geremew, Nguyen Mau Nam, Alexander Semenov, Vladimir Boginski, Eduardo L. Pasiliao:
A DC programming approach for solving multicast network design problems via the Nesterov smoothing technique. J. Glob. Optim. 72(4): 705-729 (2018) - [j27]Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Oleg A. Prokopyev:
On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches. Networks 71(2): 136-152 (2018) - [c4]Alexander Semenov, Alexander Veremyev, Alexander G. Nikolaev, Eduardo L. Pasiliao, Vladimir Boginski:
Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network. CSoNet 2018: 437-449 - 2017
- [j26]Vladimir Stozhkov, Vladimir Boginski, Oleg A. Prokopyev, Eduardo L. Pasiliao:
A simple greedy heuristic for linear assignment interdiction. Ann. Oper. Res. 249(1-2): 39-53 (2017) - [j25]Vladimir Stozhkov, Grigory Pastukhov, Vladimir Boginski, Eduardo L. Pasiliao:
New analytical lower bounds on the clique number of a graph. Optim. Methods Softw. 32(2): 336-368 (2017) - 2016
- [j24]Juan Ma, Foad Mahdavi Pajouh, Balabhaskar Balasundaram, Vladimir Boginski:
The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures. INFORMS J. Comput. 28(2): 295-307 (2016) - [c3]Alexander Semenov, Alexander G. Nikolaev, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Analysis of Viral Advertisement Re-Posting Activity in Social Media. CSoNet 2016: 123-134 - 2015
- [j23]Foad Mahdavi Pajouh, Jose L. Walteros, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum edge blocker dominating set problem. Eur. J. Oper. Res. 247(1): 16-26 (2015) - [j22]Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Analytical characterizations of some classes of optimal strongly attack-tolerant networks and their Laplacian spectra. J. Glob. Optim. 61(1): 109-138 (2015) - [j21]Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Potential energy principles in networked systems and their connections to optimization problems on graphs. Optim. Lett. 9(3): 585-600 (2015) - [j20]Vladimir Boginski, Eduardo L. Pasiliao, Siqian Shen:
Special issue on optimization in military applications. Optim. Lett. 9(8): 1475-1476 (2015) - 2014
- [j19]Vladimir Boginski, Sergiy Butenko, Oleg Shirokikh, Svyatoslav Trukhanov, Jaime Gil-Lafuente:
A network-based data mining approach to portfolio selection via weighted clique relaxations. Ann. Oper. Res. 216(1): 23-34 (2014) - [j18]Alexander Veremyev, Alexey Sorokin, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum vertex cover problem for coupled interdependent networks with cascading failures. Eur. J. Oper. Res. 232(3): 499-511 (2014) - [j17]Austin Buchanan, Je Sang Sung, Vladimir Boginski, Sergiy Butenko:
On connected dominating sets of restricted diameter. Eur. J. Oper. Res. 236(2): 410-418 (2014) - [j16]Alexander Veremyev, Oleg A. Prokopyev, Vladimir Boginski, Eduardo L. Pasiliao:
Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Oper. Res. 239(2): 349-362 (2014) - [j15]Grigory Pastukhov, Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks. J. Comb. Optim. 27(3): 462-486 (2014) - [j14]Foad Mahdavi Pajouh, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum vertex blocker clique problem. Networks 64(1): 48-64 (2014) - [j13]Alla R. Kammerdiner, Alex Sprintson, Eduardo L. Pasiliao, Vladimir Boginski:
Optimization of discrete broadcast under uncertainty using conditional value-at-risk. Optim. Lett. 8(1): 45-59 (2014) - [j12]Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao:
Exact identification of critical nodes in sparse networks via new compact formulations. Optim. Lett. 8(4): 1245-1259 (2014) - [p1]Foad Mahdavi Pajouh, Alexander Veremyev, Vladimir Boginski:
Analysis and Design of Robust Network Clusters with Bounded Diameter. Examining Robustness and Vulnerability of Networked Systems 2014: 141-160 - 2013
- [j11]Oleg Shirokikh, Grigory Pastukhov, Vladimir Boginski, Sergiy Butenko:
Computational study of the US stock market evolution: a rank correlation-based network model. Comput. Manag. Sci. 10(2-3): 81-103 (2013) - [j10]Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski:
On the maximum quasi-clique problem. Discret. Appl. Math. 161(1-2): 244-257 (2013) - [j9]Alexey Sorokin, Vladimir Boginski, Artyom G. Nahapetyan, Panos M. Pardalos:
Computational risk management techniques for fixed charge network flow problems with uncertain arc failures. J. Comb. Optim. 25(1): 99-122 (2013) - [j8]Marco Carvalho, Alexey Sorokin, Vladimir Boginski, Balabhaskar Balasundaram:
Topology design for on-demand dual-path routing in wireless networks. Optim. Lett. 7(4): 695-707 (2013) - 2012
- [j7]Alexander Veremyev, Vladimir Boginski:
Identifying large robust network clusters via new compact formulations of maximum k-club problems. Eur. J. Oper. Res. 218(2): 316-326 (2012) - 2011
- [j6]Nikita Boyko, Timofey Turko, Vladimir Boginski, David E. Jeffcoat, Stanislav Uryasev, Grigoriy Zrazhevsky, Panos M. Pardalos:
Robust multi-sensor scheduling for multi-site surveillance. J. Comb. Optim. 22(1): 35-51 (2011)
2000 – 2009
- 2009
- [j5]Alexey Sorokin, Nikita Boyko, Vladimir Boginski, Stan Uryasev, Panos M. Pardalos:
Mathematical Programming Techniques for Sensor Networks. Algorithms 2(1): 565-581 (2009) - [j4]Vladimir Boginski, Clayton W. Commander, Timofey Turko:
Polynomial-time identification of robust network flows under uncertain arc failures. Optim. Lett. 3(3): 461-473 (2009) - [c2]Ashwin Arulselvan, Pilar Mendoza, Vladimir Boginski, Panos M. Pardalos:
Predicting the Nexus between Post-Secondary Education Affordability and Student Success: An Application of Network-Based Approaches. ASONAM 2009: 149-154 - [c1]Petros Xanthopoulos, Ashwin Arulselvan, Vladimir Boginski, Panos M. Pardalos:
A Retrospective Review of Social Networks. ASONAM 2009: 300-305 - 2006
- [j3]Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Mining market data: A network approach. Comput. Oper. Res. 33(11): 3171-3184 (2006) - 2005
- [j2]Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Statistical analysis of financial networks. Comput. Stat. Data Anal. 48(2): 431-443 (2005) - 2004
- [j1]Vladimir Boginski, Sergiy Butenko, Panos M. Pardalos:
Network models of massive datasets. Comput. Sci. Inf. Syst. 1(1): 75-89 (2004)
Coauthor Index
aka: Eduardo Pasiliao
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-08-05 21:23 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:
