( en | de | ru )

 

Disambiguation of "Képes, Tamás"

Author of the publication

copydeleteadd this publication to your clipboard
Shapley Value and Extremal Optimization for the Network Influence Maximization Problem.

, , , and . SYNASC, page 182-189. IEEE, (2019)

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.

Christine Tamásy

Ónodi Tamás

Nándor Tamáskovics

Erika Tamási

Markus Tamás

 

Other publications of authors with the same name

A Simple Genetic Algorithm for the Critical Node Detection Problem., , , and . HAIS, volume 12886 of Lecture Notes in Computer Science, page 124-133. Springer, (2021)Identification of influential nodes with Shapley Influence Maximization Extremal Optimization algorithm., , , and . Appl. Soft Comput., (October 2023)An Extremal Optimization Approach to the Pairwise Connectivity Critical Node Detection Problem., , , and . SOCO, volume 531 of Lecture Notes in Networks and Systems, page 109-118. Springer, (2022)Critical Node Detection for Maximization of Connected Components: An Extremal Optimization Approach., , , and . SOCO, volume 1401 of Advances in Intelligent Systems and Computing, page 502-511. Springer, (2021)An Evolutionary Approach for Critical Node Detection in Hypergraphs. A Case Study of an Inflation Economic Network., , , and . ISDA, volume 418 of Lecture Notes in Networks and Systems, page 1110-1117. Springer, (2021)The Combined Critical Node and Edge Detection Problem. An Evolutionary Approach., , and . PPSN (1), volume 13398 of Lecture Notes in Computer Science, page 324-338. Springer, (2022)Influence Maximization and Extremal Optimization., , , and . HAIS, volume 11734 of Lecture Notes in Computer Science, page 416-427. Springer, (2019)Shapley Value and Extremal Optimization for the Network Influence Maximization Problem., , , and . SYNASC, page 182-189. IEEE, (2019)The critical node detection problem in hypergraphs using weighted node degree centrality.. PeerJ Comput. Sci., (2023)