default search action
Search dblp for Publications
export results for "toc:db/journals/ejc/ejc87.bht:"
@article{DBLP:journals/ejc/BachmannC20, author = {Henrik Bachmann and Steven Charlton}, title = {Generalized Jacobi-Trudi determinants and evaluations of Schur multiple zeta values}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103133}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103133}, doi = {10.1016/J.EJC.2020.103133}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/BachmannC20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/BagnoERS20, author = {Eli Bagno and Estrella Eisenberg and Shulamit Reches and Moriah Sigron}, title = {On the poset of non-attacking king permutations}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103119}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103119}, doi = {10.1016/J.EJC.2020.103119}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/BagnoERS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/BalkoV20, author = {Martin Balko and M{\'{a}}t{\'{e}} Vizer}, title = {Edge-ordered Ramsey numbers}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103100}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103100}, doi = {10.1016/J.EJC.2020.103100}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/BalkoV20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/DelucchiH20, author = {Emanuele Delucchi and Linard Hoessly}, title = {Fundamental polytopes of metric trees via parallel connections of matroids}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103098}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103098}, doi = {10.1016/J.EJC.2020.103098}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/DelucchiH20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/Frankl20a, author = {Peter Frankl}, title = {An improved universal bound for t-intersecting families}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103134}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103134}, doi = {10.1016/J.EJC.2020.103134}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/Frankl20a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/FrettlohR20, author = {Dirk Frettl{\"{o}}h and Christian Richter}, title = {Incongruent equipartitions of the plane}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103129}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103129}, doi = {10.1016/J.EJC.2020.103129}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/FrettlohR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/Konan20, author = {Isaac Konan}, title = {A bijective proof and generalization of Siladi{\'{c}}'s Theorem}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103101}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103101}, doi = {10.1016/J.EJC.2020.103101}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/Konan20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/LiuS20, author = {Ricky Ini Liu and Christian Smith}, title = {The algebra of Schur operators}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103130}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103130}, doi = {10.1016/J.EJC.2020.103130}, timestamp = {Sun, 06 Oct 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/LiuS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/MancinskaPRR20, author = {Laura Mancinska and Irene Pivotto and David E. Roberson and Gordon F. Royle}, title = {Cores of cubelike graphs}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103092}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103092}, doi = {10.1016/J.EJC.2020.103092}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/MancinskaPRR20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/Parczyk20, author = {Olaf Parczyk}, title = {2-universality in randomly perturbed graphs}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103118}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103118}, doi = {10.1016/J.EJC.2020.103118}, timestamp = {Fri, 22 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/Parczyk20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/SpinkT20, author = {Hunter Spink and Marius Tiba}, title = {Multicolor chain avoidance in the Boolean lattice}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103135}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103135}, doi = {10.1016/J.EJC.2020.103135}, timestamp = {Tue, 19 May 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/ejc/SpinkT20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/Wallner20, author = {Michael Wallner}, title = {A half-normal distribution scheme for generating functions}, journal = {Eur. J. Comb.}, volume = {87}, pages = {103138}, year = {2020}, url = {https://doi.org/10.1016/j.ejc.2020.103138}, doi = {10.1016/J.EJC.2020.103138}, timestamp = {Thu, 30 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/Wallner20.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.