dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Wayne Goddard Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
75Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Jeremy Lyle: Independent dominating sets in triangle-free graphs. J. Comb. Optim. 23(1): 9-20 (2012)
74Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBostjan Bresar, Paul Dorbec, Wayne Goddard, Bert Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall: Vizing's conjecture: a survey and recent results. Journal of Graph Theory 69(1): 46-76 (2012)
2011
73Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
72Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErmelinda 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)
71Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Jeremy Lyle: Dense graphs with small clique number. Journal of Graph Theory 66(4): 319-331 (2011)
2010
70Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
2009
69Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeremy Lyle, Wayne Goddard: The binding number of a graph and its cliques. Discrete Applied Mathematics 157(15): 3336-3340 (2009)
68Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. Graphs and Combinatorics 25(5): 675-692 (2009)
67Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Stephen T. Hedetniemi: A note on trees, tables, and algorithms. Networks 53(2): 184-190 (2009)
2008
66Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
65no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall: Braodcast Chromatic Numbers of Graphs. Ars Comb. 86: (2008)
64Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steve Horton, Patrick Jones, Grzegorz Kubicki: On domination and reinforcement numbers in trees. Discrete Mathematics 308(7): 1165-1175 (2008)
63Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu: Self-Stabilizing Graph Protocols. Parallel Processing Letters 18(1): 189-199 (2008)
62Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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)
2007
61Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Kiran Kanakadandi: Orientation distance graphs revisited. Discussiones Mathematicae Graph Theory 27(1): 125-136 (2007)
60Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: Restricted domination parameters in graphs. J. Comb. Optim. 13(4): 353-363 (2007)
2006
59no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi: An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA 2006: 797-803
58Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan: Distance-k Information in Self-stabilizing Algorithms. SIROCCO 2006: 349-356
57no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Dorfling, Wayne Goddard, Michael A. Henning: Domination in Planar Graphs with Small Diameter II. Ars Comb. 78: (2006)
56Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Michael A. Henning, Wayne Goddard, Renu Laskar: Simultaneous graph parameters: Factor domination and factor total domination. Discrete Mathematics 306(18): 2229-2233 (2006)
55Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt: Construction of trees and graphs with equal domination parameters. Discrete Mathematics 306(21): 2647-2654 (2006)
2005
54Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar: Generalized subgraph-restricted matchings in graphs. Discrete Mathematics 293(1-3): 129-138 (2005)
53Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMichael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning: Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Mathematics 300(1-3): 82-90 (2005)
52Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu Laskar, Alice A. McRae: An algorithm for partial Grundy number on trees. Discrete Mathematics 304(1-3): 108-116 (2005)
51Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. IJDSN 1(3&4): 329-344 (2005)
50Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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)
49Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: Multiple vertex coverings by cliques. Journal of Graph Theory 48(2): 157-167 (2005)
2004
48Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani: Fault Tolerant Algorithms for Orderings and Colorings. IPDPS 2004
47Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart: Maximum sizes of graphs with given domination parameters. Discrete Mathematics 281(1-3): 137-148 (2004)
46Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe: The diameter of total domination vertex critical graphs. Discrete Mathematics 286(3): 255-261 (2004)
45Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard: Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. Graphs and Combinatorics 20(4): 467-483 (2004)
44Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZhengnan 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)
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs: Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Processing Letters 14(1): 75-82 (2004)
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae: Distance-two information in self-stabilizing algorithms. Parallel Processing Letters 14(3-4): 387-398 (2004)
2003
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLZhenyu 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
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLElias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart: MAD trees and distance-hereditary graphs. Discrete Applied Mathematics 131(1): 151-167 (2003)
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLErnest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt: Changing upper irredundance by edge addition. Discrete Mathematics 266(1-3): 185-193 (2003)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: Nordhaus-Gaddum bounds for independent domination. Discrete Mathematics 268(1-3): 299-302 (2003)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael Edwin Raines, Peter J. Slater: Distance and connectivity measures in permutation graphs. Discrete Mathematics 271(1-3): 61-70 (2003)
2002
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart: Augmenting trees so that every three vertices lie on a cycle. Discrete Applied Mathematics 116(1-2): 145-159 (2002)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard: 4-connected maximal planar graphs are 4-ordered. Discrete Mathematics 257(2-3): 405-410 (2002)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electronic Notes in Discrete Mathematics 11: 338-348 (2002)
2001
29no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLDavid P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart: Multipartite Ramsey Numbers. Ars Comb. 58: (2001)
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: Pancyclicity of the prism. Discrete Mathematics 234(1-3): 139-142 (2001)
2000
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning, Ortrud R. Oellermann: Bipartite Ramsey numbers and Zarankiewicz numbers. Discrete Mathematics 219(1-3): 85-95 (2000)
1999
26no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart: Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54: (1999)
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning: Real and integer domination in graphs. Discrete Mathematics 199(1-3): 61-75 (1999)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael A. Henning, Hiren Maharaj: Homogeneous Embeddings of Cycles in Graphs. Graphs and Combinatorics 15(2): 159-173 (1999)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart: Generalized eccentricity, radius, and diameter in graphs. Networks 34(4): 312-319 (1999)
1997
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLenore Cowen, Wayne Goddard, C. E. Jesurum: Coloring with Defect. SODA 1997: 548-557
21no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLowell W. Beineke, Wayne Goddard, Marc J. Lipman: Graphs with Maximum Edge-Integrity. Ars Comb. 46: (1997)
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Michael D. Plummer, Henda C. Swart: Maximum and minimum toughness of graphs of small genus. Discrete Mathematics 167-168: 329-339 (1997)
1996
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning: The Algorithmic Complexity of Minus Domination in Graphs. Discrete Applied Mathematics 68(1-2): 73-84 (1996)
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Henda C. Swart: Distances between graphs under edge operations. Discrete Mathematics 161(1-3): 121-132 (1996)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Meir Katchalski, Daniel J. Kleitman: Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17(4): 391-395 (1996)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard: The toughness of cubic graphs. Graphs and Combinatorics 12(1): 17-22 (1996)
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLIra M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen: Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory, Ser. A 74(2): 173-187 (1996)
1995
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard: Mistilings with dominoes. Discrete Mathematics 137(1-3): 361-365 (1995)
1994
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Combinatorica 14(2): 127-134 (1994)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Daniel J. Kleitman: An upper bound for the Ramsey numbers r(K3, G). Discrete Mathematics 125(1-3): 177-182 (1994)
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLowell W. Beineke, Peter Hamburger, Wayne Goddard: Random packings of graphs. Discrete Mathematics 125(1-3): 45-54 (1994)
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Ortrud R. Oellermann, Henda C. Swart: Steiner distance stable graphs. Discrete Mathematics 132(1-3): 65-73 (1994)
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLFan R. K. Chung, Wayne Goddard, Daniel J. Kleitman: Even Cycles in Directed Graphs. SIAM J. Discrete Math. 7(3): 474-483 (1994)
1993
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLGary Chartrand, Wayne Goddard, Michael A. Henning, Farrokh Saba, Henda C. Swart: Principal Common Divisors of Graphs. Eur. J. Comb. 14(2): 85-93 (1993)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne 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)
1992
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert: A Survey of Integrity. Discrete Applied Mathematics 37/38: 13-28 (1992)
1991
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Aronov, Paul Erdös, Wayne Goddard, Daniel J. Kleitman, Michael Klugerman, János Pach, Leonard J. Schulman: Crossing Families. Symposium on Computational Geometry 1991: 351-356
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard: Acyclic colorings of planar graphs. Discrete Mathematics 91(1): 91-94 (1991)
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBinghuan Zhu, Wayne Goddard: An Algorithm for Outerplanar Graphs with Parameter. J. Algorithms 12(4): 657-662 (1991)
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Grzegorz Kubicki, Ortrud R. Oellermann, Songlin Tian: On multipartite tournaments. J. Comb. Theory, Ser. B 52(2): 284-300 (1991)
1990
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLWayne Goddard, Valerie King, Leonard J. Schulman: Optimal Randomized Algorithms for Local Sorting and Set-Maxima STOC 1990: 45-53

Coauthor Index

1Boris Aronov [5] [13]
2Kunwarjit S. Bagga [6]
3Lowell W. Beineke [6] [11] [21]
4Jean R. S. Blair [64]
5Bostjan Bresar [74]
6Gary Chartrand [8]
7Fan R. K. Chung (Fan Chung Graham) [9]
8Ernest J. Cockayne [35]
9Lenore Cowen (Lenore J. Cowen) [22]
10Elias Dahlhaus [36]
11Peter Dankelmann [23] [32] [36] [47] [56]
12David P. Day [29]
13Ermelinda DeLaViña [72]
14Gayla S. Domke [47]
15Paul Dorbec [74]
16Michael Dorfling [53] [55] [57]
17Jean E. Dunbar [19]
18Paul Erdös [5] [13]
19Odile Favaron [35]
20Martin Gairing [42] [43]
21Ira M. Gessel [15]
22Paul J. P. Grobler [35] [47]
23Peter Hamburger [11]
24John M. Harris [65]
25Bert Hartnell [74]
26Johannes H. Hattingh [47] [53]
27Teresa W. Haynes [46]
28Sandra Mitchell Hedetniemi (Sandra L. Mitchell) [54] [65]
29Stephen T. Hedetniemi [19] [37] [38] [39] [40] [41] [42] [43] [44] [48] [50] [51] [52] [54] [58] [59] [62] [63] [64] [65] [66] [67]
30Michael A. Henning [8] [19] [23] [24] [25] [27] [28] [29] [30] [34] [46] [49] [53] [55] [56] [57] [60] [68] [72] [74]
31Steve Horton [64]
32David Pokrass Jacobs [38] [39] [40] [41] [43] [48] [50] [51] [58] [62] [63] [66]
33C. E. Jesurum [22]
34Patrick Jones [64]
35Kiran Kanakadandi [61]
36Meir Katchalski [17]
37Ken Kennedy [52]
38Valerie King [1] [7]
39Sandi Klavzar [74]
40Daniel J. Kleitman [5] [9] [12] [13] [17]
41Michael Klugerman [5] [13]
42Petter Kristiansen [42]
43Grzegorz Kubicki [2] [64]
44Renu Laskar (Renu C. Laskar) [52] [54] [56]
45Marc J. Lipman [6] [21]
46Jeremy Lyle [69] [71] [75]
47Hiren Maharaj [24]
48Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu) [7]
49Alice A. McRae [19] [42] [52]
50Lucas C. van der Merwe [46]
51Christina M. Mynhardt [35] [55]
52Ortrud R. Oellermann (Ortrud Oellermann) [2] [10] [26] [27] [32]
53János Pach [5] [13]
54Ryan Pepper [72]
55Raymond E. Pippert [6]
56Michael D. Plummer [20]
57Michael Edwin Raines [33]
58Douglas F. Rall [65] [74]
59Farrokh Saba [8]
60Leonard J. Schulman [1] [5] [7] [13]
61Zhengnan Shi [44] [52] [59]
62Walter Shur [15]
63Peter J. Slater [26] [33]
64Pradip K. Srimani [37] [38] [39] [40] [41] [48] [50] [51] [63] [66] [70] [73]
65Henda C. Swart [8] [10] [18] [20] [23] [26] [29] [32] [36] [47]
66Songlin Tian [2]
67Vilmar Trevisan [58] [62]
68Emil R. Vaughan [72]
69Herbert S. Wilf [15]
70Zhenyu Xu [37] [63]
71Lily Yen [15]
72Binghuan Zhu [3]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page