Write in a clean editor, then format for SIAM Journal on Algebraic and Discrete Methods in one click — DocuGuru applies the official SIAM template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
SIAM Journal on Algebraic and Discrete Methods is a peer-reviewed journal published by SIAM, covering Advanced Graph Theory Research, Matrix Theory and Algorithms, graph theory and CDMA systems.
| Publisher | SIAM |
|---|---|
| Reference style | Numbered (SIAM) Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, SIAM Journal on Algebraic and Discrete Methods 12 (2023) 45–58.
Formats any DOI in the closest standard style — SIAM Journal on Algebraic and Discrete Methods has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Advanced Graph Theory Research Matrix Theory and Algorithms graph theory and CDMA systems Graph theory and applications Advanced Optimization Algorithms Research |
| ISSN | 0196-5212 |
| h-index | 76 |
| i10-index | 305 |
| Total citations | 21,941 |
| Top institutions publishing here | University of Wisconsin–Madison |
| Journal website | locus.siam.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
A k-tree is a graph that can be reduced to the k-complete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a k-tree. This problem is motivated by the existence of polynomial time algorithms for…
We show that the following problem is NP-complete. Given a graph, find the minimum number of edges (fill-in) whose addition makes the graph chordal. This problem arises in the solution of sparse symmetric positive definite systems of linear equations by Gaussian elimination.
In this paper we consider a problem related to questions of optimal circuit layout: Given a graph or network, how can we embed it in a planar surface so as to minimize the number of edge-crossings? We show that this problem is NP-complete, and hence there is not likely to be any efficient way to…
A powerful technique in the complexity analysis of data structures is amortization, or averaging over time. Amortized running time is a realistic but robust complexity measure for which we can obtain surprisingly tight upper and lower bounds on a variety of algorithms. By following the principle of designing algorithms whose amortized complexity is low, we…
Techniques from algebraic geometry, in particular the hard Lefschetz theorem, are used to show that certain finite partially ordered sets O x derived from a class of algebraic varieties X have the k-Sperner property for all k. This in effect means that there is a simple description of the cardinality of the largest subset of…
