BibTeX records: Rachel Kirsch

download as .bib file

@article{DBLP:journals/aam/KirschSS23,
  author       = {Rachel Kirsch and
                  Clare Sibley and
                  Elizabeth Sprangel},
  title        = {Graph universal cycles: Compression and connections to universal cycles},
  journal      = {Adv. Appl. Math.},
  volume       = {148},
  pages        = {102522},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.aam.2023.102522},
  doi          = {10.1016/J.AAM.2023.102522},
  timestamp    = {Fri, 09 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/aam/KirschSS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KirschLSS23,
  author       = {Rachel Kirsch and
                  Bernard Lidick{\'{y}} and
                  Clare Sibley and
                  Elizabeth Sprangel},
  title        = {Shortened universal cycles for permutations},
  journal      = {Discret. Appl. Math.},
  volume       = {324},
  pages        = {219--228},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.dam.2022.09.026},
  doi          = {10.1016/J.DAM.2022.09.026},
  timestamp    = {Fri, 16 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/KirschLSS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KirschR23,
  author       = {Rachel Kirsch and
                  Jamie Radcliffe},
  title        = {Many Cliques in Bounded-Degree Hypergraphs},
  journal      = {{SIAM} J. Discret. Math.},
  volume       = {37},
  number       = {3},
  pages        = {1436--1456},
  year         = {2023},
  url          = {https://doi.org/10.1137/22m1507565},
  doi          = {10.1137/22M1507565},
  timestamp    = {Sat, 05 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamdm/KirschR23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2310-13067,
  author       = {Dylan Fillmore and
                  Bennet Goeckner and
                  Rachel Kirsch and
                  Kirin Martin and
                  Daniel McGinnis},
  title        = {The Existence and Structure of Universal Partial Cycles},
  journal      = {CoRR},
  volume       = {abs/2310.13067},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2310.13067},
  doi          = {10.48550/ARXIV.2310.13067},
  eprinttype    = {arXiv},
  eprint       = {2310.13067},
  timestamp    = {Tue, 31 Oct 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2310-13067.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CamachoFMKKMW22,
  author       = {Charles Camacho and
                  Silvia Fern{\'{a}}ndez{-}Merchant and
                  Marija Jelic Milutinovic and
                  Rachel Kirsch and
                  Linda Kleist and
                  Elizabeth Bailey Matson and
                  Jennifer White},
  title        = {Bounding the tripartite-circle crossing number of complete tripartite
                  graphs},
  journal      = {J. Graph Theory},
  volume       = {100},
  number       = {1},
  pages        = {5--27},
  year         = {2022},
  url          = {https://doi.org/10.1002/jgt.22763},
  doi          = {10.1002/JGT.22763},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jgt/CamachoFMKKMW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KirschR21,
  author       = {Rachel Kirsch and
                  A. J. Radcliffe},
  title        = {Many Cliques with Few Edges},
  journal      = {Electron. J. Comb.},
  volume       = {28},
  number       = {1},
  pages        = {1},
  year         = {2021},
  url          = {https://doi.org/10.37236/9550},
  doi          = {10.37236/9550},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/KirschR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-01032,
  author       = {Charles Camacho and
                  Silvia Fern{\'{a}}ndez{-}Merchant and
                  Marija Jelic Milutinovic and
                  Rachel Kirsch and
                  Linda Kleist and
                  Elizabeth Bailey Matson and
                  Jennifer White},
  title        = {The Tripartite-Circle Crossing Number of K\({}_{\mbox{2, 2, n}}\)},
  journal      = {CoRR},
  volume       = {abs/2108.01032},
  year         = {2021},
  url          = {https://arxiv.org/abs/2108.01032},
  eprinttype    = {arXiv},
  eprint       = {2108.01032},
  timestamp    = {Thu, 05 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2108-01032.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KirschR20,
  author       = {Rachel Kirsch and
                  A. J. Radcliffe},
  title        = {Maximizing the density of Kt's in graphs of bounded degree and clique
                  number},
  journal      = {Discret. Math.},
  volume       = {343},
  number       = {6},
  pages        = {111803},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.disc.2019.111803},
  doi          = {10.1016/J.DISC.2019.111803},
  timestamp    = {Mon, 20 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/KirschR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/KirschR19,
  author       = {Rachel Kirsch and
                  A. J. Radcliffe},
  title        = {Many Triangles with Few Edges},
  journal      = {Electron. J. Comb.},
  volume       = {26},
  number       = {2},
  pages        = {2},
  year         = {2019},
  url          = {https://doi.org/10.37236/7343},
  doi          = {10.37236/7343},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/combinatorics/KirschR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BoyerBEFKKPR19,
  author       = {Kirk Boyer and
                  Boris Brimkov and
                  Sean English and
                  Daniela Ferrero and
                  Ariel Keller and
                  Rachel Kirsch and
                  Michael Phillips and
                  Carolyn Reinhart},
  title        = {The zero forcing polynomial of a graph},
  journal      = {Discret. Appl. Math.},
  volume       = {258},
  pages        = {35--48},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2018.11.033},
  doi          = {10.1016/J.DAM.2018.11.033},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BoyerBEFKKPR19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BjorkmanCGKKPRS19,
  author       = {Beth Bjorkman and
                  Garner Cochran and
                  Wei Gao and
                  Lauren Keough and
                  Rachel Kirsch and
                  Mitch Phillipson and
                  Danny Rorabaugh and
                  Heather C. Smith and
                  Jennifer Wise},
  title        = {k-foldability of words},
  journal      = {Discret. Appl. Math.},
  volume       = {259},
  pages        = {19--30},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.dam.2018.12.028},
  doi          = {10.1016/J.DAM.2018.12.028},
  timestamp    = {Wed, 22 Jul 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dam/BjorkmanCGKKPRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Blanchet-SadriC18,
  author       = {Francine Blanchet{-}Sadri and
                  Michelle Cordier and
                  Rachel Kirsch},
  title        = {Border correlations, lattices, and the subgraph component polynomial},
  journal      = {Eur. J. Comb.},
  volume       = {68},
  pages        = {204--222},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.ejc.2017.07.017},
  doi          = {10.1016/J.EJC.2017.07.017},
  timestamp    = {Tue, 02 Jan 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ejc/Blanchet-SadriC18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GoecknerGHKKKS18,
  author       = {Bennet Goeckner and
                  Corbin Groothuis and
                  Cyrus Hettle and
                  Brian Kell and
                  Pamela Kirkpatrick and
                  Rachel Kirsch and
                  Ryan W. Solava},
  title        = {Universal partial words over non-binary alphabets},
  journal      = {Theor. Comput. Sci.},
  volume       = {713},
  pages        = {56--65},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.tcs.2017.12.022},
  doi          = {10.1016/J.TCS.2017.12.022},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/tcs/GoecknerGHKKKS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/Blanchet-SadriC14,
  author       = {Francine Blanchet{-}Sadri and
                  Michelle Cordier and
                  Rachel Kirsch},
  editor       = {Jan Kratochv{\'{\i}}l and
                  Mirka Miller and
                  Dalibor Froncek},
  title        = {Border Correlations, Lattices, and the Subgraph Component Polynomial},
  booktitle    = {Combinatorial Algorithms - 25th International Workshop, {IWOCA} 2014,
                  Duluth, MN, USA, October 15-17, 2014, Revised Selected Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {8986},
  pages        = {62--73},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-319-19315-1\_6},
  doi          = {10.1007/978-3-319-19315-1\_6},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/iwoca/Blanchet-SadriC14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics