Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Paul Wollan
@article{DBLP:journals/jctb/GeelenKMW23,
author = {Jim Geelen and
O{-}joung Kwon and
Rose McCarty and
Paul Wollan},
title = {The Grid Theorem for vertex-minors},
journal = {J. Comb. Theory, Ser. {B}},
volume = {158},
number = {Part},
pages = {93--116},
year = {2023},
url = {https://doi.org/10.1016/j.jctb.2020.08.004},
doi = {10.1016/J.JCTB.2020.08.004},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/GeelenKMW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2305-04721,
author = {Sandra Albrechtsen and
Tony Huynh and
Raphael W. Jacobs and
Paul Knappe and
Paul Wollan},
title = {The induced two paths problem},
journal = {CoRR},
volume = {abs/2305.04721},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2305.04721},
doi = {10.48550/ARXIV.2305.04721},
eprinttype = {arXiv},
eprint = {2305.04721},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2305-04721.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HuynhJMSW22,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
Piotr Micek and
Michal T. Seweryn and
Paul Wollan},
title = {Excluding a Ladder},
journal = {Comb.},
volume = {42},
number = {3},
pages = {405--432},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4592-8},
doi = {10.1007/S00493-021-4592-8},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HuynhJMSW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/KwonMOW21,
author = {O{-}joung Kwon and
Rose McCarty and
Sang{-}il Oum and
Paul Wollan},
title = {Obstructions for bounded shrub-depth and rank-depth},
journal = {J. Comb. Theory, Ser. {B}},
volume = {149},
pages = {76--91},
year = {2021},
url = {https://doi.org/10.1016/j.jctb.2021.01.005},
doi = {10.1016/J.JCTB.2021.01.005},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/KwonMOW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2002-00496,
author = {Tony Huynh and
Gwena{\"{e}}l Joret and
Piotr Micek and
Michal T. Seweryn and
Paul Wollan},
title = {Excluding a ladder},
journal = {CoRR},
volume = {abs/2002.00496},
year = {2020},
url = {https://arxiv.org/abs/2002.00496},
eprinttype = {arXiv},
eprint = {2002.00496},
timestamp = {Mon, 10 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2002-00496.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2010-12397,
author = {Ken{-}ichi Kawarabayashi and
Robin Thomas and
Paul Wollan},
title = {Quickly excluding a non-planar graph},
journal = {CoRR},
volume = {abs/2010.12397},
year = {2020},
url = {https://arxiv.org/abs/2010.12397},
eprinttype = {arXiv},
eprint = {2010.12397},
timestamp = {Tue, 27 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2010-12397.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/HuynhJW19,
author = {Tony Huynh and
Felix Joos and
Paul Wollan},
title = {A Unified Erd{\H{o}}s-P{\'{o}}sa Theorem for Constrained Cycles},
journal = {Comb.},
volume = {39},
number = {1},
pages = {91--133},
year = {2019},
url = {https://doi.org/10.1007/s00493-017-3683-z},
doi = {10.1007/S00493-017-3683-Z},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/HuynhJW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GauthierLW19,
author = {Gregory Gauthier and
Tien{-}Nam Le and
Paul Wollan},
title = {Forcing clique immersions through chromatic number},
journal = {Eur. J. Comb.},
volume = {81},
pages = {98--118},
year = {2019},
url = {https://doi.org/10.1016/j.ejc.2019.04.003},
doi = {10.1016/J.EJC.2019.04.003},
timestamp = {Fri, 09 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/GauthierLW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChoiKOW19,
author = {Ho{-}Jin Choi and
O{-}joung Kwon and
Sang{-}il Oum and
Paul Wollan},
title = {Chi-boundedness of graph classes excluding wheel vertex-minors},
journal = {J. Comb. Theory, Ser. {B}},
volume = {135},
pages = {319--348},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.08.009},
doi = {10.1016/J.JCTB.2018.08.009},
timestamp = {Fri, 18 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ChoiKOW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiNT19,
author = {Ken{-}ichi Kawarabayashi and
Serguei Norine and
Robin Thomas and
Paul Wollan},
title = {\emph{K}\({}_{\mbox{6}}\) minors in 6-connected graphs of bounded
tree-width},
journal = {J. Comb. Theory, Ser. {B}},
volume = {136},
pages = {1--32},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2017.08.006},
doi = {10.1016/J.JCTB.2017.08.006},
timestamp = {Mon, 15 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiNT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/WollanW19,
author = {Paul Wollan and
David R. Wood},
title = {Nonrepetitive colorings of graphs excluding a fixed immersion or topological
minor},
journal = {J. Graph Theory},
volume = {91},
number = {3},
pages = {259--266},
year = {2019},
url = {https://doi.org/10.1002/jgt.22430},
doi = {10.1002/JGT.22430},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/WollanW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-00230,
author = {O{-}joung Kwon and
Rose McCarty and
Sang{-}il Oum and
Paul Wollan},
title = {Obstructions for bounded shrub-depth and rank-depth},
journal = {CoRR},
volume = {abs/1911.00230},
year = {2019},
url = {http://arxiv.org/abs/1911.00230},
eprinttype = {arXiv},
eprint = {1911.00230},
timestamp = {Mon, 11 Nov 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1911-00230.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiNT18,
author = {Ken{-}ichi Kawarabayashi and
Serguei Norine and
Robin Thomas and
Paul Wollan},
title = {\emph{K}\({}_{\mbox{6}}\) minors in large 6-connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {129},
pages = {158--203},
year = {2018},
url = {https://doi.org/10.1016/j.jctb.2017.09.007},
doi = {10.1016/J.JCTB.2017.09.007},
timestamp = {Tue, 06 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiNT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiTW18,
author = {Ken{-}ichi Kawarabayashi and
Robin Thomas and
Paul Wollan},
title = {A new proof of the flat wall theorem},
journal = {J. Comb. Theory, Ser. {B}},
volume = {129},
pages = {204--238},
year = {2018},
url = {https://doi.org/10.1016/j.jctb.2017.09.006},
doi = {10.1016/J.JCTB.2017.09.006},
timestamp = {Tue, 06 Mar 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiTW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/ChoiKOW17,
author = {Ho{-}Jin Choi and
O{-}joung Kwon and
Sang{-}il Oum and
Paul Wollan},
title = {Chi-boundedness of graph classes excluding wheel vertex-minors},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {247--253},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.045},
doi = {10.1016/J.ENDM.2017.06.045},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/ChoiKOW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BennettBGHMW17,
author = {Patrick Bennett and
Ilario Bonacina and
Nicola Galesi and
Tony Huynh and
Mike Molloy and
Paul Wollan},
title = {Space proof complexity for random 3-CNFs},
journal = {Inf. Comput.},
volume = {255},
pages = {165--176},
year = {2017},
url = {https://doi.org/10.1016/j.ic.2017.06.003},
doi = {10.1016/J.IC.2017.06.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BennettBGHMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/MarxSW17,
author = {D{\'{a}}niel Marx and
Paul D. Seymour and
Paul Wollan},
title = {Rooted grid minors},
journal = {J. Comb. Theory, Ser. {B}},
volume = {122},
pages = {428--437},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2016.07.003},
doi = {10.1016/J.JCTB.2016.07.003},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/MarxSW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/EdwardsMW17,
author = {Katherine Edwards and
Irene Muzi and
Paul Wollan},
editor = {Kirk Pruhs and
Christian Sohler},
title = {Half-Integral Linkages in Highly Connected Directed Graphs},
booktitle = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
4-6, 2017, Vienna, Austria},
series = {LIPIcs},
volume = {87},
pages = {36:1--36:12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ESA.2017.36},
doi = {10.4230/LIPICS.ESA.2017.36},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/esa/EdwardsMW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GueninPW16,
author = {Bertrand Guenin and
Irene Pivotto and
Paul Wollan},
title = {Displaying blocking pairs in signed graphs},
journal = {Eur. J. Comb.},
volume = {51},
pages = {135--164},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.04.005},
doi = {10.1016/J.EJC.2015.04.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GueninPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/LeW16,
author = {Tien{-}Nam Le and
Paul Wollan},
title = {Forcing clique immersions through chromatic number},
journal = {Electron. Notes Discret. Math.},
volume = {54},
pages = {121--126},
year = {2016},
url = {https://doi.org/10.1016/j.endm.2016.09.022},
doi = {10.1016/J.ENDM.2016.09.022},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/LeW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/GueninPW16,
author = {Bertrand Guenin and
Irene Pivotto and
Paul Wollan},
title = {Stabilizer theorems for even cycle matroids},
journal = {J. Comb. Theory, Ser. {B}},
volume = {118},
pages = {44--75},
year = {2016},
url = {https://doi.org/10.1016/j.jctb.2016.01.006},
doi = {10.1016/J.JCTB.2016.01.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/GueninPW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DvorakW16,
author = {Zdenek Dvor{\'{a}}k and
Paul Wollan},
title = {A Structure Theorem for Strong Immersions},
journal = {J. Graph Theory},
volume = {83},
number = {2},
pages = {152--163},
year = {2016},
url = {https://doi.org/10.1002/jgt.21990},
doi = {10.1002/JGT.21990},
timestamp = {Fri, 01 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/DvorakW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:reference/algo/Wollan16,
author = {Paul Wollan},
title = {Finding Topological Subgraphs},
booktitle = {Encyclopedia of Algorithms},
pages = {749--752},
year = {2016},
url = {https://doi.org/10.1007/978-1-4939-2864-4\_695},
doi = {10.1007/978-1-4939-2864-4\_695},
timestamp = {Wed, 12 Jul 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/reference/algo/Wollan16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AmiriKKW16,
author = {Saeed Akhoondian Amiri and
Ken{-}ichi Kawarabayashi and
Stephan Kreutzer and
Paul Wollan},
title = {The Erdos-Posa Property for Directed Graphs},
journal = {CoRR},
volume = {abs/1603.02504},
year = {2016},
url = {http://arxiv.org/abs/1603.02504},
eprinttype = {arXiv},
eprint = {1603.02504},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AmiriKKW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EdwardsMW16,
author = {Katherine Edwards and
Irene Muzi and
Paul Wollan},
title = {Half-integral linkages in highly connected directed graphs},
journal = {CoRR},
volume = {abs/1611.01004},
year = {2016},
url = {http://arxiv.org/abs/1611.01004},
eprinttype = {arXiv},
eprint = {1611.01004},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EdwardsMW16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Wollan15,
author = {Paul Wollan},
title = {The structure of graphs not admitting a fixed immersion},
journal = {J. Comb. Theory, Ser. {B}},
volume = {110},
pages = {47--66},
year = {2015},
url = {https://doi.org/10.1016/j.jctb.2014.07.003},
doi = {10.1016/J.JCTB.2014.07.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Wollan15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/MarxW15,
author = {D{\'{a}}niel Marx and
Paul Wollan},
editor = {Piotr Indyk},
title = {An exact characterization of tractable demand patterns for maximum
disjoint path problems},
booktitle = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
pages = {642--661},
publisher = {{SIAM}},
year = {2015},
url = {https://doi.org/10.1137/1.9781611973730.44},
doi = {10.1137/1.9781611973730.44},
timestamp = {Tue, 02 Feb 2021 17:07:30 +0100},
biburl = {https://dblp.org/rec/conf/soda/MarxW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BennettBGHMW15,
author = {Patrick Bennett and
Ilario Bonacina and
Nicola Galesi and
Tony Huynh and
Mike Molloy and
Paul Wollan},
title = {Space proof complexity for random 3-CNFs},
journal = {CoRR},
volume = {abs/1503.01613},
year = {2015},
url = {http://arxiv.org/abs/1503.01613},
eprinttype = {arXiv},
eprint = {1503.01613},
timestamp = {Wed, 18 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BennettBGHMW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/MarxW14,
author = {D{\'{a}}niel Marx and
Paul Wollan},
title = {Immersions in Highly Edge Connected Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {1},
pages = {503--520},
year = {2014},
url = {https://doi.org/10.1137/130924056},
doi = {10.1137/130924056},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/MarxW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/MarxW14,
author = {D{\'{a}}niel Marx and
Paul Wollan},
title = {An exact characterization of tractable demand patterns for maximum
disjoint path problems},
journal = {CoRR},
volume = {abs/1411.0871},
year = {2014},
url = {http://arxiv.org/abs/1411.0871},
eprinttype = {arXiv},
eprint = {1411.0871},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/MarxW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonacinaGHW14,
author = {Ilario Bonacina and
Nicola Galesi and
Tony Huynh and
Paul Wollan},
title = {Space proof complexity for random {\textdollar}3{\textdollar}-CNFs
via a {\textdollar}(2-{\(\epsilon\)}){\textdollar}-Hall's Theorem},
journal = {CoRR},
volume = {abs/1411.1619},
year = {2014},
url = {http://arxiv.org/abs/1411.1619},
eprinttype = {arXiv},
eprint = {1411.1619},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonacinaGHW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BonacinaGHW14,
author = {Ilario Bonacina and
Nicola Galesi and
Tony Huynh and
Paul Wollan},
title = {Space proof complexity for random 3-CNFs via a (2-{\(\epsilon\)})-Hall's
Theorem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-146}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/146},
eprinttype = {ECCC},
eprint = {TR14-146},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BonacinaGHW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GueninPW13,
author = {Bertrand Guenin and
Irene Pivotto and
Paul Wollan},
title = {Relationships between Pairs of Representations of Signed Binary Matroids},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {1},
pages = {329--341},
year = {2013},
url = {https://doi.org/10.1137/100798442},
doi = {10.1137/100798442},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GueninPW13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/BruhnW12,
author = {Henning Bruhn and
Paul Wollan},
title = {Finite connectivity in infinite matroids},
journal = {Eur. J. Comb.},
volume = {33},
number = {8},
pages = {1900--1912},
year = {2012},
url = {https://doi.org/10.1016/j.ejc.2012.05.006},
doi = {10.1016/J.EJC.2012.05.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/BruhnW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DiestelKW12,
author = {Reinhard Diestel and
Ken{-}ichi Kawarabayashi and
Paul Wollan},
title = {The Erd{\H{o}}s-P{\'{o}}sa property for clique minors in highly
connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {102},
number = {2},
pages = {454--469},
year = {2012},
url = {https://doi.org/10.1016/j.jctb.2011.08.001},
doi = {10.1016/J.JCTB.2011.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DiestelKW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/PontecorviW12,
author = {Matteo Pontecorvi and
Paul Wollan},
title = {Disjoint cycles intersecting a set of vertices},
journal = {J. Comb. Theory, Ser. {B}},
volume = {102},
number = {5},
pages = {1134--1141},
year = {2012},
url = {https://doi.org/10.1016/j.jctb.2012.05.004},
doi = {10.1016/J.JCTB.2012.05.004},
timestamp = {Sat, 13 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/PontecorviW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DiestelKMW12,
author = {Reinhard Diestel and
Ken{-}ichi Kawarabayashi and
Theodor M{\"{u}}ller and
Paul Wollan},
title = {On the excluded minor structure theorem for graphs of large tree-width},
journal = {J. Comb. Theory, Ser. {B}},
volume = {102},
number = {6},
pages = {1189--1210},
year = {2012},
url = {https://doi.org/10.1016/j.jctb.2012.07.001},
doi = {10.1016/J.JCTB.2012.07.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DiestelKMW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-2171,
author = {Ken{-}ichi Kawarabayashi and
Serguei Norine and
Robin Thomas and
Paul Wollan},
title = {K{\_}6 minors in 6-connected graphs of bounded tree-width},
journal = {CoRR},
volume = {abs/1203.2171},
year = {2012},
url = {http://arxiv.org/abs/1203.2171},
eprinttype = {arXiv},
eprint = {1203.2171},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-2171.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-2192,
author = {Ken{-}ichi Kawarabayashi and
Serguei Norine and
Robin Thomas and
Paul Wollan},
title = {K{\_}6 minors in large 6-connected graphs},
journal = {CoRR},
volume = {abs/1203.2192},
year = {2012},
url = {http://arxiv.org/abs/1203.2192},
eprinttype = {arXiv},
eprint = {1203.2192},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-2192.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Wollan11,
author = {Paul Wollan},
title = {Packing cycles with modularity constraints},
journal = {Comb.},
volume = {31},
number = {1},
pages = {95--126},
year = {2011},
url = {https://doi.org/10.1007/s00493-011-2551-5},
doi = {10.1007/S00493-011-2551-5},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Wollan11.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/mfcs/Wollan11,
author = {Paul Wollan},
editor = {Filip Murlak and
Piotr Sankowski},
title = {New Proofs in Graph Minors},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {35},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_6},
doi = {10.1007/978-3-642-22993-0\_6},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Wollan11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiW11,
author = {Ken{-}ichi Kawarabayashi and
Paul Wollan},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {A simpler algorithm and shorter proof for the graph minor decomposition},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {451--458},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993697},
doi = {10.1145/1993636.1993697},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GroheKMW11,
author = {Martin Grohe and
Ken{-}ichi Kawarabayashi and
D{\'{a}}niel Marx and
Paul Wollan},
editor = {Lance Fortnow and
Salil P. Vadhan},
title = {Finding topological subgraphs is fixed-parameter tractable},
booktitle = {Proceedings of the 43rd {ACM} Symposium on Theory of Computing, {STOC}
2011, San Jose, CA, USA, 6-8 June 2011},
pages = {479--488},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/1993636.1993700},
doi = {10.1145/1993636.1993700},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/GroheKMW11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Wollan10,
author = {Paul Wollan},
title = {Packing non-zero A-paths in an undirected model of group labeled graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {100},
number = {2},
pages = {141--150},
year = {2010},
url = {https://doi.org/10.1016/j.jctb.2009.05.003},
doi = {10.1016/J.JCTB.2009.05.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Wollan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Wollan10,
author = {Paul Wollan},
title = {Bridges in Highly Connected Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {24},
number = {4},
pages = {1731--1741},
year = {2010},
url = {https://doi.org/10.1137/070710214},
doi = {10.1137/070710214},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Wollan10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/BergNSTW10,
author = {Deborah E. Berg and
Serguei Norine and
Francis Edward Su and
Robin Thomas and
Paul Wollan},
title = {Voting in Agreeable Societies},
journal = {Am. Math. Mon.},
volume = {117},
number = {1},
pages = {27--39},
year = {2010},
url = {https://doi.org/10.4169/000298910X474961},
doi = {10.4169/000298910X474961},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/BergNSTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/KawarabayashiW10,
author = {Ken{-}ichi Kawarabayashi and
Paul Wollan},
editor = {Leonard J. Schulman},
title = {A shorter proof of the graph minor algorithm: the unique linkage theorem},
booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
pages = {687--694},
publisher = {{ACM}},
year = {2010},
url = {https://doi.org/10.1145/1806689.1806784},
doi = {10.1145/1806689.1806784},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/KawarabayashiW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1011-1827,
author = {Martin Grohe and
Ken{-}ichi Kawarabayashi and
D{\'{a}}niel Marx and
Paul Wollan},
title = {Finding topological subgraphs is fixed-parameter tractable},
journal = {CoRR},
volume = {abs/1011.1827},
year = {2010},
url = {http://arxiv.org/abs/1011.1827},
eprinttype = {arXiv},
eprint = {1011.1827},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1011-1827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ThomasW08,
author = {Robin Thomas and
Paul Wollan},
title = {The extremal function for 3-linked graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {98},
number = {5},
pages = {939--971},
year = {2008},
url = {https://doi.org/10.1016/j.jctb.2007.11.008},
doi = {10.1016/J.JCTB.2007.11.008},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/ThomasW08.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, Ser. {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 = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiLRW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wollan08,
author = {Paul Wollan},
title = {Extremal functions for rooted minors},
journal = {J. Graph Theory},
volume = {58},
number = {2},
pages = {159--178},
year = {2008},
url = {https://doi.org/10.1002/jgt.20301},
doi = {10.1002/JGT.20301},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wollan08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Wollan06,
author = {Paul Wollan},
title = {Extremal Functions for Shortening Sets of Paths},
journal = {Comb. Probab. Comput.},
volume = {15},
number = {6},
pages = {927--932},
year = {2006},
url = {https://doi.org/10.1017/S0963548306007784},
doi = {10.1017/S0963548306007784},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Wollan06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/KawarabayashiW06,
author = {Ken{-}ichi Kawarabayashi and
Paul Wollan},
title = {Non-zero disjoint cycles in highly connected group labelled graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {96},
number = {2},
pages = {296--301},
year = {2006},
url = {https://doi.org/10.1016/j.jctb.2005.08.001},
doi = {10.1016/J.JCTB.2005.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/KawarabayashiW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/NorineSTW06,
author = {Serguei Norine and
Paul D. Seymour and
Robin Thomas and
Paul Wollan},
title = {Proper minor-closed families are small},
journal = {J. Comb. Theory, Ser. {B}},
volume = {96},
number = {5},
pages = {754--757},
year = {2006},
url = {https://doi.org/10.1016/j.jctb.2006.01.006},
doi = {10.1016/J.JCTB.2006.01.006},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/NorineSTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrinkmannGGMTW05,
author = {Gunnar Brinkmann and
Sam Greenberg and
Catherine S. Greenhill and
Brendan D. McKay and
Robin Thomas and
Paul Wollan},
title = {Generation of simple quadrangulations of the sphere},
journal = {Discret. Math.},
volume = {305},
number = {1-3},
pages = {33--54},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.10.005},
doi = {10.1016/J.DISC.2005.10.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrinkmannGGMTW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/ThomasW05,
author = {Robin Thomas and
Paul Wollan},
title = {An improved linear edge bound for graph linkages},
journal = {Eur. J. Comb.},
volume = {26},
number = {3-4},
pages = {309--324},
year = {2005},
url = {https://doi.org/10.1016/j.ejc.2004.02.013},
doi = {10.1016/J.EJC.2004.02.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/ThomasW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KawarabayashiW05,
author = {Ken{-}ichi Kawarabayashi and
Paul Wollan},
title = {Non-zero disjoint cycles in highly connected group labeled graphs},
journal = {Electron. Notes Discret. Math.},
volume = {22},
pages = {271--275},
year = {2005},
url = {https://doi.org/10.1016/j.endm.2005.06.053},
doi = {10.1016/J.ENDM.2005.06.053},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KawarabayashiW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:32 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:
