Edyta Szymanska
According to our database1,
Edyta Szymanska
authored at least 23 papers
between 1997 and 2017.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
0
1
2
3
4
1
1
1
2
2
1
1
1
2
1
1
1
2
3
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2017
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs.
Theor. Comput. Sci., 2017
2016
J. Comput. Syst. Sci., 2016
2014
Electron. Colloquium Comput. Complex., 2014
Proceedings of the Algorithm Theory - SWAT 2014, 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
The complexity of almost perfect matchings and other packing problems in uniform hypergraphs with high codegree.
Eur. J. Comb., 2013
The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees.
Discret. Math. Theor. Comput. Sci., 2013
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013
2012
Proceedings of the Distributed Computing - 26th International Symposium, 2012
2011
Proceedings of the Distributed Computing - 25th International Symposium, 2011
2010
Computational Complexity of the Perfect Matching Problem in Hypergraphs with Subcritical Density.
Int. J. Found. Comput. Sci., 2010
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010
Proceedings of the LATIN 2010: Theoretical Informatics, 2010
2009
The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009
2006
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006
2004
Discret. Appl. Math., 2004
Proceedings of the Algorithms, 2004
2000
Derandomization of a Parallel MIS Algorithm in a Linear Hypergraph.
Proceedings of the ICALP Workshops 2000, 2000
1997
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph.
J. Algorithms, 1997