A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. - Tomasz Luczak 001; Edyta Szymanska (J. Algorithms, 1997)

Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph. - Edyta Szymanska (ICALP Satellite Workshops, 2000)

A Fast Distributed Algorithm for Approximating the Maximum Matching. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska (ESA, 2004)

Distributed algorithm for approximating the maximum matching. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska (Discret. Appl. Math., 2004)

Distributed Approximation Algorithms for Planar Graphs. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska (CIAC, 2006)

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska (ISAAC, 2009)

The Complexity of Perfect Matching Problems on Dense Hypergraphs. - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (ISAAC, 2009)

The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. - Edyta Szymanska (IWOCA, 2009)

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (LATIN, 2010)

The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. - Edyta Szymanska (WG, 2010)

Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (Int. J. Found. Comput. Sci., 2010)

Brief Announcement: Distributed Approximations for the Semi-matching Problem. - Andrzej Czygrinow; Michal Hanckowiak; Krzysztof Krzywdzinski; Edyta Szymanska; Wojciech Wawrzyniak (DISC, 2011)

Distributed 2-Approximation Algorithm for the Semi-matching Problem. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska; Wojciech Wawrzyniak (DISC, 2012)

Approximate Counting of Matchings in Sparse Hypergraphs - Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (CoRR, 2012)

H-colorings of dense hypergraphs. - Edyta Szymanska (Inf. Process. Lett., 2012)

Approximate Counting of Matchings in Sparse Uniform Hypergraphs. - Edyta Szymanska; Marek Karpinski; Andrzej Rucinski 001 (ANALCO, 2013)

The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees. - Edyta Szymanska (Discret. Math. Theor. Comput. Sci., 2013)

The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree. - Edyta Szymanska (Eur. J. Comb., 2013)

Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska; Wojciech Wawrzyniak; Marcin Witkowski (OPODIS, 2014)

Approximate Counting of Matchings in (3, 3)-Hypergraphs. - Andrzej Dudek; Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (SWAT, 2014)

Approximate Counting of Matchings in (3,3)-Hypergraphs. - Andrzej Dudek; Marek Karpinski; Andrzej Rucinski 001; Edyta Szymanska (Electron. Colloquium Comput. Complex., 2014)

On the distributed complexity of the semi-matching problem. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska; Wojciech Wawrzyniak (J. Comput. Syst. Sci., 2016)

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. - Andrzej Czygrinow; Michal Hanckowiak; Edyta Szymanska; Wojciech Wawrzyniak; Marcin Witkowski (Theor. Comput. Sci., 2017)