Andrzej Czygrinow

55 papers A 8B 5C 1Misc 2Journal 37Unranked 2
YearRankTypeTitle / Venue / Authors
2024 J jnl
Distributed approximation for f-matching.
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Andrzej Ruminski, Marcin Witkowski
2022 J jnl
Distributed distance domination in graphs with no
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski
2022 J jnl
Distributed distance domination in graphs with no K
CoRR
Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski
2021 B conf
Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion.
ISAAC
Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski
2021 J jnl
On odd rainbow cycles in edge-colored graphs.
Eur. J. Comb.
Andrzej Czygrinow, Theodore Molla, Brendan Nagle, Roy Oursler
2020 J jnl
Distributed approximation algorithms for
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2019 J jnl
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs.
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2019 J jnl
Optimal pebbling number of graphs with given minimum degree.
Discret. Appl. Math.
Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp
2019 J jnl
Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs.
SIAM J. Discret. Math.
Roy Oursler, Andrzej Czygrinow
2018 B conf
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs.
ISAAC
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2017 — conf
Distributed Approximation Algorithms for k-dominating Set in Graphs of Bounded Genus and Linklessly Embeddable Graphs.
ICTCS/CILC
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski
2017 J jnl
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs.
Theor. Comput. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski
2016 J jnl
On the distributed complexity of the semi-matching problem.
J. Comput. Syst. Sci.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak
2016 J jnl
Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs.
J. Graph Theory
Andrzej Czygrinow
2015 J jnl
An Extension of the Hajnal-Szemerédi Theorem to Directed Graphs.
Comb. Probab. Comput.
Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead, Theodore Molla
2014 B conf
Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs.
OPODIS
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak, Marcin Witkowski
2014 J jnl
On directed versions of the Corrádi-Hajnal corollary.
Eur. J. Comb.
Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla
2014 J jnl
Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs.
SIAM J. Discret. Math.
Andrzej Czygrinow, Theodore Molla
2014 J jnl
Tiling 3-Uniform Hypergraphs With K43-2e.
J. Graph Theory
Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle
2012 A conf
Distributed 2-Approximation Algorithm for the Semi-matching Problem.
DISC
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak
2012 J jnl
Tight Co-Degree Condition for Perfect Matchings in 4-Graphs.
Electron. J. Comb.
Andrzej Czygrinow, Vikram Kamat
2011 J jnl
A Note on Bipartite Graph Tiling.
SIAM J. Discret. Math.
Andrzej Czygrinow, Louis DeBiasio
2011 A conf
Brief Announcement: Distributed Approximations for the Semi-matching Problem.
DISC
Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak
2011 J jnl
On random sampling in uniform hypergraphs.
Random Struct. Algorithms
Andrzej Czygrinow, Brendan Nagle
2010 J jnl
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees.
SIAM J. Discret. Math.
Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead
2009 B conf
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs.
ISAAC
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2008 B conf
Distributed packing in planar graphs.
SPAA
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak
2008 A conf
Fast Distributed Approximations in Planar Graphs.
DISC
Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak
2008 J jnl
On the pebbling threshold of paths and the pebbling threshold spectrum.
Discret. Math.
Andrzej Czygrinow, Glenn H. Hurlbert
2007 Misc conf
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families.
COCOON
Andrzej Czygrinow, Michal Hanckowiak
2007 A conf
Distributed Approximations for Packing in Unit-Disk Graphs.
DISC
Andrzej Czygrinow, Michal Hanckowiak
2006 A conf
Distributed Almost Exact Approximations for Minor-Closed Families.
ESA
Andrzej Czygrinow, Michal Hanckowiak
2006 C conf
Distributed Approximation Algorithms for Planar Graphs.
CIAC
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2006 A conf
Distributed Approximation Algorithms in Unit-Disk Graphs.
DISC
Andrzej Czygrinow, Michal Hanckowiak
2006 J jnl
Distributed algorithms for weighted problems in sparse graphs.
J. Discrete Algorithms
Andrzej Czygrinow, Michal Hanckowiak
2006 J jnl
Girth, Pebbling, and Grid Thresholds.
SIAM J. Discret. Math.
Andrzej Czygrinow, Glenn Hurlbert
2004 A conf
A Fast Distributed Algorithm for Approximating the Maximum Matching.
ESA
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2004 J jnl
Bounding the strong chromatic index of dense random graphs.
Discret. Math.
Andrzej Czygrinow, Brendan Nagle
2004 J jnl
Distributed algorithm for approximating the maximum matching.
Discret. Appl. Math.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2004 J jnl
Strong edge colorings of uniform graphs.
Discret. Math.
Andrzej Czygrinow, Brendan Nagle
2003 Misc conf
Distributed Algorithm for Better Approximation of the Maximum Matching.
COCOON
Andrzej Czygrinow, Michal Hanckowiak
2003 J jnl
Matrix-Free Proof of a Regularity Characterization.
Electron. J. Comb.
Andrzej Czygrinow, Brendan Nagle
2003 J jnl
Pebbling in dense graphs.
Australas. J Comb.
Andrzej Czygrinow, Glenn Hurlbert
2003 J jnl
Thresholds for families of multisets, with an application to graph pebbling.
Discret. Math.
Airat Bekmetjev, Graham R. Brightwell, Andrzej Czygrinow, Glenn Hurlbert
2002 J jnl
2-factors in dense bipartite graphs.
Discret. Math.
Andrzej Czygrinow, Henry A. Kierstead
2002 J jnl
A Note on Graph Pebbling.
Graphs Comb.
Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter
2002 J jnl
On pebbling threshold functions for graph sequences.
Discret. Math.
Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll
2002 J jnl
Partitioning problems in dense hypergraphs.
Discret. Appl. Math.
Andrzej Czygrinow
2001 A conf
Distributed O(Delta log(n))-Edge-Coloring Algorithm.
ESA
Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski
2001 J jnl
Spanning Trees of Bounded Degree.
Electron. J. Comb.
Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter
2000 J jnl
An Algorithmic Regularity Lemma for Hypergraphs.
SIAM J. Comput.
Andrzej Czygrinow, Vojtech Rödl
2000 J jnl
Maximum dispersion problem in dense graphs.
Oper. Res. Lett.
Andrzej Czygrinow
2000 J jnl
The Polling Primitive for Computer Networks.
Informatica (Slovenia)
Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam
1999 J jnl
Constructive Quasi-Ramsey Numbers and Tournament Ranking.
SIAM J. Discret. Math.
Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl
1995 — conf
The polling primitive for hypercube networks.
SPDP
Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam