( en | de | ru )

 

Disambiguation of "Veremyev, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network.

, , , , and . CSoNet, volume 11280 of Lecture Notes in Computer Science, page 437-449. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)
 

Other publications of authors with the same name

On maximum degree-based \(\gamma\)-quasi-clique problem: Complexity and exact approaches, , , and . Networks, 71 (2): 136--152 (2018)Dense Percolation in Large-Scale Mean-Field Random Networks Is Provably "Explosive", , , and . PLoS ONE, 7 (12): e51883+ (Dec 18, 2012)Minimum vertex cover problem for coupled interdependent networks with cascading failures., , , and . Eur. J. Oper. Res., 232 (3): 499-511 (2014)On maximum degree-based γ-quasi-clique problem: Complexity and exact approaches., , , and . Networks, 71 (2): 136-152 (2018)Ranking Academic Advisors: Analyzing Scientific Advising Impact Using MathGenealogy Social Network., , , , and . CSoNet, volume 11280 of Lecture Notes in Computer Science, page 437-449. Springer, (2018)On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs., , , and . Eur. J. Oper. Res., 297 (1): 86-101 (2022)Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees., and . Discret. Appl. Math., (2021)On Laplacian spectra of parametric families of closely connected networks with application to cooperative control., , and . J. Glob. Optim., 67 (1-2): 187-205 (2017)Robustness of solutions to critical node detection problems with imperfect data: a computational study., , , and . Optim. Methods Softw., 32 (2): 250-273 (2017)An integer programming approach for finding the most and the least central cliques., , , and . Optim. Lett., 9 (4): 615-633 (2015)