activity
20142022
most citedAsymptotically exact streaming algorithms

4 citations · 7 across the 14 of their papers we have counts for

collaborators
Showing 2021Show all

5 papers · 1 filter

physics.soc-ph2021

Wealth distribution in villages. Transition from socialism to capitalism in view of exhaustive wealth data and a master equation approach

István Gere, Szabolcs Kelemen, Tamás S. Biró +1

Socio-economic inequalities derived from an exhaustive wealth distribution is studied in a closed geographical region from Transylvania (Romania). Exhaustive wealth data is compute…

cs.DC2021

Distributed recoloring of interval and chordal graphs

Nicolas Bousquet, Laurent Feuilloley, Marc Heinrich +1

One of the fundamental and most-studied algorithmic problems in distributed computing on networks is graph coloring, both in bounded-degree and in general graphs. Recently, the stu…

math.CO2021

On a recolouring version of Hadwiger's conjecture

Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne +1

We prove that for any , for any large enough , there is a graph that admits no -minor but admits a -colouring that is "frozen" wi…

cs.DM2021

Counting independent sets in strongly orderable graphs

Marc Heinrich, Haiko Müller

We consider the problem of devising algorithms to count exactly the number of independent sets of a graph G . We show that there is a polynomial time algorithm for this problem whe…

math.CO2021

Partizan Subtraction Games

Eric Duchêne, Marc Heinrich, Richard J. Nowakowski +1

Partizan subtraction games are combinatorial games where two players, say Left and Right, alternately remove a number n of tokens from a heap of tokens, with (resp. $n…