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   = {Journal of 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 = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jgt/CerecedaHJ11},
  bibsource = {dblp computer science bibliography, http://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, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ejc/CerecedaHJ09},
  bibsource = {dblp computer science bibliography, http://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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/BonsmaC09},
  bibsource = {dblp computer science bibliography, http://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   = {Discrete Mathematics},
  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 = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dm/CerecedaHJ08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/JohnsonCH08,
  author    = {Matthew Johnson and
               Luis Cereceda and
               Jan van den Heuvel},
  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},
  year      = {2008},
  crossref  = {DBLP:conf/iwoca/2008},
  timestamp = {Fri, 12 Dec 2014 17:00:07 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/iwoca/JohnsonCH08},
  bibsource = {dblp computer science bibliography, http://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   = {Electronic Notes in Discrete Mathematics},
  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 = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/endm/BonsmaCHJ07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BonsmaC07,
  author    = {Paul S. Bonsma and
               Luis Cereceda},
  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},
  pages     = {738--749},
  year      = {2007},
  crossref  = {DBLP:conf/mfcs/2007},
  url       = {https://doi.org/10.1007/978-3-540-74456-6_65},
  doi       = {10.1007/978-3-540-74456-6_65},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/BonsmaC07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/wg/CerecedaHJ07,
  author    = {Luis Cereceda and
               Jan van den Heuvel and
               Matthew Johnson},
  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},
  pages     = {166--177},
  year      = {2007},
  crossref  = {DBLP:conf/wg/2007},
  url       = {https://doi.org/10.1007/978-3-540-74839-7_17},
  doi       = {10.1007/978-3-540-74839-7_17},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/wg/CerecedaHJ07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/acid/Cereceda06,
  author    = {Luis Cereceda},
  title     = {Finding Paths between Colourings},
  booktitle = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
               ACiD Workshop, 18-20 September 2006, Durham, {UK}},
  pages     = {155},
  year      = {2006},
  crossref  = {DBLP:conf/acid/2006},
  timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/acid/Cereceda06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/iwoca/2008,
  editor    = {Mirka Miller and
               Koichi Wada},
  title     = {Proceedings of the 19th International Workshop on Combinatorial Algorithms,
               {IWOCA} 2008, September 13-15, 2008, Nagoya, Japan},
  publisher = {College Publications},
  year      = {2008},
  isbn      = {978-1-904987-74-1},
  timestamp = {Fri, 12 Dec 2014 17:00:07 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/iwoca/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2007,
  editor    = {Ludek Kucera and
               Anton{\'{\i}}n Kucera},
  title     = {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},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74456-6},
  doi       = {10.1007/978-3-540-74456-6},
  isbn      = {978-3-540-74455-9},
  timestamp = {Fri, 02 Jun 2017 13:01:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/wg/2007,
  editor    = {Andreas Brandst{\"{a}}dt and
               Dieter Kratsch and
               Haiko M{\"{u}}ller},
  title     = {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},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74839-7},
  doi       = {10.1007/978-3-540-74839-7},
  isbn      = {978-3-540-74838-0},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/wg/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/acid/2006,
  editor    = {Hajo Broersma and
               Stefan S. Dantchev and
               Matthew Johnson and
               Stefan Szeider},
  title     = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second
               ACiD Workshop, 18-20 September 2006, Durham, {UK}},
  series    = {Texts in Algorithmics},
  volume    = {7},
  publisher = {King's College, London},
  year      = {2006},
  isbn      = {1-904987-38-9},
  timestamp = {Tue, 24 Jul 2007 20:35:24 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/acid/2006},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier