The following pages link to Andrzej Czygrinow (Q404437):
Displaying 50 items.
- (Q170018) (redirect page) (← links)
- On directed versions of the Corrádi-Hajnal corollary (Q404438) (← links)
- Tight co-degree condition for perfect matchings in 4-graphs (Q426891) (← links)
- Improved distributed local approximation algorithm for minimum 2-dominating set in planar graphs (Q501664) (← links)
- On the distributed complexity of the semi-matching problem (Q736606) (← links)
- Distributed algorithms for weighted problems in sparse graphs (Q866546) (← links)
- On the pebbling threshold of paths and the pebbling threshold spectrum (Q932604) (← links)
- Thresholds for families of multisets, with an application to graph pebbling (Q1402065) (← links)
- Matrix-free proof of a regularity characterization (Q1422124) (← links)
- On pebbling threshold functions for graph sequences (Q1598791) (← links)
- A note on graph pebbling (Q1606023) (← links)
- Distributed \(\mathcal{CONGEST}_{B C}\) constant approximation of MDS in bounded genus graphs (Q1711828) (← links)
- Optimal pebbling number of graphs with given minimum degree (Q1741506) (← links)
- Bounding the strong chromatic index of dense random graphs (Q1827703) (← links)
- 2-factors in dense bipartite graphs (Q1850018) (← links)
- Distributed algorithm for approximating the maximum matching (Q1887042) (← links)
- Strong edge colorings of uniform graphs (Q1887640) (← links)
- On even rainbow or nontriangular directed cycles (Q2073645) (← links)
- Distributed distance domination in graphs with no \(K_{2,t}\)-minor (Q2143127) (← links)
- Distributed approximation algorithms for \(k\)-dominating set in graphs of bounded genus and linklessly embeddable graphs (Q2290639) (← links)
- On odd rainbow cycles in edge-colored graphs (Q2662803) (← links)
- (Q2732632) (← links)
- Tight Co-Degree Condition for Packing of Loose Cycles in 3-Graphs (Q2833250) (← links)
- Tiling 3-Uniform Hypergraphs With K43−2e (Q2874094) (← links)
- Distributed Algorithm for Better Approximation of the Maximum Matching (Q3082932) (← links)
- Brief Announcement: Distributed Approximations for the Semi-matching Problem (Q3095327) (← links)
- TILING DIRECTED GRAPHS WITH TOURNAMENTS (Q3119461) (← links)
- A Note on Bipartite Graph Tiling (Q3225134) (← links)
- Distributed Approximation Algorithms for Planar Graphs (Q3434565) (← links)
- Distributed Approximations for Packing in Unit-Disk Graphs (Q3523205) (← links)
- Distributed Approximation Algorithms in Unit-Disk Graphs (Q3524320) (← links)
- Fast Distributed Approximations in Planar Graphs (Q3540222) (← links)
- Distributed Approximation Algorithms for Weighted Problems in Minor-Closed Families (Q3608875) (← links)
- Fast Distributed Approximation Algorithm for the Maximum Matching Problem in Bounded Arboricity Graphs (Q3652253) (← links)
- Constructive Quasi-Ramsey Numbers and Tournament Ranking (Q4255807) (← links)
- (Q4432941) (← links)
- An Algorithmic Regularity Lemma for Hypergraphs (Q4507384) (← links)
- (Q4796186) (← links)
- Distributed 2-Approximation Algorithm for the Semi-matching Problem (Q4909413) (← links)
- Tight Codegree Condition for the Existence of Loose Hamilton Cycles in 3-Graphs (Q4979823) (← links)
- Distributed Approximation Algorithms for the Minimum Dominating Set in K_h-Minor-Free Graphs (Q5091012) (← links)
- On random sampling in uniform hypergraphs (Q5198663) (← links)
- Tight Minimum Degree Condition for the Existence of Loose Cycle Tilings in 3-Graphs (Q5238742) (← links)
- An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs (Q5364255) (← links)
- 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees (Q5392905) (← links)
- Distributed Almost Exact Approximations for Minor-Closed Families (Q5449532) (← links)
- Algorithms – ESA 2004 (Q5464584) (← links)
- Girth, Pebbling, and Grid Thresholds (Q5470811) (← links)
- Maximum dispersion problem in dense graphs (Q5929139) (← links)
- Spanning trees of bounded degree (Q5947942) (← links)
