default search action
Charles R. Johnson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j57]Susana Furtado
, Charles R. Johnson:
Efficiency analysis for the Perron vector of a reciprocal matrix. Appl. Math. Comput. 480: 128913 (2024) - [j56]Susana Furtado
Efficient vectors in priority setting methodology. Ann. Oper. Res. 332(1): 743-764 (2024) - [j55]Susana Furtado
Pairwise comparison matrices with uniformly ordered efficient vectors. Int. J. Approx. Reason. 173: 109265 (2024) - [j54]Susana Furtado
Efficient Vectors for Block Perturbed Consistent Matrices. SIAM J. Matrix Anal. Appl. 45(1): 601-618 (2024) - 2022
- [j53]Charles R. Johnson, Tanay V. Wakhare
The inverse eigenvalue problem for linear trees. Discret. Math. 345(4): 112737 (2022) - [j52]Amit Harlev, Charles R. Johnson, Derek Lim
The Doubly Stochastic Single Eigenvalue Problem: A Computational Approach. Exp. Math. 31(3): 936-945 (2022) - 2021
- [j51]Tanay V. Wakhare
Corrigendum to "The proportion of trees that are linear" [Discrete Math. 343 (10) (2020) 112008]. Discret. Math. 344(4): 112284 (2021) - 2020
- [j50]Tanay V. Wakhare
The proportion of trees that are linear. Discret. Math. 343(10): 112008 (2020) - [j49]Charles R. Johnson, Pietro Paparella
Matricial Proofs of Some Classical Results about Critical Point Location. Am. Math. Mon. 127(1): 45-53 (2020)
2010 – 2019
- 2017
- [j48]Charles R. Johnson, António Leal Duarte
Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (parter) eigenvalue. Discret. Appl. Math. 233: 33-51 (2017) - 2016
- [j47]Susana Furtado
Comparison on the spectral radii of weighted digraphs that differ in a certain subdigraph. Electron. Notes Discret. Math. 54: 85-90 (2016) - 2015
- [j46]Miriam Farber, Charles R. Johnson, Leon Zhang:
The Number of Interlacing Equalities Resulting from Removal of a Vertex from a Tree. SIAM J. Discret. Math. 29(3): 1245-1258 (2015) - 2014
- [j45]Charles R. Johnson, Andrew A. Li, Andrew J. Walker:
Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree. Discret. Math. 333: 39-55 (2014) - 2013
- [j44]Miriam Farber, Charles R. Johnson, Wei Zhen:
Eigenvalue Pairing in the Response Matrix for a Class of Network Models with Circular Symmetry. Electron. J. Comb. 20(3): 17 (2013) - [j43]Zachary B. Charles, Miriam Farber, Charles R. Johnson, Lee Kennedy-Shaffer
Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues. Discret. Math. 313(13): 1441-1451 (2013) - [j42]Zachary B. Charles, Miriam Farber, Charles R. Johnson, Lee Kennedy-Shaffer
Nonpositive Eigenvalues of Hollow, Symmetric, Nonnegative Matrices. SIAM J. Matrix Anal. Appl. 34(3): 1384-1400 (2013) - 2012
- [b4]Roger A. Horn, Charles R. Johnson:
Matrix Analysis, 2nd Ed. Cambridge University Press 2012, ISBN 9780521548236 - [j41]Charles R. Johnson, Aneta Sawikowska
Minimizing the least eigenvalue of graphs with fixed order and size. Discret. Math. 312(15): 2272-2285 (2012) - 2011
- [j40]Charles R. Johnson, Paul R. McMichael:
The change in multiplicity of an eigenvalue of a Hermitian matrix associated with the removal of an edge from its graph. Discret. Math. 311(2-3): 166-170 (2011) - 2010
- [j39]Charles R. Johnson, Christopher Jordan-Squire, David A. Sher:
Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree. Discret. Appl. Math. 158(6): 681-691 (2010) - [j38]Charles R. Johnson, S. Nasserasr:
Note: TP2=Bruhat. Discret. Math. 310(10-11): 1627-1628 (2010) - [j37]Charles R. Johnson, Yulin Zhang
On the Possible Ranks among Matrices with a given Pattern. Discret. Math. Algorithms Appl. 2(3): 363-378 (2010)
2000 – 2009
- 2009
- [j36]Charles R. Johnson, Joshua A. Link:
Solution theory for complete bilinear systems of equations. Numer. Linear Algebra Appl. 16(11-12): 929-934 (2009) - [j35]Froilán M. Dopico, Charles R. Johnson:
Parametrization of the Matrix Symplectic Group and Applications. SIAM J. Matrix Anal. Appl. 31(2): 650-673 (2009) - 2008
- [j34]Charles R. Johnson, Joshua A. Link:
The extent to which triangular sub-patterns explain minimum rank. Discret. Appl. Math. 156(10): 1637-1651 (2008) - [j33]Matthew Booth, Philip Hackney
On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph. SIAM J. Matrix Anal. Appl. 30(2): 731-740 (2008) - 2007
- [j32]Charles R. Johnson, Ronald L. Smith:
Path Product Matrices and Eventually Inverse M-matrices. SIAM J. Matrix Anal. Appl. 29(2): 370-376 (2007) - 2006
- [j31]Peter J. Cameron
The number of equivalence classes of symmetric sign patterns. Discret. Math. 306(23): 3074-3077 (2006) - [j30]Charles R. Johnson, António Leal Duarte
Converse to the Parter-Wiener theorem: The case of non-trees. Discret. Math. 306(23): 3125-3129 (2006) - [j29]Charles R. Johnson, Carlos M. Saiago
The trees for which maximum multiplicity implies the simplicity of other eigenvalues. Discret. Math. 306(23): 3130-3135 (2006) - [j28]Shaun M. Fallat, Allen Herman
Compressions of Totally Positive Matrices. SIAM J. Matrix Anal. Appl. 28(1): 68-80 (2006) - [j27]Susana Furtado
Perturbation of Matrices Diagonalizable under Congruence. SIAM J. Matrix Anal. Appl. 28(1): 81-88 (2006) - 2004
- [j26]Charles R. Johnson, Brian D. Sutton:
Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components. SIAM J. Matrix Anal. Appl. 26(2): 390-399 (2004) - 2003
- [j25]Shaun M. Fallat, Michael I. Gekhtman, Charles R. Johnson:
Multiplicative principal-minor inequalities for totally nonnegative matrices. Adv. Appl. Math. 30(3): 442-470 (2003) - [j24]Charles R. Johnson, D. Dale Olesky, Pauline van den Driessche:
Matrix Classes That Generate All Matrices with Positive Determinant. SIAM J. Matrix Anal. Appl. 25(1): 285-294 (2003) - [j23]Charles R. Johnson, António Leal Duarte
The Parter-Wiener Theorem: Refinement and Generalization. SIAM J. Matrix Anal. Appl. 25(2): 352-361 (2003) - [j22]Charles R. Johnson, D. Dale Olesky, Pauline van den Driessche:
Erratum: Successively Ordered Elementary Bidiagonal Factorization. SIAM J. Matrix Anal. Appl. 25(3): 900 (2003) - 2002
- [j21]Charles R. Johnson, Ronald L. Smith:
Intervals of Inverse M-Matrices. Reliab. Comput. 8(3): 239-243 (2002) - [j20]Charles R. Johnson, Christopher J. Hillar:
Eigenvalues of Words in Two Positive Definite Letters. SIAM J. Matrix Anal. Appl. 23(4): 916-928 (2002) - 2001
- [j19]Charles R. Johnson, Michael Lundquist, Thomas J. Lundy, John S. Maybee:
Deterministic inverse zero-patterns. Discret. Appl. Math. 113(2-3): 211-236 (2001) - [j18]Charles R. Johnson, D. Dale Olesky, Pauline van den Driessche:
Successively Ordered Elementary Bidiagonal Factorization. SIAM J. Matrix Anal. Appl. 22(4): 1079-1088 (2001) - 2000
- [j17]Charles R. Johnson, Joel Pitkin, David P. Stanford:
Line-Sum Symmetry via the DomEig Algorithm. Comput. Optim. Appl. 17(1): 5-10 (2000) - [j16]Shaun M. Fallat, Michael I. Gekhtman, Charles R. Johnson:
Spectral Structures of Irreducible Totally Nonnegative Matrices. SIAM J. Matrix Anal. Appl. 22(2): 627-645 (2000)
1990 – 1999
- 1998
- [j15]Charles R. Johnson, Brenda Kroschel, Henry Wolkowicz:
An Interior-Point Method for Approximate Positive Semidefinite Completions. Comput. Optim. Appl. 9(2): 175-190 (1998) - [j14]Charles R. Johnson, Pablo Tarazaga:
Approximate Semidefinite Matrices in a Linear Variety. SIAM J. Matrix Anal. Appl. 19(4): 861-871 (1998) - [j13]Wayne W. Barrett, Charles R. Johnson, Raphael Loewy:
Critical Graphs for the Positive Definite Completion Problem. SIAM J. Matrix Anal. Appl. 20(1): 117-130 (1998) - 1996
- [j12]Charles R. Johnson, Terry A. McKee:
Structural conditions for cycle completable graphs. Discret. Math. 159(1-3): 155-160 (1996) - [j11]Charles R. Johnson:
In Memoriam Robert C. Thompson 1931-1995. SIAM J. Matrix Anal. Appl. 17(3): 463-464 (1996) - 1995
- [j10]Mihály Bakonyi, Charles R. Johnson:
The Euclidian Distance Matrix Completion Problem. SIAM J. Matrix Anal. Appl. 16(2): 646-654 (1995) - [j9]Charles R. Johnson, Brenda K. Kroschel:
Principal Submatrices, Geometric Multiplicities, and Structured Eigenvectors. SIAM J. Matrix Anal. Appl. 16(3): 1004-1012 (1995) - 1993
- [j8]Charles R. Johnson, Wayne W. Barrett:
Determinantal inequalities for positive definite matrices. Discret. Math. 119(1-3): 97-106 (1993) - [j7]Charles R. Johnson, Volker Mehrmann, D. Dale Olesky:
Sign Controllability of a Nonnegative Matrix and a Positive Vector. SIAM J. Matrix Anal. Appl. 14(2): 398-407 (1993) - [j6]Donovan R. Hare
Sparsity Analysis of the $QR$ Factorization. SIAM J. Matrix Anal. Appl. 14(3): 655-669 (1993) - [j5]Charles R. Johnson, Peter M. Nylen:
Length Bounds for Singular Values of Sparse Matrices. SIAM J. Matrix Anal. Appl. 14(4): 1043-1047 (1993) - 1991
- [b3]Roger A. Horn, Charles R. Johnson:
Topics in Matrix Analysis. Cambridge University Press 1991, ISBN 978-0-521-46713-1, pp. I-VIII, 1-607 - 1990
- [b2]Roger A. Horn, Charles R. Johnson:
Matrix analysis. Cambridge University Press 1990, ISBN 978-0-521-38632-6, pp. I-XIII, 1-561 - [c1]Charles R. Johnson, John S. Maybee:
Qualitative Analysis of Schur Complements. Applied Geometry And Discrete Mathematics 1990: 359-366
1980 – 1989
- 1986
- [j4]Eric Howe, Charles R. Johnson, James Lawrence:
The structure of distances in networks. Networks 16(1): 87-106 (1986) - 1985
- [b1]Roger A. Horn, Charles R. Johnson:
Matrix Analysis. Cambridge University Press 1985, ISBN 9780511810817 - 1983
- [j3]Ludwig Elsner, Charles R. Johnson, J. A. Ross, Johanan Schönheim:
On a Generalized Matching Problem Arising in Estimating the Eigenvalue Variation of Two Matrices. Eur. J. Comb. 4(2): 133-136 (1983) - 1980
- [j2]Charles R. Johnson, Morris Newman:
A note on cospectral graphs. J. Comb. Theory B 28(1): 96-103 (1980)
1970 – 1979
- 1979
- [j1]Charles R. Johnson:
A convergence proof for a hyperstable adaptive recursive filter (Corresp.). IEEE Trans. Inf. Theory 25(6): 745-749 (1979)
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-12-10 20:47 CET 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: