András Pluhár

From MaRDI portal
Revision as of 02:14, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:235726

Available identifiers

zbMath Open pluhar.andrasMaRDI QIDQ235726

List of research outcomes





PublicationDate of PublicationType
Graph clustering via generalized colorings2022-05-10Paper
A discrepancy version of the Hajnal–Szemerédi theorem2021-06-15Paper
Graph clustering via generalized colorings2021-03-14Paper
On the discrepancies of graphs2020-05-20Paper
Linear Time Ordering of Bins using a Conveyor System2020-02-26Paper
The pairing strategies of the 9-in-a-row game2019-07-25Paper
Spanning Tree Game as Prim Would Have Played2018-09-03Paper
Generalized pairing strategies -- a bridge from pairing strategies to colorings2017-02-07Paper
https://portal.mardi4nfdi.de/entity/Q28342512016-11-25Paper
On the path separation number of graphs2016-09-12Paper
Applications of the inverse infection problem on bank transaction networks2016-07-04Paper
https://portal.mardi4nfdi.de/entity/Q55024362015-08-26Paper
A weighted regularity lemma with applications2014-06-27Paper
Approximations of the Generalized Cascade Model2013-11-07Paper
On the Complexity of Chooser–Picker Positional Games2012-07-11Paper
The positive minimum degree game on sparse graphs2012-06-12Paper
Dynamic Communities and their Detection2011-12-19Paper
Community Detection by using the Extended Modularity2011-12-19Paper
Greedy colorings of uniform hypergraphs2010-11-09Paper
The diameter game2010-11-09Paper
On chooser-picker positional games2009-12-15Paper
A randomized algorithm for the on-line weighted bipartite matching problem2009-08-28Paper
On the edge-bandwidth of graph products2006-09-14Paper
Covering planar graphs with forests2005-05-04Paper
https://portal.mardi4nfdi.de/entity/Q46729132005-04-28Paper
On the interval number of special graphs2004-08-16Paper
The interval number of dense graphs2002-12-02Paper
The accelerated \(k\)-in-a-row game2002-03-03Paper
A sharp edge bound on the interval number of a graph2000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42362321999-03-22Paper
https://portal.mardi4nfdi.de/entity/Q42315811999-03-14Paper
https://portal.mardi4nfdi.de/entity/Q48647841996-02-25Paper
Graphs with no induced \(C_ 4\) and \(2K_ 2\)1993-06-20Paper

Research outcomes over time

This page was built for person: András Pluhár