Search dblp for Publications

export results for "toc:db/journals/dm/dm43.bht:"

 download as .bib file

@article{DBLP:journals/dm/BerghammerS83,
  author       = {Rudolf Berghammer and
                  Gunther Schmidt},
  title        = {Discrete ordering relations},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {1--7},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90015-8},
  doi          = {10.1016/0012-365X(83)90015-8},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/BerghammerS83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Blecher83,
  author       = {Pavel M. Blecher},
  title        = {On a logical problem},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {107--110},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90026-2},
  doi          = {10.1016/0012-365X(83)90026-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Blecher83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Bry83,
  author       = {Fran{\c{c}}ois Bry},
  title        = {On the factorization of graphs with exactly one vertex of infinite
                  degree},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {317--320},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90168-1},
  doi          = {10.1016/0012-365X(83)90168-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Bry83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cordovil83,
  author       = {Raul Cordovil},
  title        = {The directions determined by n points in the plane: a matroidal generalization},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {131--137},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90151-6},
  doi          = {10.1016/0012-365X(83)90151-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Cordovil83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CulikK83,
  author       = {Karel Cul{\'{\i}}k II and
                  Juhani Karhum{\"{a}}ki},
  title        = {Systems of equations over a free monoid and Ehrenfeucht's conjecture},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {139--153},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90152-8},
  doi          = {10.1016/0012-365X(83)90152-8},
  timestamp    = {Wed, 24 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CulikK83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DasR83,
  author       = {Prabir Das and
                  S. B. Rao},
  title        = {Alternating eulerian trails with prescribed degrees in two edge-colored
                  complete graphs},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {9--20},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90016-X},
  doi          = {10.1016/0012-365X(83)90016-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DasR83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Dehon83,
  author       = {Michel Dehon},
  title        = {On the existence of 2-designs S\({}_{\mbox{lambda}}\)(2, 3, upsilon)
                  without repeated blocks},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {155--171},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90153-X},
  doi          = {10.1016/0012-365X(83)90153-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Dehon83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DuchetM83,
  author       = {Pierre Duchet and
                  Henry Meyniel},
  title        = {Une generalisation du theoreme de Richardson sur l'existence de noyaux
                  dans les graphes orientes},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {21--27},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90017-1},
  doi          = {10.1016/0012-365X(83)90017-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DuchetM83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Farber83,
  author       = {Martin Farber},
  title        = {Characterizations of strongly chordal graphs},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {173--189},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90154-1},
  doi          = {10.1016/0012-365X(83)90154-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Farber83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fournier83,
  author       = {J.{-}C. Fournier},
  title        = {Hypergraphes de chaines d'aretes d'un arbre},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {29--36},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90018-3},
  doi          = {10.1016/0012-365X(83)90018-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Fournier83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl83,
  author       = {Peter Frankl},
  title        = {A probabilistic proof for the lym-inequality},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {325},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90170-X},
  doi          = {10.1016/0012-365X(83)90170-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Frankl83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GolumbicRU83,
  author       = {Martin Charles Golumbic and
                  Doron Rotem and
                  Jorge Urrutia},
  title        = {Comparability graphs and intersection graphs},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {37--46},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90019-5},
  doi          = {10.1016/0012-365X(83)90019-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/GolumbicRU83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Hartfiel83,
  author       = {Darald J. Hartfiel},
  title        = {Stochastic eigenvectors for qualitative stochastic matrices},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {191--197},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90155-3},
  doi          = {10.1016/0012-365X(83)90155-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Hartfiel83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Horton83,
  author       = {Joseph Douglas Horton},
  title        = {The construction of Kotzig factorizations},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {199--206},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90156-5},
  doi          = {10.1016/0012-365X(83)90156-5},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Horton83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jeurissen83,
  author       = {R. H. Jeurissen},
  title        = {Disconnected graphs with magic labelings},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {47--53},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90020-1},
  doi          = {10.1016/0012-365X(83)90020-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Jeurissen83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Jeurissen83a,
  author       = {R. H. Jeurissen},
  title        = {Pseudo-magic graphs},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {207--214},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90157-7},
  doi          = {10.1016/0012-365X(83)90157-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Jeurissen83a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KomlosS83,
  author       = {J{\'{a}}nos Koml{\'{o}}s and
                  Endre Szemer{\'{e}}di},
  title        = {Limit distribution for the existence of hamiltonian cycles in a random
                  graph},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {55--63},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90021-3},
  doi          = {10.1016/0012-365X(83)90021-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KomlosS83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lam83,
  author       = {Clement W. H. Lam},
  title        = {Non-skew symmetric orthogonal matrices with constant diagonals},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {65--78},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90022-5},
  doi          = {10.1016/0012-365X(83)90022-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lam83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lauri83,
  author       = {Josef Lauri},
  title        = {Proof of Harary's conjecture on the reconstruction of trees},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {79--90},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90023-7},
  doi          = {10.1016/0012-365X(83)90023-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lauri83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Lindstrom83,
  author       = {Bernt Lindstr{\"{o}}m},
  title        = {Undecided Ramsey-Numbers for Paths},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {111--112},
  year         = {1983},
  url          = {https://doi.org/10.1016/S0012-365X(83)90000-6},
  doi          = {10.1016/S0012-365X(83)90000-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Lindstrom83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MarusicP83,
  author       = {Dragan Marusic and
                  Torrence D. Parsons},
  title        = {Hamiltonian paths in vertex-symmetric graphs of order 4p},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {91--96},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90024-9},
  doi          = {10.1016/0012-365X(83)90024-9},
  timestamp    = {Fri, 15 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/MarusicP83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McKee83,
  author       = {Terry A. McKee},
  title        = {Duality principles for binary matroids and graphs},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {215--222},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90158-9},
  doi          = {10.1016/0012-365X(83)90158-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/McKee83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NowakowskiR83,
  author       = {Richard J. Nowakowski and
                  Ivan Rival},
  title        = {The smallest graph variety containing all paths},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {223--234},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90159-0},
  doi          = {10.1016/0012-365X(83)90159-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/NowakowskiR83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NowakowskiW83,
  author       = {Richard J. Nowakowski and
                  Peter Winkler},
  title        = {Vertex-to-vertex pursuit in a graph},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {235--239},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90160-7},
  doi          = {10.1016/0012-365X(83)90160-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/NowakowskiW83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Prodinger83,
  author       = {Helmut Prodinger},
  title        = {Non-repetitive sequences and gray code},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {113--116},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90027-4},
  doi          = {10.1016/0012-365X(83)90027-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Prodinger83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reiner83,
  author       = {David L. Reiner},
  title        = {A q-analog of the campbell-baker-hausdorff formula},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {125--129},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90030-4},
  doi          = {10.1016/0012-365X(83)90030-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Reiner83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Rudeanu83,
  author       = {Sergiu Rudeanu},
  title        = {Linear Boolean equations and generalized minterms},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {241--248},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90161-9},
  doi          = {10.1016/0012-365X(83)90161-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Rudeanu83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ruskey83,
  author       = {Frank Ruskey},
  title        = {A simple proof of a formula of Dershowitz and Zaks},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {117--118},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90028-6},
  doi          = {10.1016/0012-365X(83)90028-6},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Ruskey83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SatoC83,
  author       = {Masako Sato and
                  Thien Tran Cong},
  title        = {The number of minimal lattice paths restricted by two parallel lines},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {249--261},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90162-0},
  doi          = {10.1016/0012-365X(83)90162-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/SatoC83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SchaferW83,
  author       = {Dieter Sch{\"{a}}fer and
                  Karl Erich Wolff},
  title        = {P{\'{o}}lya enumeration of expansions of resolvable incidence
                  structures},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {263--271},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90163-2},
  doi          = {10.1016/0012-365X(83)90163-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/SchaferW83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Stein83,
  author       = {Peter Stein},
  title        = {On Chv{\'{a}}tal's conjecture related to a hereditary system},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {97--105},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90025-0},
  doi          = {10.1016/0012-365X(83)90025-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Stein83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Stein83a,
  author       = {Peter Stein},
  title        = {Chv{\'{a}}tal's conjecture and point-intersections},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {321--323},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90169-3},
  doi          = {10.1016/0012-365X(83)90169-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Stein83a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Straubing83,
  author       = {Howard Straubing},
  title        = {A combinatorial proof of the Cayley-Hamilton theorem},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {273--279},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90164-4},
  doi          = {10.1016/0012-365X(83)90164-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Straubing83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Veldman83,
  author       = {Henk Jan Veldman},
  title        = {Existence of dominating cycles and paths},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {281--296},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90165-6},
  doi          = {10.1016/0012-365X(83)90165-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Veldman83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/WitteLG83,
  author       = {David Witte and
                  Gail Letzter and
                  Joseph A. Gallian},
  title        = {On hamiltonian circuits in cartesian products of Cayley digraphs},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {297--307},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90166-8},
  doi          = {10.1016/0012-365X(83)90166-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/WitteLG83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wong83,
  author       = {P. K. Wong},
  title        = {On the smallest graphs of girth 10 and valency 3},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {1},
  pages        = {119--124},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90029-8},
  doi          = {10.1016/0012-365X(83)90029-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Wong83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zaks83,
  author       = {Joseph Zaks},
  title        = {Extending two theorems of A. Kotzig},
  journal      = {Discret. Math.},
  volume       = {43},
  number       = {2-3},
  pages        = {309--315},
  year         = {1983},
  url          = {https://doi.org/10.1016/0012-365X(83)90167-X},
  doi          = {10.1016/0012-365X(83)90167-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Zaks83.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics