default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Vinkó
Person information
- affiliation: University of Szeged, Department of Computational Optimization, Hungary
- affiliation: European Space Agency, Noordwijk, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Viktor Homolya, Tamás Vinkó
:
Closeness centrality reconstruction of tree graphs. Central Eur. J. Oper. Res. 32(4): 1061-1088 (2024)- [j21]Eszter Julianna Csókás, Tamás Vinkó:
Constraint generation approaches for submodular function maximization leveraging graph properties. J. Glob. Optim. 88(2): 377-394 (2024) - [j20]Sena Al-Hadhrami, Tamás Vinkó, Tawfik Al Hadhrami, Faisal Saeed, Sultan Noman Qasem:
Deep learning-based method for sentiment analysis for patients' drug reviews. PeerJ Comput. Sci. 10: e1976 (2024) - 2023
- [j19]Eszter Julianna Csókás, Tamás Vinkó:
An exact method for influence maximization based on deterministic linear threshold model. Central Eur. J. Oper. Res. 31(1): 269-286 (2023) - [i2]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Exact Methods for the Longest Induced Cycle Problem. CoRR abs/2311.15899 (2023) - 2022
- [j18]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Algorithmic upper bounds for graph geodetic number. Central Eur. J. Oper. Res. 30(4): 1221-1237 (2022) - 2021
- [j17]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Symbolic Regression for Approximating Graph Geodetic Number. Acta Cybern. 25(2): 151-169 (2021) - [j16]Gábor Korösi, Tamás Vinkó:
A practical framework for real life webshop sales promotion targeting. Informatica (Slovenia) 45(4) (2021) - 2020
- [j15]Orsolya Kardos, András London, Tamás Vinkó:
Stability of network centrality measures: a numerical study. Soc. Netw. Anal. Min. 10(1): 80 (2020) - [i1]Ahmad T. Anaqreh, Boglárka G.-Tóth, Tamás Vinkó:
Algorithmic upper bounds for graph geodetic number. CoRR abs/2011.10989 (2020)
2010 – 2019
- 2019
- [c13]Viktor Homolya, Tamás Vinkó:
Leveraging Local Optima Network Properties for Memetic Differential Evolution. WCGO 2019: 109-118 - 2017
- [j14]Tamás Vinkó, Kitti Gelle:
Basin Hopping Networks of continuous global optimization problems. Central Eur. J. Oper. Res. 25(4): 985-1006 (2017) - [j13]Elvira Antal, Tamás Vinkó:
Modeling max-min fair bandwidth allocation in BitTorrent communities. Comput. Optim. Appl. 66(2): 383-400 (2017) - 2016
- [j12]Tamás Vinkó:
Robustness of BitTorrent-like VoD Protocols. Acta Cybern. 22(3): 673-685 (2016) - [j11]Tamás Vinkó, Bea Botyánszki:
Empirical investigation of BitTorrent community graphs. Computing 98(6): 567-582 (2016) - 2015
- [j10]Tamás Vinkó, Helga Najzer:
On the sustainability of credit-based P2P communities. Central Eur. J. Oper. Res. 23(4): 953-967 (2015) - 2013
- [j9]Lucia D'Acunto, Nitin Chiluka, Tamás Vinkó, Henk J. Sips:
BitTorrent-like P2P approaches for VoD: A comparative study. Comput. Networks 57(5): 1253-1276 (2013) - [j8]Tamás Vinkó, Flavio Santos, Nazareno Andrade, Mihai Capota:
On swarm-level resource allocation in BitTorrent communities. Optim. Lett. 7(5): 923-932 (2013) - [j7]Adele Lu Jia, Rameez Rahman, Tamás Vinkó, Johan A. Pouwelse, Dick H. J. Epema:
Systemic Risk and User-Level Performance in Private P2P Communities. IEEE Trans. Parallel Distributed Syst. 24(12): 2503-2512 (2013) - [c12]Dimitra Gkorou, Tamás Vinkó, Johan A. Pouwelse, Dick H. J. Epema:
Leveraging node properties in random walks for robust reputations in decentralized networks. P2P 2013: 1-10 - 2012
- [c11]Dimitra Gkorou, Tamás Vinkó, Nitin Chiluka, Johan A. Pouwelse, Dick H. J. Epema:
Reducing the History in Decentralized Interaction-Based Reputation Systems. Networking (2) 2012: 238-251 - 2011
- [c10]Lucia D'Acunto, Tamás Vinkó, Henk J. Sips:
Bandwidth allocation in BitTorrent-like VoD systems under flashcrowds. Peer-to-Peer Computing 2011: 192-201 - [c9]Adele Lu Jia, Rameez Rahman, Tamás Vinkó, Johan A. Pouwelse, Dick H. J. Epema:
Fast download but eternal seeding: The reward and punishment of Sharing Ratio Enforcement. Peer-to-Peer Computing 2011: 280-289 - [c8]Mihai Capota, Nazareno Andrade, Tamás Vinkó, Flavio Roberto Santos, Johan A. Pouwelse, Dick H. J. Epema:
Inter-swarm resource allocation in BitTorrent communities. Peer-to-Peer Computing 2011: 300-309 - [c7]Kornel Csernai, Márk Jelasity, Johan A. Pouwelse, Tamás Vinkó:
Modeling Unconnectable Peers in Private BitTorrent Communities. PDP 2011: 582-589 - [c6]Rameez Rahman, Tamás Vinkó, David Hales, Johan A. Pouwelse, Henk J. Sips:
Design space analysis for modeling incentives in distributed systems. SIGCOMM 2011: 182-193 - 2010
- [c5]Rameez Rahman, David Hales, Tamás Vinkó, Johan A. Pouwelse, Henk J. Sips:
No more crash or crunch: Sustainable credit dynamics in a P2P community. HPCS 2010: 332-340 - [c4]Lucia D'Acunto, Tamás Vinkó, Johan A. Pouwelse:
Do BitTorrent-Like VoD Systems Scale under Flash-Crowds? Peer-to-Peer Computing 2010: 1-4
2000 – 2009
- 2008
- [j6]Chandra Sekhar Pedamallu, Linet Özdamar, Tibor Csendes, Tamás Vinkó:
Efficient interval partitioning for constrained global optimization. J. Glob. Optim. 42(3): 369-384 (2008) - [c3]Carlo Pinciroli, Mauro Birattari, Elio Tuci, Marco Dorigo, Marco del Rey Zapatero, Tamás Vinkó, Dario Izzo:
Self-Organizing and Scalable Shape Formation for a Swarm of Pico Satellites. AHS 2008: 57-61 - [c2]Carlo Pinciroli, Mauro Birattari, Elio Tuci, Marco Dorigo, Marco del Rey Zapatero, Tamás Vinkó, Dario Izzo:
Lattice Formation in Space for a Swarm of Pico Satellites. ANTS Conference 2008: 347-354 - 2007
- [j5]Tamás Vinkó, Arnold Neumaier:
New bounds for Morse clusters. J. Glob. Optim. 39(4): 483-494 (2007) - 2005
- [j4]Tamás Vinkó:
Minimal inter-particle distance in atom clusters. Acta Cybern. 17(1): 107-121 (2005) - [j3]Arnold Neumaier, Oleg Shcherbina, Waltraud Huyer, Tamás Vinkó:
A comparison of complete global optimization solvers. Math. Program. 103(2): 335-356 (2005) - 2004
- [j2]Tamás Vinkó, Jean-Louis Lagouanelle, Tibor Csendes:
A New Inclusion Function for Optimization: Kite - The One Dimensional Case. J. Glob. Optim. 30(4): 435-456 (2004) - [j1]Tamás Vinkó, Dietmar Ratz:
A Multidimensional Branch-and-Prune Method for Interval Global Optimization. Numer. Algorithms 37(1-4): 391-399 (2004)
1990 – 1999
- 1999
- [c1]Márk Jelasity, Boglárka G.-Tóth, Tamás Vinkó:
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions. CEC 1999: 623-630
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-10-07 22:19 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:
