default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrás Pluhár
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j29]András London, András Pluhár:
Intersection of random spanning trees in complex networks. Appl. Netw. Sci. 8(1): 72 (2023)- 2022
- [j28]András London
, Ryan R. Martin, András Pluhár:
Graph clustering via generalized colorings. Theor. Comput. Sci. 918: 94-104 (2022) - 2021
- [j27]József Balogh, Béla Csaba, András Pluhár, Andrew Treglown:
A discrepancy version of the Hajnal-Szemerédi theorem. Comb. Probab. Comput. 30(3): 444-459 (2021) - 2020
- [j26]József Balogh, Béla Csaba, Yifan Jing, András Pluhár:
On the Discrepancies of Graphs. Electron. J. Comb. 27(2): 2 (2020) - 2019
- [j25]Géza Makay, András Pluhár:
Linear Time Ordering of Bins using a Conveyor System. Acta Cybern. 24(2): 187-195 (2019) - [j24]Lajos Gyõrffy, Géza Makay, András Pluhár:
The pairing strategies of the 9-in-a-row game. Ars Math. Contemp. 16(1): 97-109 (2019) - 2018
- [j23]András London, András Pluhár:
Spanning Tree Game as Prim Would Have Played. Acta Cybern. 23(3): 921-927 (2018) - 2016
- [j22]József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár:
On the path separation number of graphs. Discret. Appl. Math. 213: 26-33 (2016) - 2015
- [j21]András Bóta, András Csernenszky, Lajos Gyõrffy, Gyula Kovács, Miklós Krész, András Pluhár:
Applications of the inverse infection problem on bank transaction networks. Central Eur. J. Oper. Res. 23(2): 345-356 (2015) - 2013
- [j20]András Bóta, Miklós Krész, András Pluhár:
Approximations of the Generalized Cascade Model. Acta Cybern. 21(1): 37-51 (2013) - 2012
- [j19]József Balogh, András Pluhár:
The Positive Minimum Degree Game on Sparse Graphs. Electron. J. Comb. 19(1): 22 (2012) - 2011
- [j18]András Bóta, Miklós Krész, András Pluhár:
Dynamic Communities and their Detection. Acta Cybern. 20(1): 35-52 (2011) - [j17]Erika Griechisch, András Pluhár:
Community Detection by using the Extended Modularity. Acta Cybern. 20(1): 69-85 (2011) - [j16]András Csernenszky, Ryan R. Martin, András Pluhár:
On the Complexity of Chooser-Picker Positional Games. Integers 11: G2 (2011) - 2009
- [j15]András Csernenszky, C. Ivett Mándity, András Pluhár:
On Chooser-Picker positional games. Discret. Math. 309(16): 5141-5146 (2009) - [j14]András Pluhár:
Greedy colorings of uniform hypergraphs. Random Struct. Algorithms 35(2): 216-221 (2009) - [j13]József Balogh, Ryan R. Martin, András Pluhár:
The diameter game. Random Struct. Algorithms 35(3): 369-389 (2009) - 2008
- [j12]Béla Csaba, András Pluhár:
A randomized algorithm for the on-line weighted bipartite matching problem. J. Sched. 11(6): 449-455 (2008) - 2006
- [j11]József Balogh, Dhruv Mubayi, András Pluhár:
On the edge-bandwidth of graph products. Theor. Comput. Sci. 359(1-3): 43-57 (2006) - 2005
- [j10]József Balogh, Martin Kochol, András Pluhár, Xingxing Yu:
Covering planar graphs with forests. J. Comb. Theory B 94(1): 147-158 (2005) - 2004
- [j9]András Pluhár:
The Recycled Kaplansky's Game. Acta Cybern. 16(3): 451-458 (2004) - [j8]József Balogh, Pascal Ochem, András Pluhár:
On the interval number of special graphs. J. Graph Theory 46(4): 241-253 (2004) - 2002
- [j7]József Balogh, András Pluhár:
The interval number of dense graphs. Discret. Math. 256(1-2): 423-429 (2002) - [j6]András Pluhár:
The accelerated k-in-a-row game. Theor. Comput. Sci. 270(1-2): 865-875 (2002) - 1999
- [j5]József Balogh, András Pluhár:
A sharp edge bound on the interval number of a graph. J. Graph Theory 32(2): 153-159 (1999) - 1998
- [j4]Ferenc Gécseg, Balázs Imreh, András Pluhár:
On the Existence of Finite Isomorphically Complete Systems of Automata. J. Autom. Lang. Comb. 3(2): 77-84 (1998) - 1997
- [j3]András Pluhár:
Generalized Harary Games. Acta Cybern. 13(1): 77-83 (1997) - 1995
- [j2]András Pluhár:
Remarks on the Interval Number of Graphs. Acta Cybern. 12(2): 125-129 (1995) - 1993
- [j1]Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza:
Graphs with no induced C4 and 2K2. Discret. Math. 115(1-3): 51-55 (1993)
Conference and Workshop Papers
- 2022
- [c2]András London, András Pluhár:
Intersection of Random Spanning Trees in Small-World Networks. COMPLEX NETWORKS (2) 2022: 337-345 - 2014
- [c1]András Bóta, Miklós Krész, András Pluhár:
The inverse infection problem. FedCSIS 2014: 75-83
Reference Works
- 2018
- [r1]Miklós Krész, András Pluhár:
Economic Network Analysis Based on Infection Models. Encyclopedia of Social Network Analysis and Mining. 2nd Ed. 2018
Informal and Other Publications
- 2007
- [i1]Béla Csaba, András Pluhár:
A randomized algorithm for the on-line weighted bipartite matching problem. CoRR abs/0705.4673 (2007)
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:20 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:
