Andrzej Czygrinow

Assoc Professor

  • 354 Citations
  • 12 h-Index
19952020

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

  • 354 Citations
  • 12 h-Index
  • 34 Article
  • 13 Conference contribution
  • 1 Conference article
2020

Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs

Czygrinow, A., Hanćkowiak, M., Wawrzyniak, W. & Witkowski, M., Feb 24 2020, In : Theoretical Computer Science. 809, p. 327-338 12 p.

Research output: Contribution to journalArticle

2019

Optimal pebbling number of graphs with given minimum degree

Czygrinow, A., Hurlbert, G., Katona, G. Y. & Papp, L. F., Jan 1 2019, In : Discrete Applied Mathematics.

Research output: Contribution to journalArticle

Tight minimum degree condition for the existence of loose cycle tilings in 3-graphs

Oursler, R. & Czygrinow, A., Jan 1 2019, In : SIAM Journal on Discrete Mathematics. 33, 4, p. 1912-1931 20 p.

Research output: Contribution to journalArticle

2018

Distributed approximation algorithms for the minimum dominating set in K H -minor-free graphs

Czygrinow, A., Hanćkowiak, M., Wawrzyniak, W. & Witkowski, M., Dec 1 2018, 29th International Symposium on Algorithms and Computation, ISAAC 2018. Lee, D-T., Liao, C-S. & Hsu, W-L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 123).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Distributed CONGESTBC constant approximation of MDS in bounded genus graphs

Czygrinow, A., Hanćkowiak, M., Wawrzyniak, W. & Witkowski, M., Jan 1 2018, (Accepted/In press) In : Theoretical Computer Science.

Research output: Contribution to journalArticle

2017

Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Regular Submission

Czygrinow, A., Hańckowiak, M., Wawrzyniak, W. & Witkowski, M., 2017, In : CEUR Workshop Proceedings. 1949, p. 75-86 12 p.

Research output: Contribution to journalArticle

Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs

Czygrinow, A., Hanćkowiak, M., Szymańska, E., Wawrzyniak, W. & Witkowski, M., Feb 1 2017, In : Theoretical Computer Science. 662, p. 1-8 8 p.

Research output: Contribution to journalArticle

3 Scopus citations
2016

On the distributed complexity of the semi-matching problem

Czygrinow, A., Hanćkowiak, M., Szymańska, E. & Wawrzyniak, W., Dec 1 2016, In : Journal of Computer and System Sciences. 82, 8, p. 1251-1267 17 p.

Research output: Contribution to journalArticle

Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs

Czygrinow, A., Dec 1 2016, In : Journal of Graph Theory. 83, 4, p. 317-333 17 p.

Research output: Contribution to journalArticle

3 Scopus citations
2015

An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs

Czygrinow, A., Debiasio, L., Kierstead, H. & Molla, T., Sep 25 2015, In : Combinatorics Probability and Computing. 24, 5, p. 754-773 20 p.

Research output: Contribution to journalArticle

5 Scopus citations
2014

Distributed local approximation of the minimum k-tuple dominating set in planar graphs

Czygrinow, A., Hanćkowiak, M., Szymańska, E., Wawrzyniak, W. & Witkowski, M., Jan 1 2014, Principles of Distributed Systems - 18th International Conference, OPODIS 2014, Proceedings. Aguilera, M. K., Querzoni, L. & Shapiro, M. (eds.). Springer Verlag, p. 49-59 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8878).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

On directed versions of the Corrádi-Hajnal corollary

Czygrinow, A., Kierstead, H. & Molla, T., Nov 2014, In : European Journal of Combinatorics. 42, p. 1-14 14 p.

Research output: Contribution to journalArticle

7 Scopus citations

Tight codegree condition for the existence of loose hamilton cycles in 3-graphs

Czygrinow, A. & Molla, T., 2014, In : SIAM Journal on Discrete Mathematics. 28, 1, p. 67-76 10 p.

Research output: Contribution to journalArticle

12 Scopus citations

Tiling 3-uniform hypergraphs with K43-2e

Czygrinow, A., Debiasio, L. & Nagle, B., Feb 2014, In : Journal of Graph Theory. 75, 2, p. 124-136 13 p.

Research output: Contribution to journalArticle

15 Scopus citations
2012

Distributed 2-Approximation Algorithm for the Semi-matching Problem

Czygrinow, A., Hanćkowiak, M., Szymańska, E. & Wawrzyniak, W., Nov 9 2012, Distributed Computing - 26th International Symposium, DISC 2012, Proceedings. p. 210-222 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7611 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Tight co-degree condition for perfect matchings in 4-graphs

Czygrinow, A. & Kamat, V., May 21 2012, In : Electronic Journal of Combinatorics. 19, 2, p. 1-16 16 p.

Research output: Contribution to journalArticle

Open Access
19 Scopus citations
2011

A note on bipartite graph tiling

Czygrinow, A. & Debiasio, L., Dec 1 2011, In : SIAM Journal on Discrete Mathematics. 25, 4, p. 1477-1489 13 p.

Research output: Contribution to journalArticle

3 Scopus citations

Brief announcement: Distributed approximations for the semi-matching problem

Czygrinow, A., Hanćkowiak, M., Krzywdziński, K., Szymańska, E. & Wawrzyniak, W., Nov 2 2011, Distributed Computing - 25th International Symposium, DISC 2011, Proceedings. p. 200-201 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6950 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

On random sampling in uniform hypergraphs

Czygrinow, A. & Nagle, B., Jul 1 2011, In : Random Structures and Algorithms. 38, 4, p. 422-440 19 p.

Research output: Contribution to journalArticle

1 Scopus citations
2010

2-Factors of bipartite graphs with asymmetric minimum degrees

Czygrinow, A., Debiasio, L. & Kierstead, H., Jul 16 2010, In : SIAM Journal on Discrete Mathematics. 24, 2, p. 486-504 19 p.

Research output: Contribution to journalArticle

2 Scopus citations
2009

Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs

Czygrinow, A., Hańćkowiak, M. & Szymańska, E., Dec 1 2009, Algorithms and Computation - 20th International Symposium, ISAAC 2009, Proceedings. p. 668-678 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5878 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

7 Scopus citations
2008

Distributed packing in planar graphs

Czygrinow, A., Hańćkowiak, M. & Wawrzyniak, W., Dec 15 2008, SPAA'08 - Proceedings of the 20th Annual Symposium on Parallelism in Algorithms and Architectures. p. 55-61 7 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Fast distributed approximations in planar graphs

Czygrinow, A., Hańćkowiak, M. & Wawrzyniak, W., Nov 26 2008, Distributed Computing - 22nd International Symposium, DISC 2008, Proceedings. p. 78-92 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5218 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

54 Scopus citations

On the pebbling threshold of paths and the pebbling threshold spectrum

Czygrinow, A. & Hurlbert, G. H., Aug 6 2008, In : Discrete Mathematics. 308, 15, p. 3297-3307 11 p.

Research output: Contribution to journalArticle

2 Scopus citations
2007

Distributed approximation algorithms for weighted problems in minor-closed families

Czygrinow, A. & Hańćkowiak, M., Jan 1 2007, Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings. Springer Verlag, p. 515-525 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4598 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations

Distributed approximations for packing in unit-disk graphs

Czygrinow, A. & Hańćkowiak, M., Dec 1 2007, Distributed Computing - 21st International Symposium, DISC 2007, Proceedings. p. 152-164 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4731 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations
2006

Distributed algorithms for weighted problems in sparse graphs

Czygrinow, A. & Hańćkowiak, M., Dec 1 2006, In : Journal of Discrete Algorithms. 4, 4, p. 588-607 20 p.

Research output: Contribution to journalArticle

6 Scopus citations

Distributed approximation algorithms for planar graphs

Czygrinow, A., Hańćkowiak, M. & Szymańska, E., Jan 1 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Verlag, p. 296-307 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Distributed approximation algorithms in unit-disk graphs

Czygrinow, A. & Hańćkowiak, M., Jan 1 2006, Distributed Computing - 20th International Symposium, DISC 2006, Proceedings. Springer Verlag, p. 385-398 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4167 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

Girth, pebbling, and grid thresholds

Czygrinow, A. & Hurlbert, G., Dec 1 2006, In : SIAM Journal on Discrete Mathematics. 20, 1, p. 1-10 10 p.

Research output: Contribution to journalArticle

5 Scopus citations
2004
13 Scopus citations

Bounding the strong chromatic index of dense random graphs

Czygrinow, A. & Nagle, B., Apr 28 2004, In : Discrete Mathematics. 281, 1-3, p. 129-136 8 p.

Research output: Contribution to journalArticle

4 Scopus citations

Distributed algorithm for approximating the maximum matching

Czygrinow, A., Hańćkowiak, M. & Szymańska, E., Sep 30 2004, In : Discrete Applied Mathematics. 143, 1-3, p. 62-71 10 p.

Research output: Contribution to journalArticle

11 Scopus citations

Strong edge colorings of uniform graphs

Czygrinow, A. & Nagle, B., Sep 28 2004, In : Discrete Mathematics. 286, 3, p. 219-223 5 p.

Research output: Contribution to journalArticle

1 Scopus citations
2003
14 Scopus citations

Matrix-free proof of a regularity characterization

Czygrinow, A. & Nagle, B., Oct 13 2003, In : Electronic Journal of Combinatorics. 10, 1 R

Research output: Contribution to journalArticle

1 Scopus citations

Pebbling in dense graphs

Czygrinow, A. & Hurlbert, G., Dec 1 2003, In : Australasian Journal of Combinatorics. 28, p. 201-208 8 p.

Research output: Contribution to journalArticle

5 Scopus citations

Thresholds for families of multisets, with an application to graph pebbling

Bekmetjev, A., Brightwell, G., Czygrinow, A. & Hurlbert, G., Jul 28 2003, In : Discrete Mathematics. 269, 1-3, p. 21-34 14 p.

Research output: Contribution to journalArticle

14 Scopus citations
2002

2-factors in dense bipartite graphs

Czygrinow, A. & Kierstead, H., Nov 28 2002, In : Discrete Mathematics. 257, 2-3, p. 357-369 13 p.

Research output: Contribution to journalConference article

Open Access
10 Scopus citations

A note on graph pebbling

Czygrinow, A., Hurlbert, G., Kierstead, H. & Trotter, W. T., Dec 1 2002, In : Graphs and Combinatorics. 18, 2, p. 219-225 7 p.

Research output: Contribution to journalArticle

13 Scopus citations

On pebbling threshold functions for graph sequences

Czygrinow, A., Eaton, N., Huribert, G. & Kayll, P. M., Mar 28 2002, In : Discrete Mathematics. 247, 1-3, p. 93-105 13 p.

Research output: Contribution to journalArticle

Open Access
13 Scopus citations
2001

Distributed O(Δ log n)-edge-coloring algorithm

Czygrinow, A., Hańćckowiak, M. & Karoński, M., 2001, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 2161. p. 345-355 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2161).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Scopus citations

Spanning trees of bounded degree

Czygrinow, A., Fan, G., Hurlbert, G., Kierstead, H. & Trotter, W. T., Dec 1 2001, In : Electronic Journal of Combinatorics. 8, 1 R, p. 1-12 12 p.

Research output: Contribution to journalArticle

9 Scopus citations
2000

An algorithmic regularity lemma for hypergraphs

Czygrinow, A. & Rödl, V., Jan 1 2000, In : SIAM Journal on Computing. 30, 4, p. 1041-1066 26 p.

Research output: Contribution to journalArticle

20 Scopus citations

Maximum dispersion problem in dense graphs

Czygrinow, A., Dec 2000, In : Operations Research Letters. 27, 5, p. 223-227 5 p.

Research output: Contribution to journalArticle

12 Scopus citations

Polling primitive for computer networks

Czygrinow, A., Karoński, M. & Sunderam, V., Jun 1 2000, In : Informatica (Ljubljana). 24, 2, p. 211-216 6 p.

Research output: Contribution to journalArticle

1999

Constructive quasi-ramsey numbers and tournament ranking

Czygrinow, A., Poljak, S. & Rödl, V., Jan 1 1999, In : SIAM Journal on Discrete Mathematics. 12, 1, p. 48-63 16 p.

Research output: Contribution to journalArticle

20 Scopus citations
1995

Polling primitive for hypercube networks

Czygrinow, A., Karonski, M. & Sunderam, V. S., 1995, IEEE Symposium on Parallel and Distributed Processing - Proceedings. IEEE, p. 138-144 7 p.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations