Wojciech Wawrzyniak

Orcid: 0000-0002-8521-2525

According to our database1, Wojciech Wawrzyniak authored at least 16 papers between 2008 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Distributed approximation algorithms for <i>k</i>-dominating set in graphs of bounded genus and linklessly embeddable graphs.
Theor. Comput. Sci., 2020

2019
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs.
Theor. Comput. Sci., 2019

2018
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

2017
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs.
Theor. Comput. Sci., 2017

Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs.
Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016
On the distributed complexity of the semi-matching problem.
J. Comput. Syst. Sci., 2016

2015
A local approximation algorithm for minimum dominating set problem in anonymous planar networks.
Distributed Comput., 2015

2014
A strengthened analysis of a local algorithm for the minimum dominating set problem in planar graphs.
Inf. Process. Lett., 2014

Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
A local constant-factor approximation algorithm for MDS problem in anonymous network
CoRR, 2013

Brief announcement: a local approximation algorithm for MDS problem in anonymous planar networks.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012
Distributed 2-Approximation Algorithm for the Semi-matching Problem.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

2011
Brief Announcement: Distributed Approximations for the Semi-matching Problem.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

2008
Review of DISC 2008.
SIGACT News, 2008

Fast Distributed Approximations in Planar Graphs.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Distributed packing in planar graphs.
Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008


  Loading...