List of Publications of András Pluhár
Appeared
1. Z. Blázsik, M. Hujter, A. Pluhár and
Z. Tuza,
Graphs with no induced $C_4$ and $2K_2$. Discrete Math ,
115 (1993) 51--55.
2. A. Pluhár, Remarks on the Interval Number of
Graphs.
Acta Cybernetica 12 (1995) 125--129.
for ps file
3. A. Pluhár, Generalized Harary Games.
Acta Cybernetica 13 (1997) 77--83.
for ps file
4. F. Gécseg, B. Imreh and A. Pluhár, On the
existence of Finite Isomorphically Complete Systems of Automata.
J. of Automata, Languages and Combinatorics 3 (1998) 2,
77--84. for ps file
5. J. Balogh and A. Pluhár, A Sharp Edge Bound on
the
Interval Number of a Graph. J. of Graph Theory 32
(1999), 153--159. for ps file
6. A. Pluhár, The accelerated k-in-a-row game.
Theoretical Comp. Sci. 271 (1-2) (2002) 865--875.
for ps file
7. J. Balogh and A. Pluhár, The Interval Number
of Dense Graphs. Discrete Math. 256 (2002) 423--429.
for ps file
8. J. Balogh, P. Ochem and A. Pluhár,
On the Interval Number of Special Graphs. J. of Graph
Theory 46 (2004) 241--253.
for ps file
9. A. Pluhár,
The Recycled Kaplansky's Game. Acta Cybernetica
16 (2004) 451--458.
for ps file
10. J. Balogh, M. Kochol, A.
Pluhár
and X. Yu,
Covering planar graphs with trees.
J. of Combinatorial Theory B 94 ,
(2005) 147--158.
for ps file
11. J. Balogh, D. Mubayi and A. Pluhár,
On the edge-bandwidth of graph products.
Theoretical Comp. Sci. 359 (2006) 43--57.
for ps file
12. Pluhár András,
Pozíciós játékok. (Positional Games in Hungarian),
Szigma 3-4 (2007) 111--130.
for pdf file
13. B. Csaba and A. Pluhár,
A randomized algorithm for the on-line weighted bipartite
matching problem.
J. of Scheduling 11 (2008) 449--455.
for pdf file
14. A. Csernenszky, C. I. Mándity and A. Pluhár,
On Chooser-Picker Positional Games.
Discrete Mathematics 309 (2009) 5141--5146. doi:10.1016/j.disc.2009.03.051
for pdf file
15. A. Pluhár,
Greedy colorings of uniform hypergraphs.
Random Structures and Algorithms Volume 35 (2009) 216--221.
doi 10.1002/rsa.20267
for pdf file
16. J. Balogh, R. Martin and A. Pluhár,
The diameter game.
Random Structures and Algorithms Volume 35 (2009) 369--389.
for pdf file
17. A. Bóta, M. Krész and A. Pluhár,
Dynamic Communities and their Detection.
Acta Cybernetica Volume 20 (2011) 35--52.
for pdf file
18. E. Griechisch and A. Pluhár,
Community Detection by using the Extended Modularity.
Acta Cybernetica Volume 20 (2011) 69--85.
for pdf file
19. A. Bóta, M. Krész and A. Pluhár,
Systematic learning of edge probabilities in the
Domingos-Richardson model.
Int. J. Complex Systems in Science Volume 1(2)
(2011) 115--118.
for pdf file
20. A. Csernenszky, R. Martin and A. Pluhár,
On the Complexity of Chooser-Picker Positional Games.
Integers 11 (2011).
for pdf file
21. J. Balogh and A. Pluhár,
The positive minimum degree on game sparse graphs.
The Electronic J. of Combinatorics 19 (2012) #P22.
for pdf file
To appear, submitted, in preparation
22. B. Csaba and A. Pluhár,
Weighted Regularity Lemma with Applications.
submitted
for pdf file
23. Bartalos István és
Pluhár András,
Közösségek és szerepük a kisvilág gráfokban.
submitted
for pdf file
Else
A. Csernenszky, Gy. Kovács, M. Krész, A. Pluhár and T. Tóth,
The use of infection models in accounting and crediting.
Proc. of the Challenges for Analysis of the Economy, the Business, and Social Progress
International Scientific Conference, Szeged, November 19-21, 2009.
for pdf file
A. Bóta, L. Csizmadia and A. Pluhár,
Community detection and its use in Real Graphs.
Proceedings of the 2010 Mini-Conference on Applied Theoretical
Computer Science - MATCOS 10 2010, 95--99.
for pdf file
Szeged, 31th of January, 2012.