default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dm/dm44.bht:"
download as .bib file
@article{DBLP:journals/dm/Aharoni83,
author = {Ron Aharoni},
title = {A principle of symmetry in networks},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {1--11},
year = {1983},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Aharoni83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Anstee83,
author = {Richard P. Anstee},
title = {The network flows approach for matrices with given row and column
sums},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {125--138},
year = {1983},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Anstee83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Baker83,
author = {Ronald D. Baker},
title = {Resolvable bibd and sols},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {13--29},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90003-1},
doi = {10.1016/0012-365X(83)90003-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Baker83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BangeBS83,
author = {David W. Bange and
Anthony E. Barkauskas and
Peter J. Slater},
title = {Sequentially additive graphs},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {235--241},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90187-5},
doi = {10.1016/0012-365X(83)90187-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BangeBS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Bertram83,
author = {Edward A. Bertram},
title = {Some applications of graph theory to finite groups},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {31--43},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90004-3},
doi = {10.1016/0012-365X(83)90004-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Bertram83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BondyH83,
author = {J. Adrian Bondy and
Pavol Hell},
title = {Counterexamples to theorems of Menger type for the diameter},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {217--220},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90062-6},
doi = {10.1016/0012-365X(83)90062-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BondyH83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BrighamD83,
author = {Robert C. Brigham and
Ronald D. Dutton},
title = {On clique covers and independence numbers of graphs},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {139--144},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90054-7},
doi = {10.1016/0012-365X(83)90054-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BrighamD83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BuckinghamG83,
author = {Mark A. Buckingham and
Martin Charles Golumbic},
title = {Partitionable graphs, circle graphs, and the berge strong perfect
graph conjecture},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {45--54},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90005-5},
doi = {10.1016/0012-365X(83)90005-5},
timestamp = {Sat, 21 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BuckinghamG83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cai83,
author = {Mao{-}cheng Cai},
title = {A counterexample to a conjecture of grant},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {111},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90010-9},
doi = {10.1016/0012-365X(83)90010-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Cai83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Cerasoli83,
author = {Mauro Cerasoli},
title = {On the probability of a Boolean polynomial of events},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {221--227},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90063-8},
doi = {10.1016/0012-365X(83)90063-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Cerasoli83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenM83,
author = {C. C. Chen and
P. Manalastas},
title = {Every finite strongly connected digraph of stability 2 has a Hamiltonian
path},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {243--250},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90188-7},
doi = {10.1016/0012-365X(83)90188-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChenM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DinitzS83,
author = {Jeffrey H. Dinitz and
Douglas R. Stinson},
title = {Mols with holes},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {145--154},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90055-9},
doi = {10.1016/0012-365X(83)90055-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DinitzS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Drapal83,
author = {Ales Dr{\'{a}}pal},
title = {On quasigroups rich in associative triples},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {251--265},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90189-9},
doi = {10.1016/0012-365X(83)90189-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Drapal83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Exoo83,
author = {Geoffrey Exoo},
title = {On line disjoint paths of bounded length},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {317--318},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90197-8},
doi = {10.1016/0012-365X(83)90197-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Exoo83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Farrell83,
author = {Edward J. Farrell},
title = {Forest decompositions of ladders},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {267--274},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90190-5},
doi = {10.1016/0012-365X(83)90190-5},
timestamp = {Thu, 25 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Farrell83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fleischner83,
author = {Herbert Fleischner},
title = {Even cycles with prescribed chords in planar cubic graphs},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {275--280},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90191-7},
doi = {10.1016/0012-365X(83)90191-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fleischner83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fraenkel83,
author = {Aviezri S. Fraenkel},
title = {Problem 38},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {331--333},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90202-9},
doi = {10.1016/0012-365X(83)90202-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fraenkel83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fraenkel83a,
author = {Aviezri S. Fraenkel},
title = {Problem 39 : Posed by Aviezri S. Fraenkel and Anton Kotzig},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {333},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90203-0},
doi = {10.1016/0012-365X(83)90203-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fraenkel83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fraenkel83b,
author = {Aviezri S. Fraenkel},
title = {Problem 40},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {333--334},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90204-2},
doi = {10.1016/0012-365X(83)90204-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fraenkel83b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Gionfriddo83,
author = {Mario Gionfriddo},
title = {On the set J(v) for Steiner Quadruple systems of order v = 2\({}^{\mbox{n}}\)
with n{\textgreater}=4},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {155--160},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90056-0},
doi = {10.1016/0012-365X(83)90056-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Gionfriddo83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HahnSS83,
author = {Gena Hahn and
Dominique Sotteau and
H. Sun},
title = {Short cycles in mediate graphs},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {281--284},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90192-9},
doi = {10.1016/0012-365X(83)90192-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HahnSS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Kabell83,
author = {Jerald A. Kabell},
title = {A note on colorings of finite planes},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {319--320},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90198-X},
doi = {10.1016/0012-365X(83)90198-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Kabell83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KelmansK83,
author = {Alexander K. Kelmans and
Boris N. Kimelfeld},
title = {Multiplicative submodularity of a matrix's principal minor as a function
of the set of its rows and some combinatorial applications},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {113--116},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90011-0},
doi = {10.1016/0012-365X(83)90011-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KelmansK83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LiuC83,
author = {C. J. Liu and
Yutze Chow},
title = {An operator approach to some graph enumeration problems},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {285--291},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90193-0},
doi = {10.1016/0012-365X(83)90193-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LiuC83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/McMorrisM83,
author = {Fred R. McMorris and
G. T. Myers},
title = {Some uniqueness results for upper bound},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {321--323},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90199-1},
doi = {10.1016/0012-365X(83)90199-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/McMorrisM83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Negami83,
author = {Seiya Negami},
title = {Uniqueness and faithfulness of embedding of toroidal graphs},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {161--180},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90057-2},
doi = {10.1016/0012-365X(83)90057-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Negami83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Owens83,
author = {P. J. Owens},
title = {Bipartite cubic graphs and a shortness exponent},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {327--330},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90201-7},
doi = {10.1016/0012-365X(83)90201-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Owens83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Oxley83,
author = {James G. Oxley},
title = {On a matroid identity},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {55--60},
year = {1983},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Oxley83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Payan83,
author = {Charles Payan},
title = {Perfectness and dilworth number},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {229--230},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90064-X},
doi = {10.1016/0012-365X(83)90064-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Payan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Rajkundlia83,
author = {Dinesh P. Rajkundlia},
title = {Some techniques for constructing infinite families of BIBD'S},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {61--96},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90007-9},
doi = {10.1016/0012-365X(83)90007-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Rajkundlia83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Sagan83,
author = {Bruce E. Sagan},
title = {A note on Abel polynomials and rooted labeled forests},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {293--298},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90194-2},
doi = {10.1016/0012-365X(83)90194-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Sagan83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Sato83,
author = {Masako Sato},
title = {Note on the number of minimal lattice paths restricted by two parallel
lines},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {117--121},
year = {1983},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Sato83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Simpson83,
author = {James E. Simpson},
title = {Langford sequences: perfect and hooked},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {97--104},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90008-0},
doi = {10.1016/0012-365X(83)90008-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Simpson83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/StoneW83,
author = {M. G. Stone and
R. H. Weedmark},
title = {On representing M\({}_{\mbox{n}}\)'s by congruence lattice of finite
algebras},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {299--308},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90195-4},
doi = {10.1016/0012-365X(83)90195-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/StoneW83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tort83,
author = {J. R. Tort},
title = {Un probleme de partition de l'ensemble des parties a trois elements
d'un ensemble fini},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {181--185},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90058-4},
doi = {10.1016/0012-365X(83)90058-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tort83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Tucker83,
author = {Alan Tucker},
title = {Uniquely colorable perfect graphs},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {187--194},
year = {1983},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Tucker83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Usami83,
author = {Yoko Usami},
title = {Minimum number of edges in graphs that are both P\({}_{\mbox{2}}\)-
and P\({}_{\mbox{i}}\)-connected},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {195--199},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90060-2},
doi = {10.1016/0012-365X(83)90060-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Usami83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Veldman83a,
author = {Henk Jan Veldman},
title = {Non-kappa-critical vertices in graphs},
journal = {Discret. Math.},
volume = {44},
number = {1},
pages = {105--110},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90009-2},
doi = {10.1016/0012-365X(83)90009-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Veldman83a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Veldman83b,
author = {Henk Jan Veldman},
title = {Existence of D\({}_{\mbox{lambda}}\)-cycles and D\({}_{\mbox{lambda}}\)-paths},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {309--316},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90196-6},
doi = {10.1016/0012-365X(83)90196-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Veldman83b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wild83,
author = {Peter R. Wild},
title = {Incidence graphs and subdesigns of semisymmetric designs},
journal = {Discret. Math.},
volume = {44},
number = {2},
pages = {201--216},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90061-4},
doi = {10.1016/0012-365X(83)90061-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wild83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Zeilberger83,
author = {Doron Zeilberger},
title = {Andre's reflection proof generalized to the many-candidate ballot
problem},
journal = {Discret. Math.},
volume = {44},
number = {3},
pages = {325--326},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90200-5},
doi = {10.1016/0012-365X(83)90200-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Zeilberger83.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.
retrieved on 2024-09-20 08:32 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
