%0 Journal Article %1 journals/iandc/DeligkasDEGS24 %A Deligkas, Argyrios %A Döring, Michelle %A Eiben, Eduard %A Goldsmith, Tiger-Lily %A Skretas, George %D 2024 %J Inf. Comput. %K dblp %P 105171 %T Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source. %U http://dblp.uni-trier.de/db/journals/iandc/iandc299.html#DeligkasDEGS24 %V 299

@article{journals/iandc/DeligkasDEGS24, added-at = {2024-10-06T00:00:00.000+0200}, author = {Deligkas, Argyrios and Döring, Michelle and Eiben, Eduard and Goldsmith, Tiger-Lily and Skretas, George}, biburl = {https://www.bibsonomy.org/bibtex/2159e29ecf451ebd2be80abcb89417bae/dblp}, ee = {https://doi.org/10.1016/j.ic.2024.105171}, interhash = {be131c3451d5c3fddf1480f75fbdec8d}, intrahash = {159e29ecf451ebd2be80abcb89417bae}, journal = {Inf. Comput.}, keywords = {dblp}, pages = 105171, timestamp = {2024-10-07T07:58:37.000+0200}, title = {Being an influencer is hard: The complexity of influence maximization in temporal graphs with a fixed source.}, url = {http://dblp.uni-trier.de/db/journals/iandc/iandc299.html#DeligkasDEGS24}, volume = 299, year = 2024 }