Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Craig E. Larson
@article{DBLP:journals/arsmc/BushawCGKLLMMSTWWWL23, author = {Neal Bushaw and Blake Conka and Vinay Gupta and Aidan Kierans and Hudson Lafayette and Craig E. Larson and Kevin McCall and Andriy Mulyar and Christine Sullivan and Scott Taylor and Evan Wainright and Evan Wilson and Guanyu Wu and Sarah Loeb}, title = {Bootstrap percolation via automated conjecturing}, journal = {Ars Math. Contemp.}, volume = {23}, number = {3}, year = {2023}, url = {https://doi.org/10.26493/1855-3974.2340.a61}, doi = {10.26493/1855-3974.2340.A61}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/arsmc/BushawCGKLLMMSTWWWL23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2308-02540, author = {Craig E. Larson and Nicolas Van Cleemput}, title = {Top-down Automated Theorem Proving (Notes for Sir Timothy)}, journal = {CoRR}, volume = {abs/2308.02540}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2308.02540}, doi = {10.48550/ARXIV.2308.02540}, eprinttype = {arXiv}, eprint = {2308.02540}, timestamp = {Mon, 21 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2308-02540.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jair/BradfordDHKLMMC20, author = {Alexander Bradford and J. Kain Day and Laura Hutchinson and Bryan Kaperick and Craig E. Larson and Matthew Mills and David Muncy and Nico Van Cleemput}, title = {Automated Conjecturing {II:} Chomp and Reasoned Game Play}, journal = {J. Artif. Intell. Res.}, volume = {68}, pages = {447--461}, year = {2020}, url = {https://doi.org/10.1613/jair.1.12188}, doi = {10.1613/JAIR.1.12188}, timestamp = {Tue, 16 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jair/BradfordDHKLMMC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-11576, author = {J. Paul Brooks and D. J. Edwards and Craig E. Larson and Nicolas Van Cleemput}, title = {Conjecturing-Based Computational Discovery of Patterns in Data}, journal = {CoRR}, volume = {abs/2011.11576}, year = {2020}, url = {https://arxiv.org/abs/2011.11576}, eprinttype = {arXiv}, eprint = {2011.11576}, timestamp = {Thu, 26 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-11576.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1801-01814, author = {Neal Bushaw and Craig E. Larson and Nicolas Van Cleemput}, title = {Automated Conjecturing {VII:} The Graph Brain Project {\&} Big Mathematics}, journal = {CoRR}, volume = {abs/1801.01814}, year = {2018}, url = {http://arxiv.org/abs/1801.01814}, eprinttype = {arXiv}, eprint = {1801.01814}, timestamp = {Mon, 22 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-1801-01814.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/amai/LarsonC17, author = {Craig E. Larson and Nicolas Van Cleemput}, title = {Automated conjecturing {III} - Property-relations conjectures}, journal = {Ann. Math. Artif. Intell.}, volume = {81}, number = {3-4}, pages = {315--327}, year = {2017}, url = {https://doi.org/10.1007/s10472-017-9559-5}, doi = {10.1007/S10472-017-9559-5}, timestamp = {Sun, 22 Oct 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/amai/LarsonC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ijcai/LarsonC17, author = {Craig E. Larson and Nico Van Cleemput}, editor = {Carles Sierra}, title = {Automated Conjecturing {I:} Fajtlowicz's Dalmatian Heuristic Revisited (Extended Abstract)}, booktitle = {Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017}, pages = {5015--5019}, publisher = {ijcai.org}, year = {2017}, url = {https://doi.org/10.24963/ijcai.2017/713}, doi = {10.24963/IJCAI.2017/713}, timestamp = {Tue, 20 Aug 2019 16:16:54 +0200}, biburl = {https://dblp.org/rec/conf/ijcai/LarsonC17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ai/LarsonC16, author = {Craig E. Larson and Nicolas Van Cleemput}, title = {Automated conjecturing {I:} Fajtlowicz's Dalmatian heuristic revisited}, journal = {Artif. Intell.}, volume = {231}, pages = {17--38}, year = {2016}, url = {https://doi.org/10.1016/j.artint.2015.10.002}, doi = {10.1016/J.ARTINT.2015.10.002}, timestamp = {Mon, 05 Jun 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ai/LarsonC16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arsmc/BrinkmannLSC15, author = {Gunnar Brinkmann and Craig E. Larson and Jasper Souffriau and Nico Van Cleemput}, title = {Construction of planar 4-connected triangulations}, journal = {Ars Math. Contemp.}, volume = {9}, number = {2}, pages = {145--149}, year = {2015}, url = {https://doi.org/10.26493/1855-3974.459.c4d}, doi = {10.26493/1855-3974.459.C4D}, timestamp = {Wed, 27 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arsmc/BrinkmannLSC15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/arsmc/DeLaVinaL13, author = {Ermelinda DeLaVi{\~{n}}a and Craig E. Larson}, title = {A parallel algorithm for computing the critical independence number and related sets}, journal = {Ars Math. Contemp.}, volume = {6}, number = {2}, pages = {237--245}, year = {2013}, url = {https://doi.org/10.26493/1855-3974.165.b8b}, doi = {10.26493/1855-3974.165.B8B}, timestamp = {Wed, 27 Mar 2019 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/arsmc/DeLaVinaL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/ErohGKLY12, author = {Linda Eroh and Ralucca Gera and Cong X. Kang and Craig E. Larson and Eunjeong Yi}, title = {Domination in functigraphs}, journal = {Discuss. Math. Graph Theory}, volume = {32}, number = {2}, pages = {299--319}, year = {2012}, url = {https://doi.org/10.7151/dmgt.1600}, doi = {10.7151/DMGT.1600}, timestamp = {Mon, 26 Jun 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/ErohGKLY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/gc/DeLaVinaLPW12, author = {Ermelinda DeLaVi{\~{n}}a and Craig E. Larson and Ryan Pepper and Bill Waller}, title = {A Characterization of Graphs Where the Independence Number Equals the Radius}, journal = {Graphs Comb.}, volume = {28}, number = {3}, pages = {315--332}, year = {2012}, url = {https://doi.org/10.1007/s00373-011-1054-x}, doi = {10.1007/S00373-011-1054-X}, timestamp = {Thu, 04 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/gc/DeLaVinaLPW12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorics/LarsonP11, author = {Craig E. Larson and Ryan Pepper}, title = {Graphs with equal Independence and Annihilation Numbers}, journal = {Electron. J. Comb.}, volume = {18}, number = {1}, year = {2011}, url = {https://doi.org/10.37236/667}, doi = {10.37236/667}, timestamp = {Fri, 10 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorics/LarsonP11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dmgt/Abay-AsmeronHLT11, author = {Ghidewon Abay{-}Asmerom and Richard H. Hammack and Craig E. Larson and Dewey T. Taylor}, title = {Notes on the independence number in the Cartesian product of graphs}, journal = {Discuss. Math. Graph Theory}, volume = {31}, number = {1}, pages = {25--35}, year = {2011}, url = {https://doi.org/10.7151/dmgt.1527}, doi = {10.7151/DMGT.1527}, timestamp = {Sun, 22 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dmgt/Abay-AsmeronHLT11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/Larson11, author = {Craig E. Larson}, title = {The critical independence number and an independence decomposition}, journal = {Eur. J. Comb.}, volume = {32}, number = {2}, pages = {294--300}, year = {2011}, url = {https://doi.org/10.1016/j.ejc.2010.10.004}, doi = {10.1016/J.EJC.2010.10.004}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/Larson11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/Abay-AsmeromHLT10, author = {Ghidewon Abay{-}Asmerom and Richard H. Hammack and Craig E. Larson and Dewey T. Taylor}, title = {Direct Product Factorization of Bipartite Graphs with Bipartition-reversing Involutions}, journal = {{SIAM} J. Discret. Math.}, volume = {23}, number = {4}, pages = {2042--2052}, year = {2010}, url = {https://doi.org/10.1137/090751761}, doi = {10.1137/090751761}, timestamp = {Sun, 22 Aug 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/Abay-AsmeromHLT10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dimacs/Larson01, author = {Craig E. Larson}, editor = {Siemion Fajtlowicz and Patrick W. Fowler and Pierre Hansen and Melvin F. Janowitz and Fred S. Roberts}, title = {A Survey of Research in Automated Mathematical Conjecture-Making}, booktitle = {Graphs and Discovery, Proceedings of a {DIMACS} Workshop, New Brunswick, New Jersey, USA, November 12-16, 2001}, series = {{DIMACS} Series in Discrete Mathematics and Theoretical Computer Science}, volume = {69}, pages = {297--318}, publisher = {{DIMACS/AMS}}, year = {2001}, url = {https://doi.org/10.1090/dimacs/069/16}, doi = {10.1090/DIMACS/069/16}, timestamp = {Mon, 22 May 2023 16:07:34 +0200}, biburl = {https://dblp.org/rec/conf/dimacs/Larson01.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.