András Pluhár

According to our database, András Pluhár authored at least 32 papers between 1993 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Intersection of random spanning trees in complex networks.

András London, András Pluhár

Appl. Netw. Sci., December, 2023

2022

Graph clustering via generalized colorings.

András London, Ryan R. Martin, András Pluhár

Theor. Comput. Sci., 2022

Intersection of Random Spanning Trees in Small-World Networks.

András London, András Pluhár

Proceedings of the Complex Networks and Their Applications XI, 2022

2021

A discrepancy version of the Hajnal-Szemerédi theorem.

József Balogh, Béla Csaba, András Pluhár, Andrew Treglown

Comb. Probab. Comput., 2021

2020

On the Discrepancies of Graphs.

József Balogh, Béla Csaba, Yifan Jing, András Pluhár

Electron. J. Comb., 2020

2019

The pairing strategies of the 9-in-a-row game.

Lajos Gyõrffy, Géza Makay, András Pluhár

Ars Math. Contemp., 2019

Linear Time Ordering of Bins using a Conveyor System.

Géza Makay, András Pluhár

Acta Cybern., 2019

2018

Economic Network Analysis Based on Infection Models.

Miklós Krész, András Pluhár

Proceedings of the Encyclopedia of Social Network Analysis and Mining, 2nd Edition, 2018

Spanning Tree Game as Prim Would Have Played.

András London, András Pluhár

Acta Cybern., 2018

2016

On the path separation number of graphs.

József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár

Discret. Appl. Math., 2016

2015

Applications of the inverse infection problem on bank transaction networks.

András Bóta, András Csernenszky, Lajos Gyõrffy, Gyula Kovács, Miklós Krész, András Pluhár

Central Eur. J. Oper. Res., 2015

2014

The inverse infection problem.

András Bóta, Miklós Krész, András Pluhár

Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2013

Approximations of the Generalized Cascade Model.

András Bóta, Miklós Krész, András Pluhár

Acta Cybern., 2013

2012

The Positive Minimum Degree Game on Sparse Graphs.

József Balogh, András Pluhár

Electron. J. Comb., 2012

2011

On the Complexity of Chooser-Picker Positional Games.

András Csernenszky, Ryan R. Martin, András Pluhár

Integers, 2011

Community Detection by using the Extended Modularity.

Erika Griechisch, András Pluhár

Acta Cybern., 2011

Dynamic Communities and their Detection.

András Bóta, Miklós Krész, András Pluhár

Acta Cybern., 2011

2009

Greedy colorings of uniform hypergraphs.

András Pluhár

Random Struct. Algorithms, 2009

The diameter game.

József Balogh, Ryan R. Martin, András Pluhár

Random Struct. Algorithms, 2009

On Chooser-Picker positional games.

András Csernenszky, C. Ivett Mándity, András Pluhár

Discret. Math., 2009

2008

A randomized algorithm for the on-line weighted bipartite matching problem.

Béla Csaba, András Pluhár

J. Sched., 2008

2006

On the edge-bandwidth of graph products.

József Balogh, Dhruv Mubayi, András Pluhár

Theor. Comput. Sci., 2006

2005

Covering planar graphs with forests.

József Balogh, Martin Kochol, András Pluhár, Xingxing Yu

J. Comb. Theory B, 2005

2004

On the interval number of special graphs.

József Balogh, Pascal Ochem, András Pluhár

J. Graph Theory, 2004

The Recycled Kaplansky's Game.

András Pluhár

Acta Cybern., 2004

2002

The accelerated k-in-a-row game.

András Pluhár

Theor. Comput. Sci., 2002

The interval number of dense graphs.

József Balogh, András Pluhár

Discret. Math., 2002

1999

A sharp edge bound on the interval number of a graph.

József Balogh, András Pluhár

J. Graph Theory, 1999

1998

On the Existence of Finite Isomorphically Complete Systems of Automata.

Ferenc Gécseg, Balázs Imreh, András Pluhár

J. Autom. Lang. Comb., 1998

1997

Generalized Harary Games.

András Pluhár

Acta Cybern., 1997

1995

Remarks on the Interval Number of Graphs.

András Pluhár

Acta Cybern., 1995

1993

Graphs with no induced C₄ and 2K₂.

Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza

Discret. Math., 1993