Journal of Graph Algorithms and Applications

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


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

Volume 14, 2010

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.
  • 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.

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

Journal of Graph Algorithms and Applications