| Year |
Citation |
Score |
| 2020 |
Czygrinow A, Hanćkowiak M, Wawrzyniak W, Witkowski M. Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs Theoretical Computer Science. 809: 327-338. DOI: 10.1016/J.Tcs.2019.12.027 |
0.593 |
|
| 2019 |
Oursler R, Czygrinow A. Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs Siam Journal On Discrete Mathematics. 33: 1912-1931. DOI: 10.1137/17M1153662 |
0.473 |
|
| 2019 |
Czygrinow A, Hanćkowiak M, Wawrzyniak W, Witkowski M. Distributed CONGESTBC constant approximation of MDS in bounded genus graphs Theoretical Computer Science. 757: 1-10. DOI: 10.1016/J.Tcs.2018.07.008 |
0.466 |
|
| 2019 |
Czygrinow A, Hurlbert G, Katona GY, Papp LF. Optimal pebbling number of graphs with given minimum degree Discrete Applied Mathematics. 260: 117-130. DOI: 10.1016/J.Dam.2019.01.023 |
0.566 |
|
| 2018 |
Czygrinow A, DeBiasio L, Molla T, Treglown A. Tiling directed graphs with tournaments Forum of Mathematics, Sigma. 6. DOI: 10.1017/Fms.2018.2 |
0.527 |
|
| 2017 |
Czygrinow A, Hanckowiak M, Szymanska E, Wawrzyniak W, Witkowski M. Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs Theoretical Computer Science. 662: 1-8. DOI: 10.1016/J.Tcs.2016.12.001 |
0.469 |
|
| 2016 |
Czygrinow A, Hanćkowiak M, Szymańska E, Wawrzyniak W. On the distributed complexity of the semi-matching problem Journal of Computer and System Sciences. 82: 1251-1267. DOI: 10.1016/J.Jcss.2016.05.001 |
0.435 |
|
| 2015 |
Czygrinow A, Debiasio L, Kierstead HA, Molla T. An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs Combinatorics Probability and Computing. 24: 754-773. DOI: 10.1017/S0963548314000716 |
0.569 |
|
| 2015 |
Czygrinow A. Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs Journal of Graph Theory. DOI: 10.1002/Jgt.21998 |
0.425 |
|
| 2014 |
Czygrinow A, Molla T. Tight codegree condition for the existence of loose hamilton cycles in 3-graphs Siam Journal On Discrete Mathematics. 28: 67-76. DOI: 10.1137/120890417 |
0.473 |
|
| 2014 |
Czygrinow A, Kierstead HA, Molla T. On directed versions of the Corrádi-Hajnal corollary European Journal of Combinatorics. 42: 1-14. DOI: 10.1016/J.Ejc.2014.05.006 |
0.488 |
|
| 2014 |
Czygrinow A, Hanćkowiak M, Szymańska E, Wawrzyniak W, Witkowski M. Distributed local approximation of the minimum k-tuple dominating set in planar graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8878: 49-59. |
0.419 |
|
| 2012 |
Czygrinow A, Kamat V. Tight co-degree condition for perfect matchings in 4-graphs Electronic Journal of Combinatorics. 19: 20. DOI: 10.37236/2338 |
0.479 |
|
| 2012 |
Czygrinow A, Hanćkowiak M, Szymańska E, Wawrzyniak W. Distributed 2-Approximation Algorithm for the Semi-matching Problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 7611: 210-222. DOI: 10.1007/978-3-642-33651-5_15 |
0.365 |
|
| 2012 |
Czygrinow A, Kamat V. Tight co-degree condition for perfect matchings in 4-graphs Electronic Journal of Combinatorics. 19: 1-16. |
0.41 |
|
| 2011 |
Czygrinow A, Debiasio L. A note on bipartite graph tiling Siam Journal On Discrete Mathematics. 25: 1477-1489. DOI: 10.1137/100788203 |
0.535 |
|
| 2011 |
Czygrinow A, Hanćkowiak M, Krzywdziński K, Szymańska E, Wawrzyniak W. Brief announcement: Distributed approximations for the semi-matching problem Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6950: 200-201. DOI: 10.1007/978-3-642-24100-0_18 |
0.332 |
|
| 2011 |
Czygrinow A, Nagle B. On random sampling in uniform hypergraphs Random Structures and Algorithms. 38: 422-440. DOI: 10.1002/Rsa.20326 |
0.41 |
|
| 2010 |
Czygrinow A, Debiasio L, Kierstead HA. 2-Factors of bipartite graphs with asymmetric minimum degrees Siam Journal On Discrete Mathematics. 24: 486-504. DOI: 10.1137/080739513 |
0.451 |
|
| 2009 |
Czygrinow A, Hańćkowiak M, Szymańska E. Fast distributed approximation algorithm for the maximum matching problem in bounded arboricity graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5878: 668-678. DOI: 10.1007/978-3-642-10631-6_68 |
0.512 |
|
| 2008 |
Czygrinow A, Hańćkowiak M, Wawrzyniak W. Distributed packing in planar graphs Annual Acm Symposium On Parallelism in Algorithms and Architectures. 55-61. DOI: 10.1145/1378533.1378541 |
0.492 |
|
| 2008 |
Czygrinow A, Hurlbert GH. On the pebbling threshold of paths and the pebbling threshold spectrum Discrete Mathematics. 308: 3297-3307. DOI: 10.1016/J.Disc.2007.06.045 |
0.483 |
|
| 2008 |
Czygrinow A, Hańćkowiak M, Wawrzyniak W. Fast distributed approximations in planar graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5218: 78-92. DOI: 10.1007/978-3-540-87779-0_6 |
0.448 |
|
| 2007 |
Czygrinow A, Hańćkowiak M. Distributed approximations for packing in unit-disk graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4731: 152-164. |
0.478 |
|
| 2007 |
Czygrinow A, Hańćkowiak M. Distributed approximation algorithms for weighted problems in minor-closed families Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4598: 515-525. |
0.322 |
|
| 2006 |
Czygrinow A, Hurlbert G. Girth, pebbling, and grid thresholds Siam Journal On Discrete Mathematics. 20: 1-10. DOI: 10.1137/S0895480102416374 |
0.519 |
|
| 2006 |
Czygrinow A, Hańćkowiak M. Distributed algorithms for weighted problems in sparse graphs Journal of Discrete Algorithms. 4: 588-607. DOI: 10.1016/J.Jda.2005.07.006 |
0.49 |
|
| 2006 |
Czygrinow A, Hańćkowiak M, Szymańska E. Distributed approximation algorithms for planar graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3998: 296-307. DOI: 10.1007/11758471_29 |
0.416 |
|
| 2006 |
Czygrinow A, Hańćkowiak M. Distributed approximation algorithms in unit-disk graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4167: 385-398. |
0.508 |
|
| 2004 |
Czygrinow A, Nagle B. Strong edge colorings of uniform graphs Discrete Mathematics. 286: 219-223. DOI: 10.1016/J.Disc.2004.04.011 |
0.546 |
|
| 2004 |
Czygrinow A, Nagle B. Bounding the strong chromatic index of dense random graphs Discrete Mathematics. 281: 129-136. DOI: 10.1016/J.Disc.2003.09.009 |
0.476 |
|
| 2004 |
Czygrinow A, Hańćkowiak M, Szymańska E. Distributed algorithm for approximating the maximum matching Discrete Applied Mathematics. 143: 62-71. DOI: 10.1016/J.Dam.2003.10.004 |
0.506 |
|
| 2004 |
Czygrinow A, Hańćkowiak M, Szymańska E. A fast distributed algorithm for approximating the maximum matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3221: 252-263. |
0.364 |
|
| 2003 |
Bekmetjev A, Brightwell G, Czygrinow A, Hurlbert G. Thresholds for families of multisets, with an application to graph pebbling Discrete Mathematics. 269: 21-34. DOI: 10.1016/S0012-365X(02)00745-8 |
0.491 |
|
| 2003 |
Czygrinow A, Hańćkowiak M. Distributed algorithm for better approximation of the maximum matching Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2697: 242-251. |
0.376 |
|
| 2003 |
Czygrinow A, Hurlbert G. Pebbling in dense graphs Australasian Journal of Combinatorics. 28: 201-208. |
0.543 |
|
| 2002 |
Czygrinow A. Partitioning problems in dense hypergraphs Discrete Applied Mathematics. 116: 179-191. DOI: 10.1016/S0166-218X(00)00323-1 |
0.378 |
|
| 2002 |
Czygrinow A, Kierstead HA. 2-factors in dense bipartite graphs Discrete Mathematics. 257: 357-369. DOI: 10.1016/S0012-365X(02)00435-1 |
0.522 |
|
| 2002 |
Czygrinow A, Eaton N, Huribert G, Kayll PM. On pebbling threshold functions for graph sequences Discrete Mathematics. 247: 93-105. DOI: 10.1016/S0012-365X(01)00163-7 |
0.496 |
|
| 2002 |
Czygrinow A, Hurlbert G, Kierstead HA, Trotter WT. A note on graph pebbling Graphs and Combinatorics. 18: 219-225. DOI: 10.1007/S003730200015 |
0.451 |
|
| 2001 |
Czygrinow A, Fan G, Hurlbert G, Kierstead HA, Trotter WT. Spanning trees of bounded degree Electronic Journal of Combinatorics. 8: 1-12. DOI: 10.37236/1577 |
0.498 |
|
| 2001 |
Czygrinow A, Hańćckowiak M, Karoński M. Distributed O(Δ log n)-edge-coloring algorithm Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2161: 345-355. |
0.419 |
|
| 2000 |
Czygrinow A, Rödl V. An Algorithmic Regularity Lemma for Hypergraphs Siam Journal On Computing. 30: 1041-1066. DOI: 10.1137/S0097539799351729 |
0.311 |
|
| 2000 |
Czygrinow A. Maximum dispersion problem in dense graphs Operations Research Letters. 27: 223-227. DOI: 10.1016/S0167-6377(00)00058-4 |
0.442 |
|
| 1999 |
Czygrinow A, Poljak S, Rödl V. Constructive quasi-ramsey numbers and tournament ranking Siam Journal On Discrete Mathematics. 12: 48-63. DOI: 10.1137/S0895480197318301 |
0.396 |
|
| Show low-probability matches. |