default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWojciech Wawrzyniak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j7]Andrzej Czygrinow, Michal Hanckowiak
, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs. Theor. Comput. Sci. 809: 327-338 (2020)
2010 – 2019
- 2019
- [j6]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. Theor. Comput. Sci. 757: 1-10 (2019) - 2018
- [c8]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs. ISAAC 2018: 22:1-22:12 - 2017
- [j5]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski:
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs. Theor. Comput. Sci. 662: 1-8 (2017) - [c7]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs. ICTCS/CILC 2017: 75-86 - 2016
- [j4]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak:
On the distributed complexity of the semi-matching problem. J. Comput. Syst. Sci. 82(8): 1251-1267 (2016) - 2015
- [j3]Wojciech Wawrzyniak:
A local approximation algorithm for minimum dominating set problem in anonymous planar networks. Distributed Comput. 28(5): 321-331 (2015) - 2014
- [j2]Wojciech Wawrzyniak:
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs. Inf. Process. Lett. 114(3): 94-98 (2014) - [c6]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 - 2013
- [c5]Wojciech Wawrzyniak:
Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks. PODC 2013: 406-408 - [i1]Wojciech Wawrzyniak:
A local constant-factor approximation algorithm for MDS problem in anonymous network. CoRR abs/1303.2514 (2013) - 2012
- [c4]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak:
Distributed 2-Approximation Algorithm for the Semi-matching Problem. DISC 2012: 210-222 - 2011
- [c3]Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak:
Brief Announcement: Distributed Approximations for the Semi-matching Problem. DISC 2011: 200-201
2000 – 2009
- 2008
- [j1]Robert Danek, Wojciech M. Golab, Wojciech Wawrzyniak:
Review of DISC 2008. SIGACT News 39(4): 60-65 (2008) - [c2]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak:
Distributed packing in planar graphs. SPAA 2008: 55-61 - [c1]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak:
Fast Distributed Approximations in Planar Graphs. DISC 2008: 78-92
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 2025-01-20 23:04 CET 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:
