Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths. - Attila Joó (J. Graph Theory, 2016)

King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments. - Kristóf Bérczi; Attila Joó (Electron. J. Comb., 2017)

$T$-Joins in Infinite Graphs. - Attila Joó (Electron. J. Comb., 2017)

Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair. - Attila Joó (J. Graph Theory, 2017)

Countable Menger's Theorem with Finitary Matroid Constraints on the Ingoing Edges. - Attila Joó (Electron. J. Comb., 2018)

Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs. - Attila Joó (J. Graph Theory, 2018)

Gomory-Hu trees of infinite graphs with finite total weight. - Attila Joó (J. Graph Theory, 2018)

Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex. - Attila Joó (Comb., 2019)

On the growth rate of dichromatic numbers of finite subdigraphs. - Attila Joó (Discret. Math., 2020)

Reducing the dichromatic number via cycle reversions in infinite digraphs. - Paul Ellis; Attila Joó; Dániel T. Soukup (Eur. J. Comb., 2020)

Uncountable dichromatic number without short directed cycles. - Attila Joó (J. Graph Theory, 2020)

Base Partition for Mixed Families of Finitary and Cofinitary Matroids. - Joshua Erde; J. Pascal Gollin; Attila Joó; Paul Knappe; Max Pitz (Comb., 2021)

Intersection of a partitional and a general infinite matroid. - Attila Joó (Discret. Math., 2021)

Enlarging vertex-flames in countable digraphs. - Joshua Erde; J. Pascal Gollin; Attila Joó (J. Comb. Theory B, 2021)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. - Joshua Erde; J. Pascal Gollin; Attila Joó; Paul Knappe; Max Pitz (J. Comb. Theory B, 2021)

Greedoids from flames. - Attila Joó (J. Graph Theory, 2021)

Cutting a Cake for Infinitely Many Guests. - Zsuzsanna Jankó; Attila Joó (Electron. J. Comb., 2022)

On Connected Strongly-Proportional Cake-Cutting. - Zsuzsanna Jankó; Attila Joó; Erel Segal-Halevi (CoRR, 2023)

Maker-Breaker Games on and. - Nathan J. Bowler; Florian Gut; Attila Joó; Max Pitz (J. Symb. Log., 2023)

The Lovász-Cherkassky theorem in countable graphs. - Attila Joó (J. Comb. Theory B, 2023)

The Lovász-Cherkassky theorem for locally finite graphs with ends. - Raphael W. Jacobs; Attila Joó; Paul Knappe; Jan Kurkofka; Ruben Melcher (Discret. Math., 2023)

On Connected Strongly-Proportional Cake-Cutting. - Zsuzsanna Jankó; Attila Joó; Erel Segal-Halevi; Sheung Man Yuen (ECAI, 2024)

Finite matchability under the matroidal Hall's condition. - Attila Joó (J. Comb. Theory B, 2024)

Hindrance from a Wasteful Partial Linkage. - Attila Joó (Electron. J. Comb., 2025)