Andrzej Czygrinow
Affiliations: | Mathematics | Arizona State University, Tempe, AZ, United States |
Area:
Mathematics, Applied MathematicsGoogle:
"Andrzej Czygrinow"
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Czygrinow A, Hanćkowiak M, Wawrzyniak W, et al. (2020) Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Theoretical Computer Science. 809: 327-338 |
Oursler R, Czygrinow A. (2019) Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs Siam Journal On Discrete Mathematics. 33: 1912-1931 |
Czygrinow A, Hanćkowiak M, Wawrzyniak W, et al. (2019) Distributed CONGESTBC constant approximation of MDS in bounded genus graphs Theoretical Computer Science. 757: 1-10 |
Czygrinow A, Hurlbert G, Katona GY, et al. (2019) Optimal pebbling number of graphs with given minimum degree Discrete Applied Mathematics. 260: 117-130 |
Czygrinow A, DeBiasio L, Molla T, et al. (2018) Tiling directed graphs with tournaments Forum of Mathematics, Sigma. 6 |
Czygrinow A, Hanckowiak M, Szymanska E, et al. (2017) Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs Theoretical Computer Science. 662: 1-8 |
Czygrinow A, Hanćkowiak M, Szymańska E, et al. (2016) On the distributed complexity of the semi-matching problem Journal of Computer and System Sciences. 82: 1251-1267 |
Czygrinow A, Debiasio L, Kierstead HA, et al. (2015) An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs Combinatorics Probability and Computing. 24: 754-773 |
Czygrinow A. (2015) Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs Journal of Graph Theory |
Czygrinow A, Molla T. (2014) Tight codegree condition for the existence of loose hamilton cycles in 3-graphs Siam Journal On Discrete Mathematics. 28: 67-76 |