default search action
Edyta Szymanska
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j8]Andrzej Czygrinow, Michal Hanckowiak
, Edyta Szymanska, Wojciech Wawrzyniak
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. Theor. Comput. Sci. 662: 1-8 (2017) - 2016
- [j7]Andrzej Czygrinow, Michal Hanckowiak
On the distributed complexity of the semi-matching problem. J. Comput. Syst. Sci. 82(8): 1251-1267 (2016) - 2014
- [c13]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs. OPODIS 2014: 49-59 - [c12]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski
Approximate Counting of Matchings in (3, 3)-Hypergraphs. SWAT 2014: 380-391 - [i4]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3, 3)-Hypergraphs. CoRR abs/1402.6190 (2014) - [i3]Andrzej Dudek, Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in (3,3)-Hypergraphs. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j6]Edyta Szymanska:
The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees. Discret. Math. Theor. Comput. Sci. 15(2): 121-138 (2013) - [j5]Edyta Szymanska:
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree. Eur. J. Comb. 34(3): 632-646 (2013) - [c11]Edyta Szymanska, Marek Karpinski, Andrzej Rucinski
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. ANALCO 2013: 72-79 - 2012
- [j4]Edyta Szymanska:
H-colorings of dense hypergraphs. Inf. Process. Lett. 112(23): 899-902 (2012) - [c10]Andrzej Czygrinow, Michal Hanckowiak
Distributed 2-Approximation Algorithm for the Semi-matching Problem. DISC 2012: 210-222 - [i2]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in Sparse Hypergraphs. CoRR abs/1202.5885 (2012) - [i1]Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
Approximate Counting of Matchings in Sparse Uniform Hypergraphs. CoRR abs/1204.5335 (2012) - 2011
- [c9]Andrzej Czygrinow, Michal Hanckowiak
Brief Announcement: Distributed Approximations for the Semi-matching Problem. DISC 2011: 200-201 - 2010
- [j3]Marek Karpinski, Andrzej Rucinski
Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density. Int. J. Found. Comput. Sci. 21(6): 905-924 (2010) - [c8]Marek Karpinski, Andrzej Rucinski
Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs. LATIN 2010: 662-673 - [c7]Edyta Szymanska:
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree. WG 2010: 304-314
2000 – 2009
- 2009
- [c6]Marek Karpinski, Andrzej Rucinski
The Complexity of Perfect Matching Problems on Dense Hypergraphs. ISAAC 2009: 626-636 - [c5]Andrzej Czygrinow, Michal Hanckowiak
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs. ISAAC 2009: 668-678 - [c4]Edyta Szymanska:
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree. IWOCA 2009: 438-449 - 2006
- [c3]Andrzej Czygrinow, Michal Hanckowiak
Distributed Approximation Algorithms for Planar Graphs. CIAC 2006: 296-307 - 2004
- [j2]Andrzej Czygrinow, Michal Hanckowiak
Distributed algorithm for approximating the maximum matching. Discret. Appl. Math. 143(1-3): 62-71 (2004) - [c2]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska:
A Fast Distributed Algorithm for Approximating the Maximum Matching. ESA 2004: 252-263 - 2000
- [c1]Edyta Szymanska:
Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph. ICALP Satellite Workshops 2000: 39-52
1990 – 1999
- 1997
- [j1]Tomasz Luczak
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. J. Algorithms 25(2): 311-320 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: