Edyta Szymanska

Publication Activity (10 Years)

Years Active: 1997-2017
Publications (10 Years): 2

Top Topics

Top Venues

J. Comput. Syst. Sci.

Inf. Process. Lett.

Publications

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. Theor. Comput. Sci. 662 (2017)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak
On the distributed complexity of the semi-matching problem. J. Comput. Syst. Sci. 82 (8) (2016)
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in (3, 3)-Hypergraphs. CoRR (2014)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs. OPODIS (2014)
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in (3, 3)-Hypergraphs. SWAT (2014)
Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in (3,3)-Hypergraphs. Electron. Colloquium Comput. Complex. 21 (2014)
Edyta Szymanska
The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees. Discret. Math. Theor. Comput. Sci. 15 (2) (2013)
Edyta Szymanska
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree. Eur. J. Comb. 34 (3) (2013)
Edyta Szymanska, Marek Karpinski, Andrzej Rucinski
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. ANALCO (2013)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in Sparse Hypergraphs CoRR (2012)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Approximate Counting of Matchings in Sparse Uniform Hypergraphs CoRR (2012)
Edyta Szymanska
H-colorings of dense hypergraphs. Inf. Process. Lett. 112 (23) (2012)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak
Distributed 2-Approximation Algorithm for the Semi-matching Problem. DISC (2012)
Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak
Brief Announcement: Distributed Approximations for the Semi-matching Problem. DISC (2011)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. LATIN (2010)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. Int. J. Found. Comput. Sci. 21 (6) (2010)
Edyta Szymanska
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. WG (2010)
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska
The Complexity of Perfect Matching Problems on Dense Hypergraphs. ISAAC (2009)
Edyta Szymanska
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. IWOCA (2009)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs. ISAAC (2009)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
Distributed Approximation Algorithms for Planar Graphs. CIAC (2006)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
Distributed algorithm for approximating the maximum matching. Discret. Appl. Math. 143 (1-3) (2004)
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
A Fast Distributed Algorithm for Approximating the Maximum Matching. ESA (2004)
Edyta Szymanska
Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph. ICALP Satellite Workshops (2000)
Tomasz Luczak, Edyta Szymanska
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. J. Algorithms 25 (2) (1997)