Edyta Szymanska

According to our database, Edyta Szymanska authored at least 23 papers between 1997 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2017

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

2016

On the distributed complexity of the semi-matching problem.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak

J. Comput. Syst. Sci., 2016

2014

Approximate Counting of Matchings in (3,3)-Hypergraphs.

Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Electron. Colloquium Comput. Complex., 2014

Approximate Counting of Matchings in (3, 3)-Hypergraphs.

Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Proceedings of the Algorithm Theory - SWAT 2014, 2014

Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski

Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013

The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree.

Edyta Szymanska

Eur. J. Comb., 2013

The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees.

Edyta Szymanska

Discret. Math. Theor. Comput. Sci., 2013

Approximate Counting of Matchings in Sparse Uniform Hypergraphs.

Edyta Szymanska, Marek Karpinski, Andrzej Rucinski

Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012

H-colorings of dense hypergraphs.

Edyta Szymanska

Inf. Process. Lett., 2012

Approximate Counting of Matchings in Sparse Hypergraphs

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

CoRR, 2012

Distributed 2-Approximation Algorithm for the Semi-matching Problem.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak

Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011

Brief Announcement: Distributed Approximations for the Semi-matching Problem.

Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak

Proceedings of the Distributed Computing - 25th International Symposium, 2011

2010

Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density.

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Int. J. Found. Comput. Sci., 2010

The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree.

Edyta Szymanska

Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs.

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree.

Edyta Szymanska

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

The Complexity of Perfect Matching Problems on Dense Hypergraphs.

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2006

Distributed Approximation Algorithms for Planar Graphs.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

2004

Distributed algorithm for approximating the maximum matching.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Discret. Appl. Math., 2004

A Fast Distributed Algorithm for Approximating the Maximum Matching.

Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska

Proceedings of the Algorithms, 2004

2000

Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph.

Edyta Szymanska

Proceedings of the ICALP Workshops 2000, 2000

1997

A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph.

Tomasz Luczak, Edyta Szymanska

J. Algorithms, 1997