default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWayne Goddard
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j103]Geoffrey Boyer, Wayne Goddard, Michael A. Henning
:
Domination parameters and the removal of matchings. Appl. Math. Comput. 476: 128752 (2024)- [j102]Wayne Goddard, Julia VanLandingham:
The fully weighted toughness of a graph. Discret. Appl. Math. 343: 82-90 (2024) - [j101]Geoffrey Boyer, Wayne Goddard:
Disjoint isolating sets and graphs with maximum isolation number. Discret. Appl. Math. 356: 110-116 (2024) - [j100]Wayne Goddard, Michael A. Henning:
The packing number of cubic graphs. Discret. Optim. 53: 100850 (2024) - [j99]Wayne Goddard, Julia VanLandingham:
On the Extremal Values of the Weighted Integrity of a Graph. J. Interconnect. Networks 24(3): 2350019:1-2350019:8 (2024) - 2023
- [j98]Wayne Goddard, Michael A. Henning:
Independent domination in outerplanar graphs. Discret. Appl. Math. 325: 52-57 (2023) - [j97]Wayne Goddard, Michael A. Henning:
Graphs with Unique Minimum Specified Domination Sets. Graphs Comb. 39(5): 103 (2023) - 2022
- [j96]Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue:
Compelling colorings: A generalization of the dominator chromatic number. Appl. Math. Comput. 428: 127193 (2022) - [j95]Wayne Goddard, Michael A. Henning:
Domination and dominator colorings in planar graphs with small diameter. Discret. Appl. Math. 313: 80-92 (2022) - [j94]Wayne Goddard, Kirsti Kuenzel, Eileen Melville:
Well-hued graphs. Discret. Appl. Math. 320: 370-380 (2022) - [j93]Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann:
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43(3): 543-570 (2022) - 2020
- [j92]Wayne Goddard, Michael A. Henning:
Independent domination, colorings and the fractional idomatic number of a graph. Appl. Math. Comput. 382: 125340 (2020) - [j91]Anna Bachstein, Wayne Goddard, Connor Lehmacher:
The generalized matcher game. Discret. Appl. Math. 284: 444-453 (2020)
2010 – 2019
- 2019
- [j90]Wayne Goddard, Robert Melville, Honghai Xu:
Almost injective colorings. Discuss. Math. Graph Theory 39(1): 225-239 (2019) - 2018
- [j89]Wayne Goddard, Michael A. Henning:
The matcher game played in graphs. Discret. Appl. Math. 237: 82-88 (2018) - [j88]Wayne Goddard, Michael A. Henning:
A note on domination and total domination in prisms. J. Comb. Optim. 35(1): 14-20 (2018) - [j87]Wayne Goddard, Robert Melville:
Properly colored trails, paths, and bridges. J. Comb. Optim. 35(2): 463-472 (2018) - [j86]Wayne Goddard, Michael A. Henning:
Thoroughly dispersed colorings. J. Graph Theory 88(1): 174-191 (2018) - 2017
- [j85]Robert Melville, Wayne Goddard:
Coloring Graphs to Produce Properly Colored Walks. Graphs Comb. 33(5): 1271-1281 (2017) - 2016
- [j84]Wayne Goddard, Honghai Xu:
Vertex colorings without rainbow subgraphs. Discuss. Math. Graph Theory 36(4): 989-1005 (2016) - [j83]Wayne Goddard, Honghai Xu:
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs. J. Graph Theory 81(2): 146-153 (2016) - 2015
- [j82]Wayne Goddard, Kirsti Wash, Honghai Xu:
WORM colorings. Discuss. Math. Graph Theory 35(3): 571-584 (2015) - 2014
- [j81]Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58: 376- (2014) - [j80]Wayne Goddard, Honghai Xu:
A note on S-packing colorings of lattices. Discret. Appl. Math. 166: 255-262 (2014) - 2013
- [j79]Wayne Goddard, Michael A. Henning:
Independent domination in graphs: A survey and recent results. Discret. Math. 313(7): 839-854 (2013) - [j78]Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki:
An efficient algorithm for stopping on a sink in a directed graph. Oper. Res. Lett. 41(3): 238-240 (2013) - [c16]Wayne Goddard, Pradip K. Srimani:
Daemon Conversions in Distributed Self-stabilizing Algorithms. WALCOM 2013: 146-157 - 2012
- [j77]Wayne Goddard, Honghai Xu:
The S-packing chromatic number of a graph. Discuss. Math. Graph Theory 32(4): 795-806 (2012) - [j76]Wayne Goddard, Pradip K. Srimani:
Self-Stabilizing Master-Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size. Int. J. Found. Comput. Sci. 23(4): 763-778 (2012) - [j75]Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart:
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112(24): 944-947 (2012) - [j74]Wayne Goddard, Jeremy Lyle:
Independent dominating sets in triangle-free graphs. J. Comb. Optim. 23(1): 9-20 (2012) - [j73]Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. J. Graph Theory 69(1): 46-76 (2012) - 2011
- [j72]Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan:
Bounds on the k-domination number of a graph. Appl. Math. Lett. 24(6): 996-998 (2011) - [j71]Wayne Goddard, Jeremy Lyle:
Dense graphs with small clique number. J. Graph Theory 66(4): 319-331 (2011) - [c15]Wayne Goddard, Pradip K. Srimani:
Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size. IPDPS Workshops 2011: 618-625 - [p1]Wayne Goddard, Ortrud R. Oellermann:
Distance in Graphs. Structural Analysis of Complex Networks 2011: 49-72 - 2010
- [j70]Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae:
Capacitated Domination. Ars Comb. 96 (2010) - [c14]Wayne Goddard, Pradip K. Srimani:
Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size. IPDPS Workshops 2010: 1-8
2000 – 2009
- 2009
- [j69]Jeremy Lyle, Wayne Goddard:
The binding number of a graph and its cliques. Discret. Appl. Math. 157(15): 3336-3340 (2009) - [j68]Wayne Goddard, Michael A. Henning:
A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. Graphs Comb. 25(5): 675-692 (2009) - [j67]Wayne Goddard, Stephen T. Hedetniemi:
A note on trees, tables, and algorithms. Networks 53(2): 184-190 (2009) - 2008
- [j66]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall:
Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008) - [j65]Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki:
On domination and reinforcement numbers in trees. Discret. Math. 308(7): 1165-1175 (2008) - [j64]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu:
Self-Stabilizing Graph Protocols. Parallel Process. Lett. 18(1): 189-199 (2008) - [j63]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399(1-2): 118-127 (2008) - [c13]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN 2008: 182-190 - 2007
- [j62]Wayne Goddard, Kiran Kanakadandi:
Orientation distance graphs revisited. Discuss. Math. Graph Theory 27(1): 125-136 (2007) - [j61]Wayne Goddard, Michael A. Henning:
Restricted domination parameters in graphs. J. Comb. Optim. 13(4): 353-363 (2007) - 2006
- [j60]Michael Dorfling, Wayne Goddard, Michael A. Henning:
Domination in Planar Graphs with Small Diameter II. Ars Comb. 78 (2006) - [j59]Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar:
Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. 306(18): 2229-2233 (2006) - [j58]Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt:
Construction of trees and graphs with equal domination parameters. Discret. Math. 306(21): 2647-2654 (2006) - [c12]Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi:
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA 2006: 797-803 - [c11]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan:
Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356 - 2005
- [j57]Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar:
Generalized subgraph-restricted matchings in graphs. Discret. Math. 293(1-3): 129-138 (2005) - [j56]Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning:
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discret. Math. 300(1-3): 82-90 (2005) - [j55]Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae:
An algorithm for partial Grundy number on trees. Discret. Math. 304(1-3): 108-116 (2005) - [j54]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks 1(3&4): 329-344 (2005) - [j53]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. 16(1): 19-36 (2005) - [j52]Wayne Goddard, Michael A. Henning:
Multiple vertex coverings by cliques. J. Graph Theory 48(2): 157-167 (2005) - 2004
- [j51]Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart:
Maximum sizes of graphs with given domination parameters. Discret. Math. 281(1-3): 137-148 (2004) - [j50]Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe:
The diameter of total domination vertex critical graphs. Discret. Math. 286(3): 255-261 (2004) - [j49]Wayne Goddard, Teresa W. Haynes, Debra J. Knisley:
Hereditary domination and independence parameters . Discuss. Math. Graph Theory 24(2): 239-248 (2004) - [j48]Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs:
Offensive alliances in graphs. Discuss. Math. Graph Theory 24(2): 263-175 (2004) - [j47]Wayne Goddard:
Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. Graphs Comb. 20(4): 467-483 (2004) - [j46]Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi:
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Inf. Process. Lett. 91(2): 77-83 (2004) - [j45]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs:
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. 14(1): 75-82 (2004) - [j44]Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae:
Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14(3-4): 387-398 (2004) - [c10]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004 - 2003
- [j43]Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart:
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131(1): 151-167 (2003) - [j42]Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt:
Changing upper irredundance by edge addition. Discret. Math. 266(1-3): 185-193 (2003) - [j41]Wayne Goddard, Michael A. Henning:
Nordhaus-Gaddum bounds for independent domination. Discret. Math. 268(1-3): 299-302 (2003) - [j40]Wayne Goddard, Michael Edwin Raines, Peter J. Slater:
Distance and connectivity measures in permutation graphs. Discret. Math. 271(1-3): 61-70 (2003) - [j39]Wayne Goddard:
A computer / human mastermind player using grids. South Afr. Comput. J. 30: 3-8 (2003) - [c9]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC 2003: 66-73 - [c8]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops 2003: 461-465 - [c7]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. IPDPS 2003: 162 - [c6]Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani:
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. IPDPS 2003: 240 - [c5]Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani:
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC 2003: 26-32 - 2002
- [j38]Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart:
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116(1-2): 145-159 (2002) - [j37]Wayne Goddard:
4-connected maximal planar graphs are 4-ordered. Discret. Math. 257(2-3): 405-410 (2002) - [j36]Wayne Goddard, Michael A. Henning:
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electron. Notes Discret. Math. 11: 338-348 (2002) - [j35]Wayne Goddard, Michael A. Henning:
Domination in planar graphs with small diameter. J. Graph Theory 40(1): 1-25 (2002) - [j34]Mieso K. Denko, Wayne Goddard:
Limited flooding protocol for mobile ad hoc networks. South Afr. Comput. J. 29: 49-57 (2002) - 2001
- [j33]David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Multipartite Ramsey Numbers. Ars Comb. 58 (2001) - [j32]Wayne Goddard, Michael A. Henning:
Pancyclicity of the prism. Discret. Math. 234(1-3): 139-142 (2001) - [j31]Peter Dankelmann, Wayne Goddard, Peter J. Slater:
Average distance in colored graphs. J. Graph Theory 38(1): 1-17 (2001) - 2000
- [j30]Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann:
Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219(1-3): 85-95 (2000)
1990 – 1999
- 1999
- [j29]Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart:
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999) - [j28]Wayne Goddard, Michael A. Henning:
Real and integer domination in graphs. Discret. Math. 199(1-3): 61-75 (1999) - [j27]Wayne Goddard, Michael A. Henning, Hiren Maharaj:
Homogeneous Embeddings of Cycles in Graphs. Graphs Comb. 15(2): 159-173 (1999) - [j26]Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart:
Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999) - 1998
- [j25]Stephan Brandt, Ralph J. Faudree, Wayne Goddard:
Weakly pancyclic graphs. J. Graph Theory 27(3): 141-176 (1998) - 1997
- [j24]Lowell W. Beineke, Wayne Goddard, Marc J. Lipman:
Graphs with Maximum Edge-Integrity. Ars Comb. 46 (1997) - [j23]Wayne Goddard, Michael D. Plummer, Henda C. Swart:
Maximum and minimum toughness of graphs of small genus. Discret. Math. 167-168: 329-339 (1997) - [j22]Roger C. Entringer, Wayne Goddard, Michael A. Henning:
A note on cliques and independent sets. J. Graph Theory 24(1): 21-23 (1997) - [j21]Lenore Cowen, Wayne Goddard, C. Esther Jesurum:
Defective coloring revisited. J. Graph Theory 24(3): 205-219 (1997) - [c4]Lenore Cowen, Wayne Goddard, C. Esther Jesurum:
Coloring with Defect. SODA 1997: 548-557 - 1996
- [j20]Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning:
The Algorithmic Complexity of Minus Domination in Graphs. Discret. Appl. Math. 68(1-2): 73-84 (1996) - [j19]Wayne Goddard, Henda C. Swart:
Distances between graphs under edge operations. Discret. Math. 161(1-3): 121-132 (1996) - [j18]Wayne Goddard, Meir Katchalski, Daniel J. Kleitman:
Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17(4): 391-395 (1996) - [j17]Wayne Goddard:
The toughness of cubic graphs. Graphs Comb. 12(1): 17-22 (1996) - [j16]Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen:
Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory A 74(2): 173-187 (1996) - 1995
- [j15]Wayne Goddard:
Mistilings with dominoes. Discret. Math. 137(1-3): 361-365 (1995) - 1994
- [j14]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. Comb. 14(2): 127-134 (1994) - [j13]Lowell W. Beineke, Peter Hamburger, Wayne Goddard:
Random packings of graphs. Discret. Math. 125(1-3): 45-54 (1994) - [j12]Wayne Goddard, Daniel J. Kleitman:
An upper bound for the Ramsey numbers r(K3, G). Discret. Math. 125(1-3): 177-182 (1994) - [j11]Wayne Goddard, Ortrud R. Oellermann, Henda C. Swart:
Steiner distance stable graphs. Discret. Math. 132(1-3): 65-73 (1994) - [j10]Wayne Goddard:
Measures of vulnerability-the integrity family. Networks 24(4): 207-213 (1994) - [j9]Fan R. K. Chung, Wayne Goddard, Daniel J. Kleitman:
Even Cycles in Directed Graphs. SIAM J. Discret. Math. 7(3): 474-483 (1994) - 1993
- [j8]Gary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart:
Principal Common Divisors of Graphs. Eur. J. Comb. 14(2): 85-93 (1993) - [j7]Wayne Goddard, Daniel J. Kleitman:
A note on maximal triangle-free graphs. J. Graph Theory 17(5): 629-631 (1993) - [j6]Wayne Goddard, Claire Kenyon, Valerie King, Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. SIAM J. Comput. 22(2): 272-283 (1993) - [c3]Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki, Fred R. McMorris:
Agreement Subtrees, Metric and Consensus for Labeled Binary Trees. Partitioning Data Sets 1993: 97-104 - 1992
- [j5]Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert:
A Survey of Integrity. Discret. Appl. Math. 37/38: 13-28 (1992) - [j4]Wayne Goddard, Michael A. Henning, Henda C. Swart:
Some nordhaus- gaddum-type results. J. Graph Theory 16(3): 221-231 (1992) - 1991
- [j3]Wayne Goddard:
Acyclic colorings of planar graphs. Discret. Math. 91(1): 91-94 (1991) - [j2]Binghuan Zhu, Wayne Goddard:
An Algorithm for Outerplanar Graphs with Parameter. J. Algorithms 12(4): 657-662 (1991) - [j1]Wayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian:
On multipartite tournaments. J. Comb. Theory B 52(2): 284-300 (1991) - [c2]Boris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman:
Crossing Families. SCG 1991: 351-356 - 1990
- [c1]Wayne Goddard, Valerie King, Leonard J. Schulman:
Optimal Randomized Algorithms for Local Sorting and Set-Maxima. STOC 1990: 45-53
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 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:
