Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Richard Montgomery 0001
@inproceedings{DBLP:conf/stoc/Bucic023,
author = {Matija Bucic and
Richard Montgomery},
editor = {Barna Saha and
Rocco A. Servedio},
title = {Towards the Erd{\H{o}}s-Gallai Cycle Decomposition Conjecture},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {839--852},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585218},
doi = {10.1145/3564246.3585218},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Bucic023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/BenfordM22,
author = {Alistair Benford and
Richard Montgomery},
title = {Trees with few leaves in tournaments},
journal = {J. Comb. Theory, Ser. {B}},
volume = {155},
pages = {141--170},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2022.02.005},
doi = {10.1016/J.JCTB.2022.02.005},
timestamp = {Fri, 03 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/BenfordM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/KathapurkarM22,
author = {Amarja Kathapurkar and
Richard Montgomery},
title = {Spanning trees in dense directed graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {156},
pages = {223--249},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2022.04.007},
doi = {10.1016/J.JCTB.2022.04.007},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/KathapurkarM22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/GlockKMO21,
author = {Stefan Glock and
Daniela K{\"{u}}hn and
Richard Montgomery and
Deryk Osthus},
title = {Decompositions into isomorphic rainbow spanning trees},
journal = {J. Comb. Theory, Ser. {B}},
volume = {146},
pages = {439--484},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2020.03.002},
doi = {10.1016/J.JCTB.2020.03.002},
timestamp = {Wed, 02 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/GlockKMO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Montgomery20,
author = {Richard Montgomery},
title = {Hamiltonicity in random directed graphs is born resilient},
journal = {Comb. Probab. Comput.},
volume = {29},
number = {6},
pages = {900--942},
year = {2020},
url = {https://doi.org/10.1017/S0963548320000140},
doi = {10.1017/S0963548320000140},
timestamp = {Mon, 16 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Montgomery20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BarberGKLMO20,
author = {Ben Barber and
Stefan Glock and
Daniela K{\"{u}}hn and
Allan Lo and
Richard Montgomery and
Deryk Osthus},
title = {Minimalist designs},
journal = {Random Struct. Algorithms},
volume = {57},
number = {1},
pages = {47--63},
year = {2020},
url = {https://doi.org/10.1002/rsa.20915},
doi = {10.1002/RSA.20915},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BarberGKLMO20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GeorgakopoulosH19,
author = {Agelos Georgakopoulos and
John Haslegrave and
Richard Montgomery},
title = {Forcing large tight components in 3-graphs},
journal = {Eur. J. Comb.},
volume = {77},
pages = {57--67},
year = {2019},
url = {https://doi.org/10.1016/j.ejc.2018.11.001},
doi = {10.1016/J.EJC.2018.11.001},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GeorgakopoulosH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GlockKLMO19,
author = {Stefan Glock and
Daniela K{\"{u}}hn and
Allan Lo and
Richard Montgomery and
Deryk Osthus},
title = {On the decomposition threshold of a given graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {139},
pages = {47--127},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2019.02.010},
doi = {10.1016/J.JCTB.2019.02.010},
timestamp = {Fri, 18 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/GlockKLMO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Montgomery19,
author = {Richard Montgomery},
title = {Hamiltonicity in random graphs is born resilient},
journal = {J. Comb. Theory, Ser. {B}},
volume = {139},
pages = {316--341},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2019.04.002},
doi = {10.1016/J.JCTB.2019.04.002},
timestamp = {Fri, 18 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Montgomery19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Montgomery19,
author = {Richard Montgomery},
title = {Fractional clique decompositions of dense graphs},
journal = {Random Struct. Algorithms},
volume = {54},
number = {4},
pages = {779--796},
year = {2019},
url = {https://doi.org/10.1002/rsa.20809},
doi = {10.1002/RSA.20809},
timestamp = {Fri, 31 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Montgomery19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BottcherHKMPP19,
author = {Julia B{\"{o}}ttcher and
Jie Han and
Yoshiharu Kohayakawa and
Richard Montgomery and
Olaf Parczyk and
Yury Person},
title = {Universality for bounded degree spanning trees in randomly perturbed
graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {4},
pages = {854--864},
year = {2019},
url = {https://doi.org/10.1002/rsa.20850},
doi = {10.1002/RSA.20850},
timestamp = {Fri, 09 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BottcherHKMPP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BaloghLM18,
author = {J{\'{o}}zsef Balogh and
Hong Liu and
Richard Montgomery},
title = {Rainbow spanning trees in properly coloured complete graphs},
journal = {Discret. Appl. Math.},
volume = {247},
pages = {97--101},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2018.03.066},
doi = {10.1016/J.DAM.2018.03.066},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BaloghLM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Montgomery17,
author = {Richard Montgomery},
title = {Fractional Clique Decompositions of Dense Partite Graphs},
journal = {Comb. Probab. Comput.},
volume = {26},
number = {6},
pages = {911--943},
year = {2017},
url = {https://doi.org/10.1017/S0963548317000165},
doi = {10.1017/S0963548317000165},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Montgomery17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BottcherMPP17,
author = {Julia B{\"{o}}ttcher and
Richard Montgomery and
Olaf Parczyk and
Yury Person},
title = {Embedding spanning bounded degree subgraphs in randomly perturbed
graphs},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {155--161},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.033},
doi = {10.1016/J.ENDM.2017.06.033},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BottcherMPP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BarberKLMO17,
author = {Ben Barber and
Daniela K{\"{u}}hn and
Allan Lo and
Richard Montgomery and
Deryk Osthus},
title = {Fractional clique decompositions of dense graphs and hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {127},
pages = {148--186},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2017.05.005},
doi = {10.1016/J.JCTB.2017.05.005},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BarberKLMO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/LiuM17,
author = {Hong Liu and
Richard Montgomery},
title = {A proof of Mader's conjecture on large clique subdivisions in C4-free
graphs},
journal = {J. Lond. Math. Soc.},
volume = {95},
number = {1},
pages = {203--222},
year = {2017},
url = {https://doi.org/10.1112/jlms.12019},
doi = {10.1112/JLMS.12019},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlms/LiuM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/Montgomery15,
author = {Richard Montgomery},
title = {Logarithmically small minors and topological minors},
journal = {J. Lond. Math. Soc.},
volume = {91},
number = {1},
pages = {71--88},
year = {2015},
url = {https://doi.org/10.1112/jlms/jdu063},
doi = {10.1112/JLMS/JDU063},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlms/Montgomery15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Montgomery15,
author = {Richard Montgomery},
title = {Almost All Friendly Matrices Have Many Obstructions},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {421--430},
year = {2015},
url = {https://doi.org/10.1137/140960840},
doi = {10.1137/140960840},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Montgomery15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-21 18:08 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:
