Journal of Graph Algorithms and Applications

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


[Home]   [Papers]   [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

According to a SCImago study the Cites per Doc. of JGAA is 0.846 in 2010. This index, which denotes the average number of citations per document in a two-year period, is computed using the same formula as that of the journal impact factor™ (Thomson Reuters).

SCImago Journal & Country Rank

Just Accepted

In this section we post those papers that have been just accepted in JGAA and are in the queue for being assigned a volume and an issue number. These papers have been accepted by one of the JGAA editors and their content will no longer be modified. However, the publication format of the papers may still be subject to minor changes.

  • Inapproximability of Orthogonal Compaction
    Michael J. Bannister , David Eppstein and Joseph A. Simons
    Posted here on: March 2012.
    To be published in the GD 2011 Special Issue
  • Advances in the Planarization Method: Effective Multiple Edge Insertions
    Markus Chimani and Carsten Gutwenger
    Posted here on: March 2012.
    To be published in the GD 2011 Special Issue
Recently Published

Volume 16, no. 2, 2012

  • Vertex Intersection Graphs of Paths on a Grid
    Andrei Asinowski, Elad Cohen, Martin Charles Golumbic, Vincent Limouzy, Marina Lipshteyn and Michal Stern
    Vol. 16, no. 2, pp. 129-150, 2012. Regular paper.
    Submitted: December 2010.
    Reviewed: September 2011. Revised: October 2011.
    Reviewed: October 2011. Revised: November 2011.
    Accepted: November 2011. Final: December 2011.
    Published: January 2012.
    Communicated by Tandy Warnow.
  • Drawing Recurrent Hierarchies
    Christian Bachmaier, Franz J. Brandenburg, Wolfgang Brunner and Raymund Fülöp
    Vol. 16, no. 2, pp. 151-198, 2012. Regular paper.
    Submitted: October 2010.
    Reviewed: March 2011. Revised: May 2011.
    Accepted: December 2011. Final: January 2011.
    Published: January 2012.
    Communicated by Michael Kaufmann.
  • Centdian Computation in Cactus Graphs
    Boaz Ben-Moshe, Amit Dvir, Michael Segal and Arie Tamir
    Vol. 16, no. 2, pp. 199-224, 2012. Regular paper.
    Submitted: July 2010.
    Reviewed: February 2011. Revised: June 2011.
    Reviewed: December 2011. Revised: December 2011.
    Accepted: December 2011. Final: January 2011.
    Published: January 2012.
    Communicated by Gerhard J. Woeginger.
  • Minimizing the Number of Label Transitions Around a Nonseparating Vertex of a Planar Graph
    Bojan Mohar and Petr Škoda
    Vol. 16, no. 2, pp. 225-241, 2012. Regular paper.
    Submitted: July 2011.
    Reviewed: October 2011. Revised: November 2011.
    Reviewed: January 2012. Revised: January 2012.
    Accepted: January 2012. Final: January 2012.
    Published: January 2012.
    Communicated by Csaba D. Tóth.
  • Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area
    Erin W. Chambers, David Eppstein, Michael T. Goodrich and Maarten Löffler
    Vol. 16, no. 2, pp. 243-259, 2012. Regular paper.
    Submitted: July 2011.
    Reviewed: October 2011. Revised: January 2012.
    Accepted: February 2012. Final: February 2012.
    Published: February 2012.
    Communicated by Seok-Hee Hong.
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
U. Brandes
Universität Konstanz
G. Di Battista
University of Rome Tre
P. Eades
University of Sydney
P. Ferragina
University of Pisa
M. Fürer
Pennsylvania State University
M. T. Goodrich
University of California, Irvine
X. He
State University of New York at Buffalo
S.-H. Hong
University of Sydney
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
A Symvonis
National Technical University of Athens
C. D. Tóth
University of Calgary
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
L. Arge
University of Aarhus
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]   [Papers]   [Scope]   [Submission]   [Mirrors]

Journal of Graph Algorithms and Applications

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