Andrzej Czygrinow

From MaRDI portal
Person:404437

Available identifiers

zbMath Open czygrinow.andrzejMaRDI QIDQ404437

List of research outcomes





PublicationDate of PublicationType
Distributed approximation for \(f\)-matching2024-10-07Paper
https://portal.mardi4nfdi.de/entity/Q61878272024-01-15Paper
Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs2022-07-21Paper
Distributed distance domination in graphs with no \(K_{2,t}\)-minor2022-05-31Paper
On even rainbow or nontriangular directed cycles2022-02-03Paper
On odd rainbow cycles in edge-colored graphs2021-04-14Paper
Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs2020-01-29Paper
Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs2019-10-28Paper
Optimal pebbling number of graphs with given minimum degree2019-05-03Paper
TILING DIRECTED GRAPHS WITH TOURNAMENTS2019-03-12Paper
Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs2019-01-18Paper
Even cycles in dense graphs2018-06-25Paper
Balanced Spanning Caterpillars2017-11-29Paper
An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs2017-10-04Paper
Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs2017-01-09Paper
Tight co-degree condition for packing of loose cycles in 3-graphs2016-11-17Paper
On the distributed complexity of the semi-matching problem2016-08-04Paper
On directed versions of the Corrádi-Hajnal corollary2014-09-04Paper
Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs2014-06-19Paper
Tiling 3-uniform hypergraphs with \(K_4^3-2e\)2014-01-28Paper
Tiling in bipartite graphs with asymmetric minimum degrees2013-10-01Paper
Distributed 2-Approximation Algorithm for the Semi-matching Problem2013-03-13Paper
Tight co-degree condition for perfect matchings in 4-graphs2012-06-12Paper
A Note on Bipartite Graph Tiling2012-03-15Paper
Brief Announcement: Distributed Approximations for the Semi-matching Problem2011-10-28Paper
On random sampling in uniform hypergraphs2011-08-09Paper
2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees2011-04-15Paper
Distributed Algorithm for Better Approximation of the Maximum Matching2011-03-18Paper
Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs2009-12-17Paper
Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families2009-03-06Paper
Fast Distributed Approximations in Planar Graphs2008-11-20Paper
Distributed Approximation Algorithms in Unit-Disk Graphs2008-09-09Paper
Distributed Approximations for Packing in Unit-Disk Graphs2008-09-02Paper
On the pebbling threshold of paths and the pebbling threshold spectrum2008-07-11Paper
Distributed Almost Exact Approximations for Minor-Closed Families2008-03-11Paper
Distributed Approximation Algorithms for Planar Graphs2007-05-02Paper
Distributed algorithms for weighted problems in sparse graphs2007-02-14Paper
Girth, Pebbling, and Grid Thresholds2006-06-01Paper
Algorithms – ESA 20042005-08-18Paper
Distributed algorithm for approximating the maximum matching2004-11-23Paper
Strong edge colorings of uniform graphs2004-11-22Paper
Bounding the strong chromatic index of dense random graphs2004-08-06Paper
Matrix-free proof of a regularity characterization2004-02-05Paper
Thresholds for families of multisets, with an application to graph pebbling2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q47961862003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q44329412003-01-01Paper
2-factors in dense bipartite graphs2002-12-02Paper
A note on graph pebbling2002-07-29Paper
Partitioning problems in dense hypergraphs2002-06-19Paper
On pebbling threshold functions for graph sequences2002-05-28Paper
Spanning trees of bounded degree2001-12-11Paper
A note on codegree problems for hypergraphs2001-10-21Paper
Maximum dispersion problem in dense graphs2001-01-01Paper
An Algorithmic Regularity Lemma for Hypergraphs2000-10-18Paper
Constructive Quasi-Ramsey Numbers and Tournament Ranking1999-06-27Paper

Research outcomes over time

This page was built for person: Andrzej Czygrinow