default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Bruce A. Reed
@article{DBLP:journals/corr/abs-2404-16340,
author = {John Iacono and
Piotr Micek and
Pat Morin and
Bruce A. Reed},
title = {Vertex Ranking of Degenerate Graphs},
journal = {CoRR},
volume = {abs/2404.16340},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2404.16340},
doi = {10.48550/ARXIV.2404.16340},
eprinttype = {arXiv},
eprint = {2404.16340},
timestamp = {Wed, 29 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2404-16340.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BrustleCNNRS23,
author = {Noah Br{\"{u}}stle and
Sarah Clusiau and
Vishnu V. Narayan and
Ndiam{\'{e}} Ndiaye and
Bruce A. Reed and
Ben Seamone},
title = {The speed and threshold of the biased perfect matching and Hamilton
cycle games},
journal = {Discret. Appl. Math.},
volume = {332},
pages = {23--40},
year = {2023},
url = {https://doi.org/10.1016/j.dam.2023.01.031},
doi = {10.1016/J.DAM.2023.01.031},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BrustleCNNRS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ReedS23,
author = {Bruce A. Reed and
Maya Stein},
title = {Spanning trees in graphs of high minimum degree with a universal vertex
{I:} An asymptotic result},
journal = {J. Graph Theory},
volume = {102},
number = {4},
pages = {737--783},
year = {2023},
url = {https://doi.org/10.1002/jgt.22897},
doi = {10.1002/JGT.22897},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/ReedS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ReedS23a,
author = {Bruce A. Reed and
Maya Stein},
title = {Spanning trees in graphs of high minimum degree with a universal vertex
{II:} {A} tight result},
journal = {J. Graph Theory},
volume = {102},
number = {4},
pages = {797--821},
year = {2023},
url = {https://doi.org/10.1002/jgt.22899},
doi = {10.1002/JGT.22899},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/ReedS23a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/JoretMRS21,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Bruce A. Reed and
Michiel Smid},
title = {Tight Bounds on the Clique Chromatic Number},
journal = {Electron. J. Comb.},
volume = {28},
number = {3},
year = {2021},
url = {https://doi.org/10.37236/9659},
doi = {10.37236/9659},
timestamp = {Mon, 27 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/JoretMRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/MazaHKMR21,
author = {Sebasti{\'{a}}n Gonz{\'{a}}lez Hermosillo de la Maza and
Seyyed Aliasghar Hosseini and
Fiachra Knox and
Bojan Mohar and
Bruce A. Reed},
title = {Cops and robbers on oriented toroidal grids},
journal = {Theor. Comput. Sci.},
volume = {857},
pages = {166--176},
year = {2021},
url = {https://doi.org/10.1016/j.tcs.2021.01.012},
doi = {10.1016/J.TCS.2021.01.012},
timestamp = {Tue, 09 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MazaHKMR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/BarrettBLR21,
author = {Jordan Barrett and
Salomon Bendayan and
Yanjia Li and
Bruce A. Reed},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {Partitioning Into Prescribed Number of Cycles and Mod \emph{k T}-join
With Slack},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {12--20},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.006},
doi = {10.1016/J.PROCS.2021.11.006},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lagos/BarrettBLR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/BrustleCNNRS21,
author = {Noah Br{\"{u}}stle and
Sarah Clusiau and
Vishnu V. Narayan and
Ndiam{\'{e}} Ndiaye and
Bruce A. Reed and
Ben Seamone},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {The Speed and Threshold of the Biased Perfect Matching Game},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {190--199},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.025},
doi = {10.1016/J.PROCS.2021.11.025},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lagos/BrustleCNNRS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lagos/BrustleCNNRS21a,
author = {Noah Br{\"{u}}stle and
Sarah Clusiau and
Vishnu V. Narayan and
Ndiam{\'{e}} Ndiaye and
Bruce A. Reed and
Ben Seamone},
editor = {Carlos E. Ferreira and
Orlando Lee and
Fl{\'{a}}vio Keidi Miyazawa},
title = {The Speed and Threshold of the Biased Hamilton Cycle Game},
booktitle = {Proceedings of the {XI} Latin and American Algorithms, Graphs and
Optimization Symposium, {LAGOS} 2021, Online Event / S{\~{a}}o Paulo,
Brazil, May 2021},
series = {Procedia Computer Science},
volume = {195},
pages = {200--211},
publisher = {Elsevier},
year = {2021},
url = {https://doi.org/10.1016/j.procs.2021.11.026},
doi = {10.1016/J.PROCS.2021.11.026},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lagos/BrustleCNNRS21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/NorinRTW20,
author = {Sergey Norin and
Bruce A. Reed and
Andrew Thomason and
David R. Wood},
title = {A Lower Bound on the Average Degree Forcing a Minor},
journal = {Electron. J. Comb.},
volume = {27},
number = {2},
pages = {2},
year = {2020},
url = {https://doi.org/10.37236/8847},
doi = {10.37236/8847},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/NorinRTW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/PachRY20,
author = {J{\'{a}}nos Pach and
Bruce A. Reed and
Yelena Yuditsky},
title = {Almost All String Graphs are Intersection Graphs of Plane Convex Sets},
journal = {Discret. Comput. Geom.},
volume = {63},
number = {4},
pages = {888--917},
year = {2020},
url = {https://doi.org/10.1007/s00454-020-00213-z},
doi = {10.1007/S00454-020-00213-Z},
timestamp = {Wed, 15 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/PachRY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/Addario-BerryCH20,
author = {Louigi Addario{-}Berry and
Maria Chudnovsky and
Fr{\'{e}}d{\'{e}}ric Havet and
Bruce A. Reed and
Paul D. Seymour},
title = {Corrigendum to "Bisimplicial vertices in even-hole-free graphs"},
journal = {J. Comb. Theory {B}},
volume = {142},
pages = {374--375},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2020.02.001},
doi = {10.1016/J.JCTB.2020.02.001},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/Addario-BerryCH20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HavetRSW20,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Bruce A. Reed and
Maya Stein and
David R. Wood},
title = {A variant of the Erd{\H{o}}s-S{\'{o}}s conjecture},
journal = {J. Graph Theory},
volume = {94},
number = {1},
pages = {131--158},
year = {2020},
url = {https://doi.org/10.1002/jgt.22511},
doi = {10.1002/JGT.22511},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HavetRSW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-05363,
author = {Tony Huynh and
Bruce A. Reed and
David R. Wood and
Liana Yepremyan},
title = {Notes on Tree- and Path-chromatic Number},
journal = {CoRR},
volume = {abs/2002.05363},
year = {2020},
url = {https://arxiv.org/abs/2002.05363},
eprinttype = {arXiv},
eprint = {2002.05363},
timestamp = {Fri, 14 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-05363.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2006-11353,
author = {Gwena{\"{e}}l Joret and
Piotr Micek and
Bruce A. Reed and
Michiel H. M. Smid},
title = {Tight Bounds on The Clique Chromatic Number},
journal = {CoRR},
volume = {abs/2006.11353},
year = {2020},
url = {https://arxiv.org/abs/2006.11353},
eprinttype = {arXiv},
eprint = {2006.11353},
timestamp = {Wed, 24 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2006-11353.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ReedSS19,
author = {Bruce A. Reed and
Alex Scott and
Paul D. Seymour},
title = {Near-domination in graphs},
journal = {J. Comb. Theory {A}},
volume = {165},
pages = {392--407},
year = {2019},
url = {https://doi.org/10.1016/j.jcta.2019.02.009},
doi = {10.1016/J.JCTA.2019.02.009},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ReedSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DevroyeDFMMR19,
author = {Luc Devroye and
Vida Dujmovic and
Alan M. Frieze and
Abbas Mehrabian and
Pat Morin and
Bruce A. Reed},
title = {Notes on growing a tree in a graph},
journal = {Random Struct. Algorithms},
volume = {55},
number = {2},
pages = {290--312},
year = {2019},
url = {https://doi.org/10.1002/rsa.20828},
doi = {10.1002/RSA.20828},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DevroyeDFMMR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/EppsteinR19,
author = {David Eppstein and
Bruce A. Reed},
editor = {Timothy M. Chan},
title = {Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear
Time},
booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
2019},
pages = {589--605},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975482.37},
doi = {10.1137/1.9781611975482.37},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/EppsteinR19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-10113,
author = {Sebasti{\'{a}}n Gonz{\'{a}}lez Hermosillo de la Maza and
Seyyed Aliasghar Hosseini and
Fiachra Knox and
Bojan Mohar and
Bruce A. Reed},
title = {Cops and robbers on oriented toroidal grids},
journal = {CoRR},
volume = {abs/1904.10113},
year = {2019},
url = {http://arxiv.org/abs/1904.10113},
eprinttype = {arXiv},
eprint = {1904.10113},
timestamp = {Sat, 27 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-10113.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/WittLR18,
author = {Jonas T. Witt and
Marco E. L{\"{u}}bbecke and
Bruce A. Reed},
title = {Polyhedral results on the stable set problem in graphs containing
even or odd pairs},
journal = {Math. Program.},
volume = {171},
number = {1-2},
pages = {519--522},
year = {2018},
url = {https://doi.org/10.1007/s10107-017-1168-x},
doi = {10.1007/S10107-017-1168-X},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/WittLR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/compgeom/PachRY18,
author = {J{\'{a}}nos Pach and
Bruce A. Reed and
Yelena Yuditsky},
editor = {Bettina Speckmann and
Csaba D. T{\'{o}}th},
title = {Almost All String Graphs are Intersection Graphs of Plane Convex Sets},
booktitle = {34th International Symposium on Computational Geometry, SoCG 2018,
June 11-14, 2018, Budapest, Hungary},
series = {LIPIcs},
volume = {99},
pages = {68:1--68:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.SoCG.2018.68},
doi = {10.4230/LIPICS.SOCG.2018.68},
timestamp = {Wed, 16 Jun 2021 12:03:35 +0200},
biburl = {https://dblp.org/rec/conf/compgeom/PachRY18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1803-06710,
author = {J{\'{a}}nos Pach and
Bruce A. Reed and
Yelena Yuditsky},
title = {Almost all string graphs are intersection graphs of plane convex sets},
journal = {CoRR},
volume = {abs/1803.06710},
year = {2018},
url = {http://arxiv.org/abs/1803.06710},
eprinttype = {arXiv},
eprint = {1803.06710},
timestamp = {Wed, 03 Oct 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1803-06710.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-07825,
author = {David Eppstein and
Bruce A. Reed},
title = {Finding Maximal Sets of Laminar 3-Separators in Planar Graphs in Linear
Time},
journal = {CoRR},
volume = {abs/1810.07825},
year = {2018},
url = {http://arxiv.org/abs/1810.07825},
eprinttype = {arXiv},
eprint = {1810.07825},
timestamp = {Wed, 01 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1810-07825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/PerarnauR17,
author = {Guillem Perarnau and
Bruce A. Reed},
title = {Existence of Spanning {\(\mathscr{F}\)}-Free Subgraphs with Large
Minimum Degree},
journal = {Comb. Probab. Comput.},
volume = {26},
number = {3},
pages = {448--467},
year = {2017},
url = {https://doi.org/10.1017/S0963548316000328},
doi = {10.1017/S0963548316000328},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/PerarnauR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/CaiPRW17,
author = {Xing Shi Cai and
Guillem Perarnau and
Bruce A. Reed and
Adam Bene Watts},
title = {Acyclic edge colourings of graphs with large girth},
journal = {Random Struct. Algorithms},
volume = {50},
number = {4},
pages = {511--533},
year = {2017},
url = {https://doi.org/10.1002/rsa.20695},
doi = {10.1002/RSA.20695},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/CaiPRW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DevroyeDFMMR17,
author = {Luc Devroye and
Vida Dujmovic and
Alan M. Frieze and
Abbas Mehrabian and
Pat Morin and
Bruce A. Reed},
title = {Notes on Growing a Tree in a Graph},
journal = {CoRR},
volume = {abs/1707.00083},
year = {2017},
url = {http://arxiv.org/abs/1707.00083},
eprinttype = {arXiv},
eprint = {1707.00083},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/DevroyeDFMMR17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ReedW16,
author = {Bruce A. Reed and
David R. Wood},
title = {Forcing a sparse minor},
journal = {Comb. Probab. Comput.},
volume = {25},
number = {2},
pages = {300--322},
year = {2016},
url = {https://doi.org/10.1017/S0963548315000073},
doi = {10.1017/S0963548315000073},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ReedW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ReedW16a,
author = {Bruce A. Reed and
David R. Wood},
title = {'Forcing a sparse minor' - {CORRIGENDUM}},
journal = {Comb. Probab. Comput.},
volume = {25},
number = {2},
pages = {323},
year = {2016},
url = {https://doi.org/10.1017/S0963548315000115},
doi = {10.1017/S0963548315000115},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ReedW16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KingR16,
author = {Andrew D. King and
Bruce A. Reed},
title = {A Short Proof That {\(\chi\)} Can be Bounded {\(\epsilon\)} Away from
{\(\Delta\)} + 1 toward {\(\omega\)}},
journal = {J. Graph Theory},
volume = {81},
number = {1},
pages = {30--34},
year = {2016},
url = {https://doi.org/10.1002/jgt.21858},
doi = {10.1002/JGT.21858},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KingR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/JoosPRR16,
author = {Felix Joos and
Guillem Perarnau and
Dieter Rautenbach and
Bruce A. Reed},
editor = {Irit Dinur},
title = {How to Determine if a Random Graph with a Fixed Degree Sequence Has
a Giant Component},
booktitle = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
{USA}},
pages = {695--703},
publisher = {{IEEE} Computer Society},
year = {2016},
url = {https://doi.org/10.1109/FOCS.2016.79},
doi = {10.1109/FOCS.2016.79},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/JoosPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/JoosPRR16,
author = {Felix Joos and
Guillem Perarnau and
Dieter Rautenbach and
Bruce A. Reed},
title = {How to determine if a random graph with a fixed degree sequence has
a giant component},
journal = {CoRR},
volume = {abs/1601.03714},
year = {2016},
url = {http://arxiv.org/abs/1601.03714},
eprinttype = {arXiv},
eprint = {1601.03714},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/JoosPRR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KingR15,
author = {Andrew D. King and
Bruce A. Reed},
title = {Claw-Free Graphs, Skeletal Graphs, and a Stronger Conjecture on {\(\omega\)},
{\(\Delta\)}, and {\(\chi\)}},
journal = {J. Graph Theory},
volume = {78},
number = {3},
pages = {157--194},
year = {2015},
url = {https://doi.org/10.1002/jgt.21797},
doi = {10.1002/JGT.21797},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KingR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/NoelRW15,
author = {Jonathan A. Noel and
Bruce A. Reed and
Hehui Wu},
title = {A Proof of a Conjecture of Ohba},
journal = {J. Graph Theory},
volume = {79},
number = {2},
pages = {86--102},
year = {2015},
url = {https://doi.org/10.1002/jgt.21819},
doi = {10.1002/JGT.21819},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/NoelRW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ChudnovskyNRS15,
author = {Maria Chudnovsky and
Sergey Norin and
Bruce A. Reed and
Paul D. Seymour},
title = {Excluding a Substar and an Antisubstar},
journal = {{SIAM} J. Discret. Math.},
volume = {29},
number = {1},
pages = {297--308},
year = {2015},
url = {https://doi.org/10.1137/130946113},
doi = {10.1137/130946113},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ChudnovskyNRS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cccg/Reed15,
author = {Bruce A. Reed},
title = {Connectivity Preserving Iterative Compression},
booktitle = {Proceedings of the 27th Canadian Conference on Computational Geometry,
{CCCG} 2015, Kingston, Ontario, Canada, August 10-12, 2015},
publisher = {Queen's University, Ontario, Canada},
year = {2015},
url = {http://research.cs.queensu.ca/cccg2015/CCCG15-papers/BruceReed.pdf},
timestamp = {Wed, 12 May 2021 14:19:37 +0200},
biburl = {https://dblp.org/rec/conf/cccg/Reed15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KawarabayashiLR15,
author = {Ken{-}ichi Kawarabayashi and
Zhentao Li and
Bruce A. Reed},
title = {Connectivity Preserving Iterative Compaction and Finding 2 Disjoint
Rooted Paths in Linear Time},
journal = {CoRR},
volume = {abs/1509.07680},
year = {2015},
url = {http://arxiv.org/abs/1509.07680},
eprinttype = {arXiv},
eprint = {1509.07680},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KawarabayashiLR15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiLR14,
author = {Ken{-}ichi Kawarabayashi and
Orlando Lee and
Bruce A. Reed},
title = {Removable paths and cycles with parity constraints},
journal = {J. Comb. Theory {B}},
volume = {106},
pages = {115--133},
year = {2014},
url = {https://doi.org/10.1016/j.jctb.2014.01.005},
doi = {10.1016/J.JCTB.2014.01.005},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiLR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MolloyR14,
author = {Michael Molloy and
Bruce A. Reed},
title = {Colouring graphs when the number of colours is almost the maximum
degree},
journal = {J. Comb. Theory {B}},
volume = {109},
pages = {134--195},
year = {2014},
url = {https://doi.org/10.1016/j.jctb.2014.06.004},
doi = {10.1016/J.JCTB.2014.06.004},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MolloyR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/KangMRS14,
author = {Ross J. Kang and
Colin McDiarmid and
Bruce A. Reed and
Alex D. Scott},
title = {For most graphs \emph{H}, most \emph{H}-free graphs have a linear
homogeneous set},
journal = {Random Struct. Algorithms},
volume = {45},
number = {3},
pages = {343--361},
year = {2014},
url = {https://doi.org/10.1002/rsa.20488},
doi = {10.1002/RSA.20488},
timestamp = {Thu, 15 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/KangMRS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CaiPRW14,
author = {Xing Shi Cai and
Guillem Perarnau and
Bruce A. Reed and
Adam Bene Watts},
title = {Acyclic edge colourings of graphs with large girth},
journal = {CoRR},
volume = {abs/1411.3047},
year = {2014},
url = {http://arxiv.org/abs/1411.3047},
eprinttype = {arXiv},
eprint = {1411.3047},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/CaiPRW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Addario-BerryHSRT13,
author = {Louigi Addario{-}Berry and
Fr{\'{e}}d{\'{e}}ric Havet and
Cl{\'{a}}udia Linhares Sales and
Bruce A. Reed and
St{\'{e}}phan Thomass{\'{e}}},
title = {Oriented trees in digraphs},
journal = {Discret. Math.},
volume = {313},
number = {8},
pages = {967--974},
year = {2013},
url = {https://doi.org/10.1016/j.disc.2013.01.011},
doi = {10.1016/J.DISC.2013.01.011},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Addario-BerryHSRT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/NoelRWWZ13,
author = {Jonathan A. Noel and
Bruce A. Reed and
Douglas B. West and
Hehui Wu and
Xuding Zhu},
title = {Choosability of Graphs with Bounded Order: Ohba's Conjecture and Beyond},
journal = {Electron. Notes Discret. Math.},
volume = {43},
pages = {89--95},
year = {2013},
url = {https://doi.org/10.1016/j.endm.2013.07.015},
doi = {10.1016/J.ENDM.2013.07.015},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/NoelRWWZ13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KingR13,
author = {Andrew D. King and
Bruce A. Reed},
title = {Asymptotics of the Chromatic Number for Quasi-Line Graphs},
journal = {J. Graph Theory},
volume = {73},
number = {3},
pages = {327--341},
year = {2013},
url = {https://doi.org/10.1002/jgt.21679},
doi = {10.1002/JGT.21679},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KingR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KeevashLMR13,
author = {Peter Keevash and
Zhentao Li and
Bojan Mohar and
Bruce A. Reed},
title = {Digraph Girth via Chromatic Number},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {2},
pages = {693--696},
year = {2013},
url = {https://doi.org/10.1137/120875892},
doi = {10.1137/120875892},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/KeevashLMR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/DujmovicHJRW13,
author = {Vida Dujmovic and
Daniel J. Harvey and
Gwena{\"{e}}l Joret and
Bruce A. Reed and
David R. Wood},
title = {A Linear-Time Algorithm for Finding a Complete Graph Minor in a Dense
Graph},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {4},
pages = {1770--1774},
year = {2013},
url = {https://doi.org/10.1137/120866725},
doi = {10.1137/120866725},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/DujmovicHJRW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/GroheKR13,
author = {Martin Grohe and
Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {Sanjeev Khanna},
title = {A Simple Algorithm for the Graph Minor Decomposition - Logic meets
Structural Graph Theory},
booktitle = {Proceedings of the Twenty-Fourth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2013, New Orleans, Louisiana, USA, January 6-8,
2013},
pages = {414--431},
publisher = {{SIAM}},
year = {2013},
url = {https://doi.org/10.1137/1.9781611973105.30},
doi = {10.1137/1.9781611973105.30},
timestamp = {Tue, 02 Feb 2021 17:07:29 +0100},
biburl = {https://dblp.org/rec/conf/soda/GroheKR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Addario-BerryMR12,
author = {Louigi Addario{-}Berry and
Colin McDiarmid and
Bruce A. Reed},
title = {Connectivity for Bridge-Addable Monotone Graph Classes},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {6},
pages = {803--815},
year = {2012},
url = {https://doi.org/10.1017/S0963548312000272},
doi = {10.1017/S0963548312000272},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Addario-BerryMR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CorneilHLRR12,
author = {Derek G. Corneil and
Michel Habib and
Jean{-}Marc Lanlignel and
Bruce A. Reed and
Udi Rotics},
title = {Polynomial-time recognition of clique-width {\(\leq\)}3 graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {834--865},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.03.020},
doi = {10.1016/J.DAM.2011.03.020},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/CorneilHLRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ReedW12,
author = {Bruce A. Reed and
David R. Wood},
title = {Polynomial treewidth forces a large grid-like-minor},
journal = {Eur. J. Comb.},
volume = {33},
number = {3},
pages = {374--379},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2011.09.004},
doi = {10.1016/J.EJC.2011.09.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/ReedW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiKR12,
author = {Ken{-}ichi Kawarabayashi and
Yusuke Kobayashi and
Bruce A. Reed},
title = {The disjoint paths problem in quadratic time},
journal = {J. Comb. Theory {B}},
volume = {102},
number = {2},
pages = {424--435},
year = {2012},
url = {https://doi.org/10.1016/j.jctb.2011.07.004},
doi = {10.1016/J.JCTB.2011.07.004},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiKR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HavetRS12,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Bruce A. Reed and
Jean{-}S{\'{e}}bastien Sereni},
title = {Griggs and Yeh's Conjecture and L(p, 1)-labelings},
journal = {{SIAM} J. Discret. Math.},
volume = {26},
number = {1},
pages = {145--168},
year = {2012},
url = {https://doi.org/10.1137/090763998},
doi = {10.1137/090763998},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HavetRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2624,
author = {Vida Dujmovic and
Daniel J. Harvey and
Gwena{\"{e}}l Joret and
Bruce A. Reed and
David R. Wood},
title = {A linear-time algorithm for finding a complete graph minor in a dense
graph},
journal = {CoRR},
volume = {abs/1202.2624},
year = {2012},
url = {http://arxiv.org/abs/1202.2624},
eprinttype = {arXiv},
eprint = {1202.2624},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2624.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1410,
author = {Andrew D. King and
Bruce A. Reed},
title = {A short proof that {\(\chi\)} can be bounded {\(\epsilon\)} away from
{\(\Delta\)}+1 towards {\(\omega\)}},
journal = {CoRR},
volume = {abs/1211.1410},
year = {2012},
url = {http://arxiv.org/abs/1211.1410},
eprinttype = {arXiv},
eprint = {1211.1410},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1410.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-1999,
author = {Jonathan A. Noel and
Bruce A. Reed and
Hehui Wu},
title = {A Proof of a Conjecture of Ohba},
journal = {CoRR},
volume = {abs/1211.1999},
year = {2012},
url = {http://arxiv.org/abs/1211.1999},
eprinttype = {arXiv},
eprint = {1211.1999},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-1999.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1212-3036,
author = {Andrew D. King and
Bruce A. Reed},
title = {Claw-free graphs, skeletal graphs, and a stronger conjecture on {\textdollar}{\(\omega\)}{\textdollar},
{\textdollar}{\(\Delta\)}{\textdollar}, and {\textdollar}{\(\chi\)}{\textdollar}},
journal = {CoRR},
volume = {abs/1212.3036},
year = {2012},
url = {http://arxiv.org/abs/1212.3036},
eprinttype = {arXiv},
eprint = {1212.3036},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1212-3036.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChudnovskyRS11,
author = {Maria Chudnovsky and
Bruce A. Reed and
Paul D. Seymour},
title = {The edge-density for K\({}_{\mbox{2, t}}\) minors},
journal = {J. Comb. Theory {B}},
volume = {101},
number = {1},
pages = {18--46},
year = {2011},
url = {https://doi.org/10.1016/j.jctb.2010.09.001},
doi = {10.1016/J.JCTB.2010.09.001},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ChudnovskyRS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiRW11,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed and
Paul Wollan},
editor = {Rafail Ostrovsky},
title = {The Graph Minor Algorithm with Parity Conditions},
booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
2011, Palm Springs, CA, USA, October 22-25, 2011},
pages = {27--36},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/FOCS.2011.52},
doi = {10.1109/FOCS.2011.52},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiRW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/Reed11,
author = {Bruce A. Reed},
editor = {Dana Randall},
title = {Graph Coloring via The Probabilistic Method},
booktitle = {Proceedings of the Twenty-Second Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2011, San Francisco, California, USA, January 23-25,
2011},
pages = {184},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973082.16},
doi = {10.1137/1.9781611973082.16},
timestamp = {Tue, 02 Feb 2021 17:07:23 +0100},
biburl = {https://dblp.org/rec/conf/soda/Reed11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1102-0805,
author = {Andrew D. King and
Bruce A. Reed},
title = {Asymptotics of the chromatic number for quasi-line graphs},
journal = {CoRR},
volume = {abs/1102.0805},
year = {2011},
url = {http://arxiv.org/abs/1102.0805},
eprinttype = {arXiv},
eprint = {1102.0805},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1102-0805.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Addario-BerryKKLR10,
author = {Louigi Addario{-}Berry and
W. Sean Kennedy and
Andrew D. King and
Zhentao Li and
Bruce A. Reed},
title = {Finding a maximum-weight induced k-partite subgraph of an i-triangulated
graph},
journal = {Discret. Appl. Math.},
volume = {158},
number = {7},
pages = {765--770},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2008.08.020},
doi = {10.1016/J.DAM.2008.08.020},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Addario-BerryKKLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MolloyR10,
author = {Michael Molloy and
Bruce A. Reed},
title = {Asymptotically optimal frugal colouring},
journal = {J. Comb. Theory {B}},
volume = {100},
number = {2},
pages = {226--246},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2009.07.002},
doi = {10.1016/J.JCTB.2009.07.002},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MolloyR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MolloyR10a,
author = {Michael Molloy and
Bruce A. Reed},
title = {Corrigendum to "Asymptotically optimal frugal colouring"
{[J.} Combin. Theory Ser. {B} 100 {(2)} {(2010)} 226-246]},
journal = {J. Comb. Theory {B}},
volume = {100},
number = {2},
pages = {247--249},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2009.11.002},
doi = {10.1016/J.JCTB.2009.11.002},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MolloyR10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiR10,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
title = {A Separator Theorem in Minor-Closed Classes},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {153--162},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.22},
doi = {10.1109/FOCS.2010.22},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KawarabayashiLR10,
author = {Ken{-}ichi Kawarabayashi and
Zhentao Li and
Bruce A. Reed},
editor = {Moses Charikar},
title = {Recognizing a Totally Odd K\({}_{\mbox{4}}\)-subdivision, Parity 2-disjoint
Rooted Paths and a Parity Cycle Through Specified Elements},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {318--328},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.27},
doi = {10.1137/1.9781611973075.27},
timestamp = {Tue, 02 Feb 2021 17:07:39 +0100},
biburl = {https://dblp.org/rec/conf/soda/KawarabayashiLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KawarabayashiR10,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {Moses Charikar},
title = {An (almost) Linear Time Algorithm for Odd Cyles Transversal},
booktitle = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
pages = {365--378},
publisher = {{SIAM}},
year = {2010},
url = {https://doi.org/10.1137/1.9781611973075.31},
doi = {10.1137/1.9781611973075.31},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/KawarabayashiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiR10,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {Leonard J. Schulman},
title = {Odd cycle packing},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {695--704},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806785},
doi = {10.1145/1806689.1806785},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KawarabayashiR09,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
title = {Highly parity linked graphs},
journal = {Comb.},
volume = {29},
number = {2},
pages = {215--225},
year = {2009},
url = {https://doi.org/10.1007/s00493-009-2178-y},
doi = {10.1007/S00493-009-2178-Y},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KawarabayashiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BirmeleBR09,
author = {Etienne Birmel{\'{e}} and
J. Adrian Bondy and
Bruce A. Reed},
title = {Tree-width of graphs without a 3{\texttimes}3 grid minor},
journal = {Discret. Appl. Math.},
volume = {157},
number = {12},
pages = {2577--2596},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.08.003},
doi = {10.1016/J.DAM.2008.08.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/BirmeleBR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KennedyMR09,
author = {W. Sean Kennedy and
Conor Meagher and
Bruce A. Reed},
title = {Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear
Time},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {47--51},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.008},
doi = {10.1016/J.ENDM.2009.07.008},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KennedyMR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FountoulakisR09,
author = {Nikolaos Fountoulakis and
Bruce A. Reed},
title = {A general critical condition for the emergence of a giant component
in random graphs with given degrees},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {639--645},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.108},
doi = {10.1016/J.ENDM.2009.07.108},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/FountoulakisR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ItoKR09,
author = {Takehiro Ito and
W. Sean Kennedy and
Bruce A. Reed},
title = {A Characterization of Graphs with Fractional Total Chromatic Number
Equal to Delta+2},
journal = {Electron. Notes Discret. Math.},
volume = {35},
pages = {235--240},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.11.039},
doi = {10.1016/J.ENDM.2009.11.039},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ItoKR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GeelenGRSV09,
author = {Jim Geelen and
Bert Gerards and
Bruce A. Reed and
Paul D. Seymour and
Adrian Vetta},
title = {On the odd-minor variant of Hadwiger's conjecture},
journal = {J. Comb. Theory {B}},
volume = {99},
number = {1},
pages = {20--29},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.03.006},
doi = {10.1016/J.JCTB.2008.03.006},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/GeelenGRSV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiRL09,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed and
Orlando Lee},
title = {Removable cycles in non-bipartite graphs},
journal = {J. Comb. Theory {B}},
volume = {99},
number = {1},
pages = {30--38},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.03.007},
doi = {10.1016/J.JCTB.2008.03.007},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiRL09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Addario-BerryBR09,
author = {Louigi Addario{-}Berry and
Nicolas Broutin and
Bruce A. Reed},
title = {Critical random graphs and the structure of a minimum spanning tree},
journal = {Random Struct. Algorithms},
volume = {35},
number = {3},
pages = {323--347},
year = {2009},
url = {https://doi.org/10.1002/rsa.20241},
doi = {10.1002/RSA.20241},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Addario-BerryBR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/ReedW09,
author = {Bruce A. Reed and
David R. Wood},
title = {A linear-time algorithm to find a separator in a graph excluding a
minor},
journal = {{ACM} Trans. Algorithms},
volume = {5},
number = {4},
pages = {39:1--39:16},
year = {2009},
url = {https://doi.org/10.1145/1597036.1597043},
doi = {10.1145/1597036.1597043},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/talg/ReedW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/LevequeMRT09,
author = {Benjamin L{\'{e}}v{\^{e}}que and
Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed and
Nicolas Trotignon},
title = {Coloring Artemis graphs},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2234--2240},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.02.012},
doi = {10.1016/J.TCS.2009.02.012},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/LevequeMRT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MolloyR09,
author = {Michael Molloy and
Bruce A. Reed},
editor = {Claire Mathieu},
title = {Asymptotically optimal frugal colouring},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {106--114},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.12},
doi = {10.1137/1.9781611973068.12},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/MolloyR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KawarabayashiR09,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {Claire Mathieu},
title = {A nearly linear time algorithm for the half integral parity disjoint
paths packing problem},
booktitle = {Proceedings of the Twentieth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2009, New York, NY, USA, January 4-6, 2009},
pages = {1183--1192},
publisher = {{SIAM}},
year = {2009},
url = {https://doi.org/10.1137/1.9781611973068.128},
doi = {10.1137/1.9781611973068.128},
timestamp = {Mon, 12 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/soda/KawarabayashiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiR09,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {Michael Mitzenmacher},
title = {Hadwiger's conjecture is decidable},
booktitle = {Proceedings of the 41st Annual {ACM} Symposium on Theory of Computing,
{STOC} 2009, Bethesda, MD, USA, May 31 - June 2, 2009},
pages = {445--454},
publisher = {{ACM}},
year = {2009},
url = {https://doi.org/10.1145/1536414.1536476},
doi = {10.1145/1536414.1536476},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/McDiarmidR08,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {On the Maximum Degree of a Random Planar Graph},
journal = {Comb. Probab. Comput.},
volume = {17},
number = {4},
pages = {591--601},
year = {2008},
url = {https://doi.org/10.1017/S0963548308009097},
doi = {10.1017/S0963548308009097},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/McDiarmidR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/MeagherR08,
author = {Conor Meagher and
Bruce A. Reed},
title = {Fractionally total colouring G\({}_{\mbox{n, p}}\)},
journal = {Discret. Appl. Math.},
volume = {156},
number = {7},
pages = {1112--1124},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.052},
doi = {10.1016/J.DAM.2007.05.052},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/MeagherR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Reed08,
author = {Bruce A. Reed},
title = {Skew partitions in perfect graphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {7},
pages = {1150--1156},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.054},
doi = {10.1016/J.DAM.2007.05.054},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Reed08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Addario-BerryDR08,
author = {Louigi Addario{-}Berry and
Ketan Dalal and
Bruce A. Reed},
title = {Degree constrained subgraphs},
journal = {Discret. Appl. Math.},
volume = {156},
number = {7},
pages = {1168--1174},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.05.059},
doi = {10.1016/J.DAM.2007.05.059},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Addario-BerryDR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FioriniHRV08,
author = {Samuel Fiorini and
Nadia Hardy and
Bruce A. Reed and
Adrian Vetta},
title = {Planar graph bipartization in linear time},
journal = {Discret. Appl. Math.},
volume = {156},
number = {7},
pages = {1175--1180},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.08.013},
doi = {10.1016/J.DAM.2007.08.013},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FioriniHRV08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/CerioliFFMPR08,
author = {M{\'{a}}rcia R. Cerioli and
Lu{\'{e}}rbio Faria and
Talita O. Ferreira and
Carlos A. J. Martinhon and
F{\'{a}}bio Protti and
Bruce A. Reed},
title = {Partition into cliques for cubic graphs: Planar case, complexity and
approximation},
journal = {Discret. Appl. Math.},
volume = {156},
number = {12},
pages = {2270--2278},
year = {2008},
url = {https://doi.org/10.1016/j.dam.2007.10.015},
doi = {10.1016/J.DAM.2007.10.015},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/CerioliFFMPR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KawarabayashiR08,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
title = {Fractional coloring and the odd Hadwiger's conjecture},
journal = {Eur. J. Comb.},
volume = {29},
number = {2},
pages = {411--417},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.02.010},
doi = {10.1016/J.EJC.2007.02.010},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KawarabayashiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/AminiR08,
author = {Omid Amini and
Bruce A. Reed},
title = {List Colouring Constants of Triangle Free Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {30},
pages = {135--140},
year = {2008},
url = {https://doi.org/10.1016/j.endm.2008.01.024},
doi = {10.1016/J.ENDM.2008.01.024},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/AminiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiLRW08,
author = {Ken{-}ichi Kawarabayashi and
Orlando Lee and
Bruce A. Reed and
Paul Wollan},
title = {A weaker version of Lov{\'{a}}sz' path removal conjecture},
journal = {J. Comb. Theory {B}},
volume = {98},
number = {5},
pages = {972--979},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.11.003},
doi = {10.1016/J.JCTB.2007.11.003},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiLRW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Addario-BerryCHRS08,
author = {Louigi Addario{-}Berry and
Maria Chudnovsky and
Fr{\'{e}}d{\'{e}}ric Havet and
Bruce A. Reed and
Paul D. Seymour},
title = {Bisimplicial vertices in even-hole-free graphs},
journal = {J. Comb. Theory {B}},
volume = {98},
number = {6},
pages = {1119--1164},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.12.006},
doi = {10.1016/J.JCTB.2007.12.006},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Addario-BerryCHRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KingR08,
author = {Andrew D. King and
Bruce A. Reed},
title = {Bounding chi in terms of omega and delta for quasi-line graphs},
journal = {J. Graph Theory},
volume = {59},
number = {3},
pages = {215--228},
year = {2008},
url = {https://doi.org/10.1002/jgt.20334},
doi = {10.1002/JGT.20334},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KingR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FountoulakisR08,
author = {Nikolaos Fountoulakis and
Bruce A. Reed},
title = {The evolution of the mixing rate of a simple random walk on the giant
component of a random graph},
journal = {Random Struct. Algorithms},
volume = {33},
number = {1},
pages = {68--86},
year = {2008},
url = {https://doi.org/10.1002/rsa.20210},
doi = {10.1002/RSA.20210},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FountoulakisR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/SalesMR08,
author = {Cl{\'{a}}udia Linhares Sales and
Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed},
title = {On Planar Quasi-Parity Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {22},
number = {1},
pages = {329--347},
year = {2008},
url = {https://doi.org/10.1137/060672649},
doi = {10.1137/060672649},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/SalesMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/KawarabayashiMR08,
author = {Ken{-}ichi Kawarabayashi and
Bojan Mohar and
Bruce A. Reed},
title = {A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary
Surface and the Genus of Graphs of Bounded Tree-Width},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {771--780},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.53},
doi = {10.1109/FOCS.2008.53},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/KawarabayashiMR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/ReedL08,
author = {Bruce A. Reed and
Zhentao Li},
editor = {Eduardo Sany Laber and
Claudson F. Bornstein and
Loana Tito Nogueira and
Lu{\'{e}}rbio Faria},
title = {Optimization and Recognition for {K} 5-minor Free Graphs in Linear
Time},
booktitle = {{LATIN} 2008: Theoretical Informatics, 8th Latin American Symposium,
B{\'{u}}zios, Brazil, April 7-11, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4957},
pages = {206--215},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-78773-0\_18},
doi = {10.1007/978-3-540-78773-0\_18},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/ReedL08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KawarabayashiR08,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {Shang{-}Hua Teng},
title = {A nearly linear time algorithm for the half integral disjoint paths
packing},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {446--454},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347131},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/KawarabayashiR08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HavetRS08,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Bruce A. Reed and
Jean{-}S{\'{e}}bastien Sereni},
editor = {Shang{-}Hua Teng},
title = {L(2, 1)-labelling of graphs},
booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
2008},
pages = {621--630},
publisher = {{SIAM}},
year = {2008},
url = {http://dl.acm.org/citation.cfm?id=1347082.1347151},
timestamp = {Fri, 07 Dec 2012 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/soda/HavetRS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Addario-BerryDMRT07,
author = {Louigi Addario{-}Berry and
Ketan Dalal and
Colin McDiarmid and
Bruce A. Reed and
Andrew Thomason},
title = {Vertex-Colouring Edge-Weightings},
journal = {Comb.},
volume = {27},
number = {1},
pages = {1--12},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-0041-6},
doi = {10.1007/S00493-007-0041-6},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Addario-BerryDMRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BirmeleBR07,
author = {Etienne Birmel{\'{e}} and
J. Adrian Bondy and
Bruce A. Reed},
title = {The Erd{\"{o}}s-P{\'{o}}sa Property For Long Circuits},
journal = {Comb.},
volume = {27},
number = {2},
pages = {135--145},
year = {2007},
url = {https://doi.org/10.1007/s00493-007-0047-0},
doi = {10.1007/S00493-007-0047-0},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BirmeleBR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/KingRV07,
author = {Andrew D. King and
Bruce A. Reed and
Adrian Vetta},
title = {An upper bound for the chromatic number of line graphs},
journal = {Eur. J. Comb.},
volume = {28},
number = {8},
pages = {2182--2187},
year = {2007},
url = {https://doi.org/10.1016/j.ejc.2007.04.014},
doi = {10.1016/J.EJC.2007.04.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/KingRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KingR07,
author = {Andrew D. King and
Bruce A. Reed},
title = {Asymptotics of the chromatic number for quasi-line graphs},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {327--331},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.056},
doi = {10.1016/J.ENDM.2007.07.056},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KingR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/HavetHMR07,
author = {Fr{\'{e}}d{\'{e}}ric Havet and
Jan van den Heuvel and
Colin McDiarmid and
Bruce A. Reed},
title = {List Colouring Squares of Planar Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {29},
pages = {515--519},
year = {2007},
url = {https://doi.org/10.1016/j.endm.2007.07.079},
doi = {10.1016/J.ENDM.2007.07.079},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/HavetHMR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AvisBCR07,
author = {David Avis and
J. Adrian Bondy and
William J. Cook and
Bruce A. Reed},
title = {Va{\v{s}}ek Chv{\'{a}}tal: {A} Very Short Introduction},
journal = {Graphs Comb.},
volume = {23},
number = {Supplement-1},
pages = {41--65},
year = {2007},
url = {https://doi.org/10.1007/s00373-007-0721-4},
doi = {10.1007/S00373-007-0721-4},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AvisBCR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/FioriniHRV07,
author = {Samuel Fiorini and
Nadia Hardy and
Bruce A. Reed and
Adrian Vetta},
title = {Approximate min-max relations for odd cycles in planar graphs},
journal = {Math. Program.},
volume = {110},
number = {1},
pages = {71--91},
year = {2007},
url = {https://doi.org/10.1007/s10107-006-0063-7},
doi = {10.1007/S10107-006-0063-7},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mp/FioriniHRV07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/ChattopadhyayR07,
author = {Arkadev Chattopadhyay and
Bruce A. Reed},
editor = {Moses Charikar and
Klaus Jansen and
Omer Reingold and
Jos{\'{e}} D. P. Rolim},
title = {Properly 2-Colouring Linear Hypergraphs},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, 10th International Workshop, {APPROX} 2007, and 11th
International Workshop, {RANDOM} 2007, Princeton, NJ, USA, August
20-22, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4627},
pages = {395--408},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74208-1\_29},
doi = {10.1007/978-3-540-74208-1\_29},
timestamp = {Sat, 30 Sep 2023 09:34:32 +0200},
biburl = {https://dblp.org/rec/conf/approx/ChattopadhyayR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/KennedyR07,
author = {William S. Kennedy and
Bruce A. Reed},
editor = {Hiro Ito and
Mikio Kano and
Naoki Katoh and
Yushi Uno},
title = {Fast Skew Partition Recognition},
booktitle = {Computational Geometry and Graph Theory - International Conference,
KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4535},
pages = {101--107},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-89550-3\_11},
doi = {10.1007/978-3-540-89550-3\_11},
timestamp = {Tue, 14 May 2019 10:00:52 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/KennedyR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jcdcg/RautenbachR07,
author = {Dieter Rautenbach and
Bruce A. Reed},
editor = {Hiro Ito and
Mikio Kano and
Naoki Katoh and
Yushi Uno},
title = {Domination in Cubic Graphs of Large Girth},
booktitle = {Computational Geometry and Graph Theory - International Conference,
KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {4535},
pages = {186--190},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-89550-3\_20},
doi = {10.1007/978-3-540-89550-3\_20},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/jcdcg/RautenbachR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiR07,
author = {Ken{-}ichi Kawarabayashi and
Bruce A. Reed},
editor = {David S. Johnson and
Uriel Feige},
title = {Computing crossing number in linear time},
booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing,
San Diego, California, USA, June 11-13, 2007},
pages = {382--390},
publisher = {{ACM}},
year = {2007},
url = {https://doi.org/10.1145/1250790.1250848},
doi = {10.1145/1250790.1250848},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiR07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidR06,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Concentration for self-bounding functions and an inequality of Talagrand},
journal = {Random Struct. Algorithms},
volume = {29},
number = {4},
pages = {549--557},
year = {2006},
url = {https://doi.org/10.1002/rsa.20145},
doi = {10.1002/RSA.20145},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidR06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Addario-BerryDR05,
author = {Louigi Addario{-}Berry and
Ketan Dalal and
Bruce A. Reed},
title = {Degree constrained subgraphs},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {257--263},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.035},
doi = {10.1016/J.ENDM.2005.05.035},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Addario-BerryDR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FioriniHRV05,
author = {Samuel Fiorini and
Nadia Hardy and
Bruce A. Reed and
Adrian Vetta},
title = {Planar graph bipartization in linear time},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {265--271},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.036},
doi = {10.1016/J.ENDM.2005.05.036},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FioriniHRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MeagherR05,
author = {Conor Meagher and
Bruce A. Reed},
title = {Fractionally total colouring G\({}_{\mbox{n, p}}\)},
journal = {Electron. Notes Discret. Math.},
volume = {19},
pages = {297--303},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.05.040},
doi = {10.1016/J.ENDM.2005.05.040},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MeagherR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ita/EverettFKR05,
author = {Hazel Everett and
Celina M. H. de Figueiredo and
Sulamita Klein and
Bruce A. Reed},
title = {The perfection and recognition of bull-reducible Berge graphs},
journal = {{RAIRO} Theor. Informatics Appl.},
volume = {39},
number = {1},
pages = {145--160},
year = {2005},
url = {https://doi.org/10.1051/ita:2005009},
doi = {10.1051/ITA:2005009},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/EverettFKR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FarzadMR05,
author = {Babak Farzad and
Michael S. O. Molloy and
Bruce A. Reed},
title = {(\emph{Delta-k})-critical graphs},
journal = {J. Comb. Theory {B}},
volume = {93},
number = {2},
pages = {173--185},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2004.09.006},
doi = {10.1016/J.JCTB.2004.09.006},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FarzadMR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Addario-BerryADR05,
author = {Louigi Addario{-}Berry and
Robert E. L. Aldred and
Ketan Dalal and
Bruce A. Reed},
title = {Vertex colouring edge partitions},
journal = {J. Comb. Theory {B}},
volume = {94},
number = {2},
pages = {237--244},
year = {2005},
url = {https://doi.org/10.1016/j.jctb.2005.01.001},
doi = {10.1016/J.JCTB.2005.01.001},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Addario-BerryADR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/AvisSR05,
author = {David Avis and
Caterina De Simone and
Bruce A. Reed},
title = {On the fractional chromatic index of a graph and its complement},
journal = {Oper. Res. Lett.},
volume = {33},
number = {4},
pages = {385--388},
year = {2005},
url = {https://doi.org/10.1016/j.orl.2004.08.009},
doi = {10.1016/J.ORL.2004.08.009},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/AvisSR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FioriniHRV05,
author = {Samuel Fiorini and
Nadia Hardy and
Bruce A. Reed and
Adrian Vetta},
editor = {Michael J{\"{u}}nger and
Volker Kaibel},
title = {Approximate Min-max Relations for Odd Cycles in Planar Graphs},
booktitle = {Integer Programming and Combinatorial Optimization, 11th International
{IPCO} Conference, Berlin, Germany, June 8-10, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3509},
pages = {35--50},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11496915\_4},
doi = {10.1007/11496915\_4},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FioriniHRV05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/LiR05,
author = {Zhentao Li and
Bruce A. Reed},
editor = {Frank K. H. A. Dehne and
Alejandro L{\'{o}}pez{-}Ortiz and
J{\"{o}}rg{-}R{\"{u}}diger Sack},
title = {Heap Building Bounds},
booktitle = {Algorithms and Data Structures, 9th International Workshop, {WADS}
2005, Waterloo, Canada, August 15-17, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3608},
pages = {14--23},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11534273\_3},
doi = {10.1007/11534273\_3},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/LiR05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0504082,
author = {Benjamin L{\'{e}}v{\^{e}}que and
Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed and
Nicolas Trotignon},
title = {Coloring Artemis graphs},
journal = {CoRR},
volume = {abs/cs/0504082},
year = {2005},
url = {http://arxiv.org/abs/cs/0504082},
eprinttype = {arXiv},
eprint = {cs/0504082},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0504082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ReedS04,
author = {Bruce A. Reed and
Benny Sudakov},
title = {List Colouring When The Chromatic Number Is Close To the Order Of
The Graph},
journal = {Comb.},
volume = {25},
number = {1},
pages = {117--123},
year = {2004},
url = {https://doi.org/10.1007/s00493-005-0010-x},
doi = {10.1007/S00493-005-0010-X},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ReedS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ReedSS04,
author = {Bruce A. Reed and
Siang W. Song and
Jayme Luiz Szwarcfiter},
title = {Preface},
journal = {Discret. Appl. Math.},
volume = {141},
number = {1-3},
pages = {1},
year = {2004},
url = {https://doi.org/10.1016/S0166-218X(03)00362-7},
doi = {10.1016/S0166-218X(03)00362-7},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ReedSS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DantasFKGR04,
author = {Simone Dantas and
Celina M. H. de Figueiredo and
Sulamita Klein and
Sylvain Gravier and
Bruce A. Reed},
title = {Stable skew partition problem},
journal = {Discret. Appl. Math.},
volume = {143},
number = {1-3},
pages = {17--22},
year = {2004},
url = {https://doi.org/10.1016/j.dam.2004.01.001},
doi = {10.1016/J.DAM.2004.01.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DantasFKGR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ReedS04,
author = {Bruce A. Reed and
Paul D. Seymour},
title = {Hadwiger's conjecture for line graphs},
journal = {Eur. J. Comb.},
volume = {25},
number = {6},
pages = {873--876},
year = {2004},
url = {https://doi.org/10.1016/j.ejc.2003.09.020},
doi = {10.1016/J.EJC.2003.09.020},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/ReedS04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DeVosDOSRSV04,
author = {Matt DeVos and
Guoli Ding and
Bogdan Oporowski and
Daniel P. Sanders and
Bruce A. Reed and
Paul D. Seymour and
Dirk Vertigan},
title = {Excluding any graph as a minor allows a low tree-width 2-coloring},
journal = {J. Comb. Theory {B}},
volume = {91},
number = {1},
pages = {25--41},
year = {2004},
url = {https://doi.org/10.1016/j.jctb.2003.09.001},
doi = {10.1016/J.JCTB.2003.09.001},
timestamp = {Tue, 23 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/DeVosDOSRSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FertinRR04,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Bruce A. Reed},
title = {Star coloring of graphs},
journal = {J. Graph Theory},
volume = {47},
number = {3},
pages = {163--182},
year = {2004},
url = {https://doi.org/10.1002/jgt.20029},
doi = {10.1002/JGT.20029},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FertinRR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/ReedSV04,
author = {Bruce A. Reed and
Kaleigh Smith and
Adrian Vetta},
title = {Finding odd cycle transversals},
journal = {Oper. Res. Lett.},
volume = {32},
number = {4},
pages = {299--301},
year = {2004},
url = {https://doi.org/10.1016/j.orl.2003.10.009},
doi = {10.1016/J.ORL.2003.10.009},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/orl/ReedSV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/HoangR04,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Bruce A. Reed},
title = {On the Co-P\({}_{\mbox{3}}\)-Structure of Perfect Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {18},
number = {3},
pages = {571--576},
year = {2004},
url = {https://doi.org/10.1137/S0895480100370797},
doi = {10.1137/S0895480100370797},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/HoangR04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoeblNR03,
author = {Martin Loebl and
Jaroslav Nesetril and
Bruce A. Reed},
title = {A note on random homomorphism from arbitrary graphs to {Z}},
journal = {Discret. Math.},
volume = {273},
number = {1-3},
pages = {173--181},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00235-8},
doi = {10.1016/S0012-365X(03)00235-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoeblNR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McDiarmidR03,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Channel assignment on graphs of bounded treewidth},
journal = {Discret. Math.},
volume = {273},
number = {1-3},
pages = {183--192},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00236-X},
doi = {10.1016/S0012-365X(03)00236-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/McDiarmidR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Reed03,
author = {Bruce A. Reed},
title = {The height of a random binary search tree},
journal = {J. {ACM}},
volume = {50},
number = {3},
pages = {306--332},
year = {2003},
url = {https://doi.org/10.1145/765568.765571},
doi = {10.1145/765568.765571},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Reed03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/CalinescuFR03,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Bruce A. Reed},
title = {Multicuts in unweighted graphs and digraphs with bounded degree and
bounded tree-width},
journal = {J. Algorithms},
volume = {48},
number = {2},
pages = {333--359},
year = {2003},
url = {https://doi.org/10.1016/S0196-6774(03)00073-7},
doi = {10.1016/S0196-6774(03)00073-7},
timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/CalinescuFR03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperFR02,
author = {Colin Cooper and
Alan M. Frieze and
Bruce A. Reed},
title = {Random Regular Graphs Of Non-Constant Degree: Connectivity And Hamiltonicity},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {3},
pages = {249--261},
year = {2002},
url = {https://doi.org/10.1017/S0963548301005090},
doi = {10.1017/S0963548301005090},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperFR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperFRR02,
author = {Colin Cooper and
Alan M. Frieze and
Bruce A. Reed and
Oliver Riordan},
title = {Random Regular Graphs Of Non-Constant Degree: Independence And Chromatic
Number},
journal = {Comb. Probab. Comput.},
volume = {11},
number = {4},
pages = {323--341},
year = {2002},
url = {https://doi.org/10.1017/S0963548302005254},
doi = {10.1017/S0963548302005254},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperFRR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ReedS02,
author = {Bruce A. Reed and
Benny Sudakov},
title = {Asymptotically the List Colouring Constants Are 1},
journal = {J. Comb. Theory {B}},
volume = {86},
number = {1},
pages = {27--37},
year = {2002},
url = {https://doi.org/10.1006/jctb.2002.2110},
doi = {10.1006/JCTB.2002.2110},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ReedS02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/HaywardHR02,
author = {Ryan B. Hayward and
Stefan Hougardy and
Bruce A. Reed},
editor = {David Eppstein},
title = {Polynomial time recognition of P4-structure},
booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, January 6-8, 2002, San Francisco, CA, {USA}},
pages = {382--389},
publisher = {{ACM/SIAM}},
year = {2002},
url = {http://dl.acm.org/citation.cfm?id=545381.545431},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/HaywardHR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/RautenbachR01,
author = {Dieter Rautenbach and
Bruce A. Reed},
title = {The Erdos-P{\'{o}}sa Property for Odd Cycles in Highly Connected
Graphs},
journal = {Comb.},
volume = {21},
number = {2},
pages = {267--278},
year = {2001},
url = {https://doi.org/10.1007/s004930100024},
doi = {10.1007/S004930100024},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/RautenbachR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/EverettFKR01,
author = {Hazel Everett and
Celina M. H. de Figueiredo and
Sulamita Klein and
Bruce A. Reed},
title = {Bull-Reducible Berge Graphs are Perfect},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {93--95},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00368-3},
doi = {10.1016/S1571-0653(04)00368-3},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/EverettFKR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LoeblNR01,
author = {Martin Loebl and
Jaroslav Nesetril and
Bruce A. Reed},
title = {A note on Random Homomorphism from ArbitraryGraphs to {Z}},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {176--180},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00388-9},
doi = {10.1016/S1571-0653(04)00388-9},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LoeblNR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/McDiarmidR01,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Channel Assignment on Nearly Bipartite and Bounded Treewidth Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {198--201},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00393-2},
doi = {10.1016/S1571-0653(04)00393-2},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/McDiarmidR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/SalesMR01,
author = {Cl{\'{a}}udia Linhares Sales and
Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed},
title = {Recognizing Planar Strict Quasi-Parity Graphs},
journal = {Graphs Comb.},
volume = {17},
number = {4},
pages = {745--757},
year = {2001},
url = {https://doi.org/10.1007/s003730170014},
doi = {10.1007/S003730170014},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/SalesMR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/RautenbachR01,
author = {Dieter Rautenbach and
Bruce A. Reed},
editor = {S. Rao Kosaraju},
title = {Approximately covering by cycles in planar graphs},
booktitle = {Proceedings of the Twelfth Annual Symposium on Discrete Algorithms,
January 7-9, 2001, Washington, DC, {USA}},
pages = {402--406},
publisher = {{ACM/SIAM}},
year = {2001},
url = {http://dl.acm.org/citation.cfm?id=365411.365487},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/RautenbachR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MolloyR01,
author = {Michael Molloy and
Bruce A. Reed},
editor = {Jeffrey Scott Vitter and
Paul G. Spirakis and
Mihalis Yannakakis},
title = {Colouring graphs when the number of colours is nearly the maximum
degree},
booktitle = {Proceedings on 33rd Annual {ACM} Symposium on Theory of Computing,
July 6-8, 2001, Heraklion, Crete, Greece},
pages = {462--470},
publisher = {{ACM}},
year = {2001},
url = {https://doi.org/10.1145/380752.380840},
doi = {10.1145/380752.380840},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MolloyR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/FertinRR01,
author = {Guillaume Fertin and
Andr{\'{e}} Raspaud and
Bruce A. Reed},
editor = {Andreas Brandst{\"{a}}dt and
Van Bang Le},
title = {On Star Coloring of Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 27th International Workshop,
{WG} 2001, Boltenhagen, Germany, June 14-16, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2204},
pages = {140--153},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-45477-2\_14},
doi = {10.1007/3-540-45477-2\_14},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/FertinRR01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BergeR00,
author = {Claude Berge and
Bruce A. Reed},
title = {Optimal packings of edge-disjoint odd cycles},
journal = {Discret. Math.},
volume = {211},
pages = {197--202},
year = {2000},
url = {https://doi.org/10.1016/S0012-365X(99)00283-6},
doi = {10.1016/S0012-365X(99)00283-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BergeR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/MolloyR00,
author = {Michael Molloy and
Bruce A. Reed},
title = {k-Colouring when k is close to Delta},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {235--238},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80173-8},
doi = {10.1016/S1571-0653(05)80173-8},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/MolloyR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijfcs/PerkovicR00,
author = {Ljubomir Perkovic and
Bruce A. Reed},
title = {An Improved Algorithm for Finding Tree Decompositions of Small Width},
journal = {Int. J. Found. Comput. Sci.},
volume = {11},
number = {3},
pages = {365--371},
year = {2000},
url = {https://doi.org/10.1142/S0129054100000247},
doi = {10.1142/S0129054100000247},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/PerkovicR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FigueiredoKKR00,
author = {Celina M. H. de Figueiredo and
Sulamita Klein and
Yoshiharu Kohayakawa and
Bruce A. Reed},
title = {Finding Skew Partitions Efficiently},
journal = {J. Algorithms},
volume = {37},
number = {2},
pages = {505--521},
year = {2000},
url = {https://doi.org/10.1006/jagm.1999.1122},
doi = {10.1006/JAGM.1999.1122},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FigueiredoKKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ReedT00,
author = {Bruce A. Reed and
Robin Thomas},
title = {Clique Minors in Graphs and Their Complements},
journal = {J. Comb. Theory {B}},
volume = {78},
number = {1},
pages = {81--85},
year = {2000},
url = {https://doi.org/10.1006/jctb.1999.1930},
doi = {10.1006/JCTB.1999.1930},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ReedT00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/McDiarmidR00,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Channel assignment and weighted coloring},
journal = {Networks},
volume = {36},
number = {2},
pages = {114--117},
year = {2000},
url = {https://doi.org/10.1002/1097-0037(200009)36:2\&\#60;114::AID-NET6\&\#62;3.0.CO;2-G},
doi = {10.1002/1097-0037(200009)36:2\&\#60;114::AID-NET6\&\#62;3.0.CO;2-G},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/McDiarmidR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MolloyR00,
author = {Michael Molloy and
Bruce A. Reed},
title = {Near-optimal list colorings},
journal = {Random Struct. Algorithms},
volume = {17},
number = {3-4},
pages = {376--402},
year = {2000},
url = {https://doi.org/10.1002/1098-2418(200010/12)17:3/4\&\#60;376::AID-RSA10\&\#62;3.0.CO;2-0},
doi = {10.1002/1098-2418(200010/12)17:3/4\&\#60;376::AID-RSA10\&\#62;3.0.CO;2-0},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MolloyR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/CorneilHLRR00,
author = {Derek G. Corneil and
Michel Habib and
Jean{-}Marc Lanlignel and
Bruce A. Reed and
Udi Rotics},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Polynomial Time Recognition of Clique-Width {\textbackslash}le {\textbackslash}leq
3 Graphs (Extended Abstract)},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {126--134},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_14},
doi = {10.1007/10719839\_14},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/latin/CorneilHLRR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/FigueiredoKKR00,
author = {Celina M. H. de Figueiredo and
Sulamita Klein and
Yoshiharu Kohayakawa and
Bruce A. Reed},
editor = {Gaston H. Gonnet and
Daniel Panario and
Alfredo Viola},
title = {Finding Skew Partitions Efficiently},
booktitle = {{LATIN} 2000: Theoretical Informatics, 4th Latin American Symposium,
Punta del Este, Uruguay, April 10-14, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1776},
pages = {163--172},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/10719839\_18},
doi = {10.1007/10719839\_18},
timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/latin/FigueiredoKKR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Reed00,
author = {Bruce A. Reed},
editor = {F. Frances Yao and
Eugene M. Luks},
title = {How tall is a tree?},
booktitle = {Proceedings of the Thirty-Second Annual {ACM} Symposium on Theory
of Computing, May 21-23, 2000, Portland, OR, {USA}},
pages = {479--483},
publisher = {{ACM}},
year = {2000},
url = {https://doi.org/10.1145/335305.335360},
doi = {10.1145/335305.335360},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Reed00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Reed99,
author = {Bruce A. Reed},
title = {Mangoes and Blueberries},
journal = {Comb.},
volume = {19},
number = {2},
pages = {267--296},
year = {1999},
url = {https://doi.org/10.1007/s004930050056},
doi = {10.1007/S004930050056},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Reed99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/MolloyR99,
author = {Michael Molloy and
Bruce A. Reed},
title = {Critical Subgraphs of a Random Graph},
journal = {Electron. J. Comb.},
volume = {6},
year = {1999},
url = {https://doi.org/10.37236/1467},
doi = {10.37236/1467},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/MolloyR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McDiarmidR99,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Colouring proximity graphs in the plane},
journal = {Discret. Math.},
volume = {199},
number = {1-3},
pages = {123--137},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(98)00292-1},
doi = {10.1016/S0012-365X(98)00292-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/McDiarmidR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/Reed99,
author = {Bruce A. Reed},
title = {Introducing Directed Tree Width},
journal = {Electron. Notes Discret. Math.},
volume = {3},
pages = {222--229},
year = {1999},
url = {https://doi.org/10.1016/S1571-0653(05)80061-7},
doi = {10.1016/S1571-0653(05)80061-7},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/Reed99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MaffrayR99,
author = {Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed},
title = {A Description of Claw-Free Perfect Graphs},
journal = {J. Comb. Theory {B}},
volume = {75},
number = {1},
pages = {134--156},
year = {1999},
url = {https://doi.org/10.1006/jctb.1998.1872},
doi = {10.1006/JCTB.1998.1872},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MaffrayR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Reed99,
author = {Bruce A. Reed},
title = {A Strengthening of Brooks' Theorem},
journal = {J. Comb. Theory {B}},
volume = {76},
number = {2},
pages = {136--149},
year = {1999},
url = {https://doi.org/10.1006/jctb.1998.1891},
doi = {10.1006/JCTB.1998.1891},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Reed99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MahadevR99,
author = {Nadimpalli V. R. Mahadev and
Bruce A. Reed},
title = {A note on vertex orders for stability number},
journal = {J. Graph Theory},
volume = {30},
number = {2},
pages = {113--120},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199902)30:2\&\#60;113::AID-JGT5\&\#62;3.0.CO;2-\%23},
doi = {10.1002/(SICI)1097-0118(199902)30:2\&\#60;113::AID-JGT5\&\#62;3.0.CO;2-\%23},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MahadevR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Reed99,
author = {Bruce A. Reed},
title = {The list colouring constants},
journal = {J. Graph Theory},
volume = {31},
number = {2},
pages = {149--153},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0118(199906)31:2\&\#60;149::AID-JGT8\&\#62;3.0.CO;2-\%23},
doi = {10.1002/(SICI)1097-0118(199906)31:2\&\#60;149::AID-JGT8\&\#62;3.0.CO;2-\%23},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Reed99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/Reed99,
author = {Bruce A. Reed},
title = {Edge coloring nearly bipartite graphs},
journal = {Oper. Res. Lett.},
volume = {24},
number = {1-2},
pages = {11--14},
year = {1999},
url = {https://doi.org/10.1016/S0167-6377(98)00041-8},
doi = {10.1016/S0167-6377(98)00041-8},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/Reed99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/PerkovicR99,
author = {Ljubomir Perkovic and
Bruce A. Reed},
editor = {Peter Widmayer and
Gabriele Neyer and
Stephan J. Eidenbenz},
title = {An Improved Algorithm for Finding Tree Decompositions of Small Width},
booktitle = {Graph-Theoretic Concepts in Computer Science, 25th International Workshop,
{WG} '99, Ascona, Switzerland, June 17-19, 1999, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1665},
pages = {148--154},
publisher = {Springer},
year = {1999},
url = {https://doi.org/10.1007/3-540-46784-X\_15},
doi = {10.1007/3-540-46784-X\_15},
timestamp = {Wed, 11 Sep 2019 13:15:53 +0200},
biburl = {https://dblp.org/rec/conf/wg/PerkovicR99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MolloyR98,
author = {Michael Molloy and
Bruce A. Reed},
title = {A Bound on the Total Chromatic Number},
journal = {Comb.},
volume = {18},
number = {2},
pages = {241--280},
year = {1998},
url = {https://doi.org/10.1007/PL00009820},
doi = {10.1007/PL00009820},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/MolloyR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/MolloyR98,
author = {Michael Molloy and
Bruce A. Reed},
title = {The Size of the Giant Component of a Random Graph with a Given Degree
Sequence},
journal = {Comb. Probab. Comput.},
volume = {7},
number = {3},
pages = {295--305},
year = {1998},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46635},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/MolloyR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ReedS98,
author = {Bruce A. Reed and
Paul D. Seymour},
title = {Fractional Colouring and Hadwiger's Conjecture},
journal = {J. Comb. Theory {B}},
volume = {74},
number = {2},
pages = {147--152},
year = {1998},
url = {https://doi.org/10.1006/jctb.1998.1835},
doi = {10.1006/JCTB.1998.1835},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ReedS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Reed98,
author = {Bruce A. Reed},
title = {{\(\omega\)}, {\(\Delta\)}, and {\(\chi\)}},
journal = {J. Graph Theory},
volume = {27},
number = {4},
pages = {177--212},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0118(199804)27:4\&\#60;177::AID-JGT1\&\#62;3.0.CO;2-K},
doi = {10.1002/(SICI)1097-0118(199804)27:4\&\#60;177::AID-JGT1\&\#62;3.0.CO;2-K},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Reed98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HindMR98,
author = {Hugh Hind and
Michael Molloy and
Bruce A. Reed},
title = {Total Coloring With Delta + (log Delta) Colors},
journal = {{SIAM} J. Comput.},
volume = {28},
number = {3},
pages = {816--821},
year = {1998},
url = {https://doi.org/10.1137/S0097539795294578},
doi = {10.1137/S0097539795294578},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/HindMR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/CalinescuFR98,
author = {Gruia C{\u{a}}linescu and
Cristina G. Fernandes and
Bruce A. Reed},
editor = {Robert E. Bixby and
E. Andrew Boyd and
Roger Z. R{\'{\i}}os{-}Mercado},
title = {Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width},
booktitle = {Integer Programming and Combinatorial Optimization, 6th International
{IPCO} Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1412},
pages = {137--152},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/3-540-69346-7\_11},
doi = {10.1007/3-540-69346-7\_11},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/CalinescuFR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/latin/MolloyR98,
author = {Michael Molloy and
Bruce A. Reed},
editor = {Claudio L. Lucchesi and
Arnaldo V. Moura},
title = {Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree},
booktitle = {{LATIN} '98: Theoretical Informatics, Third Latin American Symposium,
Campinas, Brazil, April, 20-24, 1998, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1380},
pages = {216--225},
publisher = {Springer},
year = {1998},
url = {https://doi.org/10.1007/BFb0054323},
doi = {10.1007/BFB0054323},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/latin/MolloyR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MolloyR98,
author = {Michael Molloy and
Bruce A. Reed},
editor = {Jeffrey Scott Vitter},
title = {Further Algorithmic Aspects of the Local Lemma},
booktitle = {Proceedings of the Thirtieth Annual {ACM} Symposium on the Theory
of Computing, Dallas, Texas, USA, May 23-26, 1998},
pages = {524--529},
publisher = {{ACM}},
year = {1998},
url = {https://doi.org/10.1145/276698.276866},
doi = {10.1145/276698.276866},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MolloyR98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HindMR97,
author = {Hugh Hind and
Michael Molloy and
Bruce A. Reed},
title = {Colouring a Graph Frugally},
journal = {Comb.},
volume = {17},
number = {4},
pages = {469--482},
year = {1997},
url = {https://doi.org/10.1007/BF01195001},
doi = {10.1007/BF01195001},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/HindMR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EverettKR97,
author = {Hazel Everett and
Sulamita Klein and
Bruce A. Reed},
title = {An Algorithm for Finding Homogeneous Pairs},
journal = {Discret. Appl. Math.},
volume = {72},
number = {3},
pages = {209--218},
year = {1997},
url = {https://doi.org/10.1016/0166-218X(95)00090-E},
doi = {10.1016/0166-218X(95)00090-E},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EverettKR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EverettFSMPR97,
author = {Hazel Everett and
Celina M. H. de Figueiredo and
Cl{\'{a}}udia Linhares Sales and
Fr{\'{e}}d{\'{e}}ric Maffray and
Oscar Porto and
Bruce A. Reed},
title = {Path parity and perfection},
journal = {Discret. Math.},
volume = {165-166},
pages = {233--252},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00174-4},
doi = {10.1016/S0012-365X(96)00174-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EverettFSMPR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/PerkovicR97,
author = {Ljubomir Perkovic and
Bruce A. Reed},
title = {Edge coloring regular graphs of high degree},
journal = {Discret. Math.},
volume = {165-166},
pages = {567--578},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00202-6},
doi = {10.1016/S0012-365X(96)00202-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/PerkovicR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/SalesMR97,
author = {Cl{\'{a}}udia Linhares Sales and
Fr{\'{e}}d{\'{e}}ric Maffray and
Bruce A. Reed},
title = {On Planar Perfectly Contractile Graphs},
journal = {Graphs Comb.},
volume = {13},
number = {2},
pages = {167--187},
year = {1997},
url = {https://doi.org/10.1007/BF03352994},
doi = {10.1007/BF03352994},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/SalesMR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MolloyR97,
author = {Michael Molloy and
Bruce A. Reed},
title = {A Bound on the Strong Chromatic Index of a Graph\({}^{\mbox{, }}\)},
journal = {J. Comb. Theory {B}},
volume = {69},
number = {2},
pages = {103--109},
year = {1997},
url = {https://doi.org/10.1006/jctb.1997.1724},
doi = {10.1006/JCTB.1997.1724},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MolloyR97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dimacs/MolloyRS97,
author = {Michael S. O. Molloy and
Bruce A. Reed and
William Steiger},
editor = {Panos M. Pardalos and
Sanguthevar Rajasekaran and
Jos{\'{e}} Rolim},
title = {On the mixing rate of the triangulation walk},
booktitle = {Randomization Methods in Algorithm Design, Proceedings of a {DIMACS}
Workshop, Princeton, New Jersey, USA, December 12-14, 1997},
series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science},
volume = {43},
pages = {179--190},
publisher = {{DIMACS/AMS}},
year = {1997},
url = {https://doi.org/10.1090/dimacs/043/11},
doi = {10.1090/DIMACS/043/11},
timestamp = {Mon, 22 May 2023 16:07:35 +0200},
biburl = {https://dblp.org/rec/conf/dimacs/MolloyRS97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ReedRST96,
author = {Bruce A. Reed and
Neil Robertson and
Paul D. Seymour and
Robin Thomas},
title = {Packing Directed Circuits},
journal = {Comb.},
volume = {16},
number = {4},
pages = {535--554},
year = {1996},
url = {https://doi.org/10.1007/BF01271272},
doi = {10.1007/BF01271272},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ReedRST96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ReedS96,
author = {Bruce A. Reed and
F. Bruce Shepherd},
title = {The Gallai-Younger Conjecture for Planar Graphs},
journal = {Comb.},
volume = {16},
number = {4},
pages = {555--566},
year = {1996},
url = {https://doi.org/10.1007/BF01271273},
doi = {10.1007/BF01271273},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ReedS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CooperFMR96,
author = {Colin Cooper and
Alan M. Frieze and
Michael Molloy and
Bruce A. Reed},
title = {Perfect Matchings in Random r-regular, s-uniform Hypergraphs},
journal = {Comb. Probab. Comput.},
volume = {5},
pages = {1--14},
year = {1996},
url = {https://doi.org/10.1017/S0963548300001796},
doi = {10.1017/S0963548300001796},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CooperFMR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Reed96,
author = {Bruce A. Reed},
title = {Paths, Stars and the Number Three},
journal = {Comb. Probab. Comput.},
volume = {5},
pages = {277--295},
year = {1996},
url = {https://doi.org/10.1017/S0963548300002042},
doi = {10.1017/S0963548300002042},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Reed96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MarkossianGR96,
author = {S. E. Markossian and
G. S. Gasparian and
Bruce A. Reed},
title = {\emph{beta}-Perfect Graphs},
journal = {J. Comb. Theory {B}},
volume = {67},
number = {1},
pages = {1--11},
year = {1996},
url = {https://doi.org/10.1006/jctb.1996.0030},
doi = {10.1006/JCTB.1996.0030},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MarkossianGR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FriezeR95,
author = {Alan M. Frieze and
Bruce A. Reed},
title = {Covering the Edges of a Random Graph by Cliques},
journal = {Comb.},
volume = {15},
number = {4},
pages = {489--497},
year = {1995},
url = {https://doi.org/10.1007/BF01192522},
doi = {10.1007/BF01192522},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FriezeR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/AlbertFR95,
author = {Michael H. Albert and
Alan M. Frieze and
Bruce A. Reed},
title = {Multicoloured Hamilton Cycles},
journal = {Electron. J. Comb.},
volume = {2},
year = {1995},
url = {https://doi.org/10.37236/1204},
doi = {10.37236/1204},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/AlbertFR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DiarmidR95,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Almost Every Graph can be Covered by [fracDelta2] Linear Forests},
journal = {Comb. Probab. Comput.},
volume = {4},
pages = {257--268},
year = {1995},
url = {https://doi.org/10.1017/S0963548300001632},
doi = {10.1017/S0963548300001632},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DiarmidR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Reed95,
author = {Bruce A. Reed},
title = {Rooted Routing in the Plane},
journal = {Discret. Appl. Math.},
volume = {57},
number = {2-3},
pages = {213--227},
year = {1995},
url = {https://doi.org/10.1016/0166-218X(94)00104-L},
doi = {10.1016/0166-218X(94)00104-L},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Reed95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/GamblePRS95,
author = {B. Gamble and
William R. Pulleyblank and
Bruce A. Reed and
F. Bruce Shepherd},
title = {Right angle free subsets in the plane},
journal = {Graphs Comb.},
volume = {11},
number = {2},
pages = {121--129},
year = {1995},
url = {https://doi.org/10.1007/BF01929481},
doi = {10.1007/BF01929481},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/GamblePRS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ReedS95,
author = {Bruce A. Reed and
Najiba Sbihi},
title = {Recognizing bull-free perfect graphs},
journal = {Graphs Comb.},
volume = {11},
number = {2},
pages = {171--178},
year = {1995},
url = {https://doi.org/10.1007/BF01929485},
doi = {10.1007/BF01929485},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ReedS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MolloyR95a,
author = {Michael Molloy and
Bruce A. Reed},
title = {A Critical Point for Random Graphs with a Given Degree Sequence},
journal = {Random Struct. Algorithms},
volume = {6},
number = {2/3},
pages = {161--180},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240060204},
doi = {10.1002/RSA.3240060204},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MolloyR95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/MolloyR95,
author = {Michael Molloy and
Bruce A. Reed},
title = {The Dominating Number of Random Cubic Graph},
journal = {Random Struct. Algorithms},
volume = {7},
number = {3},
pages = {209--222},
year = {1995},
url = {https://doi.org/10.1002/rsa.3240070303},
doi = {10.1002/RSA.3240070303},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/rsa/MolloyR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeKR95,
author = {Alan M. Frieze and
Richard M. Karp and
Bruce A. Reed},
title = {When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman
Problem?},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {3},
pages = {484--493},
year = {1995},
url = {https://doi.org/10.1137/S0097539792235384},
doi = {10.1137/S0097539792235384},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeKR95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/DevroyeR95a,
author = {Luc Devroye and
Bruce A. Reed},
title = {On the Variance of the Height of Random Binary Search Trees},
journal = {{SIAM} J. Comput.},
volume = {24},
number = {6},
pages = {1157--1162},
year = {1995},
url = {https://doi.org/10.1137/S0097539792237541},
doi = {10.1137/S0097539792237541},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/DevroyeR95a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/McDiarmidRSS94,
author = {Colin J. H. McDiarmid and
Bruce A. Reed and
Alexander Schrijver and
F. Bruce Shepherd},
title = {Induced Circuits in Planar Graphs},
journal = {J. Comb. Theory {B}},
volume = {60},
number = {2},
pages = {169--176},
year = {1994},
url = {https://doi.org/10.1006/jctb.1994.1011},
doi = {10.1006/JCTB.1994.1011},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/McDiarmidRSS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/KilakosR93,
author = {Kyriakos Kilakos and
Bruce A. Reed},
title = {Fractionally colouring total graphs},
journal = {Comb.},
volume = {13},
number = {4},
pages = {435--440},
year = {1993},
url = {https://doi.org/10.1007/BF01303515},
doi = {10.1007/BF01303515},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/KilakosR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FriezeR93,
author = {Alan M. Frieze and
Bruce A. Reed},
title = {Polychromatic Hamilton cycles},
journal = {Discret. Math.},
volume = {118},
number = {1-3},
pages = {69--74},
year = {1993},
url = {https://doi.org/10.1016/0012-365X(93)90054-W},
doi = {10.1016/0012-365X(93)90054-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FriezeR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/McDiarmidR93,
author = {Colin J. H. McDiarmid and
Bruce A. Reed},
title = {On Total Colorings of Graphs},
journal = {J. Comb. Theory {B}},
volume = {57},
number = {1},
pages = {122--130},
year = {1993},
url = {https://doi.org/10.1006/jctb.1993.1010},
doi = {10.1006/JCTB.1993.1010},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/McDiarmidR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CornuejolsR93,
author = {G{\'{e}}rard Cornu{\'{e}}jols and
Bruce A. Reed},
title = {Complete Multi-partite Cutsets in Minimal Imperfect Graphs},
journal = {J. Comb. Theory {B}},
volume = {59},
number = {2},
pages = {191--198},
year = {1993},
url = {https://doi.org/10.1006/jctb.1993.1065},
doi = {10.1006/JCTB.1993.1065},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/CornuejolsR93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AlonMR92,
author = {Noga Alon and
Colin McDiarmid and
Bruce A. Reed},
title = {Star arboricity},
journal = {Comb.},
volume = {12},
number = {4},
pages = {375--380},
year = {1992},
url = {https://doi.org/10.1007/BF01305230},
doi = {10.1007/BF01305230},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AlonMR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/ReedM92,
author = {Bruce A. Reed and
Colin McDiarmid},
title = {The Strongly Connected Components of 1-in, 1-out},
journal = {Comb. Probab. Comput.},
volume = {1},
pages = {265--274},
year = {1992},
url = {https://doi.org/10.1017/S0963548300000298},
doi = {10.1017/S0963548300000298},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/ReedM92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ChvatalR92,
author = {Vasek Chv{\'{a}}tal and
Bruce A. Reed},
title = {Mick Gets Some (the Odds Are on His Side)},
booktitle = {33rd Annual Symposium on Foundations of Computer Science, Pittsburgh,
Pennsylvania, USA, 24-27 October 1992},
pages = {620--627},
publisher = {{IEEE} Computer Society},
year = {1992},
url = {https://doi.org/10.1109/SFCS.1992.267789},
doi = {10.1109/SFCS.1992.267789},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ChvatalR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/FriezeKR92,
author = {Alan M. Frieze and
Richard M. Karp and
Bruce A. Reed},
editor = {Egon Balas and
G{\'{e}}rard Cornu{\'{e}}jols and
Ravi Kannan},
title = {When is the Assignment Bound Tight for the Asymmetric Traveling Salesman
Problem?},
booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization
Conference, Pittsburgh, PA, USA, May 1992},
pages = {453--461},
publisher = {Carnegie Mellon University},
year = {1992},
timestamp = {Thu, 21 Jun 2018 07:38:51 +0200},
biburl = {https://dblp.org/rec/conf/ipco/FriezeKR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Reed92,
author = {Bruce A. Reed},
editor = {S. Rao Kosaraju and
Mike Fellows and
Avi Wigderson and
John A. Ellis},
title = {Finding Approximate Separators and Computing Tree Width Quickly},
booktitle = {Proceedings of the 24th Annual {ACM} Symposium on Theory of Computing,
May 4-6, 1992, Victoria, British Columbia, Canada},
pages = {221--228},
publisher = {{ACM}},
year = {1992},
url = {https://doi.org/10.1145/129712.129734},
doi = {10.1145/129712.129734},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/Reed92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/McDiarmidRSS92,
author = {Colin McDiarmid and
Bruce A. Reed and
Alexander Schrijver and
F. Bruce Shepherd},
editor = {Otto Nurmi and
Esko Ukkonen},
title = {Non-Interfering Network Flows},
booktitle = {Algorithm Theory - {SWAT} '92, Third Scandinavian Workshop on Algorithm
Theory, Helsinki, Finland, July 8-10, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {621},
pages = {245--257},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55706-7\_21},
doi = {10.1007/3-540-55706-7\_21},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/McDiarmidRSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/AlonMR91,
author = {Noga Alon and
Colin McDiarmid and
Bruce A. Reed},
title = {Acyclic Coloring of Graphs},
journal = {Random Struct. Algorithms},
volume = {2},
number = {3},
pages = {277--288},
year = {1991},
url = {https://doi.org/10.1002/rsa.3240020303},
doi = {10.1002/RSA.3240020303},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/AlonMR91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/Reed91,
author = {Bruce A. Reed},
editor = {Neil Robertson and
Paul D. Seymour},
title = {Counterexamples to a conjecture of Las Vergnas and Meyniel},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle, {USA}},
series = {Contemporary Mathematics},
volume = {147},
pages = {157--159},
publisher = {American Mathematical Society},
year = {1991},
timestamp = {Fri, 27 Aug 2021 14:49:51 +0200},
biburl = {https://dblp.org/rec/conf/gst/Reed91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/BollobasRT91,
author = {B{\'{e}}la Bollob{\'{a}}s and
Bruce A. Reed and
Andrew Thomason},
editor = {Neil Robertson and
Paul D. Seymour},
title = {An extremal function for the achromatic number},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle, {USA}},
series = {Contemporary Mathematics},
volume = {147},
pages = {161--165},
publisher = {American Mathematical Society},
year = {1991},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gst/BollobasRT91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/gst/ReedRSS91,
author = {Bruce A. Reed and
Neil Robertson and
Alexander Schrijver and
Paul D. Seymour},
editor = {Neil Robertson and
Paul D. Seymour},
title = {Finding disjoint trees in planar graphs in linear time},
booktitle = {Graph Structure Theory, Proceedings of a {AMS-IMS-SIAM} Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle, {USA}},
series = {Contemporary Mathematics},
volume = {147},
pages = {295--301},
publisher = {American Mathematical Society},
year = {1991},
timestamp = {Fri, 27 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/gst/ReedRSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/McDiarmidR90,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Linear Arboricity of Random Regular Graphs},
journal = {Random Struct. Algorithms},
volume = {1},
number = {4},
pages = {443--447},
year = {1990},
url = {https://doi.org/10.1002/rsa.3240010405},
doi = {10.1002/RSA.3240010405},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/McDiarmidR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FriezeMR90,
author = {Alan M. Frieze and
Colin McDiarmid and
Bruce A. Reed},
title = {Greedy Matching on the Line},
journal = {{SIAM} J. Comput.},
volume = {19},
number = {4},
pages = {666--672},
year = {1990},
url = {https://doi.org/10.1137/0219045},
doi = {10.1137/0219045},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/FriezeMR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/Reed90,
author = {Bruce A. Reed},
editor = {Ravi Kannan and
William R. Pulleyblank},
title = {Perfection, Parity, Planarity, and Packing Paths},
booktitle = {Proceedings of the 1st Integer Programming and Combinatorial Optimization
Conference, Waterloo, Ontorio, Canada, May 28-30 1990},
pages = {407--419},
publisher = {University of Waterloo Press},
year = {1990},
timestamp = {Mon, 01 Mar 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ipco/Reed90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HoangR89,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Bruce A. Reed},
title = {P4-comparability graphs},
journal = {Discret. Math.},
volume = {74},
number = {1-2},
pages = {173--200},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90209-4},
doi = {10.1016/0012-365X(89)90209-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HoangR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/McDiarmidR89,
author = {Colin McDiarmid and
Bruce A. Reed},
title = {Building Heaps Fast},
journal = {J. Algorithms},
volume = {10},
number = {3},
pages = {352--365},
year = {1989},
url = {https://doi.org/10.1016/0196-6774(89)90033-3},
doi = {10.1016/0196-6774(89)90033-3},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jal/McDiarmidR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HoangR89,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Bruce A. Reed},
title = {Some classes of perfectly orderable graphs},
journal = {J. Graph Theory},
volume = {13},
number = {4},
pages = {445--463},
year = {1989},
url = {https://doi.org/10.1002/jgt.3190130407},
doi = {10.1002/JGT.3190130407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HoangR89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FriezeJMR88,
author = {Alan M. Frieze and
Bill Jackson and
Colin J. H. McDiarmid and
Bruce A. Reed},
title = {Edge-colouring random graphs},
journal = {J. Comb. Theory {B}},
volume = {45},
number = {2},
pages = {135--149},
year = {1988},
url = {https://doi.org/10.1016/0095-8956(88)90065-2},
doi = {10.1016/0095-8956(88)90065-2},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FriezeJMR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MonmaRT88,
author = {Clyde L. Monma and
Bruce A. Reed and
William T. Trotter},
title = {Threshold tolerance graphs},
journal = {J. Graph Theory},
volume = {12},
number = {3},
pages = {343--362},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120307},
doi = {10.1002/JGT.3190120307},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MonmaRT88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reed87,
author = {Bruce A. Reed},
title = {A note on even pairs},
journal = {Discret. Math.},
volume = {65},
number = {3},
pages = {317--318},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90063-X},
doi = {10.1016/0012-365X(87)90063-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Reed87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HoangR87,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Bruce A. Reed},
title = {A note on short cycles in diagraphs},
journal = {Discret. Math.},
volume = {66},
number = {1-2},
pages = {103--107},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90122-1},
doi = {10.1016/0012-365X(87)90122-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HoangR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Reed87,
author = {Bruce A. Reed},
title = {A semi-strong Perfect Graph theorem},
journal = {J. Comb. Theory {B}},
volume = {43},
number = {2},
pages = {223--240},
year = {1987},
url = {https://doi.org/10.1016/0095-8956(87)90022-0},
doi = {10.1016/0095-8956(87)90022-0},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Reed87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reed85,
author = {Bruce A. Reed},
title = {A note on the semi-strong perfect graph conjecture},
journal = {Discret. Math.},
volume = {54},
number = {1},
pages = {111--112},
year = {1985},
url = {https://doi.org/10.1016/0012-365X(85)90068-8},
doi = {10.1016/0012-365X(85)90068-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Reed85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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-07-24 21:37 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:
