Edyta Szymańska

Available identifiers

zbMath Open szymanska.edytaMaRDI QIDQ456170

List of research outcomes

Publication	Date of Publication	Type
Approximate Counting of Matchings in Sparse Uniform Hypergraphs	2019-09-17	Paper
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs	2017-01-09	Paper
On the distributed complexity of the semi-matching problem	2016-08-04	Paper
Approximate Counting of Matchings in (3,3)-Hypergraphs	2014-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q5747392	2014-02-14	Paper
Distributed 2-Approximation Algorithm for the Semi-matching Problem	2013-03-13	Paper
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree	2013-01-24	Paper
\(H\)-colorings of dense hypergraphs	2012-10-23	Paper
Brief Announcement: Distributed Approximations for the Semi-matching Problem	2011-10-28	Paper
COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY	2011-01-19	Paper
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree	2010-11-16	Paper
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs	2010-04-27	Paper
The Complexity of Perfect Matching Problems on Dense Hypergraphs	2009-12-17	Paper
Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs	2009-12-17	Paper
The complexity of almost perfect matchings in uniform hypergraphs with high codegree	2009-12-11	Paper
Distributed Approximation Algorithms for Planar Graphs	2007-05-02	Paper
Algorithms – ESA 2004	2005-08-18	Paper
Distributed algorithm for approximating the maximum matching	2004-11-23	Paper
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph	1998-05-25	Paper

Research outcomes over time

This page was built for person: Edyta Szymańska