Edyta Szymanska

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