dblp.uni-trier.dewww.uni-trier.de

András Pluhár

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
12EEBéla Csaba, András Pluhár: A randomized algorithm for the on-line weighted bipartite matching problem. J. Scheduling 11(6): 449-455 (2008)
2007
11EEBéla Csaba, András Pluhár: A randomized algorithm for the on-line weighted bipartite matching problem CoRR abs/0705.4673: (2007)
2006
10EEJózsef Balogh, Dhruv Mubayi, András Pluhár: On the edge-bandwidth of graph products. Theor. Comput. Sci. 359(1-3): 43-57 (2006)
2005
9EEJózsef Balogh, Martin Kochol, András Pluhár, Xingxing Yu: Covering planar graphs with forests. J. Comb. Theory, Ser. B 94(1): 147-158 (2005)
2004
8EEAndrás Pluhár: The Recycled Kaplansky's Game. Acta Cybern. 16(3): 451-458 (2004)
7EEJózsef Balogh, Pascal Ochem, András Pluhár: On the interval number of special graphs. Journal of Graph Theory 46(4): 241-253 (2004)
2002
6EEJózsef Balogh, András Pluhár: The interval number of dense graphs. Discrete Mathematics 256(1-2): 423-429 (2002)
5EEAndrás Pluhár: The accelerated k-in-a-row game. Theor. Comput. Sci. 270(1-2): 865-875 (2002)
1998
4 Ferenc Gécseg, Balázs Imreh, András Pluhár: On the Existence of Finite Isomorphically Complete Systems of Automata. Journal of Automata, Languages and Combinatorics 3(2): 77-84 (1998)
1997
3EEAndrás Pluhár: Generalized Harary Games. Acta Cybern. 13(1): 77-84 (1997)
1995
2EEAndrás Pluhár: Remarks on the Interval Number of Graphs. Acta Cybern. 12(2): 125-130 (1995)
1993
1EEZoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza: Graphs with no induced C4 and 2K2. Discrete Mathematics 115(1-3): 51-55 (1993)

Coauthor Index

1József Balogh [6] [7] [9] [10]
2Zoltán Blázsik [1]
3Béla Csaba [11] [12]
4Ferenc Gécseg [4]
5Mihály Hujter [1]
6Balázs Imreh [4]
7Martin Kochol [9]
8Dhruv Mubayi [10]
9Pascal Ochem [7]
10Zsolt Tuza [1]
11Xingxing Yu [9]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)