Andrzej Czygrinow

Assoc Professor

  • 341 Citations
  • 12 h-Index
1995 …2022
If you made any changes in Pure, your changes will be visible here soon.

Research Output 1995 2019

  • 341 Citations
  • 12 h-Index
  • 33 Article
  • 13 Conference contribution
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

Minimum Degree
Graph in graph theory
Vertex of a graph
Connected graph
Equality
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

Approximation algorithms
Parallel algorithms

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

Parallel algorithms
Genus
Approximation
Graph in graph theory
Dominating Set
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

Approximation algorithms
Parallel algorithms
2 Citations (Scopus)

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

Local Algorithms
Local Approximation
Approximation algorithms
Dominating Set
Planar graph
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

Matching Problem
Servers
Server
Approximation algorithms
Deterministic Algorithm
2015
5 Citations (Scopus)

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

Directed graphs
Directed Graph
Tournament
Disjoint
Theorem
2 Citations (Scopus)

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

Czygrinow, A., 2015, (Accepted/In press) In : Journal of Graph Theory.

Research output: Contribution to journalArticle

Degree Condition
Uniform Hypergraph
Packing
Cycle
Integer
2014
1 Citation (Scopus)

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., 2014, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Vol. 8878. 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

Local Approximation
Dominating Set
Planar graph
Approximation
Vertex of a graph
7 Citations (Scopus)

On directed versions of the Corrádi-Hajnal corollary

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

Research output: Contribution to journalArticle

Directed graphs
Corollary
Directed Graph
Cycle
Multigraph
11 Citations (Scopus)

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

Hamilton Cycle
Graph in graph theory
13 Citations (Scopus)

Tiling 3-uniform hypergraphs with K4 3-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

Uniform Hypergraph
Tiling
Integer
Denote
Divisible
2012
12 Citations (Scopus)

Distributed 2-Approximation Algorithm for the Semi-matching Problem

Czygrinow, A., Hanćkowiak, M., Szymańska, E. & Wawrzyniak, W., 2012, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7611 LNCS. 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

Approximation algorithms
Matching Problem
Approximation Algorithms
Servers
Server
17 Citations (Scopus)

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

Degree Condition
Uniform Hypergraph
Perfect Matching
Graph in graph theory
2011
3 Citations (Scopus)

A note on bipartite graph tiling

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

Research output: Contribution to journalArticle

Degree Condition
Minimum Degree
Tiling
Bipartite Graph
Disjoint
4 Citations (Scopus)

Brief announcement: Distributed approximations for the semi-matching problem

Czygrinow, A., Hanćkowiak, M., Krzywdziński, K., Szymańska, E. & Wawrzyniak, W., 2011, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6950 LNCS. 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

Matching Problem
Bipartite Graph
Servers
Server
Costs
1 Citation (Scopus)

On random sampling in uniform hypergraphs

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

Research output: Contribution to journalArticle

Uniform Hypergraph
Random Sampling
Sampling
Lemma
Hypergraph
2010
1 Citation (Scopus)

2-Factors of bipartite graphs with asymmetric minimum degrees

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

Research output: Contribution to journalArticle

Number of Components
Minimum Degree
Bipartite Graph
2009
7 Citations (Scopus)

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

Czygrinow, A., Hańćkowiak, M. & Szymańska, E., 2009, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5878 LNCS. 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

Arboricity
Maximum Matching
Approximation algorithms
Matching Problem
Distributed Algorithms
2008
6 Citations (Scopus)

Distributed packing in planar graphs

Czygrinow, A., Hańćkowiak, M. & Wawrzyniak, W., 2008, Annual ACM Symposium on Parallelism in Algorithms and Architectures. p. 55-61 7 p.

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

Distributed Algorithms
Parallel algorithms
Planar graph
Packing
Logarithmic
53 Citations (Scopus)

Fast distributed approximations in planar graphs

Czygrinow, A., Hańćkowiak, M. & Wawrzyniak, W., 2008, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 5218 LNCS. 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

Deterministic Algorithm
Planar graph
Maximum Independent Set
Maximum Matching
Beat
2 Citations (Scopus)

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

Path
Multiset
Binomial Model
Configuration
Graph in graph theory
2007
4 Citations (Scopus)

Distributed approximation algorithms for weighted problems in minor-closed families

Czygrinow, A. & Hańćkowiak, M., 2007, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4598 LNCS. 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

Approximation algorithms
Distributed Algorithms
Parallel algorithms
Approximation Algorithms
Minor
2 Citations (Scopus)

Distributed approximations for packing in unit-disk graphs

Czygrinow, A. & Hańćkowiak, M., 2007, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4731 LNCS. 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

Unit Disk Graph
Packing
Approximately equal
Packing Problem
Message passing
2006
6 Citations (Scopus)

Distributed algorithms for weighted problems in sparse graphs

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

Research output: Contribution to journalArticle

Sparse Graphs
Distributed Algorithms
Parallel algorithms
Planar graph
Deterministic Algorithm

Distributed approximation algorithms for planar graphs

Czygrinow, A., Hańćkowiak, M. & Szymańska, E., 2006, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3998 LNCS. 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

Approximation algorithms
Distributed Algorithms
Parallel algorithms
Planar graph
Approximation Algorithms
5 Citations (Scopus)

Distributed approximation algorithms in unit-disk graphs

Czygrinow, A. & Hańćkowiak, M., 2006, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 4167 LNCS. 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

Unit Disk Graph
Connected Dominating Set
Maximum Matching
Message passing
Approximation algorithms
5 Citations (Scopus)

Girth, pebbling, and grid thresholds

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

Research output: Contribution to journalArticle

Girth
Grid
Minimum Degree
Graph in graph theory
Graph Connectivity
2004
13 Citations (Scopus)
Maximum Matching
Distributed Algorithms
Parallel algorithms
Fast Algorithm
Models of Computation
4 Citations (Scopus)

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

Chromatic Index
Edge Coloring
Coloring
Random Graphs
Induced Matching
11 Citations (Scopus)

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

Spanners
Maximum Matching
Distributed Algorithms
Parallel algorithms
Multigraph
1 Citation (Scopus)

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

Edge Coloring
Coloring
Chromatic Index
Regular Graph
Graph in graph theory
2003
13 Citations (Scopus)
Odd Cycle
Maximum Matching
Distributed Algorithms
Parallel algorithms
Efficient Algorithms
1 Citation (Scopus)

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

Regularity Lemma
Regularity
Equate
Uniformity
Concepts
5 Citations (Scopus)

Pebbling in dense graphs

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

Research output: Contribution to journalArticle

Minimum Degree
Graph in graph theory
Configuration
Vertex of a graph
Bipartite Graph
14 Citations (Scopus)

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

Multiset
Analogue
Graph in graph theory
Upper and Lower Bounds
Corollary
2002
9 Citations (Scopus)

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 journalArticle

Ladders
Bipartite Graph
Minimum Degree
Vertex of a graph
13 Citations (Scopus)

A note on graph pebbling

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

Research output: Contribution to journalArticle

Graph in graph theory
Integer
Random Graphs
Connectivity
Upper bound
13 Citations (Scopus)

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

Threshold Function
Graph in graph theory
Stars
Wheels
Vertex of a graph
2001
13 Citations (Scopus)

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

Edge Coloring
Coloring
Distributed Algorithms
Maximum Degree
Parallel algorithms
9 Citations (Scopus)

Spanning trees of bounded degree

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

Research output: Contribution to journalArticle

Spanning tree
Independent Set
Maximum Degree
Hamilton Path
Caterpillar
2000
20 Citations (Scopus)

An algorithmic regularity lemma for hypergraphs

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

Research output: Contribution to journalArticle

Regularity Lemma
Uniform Hypergraph
Hypergraph
Efficient Algorithms
Partition
12 Citations (Scopus)

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

Polynomials
Regularity Lemma
Integer
Weighted Graph
Graph in graph theory

Polling primitive for computer networks

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

Research output: Contribution to journalArticle

Polling
Computer Networks
Computer networks
Hypercube networks
Distributed computer systems
1999
20 Citations (Scopus)

Constructive quasi-ramsey numbers and tournament ranking

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

Research output: Contribution to journalArticle

Ramsey number
Tournament
Ranking
Linear Ordering Problem
Polynomials
1995
1 Citation (Scopus)

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

Hypercube networks
Distributed computer systems
Synchronization
Semantics
Communication