Andrzej Czygrinow

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 14

Top Topics

Approximation Algorithms

Top Venues

Theor. Comput. Sci.

SIAM J. Discret. Math.

Publications

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