default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAttila Joó
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j21]Attila Joó
:
Finite matchability under the matroidal Hall's condition. J. Comb. Theory B 167: 104-118 (2024)- 2023
- [j20]Raphael W. Jacobs, Attila Joó, Paul Knappe, Jan Kurkofka, Ruben Melcher:
The Lovász-Cherkassky theorem for locally finite graphs with ends. Discret. Math. 346(12): 113586 (2023) - [j19]Attila Joó:
The Lovász-Cherkassky theorem in countable graphs. J. Comb. Theory B 159: 1-19 (2023) - [j18]Nathan J. Bowler, Florian Gut, Attila Joó, Max Pitz:
Maker-Breaker Games on and. J. Symb. Log. 88(2): 697-703 (2023) - 2022
- [j17]Zsuzsanna Jankó, Attila Joó:
Cutting a Cake for Infinitely Many Guests. Electron. J. Comb. 29(1) (2022) - 2021
- [j16]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
Base Partition for Mixed Families of Finitary and Cofinitary Matroids. Comb. 41(1): 31-52 (2021) - [j15]Attila Joó:
Intersection of a partitional and a general infinite matroid. Discret. Math. 344(9): 112514 (2021) - [j14]Joshua Erde, J. Pascal Gollin, Attila Joó, Paul Knappe, Max Pitz:
A Cantor-Bernstein-type theorem for spanning trees in infinite graphs. J. Comb. Theory B 149: 16-22 (2021) - [j13]Joshua Erde, J. Pascal Gollin, Attila Joó:
Enlarging vertex-flames in countable digraphs. J. Comb. Theory B 151: 263-281 (2021) - [j12]Attila Joó:
Greedoids from flames. J. Graph Theory 98(1): 49-56 (2021) - 2020
- [j11]Attila Joó:
On the growth rate of dichromatic numbers of finite subdigraphs. Discret. Math. 343(3): 111735 (2020) - [j10]Paul Ellis, Attila Joó, Dániel T. Soukup:
Reducing the dichromatic number via cycle reversions in infinite digraphs. Eur. J. Comb. 90: 103196 (2020) - [j9]Attila Joó:
Uncountable dichromatic number without short directed cycles. J. Graph Theory 94(1): 113-116 (2020) - 2019
- [j8]Attila Joó:
Vertex-Flames in Countable Rooted Digraphs Preserving an Erdős-Menger Separation for Each Vertex. Comb. 39(6): 1317-1333 (2019) - 2018
- [j7]Attila Joó:
Countable Menger's Theorem with Finitary Matroid Constraints on the Ingoing Edges. Electron. J. Comb. 25(3): 3 (2018) - [j6]Attila Joó:
Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs. J. Graph Theory 87(1): 96-107 (2018) - [j5]Attila Joó:
Gomory-Hu trees of infinite graphs with finite total weight. J. Graph Theory 88(1): 222-231 (2018) - 2017
- [j4]Kristóf Bérczi, Attila Joó:
King-Serf Duo by Monochromatic Paths in k-Edge-Coloured Tournaments. Electron. J. Comb. 24(1): 1 (2017) - [j3]Attila Joó:
$T$-Joins in Infinite Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j2]Attila Joó:
Highly Connected Infinite Digraphs Without Edge-Disjoint Back and Forth Paths Between a Certain Vertex Pair. J. Graph Theory 85(1): 51-55 (2017) - 2016
- [j1]Attila Joó:
Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths. J. Graph Theory 83(3): 303-311 (2016)
Informal and Other Publications
- 2023
- [i1]Zsuzsanna Jankó, Attila Joó, Erel Segal-Halevi:
On Connected Strongly-Proportional Cake-Cutting. CoRR abs/2312.15326 (2023)
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 2024-08-03 20:15 CEST 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:
