The following pages link to Edyta Szymańska (Q456170):
Displaying 20 items.
- \(H\)-colorings of dense hypergraphs (Q456171) (← links)
- (Q501661) (redirect page) (← links)
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree (Q1933645) (← links)
- The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634) (← links)
- COMPUTATIONAL COMPLEXITY OF THE PERFECT MATCHING PROBLEM IN HYPERGRAPHS WITH SUBCRITICAL DENSITY (Q3069732) (← links)
- Brief Announcement: Distributed Approximations for the Semi-matching Problem (Q3095327) (← links)
- Approximate Counting of Matchings in (3,3)-Hypergraphs (Q3188911) (← links)
- Distributed Approximation Algorithms for Planar Graphs (Q3434565) (← links)
- Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs (Q3557058) (← links)
- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree (Q3651570) (← links)
- The Complexity of Perfect Matching Problems on Dense Hypergraphs (Q3652249) (← links)
- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs (Q3652253) (← links)
- A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph (Q4373005) (← links)
- Distributed 2-Approximation Algorithm for the Semi-matching Problem (Q4909413) (← links)
- Approximate Counting of Matchings in Sparse Uniform Hypergraphs (Q5194740) (← links)
- Algorithms – ESA 2004 (Q5464584) (← links)
- (Q5747392) (← links)
