8 citations · 8 across the 3 of their papers we have counts for
3 papers
math.HO2010
Topology and subsets - the story of a theorem
Michał Adamaszek
In this exposition the space of at most 3-element subsets of the circle, first identified by Borsuk and Bott, is used as a motivation to introduce the readers to a variety of metho…
cs.DS2009
Large-girth roots of graphs
Anna Adamaszek, Michal Adamaszek
We study the problem of recognizing graph powers and computing roots of graphs. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r+3,…
math.CO2006★ 8 cited
Efficient enumeration of graceful permutations
Michal Adamaszek
A graceful n-permutation is a graceful labeling of an n-vertex path P_n. In this paper we improve the asymptotic lower bound on the number of such permutations from (5/3)^n to 2.37…