András Pluhár

Proceedings of the 19th Conference on Computer Science and Intelligence Systems, 2024

2023

Intersection of random spanning trees in complex networks.

[BibT_eX]

[DOI]

Appl. Netw. Sci., December, 2023

2022

Graph clustering via generalized colorings.

[BibT_eX]

[DOI]

Ryan R. Martin

Theor. Comput. Sci., 2022

Intersection of Random Spanning Trees in Small-World Networks.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks and Their Applications XI, 2022

2021

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

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2021

2020

On the Discrepancies of Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

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

[BibT_eX]

[DOI]

Lajos Gyõrffy

Géza Makay

Ars Math. Contemp., 2019

Linear Time Ordering of Bins using a Conveyor System.

[BibT_eX]

[DOI]

Géza Makay

Acta Cybern., 2019

2018

Economic Network Analysis Based on Infection Models.

[BibT_eX]

[DOI]

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

Spanning Tree Game as Prim Would Have Played.

[BibT_eX]

[DOI]

Acta Cybern., 2018

2016

On the path separation number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

2015

Applications of the inverse infection problem on bank transaction networks.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2015

2014

The inverse infection problem.

[BibT_eX]

[DOI]

András Bóta

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

2013

Approximations of the Generalized Cascade Model.

[BibT_eX]

[DOI]

András Bóta

Acta Cybern., 2013

2012

The Positive Minimum Degree Game on Sparse Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2012

2011

On the Complexity of Chooser-Picker Positional Games.

[BibT_eX]

[DOI]

András Csernenszky

Ryan R. Martin

Integers, 2011

Community Detection by using the Extended Modularity.

[BibT_eX]

[DOI]

Erika Griechisch

Acta Cybern., 2011

Dynamic Communities and their Detection.

[BibT_eX]

[DOI]

András Bóta

Acta Cybern., 2011

2009

Greedy colorings of uniform hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2009

The diameter game.

[BibT_eX]

[DOI]

Ryan R. Martin

Random Struct. Algorithms, 2009

On Chooser-Picker positional games.

[BibT_eX]

[DOI]

András Csernenszky

C. Ivett Mándity

Discret. Math., 2009

2008

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

[BibT_eX]

[DOI]

Béla Csaba

J. Sched., 2008

2006

On the edge-bandwidth of graph products.

[BibT_eX]

[DOI]

Dhruv Mubayi

Theor. Comput. Sci., 2006

2005

Covering planar graphs with forests.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2005

2004

On the interval number of special graphs.

[BibT_eX]

[DOI]

Pascal Ochem

J. Graph Theory, 2004

The Recycled Kaplansky's Game.

[BibT_eX]

[DOI]

Acta Cybern., 2004

2002

The accelerated k-in-a-row game.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

The interval number of dense graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

1999

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

[BibT_eX]

[DOI]

J. Graph Theory, 1999

1998

On the Existence of Finite Isomorphically Complete Systems of Automata.

[BibT_eX]

[DOI]

Ferenc Gécseg

Balázs Imreh

J. Autom. Lang. Comb., 1998

1997

Generalized Harary Games.

[BibT_eX]

[DOI]

Acta Cybern., 1997

1995

Remarks on the Interval Number of Graphs.

[BibT_eX]

[DOI]