Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Pluhár, András - Institute of Informatics, University of Szeged
Remarks on the Interval Number of Graphs A. Pluh ar
ON THE EDGEBANDWIDTH OF GRAPH PRODUCTS OZSEF BALOGH, DHRUV MUBAYI, AND ANDR
A Sharp Edge Bound on the Interval Number of a Graph J ozsef Balogh y Andr as Pluh ar z
POZICIOS JATEKOK PLUHAR ANDRAS
WEIGHTED REGULARITY LEMMA WITH APPLICATIONS BELA CSABA AND ANDRAS PLUHAR
COVERING PLANAR GRAPHS WITH FORESTS OZSEF BALOGH, MARTIN KOCHOL, ANDR
Generalized Harary Games Andr as Pluh ar y
The accelerated k-in-a-row game Andr as Pluh ar y
A randomized algorithm for the on-line weighted bipartite matching problem
On Chooser-Picker positional games 1 Andras Csernenszky a
GREEDY COLORINGS OF UNIFORM HYPERGRAPHS ANDRAS PLUHAR
ON THE COMPLEXITY OF CHOOSER-PICKER POSITIONAL ANDRAS CSERNENSZKY, RYAN R. MARTIN, AND ANDRAS PLUHAR
Acta Cybernetica 00 (0000) 117. Community Detection by using the Extended
Community detection and its use in Real Graphs Andras Bota
Acta Cybernetica 00 (0000) 118. Dynamic Communities and their Detection
On the existence of nite isomorphically complete systems of automata
On the Interval Number of Special Graphs J ozsef Balogh Pascal Ochem y Andr as Pluh ar z
The Recycled Kaplansky's Game Andr as Pluh ar y
WEIGHTED REGULARITY LEMMA WITH APPLICATIONS BELA CSABA AND ANDRAS PLUHAR
International Journal of Complex Systems in Science vol. 1(2) pp 115118. Systematic learning of edge probabilities in the
KZSSGEK S SZEREPK A KISVILG BARTALOS ISTVN S PLUHR ANDRS
The positive minimum degree game on sparse graphs Jozsef Balogh
