default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathan J. Bowler
Person information
- affiliation: University of Hamburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Nathan J. Bowler, Daryl Funk, Daniel C. Slilaty:
Corrigendum to "Describing quasi-graphic matroids" [European J. Combin. 85 (2020) 103062]. Eur. J. Comb. 122: 104004 (2024)- [j25]Nathan J. Bowler, Yared Nigussie:
Well-quasi-ordering Friedman ideals of finite trees proof of Robertson's magic-tree conjecture. J. Comb. Theory B 164: 222-244 (2024) - 2023
- [j24]Nathan J. Bowler, Christian Elbracht
, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Ubiquity of graphs with nowhere-linear end structure. J. Graph Theory 103(3): 564-598 (2023) - [j23]Nathan J. Bowler, Florian Gut, Attila Joó, Max Pitz:
Maker-Breaker Games on and. J. Symb. Log. 88(2): 697-703 (2023) - [i2]Nathan J. Bowler, Florian Gut, Meike Hatzel, Ken-ichi Kawarabayashi, Irene Muzi, Florian Reich:
Decomposition of (infinite) digraphs along directed 1-separations. CoRR abs/2305.09192 (2023) - 2022
- [j22]Nathan J. Bowler, Christian Elbracht, Joshua Erde, J. Pascal Gollin, Karl Heuer, Max Pitz, Maximilian Teegen:
Topological ubiquity of trees. J. Comb. Theory B 157: 70-95 (2022) - 2021
- [j21]Nathan J. Bowler, Johannes Carmesin:
On the intersection conjecture for infinite trees of matroids. J. Comb. Theory B 151: 46-82 (2021) - [j20]Nathan J. Bowler, Joshua Erde, Florian Lehner, Max Pitz:
Bounding the Cop Number of a Graph by Its Genus. SIAM J. Discret. Math. 35(4): 2459-2489 (2021) - 2020
- [j19]Nathan J. Bowler, Johannes Carmesin, Jerzy Wojciechowski, Shadisadat Ghaderi:
The Almost Intersection Property for Pairs of Matroids on Common Groundset. Electron. J. Comb. 27(3): 3 (2020) - [j18]Nathan J. Bowler, Daryl Funk, Daniel C. Slilaty:
Describing quasi-graphic matroids. Eur. J. Comb. 85 (2020) - [j17]Seyed Hadi Afzali Borujeni, Nathan J. Bowler:
Investigating posets via their maximal chains. Order 37(2): 299-309 (2020) - [j16]Nathan J. Bowler, Jakob Kneip:
Separations of Sets. Order 37(2): 411-425 (2020)
2010 – 2019
- 2019
- [j15]Nathan J. Bowler, Johannes Carmesin, Péter Komjáth, Christian Reiher:
The Colouring Number of Infinite Graphs. Comb. 39(6): 1225-1235 (2019) - [j14]Nathan J. Bowler, Robin Christian, R. Bruce Richter:
Peripheral circuits in infinite binary matroids. J. Comb. Theory B 134: 285-308 (2019) - 2018
- [j13]Nathan J. Bowler, Johannes Carmesin, Robin Christian:
Infinite Graphic Matroids. Comb. 38(2): 305-339 (2018) - [j12]Nathan J. Bowler, Johannes Carmesin, Luke Postle:
Reconstruction of infinite matroids from their 3-connected minors. Eur. J. Comb. 67: 126-144 (2018) - [j11]Nathan J. Bowler, Johannes Carmesin:
An excluded minors method for infinite matroids. J. Comb. Theory B 128: 104-113 (2018) - [j10]Nathan J. Bowler, Joshua Erde, Peter Heinig, Florian Lehner, Max Pitz:
Non-reconstructible locally finite graphs. J. Comb. Theory B 133: 122-152 (2018) - [c2]Nathan J. Bowler, Paul Blain Levy, Gordon D. Plotkin:
Initial Algebras and Final Coalgebras Consisting of Nondeterministic Finite Trace Strategies. MFPS 2018: 23-44 - 2017
- [j9]Nathan J. Bowler, Joshua Erde, Florian Lehner, Martin Merker, Max Pitz, Konstantinos S. Stavropoulos:
A counterexample to Montgomery's conjecture on dynamic colourings of regular graphs. Discret. Appl. Math. 229: 151-153 (2017) - 2015
- [j8]Nathan J. Bowler, Johannes Carmesin:
Matroid intersection, base packing and base covering for infinite matroids. Comb. 35(2): 153-180 (2015) - [j7]Nathan J. Bowler, Johannes Carmesin, Julian Pott:
Edge-disjoint double rays in infinite graphs: A Halin type result. J. Comb. Theory B 111: 1-16 (2015) - [j6]A. R. D. Mathias, Nathan J. Bowler:
Rudimentary Recursion, Gentle Functions and Provident Sets. Notre Dame J. Formal Log. 56(1): 3-60 (2015) - 2014
- [j5]Nathan J. Bowler, Johannes Carmesin:
Matroids with an infinite circuit-cocircuit intersection. J. Comb. Theory B 107: 78-91 (2014) - [j4]Zuhair Al-Johar, M. Randall Holmes, Nathan J. Bowler:
The Axiom Scheme of Acyclic Comprehension. Notre Dame J. Formal Log. 55(1): 11-24 (2014) - [i1]Jirí Adámek, Nathan J. Bowler, Paul Blain Levy, Stefan Milius:
Coproducts of Monads on Set. CoRR abs/1409.3804 (2014) - 2013
- [j3]Nathan J. Bowler, Sergey Goncharov, Paul Blain Levy, Lutz Schröder:
Exploring the Boundaries of Monad Tensorability on Set. Log. Methods Comput. Sci. 9(3) (2013) - [j2]Nathan J. Bowler, Cong Chen, Jakub Gismatullin:
Model theoretic connected components of finitely generated nilpotent groups. J. Symb. Log. 78(1): 245-259 (2013) - 2012
- [c1]Jirí Adámek, Stefan Milius, Nathan J. Bowler, Paul Blain Levy:
Coproducts of Monads on Set. LICS 2012: 45-54
2000 – 2009
- 2009
- [j1]Nathan J. Bowler, Thomas Forster:
Normal subgroups of infinite symmetric groups, with an application to stratified set theory. J. Symb. Log. 74(1): 17-26 (2009)
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-09-02 20:25 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:
