Edyta Szymańska

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Approximate counting of matchings in sparse uniform hypergraphs 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)	2019-09-17	Paper
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs Theoretical Computer Science	2017-01-09	Paper
On the distributed complexity of the semi-matching problem Journal of Computer and System Sciences	2016-08-04	Paper
Approximate counting of matchings in \((3,3)\)-hypergraphs Algorithm Theory – SWAT 2014	2014-09-02	Paper
The complexity of 2-coloring and strong coloring in uniform hypergraphs with high degrees	2014-02-14	Paper
Distributed 2-approximation algorithm for the semi-matching problem Lecture Notes in Computer Science	2013-03-13	Paper
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree European Journal of Combinatorics	2013-01-24	Paper
\(H\)-colorings of dense hypergraphs Information Processing Letters	2012-10-23	Paper
Brief announcement: Distributed approximations for the semi-matching problem Lecture Notes in Computer Science	2011-10-28	Paper
Computational complexity of the perfect matching problem in hypergraphs with subcritical density International Journal of Foundations of Computer Science	2011-01-19	Paper
The complexity of vertex coloring problems in uniform hypergraphs with high degree Graph Theoretic Concepts in Computer Science	2010-11-16	Paper
Computational complexity of the Hamiltonian cycle problem in dense hypergraphs LATIN 2010: Theoretical Informatics	2010-04-27	Paper
The Complexity of Perfect Matching Problems on Dense Hypergraphs Algorithms and Computation	2009-12-17	Paper
Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs Algorithms and Computation	2009-12-17	Paper
The complexity of almost perfect matchings in uniform hypergraphs with high codegree Lecture Notes in Computer Science	2009-12-11	Paper
Distributed Approximation Algorithms for Planar Graphs Lecture Notes in Computer Science	2007-05-02	Paper
Algorithms – ESA 2004 Lecture Notes in Computer Science	2005-08-18	Paper
Distributed algorithm for approximating the maximum matching Discrete Applied Mathematics	2004-11-23	Paper
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph Journal of Algorithms	1998-05-25	Paper

Research outcomes over time

This page was built for person: Edyta Szymańska