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
Recently Published

Volume 14, no. 1, 2010
Special Issue on Selected Papers from the Sixteenth International Symposium on Graph Drawing, GD 2008

Guest Editor(s): Ioannis G. Tollis and Maurizio Patrignani

Volume 14, no. 2, 2010

  • New complexity results for time-constrained dynamical optimal path problems
    Sebastian Kluge , Martin Brokate and Konrad Reif
    Vol. 14, no. 2, pp. 123-147, 2010. Regular paper.
    Submitted: June 2009.
    Reviewed: September 2009. Revised: October 2009.
    Accepted: October 2009. Final: October 2009.
    Published: January 2010.
    Communicated by Dorothea Wagner.
  • Resource relocation on asymmetric networks
    D. Jacob Wildstrom
    Vol. 14, no. 2, pp. 149-163, 2010. Regular paper.
    Submitted: January 2009.
    Reviewed: November 2009. Revised: November 2009.
    Accepted: November 2009. Final: November 2009.
    Published: January 2010.
    Communicated by Gerhard J. Woeginger.
  • Computational Aspects of Lucidity-Driven Graph Clustering
    Robert Görke, Marco Gaertler, Florian Hübner and Dorothea Wagner
    Vol. 14, no. 2, pp. 165-197, 2010. Regular paper.
    Submitted: March 2009.
    Reviewed: September 2009. Revised: October 2009.
    Accepted: December 2009. Final: December 2009.
    Published: January 2010.
    Communicated by Ulrik Brandes.
  • Intersection Graphs of Pseudosegments: Chordal Graphs
    Cornelia Dangelmayr, Stefan Felsner and William T. Trotter
    Vol. 14, no. 2, pp. 199-220, 2010. Regular paper.
    Submitted: October 2008.
    Reviewed: December 2009. Revised: December 2009.
    Accepted: December 2009. Final: December 2009.
    Published: February 2010.
    Communicated by Henk Meijer.
  • A Graph Pebbling Algorithm on Weighted Graphs
    Nandor Sieben
    Vol. 14, no. 2, pp. 221-244, 2010. Regular paper.
    Submitted: April 2009.
    Reviewed: August 2009. Revised: December 2009.
    Accepted: January 2010. Final: January 2010.
    Published: February 2010.
    Communicated by Giuseppe Liotta.
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