default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Peter J. Slater
@article{DBLP:journals/corr/abs-2202-02620,
author = {Suk Jai Seo and
Peter J. Slater},
title = {Graphical parameters for classes of tumbling block graphs},
journal = {CoRR},
volume = {abs/2202.02620},
year = {2022},
url = {https://arxiv.org/abs/2202.02620},
eprinttype = {arXiv},
eprint = {2202.02620},
timestamp = {Fri, 06 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2202-02620.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SethuramanRS17,
author = {G. Sethuraman and
P. Ragukumar and
Peter J. Slater},
title = {Any Tree with m edges can be embedded in a Graceful Tree with less
than 4m edges and in a graceful planar graph},
journal = {Discret. Math.},
volume = {340},
number = {2},
pages = {96--106},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.07.009},
doi = {10.1016/J.DISC.2016.07.009},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/SethuramanRS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/SeoS17,
author = {Suk Jai Seo and
Peter J. Slater},
title = {Open-independent, open-locating-dominating sets},
journal = {Electron. J. Graph Theory Appl.},
volume = {5},
number = {2},
pages = {179--193},
year = {2017},
url = {https://doi.org/10.5614/ejgta.2017.5.2.2},
doi = {10.5614/EJGTA.2017.5.2.2},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/SeoS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/SeoS15,
author = {Suk Jai Seo and
Peter J. Slater},
title = {Fault tolerant detectors for distinquishing sets in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {35},
number = {4},
pages = {797--818},
year = {2015},
url = {https://doi.org/10.7151/dmgt.1838},
doi = {10.7151/DMGT.1838},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/SeoS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/SewellS14,
author = {J. Louis Sewell and
Peter J. Slater},
title = {A sharp lower bound for locating-dominating sets in trees},
journal = {Australas. {J} Comb.},
volume = {60},
pages = {136--149},
year = {2014},
url = {http://ajc.maths.uq.edu.au/pdf/60/ajc\_v60\_p136.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/SewellS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejgta/ChellaliRSS14,
author = {Mustapha Chellali and
Nader Jafari Rad and
Suk Jai Seo and
Peter J. Slater},
title = {On open neighborhood locating-dominating in graphs},
journal = {Electron. J. Graph Theory Appl.},
volume = {2},
number = {2},
pages = {87--98},
year = {2014},
url = {https://doi.org/10.5614/ejgta.2014.2.2.1},
doi = {10.5614/EJGTA.2014.2.2.1},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejgta/ChellaliRSS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/FoucaudKS14,
author = {Florent Foucaud and
Ralf Klasing and
Peter J. Slater},
title = {Centroidal bases in graphs},
journal = {Networks},
volume = {64},
number = {2},
pages = {96--108},
year = {2014},
url = {https://doi.org/10.1002/net.21560},
doi = {10.1002/NET.21560},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/FoucaudKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/ONealS13,
author = {Allen O'Neal and
Peter J. Slater},
title = {Uniqueness of Vertex Magic Constants},
journal = {{SIAM} J. Discret. Math.},
volume = {27},
number = {2},
pages = {708--716},
year = {2013},
url = {https://doi.org/10.1137/110834421},
doi = {10.1137/110834421},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/ONealS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SeoS11,
author = {Suk Jai Seo and
Peter J. Slater},
title = {Open neighborhood locating-dominating in trees},
journal = {Discret. Appl. Math.},
volume = {159},
number = {6},
pages = {484--489},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2010.12.010},
doi = {10.1016/J.DAM.2010.12.010},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SeoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/SewellS11,
author = {J. Louis Sewell and
Peter J. Slater},
title = {Distance independence in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {31},
number = {2},
pages = {397--409},
year = {2011},
url = {https://doi.org/10.7151/dmgt.1554},
doi = {10.7151/DMGT.1554},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/SewellS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mics/ONealS11,
author = {Allen O'Neal and
Peter J. Slater},
title = {An Introduction to Closed/Open Neighborhood Sums: Minimax, Maximin,
and Spread},
journal = {Math. Comput. Sci.},
volume = {5},
number = {1},
pages = {69--80},
year = {2011},
url = {https://doi.org/10.1007/s11786-011-0075-4},
doi = {10.1007/S11786-011-0075-4},
timestamp = {Wed, 12 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mics/ONealS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ACMse/SeoS11,
author = {Suk Jai Seo and
Peter J. Slater},
editor = {Victor A. Clincy and
Kenneth E. Hoganson and
Jose Garrido and
Venu Dasigi},
title = {Open neighborhood locating-domination for infinite cylinders},
booktitle = {Proceedings of the 49th Annual Southeast Regional Conference, 2011,
Kennesaw, GA, USA, March 24-26, 2011},
pages = {334--335},
publisher = {{ACM}},
year = {2011},
url = {https://doi.org/10.1145/2016039.2016134},
doi = {10.1145/2016039.2016134},
timestamp = {Fri, 12 Mar 2021 15:27:48 +0100},
biburl = {https://dblp.org/rec/conf/ACMse/SeoS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/SeoS10,
author = {Suk Jai Seo and
Peter J. Slater},
title = {Open neighborhood locating dominating sets},
journal = {Australas. {J} Comb.},
volume = {46},
pages = {109--120},
year = {2010},
url = {http://ajc.maths.uq.edu.au/pdf/46/ajc\_v46\_p109.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/SeoS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/ChellaliMS10,
author = {Mustapha Chellali and
Malika Mimouni and
Peter J. Slater},
title = {On locating-domination in graphs},
journal = {Discuss. Math. Graph Theory},
volume = {30},
number = {2},
pages = {223--235},
year = {2010},
url = {https://doi.org/10.7151/dmgt.1488},
doi = {10.7151/DMGT.1488},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/ChellaliMS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RodenS09,
author = {Miranda L. Roden and
Peter J. Slater},
title = {Liar's domination in graphs},
journal = {Discret. Math.},
volume = {309},
number = {19},
pages = {5884--5890},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.07.019},
doi = {10.1016/J.DISC.2008.07.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RodenS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Slater09,
author = {Peter J. Slater},
title = {Liar's domination},
journal = {Networks},
volume = {54},
number = {2},
pages = {70--74},
year = {2009},
url = {https://doi.org/10.1002/net.20295},
doi = {10.1002/NET.20295},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Slater09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SinkoS08,
author = {Anne Sinko and
Peter J. Slater},
title = {Queen's domination using border squares and (A, B)-restricted domination},
journal = {Discret. Math.},
volume = {308},
number = {20},
pages = {4822--4828},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.08.065},
doi = {10.1016/J.DISC.2007.08.065},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SinkoS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/RubalcabaS07,
author = {Robert R. Rubalcaba and
Peter J. Slater},
title = {Roman dominating influence parameters},
journal = {Discret. Math.},
volume = {307},
number = {24},
pages = {3194--3200},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2007.03.020},
doi = {10.1016/J.DISC.2007.03.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/RubalcabaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/RubalcabaS07,
author = {Robert R. Rubalcaba and
Peter J. Slater},
title = {Efficient \emph{(j, k)-}domination},
journal = {Discuss. Math. Graph Theory},
volume = {27},
number = {3},
pages = {409--423},
year = {2007},
url = {https://doi.org/10.7151/dmgt.1371},
doi = {10.7151/DMGT.1371},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/RubalcabaS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/SeoS06,
author = {Suk Jai Seo and
Peter J. Slater},
title = {Competition-reachability of a graph},
journal = {Discret. Math.},
volume = {306},
number = {6},
pages = {580--590},
year = {2006},
url = {https://doi.org/10.1016/j.disc.2006.01.020},
doi = {10.1016/J.DISC.2006.01.020},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/SeoS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ACMse/SeoS06,
author = {Suk Jai Seo and
Peter J. Slater},
editor = {Ronaldo Menezes},
title = {An introduction to proper-coupled-domination in graphs},
booktitle = {Proceedings of the 44st Annual Southeast Regional Conference, 2006,
Melbourne, Florida, USA, March 10-12, 2006},
pages = {265--270},
publisher = {{ACM}},
year = {2006},
url = {https://doi.org/10.1145/1185448.1185508},
doi = {10.1145/1185448.1185508},
timestamp = {Fri, 12 Mar 2021 15:27:48 +0100},
biburl = {https://dblp.org/rec/conf/ACMse/SeoS06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/HaynesHS05,
author = {Teresa W. Haynes and
Michael A. Henning and
Peter J. Slater},
title = {Trees with Equal Domination and Paired-domination Numbers},
journal = {Ars Comb.},
volume = {76},
year = {2005},
timestamp = {Tue, 23 May 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/HaynesHS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ACMse/SeoS05,
author = {Suk Jai Seo and
Peter J. Slater},
editor = {M{\'{a}}rio Guimar{\~{a}}es},
title = {An introduction to competition-reachability of a graph},
booktitle = {Proceedings of the 43nd Annual Southeast Regional Conference, 2005,
Kennesaw, Georgia, USA, March 18-20, 2005, Volume 1},
pages = {121--125},
publisher = {{ACM}},
year = {2005},
url = {https://doi.org/10.1145/1167350.1167391},
doi = {10.1145/1167350.1167391},
timestamp = {Fri, 12 Mar 2021 15:27:48 +0100},
biburl = {https://dblp.org/rec/conf/ACMse/SeoS05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/SlaterW04,
author = {Peter J. Slater and
Steven J. Winters},
title = {An Introduction to Maximum Sum Permutations of Graphs},
journal = {Ars Comb.},
volume = {72},
year = {2004},
timestamp = {Fri, 27 May 2005 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/arscom/SlaterW04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HaynesHS03,
author = {Teresa W. Haynes and
Michael A. Henning and
Peter J. Slater},
title = {Strong equality of domination parameters in trees},
journal = {Discret. Math.},
volume = {260},
number = {1-3},
pages = {77--87},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00451-X},
doi = {10.1016/S0012-365X(02)00451-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HaynesHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HaynesHHS03,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Michael A. Henning and
Peter J. Slater},
title = {\emph{H}-forming sets in graphs},
journal = {Discret. Math.},
volume = {262},
number = {1-3},
pages = {159--169},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00496-X},
doi = {10.1016/S0012-365X(02)00496-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HaynesHHS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChartrandEHSZ03,
author = {Gary Chartrand and
David Erwin and
Michael A. Henning and
Peter J. Slater and
Ping Zhang},
title = {Graphs of order \emph{n} with locating-chromatic number \emph{n}-1},
journal = {Discret. Math.},
volume = {269},
number = {1-3},
pages = {65--79},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00829-4},
doi = {10.1016/S0012-365X(02)00829-4},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/ChartrandEHSZ03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GoddardRS03,
author = {Wayne Goddard and
Michael Edwin Raines and
Peter J. Slater},
title = {Distance and connectivity measures in permutation graphs},
journal = {Discret. Math.},
volume = {271},
number = {1-3},
pages = {61--70},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00870-1},
doi = {10.1016/S0012-365X(02)00870-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GoddardRS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KohLS03,
author = {Khee Meng Koh and
Bock Boom Lim and
Peter J. Slater},
title = {\emph{H}-domination in graphs},
journal = {Discret. Math.},
volume = {272},
number = {1},
pages = {97--105},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(03)00187-0},
doi = {10.1016/S0012-365X(03)00187-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KohLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Slater02,
author = {Peter J. Slater},
title = {Fault-tolerant locating-dominating sets},
journal = {Discret. Math.},
volume = {249},
number = {1-3},
pages = {179--189},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00244-8},
doi = {10.1016/S0012-365X(01)00244-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Slater02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DankelmannGS01,
author = {Peter Dankelmann and
Wayne Goddard and
Peter J. Slater},
title = {Average distance in colored graphs},
journal = {J. Graph Theory},
volume = {38},
number = {1},
pages = {1--17},
year = {2001},
url = {https://doi.org/10.1002/jgt.1020},
doi = {10.1002/JGT.1020},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DankelmannGS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/GoddardOSS99,
author = {Wayne Goddard and
Ortrud Oellermann and
Peter J. Slater and
Henda C. Swart},
title = {Bounds on the Total Redundance and Efficiency of a Graph},
journal = {Ars Comb.},
volume = {54},
year = {1999},
timestamp = {Tue, 06 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/GoddardOSS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Slater99,
author = {Peter J. Slater},
title = {A survey of sequences of central subgraphs},
journal = {Networks},
volume = {34},
number = {4},
pages = {244--249},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0037(199912)34:4\&\#60;244::AID-NET2\&\#62;3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0037(199912)34:4\&\#60;244::AID-NET2\&\#62;3.0.CO;2-L},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Slater99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SmartS99,
author = {Christian Smart and
Peter J. Slater},
title = {Center, median, and centroid subgraphs},
journal = {Networks},
volume = {34},
number = {4},
pages = {303--311},
year = {1999},
url = {https://doi.org/10.1002/(SICI)1097-0037(199912)34:4\&\#60;303::AID-NET10\&\#62;3.0.CO;2-\%23},
doi = {10.1002/(SICI)1097-0037(199912)34:4\&\#60;303::AID-NET10\&\#62;3.0.CO;2-\%23},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/SmartS99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0093827,
author = {Teresa W. Haynes and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Fundamentals of domination in graphs},
series = {Pure and applied mathematics},
volume = {208},
publisher = {Dekker},
year = {1998},
isbn = {978-0-8247-0033-1},
timestamp = {Mon, 22 Jul 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0093827.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HenningS98,
author = {Michael A. Henning and
Peter J. Slater},
title = {Closed neighborhood order dominating functions},
journal = {Australas. {J} Comb.},
volume = {17},
pages = {77--88},
year = {1998},
url = {http://ajc.maths.uq.edu.au/pdf/17/ocr-ajc-v17-p77.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HenningS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AminCS98,
author = {Ashok T. Amin and
Lane H. Clark and
Peter J. Slater},
title = {Parity dimension for graphs},
journal = {Discret. Math.},
volume = {187},
number = {1-3},
pages = {1--17},
year = {1998},
url = {https://doi.org/10.1016/S0012-365X(97)00242-2},
doi = {10.1016/S0012-365X(97)00242-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AminCS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/HaynesS98,
author = {Teresa W. Haynes and
Peter J. Slater},
title = {Paired-domination in graphs},
journal = {Networks},
volume = {32},
number = {3},
pages = {199--206},
year = {1998},
url = {https://doi.org/10.1002/(SICI)1097-0037(199810)32:3\&\#60;199::AID-NET4\&\#62;3.0.CO;2-F},
doi = {10.1002/(SICI)1097-0037(199810)32:3\&\#60;199::AID-NET4\&\#62;3.0.CO;2-F},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/HaynesS98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HenningS96,
author = {Michael A. Henning and
Peter J. Slater},
title = {Inequalities relating domination parameters in cubic graphs},
journal = {Discret. Math.},
volume = {158},
number = {1-3},
pages = {87--98},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(96)00025-8},
doi = {10.1016/0012-365X(96)00025-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HenningS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BangeBHS96,
author = {David W. Bange and
Anthony E. Barkauskas and
Linda H. Host and
Peter J. Slater},
title = {Generalized domination and efficient domination in graphs},
journal = {Discret. Math.},
volume = {159},
number = {1-3},
pages = {1--11},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(95)00094-D},
doi = {10.1016/0012-365X(95)00094-D},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BangeBHS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghHS95,
author = {Johannes H. Hattingh and
Michael A. Henning and
Peter J. Slater},
title = {The algorithmic complexity of signed domination in graphs},
journal = {Australas. {J} Comb.},
volume = {12},
pages = {101--112},
year = {1995},
url = {http://ajc.maths.uq.edu.au/pdf/12/ocr-ajc-v12-p101.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghHS95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/HattinghHS94,
author = {Johannes H. Hattingh and
Michael A. Henning and
Peter J. Slater},
title = {Three-valued k-neighborhood domination in graphs},
journal = {Australas. {J} Comb.},
volume = {9},
pages = {233--242},
year = {1994},
url = {http://ajc.maths.uq.edu.au/pdf/9/ocr-ajc-v9-p233.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/HattinghHS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GrinsteadS94,
author = {Dana L. Grinstead and
Peter J. Slater},
title = {A Recurrence Template for Several Parameters in Series-parallel Graphs},
journal = {Discret. Appl. Math.},
volume = {54},
number = {2-3},
pages = {151--168},
year = {1994},
url = {https://doi.org/10.1016/0166-218X(94)90020-5},
doi = {10.1016/0166-218X(94)90020-5},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GrinsteadS94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/SiegristAS93,
author = {Kyle Siegrist and
Ashok T. Amin and
Peter J. Slater},
title = {The Optimal Unicyclic Graphs for Pair-Connected Reliability},
journal = {Discret. Appl. Math.},
volume = {41},
number = {3},
pages = {235--243},
year = {1993},
url = {https://doi.org/10.1016/0166-218X(90)90057-J},
doi = {10.1016/0166-218X(90)90057-J},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/SiegristAS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/GrinsteadSSH93,
author = {Dana L. Grinstead and
Peter J. Slater and
Naveed A. Sherwani and
Nancy D. Holmes},
title = {Efficient Edge Domination Problems in Graphs},
journal = {Inf. Process. Lett.},
volume = {48},
number = {5},
pages = {221--228},
year = {1993},
url = {https://doi.org/10.1016/0020-0190(93)90084-M},
doi = {10.1016/0020-0190(93)90084-M},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/GrinsteadSSH93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AminSS93,
author = {Ashok T. Amin and
Kyle Siegrist and
Peter J. Slater},
title = {On uniformly optimally reliable graphs for pair-connected reliability
with vertex failures},
journal = {Networks},
volume = {23},
number = {3},
pages = {185--193},
year = {1993},
url = {https://doi.org/10.1002/net.3230230306},
doi = {10.1002/NET.3230230306},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AminSS93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GibbsS91,
author = {Richard A. Gibbs and
Peter J. Slater},
title = {Distinct distance sets in a graph},
journal = {Discret. Math.},
volume = {93},
number = {2-3},
pages = {155--165},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90251-V},
doi = {10.1016/0012-365X(91)90251-V},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GibbsS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/AminSS91,
author = {Ashok T. Amin and
Kyle Siegrist and
Peter J. Slater},
title = {On the nonexistence of uniformly optimal graphs for pair-connected
reliability},
journal = {Networks},
volume = {21},
number = {3},
pages = {359--368},
year = {1991},
url = {https://doi.org/10.1002/net.3230210307},
doi = {10.1002/NET.3230210307},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/AminSS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/GrinsteadS90,
author = {Dana L. Grinstead and
Peter J. Slater},
title = {On minimum dominating sets with minimum intersection},
journal = {Discret. Math.},
volume = {86},
number = {1-3},
pages = {239--254},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90364-N},
doi = {10.1016/0012-365X(90)90364-N},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/GrinsteadS90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DowRS87,
author = {Stephen J. Dow and
Douglas F. Rall and
Peter J. Slater},
title = {Convex labelings of trees},
journal = {J. Graph Theory},
volume = {11},
number = {1},
pages = {59--70},
year = {1987},
url = {https://doi.org/10.1002/jgt.3190110110},
doi = {10.1002/JGT.3190110110},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DowRS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Slater87,
author = {Peter J. Slater},
title = {Domination and location in acyclic graphs},
journal = {Networks},
volume = {17},
number = {1},
pages = {55--64},
year = {1987},
url = {https://doi.org/10.1002/net.3230170105},
doi = {10.1002/NET.3230170105},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Slater87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Slater86,
author = {Peter J. Slater},
title = {On k-graceful, countably infinite graphs},
journal = {Discret. Math.},
volume = {61},
number = {2-3},
pages = {293--303},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90100-7},
doi = {10.1016/0012-365X(86)90100-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Slater86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/HararyS86,
author = {Frank Harary and
Peter J. Slater},
title = {A Linear Algorithm for the Cutting Center of a Tree},
journal = {Inf. Process. Lett.},
volume = {23},
number = {6},
pages = {317--319},
year = {1986},
url = {https://doi.org/10.1016/0020-0190(86)90093-1},
doi = {10.1016/0020-0190(86)90093-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/HararyS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PeyratRS86,
author = {Claudine Peyrat and
Douglas F. Rall and
Peter J. Slater},
title = {On iterated clique graphs with increasing diameters},
journal = {J. Graph Theory},
volume = {10},
number = {2},
pages = {167--171},
year = {1986},
url = {https://doi.org/10.1002/jgt.3190100204},
doi = {10.1002/JGT.3190100204},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/PeyratRS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BangeBS85,
author = {David W. Bange and
Anthony E. Barkauskas and
Peter J. Slater},
title = {A note on similar edges and edge-unique line graphs},
journal = {J. Comb. Theory {B}},
volume = {38},
number = {1},
pages = {31--40},
year = {1985},
url = {https://doi.org/10.1016/0095-8956(85)90090-5},
doi = {10.1016/0095-8956(85)90090-5},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BangeBS85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SlaterTY85,
author = {Peter J. Slater and
S. K. Teo and
H. P. Yap},
title = {Packing a tree with a graph of the same size},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {213--216},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090203},
doi = {10.1002/JGT.3190090203},
timestamp = {Mon, 29 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SlaterTY85.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/jct/Slater83,
author = {Peter J. Slater},
title = {On \emph{k}-graceful, locally finite graphs},
journal = {J. Comb. Theory {B}},
volume = {35},
number = {3},
pages = {319--322},
year = {1983},
url = {https://doi.org/10.1016/0095-8956(83)90058-8},
doi = {10.1016/0095-8956(83)90058-8},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Slater83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/Slater82,
author = {Peter J. Slater},
title = {A Linear Algorithm for the Number of Degree Constrained Subforests
of a Tree},
journal = {Inf. Process. Lett.},
volume = {15},
number = {4},
pages = {186--188},
year = {1982},
url = {https://doi.org/10.1016/0020-0190(82)90103-X},
doi = {10.1016/0020-0190(82)90103-X},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/Slater82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Slater82,
author = {Peter J. Slater},
title = {Counterexamples to randi{\'{c}}'s conjecture on distance degree
sequences for trees},
journal = {J. Graph Theory},
volume = {6},
number = {1},
pages = {89--92},
year = {1982},
url = {https://doi.org/10.1002/jgt.3190060111},
doi = {10.1002/JGT.3190060111},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Slater82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Slater81,
author = {Peter J. Slater},
title = {Accretion centers: {A} generalization of branch weight centroids},
journal = {Discret. Appl. Math.},
volume = {3},
number = {3},
pages = {187--192},
year = {1981},
url = {https://doi.org/10.1016/0166-218X(81)90015-9},
doi = {10.1016/0166-218X(81)90015-9},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Slater81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Slater81,
author = {Peter J. Slater},
title = {On k-sequential and other numbered graphs},
journal = {Discret. Math.},
volume = {34},
number = {2},
pages = {185--193},
year = {1981},
url = {https://doi.org/10.1016/0012-365X(81)90066-2},
doi = {10.1016/0012-365X(81)90066-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Slater81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/Slater81,
author = {Peter J. Slater},
title = {On Locating a Facility to Service Areas within a Network},
journal = {Oper. Res.},
volume = {29},
number = {3},
pages = {523--531},
year = {1981},
url = {https://doi.org/10.1287/opre.29.3.523},
doi = {10.1287/OPRE.29.3.523},
timestamp = {Tue, 31 Mar 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ior/Slater81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BuckleyMS81,
author = {Fred Buckley and
Zevi Miller and
Peter J. Slater},
title = {On graphs containing a given graph as center},
journal = {J. Graph Theory},
volume = {5},
number = {4},
pages = {427--434},
year = {1981},
url = {https://doi.org/10.1002/jgt.3190050413},
doi = {10.1002/JGT.3190050413},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BuckleyMS81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/Slater81,
author = {Peter J. Slater},
title = {The \emph{k}-nucleus of a graph},
journal = {Networks},
volume = {11},
number = {3},
pages = {233--242},
year = {1981},
url = {https://doi.org/10.1002/net.3230110302},
doi = {10.1002/NET.3230110302},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/Slater81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/SlaterCH81,
author = {Peter J. Slater and
Ernest J. Cockayne and
Stephen T. Hedetniemi},
title = {Information Dissemination in Trees},
journal = {{SIAM} J. Comput.},
volume = {10},
number = {4},
pages = {692--701},
year = {1981},
url = {https://doi.org/10.1137/0210052},
doi = {10.1137/0210052},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/SlaterCH81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/MorganS80,
author = {Christine A. Morgan and
Peter J. Slater},
title = {A Linear Algorithm for a Core of a Tree},
journal = {J. Algorithms},
volume = {1},
number = {3},
pages = {247--258},
year = {1980},
url = {https://doi.org/10.1016/0196-6774(80)90012-7},
doi = {10.1016/0196-6774(80)90012-7},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/MorganS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BangeBS80,
author = {David W. Bange and
Anthony E. Barkauskas and
Peter J. Slater},
title = {Conservative graphs},
journal = {J. Graph Theory},
volume = {4},
number = {1},
pages = {81--91},
year = {1980},
url = {https://doi.org/10.1002/jgt.3190040109},
doi = {10.1002/JGT.3190040109},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BangeBS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Slater80,
author = {Peter J. Slater},
title = {Medians of arbitrary graphs},
journal = {J. Graph Theory},
volume = {4},
number = {4},
pages = {389--392},
year = {1980},
url = {https://doi.org/10.1002/jgt.3190040408},
doi = {10.1002/JGT.3190040408},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Slater80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Slater79,
author = {Peter J. Slater},
title = {Path coverings of the vertices of a tree},
journal = {Discret. Math.},
volume = {25},
number = {1},
pages = {65--74},
year = {1979},
url = {https://doi.org/10.1016/0012-365X(79)90153-5},
doi = {10.1016/0012-365X(79)90153-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Slater79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/CockayneHS79,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Matchings and transversals in hypergraphs, domination and independence-in
trees},
journal = {J. Comb. Theory {B}},
volume = {26},
number = {1},
pages = {78--80},
year = {1979},
url = {https://doi.org/10.1016/0095-8956(79)90044-3},
doi = {10.1016/0095-8956(79)90044-3},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/CockayneHS79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MaurerS78,
author = {Stephen B. Maurer and
Peter J. Slater},
title = {On k-minimally n-edge-connected graphs},
journal = {Discret. Math.},
volume = {24},
number = {2},
pages = {185--195},
year = {1978},
url = {https://doi.org/10.1016/0012-365X(78)90198-X},
doi = {10.1016/0012-365X(78)90198-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MaurerS78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Slater78a,
author = {Peter J. Slater},
title = {Soldering and point splitting},
journal = {J. Comb. Theory {B}},
volume = {24},
number = {3},
pages = {338--343},
year = {1978},
url = {https://doi.org/10.1016/0095-8956(78)90053-9},
doi = {10.1016/0095-8956(78)90053-9},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Slater78a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Slater78,
author = {Peter J. Slater},
title = {A constructive characterization of trees with at least k disjoint
maximum matchings},
journal = {J. Comb. Theory {B}},
volume = {25},
number = {3},
pages = {326--338},
year = {1978},
url = {https://doi.org/10.1016/0095-8956(78)90009-6},
doi = {10.1016/0095-8956(78)90009-6},
timestamp = {Fri, 07 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Slater78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Slater78,
author = {Peter J. Slater},
title = {Centers to centroids in graphs},
journal = {J. Graph Theory},
volume = {2},
number = {3},
pages = {209--222},
year = {1978},
url = {https://doi.org/10.1002/jgt.3190020304},
doi = {10.1002/JGT.3190020304},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Slater78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/MaurerS77,
author = {Stephen B. Maurer and
Peter J. Slater},
title = {On k-critical, n-connected graphs},
journal = {Discret. Math.},
volume = {20},
pages = {255--262},
year = {1977},
url = {https://doi.org/10.1016/0012-365X(77)90065-6},
doi = {10.1016/0012-365X(77)90065-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/MaurerS77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Slater76,
author = {Peter J. Slater},
title = {R-Domination in Graphs},
journal = {J. {ACM}},
volume = {23},
number = {3},
pages = {446--450},
year = {1976},
url = {https://doi.org/10.1145/321958.321964},
doi = {10.1145/321958.321964},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Slater76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/SlaterGH76,
author = {Peter J. Slater and
Seymour E. Goodman and
Stephen T. Hedetniemi},
title = {On the optional hamiltonian completion problem},
journal = {Networks},
volume = {6},
number = {1},
pages = {35--51},
year = {1976},
url = {https://doi.org/10.1002/net.3230060104},
doi = {10.1002/NET.3230060104},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/networks/SlaterGH76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/GoodmanHS75,
author = {Seymour E. Goodman and
Stephen T. Hedetniemi and
Peter J. Slater},
title = {Advances on the Hamiltonian Completion Problem},
journal = {J. {ACM}},
volume = {22},
number = {3},
pages = {352--360},
year = {1975},
url = {https://doi.org/10.1145/321892.321897},
doi = {10.1145/321892.321897},
timestamp = {Tue, 22 Feb 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/GoodmanHS75.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.
last updated on 2024-06-10 20:30 CEST 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:
