Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Nicholas C. Wormald
@article{DBLP:journals/rsa/LiebenauW23,
author = {Anita Liebenau and
Nick Wormald},
title = {Asymptotic enumeration of digraphs and bipartite graphs by degree
sequence},
journal = {Random Struct. Algorithms},
volume = {62},
number = {2},
pages = {259--286},
year = {2023},
url = {https://doi.org/10.1002/rsa.21105},
doi = {10.1002/RSA.21105},
timestamp = {Tue, 21 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/LiebenauW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HodKMNW22,
author = {Rani Hod and
Michael Krivelevich and
Tobias M{\"{u}}ller and
Alon Naor and
Nicholas C. Wormald},
title = {Component Games on Random Graphs},
journal = {Comb.},
volume = {42},
number = {6},
pages = {1189--1229},
year = {2022},
url = {https://doi.org/10.1007/s00493-022-5036-9},
doi = {10.1007/S00493-022-5036-9},
timestamp = {Tue, 07 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/HodKMNW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HosseiniW22,
author = {Seyed Soheil Hosseini and
Nick Wormald},
title = {Semi-labeled unrooted binary tree optimization subject to nonnegativity},
journal = {Networks},
volume = {80},
number = {2},
pages = {249--263},
year = {2022},
url = {https://doi.org/10.1002/net.22090},
doi = {10.1002/NET.22090},
timestamp = {Tue, 12 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HosseiniW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alenex/Allendorf0PTW22,
author = {Daniel Allendorf and
Ulrich Meyer and
Manuel Penschuck and
Hung Tran and
Nick Wormald},
editor = {Cynthia A. Phillips and
Bettina Speckmann},
title = {Engineering Uniform Sampling of Graphs with a Prescribed Power-law
Degree Sequence},
booktitle = {Proceedings of the Symposium on Algorithm Engineering and Experiments,
{ALENEX} 2022, Alexandria, VA, USA, January 9-10, 2022},
pages = {27--40},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977042.3},
doi = {10.1137/1.9781611977042.3},
timestamp = {Mon, 01 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/alenex/Allendorf0PTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GaoRWW21,
author = {Pu Gao and
Reshma Ramadurai and
Ian M. Wanless and
Nick Wormald},
title = {Full rainbow matchings in graphs and hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {5},
pages = {762--780},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000620},
doi = {10.1017/S0963548320000620},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GaoRWW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/ArmanGW21,
author = {Andrii Arman and
Pu Gao and
Nicholas C. Wormald},
title = {Fast uniform generation of random graphs with given degree sequences},
journal = {Random Struct. Algorithms},
volume = {59},
number = {3},
pages = {291--314},
year = {2021},
url = {https://doi.org/10.1002/rsa.21004},
doi = {10.1002/RSA.21004},
timestamp = {Thu, 09 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/ArmanGW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-09413,
author = {Andrii Arman and
Pu Gao and
Nicholas C. Wormald},
title = {Linear-time uniform generation of random sparse contingency tables
with specified marginals},
journal = {CoRR},
volume = {abs/2104.09413},
year = {2021},
url = {https://arxiv.org/abs/2104.09413},
eprinttype = {arXiv},
eprint = {2104.09413},
timestamp = {Thu, 06 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2104-09413.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2110-15015,
author = {Daniel Allendorf and
Ulrich Meyer and
Manuel Penschuck and
Hung Tran and
Nick Wormald},
title = {Engineering Uniform Sampling of Graphs with a Prescribed Power-law
Degree Sequence},
journal = {CoRR},
volume = {abs/2110.15015},
year = {2021},
url = {https://arxiv.org/abs/2110.15015},
eprinttype = {arXiv},
eprint = {2110.15015},
timestamp = {Tue, 02 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2110-15015.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PralatW20,
author = {Pawel Pralat and
Nick Wormald},
title = {Almost all 5-regular graphs have a 3-flow},
journal = {J. Graph Theory},
volume = {93},
number = {2},
pages = {147--156},
year = {2020},
url = {https://doi.org/10.1002/jgt.22478},
doi = {10.1002/JGT.22478},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/PralatW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/LeckeyMW20,
author = {Kevin Leckey and
Dieter Mitsche and
Nick Wormald},
title = {The height of depth-weighted random recursive trees},
journal = {Random Struct. Algorithms},
volume = {56},
number = {3},
pages = {851--866},
year = {2020},
url = {https://doi.org/10.1002/rsa.20901},
doi = {10.1002/RSA.20901},
timestamp = {Mon, 20 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/LeckeyMW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fedcsis/HosseiniWT20a,
author = {Seyed Soheil Hosseini and
Nick Wormald and
Tianhai Tian},
editor = {Stefka Fidanova},
title = {Optimal Tree of a Complete Weighted Graph},
booktitle = {Recent Advances in Computational Optimization - Results of the Workshop
on Computational Optimization {WCO} 2020},
series = {Studies in Computational Intelligence},
volume = {986},
pages = {203--219},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-82397-9\_10},
doi = {10.1007/978-3-030-82397-9\_10},
timestamp = {Tue, 21 Dec 2021 08:37:11 +0100},
biburl = {https://dblp.org/rec/conf/fedcsis/HosseiniWT20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fedcsis/HosseiniWT20,
author = {Seyed Soheil Hosseini and
Nick Wormald and
Tianhai Tian},
editor = {Maria Ganzha and
Leszek A. Maciaszek and
Marcin Paprzycki},
title = {On Finding the Optimal Tree of a Complete Weighted Graph},
booktitle = {Proceedings of the 2020 Federated Conference on Computer Science and
Information Systems, FedCSIS 2020, Sofia, Bulgaria, September 6-9,
2020},
series = {Annals of Computer Science and Information Systems},
volume = {21},
pages = {271--275},
year = {2020},
url = {https://doi.org/10.15439/2020F4},
doi = {10.15439/2020F4},
timestamp = {Tue, 17 May 2022 16:11:27 +0200},
biburl = {https://dblp.org/rec/conf/fedcsis/HosseiniWT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-15797,
author = {Anita Liebenau and
Nick Wormald},
title = {Asymptotic enumeration of digraphs and bipartite graphs by degree
sequence},
journal = {CoRR},
volume = {abs/2006.15797},
year = {2020},
url = {https://arxiv.org/abs/2006.15797},
eprinttype = {arXiv},
eprint = {2006.15797},
timestamp = {Thu, 02 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-15797.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/LeckeyW19,
author = {Kevin Leckey and
Nick Wormald},
title = {A Limit Theorem for the Six-length of Random Functional Graphs with
a Fixed Degree Sequence},
journal = {Electron. J. Comb.},
volume = {26},
number = {4},
pages = {4},
year = {2019},
url = {https://doi.org/10.37236/7710},
doi = {10.37236/7710},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/LeckeyW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PralatW19,
author = {Pawel Pralat and
Nicholas C. Wormald},
title = {Meyniel's conjecture holds for random d-regular graphs},
journal = {Random Struct. Algorithms},
volume = {55},
number = {3},
pages = {719--741},
year = {2019},
url = {https://doi.org/10.1002/rsa.20874},
doi = {10.1002/RSA.20874},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PralatW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ArmanGW19,
author = {Andrii Arman and
Pu Gao and
Nicholas C. Wormald},
editor = {David Zuckerman},
title = {Fast Uniform Generation of Random Graphs with Given Degree Sequences},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {1371--1379},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00084},
doi = {10.1109/FOCS.2019.00084},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/ArmanGW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-03446,
author = {Andrii Arman and
Pu Gao and
Nicholas C. Wormald},
title = {Fast uniform generation of random graphs with given degree sequences},
journal = {CoRR},
volume = {abs/1905.03446},
year = {2019},
url = {http://arxiv.org/abs/1905.03446},
eprinttype = {arXiv},
eprint = {1905.03446},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-03446.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HoppenW18,
author = {Carlos Hoppen and
Nicholas C. Wormald},
title = {Local Algorithms, Regular Graphs of Large Girth, and Random Regular
Graphs},
journal = {Comb.},
volume = {38},
number = {3},
pages = {619--664},
year = {2018},
url = {https://doi.org/10.1007/s00493-016-3236-x},
doi = {10.1007/S00493-016-3236-X},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HoppenW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Coja-OghlanW18,
author = {Amin Coja{-}Oghlan and
Nick Wormald},
title = {The Number of Satisfying Assignments of Random Regular k-SAT Formulas},
journal = {Comb. Probab. Comput.},
volume = {27},
number = {4},
pages = {496--530},
year = {2018},
url = {https://doi.org/10.1017/S0963548318000263},
doi = {10.1017/S0963548318000263},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Coja-OghlanW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/StarkW18,
author = {Dudley Stark and
Nick Wormald},
title = {The Probability of Non-Existence of a Subgraph in a Moderately Sparse
Random Graph},
journal = {Comb. Probab. Comput.},
volume = {27},
number = {4},
pages = {672--715},
year = {2018},
url = {https://doi.org/10.1017/S0963548318000202},
doi = {10.1017/S0963548318000202},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/StarkW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GaoW18,
author = {Pu Gao and
Nicholas C. Wormald},
editor = {Artur Czumaj},
title = {Uniform generation of random graphs with power-law degree sequences},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2018, New Orleans, LA, USA, January 7-10, 2018},
pages = {1741--1758},
publisher = {{SIAM}},
year = {2018},
url = {https://doi.org/10.1137/1.9781611975031.114},
doi = {10.1137/1.9781611975031.114},
timestamp = {Tue, 02 Feb 2021 17:07:58 +0100},
biburl = {https://dblp.org/rec/conf/soda/GaoW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KangW17,
author = {Liying Kang and
Nicholas C. Wormald},
title = {Minimum Power Dominating Sets of Random Cubic Graphs},
journal = {J. Graph Theory},
volume = {85},
number = {1},
pages = {152--171},
year = {2017},
url = {https://doi.org/10.1002/jgt.22053},
doi = {10.1002/JGT.22053},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KangW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GaoW17,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Uniform Generation of Random Regular Graphs},
journal = {{SIAM} J. Comput.},
volume = {46},
number = {4},
pages = {1395--1427},
year = {2017},
url = {https://doi.org/10.1137/15M1052779},
doi = {10.1137/15M1052779},
timestamp = {Wed, 06 Sep 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GaoW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AcanCMW17,
author = {H{\"{u}}seyin Acan and
Andrea Collevecchio and
Abbas Mehrabian and
Nick Wormald},
title = {On the Push{\&}Pull Protocol for Rumor Spreading},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {2},
pages = {647--668},
year = {2017},
url = {https://doi.org/10.1137/15M1033113},
doi = {10.1137/15M1033113},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AcanCMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1709-02674,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Uniform generation of random graphs with power-law degree sequences},
journal = {CoRR},
volume = {abs/1709.02674},
year = {2017},
url = {http://arxiv.org/abs/1709.02674},
eprinttype = {arXiv},
eprint = {1709.02674},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1709-02674.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/MehrabianW16,
author = {Abbas Mehrabian and
Nick Wormald},
title = {It's a Small World for Random Surfers},
journal = {Algorithmica},
volume = {76},
number = {2},
pages = {344--380},
year = {2016},
url = {https://doi.org/10.1007/s00453-015-0034-6},
doi = {10.1007/S00453-015-0034-6},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/MehrabianW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jap/CollevecchioMW16,
author = {Andrea Collevecchio and
Abbas Mehrabian and
Nick Wormald},
title = {Longest paths in random Apollonian networks and largest r-ary subtrees
of random d-ary recursive trees},
journal = {J. Appl. Probab.},
volume = {53},
number = {3},
pages = {846--856},
year = {2016},
url = {https://doi.org/10.1017/jpr.2016.44},
doi = {10.1017/JPR.2016.44},
timestamp = {Thu, 16 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jap/CollevecchioMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/HoppenW16,
author = {Carlos Hoppen and
Nicholas C. Wormald},
title = {Properties of regular graphs with large girth via local algorithms},
journal = {J. Comb. Theory, Ser. {B}},
volume = {121},
pages = {367--397},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2016.07.009},
doi = {10.1016/J.JCTB.2016.07.009},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/HoppenW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/PralatW16,
author = {Pawel Pralat and
Nicholas C. Wormald},
title = {Meyniel's conjecture holds for random graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {2},
pages = {396--421},
year = {2016},
url = {https://doi.org/10.1002/rsa.20587},
doi = {10.1002/RSA.20587},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/PralatW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KahnLW16,
author = {Jeff Kahn and
Eyal Lubetzky and
Nicholas C. Wormald},
title = {The threshold for combs in random graphs},
journal = {Random Struct. Algorithms},
volume = {48},
number = {4},
pages = {794--802},
year = {2016},
url = {https://doi.org/10.1002/rsa.20614},
doi = {10.1002/RSA.20614},
timestamp = {Mon, 05 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KahnLW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Coja-OghlanW16,
author = {Amin Coja{-}Oghlan and
Nick Wormald},
title = {The number of satisfying assignments of random regular k-SAT formulas},
journal = {CoRR},
volume = {abs/1611.03236},
year = {2016},
url = {http://arxiv.org/abs/1611.03236},
eprinttype = {arXiv},
eprint = {1611.03236},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Coja-OghlanW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GaoW15,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Orientability Thresholds for Random Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {24},
number = {5},
pages = {774--824},
year = {2015},
url = {https://doi.org/10.1017/S096354831400073X},
doi = {10.1017/S096354831400073X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GaoW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GaoW15,
author = {Pu Gao and
Nicholas C. Wormald},
editor = {Venkatesan Guruswami},
title = {Uniform Generation of Random Regular Graphs},
booktitle = {{IEEE} 56th Annual Symposium on Foundations of Computer Science, {FOCS}
2015, Berkeley, CA, USA, 17-20 October, 2015},
pages = {1218--1230},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/FOCS.2015.78},
doi = {10.1109/FOCS.2015.78},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/GaoW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/podc/AcanCMW15,
author = {H{\"{u}}seyin Acan and
Andrea Collevecchio and
Abbas Mehrabian and
Nick Wormald},
editor = {Chryssis Georgiou and
Paul G. Spirakis},
title = {On the Push{\&}Pull Protocol for Rumour Spreading: [Extended Abstract]},
booktitle = {Proceedings of the 2015 {ACM} Symposium on Principles of Distributed
Computing, {PODC} 2015, Donostia-San Sebasti{\'{a}}n, Spain,
July 21 - 23, 2015},
pages = {405--412},
publisher = {{ACM}},
year = {2015},
url = {https://doi.org/10.1145/2767386.2767416},
doi = {10.1145/2767386.2767416},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/podc/AcanCMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GaoW15,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Uniform generation of random regular graphs},
journal = {CoRR},
volume = {abs/1511.01175},
year = {2015},
url = {http://arxiv.org/abs/1511.01175},
eprinttype = {arXiv},
eprint = {1511.01175},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GaoW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/netsci/RichardsW14,
author = {Whitman Richards and
Nicholas C. Wormald},
title = {The evolution and structure of social networks},
journal = {Netw. Sci.},
volume = {2},
number = {3},
pages = {326--340},
year = {2014},
url = {https://doi.org/10.1017/nws.2014.24},
doi = {10.1017/NWS.2014.24},
timestamp = {Mon, 11 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/netsci/RichardsW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenjaminiKW14,
author = {Itai Benjamini and
Gady Kozma and
Nicholas C. Wormald},
title = {The mixing time of the giant component of a random graph},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {383--407},
year = {2014},
url = {https://doi.org/10.1002/rsa.20539},
doi = {10.1002/RSA.20539},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenjaminiKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TamakiY14,
author = {Ehsan Ebrahimzadeh and
Linda Farczadi and
Pu Gao and
Abbas Mehrabian and
Cristiane M. Sato and
Nick Wormald and
Jonathan Zung},
title = {On longest paths and diameter in random apollonian network},
journal = {Random Struct. Algorithms},
volume = {45},
number = {4},
pages = {703--725},
year = {2014},
url = {https://doi.org/10.1002/rsa.20538},
doi = {10.1002/RSA.20538},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TamakiY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KolesnikW14,
author = {Brett Kolesnik and
Nick Wormald},
title = {Lower Bounds for the Isoperimetric Numbers of Random Regular Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {553--575},
year = {2014},
url = {https://doi.org/10.1137/120891265},
doi = {10.1137/120891265},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KolesnikW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/MehrabianW14,
author = {Abbas Mehrabian and
Nick Wormald},
editor = {Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Nikhil R. Devanur and
Cristopher Moore},
title = {It's a Small World for Random Surfers},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
Spain},
series = {LIPIcs},
volume = {28},
pages = {857--871},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.857},
doi = {10.4230/LIPICS.APPROX-RANDOM.2014.857},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/MehrabianW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MehrabianW14,
author = {Abbas Mehrabian and
Nick Wormald},
title = {It's a Small World for Random Surfers},
journal = {CoRR},
volume = {abs/1404.7189},
year = {2014},
url = {http://arxiv.org/abs/1404.7189},
eprinttype = {arXiv},
eprint = {1404.7189},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MehrabianW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AcanCMW14,
author = {H{\"{u}}seyin Acan and
Andrea Collevecchio and
Abbas Mehrabian and
Nick Wormald},
title = {On the push{\&}pull protocol for rumour spreading},
journal = {CoRR},
volume = {abs/1411.0948},
year = {2014},
url = {http://arxiv.org/abs/1411.0948},
eprinttype = {arXiv},
eprint = {1411.0948},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AcanCMW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/MehrabianW13,
author = {Abbas Mehrabian and
Nick Wormald},
title = {On the Stretch Factor of Randomly Embedded Random Graphs},
journal = {Discret. Comput. Geom.},
volume = {49},
number = {3},
pages = {647--658},
year = {2013},
url = {https://doi.org/10.1007/s00454-012-9482-9},
doi = {10.1007/S00454-012-9482-9},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/MehrabianW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/EbrahimzadehFGMSWZ13,
author = {Ehsan Ebrahimzadeh and
Linda Farczadi and
Pu Gao and
Abbas Mehrabian and
Cristiane M. Sato and
Nick Wormald and
Jonathan Zung},
title = {On the Longest Paths and the Diameter in Random Apollonian Networks},
journal = {Electron. Notes Discret. Math.},
volume = {43},
pages = {355--365},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.07.053},
doi = {10.1016/J.ENDM.2013.07.053},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/EbrahimzadehFGMSWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Perez-GimenezW13,
author = {Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Nicholas C. Wormald},
title = {Asymptotic enumeration of strongly connected digraphs by vertices
and edges},
journal = {Random Struct. Algorithms},
volume = {43},
number = {1},
pages = {80--114},
year = {2013},
url = {https://doi.org/10.1002/rsa.20416},
doi = {10.1002/RSA.20416},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/Perez-GimenezW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KemkesSW13,
author = {Graeme Kemkes and
Cristiane M. Sato and
Nicholas C. Wormald},
title = {Asymptotic enumeration of sparse 2-connected graphs},
journal = {Random Struct. Algorithms},
volume = {43},
number = {3},
pages = {354--376},
year = {2013},
url = {https://doi.org/10.1002/rsa.20415},
doi = {10.1002/RSA.20415},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KemkesSW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KemkesW13,
author = {Graeme Kemkes and
Nicholas C. Wormald},
title = {An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical
Random Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {342--362},
year = {2013},
url = {https://doi.org/10.1137/090766279},
doi = {10.1137/090766279},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KemkesW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GaoSW12,
author = {Pu Gao and
Yi Su and
Nicholas C. Wormald},
title = {Induced subgraphs in sparse random graphs with given degree sequences},
journal = {Eur. J. Comb.},
volume = {33},
number = {6},
pages = {1142--1166},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2012.01.009},
doi = {10.1016/J.EJC.2012.01.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GaoSW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BotelhoWZ12,
author = {Fabiano C. Botelho and
Nicholas C. Wormald and
Nivio Ziviani},
title = {Cores of random r-partite hypergraphs},
journal = {Inf. Process. Lett.},
volume = {112},
number = {8-9},
pages = {314--319},
year = {2012},
url = {https://doi.org/10.1016/j.ipl.2011.10.017},
doi = {10.1016/J.IPL.2011.10.017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BotelhoWZ12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jota/BrazilRTWW12,
author = {Marcus Brazil and
J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng and
Nicholas C. Wormald},
title = {Gradient-Constrained Minimum Networks. {III.} Fixed Topology},
journal = {J. Optim. Theory Appl.},
volume = {155},
number = {1},
pages = {336--354},
year = {2012},
url = {https://doi.org/10.1007/s10957-012-0036-3},
doi = {10.1007/S10957-012-0036-3},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jota/BrazilRTWW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-6252,
author = {Abbas Mehrabian and
Nick Wormald},
title = {On the Stretch Factor of Randomly Embedded Random Graphs},
journal = {CoRR},
volume = {abs/1205.6252},
year = {2012},
url = {http://arxiv.org/abs/1205.6252},
eprinttype = {arXiv},
eprint = {1205.6252},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1205-6252.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PralatVW11,
author = {Pawel Pralat and
Jacques Verstra{\"{e}}te and
Nicholas C. Wormald},
title = {On the threshold for k-regular subgraphs of random graphs},
journal = {Comb.},
volume = {31},
number = {5},
pages = {565--581},
year = {2011},
url = {https://doi.org/10.1007/s00493-011-2545-3},
doi = {10.1007/S00493-011-2545-3},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/PralatVW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GerkeSW11,
author = {Stefanie Gerke and
Angelika Steger and
Nicholas C. Wormald},
title = {Pegging Graphs Yields a Small Diameter},
journal = {Comb. Probab. Comput.},
volume = {20},
number = {2},
pages = {239--248},
year = {2011},
url = {https://doi.org/10.1017/S096354831000026X},
doi = {10.1017/S096354831000026X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GerkeSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BenjaminiHOPW11,
author = {Itai Benjamini and
Carlos Hoppen and
Eran Ofek and
Pawel Pralat and
Nicholas C. Wormald},
title = {Geodesics and almost geodesic cycles in random regular graphs},
journal = {J. Graph Theory},
volume = {66},
number = {2},
pages = {115--136},
year = {2011},
url = {https://doi.org/10.1002/jgt.20496},
doi = {10.1002/JGT.20496},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BenjaminiHOPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MullerPW11,
author = {Tobias M{\"{u}}ller and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Nicholas C. Wormald},
title = {Disjoint Hamilton cycles in the random geometric graph},
journal = {J. Graph Theory},
volume = {68},
number = {4},
pages = {299--322},
year = {2011},
url = {https://doi.org/10.1002/jgt.20560},
doi = {10.1002/JGT.20560},
timestamp = {Thu, 17 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/MullerPW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichSW11,
author = {Michael Krivelevich and
Benny Sudakov and
Nicholas C. Wormald},
title = {Regular induced subgraphs of a random Graph},
journal = {Random Struct. Algorithms},
volume = {38},
number = {3},
pages = {235--250},
year = {2011},
url = {https://doi.org/10.1002/rsa.20324},
doi = {10.1002/RSA.20324},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichSW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BenderDGRW10,
author = {Edward A. Bender and
Adri B. Olde Daalhuis and
Zhicheng Gao and
L. Bruce Richmond and
Nicholas C. Wormald},
title = {Asymptotics of Some Convolutional Recurrences},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/273},
doi = {10.37236/273},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BenderDGRW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/DuckworthW10,
author = {William Duckworth and
Nicholas C. Wormald},
title = {Linear Programming and the Worst-Case Analysis of Greedy Algorithms
on Cubic Graphs},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/449},
doi = {10.37236/449},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/DuckworthW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RiordanW10,
author = {Oliver Riordan and
Nicholas C. Wormald},
title = {The Diameter of Sparse Random Graphs},
journal = {Comb. Probab. Comput.},
volume = {19},
number = {5-6},
pages = {835--926},
year = {2010},
url = {https://doi.org/10.1017/S0963548310000325},
doi = {10.1017/S0963548310000325},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RiordanW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GaoW10,
author = {Pu Gao and
Nicholas C. Wormald},
editor = {Leonard J. Schulman},
title = {Load balancing and orientability thresholds for random hypergraphs},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {97--104},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806705},
doi = {10.1145/1806689.1806705},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GaoW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1009-5489,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Orientability thresholds for random hypergraphs},
journal = {CoRR},
volume = {abs/1009.5489},
year = {2010},
url = {http://arxiv.org/abs/1009.5489},
eprinttype = {arXiv},
eprint = {1009.5489},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1009-5489.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/GaoW09,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Rate of Convergence of the Short Cycle Distribution in Random Regular
Graphs Generated by Pegging},
journal = {Electron. J. Comb.},
volume = {16},
number = {1},
year = {2009},
url = {https://doi.org/10.37236/133},
doi = {10.37236/133},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/GaoW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DiazKKKPW09,
author = {Josep D{\'{\i}}az and
Alexis C. Kaporis and
G. D. Kemkes and
Lefteris M. Kirousis and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Nicholas C. Wormald},
title = {On the chromatic number of a random 5-regular graph},
journal = {J. Graph Theory},
volume = {61},
number = {3},
pages = {157--191},
year = {2009},
url = {https://doi.org/10.1002/jgt.20369},
doi = {10.1002/JGT.20369},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DiazKKKPW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoW09,
author = {Pu Gao and
Nicholas C. Wormald},
title = {Short cycle distribution in random regular graphs recursively generated
by pegging},
journal = {Random Struct. Algorithms},
volume = {34},
number = {1},
pages = {54--86},
year = {2009},
url = {https://doi.org/10.1002/rsa.20253},
doi = {10.1002/RSA.20253},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GaoW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cse/RichardsW09,
author = {Whitman Richards and
Nicholas C. Wormald},
title = {Representing Small Group Evolution},
booktitle = {Proceedings of the 12th {IEEE} International Conference on Computational
Science and Engineering, {CSE} 2009, Vancouver, BC, Canada, August
29-31, 2009},
pages = {159--165},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CSE.2009.238},
doi = {10.1109/CSE.2009.238},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cse/RichardsW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/HoppenW08,
author = {Carlos Hoppen and
Nicholas C. Wormald},
title = {Induced Forests in Regular Graphs with Large Girth},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {3},
pages = {389--410},
year = {2008},
url = {https://doi.org/10.1017/S0963548307008905},
doi = {10.1017/S0963548307008905},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/HoppenW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WormaldZ08,
author = {Nicholas C. Wormald and
Sanming Zhou},
title = {Large forbidden trade volumes and edge packings of random graphs},
journal = {Discret. Math.},
volume = {308},
number = {13},
pages = {2751--2755},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2006.06.035},
doi = {10.1016/J.DISC.2006.06.035},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/WormaldZ08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GreenhillHW08,
author = {Catherine S. Greenhill and
Fred B. Holt and
Nicholas C. Wormald},
title = {Expansion properties of a random regular graph after random vertex
deletions},
journal = {Eur. J. Comb.},
volume = {29},
number = {5},
pages = {1139--1150},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.06.021},
doi = {10.1016/J.EJC.2007.06.021},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GreenhillHW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PittelW08,
author = {Boris G. Pittel and
Nicholas C. Wormald},
title = {Corrigendum to "Counting connected graphs inside-out" {[J.}
Combin. Theory Ser. {B} 93 {(2005)} 127-172]},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {4},
pages = {835--837},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.10.005},
doi = {10.1016/J.JCTB.2007.10.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PittelW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/GaoW08,
author = {Zhicheng Gao and
Nicholas C. Wormald},
title = {Distribution of subgraphs of random regular graphs},
journal = {Random Struct. Algorithms},
volume = {32},
number = {1},
pages = {38--48},
year = {2008},
url = {https://doi.org/10.1002/rsa.20189},
doi = {10.1002/RSA.20189},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/GaoW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DiazPSW08,
author = {Josep D{\'{\i}}az and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Maria J. Serna and
Nicholas C. Wormald},
title = {Walkers on the Cycle and the Grid},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {2},
pages = {747--775},
year = {2008},
url = {https://doi.org/10.1137/060659855},
doi = {10.1137/060659855},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DiazPSW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AlonPW08,
author = {Noga Alon and
Pawel Pralat and
Nicholas C. Wormald},
title = {Cleaning Regular Graphs with Brushes},
journal = {{SIAM} J. Discret. Math.},
volume = {23},
number = {1},
pages = {233--250},
year = {2008},
url = {https://doi.org/10.1137/070703053},
doi = {10.1137/070703053},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AlonPW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SpencerW07,
author = {Joel H. Spencer and
Nicholas C. Wormald},
title = {Birth control for giants},
journal = {Comb.},
volume = {27},
number = {5},
pages = {587--628},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-2163-2},
doi = {10.1007/S00493-007-2163-2},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SpencerW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ShiW07,
author = {Lingsheng Shi and
Nicholas C. Wormald},
title = {Colouring Random 4-Regular Graphs},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {2},
pages = {309--344},
year = {2007},
url = {https://doi.org/10.1017/S0963548306007693},
doi = {10.1017/S0963548306007693},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ShiW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ShiW07a,
author = {Lingsheng Shi and
Nicholas C. Wormald},
title = {Colouring Random Regular Graphs},
journal = {Comb. Probab. Comput.},
volume = {16},
number = {3},
pages = {459--494},
year = {2007},
url = {https://doi.org/10.1017/S0963548306007954},
doi = {10.1017/S0963548306007954},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ShiW07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/PralatW07,
author = {Pawel Pralat and
Nicholas C. Wormald},
title = {Growing Protean Graphs},
journal = {Internet Math.},
volume = {4},
number = {1},
pages = {1--16},
year = {2007},
url = {https://doi.org/10.1080/15427951.2007.10129135},
doi = {10.1080/15427951.2007.10129135},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/im/PralatW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/itor/ThomasBLW07,
author = {Doreen A. Thomas and
Marcus Brazil and
David H. Lee and
Nicholas C. Wormald},
title = {Network modelling of underground mine layout: two case studies},
journal = {Int. Trans. Oper. Res.},
volume = {14},
number = {2},
pages = {143--158},
year = {2007},
url = {https://doi.org/10.1111/j.1475-3995.2007.00579.x},
doi = {10.1111/J.1475-3995.2007.00579.X},
timestamp = {Thu, 09 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/itor/ThomasBLW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/LauerW07,
author = {Joseph Lauer and
Nicholas C. Wormald},
title = {Large independent sets in regular graphs of large girth},
journal = {J. Comb. Theory, Ser. {B}},
volume = {97},
number = {6},
pages = {999--1009},
year = {2007},
url = {https://doi.org/10.1016/j.jctb.2007.02.006},
doi = {10.1016/J.JCTB.2007.02.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/LauerW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/JansonW07,
author = {Svante Janson and
Nicholas C. Wormald},
title = {Rainbow Hamilton cycles in random regular graphs},
journal = {Random Struct. Algorithms},
volume = {30},
number = {1-2},
pages = {35--49},
year = {2007},
url = {https://doi.org/10.1002/rsa.20146},
doi = {10.1002/RSA.20146},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/JansonW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/TelcsWZ07,
author = {Andr{\'{a}}s Telcs and
Nicholas C. Wormald and
Sanming Zhou},
title = {Hamiltonicity of random graphs produced by 2-processes},
journal = {Random Struct. Algorithms},
volume = {31},
number = {4},
pages = {450--481},
year = {2007},
url = {https://doi.org/10.1002/rsa.20133},
doi = {10.1002/RSA.20133},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/TelcsWZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiazSW07,
author = {Josep D{\'{\i}}az and
Maria J. Serna and
Nicholas C. Wormald},
title = {Bounds on the bisection width for random d -regular graphs},
journal = {Theor. Comput. Sci.},
volume = {382},
number = {2},
pages = {120--130},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.03.003},
doi = {10.1016/J.TCS.2007.03.003},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tcs/DiazSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/MessingerPNW07,
author = {Margaret{-}Ellen Messinger and
Pawel Pralat and
Richard J. Nowakowski and
Nicholas C. Wormald},
editor = {Jeannette C. M. Janssen and
Pawel Pralat},
title = {Cleaning Random \emph{d}-Regular Graphs with Brushes Using a Degree-Greedy
Algorithm},
booktitle = {Combinatorial and Algorithmic Aspects of Networking, 4th Workshop,
{CAAN} 2007, Halifax, Canada, August 14, 2007. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {4852},
pages = {13--26},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77294-1\_4},
doi = {10.1007/978-3-540-77294-1\_4},
timestamp = {Tue, 14 May 2019 10:00:49 +0200},
biburl = {https://dblp.org/rec/conf/caan/MessingerPNW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/CainSW07,
author = {Julie Anne Cain and
Peter Sanders and
Nicholas C. Wormald},
editor = {Nikhil Bansal and
Kirk Pruhs and
Clifford Stein},
title = {The random graph threshold for \emph{k}-orientiability and a fast
algorithm for optimal multiple-choice allocation},
booktitle = {Proceedings of the Eighteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2007, New Orleans, Louisiana, USA, January 7-9,
2007},
pages = {469--476},
publisher = {{SIAM}},
year = {2007},
url = {http://dl.acm.org/citation.cfm?id=1283383.1283433},
timestamp = {Tue, 15 Feb 2022 07:54:27 +0100},
biburl = {https://dblp.org/rec/conf/soda/CainSW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wce/BrazilGLRTW07,
author = {Marcus Brazil and
Peter Alexander Grossman and
David H. Lee and
J. Hyam Rubinstein and
Doreen A. Thomas and
Nicholas C. Wormald},
editor = {Sio Iong Ao and
Leonid Gelman and
David W. L. Hukins and
Andrew Hunter and
Alexander M. Korsunsky},
title = {Constrained Path Optimisation for Underground Mine Layout},
booktitle = {Proceedings of the World Congress on Engineering, {WCE} 2007, London,
UK, 2-4 July, 2007},
series = {Lecture Notes in Engineering and Computer Science},
pages = {856--861},
publisher = {Newswood Limited},
year = {2007},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wce/BrazilGLRTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/CainW06,
author = {Julie Cain and
Nicholas C. Wormald},
title = {Encores on Cores},
journal = {Electron. J. Comb.},
volume = {13},
number = {1},
year = {2006},
url = {https://doi.org/10.37236/1107},
doi = {10.37236/1107},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/CainW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DuckworthW06,
author = {William Duckworth and
Nicholas C. Wormald},
title = {On the Independent Domination Number of Random Regular Graphs},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {4},
pages = {513--522},
year = {2006},
url = {https://doi.org/10.1017/S0963548305007431},
doi = {10.1017/S0963548305007431},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DuckworthW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/AssiyatunW06,
author = {Hilda Assiyatun and
Nicholas C. Wormald},
title = {3-star factors in random \emph{d}-regular graphs},
journal = {Eur. J. Comb.},
volume = {27},
number = {8},
pages = {1249--1262},
year = {2006},
url = {https://doi.org/10.1016/j.ejc.2006.05.003},
doi = {10.1016/J.EJC.2006.05.003},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/AssiyatunW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/RubinsteinWW06,
author = {J. Hyam Rubinstein and
Jia F. Weng and
Nicholas C. Wormald},
title = {Approximations and Lower Bounds for the Length of Minimal Euclidean
Steiner Trees},
journal = {J. Glob. Optim.},
volume = {35},
number = {4},
pages = {573--592},
year = {2006},
url = {https://doi.org/10.1007/s10898-005-4207-8},
doi = {10.1007/S10898-005-4207-8},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/RubinsteinWW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GerkeGW06,
author = {Stefanie Gerke and
Catherine S. Greenhill and
Nicholas C. Wormald},
title = {The generalized acyclic edge chromatic number of random regular graphs},
journal = {J. Graph Theory},
volume = {53},
number = {2},
pages = {101--125},
year = {2006},
url = {https://doi.org/10.1002/jgt.20167},
doi = {10.1002/JGT.20167},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GerkeGW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/Wormald06,
author = {Nicholas C. Wormald},
editor = {Josep D{\'{\i}}az and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim and
Uri Zwick},
title = {Analysis of Algorithms on the Cores of Random Graphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 9th International Workshop on Approximation Algorithms
for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
Spain, August 28-30 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4110},
pages = {2},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11830924\_2},
doi = {10.1007/11830924\_2},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/Wormald06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FriezeW05,
author = {Alan M. Frieze and
Nicholas C. Wormald},
title = {Random \emph{k}-Sat: {A} Tight Threshold For Moderately Growing \emph{k}},
journal = {Comb.},
volume = {25},
number = {3},
pages = {297--305},
year = {2005},
url = {https://doi.org/10.1007/s00493-005-0017-3},
doi = {10.1007/S00493-005-0017-3},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FriezeW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PittelW05,
author = {Boris G. Pittel and
Nicholas C. Wormald},
title = {Counting connected graphs inside-out},
journal = {J. Comb. Theory, Ser. {B}},
volume = {93},
number = {2},
pages = {127--172},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2004.09.005},
doi = {10.1016/J.JCTB.2004.09.005},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PittelW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/NesetrilW05,
author = {Jaroslav Nesetril and
Nicholas C. Wormald},
title = {The acyclic edge chromatic number of a random \emph{d}-regular graph
is \emph{d} + 1},
journal = {J. Graph Theory},
volume = {49},
number = {1},
pages = {69--74},
year = {2005},
url = {https://doi.org/10.1002/jgt.20064},
doi = {10.1002/JGT.20064},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/NesetrilW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/DiazPSW05,
author = {Josep D{\'{\i}}az and
Xavier P{\'{e}}rez{-}Gim{\'{e}}nez and
Maria J. Serna and
Nicholas C. Wormald},
editor = {Volker Diekert and
Bruno Durand},
title = {Connectivity for Wireless Agents Moving on a Cycle or Grid},
booktitle = {{STACS} 2005, 22nd Annual Symposium on Theoretical Aspects of Computer
Science, Stuttgart, Germany, February 24-26, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3404},
pages = {353--364},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-31856-9\_29},
doi = {10.1007/978-3-540-31856-9\_29},
timestamp = {Thu, 11 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/DiazPSW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/McKayWW04,
author = {Brendan D. McKay and
Nicholas C. Wormald and
Beata Wysocka},
title = {Short Cycles in Random Regular Graphs},
journal = {Electron. J. Comb.},
volume = {11},
number = {1},
year = {2004},
url = {https://doi.org/10.37236/1819},
doi = {10.37236/1819},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/McKayWW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GreenhillRW04,
author = {Catherine S. Greenhill and
Andrzej Rucinski and
Nicholas C. Wormald},
title = {Random Hypergraph Processes with Degree Restrictions},
journal = {Graphs Comb.},
volume = {20},
number = {3},
pages = {319--332},
year = {2004},
url = {https://doi.org/10.1007/s00373-004-0571-2},
doi = {10.1007/S00373-004-0571-2},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GreenhillRW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CunninghamHRWT04,
author = {William H. Cunningham and
Penny E. Haxell and
R. Bruce Richter and
Nicholas C. Wormald and
Andrew Thomason},
title = {To Adrian Bondy and U. S. R. Murty},
journal = {J. Comb. Theory, Ser. {B}},
volume = {90},
number = {1},
pages = {1},
year = {2004},
url = {https://doi.org/10.1016/j.jctb.2003.10.001},
doi = {10.1016/J.JCTB.2003.10.001},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/CunninghamHRWT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GreenhillKW04,
author = {Catherine S. Greenhill and
Jeong Han Kim and
Nicholas C. Wormald},
title = {Hamiltonian decompositions of random bipartite regular graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {90},
number = {2},
pages = {195--222},
year = {2004},
url = {https://doi.org/10.1016/j.jctb.2003.07.001},
doi = {10.1016/J.JCTB.2003.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GreenhillKW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BohmanFW04,
author = {Tom Bohman and
Alan M. Frieze and
Nicholas C. Wormald},
title = {Avoidance of a giant component in half the edge set of a random graph},
journal = {Random Struct. Algorithms},
volume = {25},
number = {4},
pages = {432--449},
year = {2004},
url = {https://doi.org/10.1002/rsa.20038},
doi = {10.1002/RSA.20038},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/BohmanFW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/DiazSW04,
author = {Josep D{\'{\i}}az and
Maria J. Serna and
Nicholas C. Wormald},
editor = {Martin Farach{-}Colton},
title = {Computation of the Bisection Width for Random d-Regular Graphs},
booktitle = {{LATIN} 2004: Theoretical Informatics, 6th Latin American Symposium,
Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2976},
pages = {49--58},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-24698-5\_9},
doi = {10.1007/978-3-540-24698-5\_9},
timestamp = {Fri, 09 Apr 2021 18:42:35 +0200},
biburl = {https://dblp.org/rec/conf/latin/DiazSW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/GaoW03,
author = {Zhicheng Gao and
Nicholas C. Wormald},
title = {Sharp Concentration of the Number of Submaps in Random Planar Triangulations},
journal = {Comb.},
volume = {23},
number = {3},
pages = {467--486},
year = {2003},
url = {https://doi.org/10.1007/s00493-003-0028-x},
doi = {10.1007/S00493-003-0028-X},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/GaoW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GreenhillRW03,
author = {Catherine S. Greenhill and
Andrzej Rucinski and
Nicholas C. Wormald},
title = {Connectedness Of The Degree Bounded Star Process},
journal = {Comb. Probab. Comput.},
volume = {12},
number = {3},
pages = {269--283},
year = {2003},
url = {https://doi.org/10.1017/S0963548302005357},
doi = {10.1017/S0963548302005357},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillRW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wormald03,
author = {Nicholas C. Wormald},
title = {Analysis of greedy algorithms on graphs with bounded degrees},
journal = {Discret. Math.},
volume = {273},
number = {1-3},
pages = {235--260},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00241-3},
doi = {10.1016/S0012-365X(03)00241-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wormald03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/CasteloW03,
author = {Robert Castelo and
Nicholas C. Wormald},
title = {Enumeration of \emph{P} \({}_{\mbox{4}}\)-Free Chordal Graphs},
journal = {Graphs Comb.},
volume = {19},
number = {4},
pages = {467--474},
year = {2003},
url = {https://doi.org/10.1007/s00373-002-0513-9},
doi = {10.1007/S00373-002-0513-9},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/CasteloW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PittelW03,
author = {Boris G. Pittel and
Nicholas C. Wormald},
title = {Asymptotic enumeration of sparse graphs with a minimum degree constraint},
journal = {J. Comb. Theory, Ser. {A}},
volume = {101},
number = {2},
pages = {249--263},
year = {2003},
url = {https://doi.org/10.1016/S0097-3165(02)00017-1},
doi = {10.1016/S0097-3165(02)00017-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PittelW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/DuckworthWZ03,
author = {William Duckworth and
Nicholas C. Wormald and
Michele Zito},
title = {A {PTAS} for the sparsest 2-spanner of 4-connected planar triangulations},
journal = {J. Discrete Algorithms},
volume = {1},
number = {1},
pages = {67--76},
year = {2003},
url = {https://doi.org/10.1016/S1570-8667(03)00007-8},
doi = {10.1016/S1570-8667(03)00007-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/DuckworthWZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichSVW03,
author = {Michael Krivelevich and
Benny Sudakov and
Van H. Vu and
Nicholas C. Wormald},
title = {On the probability of independent sets in random graphs},
journal = {Random Struct. Algorithms},
volume = {22},
number = {1},
pages = {1--14},
year = {2003},
url = {https://doi.org/10.1002/rsa.10063},
doi = {10.1002/RSA.10063},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichSVW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiazDSW03,
author = {Josep D{\'{\i}}az and
Norman Do and
Maria J. Serna and
Nicholas C. Wormald},
title = {Bounds on the max and min bisection of random cubic and random 4-regular
graphs},
journal = {Theor. Comput. Sci.},
volume = {307},
number = {3},
pages = {531--547},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(03)00236-6},
doi = {10.1016/S0304-3975(03)00236-6},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiazDSW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/03/BollobasNWFF03,
author = {B{\'{e}}la Bollob{\'{a}}s and
Vladimir Nikiforov and
Nicholas C. Wormald and
Ralph J. Faudree and
Alan M. Frieze},
editor = {Jonathan L. Gross and
Jay Yellen},
title = {Analytic Graph Theory},
booktitle = {Handbook of Graph Theory},
series = {Discrete Mathematics and Its Applications},
pages = {787--871},
publisher = {Chapman {\&} Hall / Taylor {\&} Francis},
year = {2003},
url = {https://doi.org/10.1201/9780203490204.ch8},
doi = {10.1201/9780203490204.CH8},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/tf/03/BollobasNWFF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BenderGW02,
author = {Edward A. Bender and
Zhicheng Gao and
Nicholas C. Wormald},
title = {The Number of Labeled 2-Connected Planar Graphs},
journal = {Electron. J. Comb.},
volume = {9},
number = {1},
year = {2002},
url = {https://doi.org/10.37236/1659},
doi = {10.37236/1659},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BenderGW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/GreenhillJKW02,
author = {Catherine S. Greenhill and
Svante Janson and
Jeong Han Kim and
Nicholas C. Wormald},
title = {Permutation Pseudographs And Contiguity},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {273--298},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005065},
doi = {10.1017/S0963548301005065},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/GreenhillJKW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MckayWW02,
author = {Brendan D. McKay and
Ian M. Wanless and
Nicholas C. Wormald},
title = {Asymptotic Enumeration Of Graphs With {A} Given Upper Bound On The
Maximum Degree},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {373--392},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005229},
doi = {10.1017/S0963548302005229},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/MckayWW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DuckworthW02,
author = {William Duckworth and
Nicholas C. Wormald},
title = {Minimum independent dominating sets of random cubic graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {2},
pages = {147--161},
year = {2002},
url = {https://doi.org/10.1002/rsa.10047},
doi = {10.1002/RSA.10047},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DuckworthW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BauWZ02,
author = {Sheng Bau and
Nicholas C. Wormald and
Sanming Zhou},
title = {Decycling numbers of random regular graphs},
journal = {Random Struct. Algorithms},
volume = {21},
number = {3-4},
pages = {397--413},
year = {2002},
url = {https://doi.org/10.1002/rsa.10069},
doi = {10.1002/RSA.10069},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BauWZ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/random/DiazDSW02,
author = {Josep D{\'{\i}}az and
Norman Do and
Maria J. Serna and
Nicholas C. Wormald},
editor = {Jos{\'{e}} D. P. Rolim and
Salil P. Vadhan},
title = {Bisection of Random Cubic Graphs},
booktitle = {Randomization and Approximation Techniques, 6th International Workshop,
{RANDOM} 2002, Cambridge, MA, USA, September 13-15, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2483},
pages = {114--125},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45726-7\_10},
doi = {10.1007/3-540-45726-7\_10},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/random/DiazDSW02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AlonTW01,
author = {Noga Alon and
Vanessa Teague and
Nicholas C. Wormald},
title = {Linear Arboricity and Linear k-Arboricity of Regular Graphs},
journal = {Graphs Comb.},
volume = {17},
number = {1},
pages = {11--16},
year = {2001},
url = {https://doi.org/10.1007/PL00007233},
doi = {10.1007/PL00007233},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AlonTW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KimW01,
author = {Jeong Han Kim and
Nicholas C. Wormald},
title = {Random Matchings Which Induce Hamilton Cycles and Hamiltonian Decompositions
of Random Regular Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {81},
number = {1},
pages = {20--44},
year = {2001},
url = {https://doi.org/10.1006/jctb.2000.1991},
doi = {10.1006/JCTB.2000.1991},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KimW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/WanlessW01,
author = {Ian M. Wanless and
Nicholas C. Wormald},
title = {Regular Graphs with No Homomorphisms onto Cycles},
journal = {J. Comb. Theory, Ser. {B}},
volume = {82},
number = {1},
pages = {155--160},
year = {2001},
url = {https://doi.org/10.1006/jctb.2000.2014},
doi = {10.1006/JCTB.2000.2014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/WanlessW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgo/BrazilRTWW01,
author = {Marcus Brazil and
J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng and
Nicholas C. Wormald},
title = {Gradient-constrained minimum networks. I. Fundamentals},
journal = {J. Glob. Optim.},
volume = {21},
number = {2},
pages = {139--155},
year = {2001},
url = {https://doi.org/10.1023/A:1011903210297},
doi = {10.1023/A:1011903210297},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgo/BrazilRTWW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GaoWW01,
author = {Zhicheng Gao and
Ian M. Wanless and
Nicholas C. Wormald},
title = {Counting 5-connected planar triangulations},
journal = {J. Graph Theory},
volume = {38},
number = {1},
pages = {18--35},
year = {2001},
url = {https://doi.org/10.1002/jgt.1021},
doi = {10.1002/JGT.1021},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GaoWW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/RubinsteinTW01,
author = {J. Hyam Rubinstein and
Doreen A. Thomas and
Nicholas C. Wormald},
title = {A polynomial algorithm for a constrained traveling salesman problem},
journal = {Networks},
volume = {38},
number = {2},
pages = {68--75},
year = {2001},
url = {https://doi.org/10.1002/net.1025},
doi = {10.1002/NET.1025},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/RubinsteinTW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KrivelevichSVW01,
author = {Michael Krivelevich and
Benny Sudakov and
Van H. Vu and
Nicholas C. Wormald},
title = {Random regular graphs of high degree},
journal = {Random Struct. Algorithms},
volume = {18},
number = {4},
pages = {346--363},
year = {2001},
url = {https://doi.org/10.1002/rsa.1013},
doi = {10.1002/RSA.1013},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KrivelevichSVW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RobinsonW01,
author = {Robert W. Robinson and
Nicholas C. Wormald},
title = {Hamilton cycles containing randomly selected edges in random regular
graphs},
journal = {Random Struct. Algorithms},
volume = {19},
number = {2},
pages = {128--147},
year = {2001},
url = {https://doi.org/10.1002/rsa.1024},
doi = {10.1002/RSA.1024},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RobinsonW01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AssiyatunW00,
author = {Hilda Assiyatun and
Nicholas C. Wormald},
title = {Covering regular graphs with forests of small trees},
journal = {Australas. {J} Comb.},
volume = {22},
pages = {219--226},
year = {2000},
url = {http://ajc.maths.uq.edu.au/pdf/22/ocr-ajc-v22-p219.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/AssiyatunW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RobalewskaW00,
author = {Hanna D. Robalewska and
Nicholas C. Wormald},
title = {Random Star Processes},
journal = {Comb. Probab. Comput.},
volume = {9},
number = {1},
pages = {33--43},
year = {2000},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46755},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/RobalewskaW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NgSW00,
author = {Meei Pyng Ng and
Mike A. Steel and
Nicholas C. Wormald},
title = {The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding
Given Subtrees},
journal = {Discret. Appl. Math.},
volume = {98},
number = {3},
pages = {227--235},
year = {2000},
url = {https://doi.org/10.1016/S0166-218X(99)00160-2},
doi = {10.1016/S0166-218X(99)00160-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NgSW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/McKayWW00,
author = {Brendan D. McKay and
Ian M. Wanless and
Nicholas C. Wormald},
title = {The asymptotic number of graphs with a restriction on the maximum
degree},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {228--230},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80171-4},
doi = {10.1016/S1571-0653(05)80171-4},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/McKayWW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GaoW00,
author = {Zhicheng Gao and
Nicholas C. Wormald},
title = {The Distribution of the Maximum Vertex Degree in Random Planar Maps},
journal = {J. Comb. Theory, Ser. {A}},
volume = {89},
number = {2},
pages = {201--230},
year = {2000},
url = {https://doi.org/10.1006/jcta.1999.3006},
doi = {10.1006/JCTA.1999.3006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GaoW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/DuckworthWZ00,
author = {William Duckworth and
Nicholas C. Wormald and
Michele Zito},
editor = {Ding{-}Zhu Du and
Peter Eades and
Vladimir Estivill{-}Castro and
Xuemin Lin and
Arun Sharma},
title = {Maximum Induced Matchings of Random Cubic Graphs},
booktitle = {Computing and Combinatorics, 6th Annual International Conference,
{COCOON} 2000, Sydney, Australia, July 26-28, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1858},
pages = {34--43},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44968-X\_4},
doi = {10.1007/3-540-44968-X\_4},
timestamp = {Fri, 16 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/DuckworthWZ00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KnopfmacherOPRSSW99,
author = {Arnold Knopfmacher and
Andrew M. Odlyzko and
Boris G. Pittel and
L. Bruce Richmond and
Dudley Stark and
George Szekeres and
Nicholas C. Wormald},
title = {The Asymptotic Number of Set Partitions with Unequal Block Sizes},
journal = {Electron. J. Comb.},
volume = {6},
year = {1999},
url = {https://doi.org/10.37236/1434},
doi = {10.37236/1434},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/KnopfmacherOPRSSW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/StegerW99,
author = {Angelika Steger and
Nicholas C. Wormald},
title = {Generating Random Regular Graphs Quickly},
journal = {Comb. Probab. Comput.},
volume = {8},
number = {4},
pages = {377--396},
year = {1999},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46711},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/StegerW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GaoW99,
author = {Zhicheng Gao and
Nicholas C. Wormald},
title = {The Size of the Largest Components in Random Planar Maps},
journal = {{SIAM} J. Discret. Math.},
volume = {12},
number = {2},
pages = {217--228},
year = {1999},
url = {https://doi.org/10.1137/S0895480195292053},
doi = {10.1137/S0895480195292053},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GaoW99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/MoffatPW98,
author = {Alistair Moffat and
Ola Petersson and
Nicholas C. Wormald},
title = {A Tree-Based Mergesort},
journal = {Acta Informatica},
volume = {35},
number = {9},
pages = {775--793},
year = {1998},
url = {https://doi.org/10.1007/s002360050142},
doi = {10.1007/S002360050142},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/MoffatPW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/AldredW98,
author = {Robert E. L. Aldred and
Nicholas C. Wormald},
title = {More on the linear k-arboricity of regular graphs},
journal = {Australas. {J} Comb.},
volume = {18},
pages = {97--104},
year = {1998},
url = {http://ajc.maths.uq.edu.au/pdf/18/ocr-ajc-v18-p97.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/AldredW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LindquesterW98,
author = {Terri Lindquester and
Nicholas C. Wormald},
title = {Factorisation of regular graphs into forests of short paths},
journal = {Discret. Math.},
volume = {186},
number = {1-3},
pages = {217--226},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00193-3},
doi = {10.1016/S0012-365X(97)00193-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LindquesterW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/SmithW98,
author = {Warren D. Smith and
Nicholas C. Wormald},
title = {Geometric Separator Theorems {\&} Applications},
booktitle = {39th Annual Symposium on Foundations of Computer Science, {FOCS} '98,
November 8-11, 1998, Palo Alto, California, {USA}},
pages = {232--243},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/SFCS.1998.743449},
doi = {10.1109/SFCS.1998.743449},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/SmithW98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrazilRTWW97a,
author = {Marcus Brazil and
J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng and
Nicholas C. Wormald},
title = {Full Minimal Steiner Trees on Lattice Sets},
journal = {J. Comb. Theory, Ser. {A}},
volume = {78},
number = {1},
pages = {51--91},
year = {1997},
url = {https://doi.org/10.1006/jcta.1996.2752},
doi = {10.1006/JCTA.1996.2752},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BrazilRTWW97a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrazilRTWW97,
author = {Marcus Brazil and
J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng and
Nicholas C. Wormald},
title = {Minimal Steiner Trees for Rectangular Arrays of Lattice Points},
journal = {J. Comb. Theory, Ser. {A}},
volume = {79},
number = {2},
pages = {181--208},
year = {1997},
url = {https://doi.org/10.1006/jcta.1996.2751},
doi = {10.1006/JCTA.1996.2751},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BrazilRTWW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/StarkW97,
author = {Dudley Stark and
Nicholas C. Wormald},
title = {Asymptotic Enumeration of Convex Polygons},
journal = {J. Comb. Theory, Ser. {A}},
volume = {80},
number = {2},
pages = {196--217},
year = {1997},
url = {https://doi.org/10.1006/jcta.1997.2802},
doi = {10.1006/JCTA.1997.2802},
timestamp = {Sun, 06 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/StarkW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MolloyRRW97,
author = {Michael Molloy and
Hanna D. Robalewska and
Robert W. Robinson and
Nicholas C. Wormald},
title = {1-Factorizations of random regular graphs},
journal = {Random Struct. Algorithms},
volume = {10},
number = {3},
pages = {305--321},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199705)10:3\&\#60;305::AID-RSA1\&\#62;3.0.CO;2-\%23},
doi = {10.1002/(SICI)1098-2418(199705)10:3\&\#60;305::AID-RSA1\&\#62;3.0.CO;2-\%23},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MolloyRRW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McKayW97,
author = {Brendan D. McKay and
Nicholas C. Wormald},
title = {The degree sequence of a random graph. I. The models},
journal = {Random Struct. Algorithms},
volume = {11},
number = {2},
pages = {97--117},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1098-2418(199709)11:2\&\#60;97::AID-RSA1\&\#62;3.0.CO;2-O},
doi = {10.1002/(SICI)1098-2418(199709)11:2\&\#60;97::AID-RSA1\&\#62;3.0.CO;2-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McKayW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/RubinsteinTW97,
author = {J. Hyam Rubinstein and
Doreen A. Thomas and
Nicholas C. Wormald},
title = {Steiner Trees for Terminals Constrained to Curves},
journal = {{SIAM} J. Discret. Math.},
volume = {10},
number = {1},
pages = {1--17},
year = {1997},
url = {https://doi.org/10.1137/S0895480192241190},
doi = {10.1137/S0895480192241190},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/RubinsteinTW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/BrazilRTWW97,
author = {Marcus Brazil and
J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng and
Nicholas C. Wormald},
editor = {Panos M. Pardalos and
Ding{-}Zhu Du},
title = {Shortest networks on spheres},
booktitle = {Network Design: Connectivity and Facilities Location, Proceedings
of a {DIMACS} Workshop, Princetin, New Jersey, USA, April 28-30, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {40},
pages = {453--461},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/040/26},
doi = {10.1090/DIMACS/040/26},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/BrazilRTWW97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cj/MajewskiWHC96,
author = {Bohdan S. Majewski and
Nicholas C. Wormald and
George Havas and
Zbigniew J. Czech},
title = {A Family of Perfect Hashing Methods},
journal = {Comput. J.},
volume = {39},
number = {6},
pages = {547--554},
year = {1996},
url = {https://doi.org/10.1093/comjnl/39.6.547},
doi = {10.1093/COMJNL/39.6.547},
timestamp = {Sat, 20 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cj/MajewskiWHC96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/NgW96,
author = {Meei Pyng Ng and
Nicholas C. Wormald},
title = {Reconstruction of Rooted Trees From Subtrees},
journal = {Discret. Appl. Math.},
volume = {69},
number = {1-2},
pages = {19--31},
year = {1996},
url = {https://doi.org/10.1016/0166-218X(95)00074-2},
doi = {10.1016/0166-218X(95)00074-2},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/NgW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/JacksonW96,
author = {Bill Jackson and
Nicholas C. Wormald},
title = {On the linear k-arboricity of cubic graphs},
journal = {Discret. Math.},
volume = {162},
number = {1-3},
pages = {293--297},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00293-6},
doi = {10.1016/0012-365X(95)00293-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/JacksonW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FriezeJMRW96,
author = {Alan M. Frieze and
Mark Jerrum and
Michael Molloy and
Robert W. Robinson and
Nicholas C. Wormald},
title = {Generating and Counting Hamilton Cycles in Random Regular Graphs},
journal = {J. Algorithms},
volume = {21},
number = {1},
pages = {176--198},
year = {1996},
url = {https://doi.org/10.1006/jagm.1996.0042},
doi = {10.1006/JAGM.1996.0042},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/FriezeJMRW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PittelSW96,
author = {Boris G. Pittel and
Joel Spencer and
Nicholas C. Wormald},
title = {Sudden Emergence of a Giant\emph{k}-Core in a Random Graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {67},
number = {1},
pages = {111--151},
year = {1996},
url = {https://doi.org/10.1006/jctb.1996.0036},
doi = {10.1006/JCTB.1996.0036},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/PittelSW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BrazilCRTWW96,
author = {Marcus Brazil and
T. Cole and
J. Hyam Rubinstein and
Doreen A. Thomas and
Jia F. Weng and
Nicholas C. Wormald},
title = {Minimal Steiner Trees for 2\({}^{\mbox{k}}\){\texttimes}2\({}^{\mbox{k}}\)
Square Lattices},
journal = {J. Comb. Theory, Ser. {A}},
volume = {73},
number = {1},
pages = {91--110},
year = {1996},
url = {https://doi.org/10.1006/jcta.1996.0004},
doi = {10.1006/JCTA.1996.0004},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BrazilCRTWW96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Wormald96,
author = {Nicholas C. Wormald},
title = {The perturbation method and triangle-free random graphs},
journal = {Random Struct. Algorithms},
volume = {9},
number = {1-2},
pages = {253--269},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2\&\#60;253::AID-RSA15\&\#62;3.0.CO;2-O},
doi = {10.1002/(SICI)1098-2418(199608/09)9:1/2\&\#60;253::AID-RSA15\&\#62;3.0.CO;2-O},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Wormald96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/RichmondW95,
author = {L. Bruce Richmond and
Nicholas C. Wormald},
title = {Almost All Maps Are Asymmetric},
journal = {J. Comb. Theory, Ser. {B}},
volume = {63},
number = {1},
pages = {1--7},
year = {1995},
url = {https://doi.org/10.1006/jctb.1995.1001},
doi = {10.1006/JCTB.1995.1001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/RichmondW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonW95,
author = {Bill Jackson and
Nicholas C. Wormald},
title = {Long Cycles and 3-Connected Spanning Subgraphs of Bounded Degree in
3-Connected \emph{K}\({}_{\mbox{1, \emph{d}}}\)-Free Graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {63},
number = {2},
pages = {163--169},
year = {1995},
url = {https://doi.org/10.1006/jctb.1995.1013},
doi = {10.1006/JCTB.1995.1013},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/JacksonW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/BenderRW95,
author = {Edward A. Bender and
L. Bruce Richmond and
Nicholas C. Wormald},
title = {Largest 4-Connected Components of 3-Connected Planar Triangulations},
journal = {Random Struct. Algorithms},
volume = {7},
number = {4},
pages = {273--286},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240070402},
doi = {10.1002/RSA.3240070402},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/BenderRW95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/EadesW94,
author = {Peter Eades and
Nicholas C. Wormald},
title = {Edge Crossings in Drawings of Bipartite Graphs},
journal = {Algorithmica},
volume = {11},
number = {4},
pages = {379--403},
year = {1994},
url = {https://doi.org/10.1007/BF01187020},
doi = {10.1007/BF01187020},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/EadesW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GaoW94,
author = {Zhicheng Gao and
Nicholas C. Wormald},
title = {Spanning eulerian subgraphs of bounded degree in triangulations},
journal = {Graphs Comb.},
volume = {10},
number = {2-4},
pages = {123--131},
year = {1994},
url = {https://doi.org/10.1007/BF02986656},
doi = {10.1007/BF02986656},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GaoW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RobinsonW94,
author = {Robert W. Robinson and
Nicholas C. Wormald},
title = {Almost All Regular Graphs Are Hamiltonian},
journal = {Random Struct. Algorithms},
volume = {5},
number = {2},
pages = {363--374},
year = {1994},
url = {https://doi.org/10.1002/rsa.3240050209},
doi = {10.1002/RSA.3240050209},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/RobinsonW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acj/EadesLW93,
author = {Peter Eades and
Xuemin Lin and
Nicholas C. Wormald},
title = {Performance Guarantees for Motion Planning with Temporal Uncertainty},
journal = {Aust. Comput. J.},
volume = {25},
number = {1},
pages = {21--28},
year = {1993},
timestamp = {Tue, 19 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acj/EadesLW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CameronPW93,
author = {Peter J. Cameron and
Cheryl E. Praeger and
Nicholas C. Wormald},
title = {Infinite highly arc transitive digraphs and universal covering digraphs},
journal = {Comb.},
volume = {13},
number = {4},
pages = {377--396},
year = {1993},
url = {https://doi.org/10.1007/BF01303511},
doi = {10.1007/BF01303511},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/CameronPW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HavasMWC93,
author = {George Havas and
Bohdan S. Majewski and
Nicholas C. Wormald and
Zbigniew J. Czech},
editor = {Jan van Leeuwen},
title = {Graphs, Hypergraphs and Hashing},
booktitle = {Graph-Theoretic Concepts in Computer Science, 19th International Workshop,
{WG} '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {790},
pages = {153--165},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57899-4\_49},
doi = {10.1007/3-540-57899-4\_49},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/HavasMWC93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/RucinskiW92,
author = {Andrzej Rucinski and
Nicholas C. Wormald},
title = {Random Graph Processes with Degree Restrictions},
journal = {Comb. Probab. Comput.},
volume = {1},
pages = {169--180},
year = {1992},
url = {https://doi.org/10.1017/S0963548300000183},
doi = {10.1017/S0963548300000183},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/RucinskiW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/JacksonW92,
author = {Bill Jackson and
Nicholas C. Wormald},
title = {Longest cycles in 3-connected planar graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {54},
number = {2},
pages = {291--321},
year = {1992},
url = {https://doi.org/10.1016/0095-8956(92)90058-6},
doi = {10.1016/0095-8956(92)90058-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/JacksonW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/RobinsonW92,
author = {Robert W. Robinson and
Nicholas C. Wormald},
title = {Almost All Cubic Graphs Are Hamiltonian},
journal = {Random Struct. Algorithms},
volume = {3},
number = {2},
pages = {117--126},
year = {1992},
url = {https://doi.org/10.1002/rsa.3240030202},
doi = {10.1002/RSA.3240030202},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/RobinsonW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/EntingGRW92,
author = {Ian G. Enting and
Anthony J. Guttmann and
L. Bruce Richmond and
Nicholas C. Wormald},
title = {Enumeration of Almost-Convex Polygons on the Square Lattice},
journal = {Random Struct. Algorithms},
volume = {3},
number = {4},
pages = {445--462},
year = {1992},
url = {https://doi.org/10.1002/rsa.3240030407},
doi = {10.1002/RSA.3240030407},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/EntingGRW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/MoffatPW92,
author = {Alistair Moffat and
Ola Petersson and
Nicholas C. Wormald},
editor = {Toshihide Ibaraki and
Yasuyoshi Inagaki and
Kazuo Iwama and
Takao Nishizeki and
Masafumi Yamashita},
title = {Sorting and/by Merging Finger Trees},
booktitle = {Algorithms and Computation, Third International Symposium, {ISAAC}
'92, Nagoya, Japan, December 16-18, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {650},
pages = {499--508},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-56279-6\_102},
doi = {10.1007/3-540-56279-6\_102},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/MoffatPW92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/McKayW91,
author = {Brendan D. McKay and
Nicholas C. Wormald},
title = {Asymptotic enumeration by degree sequence of graphs with degress o(n\({}^{\mbox{1/2}}\))},
journal = {Comb.},
volume = {11},
number = {4},
pages = {369--382},
year = {1991},
url = {https://doi.org/10.1007/BF01275671},
doi = {10.1007/BF01275671},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/McKayW91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/JacksonW90,
author = {Bill Jackson and
Nicholas C. Wormald},
title = {k-walks of graphs},
journal = {Australas. {J} Comb.},
volume = {2},
pages = {135--146},
year = {1990},
url = {http://ajc.maths.uq.edu.au/pdf/2/ocr-ajc-v2-p135.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/JacksonW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EadesW90,
author = {Peter Eades and
Nicholas C. Wormald},
title = {Fixed edge-length graph drawing is NP-hard},
journal = {Discret. Appl. Math.},
volume = {28},
number = {2},
pages = {111--134},
year = {1990},
url = {https://doi.org/10.1016/0166-218X(90)90110-X},
doi = {10.1016/0166-218X(90)90110-X},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EadesW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/McKayW90,
author = {Brendan D. McKay and
Nicholas C. Wormald},
title = {Asymptotic Enumeration by Degree Sequence of Graphs of High Degree},
journal = {Eur. J. Comb.},
volume = {11},
number = {6},
pages = {565--580},
year = {1990},
url = {https://doi.org/10.1016/S0195-6698(13)80042-X},
doi = {10.1016/S0195-6698(13)80042-X},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/McKayW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/McKayW90,
author = {Brendan D. McKay and
Nicholas C. Wormald},
title = {Uniform Generation of Random Regular Graphs of Moderate Degree},
journal = {J. Algorithms},
volume = {11},
number = {1},
pages = {52--67},
year = {1990},
url = {https://doi.org/10.1016/0196-6774(90)90029-E},
doi = {10.1016/0196-6774(90)90029-E},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/McKayW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/JacksonW90,
author = {Bill Jackson and
Nicholas C. Wormald},
title = {Cycles containing matchings and pairwise compatible euler tours},
journal = {J. Graph Theory},
volume = {14},
number = {1},
pages = {127--138},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140114},
doi = {10.1002/JGT.3190140114},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/JacksonW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HoltonJSW90,
author = {Derek A. Holton and
Bill Jackson and
Akira Saito and
Nicholas C. Wormald},
title = {Removable edges in 3-connected graphs},
journal = {J. Graph Theory},
volume = {14},
number = {4},
pages = {465--473},
year = {1990},
url = {https://doi.org/10.1002/jgt.3190140410},
doi = {10.1002/JGT.3190140410},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HoltonJSW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/CarterHPSW90,
author = {M. Carter and
Michael D. Hendy and
David Penny and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Nicholas C. Wormald},
title = {On the Distribution of Lengths of Evolutionary Trees},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {1},
pages = {38--47},
year = {1990},
url = {https://doi.org/10.1137/0403005},
doi = {10.1137/0403005},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/CarterHPSW90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SzekelyW89,
author = {L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely and
Nicholas C. Wormald},
title = {Bounds on the measurable chromatic number of R\({}^{\mbox{n}}\)},
journal = {Discret. Math.},
volume = {75},
number = {1-3},
pages = {343--372},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90099-X},
doi = {10.1016/0012-365X(89)90099-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SzekelyW89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/RichmondW88,
author = {L. Bruce Richmond and
Nicholas C. Wormald},
title = {Random Triangulations of the Plane},
journal = {Eur. J. Comb.},
volume = {9},
number = {1},
pages = {61--71},
year = {1988},
url = {https://doi.org/10.1016/S0195-6698(88)80028-3},
doi = {10.1016/S0195-6698(88)80028-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/RichmondW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BenderW88,
author = {Edward A. Bender and
Nicholas C. Wormald},
title = {The asymptotic number of rooted nonseparable maps on a surface},
journal = {J. Comb. Theory, Ser. {A}},
volume = {49},
number = {2},
pages = {370--380},
year = {1988},
url = {https://doi.org/10.1016/0097-3165(88)90063-5},
doi = {10.1016/0097-3165(88)90063-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BenderW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/acta/BenderPW87,
author = {Edward A. Bender and
Cheryl E. Praeger and
Nicholas C. Wormald},
title = {Optimal Worst Case Trees},
journal = {Acta Informatica},
volume = {24},
number = {4},
pages = {475--489},
year = {1987},
url = {https://doi.org/10.1007/BF00292115},
doi = {10.1007/BF00292115},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/acta/BenderPW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CanfieldW87,
author = {E. Rodney Canfield and
Nicholas C. Wormald},
title = {M{\'{e}}nage numbers, bijections and P-recursiveness},
journal = {Discret. Math.},
volume = {63},
number = {2-3},
pages = {117--129},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90002-1},
doi = {10.1016/0012-365X(87)90002-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CanfieldW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/Wormald87,
author = {Nicholas C. Wormald},
title = {Generating Random Unlabelled Graphs},
journal = {{SIAM} J. Comput.},
volume = {16},
number = {4},
pages = {717--727},
year = {1987},
url = {https://doi.org/10.1137/0216048},
doi = {10.1137/0216048},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/Wormald87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BenderRRW86,
author = {Edward A. Bender and
L. Bruce Richmond and
Robert W. Robinson and
Nicholas C. Wormald},
title = {The asymptotic number of acyclic diagraphs {I}},
journal = {Comb.},
volume = {6},
number = {1},
pages = {15--22},
year = {1986},
url = {https://doi.org/10.1007/BF02579404},
doi = {10.1007/BF02579404},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BenderRRW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CaenEPW86,
author = {D. de Caen and
Paul Erd{\"{o}}s and
Norman J. Pullmann and
Nicholas C. Wormald},
title = {Extremal clique coverings of complementary graphs},
journal = {Comb.},
volume = {6},
number = {4},
pages = {309--314},
year = {1986},
url = {https://doi.org/10.1007/BF02579256},
doi = {10.1007/BF02579256},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/CaenEPW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BenderW85,
author = {Edward A. Bender and
Nicholas C. Wormald},
title = {The number of loopless planar maps},
journal = {Discret. Math.},
volume = {54},
number = {2},
pages = {235--237},
year = {1985},
url = {https://doi.org/10.1016/0012-365X(85)90084-6},
doi = {10.1016/0012-365X(85)90084-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BenderW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Wormald85,
author = {Nicholas C. Wormald},
title = {Counting labelled chordal graphs},
journal = {Graphs Comb.},
volume = {1},
number = {1},
pages = {193--200},
year = {1985},
url = {https://doi.org/10.1007/BF02582944},
doi = {10.1007/BF02582944},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Wormald85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BollobasSW85,
author = {B{\'{e}}la Bollob{\'{a}}s and
Akira Saito and
Nicholas C. Wormald},
title = {Regular factors of regular graphs},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {97--103},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090107},
doi = {10.1002/JGT.3190090107},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BollobasSW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CameronCRW85,
author = {R. D. Cameron and
Charles J. Colbourn and
Ronald C. Read and
Nicholas C. Wormald},
title = {Cataloguing the graphs on 10 vertices},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {551--562},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090417},
doi = {10.1002/JGT.3190090417},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CameronCRW85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wormald85,
author = {Nicholas C. Wormald},
title = {Enumeration of cyclically 4-connected cubic graphs},
journal = {J. Graph Theory},
volume = {9},
number = {4},
pages = {563--573},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090418},
doi = {10.1002/JGT.3190090418},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wormald85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/McKayW84,
author = {Brendan D. McKay and
Nicholas C. Wormald},
title = {Automorphisms of random graphs with specified vertices},
journal = {Comb.},
volume = {4},
number = {4},
pages = {325--338},
year = {1984},
url = {https://doi.org/10.1007/BF02579144},
doi = {10.1007/BF02579144},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/McKayW84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/Wormald84,
author = {Nicholas C. Wormald},
title = {Generating Random Regular Graphs},
journal = {J. Algorithms},
volume = {5},
number = {2},
pages = {247--280},
year = {1984},
url = {https://doi.org/10.1016/0196-6774(84)90030-0},
doi = {10.1016/0196-6774(84)90030-0},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/Wormald84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wormald84,
author = {Nicholas C. Wormald},
title = {Isomorphic factorizations {VII.} Regular graphs and tournaments},
journal = {J. Graph Theory},
volume = {8},
number = {1},
pages = {117--122},
year = {1984},
url = {https://doi.org/10.1002/jgt.3190080114},
doi = {10.1002/JGT.3190080114},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wormald84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RobinsonW83,
author = {Robert W. Robinson and
Nicholas C. Wormald},
title = {Numbers of cubic graphs},
journal = {J. Graph Theory},
volume = {7},
number = {4},
pages = {463--467},
year = {1983},
url = {https://doi.org/10.1002/jgt.3190070412},
doi = {10.1002/JGT.3190070412},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RobinsonW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wormald81,
author = {Nicholas C. Wormald},
title = {Counting unrooted planar maps},
journal = {Discret. Math.},
volume = {36},
number = {2},
pages = {205--225},
year = {1981},
url = {https://doi.org/10.1016/0012-365X(81)90238-7},
doi = {10.1016/0012-365X(81)90238-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wormald81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/Wormald81,
author = {Nicholas C. Wormald},
title = {The asymptotic connectivity of labelled regular graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {31},
number = {2},
pages = {156--167},
year = {1981},
url = {https://doi.org/10.1016/S0095-8956(81)80021-4},
doi = {10.1016/S0095-8956(81)80021-4},
timestamp = {Sat, 12 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/Wormald81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/Wormald81a,
author = {Nicholas C. Wormald},
title = {The asymptotic distribution of short cycles in random regular graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {31},
number = {2},
pages = {168--182},
year = {1981},
url = {https://doi.org/10.1016/S0095-8956(81)80022-6},
doi = {10.1016/S0095-8956(81)80022-6},
timestamp = {Sat, 12 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/Wormald81a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ReadW81,
author = {Ronald C. Read and
Nicholas C. Wormald},
title = {Counting the 10-point graphs by partition},
journal = {J. Graph Theory},
volume = {5},
number = {2},
pages = {183--196},
year = {1981},
url = {https://doi.org/10.1002/jgt.3190050208},
doi = {10.1002/JGT.3190050208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ReadW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ReadW80,
author = {Ronald C. Read and
Nicholas C. Wormald},
title = {Number of labeled 4-regular graphs},
journal = {J. Graph Theory},
volume = {4},
number = {2},
pages = {203--212},
year = {1980},
url = {https://doi.org/10.1002/jgt.3190040208},
doi = {10.1002/JGT.3190040208},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ReadW80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WormaldW79,
author = {Nick Wormald and
Edward M. Wright},
title = {The exponential generating function of labelled blocks},
journal = {Discret. Math.},
volume = {25},
number = {1},
pages = {93--96},
year = {1979},
url = {https://doi.org/10.1016/0012-365X(79)90158-4},
doi = {10.1016/0012-365X(79)90158-4},
timestamp = {Wed, 20 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/WormaldW79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wormald78,
author = {Nicholas C. Wormald},
title = {Achiral plane trees},
journal = {J. Graph Theory},
volume = {2},
number = {3},
pages = {189--208},
year = {1978},
url = {https://doi.org/10.1002/jgt.3190020303},
doi = {10.1002/JGT.3190020303},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wormald78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HararyRW77,
author = {Frank Harary and
Robert W. Robinson and
Nicholas C. Wormald},
title = {The divisibility theorem for isomorphic factorizations of complete
graphs},
journal = {J. Graph Theory},
volume = {1},
number = {2},
pages = {187--188},
year = {1977},
url = {https://doi.org/10.1002/jgt.3190010214},
doi = {10.1002/JGT.3190010214},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HararyRW77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wormald77,
author = {Nicholas C. Wormald},
title = {Counting labelled 3-connected graphs},
journal = {J. Graph Theory},
volume = {1},
number = {4},
pages = {383--384},
year = {1977},
url = {https://doi.org/10.1002/jgt.3190010413},
doi = {10.1002/JGT.3190010413},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wormald77.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-25 05:49 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:
