BibTeX records: Luis Cereceda

download as .bib file

@article{DBLP:journals/jgt/CerecedaHJ11,
  author       = {Luis Cereceda and
                  Jan van den Heuvel and
                  Matthew Johnson},
  title        = {Finding paths between 3-colorings},
  journal      = {J. Graph Theory},
  volume       = {67},
  number       = {1},
  pages        = {69--82},
  year         = {2011},
  url          = {https://doi.org/10.1002/jgt.20514},
  doi          = {10.1002/JGT.20514},
  timestamp    = {Fri, 02 Oct 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CerecedaHJ11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/ejc/CerecedaHJ09,
  author       = {Luis Cereceda and
                  Jan van den Heuvel and
                  Matthew Johnson},
  title        = {Mixing 3-colourings in bipartite graphs},
  journal      = {Eur. J. Comb.},
  volume       = {30},
  number       = {7},
  pages        = {1593--1606},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.ejc.2009.03.011},
  doi          = {10.1016/J.EJC.2009.03.011},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/CerecedaHJ09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tcs/BonsmaC09,
  author       = {Paul S. Bonsma and
                  Luis Cereceda},
  title        = {Finding Paths between graph colourings: PSPACE-completeness and superpolynomial
                  distances},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {50},
  pages        = {5215--5226},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2009.08.023},
  doi          = {10.1016/J.TCS.2009.08.023},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/BonsmaC09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CerecedaHJ08,
  author       = {Luis Cereceda and
                  Jan van den Heuvel and
                  Matthew Johnson},
  title        = {Connectedness of the graph of vertex-colourings},
  journal      = {Discret. Math.},
  volume       = {308},
  number       = {5-6},
  pages        = {913--919},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.disc.2007.07.028},
  doi          = {10.1016/J.DISC.2007.07.028},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CerecedaHJ08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/iwoca/JohnsonCH08,
  author       = {Matthew Johnson and
                  Luis Cereceda and
                  Jan van den Heuvel},
  editor       = {Mirka Miller and
                  Koichi Wada},
  title        = {Finding Paths Between 3-Colourings},
  booktitle    = {Proceedings of the 19th International Workshop on Combinatorial Algorithms,
                  {IWOCA} 2008, September 13-15, 2008, Nagoya, Japan},
  pages        = {182--196},
  publisher    = {College Publications},
  year         = {2008},
  timestamp    = {Fri, 19 Jan 2024 14:56:10 +0100},
  biburl       = {https://dblp.org/rec/conf/iwoca/JohnsonCH08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/endm/BonsmaCHJ07,
  author       = {Paul S. Bonsma and
                  Luis Cereceda and
                  Jan van den Heuvel and
                  Matthew Johnson},
  title        = {Finding Paths between Graph Colourings: Computational Complexity and
                  Possible Distances},
  journal      = {Electron. Notes Discret. Math.},
  volume       = {29},
  pages        = {463--469},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.endm.2007.07.073},
  doi          = {10.1016/J.ENDM.2007.07.073},
  timestamp    = {Thu, 20 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/endm/BonsmaCHJ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/BonsmaC07,
  author       = {Paul S. Bonsma and
                  Luis Cereceda},
  editor       = {Ludek Kucera and
                  Anton{\'{\i}}n Kucera},
  title        = {Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial
                  Distances},
  booktitle    = {Mathematical Foundations of Computer Science 2007, 32nd International
                  Symposium, {MFCS} 2007, Cesk{\'{y}} Krumlov, Czech Republic,
                  August 26-31, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4708},
  pages        = {738--749},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74456-6\_65},
  doi          = {10.1007/978-3-540-74456-6\_65},
  timestamp    = {Fri, 30 Aug 2019 10:02:28 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/BonsmaC07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/CerecedaHJ07,
  author       = {Luis Cereceda and
                  Jan van den Heuvel and
                  Matthew Johnson},
  editor       = {Andreas Brandst{\"{a}}dt and
                  Dieter Kratsch and
                  Haiko M{\"{u}}ller},
  title        = {Mixing 3-Colourings in Bipartite Graphs},
  booktitle    = {Graph-Theoretic Concepts in Computer Science, 33rd International Workshop,
                  {WG} 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4769},
  pages        = {166--177},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-74839-7\_17},
  doi          = {10.1007/978-3-540-74839-7\_17},
  timestamp    = {Tue, 14 May 2019 10:00:40 +0200},
  biburl       = {https://dblp.org/rec/conf/wg/CerecedaHJ07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/acid/Cereceda06,
  author       = {Luis Cereceda},
  editor       = {Hajo Broersma and
                  Stefan S. Dantchev and
                  Matthew Johnson and
                  Stefan Szeider},
  title        = {Finding Paths between Colourings},
  booktitle    = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
                  ACiD Workshop, 18-20 September 2006, Durham, {UK}},
  series       = {Texts in Algorithmics},
  volume       = {7},
  pages        = {155},
  publisher    = {King's College, London},
  year         = {2006},
  timestamp    = {Tue, 24 Jul 2007 20:35:24 +0200},
  biburl       = {https://dblp.org/rec/conf/acid/Cereceda06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.