Journal of Graph Algorithms and Applications

The Journal of Graph Algorithms and Applications (JGAA) is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. JGAA is supported by distinguished advisory and editorial boards, has high scientific standards and is distributed in electronic form. JGAA is a gold open access journal that charges no author fees.

View full aims and scope

News

October 2019. The Executive Committee of JGAA is pleased to announce the appointment of Martin Nöllenburg to the Editorial Board of JGAA.

April 2019. The Executive Committee of JGAA is pleased to announce the appointment of Guy Even, Yoshio Okamoto, and Ignaz Rutter to the Editorial Board of JGAA.

Recently Published

DOI: 10.7155/jgaa.00523

Maximum Cut Parameterized by Crossing Number

Markus Chimani, Christine Dahn, Martina Juhnke-Kubitzke, Nils M. Kriege, Petra Mutzel, and Alexander Nover

Vol. 24, no. 3, pp. 155-170, 2020. Regular paper.

DOI: 10.7155/jgaa.00522

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, and Marc-Antoine Weisser

Vol. 24, no. 3, pp. 133-153, 2020. Regular paper.

DOI: 10.7155/jgaa.00521

Drawing Clustered Planar Graphs on Disk Arrangements

Tamara Mchedlidze, Marcel Radermacher, Ignaz Rutter, and Nina Zimbel

Vol. 24, no. 2, pp. 105-131, 2020. Regular paper.

DOI: 10.7155/jgaa.00520

Efficient Algorithm for Box Folding

Koichi Mizunashi, Takashi Horiyama, and Ryuhei Uehara

Vol. 24, no. 2, pp. 89-103, 2020. Regular paper.

DOI: 10.7155/jgaa.00519

Weighted Upper Edge Cover: Complexity and Approximability

Kaveh Khoshkhah, Mehdi Khosravian Ghadikolaei, Jérôme Monnot, and Florian Sikora

Vol. 24, no. 2, pp. 65-88, 2020. Regular paper.

DOI: 10.7155/jgaa.00518

Guest Editors' Foreword

Krishnendu Mukhopadhyaya and Shin-ichi Nakano

Vol. 24, no. 2, pp. 63-64, 2020.

DOI: 10.7155/jgaa.00517

Reconfiguring Minimum Dominating Sets in Trees

Magdalena Lemańska and Paweł Żyliński

Vol. 24, no. 1, pp. 47-61, 2020. Regular paper.

DOI: 10.7155/jgaa.00516

On the Circumference of Essentially 4-connected Planar Graphs

Igor Fabrici, Jochen Harant, Samuel Mohr, and Jens M. Schmidt

Vol. 24, no. 1, pp. 21-46, 2020. Regular paper.

DOI: 10.7155/jgaa.00515

Order-preserving Drawings of Trees with Approximately Optimal Height (and Small Width)

Johannes Batzill and Therese Biedl

Vol. 24, no. 1, pp. 1-19, 2020. Regular paper.

DOI: 10.7155/jgaa.00514

A Simple Algorithm for $r$-gatherings on the Line

Shin-ichi Nakano

Vol. 23, no. 5, pp. 837-845, 2019. Regular paper.

DOI: 10.7155/jgaa.00513

Suthee Ruangwises and Toshiya Itoh

Vol. 23, no. 5, pp. 815-835, 2019. Regular paper.

DOI: 10.7155/jgaa.00512

Faster algorithms for shortest path and network flow based on graph decomposition

Manas Jyoti Kashyop, Tsunehiko Nagayama, and Kunihiko Sadakane

Vol. 23, no. 5, pp. 781-813, 2019. Regular paper.

DOI: 10.7155/jgaa.00511

Approximating Partially Bounded Degree Deletion on Directed Graphs

Toshihiro Fujito, Kei Kimura, and Yuki Mizuno

Vol. 23, no. 5, pp. 759-780, 2019. Regular paper.

DOI: 10.7155/jgaa.00510

Guest Editors' Foreword

M. Sohel Rahman, Wing-Kin Sung, and Ryuhei Uehara

Vol. 23, no. 5, pp. 755-757, 2019.

Just Accepted

The following papers have been accepted to be published in the JGAA Special issue on Selected papers from the Twenty-seventh International Symposium on Graph Drawing and Network Visualization, GD 2019. These papers will receive a volume, an issue number, and page numbers when the whole special issue will be published.

DOI: 10.7155/jgaa.00524

Recognizing Stick Graphs with and without Length Constraints

Steven Chaplick, Philipp Kindermann, Andre Löffler, Florian Thiele, Alexander Wolff, Alexander Zaft, and Johannes Zink

Vol. 0, no. 0, pp. 0-0, 0. Regular paper.

DOI: 10.7155/jgaa.00526

Parameterized Algorithms for Book Embedding Problems

Sujoy Bhore, Robert Ganian, Fabrizio Montecchiani, and Martin Nöllenburg

Vol. 0, no. 0, pp. 0-0, 0. Regular paper.

Executive Committee

G. Liotta

University of Perugia

R. Tamassia