Search dblp for Publications

export results for "toc:db/journals/jct/jcta83.bht:"

 download as .bib file

@article{DBLP:journals/jct/Bayer98,
  author       = {Margaret M. Bayer},
  title        = {An Upper Bound Theorem for Rational Polytopes},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {141--145},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2849},
  doi          = {10.1006/JCTA.1997.2849},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Bayer98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/BlackburnW98,
  author       = {Simon R. Blackburn and
                  Peter R. Wild},
  title        = {Optimal Linear Perfect Hash Families},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {233--250},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2876},
  doi          = {10.1006/JCTA.1998.2876},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/BlackburnW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Canfield98,
  author       = {E. Rodney Canfield},
  title        = {The Size of the Largest Antichain in the Partition Lattice},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {188--201},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2871},
  doi          = {10.1006/JCTA.1998.2871},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Canfield98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/CaroY98,
  author       = {Yair Caro and
                  Raphael Yuster},
  title        = {Covering Graphs: The Covering Problem Solved},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {273--282},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2867},
  doi          = {10.1006/JCTA.1998.2867},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/CaroY98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Ciucu98,
  author       = {Mihai Ciucu},
  title        = {Enumeration of Lozenge Tilings of Punctured Hexagons},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {268--272},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2863},
  doi          = {10.1006/JCTA.1997.2863},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Ciucu98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Cooperstein98,
  author       = {Bruce N. Cooperstein},
  title        = {On the Generation of Dual Polar Spaces of Symplectic Type over Finite
                  Fields},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {221--232},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2875},
  doi          = {10.1006/JCTA.1998.2875},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Cooperstein98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/CorteelSV98,
  author       = {Sylvie Corteel and
                  Carla D. Savage and
                  Radhika Venkatraman},
  title        = {A Bijection for Partitions with All Ranks at Least t},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {202--220},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2873},
  doi          = {10.1006/JCTA.1998.2873},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/CorteelSV98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Ekin98,
  author       = {A. B{\"{u}}lent Ekin},
  title        = {Inequalities for the Crank},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {283--289},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2884},
  doi          = {10.1006/JCTA.1998.2884},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Ekin98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/FuR98,
  author       = {Hung{-}Lin Fu and
                  Christopher A. Rodger},
  title        = {Group Divisible Designs with Two Associate Classes: n=2 orm=2},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {94--117},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2868},
  doi          = {10.1006/JCTA.1998.2868},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/FuR98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Gasharov98,
  author       = {Vesselin Gasharov},
  title        = {Factoring the Poincar{\'{e}} Polynomials for the Bruhat Order
                  on S\({}_{\mbox{n}}\)},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {159--164},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2861},
  doi          = {10.1006/JCTA.1997.2861},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Gasharov98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Herscovici98,
  author       = {David S. Herscovici},
  title        = {A Geometric Proof of the Gap Theorem},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {146--151},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2858},
  doi          = {10.1006/JCTA.1997.2858},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Herscovici98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/JacquardS98,
  author       = {Benjamin Jacquard and
                  Gilles Schaeffer},
  title        = {A Bijective Census of Nonseparable Planar Maps},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {1--20},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2852},
  doi          = {10.1006/JCTA.1997.2852},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/JacquardS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/JankoT98,
  author       = {Zvonimir Janko and
                  Vladimir D. Tonchev},
  title        = {New Designs with Block Size 7},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {152--157},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2859},
  doi          = {10.1006/JCTA.1997.2859},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JankoT98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/JhaJ98,
  author       = {Vikram Jha and
                  Norman L. Johnson},
  title        = {Finite Doubly Transitive Affine Planes},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {165--168},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2862},
  doi          = {10.1006/JCTA.1997.2862},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/JhaJ98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Katona98,
  author       = {Gyula O. H. Katona},
  title        = {A Simple Proof of a Theorem of Milner},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {138--140},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2848},
  doi          = {10.1006/JCTA.1997.2848},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Katona98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/LawtherL98,
  author       = {R. Lawther and
                  Martin W. Liebeck},
  title        = {On the Diameter of a Cayley Graph of a Simple Group of Lie Type Based
                  on a Conjugacy Class},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {118--137},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2869},
  doi          = {10.1006/JCTA.1998.2869},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/LawtherL98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Lev98,
  author       = {Vsevolod F. Lev},
  title        = {On the Number of Solutions of a Linear Equation over Finite Sets},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {251--267},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2878},
  doi          = {10.1006/JCTA.1998.2878},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Lev98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/McGuireW98,
  author       = {Gary McGuire and
                  Harold N. Ward},
  title        = {Characterization of Certain Minimal Rank Designs},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {42--56},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2856},
  doi          = {10.1006/JCTA.1997.2856},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/McGuireW98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/PenttilaS98,
  author       = {Tim Penttila and
                  Leo Storme},
  title        = {Monomial Flocks and Herds Containing a Monomial Oval},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {21--41},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2855},
  doi          = {10.1006/JCTA.1997.2855},
  timestamp    = {Fri, 09 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jct/PenttilaS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Port98,
  author       = {Daniel Port},
  title        = {Circular Numbers and n-set Partitions},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {57--78},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2857},
  doi          = {10.1006/JCTA.1997.2857},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Port98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/RadcliffeS98,
  author       = {A. J. Radcliffe and
                  Alex D. Scott},
  title        = {Reconstructing Subsets of Z\({}_{\mbox{n}}\)},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {2},
  pages        = {169--187},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1998.2870},
  doi          = {10.1006/JCTA.1998.2870},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/RadcliffeS98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Reid98,
  author       = {Michael Reid},
  title        = {Tiling a Square with Eight Congruent Polyominoes},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {158},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2860},
  doi          = {10.1006/JCTA.1997.2860},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Reid98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jct/Ward98,
  author       = {Harold N. Ward},
  title        = {Divisibility of Codes Meeting the Griesmer Bound},
  journal      = {J. Comb. Theory, Ser. {A}},
  volume       = {83},
  number       = {1},
  pages        = {79--93},
  year         = {1998},
  url          = {https://doi.org/10.1006/jcta.1997.2864},
  doi          = {10.1006/JCTA.1997.2864},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jct/Ward98.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.