Journal of Graph Algorithms and Applications

http://jgaa.info ISSN: 1526-1719


[Home]   [Electronic Edition]   [Hardcopy Edition]   [Scope]   [Submission]   [Mirrors]

Editors-in-Chief
Roberto Tamassia
Brown University
Ioannis G. Tollis
University of Crete and ICS-FORTH
Advisory Board
I. Chlamtac
CREATE-NET
G. N. Frederickson
Purdue University
T. C. Hu
University of California at San Diego
D. E. Knuth
Stanford University
C. L. Liu
University of Illinois
K. Mehlhorn
Max-Planck Institut für Informatik
T. Nishizeki
Tohoku University
F. P. Preparata
Brown University
I. H. Sudborough
University of Texas at Dallas
R. E. Tarjan
Princeton University
M. Yannakakis
Columbia University
In Memoriam
S. Even
Technion
JGAA Ranking

JGAA is a "Quality 1" journal in discrete mathematics according to a SCImago research. Some charts of this study are reported below. The "Cites per Doc" indicator is the impact factor of JGAA

SCImago Journal & Country Rank

News

According to SCImago research, a study where different ranking methods were applied to scientific journals, the Journal of Graph Algorithms and Application is among the very few "Quality 1" journals in discrete mathematics. It is also a "Quality 2" journal in theoretical computer science. The evaluation was performed by a research group from the Consejo Superior de Investigaciones Científicas (CSIC), University of Granada, Extremadura, Carlos III (Madrid). Among the different measures that they adopted, "SJR" indicates the scientific influence of an average journal article (computed with a PageRank based technique described in a paper that you can find in the site), while "Cites per Doc.(2y)" is the same as the ISI impact factor of Thomson Reuters. Some charts of this study are reported below.

SCImago Journal & Country Rank

 
Recently Published

Volume 14, no. 2, 2010

  • Minimum-Layer Upward Drawings of Trees
    Muhammad Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi and Md. Saidur Rahman
    Vol. 14, no. 2, pp. 245-267, 2010. Regular paper.
    Submitted: August 2009.
    Reviewed: January 2010. Revised: February 2010.
    Accepted: March 2010. Final: April 2010.
    Published: June 2010.
    Communicated by Giuseppe Liotta.
  • On the Maximum Independent Set Problem in Subclasses of Planar Graphs
    Vadim Lozin and Martin Milanič
    Vol. 14, no. 2, pp. 269-286, 2010. Regular paper.
    Submitted: July 2007.
    Reviewed: May 2009. Revised: June 2009.
    Accepted: March 2010. Final: March 2010.
    Published: June 2010.
    Communicated by Martin Fürer.
  • Computing All Best Swaps for Minimum-Stretch Tree Spanners
    Shantanu Das, Beat Gfeller and Peter Widmayer
    Vol. 14, no. 2, pp. 287-306, 2010. Regular paper.
    Submitted: September 2009.
    Reviewed: April 2010.
    Accepted: April 2010. Final: April 2010.
    Published: June 2010.
    Communicated by Ulrik Brandes.
  • Finding the Most Relevant Fragments in Networks
    Kevin Buchin, Sergio Cabello, Joachim Gudmundsson, Maarten Löffler, Jun Luo, Günter Rote, Rodrigo I. Silveira, Bettina Speckmann and Thomas Wolle
    Vol. 14, no. 2, pp. 307-336, 2010. Regular paper.
    Submitted: October 2009.
    Reviewed: January 2010. Revised: March 2010.
    Accepted: April 2010. Final: May 2010.
    Published: June 2010.
    Communicated by Dorothea Wagner.
  • Applications of Parameterized st-Orientations
    Charalampos Papamanthou and Ioannis G. Tollis
    Vol. 14, no. 2, pp. 337-365, 2010. Regular paper.
    Submitted: December 2008.
    Reviewed: May 2009. Revised: December 2009.
    Accepted: April 2010. Final: June 2010.
    Published: June 2010.
    Communicated by Ulrik Brandes.
Managing Editor
Giuseppe Liotta
University of Perugia
liotta@diei.unipg.it
Publication Editor
Emilio Di Giacomo
University of Perugia
digiacomo@diei.unipg.it
Editorial Board
S. Albers
Universität Freiburg
L. Arge
University of Aarhus
U. Brandes
Universität Konstanz
G. Di Battista
University of Rome Tre
P. Eades
University of Sydney
M. Fürer
Pennsylvania State University
M. T. Goodrich
University of California, Irvine
X. He
State University of New York at Buffalo
A. Itai
Technion
M. Kaufmann
Universität Tübingen
S. G. Kobourov
University of Arizona
E. W. Mayr
Technischen Universität München
H. Meijer
Roosevelt Academy Middelburg
J. S. B. Mitchell
State University of New York at Stony Brook
P. Mutzel
Universität Dortmund
D. Wagner
Universität Karlsruhe
T. Warnow
University of Texas at Austin
S. Whitesides
Victoria University
G. J. Woeginger
Eindhoven University of Technology
Past Editors
A. L. Buchsbaum
AT&T Labs - Research
D. Eppstein
University of California at Irvine
A. Gibbons
King's College
Y. Kajitani
University of Kitakyushu
S. Khuller
University of Maryland
B. M. E. Moret
University of New Mexico
B. Raghavachari
University of Texas at Dallas

[Home]   [Electronic Edition]   [Hardcopy Edition]   [Scope]   [Submission]   [Mirrors]

Journal of Graph Algorithms and Applications

The NSDL Scout Report for
        Math, Engineering, and Technology Selection