default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Czygrinow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j36]Andrzej Czygrinow, Michal Hanckowiak
, Andrzej Ruminski, Marcin Witkowski:
Distributed approximation for f-matching. Theor. Comput. Sci. 1014: 114760 (2024)- 2022
- [j35]Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski:
Distributed distance domination in graphs with no K2, t-minor. Theor. Comput. Sci. 916: 22-30 (2022) - [i1]Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski:
Distributed distance domination in graphs with no K2,t-minor. CoRR abs/2203.03229 (2022) - 2021
- [j34]Andrzej Czygrinow, Theodore Molla, Brendan Nagle, Roy Oursler:
On odd rainbow cycles in edge-colored graphs. Eur. J. Comb. 94: 103316 (2021) - [c18]Andrzej Czygrinow, Michal Hanckowiak, Marcin Witkowski:
Distributed Approximations of f-Matchings and b-Matchings in Graphs of Sub-Logarithmic Expansion. ISAAC 2021: 59:1-59:13 - 2020
- [j33]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed approximation algorithms for k-dominating set in graphs of bounded genus and linklessly embeddable graphs. Theor. Comput. Sci. 809: 327-338 (2020)
2010 – 2019
- 2019
- [j32]Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp:
Optimal pebbling number of graphs with given minimum degree. Discret. Appl. Math. 260: 117-130 (2019) - [j31]Roy Oursler, Andrzej Czygrinow:
Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs. SIAM J. Discret. Math. 33(4): 1912-1931 (2019) - [j30]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed CONGESTBC constant approximation of MDS in bounded genus graphs. Theor. Comput. Sci. 757: 1-10 (2019) - 2018
- [c17]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak, Marcin Witkowski:
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs. ISAAC 2018: 22:1-22:12 - 2017
- [j29]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: 1-8 (2017) - [c16]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: 75-86 - 2016
- [j28]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak:
On the distributed complexity of the semi-matching problem. J. Comput. Syst. Sci. 82(8): 1251-1267 (2016) - [j27]Andrzej Czygrinow:
Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs. J. Graph Theory 83(4): 317-333 (2016) - 2015
- [j26]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): 754-773 (2015) - 2014
- [j25]Andrzej Czygrinow, Hal A. Kierstead, Theodore Molla:
On directed versions of the Corrádi-Hajnal corollary. Eur. J. Comb. 42: 1-14 (2014) - [j24]Andrzej Czygrinow, Louis DeBiasio, Brendan Nagle:
Tiling 3-Uniform Hypergraphs With K43-2e. J. Graph Theory 75(2): 124-136 (2014) - [j23]Andrzej Czygrinow, Theodore Molla:
Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs. SIAM J. Discret. Math. 28(1): 67-76 (2014) - [c15]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: 49-59 - 2012
- [j22]Andrzej Czygrinow, Vikram Kamat:
Tight Co-Degree Condition for Perfect Matchings in 4-Graphs. Electron. J. Comb. 19(2): 20 (2012) - [c14]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska, Wojciech Wawrzyniak:
Distributed 2-Approximation Algorithm for the Semi-matching Problem. DISC 2012: 210-222 - 2011
- [j21]Andrzej Czygrinow, Brendan Nagle:
On random sampling in uniform hypergraphs. Random Struct. Algorithms 38(4): 422-440 (2011) - [j20]Andrzej Czygrinow, Louis DeBiasio:
A Note on Bipartite Graph Tiling. SIAM J. Discret. Math. 25(4): 1477-1489 (2011) - [c13]Andrzej Czygrinow, Michal Hanckowiak, Krzysztof Krzywdzinski, Edyta Szymanska, Wojciech Wawrzyniak:
Brief Announcement: Distributed Approximations for the Semi-matching Problem. DISC 2011: 200-201 - 2010
- [j19]Andrzej Czygrinow, Louis DeBiasio, Hal A. Kierstead:
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees. SIAM J. Discret. Math. 24(2): 486-504 (2010)
2000 – 2009
- 2009
- [c12]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska:
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs. ISAAC 2009: 668-678 - 2008
- [j18]Andrzej Czygrinow, Glenn H. Hurlbert:
On the pebbling threshold of paths and the pebbling threshold spectrum. Discret. Math. 308(15): 3297-3307 (2008) - [c11]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak:
Distributed packing in planar graphs. SPAA 2008: 55-61 - [c10]Andrzej Czygrinow, Michal Hanckowiak, Wojciech Wawrzyniak:
Fast Distributed Approximations in Planar Graphs. DISC 2008: 78-92 - 2007
- [c9]Andrzej Czygrinow, Michal Hanckowiak:
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families. COCOON 2007: 515-525 - [c8]Andrzej Czygrinow, Michal Hanckowiak:
Distributed Approximations for Packing in Unit-Disk Graphs. DISC 2007: 152-164 - 2006
- [j17]Andrzej Czygrinow, Michal Hanckowiak:
Distributed algorithms for weighted problems in sparse graphs. J. Discrete Algorithms 4(4): 588-607 (2006) - [j16]Andrzej Czygrinow, Glenn Hurlbert:
Girth, Pebbling, and Grid Thresholds. SIAM J. Discret. Math. 20(1): 1-10 (2006) - [c7]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska:
Distributed Approximation Algorithms for Planar Graphs. CIAC 2006: 296-307 - [c6]Andrzej Czygrinow, Michal Hanckowiak:
Distributed Almost Exact Approximations for Minor-Closed Families. ESA 2006: 244-255 - [c5]Andrzej Czygrinow, Michal Hanckowiak:
Distributed Approximation Algorithms in Unit-Disk Graphs. DISC 2006: 385-398 - 2004
- [j15]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska:
Distributed algorithm for approximating the maximum matching. Discret. Appl. Math. 143(1-3): 62-71 (2004) - [j14]Andrzej Czygrinow, Brendan Nagle:
Bounding the strong chromatic index of dense random graphs. Discret. Math. 281(1-3): 129-136 (2004) - [j13]Andrzej Czygrinow, Brendan Nagle:
Strong edge colorings of uniform graphs. Discret. Math. 286(3): 219-223 (2004) - [c4]Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska:
A Fast Distributed Algorithm for Approximating the Maximum Matching. ESA 2004: 252-263 - 2003
- [j12]Andrzej Czygrinow, Glenn Hurlbert:
Pebbling in dense graphs. Australas. J Comb. 28: 201-208 (2003) - [j11]Andrzej Czygrinow, Brendan Nagle:
Matrix-Free Proof of a Regularity Characterization. Electron. J. Comb. 10 (2003) - [j10]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): 21-34 (2003) - [c3]Andrzej Czygrinow, Michal Hanckowiak:
Distributed Algorithm for Better Approximation of the Maximum Matching. COCOON 2003: 242-251 - 2002
- [j9]Andrzej Czygrinow:
Partitioning problems in dense hypergraphs. Discret. Appl. Math. 116(3): 179-191 (2002) - [j8]Andrzej Czygrinow, Nancy Eaton, Glenn H. Hurlbert, P. Mark Kayll:
On pebbling threshold functions for graph sequences. Discret. Math. 247(1-3): 93-105 (2002) - [j7]Andrzej Czygrinow, Henry A. Kierstead:
2-factors in dense bipartite graphs. Discret. Math. 257(2-3): 357-369 (2002) - [j6]Andrzej Czygrinow, Glenn Hurlbert, Hal A. Kierstead, William T. Trotter:
A Note on Graph Pebbling. Graphs Comb. 18(2): 219-225 (2002) - 2001
- [j5]Andrzej Czygrinow, Genghua Fan, Glenn Hurlbert, Henry A. Kierstead, William T. Trotter:
Spanning Trees of Bounded Degree. Electron. J. Comb. 8(1) (2001) - [c2]Andrzej Czygrinow, Michal Hanckowiak, Michal Karonski:
Distributed O(Delta log(n))-Edge-Coloring Algorithm. ESA 2001: 345-355 - 2000
- [j4]Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam:
The Polling Primitive for Computer Networks. Informatica (Slovenia) 24(2) (2000) - [j3]Andrzej Czygrinow:
Maximum dispersion problem in dense graphs. Oper. Res. Lett. 27(5): 223-227 (2000) - [j2]Andrzej Czygrinow, Vojtech Rödl:
An Algorithmic Regularity Lemma for Hypergraphs. SIAM J. Comput. 30(4): 1041-1066 (2000)
1990 – 1999
- 1999
- [j1]Andrzej Czygrinow, Svatopluk Poljak, Vojtech Rödl:
Constructive Quasi-Ramsey Numbers and Tournament Ranking. SIAM J. Discret. Math. 12(1): 48-63 (1999) - 1995
- [c1]Andrzej Czygrinow, Michal Karonski, Vaidy S. Sunderam:
The polling primitive for hypercube networks. SPDP 1995: 138-144
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
