Andrzej Czygrinow

According to our database1, Andrzej Czygrinow authored at least 47 papers between 1995 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




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

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

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

Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs.
Journal of Graph Theory, 2016

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

An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.
Combinatorics, Probability & Computing, 2015

Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs.
SIAM J. Discrete Math., 2014

Tiling 3-Uniform Hypergraphs With K43-2e.
Journal of Graph Theory, 2014

On directed versions of the Corrádi-Hajnal corollary.
Eur. J. Comb., 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

Tight Co-Degree Condition for Perfect Matchings in 4-Graphs.
Electr. J. Comb., 2012

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

A Note on Bipartite Graph Tiling.
SIAM J. Discrete Math., 2011

On random sampling in uniform hypergraphs.
Random Struct. Algorithms, 2011

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

2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
SIAM J. Discrete Math., 2010

Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On the pebbling threshold of paths and the pebbling threshold spectrum.
Discrete Mathematics, 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

Distributed Approximations for Packing in Unit-Disk Graphs.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Girth, Pebbling, and Grid Thresholds.
SIAM J. Discrete Math., 2006

Distributed algorithms for weighted problems in sparse graphs.
J. Discrete Algorithms, 2006

Distributed Approximation Algorithms in Unit-Disk Graphs.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Distributed Almost Exact Approximations for Minor-Closed Families.
Proceedings of the Algorithms, 2006

Distributed Approximation Algorithms for Planar Graphs.
Proceedings of the Algorithms and Complexity, 6th Italian Conference, 2006

Strong edge colorings of uniform graphs.
Discrete Mathematics, 2004

Bounding the strong chromatic index of dense random graphs.
Discrete Mathematics, 2004

Distributed algorithm for approximating the maximum matching.
Discrete Applied Mathematics, 2004

A Fast Distributed Algorithm for Approximating the Maximum Matching.
Proceedings of the Algorithms, 2004

Thresholds for families of multisets, with an application to graph pebbling.
Discrete Mathematics, 2003

Matrix-Free Proof of a Regularity Characterization.
Electr. J. Comb., 2003

Pebbling in dense graphs.
Australasian J. Combinatorics, 2003

Distributed Algorithm for Better Approximation of the Maximum Matching.
Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003

A Note on Graph Pebbling.
Graphs and Combinatorics, 2002

2-factors in dense bipartite graphs.
Discrete Mathematics, 2002

On pebbling threshold functions for graph sequences.
Discrete Mathematics, 2002

Partitioning problems in dense hypergraphs.
Discrete Applied Mathematics, 2002

Spanning Trees of Bounded Degree.
Electr. J. Comb., 2001

Distributed O(Delta log(n))-Edge-Coloring Algorithm.
Proceedings of the Algorithms, 2001

An Algorithmic Regularity Lemma for Hypergraphs.
SIAM J. Comput., 2000

Maximum dispersion problem in dense graphs.
Oper. Res. Lett., 2000

The Polling Primitive for Computer Networks.
Informatica (Slovenia), 2000

Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discrete Math., 1999

The polling primitive for hypercube networks.
Proceedings of the Seventh IEEE Symposium on Parallel and Distributed Processing, 1995