András Pluhár

Publication Activity (10 Years)

Years Active: 1993-2023
Publications (10 Years): 9

Top Topics

Complex Networks

Minimum Spanning Trees

Top Venues

Comb. Probab. Comput.

COMPLEX NETWORKS (2)

Electron. J. Comb.

Publications

András London, András Pluhár
Intersection of random spanning trees in complex networks. Appl. Netw. Sci. 8 (1) (2023)
András London, András Pluhár
Intersection of Random Spanning Trees in Small-World Networks. COMPLEX NETWORKS (2) (2022)
András London, Ryan R. Martin, András Pluhár
Graph clustering via generalized colorings. Theor. Comput. Sci. 918 (2022)
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) (2021)
József Balogh, Béla Csaba, Yifan Jing, András Pluhár
On the Discrepancies of Graphs. Electron. J. Comb. 27 (2) (2020)
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) (2019)
Géza Makay, András Pluhár
Linear Time Ordering of Bins using a Conveyor System. Acta Cybern. 24 (2) (2019)
András London, András Pluhár
Spanning Tree Game as Prim Would Have Played. Acta Cybern. 23 (3) (2018)
József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár
On the path separation number of graphs. Discret. Appl. Math. 213 (2016)
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) (2015)
András Bóta, Miklós Krész, András Pluhár
The inverse infection problem. FedCSIS (2014)
András Bóta, Miklós Krész, András Pluhár
Approximations of the Generalized Cascade Model. Acta Cybern. 21 (1) (2013)
József Balogh, András Pluhár
The Positive Minimum Degree Game on Sparse Graphs. Electron. J. Comb. 19 (1) (2012)
András Csernenszky, Ryan R. Martin, András Pluhár
On the Complexity of Chooser-Picker Positional Games. Integers 11 (2011)
Erika Griechisch, András Pluhár
Community Detection by using the Extended Modularity. Acta Cybern. 20 (1) (2011)
András Bóta, Miklós Krész, András Pluhár
Dynamic Communities and their Detection. Acta Cybern. 20 (1) (2011)
József Balogh, Ryan R. Martin, András Pluhár
The diameter game. Random Struct. Algorithms 35 (3) (2009)
András Pluhár
Greedy colorings of uniform hypergraphs. Random Struct. Algorithms 35 (2) (2009)
András Csernenszky, C. Ivett Mándity, András Pluhár
On Chooser-Picker positional games. Discret. Math. 309 (16) (2009)
Béla Csaba, András Pluhár
A randomized algorithm for the on-line weighted bipartite matching problem. J. Sched. 11 (6) (2008)
Béla Csaba, András Pluhár
A randomized algorithm for the on-line weighted bipartite matching problem CoRR (2007)
József Balogh, Dhruv Mubayi, András Pluhár
On the edge-bandwidth of graph products. Theor. Comput. Sci. 359 (1-3) (2006)
József Balogh, Martin Kochol, András Pluhár, Xingxing Yu
Covering planar graphs with forests. J. Comb. Theory, Ser. B 94 (1) (2005)
József Balogh, Pascal Ochem, András Pluhár
On the interval number of special graphs. J. Graph Theory 46 (4) (2004)
András Pluhár
The Recycled Kaplansky's Game. Acta Cybern. 16 (3) (2004)
József Balogh, András Pluhár
The interval number of dense graphs. Discret. Math. 256 (1-2) (2002)
András Pluhár
The accelerated k-in-a-row game. Theor. Comput. Sci. 270 (1-2) (2002)
József Balogh, András Pluhár
A sharp edge bound on the interval number of a graph. J. Graph Theory 32 (2) (1999)
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) (1998)
András Pluhár
Generalized Harary Games. Acta Cybern. 13 (1) (1997)
András Pluhár
Remarks on the Interval Number of Graphs. Acta Cybern. 12 (2) (1995)
Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza
. Discret. Math. 115 (1-3) (1993)