Citation list of András Pluhár
Appeared
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.
1.
Gerber, M. U. and Lozin, V. V. On the stable set problem in special
$P_5$-free graphs. Discrete Appl. Math. 125 (2003), no. 2-3, 215--224.
2.
Yilian Qin and Igor E. Zverovich. Generalized Cographs.
Rutcor Research Report 26-2002, September, 2002
3.
Fouquet, J.-L.; Giakoumakis, V.; Maire, F. and Thuillier, H.
On graphs without $P_5$ and $\overline P_5$.
Discrete Math. 146 (1995), no. 1-3, 33--44.
4.
Dantas, S.; Gravier, S. and Maffray, F.
Extremal graphs for the list-coloring version of a theorem of Nordhaus
and Gaddum. Discrete Appl. Math. 141 (2004), no. 1-3, 93--101.
5.
Arbib, C. and Mosca, R.
On ($P_5$, diamond)-free graphs. Discrete Math. 250 (2002), no. 1-3, 1--22.
6.
Guruswami, V. Enumerative aspects of certain subclasses of perfect graphs.
Discrete Math. 205 (1999), no. 1-3, 97--117.
7.
Rusu, Irena C. Aspects th?eoriques et algorithmiques des graphes parfaits.
Habilitation `a diriger des recherches, Université d' ?Oléans,
9 d?ecembre 1999.
8.
Mosca, R.
Polynomial algorithms for the maximum stable set problem
on particular classes of $P_5$-free graphs.
Inf. Process. Lett. 61 (1997) 137--143.
9.
Maffray, F. and Preissman, M.
Linear recognition of pseudo-split graphs.
Discrete Applied Mathematics, Volume 52,
Issue 3, 26 August 1994, Pages 307--312.
10.
Brandst?t, A.; Le, Van Bang; Spinrad, J. P. Graph classes: a survey.
SIAM Monographs on Discrete Mathematics and
Applications. Society for Industrial and Applied Mathematics (SIAM),
Philadelphia, PA, 1999. xii+304 pp. ISBN: 0-89871-432-X.
11.
Hertz, A.
On the use of Boolean methods for the computation of the
stability number.
Discrete Applied Mathematics, Volume 76,
(1997), Pages 307--312.
12.
Radosavljevic, Z; Simic, S. and Tuza, Zs.
Complementary pairs of graphs orientable to line digraphs.
J. Comb. Math. Comb. Comput. 13, 65--75 (1993).
13.
Gernert, D. and Rabern, L.
A knowledge-based system for graph theory, demonstrated
by partial proofs for graph-colouring problems.
MATCH Commun. Math. Comput. Chem. 58 (2007) 445--460.
14.
Heggernes, P. and Mancini, F.
Dinamically maintaining split graphs.
Discrete Applied Mathematics Volume 157 Issue 9 (2009),
2057--2069.
15.
Bouaza, N.
Graphes de permutation scind?. (French. English, French summary)
[Split permutation graphs]
C. R. Acad. Sci. Paris S?. I Math. 318 (1994), no. 11, 971--977.
16.
Gernert, D., and Rabern, L.,
A computerized system for graph theory, illustrated by partial proofs
for graph coloring problems.
Graph Theory Notes of New York LV New York Academy of Sciences (2008),
14--24.
17.
M. D. Barrus, S. G. Hartke, and M. Kumbhat,
Non-minimal Degree-Sequence-Forcing Triples,
preprint.
18.
M. Hujter,
Some good characterization results relating to the K?ig-Egerv?y theorem.
CEJOR, Vol. 18, No. 1. (2010) 37--45.
DOI: 10.1007/s10100-009-0126-y
19.
R. Quaddoura, Operator Decomposition of Graphs.
The International Arab Journal of Information Technology,
Vol. 3., No. 2, (2006).
20.
Sha, Yuan-xia, The structure of minimal nullity on a kind of free graph.
Journal of Qiqihar University (Natural Science Edition)
Issue 3, (2009) 77--78.
21.
S.A. Choudum and T. Karthick,
Maximal cliques in $\{P_2 \cup P_3, C_4 \}-free graphs.
Discrete Mathematics 310 (2010) 3398--3403.
22.
A. Gy?f?, Reflections on a Problem of Erd? and Hajnal.
The Mathematics of Paul Erd? II
Algorithms and Combinatorics Volume 14, 1997, pp 93--98
23.
Aouchiche, Mustapha, and Pierre Hansen.
A survey of Nordhaus-Gaddum type relations.
Discrete Applied Mathematics 161 4-5 (2013): 466--546.
A. Pluhár, Remarks on the Interval Number of
Graphs,
Acta Cybernetica 12 (1995) 125--129.
1.
Chen, M.; Chang, Gerard J.; West, D. B. Interval numbers of powers of block graphs.
Discrete Math. 275 (2004), no. 1-3, 87--96.
2.
Balogh, J. Graph Parameters, PhD dissertation, University of Szeged, 2002.
A. Pluhár, Generalized Harary Games,
Acta Cybernetica 13 (1997) 77-83.
1.
Sieben, N.; Deabay, E. Polyomino weak achievement games on
3-dimensional rectangular boards. Discrete Math. 290
(2005), no. 1, 61--78.
2.
Sieben, N. Hexagonal polyomino weak $(1,2)$-achievement games. Acta Cybernet.
16 (2004), no. 4, 579--585.
3.
Fisher, E.L. Rectangular polyomino set (1,2)-achievement games,
MSc thesis, Northern
Arizona University, 2005.
4.
Sieben, N.
Wild polyomino weak $(1,2)$-achievement games. Geombinatorics 13 (4) (2004), pp. 180--185.
5.
Sieben, N.
Polyominoes with minimum exterior perimeter and full set achievement games.
European J. Combin. 29 (2008), no. 1, 108--117.
6.
Beck, J.
Combinatorial games. Tic-Tac-Toe theory. Encyclopedia of Mathematics and its
Applications, 114. Cambridge University Press, Cambridge, 2008.
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.
1.
D??i, P. On the product of all elements in a finite group. Acta Math.
Acad. Paedagog. Nyh?i. (N.S.) 17 (2001), no. 2,
137--139 (electronic).
2.
D??i, P. and Nehaniv, C. L. Algebraic theory of automata networks. An introduction. SIAM
Monographs on Discrete Mathematics and Applications, 11. Society for Industrial and Applied Mathematics
(SIAM), Philadelphia, PA, 2005.
3.
Rozovskaya, A. P. / Shabanov, D. A.
Extremal problems for panchromatic colourings of uniform hypergraphs.
Discrete Mathematics and Applications. Volume 22, Issue 2, Pages 185?206, ISSN (Online) 1569-3929,
ISSN (Print) 0924-9265, DOI: 10.1515/dma-2012-013, April
2012
4.
Rozovskaya, A. P. / Shabanov, D. A.
Improvement of the lower bound in the Kostochka problem of panchromatic coloring of a hypergraph.
Mathematical Notes
Volume 89, Numbers 5-6 (2011), 903-906, DOI: 10.1134/S0001434611050324
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.
1.
Chang, Y.-W.; Hutchinson, J. P.; Jacobson, M. S.; Lehel, J.; West, D. B.
The bar visibility number of a graph.
SIAM J. Discrete Math. 18 (2004/05), no. 3, 462--471
2.
Chen, M.; Chang, Gerard J.; West, D. B.
Interval numbers of powers of block graphs.
Discrete Math. 275 (2004), no. 1-3, 87--96.
3.
Balogh, J. Graph Parameters, PhD dissertation, University of Szeged, 2002.
4.
Balogh, J.; Prince, N. Minimum difference representations of graphs.
Graphs Combin. 25 (2009), no. 5, 647--655.
5.
Jiang, M.,
Recognizing d-Interval Graphs and d-Track Interval Graphs.
Lecture Notes in Computer Science, 2010, Volume 6213/2010, 160--171,
DOI: 10.1007/978-3-642-14553-7_17
A. Pluhár, The accelerated k-in-a-row game,
Theoretical Comp. Sci. 271 (1-2) (2002) 865--875.
1.
Fraenkel, A. S. Combinatorial games: selected bibliography with a
succinct gourmet introduction. More games of no chance
(Berkeley, CA, 2000), 475--535, Math. Sci. Res. Inst. Publ., 42,
Cambridge Univ. Press, Cambridge, 2002.
2.
Wu, I. C., Huang D.Y. A New Family of k-in-a-row Games.
Advances in Computer Games
Lecture Notes in Computer Science, 2006, Volume 4250/2006, 180--194.
3.
Ming Yu Hsieh and Shi-Chun Tsai.
On the fairness and complexity of generalized k-in-a-row games.
Theoret Comput Sci 385, 1-3, (2007), 88--100.
4.
Chiang, S. H., Wu, I. C., Lin, P. H.
On Drawn K-In-A-Row Games.
Lecture Notes in Computer Science, 2010, Volume 6048/2010, 158-169, DOI: 10.1007/978-3-642-12993-3_15
5.
A. Csernenszky,
The Chooser-Picker 7-in-a-row-game.
Publ. Math. Debrecen 76/4 (2010) 431--440.
6.
A. Csernenszky,
The Picker-Chooser diameter game.
Theoretical Computer Science Vol 411, No 40-42, 3757--3762.
7.
Chiang, S. H., Wu, I. C., Lin, P. H.
Drawn k-in-a-row games.
Theor. Comp. Sci , 412(35) (2011) DOI:
10.1016/j.tcs.2011.04.033
8.
Sheng-Hao Chiang, I-Chen Wu, Ping-Hung Lin
Drawn k-in-a-row games.
Theoretical Computer Science
Volume 412, Issue 35, 12 August 2011, Pages 4558--?459.
J. Balogh and A. Pluhár, The Interval Number
of Dense Graphs, Discrete Math. 256 (2002) 423--429.
1.
Balogh, J. Graph Parameters, PhD dissertation, University of Szeged, 2002.
J. Balogh, P. Ochem and A. Pluhár,
On the Interval Number of Special Graphs, J. of Graph
Theory 46 (2004) 241--253.
1.
Gambette, P. Les graphes 2-intervallaires, Master's thesis at MPRI,
LIAFA, U. Paris VII, 2006.
2.
Gambette, P. and Vialette, S.
On restrictions of balanced 2-interval graphs. Graph-theoretic concepts in computer
science, 55--65, Lecture Notes in Comput. Sci., 4769, Springer, Berlin, 2007.
3.
Fedor V. Fomin, Serge Gaspers, Petr Golovach, Karol Suchan, Stefan
Szeider, Erik Jan van Leeuwen, Martin Vatshelle, and Yngve Villanger
k-Gap Interval Graphs. manuscript
A. Pluhár,
The Recycled Kaplansky's Game. Acta Cybernetica
16 (2004) 451--458.
J. Balogh, M. Kochol, A. Pluhár
and X. Yu,
Covering planar graphs with forests.
J. of Combinatorial Theory B 94 ,
(2005) 147--158.
1.
de Freitas N. and Rivasseau, J.-N.
Partitioning a graph into trees for MCMC sampling. preprint.
2.
Rivasseau, J.-N.
From the Jungle to the Garden: Growing Trees for Markov Chain
Monte Carlo Inference in Undirected Graphical Models,
M.Sc. thesis, Ecole Polytechnique, 2003.
3.
D. Gon?lves (LaBRI, Bordeaux) : Couverture des graphes planaires
par trois for?s, dont une de degr?maximum quatre.
7?es Journ?s Graphes et Algorithmes.
4.
Philip Thomas Henderson,
Planar Graphs and Partial k-Trees
MSc thesis, Waterloo, Ontario, Canada, 2005
5.
Harant, J. and Jendrol, S.
On the Existence of Specific Stars in Planar Graphs.
Graphs and Combinatorics, Vol 23 No 5 (2007) 529--543.
6.
O. V. Borodin, A. V. Kostochka, Naeem N. Sheikh and Gexin Yu:
Decomposing a planar graph with girth 9 into a forest and a matching.
European Journal of Combinatorics Vol 29, Issue 5 (2008) 1235--1241.
7.
D. Gon?lves,
Covering planar graphs with forests, one having bounded maximum degree.
J. Combin. Theory Ser. B 99, (2009) 314--322.
8.
M. Montassier, A. P\^echer A. Raspaud, D. B. West, X. Zhu:
Decomposition of sparse graphs, with application to
game coloring number. Discrete Mathematics
volume 310, issue 10-11, year 2010, pp. 1520--1523.
9.
Mickael Montassier, Andr?Raspaud and Xuding Zhu,
Decomposition of sparse graphs into two forests, one having bounded maximum degree.
Information Processing Letters
Volume 110, Issue 20, 30 September 2010, Pages 913--916.
10.
Seog-Jin Kim., Alexandr V. Kostochka, Douglas B. West,
Hehui Wu, and Xuding Zhu,
Decomposition of Sparse Graphs into Forests and a
Graph with Bounded Degree. manuscript
11.
Mickael Montassier, Patrice Ossona de Mendez, Andr?Raspaud and Xuding Zhu,
Decomposing a graphs into forests.
Journal of Combinatorial Theory, Series B (2011)
doi:10.1016/j.jctb.2011.04.001
12.
Xin Zhang, Guizhen Liu, Jian-Liang Wu
Edge covering pseudo-outerplanar graphs with forests.
Discrete Mathematics Volume 312, Issue 18, 28 September 2012,
Pages 2788--?279. arXiv:1108.3877v1
13.
Hehuj Wu,
Extremal problems on cycles, packing, and decomposition of graphs.
PhD dissertation, University of Illinois at Urbana-Champaign, 2011.
14.
Cl?ent Charpentier, Mickael Montassier and Andr?Raspaud,
Minmax degree of graphs.
Electronic Notes in Discrete Mathematics
Volume 38, 1 December 2011, Pages 251--?25.
15.
Mickael Montassier, Arnaud Pe^chera, Andr?Raspaud, Douglas B. West, Xuding Zhu
Decomposition of sparse graphs, with application to game coloring number.
Discrete Mathematics
Volume 310, Issues 10?11, 6 June 2010, Pages 152--0?152.
16.
Kim, Seog-Jin, Alexandr V. Kostochka, Douglas B. West, Hehui Wu, and Xuding Zhu.
Decomposition of sparse graphs into forests and a graph with bounded degree.
Journal of Graph Theory (2013).
17.
Borodin, O.V., Ivanova, A.O.
Describing (d - 2) -stars at d-vertices, d ? 5, in normal plane maps
Discrete Mathematics volume 313 issue 17, year 2013, pp. 1700--1709.
18.
Borodin, O.V., Ivanova, A.O.
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5
Discrete Mathematics
volume 313 issue 17, year 2013, pp. 1710--1714.
J. Balogh, D. Mubayi and A. Pluhár,
On the edge-bandwidth of graph products,
Theoretical Comp. Sci. 359 (2006) 43--57.
1.
Akhtar R.; Jiang T.; Miller, Z.; Pritikin D.
Edge-bandwidth of the triangular grid.
Electronic J. of Combinatorics, 14 (2007).
2.
Pikhurko, O. and Wojciechowski, J.
Edge-Bandwidth of Grids and Tori.
Theoret. Comput. Sci. 369 (2006), no. 1-3, 35--43.
3.
Akhtar R.; Jiang T.; Miller, Z.
Asymptotic determination of edge-bandwidth of multidimensional grids
and Hamming graphs.
SIAM J. of Discrete Math, accepted.
4.
Y. Otachi,
Treewidth and related graph parameters.
Department of Computer Science, Gunma University.
Ph.D. Thesis, 2010.
5.
Y. Otachi, R. Suda
Bandwidth and pathwidth of three-dimensional grids.
arXiv:1101.0964v1 [cs.DM]
Pluhár András,
Pozíciós játékok, (in Hungarian)
Szigma 3-4 (2007) 111--130.
1.
O. Pikhurko, A. Beveridge, T. Bohman, A. Frieze
Game Chromatic Index of Graphs with Given Restrictions on Degrees,
Theoret Computer Sci, 407 1-3 (2008) 242--249.
2.
A. Csernenszky,
The Chooser-Picker 7-in-a-row-game.
Publ. Math. Debrecen 76/4 (2010) 431--440.
B. Csaba and A. Pluhár,
A randomized algorithm for the on-line weighted bipartite
matching problem,
J. of Scheduling 11 (2008) 449--455.
1.
Chung, C., Pruhs, K. and Uthaisombut, P.
The Online Transportation Problem: On the Exponential Boost of One Extra
Server, in
Latin 2008, LNCS 4957. pp 228--239, 2008.
2.
J. Nagy-Gy?gy,
Randomized algorithm for the k-server problem on decomposable spaces,
J. of Discrete Algorithms 7 (2009) 411--419.
doi:10.1016/j.jda.2009.02.005
3.
J. Nagy-Gy?gy,
Online algorithms for combinatorial problems.
PhD dissertation, University of Szeged, 2009.
doi:10.1016/j.jda.2009.02.005
4.
Aaron Cot? Adam Meyerson, Alan Roytman, Michael Shindler, Brian Tagiku,
Energy-Efficient Online Scheduling. Technical Report UCLA-CSD-100029
5.
Zheng, F., Cheng, Y., Xu, Y., Liu, M.
Competitive strategies for an online generalized assignment problem with a service consecution constraint.
European Journal of Operational Research volume 229, issue 1, year 2013, pp. 59--66.
A. Csernenszky, C. I. Mándity and A. Pluhár,
On Chooser-Picker Positional Games.
Discrete Mathematics 309 (2009) 5141--5146.
1.
A. Csernenszky,
The Chooser-Picker 7-in-a-row-game.
Publ. Math. Debrecen 76/4 (2010) 431--440.
2.
A. Csernenszky,
The Picker-Chooser diameter game.
Theoretical Computer Science Vol 411, No 40-42, 3757--3762.
3.
Bednarska-Bzdega, M.,
On weight function methods in Chooser-Picker games.
Theoretical Computer Science Volume 475, No 4, 2013, pp. 21--33.
A. Pluhár, Greedy colorings of uniform hypergraphs,
Random Structures and Algorithms
Volume 35 (2009) 216--221.
1.
D. A. Shabanov,
Improvement of the Lower Bound in the Erd?--Hajnal Combinatorial Problem.
Doklady Mathematics Vol. 79, No. 3, (2009) pp. 349--350.
DOI: 10.1134/S1064562409030132
2.
A.P. Rozovskaya and D.A. Shabanov,
On the Problem of Erd? and Hajnal in the Case of List Colorings.
Electronic Notes in Discrete Mathematics
Volume 34 , (2009) 387--391.
3.
A. Gyárfás and J. Lehel,
Trees in Greedy Colorings of Hypergraphs.
Discrete Mathematics
Volume 311 , 2-3 (2010) 208--209.
4.
A.P. Rozovskaya,
Combinatorial extremum problems for 2-colorings of hypergraphs.
Mathematical Notes, Sep 2011.
5.
D.A. Shabanov,
On r-chromatic hypergraphs.
Discrete Mathematics
Volume 312 , (2012) 441--458.
6.
A.M. Raigorodskii and D.A. Shabanov,
The Erdős-Hajnal problem, its generalizations, and related problems.
2011 Russ. Math. Surv. 66 933 doi:10.1070/RM2011v066n05ABEH004764
7.
H. Gebauer,
On the construction of 3-chromatic hypergraphs with few edges.
Journal of Combinatorial Theory, Series A
Volume 120, Issue 7, September 2013, Pages 1483--1490.
J. Balogh, R. Martin and A. Pluhár,
The diameter game.
Random Structures and Algorithms
Volume 35 (2009) 216--221.
1.
A. Csernenszky,
The Picker-Chooser diameter game.
Theoretical Computer Science Vol 411, No 40-42, 3757--3762.
2.
Heidi Gebauer,
On the Clique-Game.
Eur. J. Comb. 33(1) (2012) 8--19.
3.
D. Hefetz, M. Rakic M. Stojakovic
Doubly biased Maker-Breaker Connectivity game.
arXiv:1101.3932v1 [math.CO]
4.
J. Balogh and W. Samotij,
On the Chvatal-Erd? triangle game.
Electronic J. of Combinatorics 18 (2011) P72.
5.
I. Ben-Eliezer, M. Krivelevich, B. Sudakov,
Biased orientation games.
Discrete Mathematics 312 (2012) 1732--1742.
A. Csernenszky, R. Martin and A. Pluhár,
On the complexity of Chooser-Picker games.
Integers
Volume 11 (2011).
1.
A. Csernenszky,
The Picker-Chooser diameter game.
Theoretical Computer Science Vol 411, No 40-42, 3757--3762.
A. B?a, M. Kr?z and A. Pluh?, Dynamic Communities and their Detection.
Acta Cybernetica Volume 20 (2011) 35--52.
1.
Langone, R., Alzate, C., Suykens, J.A.K.
Kernel spectral clustering with memory effect.
Physica A: Statistical Mechanics and its Applications
volume 392, issue 10, year 2013, pp. 2588--2606.
E. Griechisch and A. Pluhár,
Community detection by using the extended modularity.
Acta Cybernetica 20 (2011) 69--85.
1.
Yu, N., Han, Q,
Context-aware communities and their impact on information
influence in mobile social networks.
2012 IEEE International Conference on Pervasive Computing and Communications Workshops,
PERCOM Workshops 2012, art. no. 6197464, pp. 131--136.
2.
H. Zardi, L. Ben Romdhane,
An O(n2) algorithm for detecting communities of unbalanced sizes in large scale social networks.
Knowledge-Based Systems Vol. 37. Jan. 2013, pp. 19--36. doi>10.1016/j.knosys.2012.05.021
To appear, submitted, in preparation
Szeged, 2013/05/30.