Dana S. Richards

Publication Activity (10 Years)

Years Active: 1979-2022
Publications (10 Years): 7

Top Topics

Maximum Cardinality

Graph Theoretic

Routing Problem

Top Venues

J. Comb. Optim.

Publications

Ivan Avramovic, Dana S. Richards
Analysis of consensus sorting via the cycle metric. J. Comb. Optim. 44 (3) (2022)
Ivan Avramovic, Dana S. Richards
Analysis of Consensus Sorting via the Cycle Metric. COCOA (2018)
Raimi A. Rufai, Dana S. Richards
A Simple Convex Layers Algorithm. CoRR (2017)
Indranil Banerjee, Dana S. Richards
New Results On Routing Via Matchings On Graphs. CoRR (2017)
Indranil Banerjee, Dana S. Richards
Routing and Sorting Via Matchings On Graphs. CoRR (2016)
Indranil Banerjee, Dana S. Richards
Sorting Under Forbidden Comparisons. SWAT (2016)
Indranil Banerjee, Dana S. Richards
Routing Number Of A Pyramid. CoRR (2016)
Arthur L. Liestman, Dana S. Richards, Ladislav Stacho
Broadcasting from multiple originators. Discret. Appl. Math. 157 (13) (2009)
Dana S. Richards, Jeffrey S. Salowe
Mixed Spanning Trees in Theory and Practice. Int. J. Comput. Geom. Appl. 9 (3) (1999)
Dana S. Richards, Arthur L. Liestman
Degree-Constrained Pyramid Spanners. J. Parallel Distributed Comput. 25 (1) (1995)
Louis Ibarra, Dana S. Richards
Tree Open Ear Decomposition in Parallel Graph Algorithms. Parallel Process. Lett. 5 (1995)
Luisa Gargano, Arthur L. Liestman, Joseph G. Peters, Dana S. Richards
Reliable broadcasting. Discret. Appl. Math. 53 (1-3) (1994)
Louis Ibarra, Dana S. Richards
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. MFCS (1993)
Arthur L. Liestman, Dana S. Richards
An Introduction to Perpetual Gossiping. ISAAC (1993)
Jeffrey S. Salowe, Dana S. Richards, Dallas E. Wrege
Mixed spanning trees: a technique for performance-driven routing. Great Lakes Symposium on VLSI (1993)
Louis Ibarra, Dana S. Richards
Efficient Parallel Graph Algorithms Based on Open Ear Decomposition. Parallel Comput. 19 (8) (1993)
Arthur L. Liestman, Dana S. Richards
Network Communication in Edge-Colored Graphs: Gossiping. IEEE Trans. Parallel Distributed Syst. 4 (4) (1993)
Arthur L. Liestman, Dana S. Richards
Perpetual Gossiping. Parallel Process. Lett. 3 (1993)
Dana S. Richards, Jeffrey S. Salowe
A Linear-Time Algorithm To Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets. Algorithmica 7 (2&3) (1992)
F. K. Hwang, Dana S. Richards
Steiner tree problems. Networks 22 (1) (1992)
Dana S. Richards
Studies of self-organizing placement algorithms for linear and finger lists. Inf. Sci. 63 (1-2) (1992)
Dana S. Richards, Jeffrey S. Salowe
Stacks, Queues, and Deques with Order-Statistic Operations. Acta Informatica 29 (5) (1992)
James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards
Distributed genetic algorithms for the floorplan design problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 10 (4) (1991)
James P. Cohoon, Worthy N. Martin, Dana S. Richards
A Multi-Population Genetic Algorithm for Solving the K-Partition Problem on Hyper-Cubes. ICGA (1991)
Dana S. Richards, Jeffrey S. Salowe
A simple proof of Hwang's theorem for rectilinear Steiner minimal trees. Ann. Oper. Res. 33 (7) (1991)
A. S. Deshpande, Dana S. Richards, William R. Pearson
A platform for biological sequence comparison on parallel computers. Comput. Appl. Biosci. 7 (2) (1991)
Dana S. Richards
VLSI median filters. IEEE Trans. Acoust. Speech Signal Process. 38 (1) (1990)
James P. Cohoon, Worthy N. Martin, Dana S. Richards
Genetic Algorithms and Punctuated Equilibria in VLSI. PPSN (1990)
Dana S. Richards, Jeffrey S. Salowe
A Rectilinear Steiner Minimal Tree Algorithm for Convex Point Sets. SWAT (1990)
James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe
An optimal Steiner tree algorithm for a net whose terminals lie on the perimeter of a rectangle. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 9 (4) (1990)
Charles Swart, Dana S. Richards
On the Inference of Strategies. Theor. Comput. Sci. 67 (1) (1989)
Dana S. Richards
Fast Heuristic Algorithms for Rectilinear Steiner Trees. Algorithmica 4 (2) (1989)
Dana S. Richards, Pravin M. Vaidya
On the Distribution of Comparisons in Sorting Algorithms. BIT 28 (4) (1988)
James P. Cohoon, Dana S. Richards, Jeffrey S. Salowe
A linear-time Steiner tree routing algorithm for terminals on the boundary of a rectangle. ICCAD (1988)
James P. Cohoon, Dana S. Richards
Optimal two-terminal α-β wire routing. Integr. 6 (1) (1988)
James P. Cohoon, Shailesh U. Hegde, Worthy N. Martin, Dana S. Richards
Punctuated Equilibria: A Parallel Genetic Algorithm. ICGA (1987)
Dana S. Richards
Finding Short Cycles in Planar Graphs Using Separators. J. Algorithms 7 (3) (1986)
Dana S. Richards
Data Compression and Gray-Code Sorting. Inf. Process. Lett. 22 (4) (1986)
Arthur L. Liestman, Dana S. Richards
Toward optimal gossiping schemes with conference calls. Discret. Appl. Math. 7 (2) (1984)
Dana S. Richards
On a Theorem of Chorneyko and Mohanty. J. Comb. Theory, Ser. A 27 (3) (1979)