default search action
Alexander Veremyev
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j35]Tomás Lagos
, Oleg A. Prokopyev
Finding groups with maximum betweenness centrality via integer programming with random path sampling. J. Glob. Optim. 88(1): 199-232 (2024) - 2023
- [j34]Dmytro Matsypura
Finding the most degree-central walks and paths in a graph: Exact and heuristic approaches. Eur. J. Oper. Res. 308(3): 1021-1036 (2023) - 2022
- [j33]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) - 2021
- [j32]Mikhail V. Goubko
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. Discret. Appl. Math. 305: 1-9 (2021) - [j31]Colin P. Gillen, Alexander Veremyev, Oleg A. Prokopyev
Fortification Against Cascade Propagation Under Uncertainty. INFORMS J. Comput. 33(4): 1481-1499 (2021) - [j30]Cheng-Lung Chen
Failure Mitigation and Restoration in Interdependent Networks via Mixed-Integer Optimization. IEEE Trans. Netw. Sci. Eng. 8(2): 1293-1304 (2021) - [i3]Alexander Veremyev, Mikhail V. Goubko:
Mixed-Integer Approaches to Constrained Optimum Communication Spanning Tree Problem. CoRR abs/2101.03872 (2021) - 2020
- [j29]Jongeun Kim
On the maximum small-world subgraph problem. Eur. J. Oper. Res. 280(3): 818-831 (2020) - [c5]Alexander Semenov, Alexander Veremyev, Eduardo L. Pasiliao, Vladimir Boginski:
Double-Threshold Models for Network Influence Propagation. CSoNet 2020: 512-523 - [i2]Mikhail V. Goubko, Alexander Veremyev:
Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees. CoRR abs/2008.06068 (2020)
2010 – 2019
- 2019
- [j28]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) - [j27]Oleksandra Yezerska, Foad Mahdavi Pajouh, Alexander Veremyev, Sergiy Butenko:
Exact algorithms for the minimum s-club partitioning problem. Ann. Oper. Res. 276(1-2): 267-291 (2019) - [j26]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) - [j25]Paul Balister
Dense subgraphs in random graphs. Discret. Appl. Math. 260: 66-74 (2019) - [j24]Dmytro Matsypura
On exact solution approaches for the longest induced path problem. Eur. J. Oper. Res. 278(2): 546-562 (2019) - [j23]Alexander Veremyev, Oleg A. Prokopyev
Finding Critical Links for Closeness Centrality. INFORMS J. Comput. 31(2): 367-389 (2019) - [j22]Alexander Veremyev, Konstantin Pavlikov
Critical nodes in interdependent networks with deterministic and probabilistic cascading failures. J. Glob. Optim. 74(4): 803-838 (2019) - [j21]Jose L. Walteros
Detecting critical node structures on graphs: A mathematical programming approach. Networks 73(1): 48-88 (2019) - [c4]Gabriel L. Zenarosa
Cascade of Edge Activation in Networks. CSoNet 2019: 141-147 - 2018
- [j20]Konstantin Pavlikov
Optimization of Value-at-Risk: computational aspects of MIP formulations. J. Oper. Res. Soc. 69(5): 676-690 (2018) - [j19]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) - [j18]Colin P. Gillen
Critical arcs detection in influence networks. Networks 71(4): 412-431 (2018) - [c3]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
- [j17]Alla R. Kammerdiner, Alexander Veremyev, Eduardo L. Pasiliao:
On Laplacian spectra of parametric families of closely connected networks with application to cooperative control. J. Glob. Optim. 67(1-2): 187-205 (2017) - [j16]Colin P. Gillen
Robustness of solutions to critical node detection problems with imperfect data: a computational study. Optim. Methods Softw. 32(2): 250-273 (2017) - [j15]Alexander Veremyev, Oleg A. Prokopyev
Finding groups with maximum betweenness centrality. Optim. Methods Softw. 32(2): 369-399 (2017) - [c2]Getachew K. Befekadu
Dynamic risk measures and related risk-averse decision problems. ACC 2017: 3494-3499 - [i1]Tathagata Mukherjee, Alexander Veremyev, Piyush Kumar, Eduardo L. Pasiliao Jr.:
The Minimum Edge Compact Spanner Network Design Problem. CoRR abs/1712.04010 (2017) - 2016
- [j14]Alexander Veremyev, Oleg A. Prokopyev
Exact MIP-based approaches for finding maximum quasi-cliques and dense subgraphs. Comput. Optim. Appl. 64(1): 177-214 (2016) - [j13]Zeynep Ertem, Alexander Veremyev, Sergiy Butenko:
Detecting large cohesive subgroups with high clustering coefficients in social networks. Soc. Networks 46: 1-10 (2016) - [c1]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
- [j12]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) - [j11]Alexander Veremyev, Oleg A. Prokopyev
Critical nodes for distance-based connectivity and related problems in graphs. Networks 66(3): 170-195 (2015) - [j10]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) - [j9]Chrysafis Vogiatzis
An integer programming approach for finding the most and the least central cliques. Optim. Lett. 9(4): 615-633 (2015) - 2014
- [j8]Alexander Veremyev, Peter Tsyurmasto, Stan Uryasev
Calibrating probability distributions with convex-concave-convex functions: application to CDO pricing. Comput. Manag. Sci. 11(4): 341-364 (2014) - [j7]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) - [j6]Alexander Veremyev, Oleg A. Prokopyev
Finding maximum subgraphs with relatively large vertex connectivity. Eur. J. Oper. Res. 239(2): 349-362 (2014) - [j5]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) - [j4]Alexander Veremyev, Oleg A. Prokopyev
An integer programming framework for critical elements detection in graphs. J. Comb. Optim. 28(1): 233-273 (2014) - [j3]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
- [j2]Jeffrey Pattillo, Alexander Veremyev, Sergiy Butenko, Vladimir Boginski:
On the maximum quasi-clique problem. Discret. Appl. Math. 161(1-2): 244-257 (2013) - 2012
- [j1]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)
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-06-17 00:41 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: