| Discipline name | Position | Best Scientists | Publications | D-Index |
|---|---|---|---|---|
| Mathematics | 561 | 17 | 25 | 4 |
| Computer Science | 821 | 24 | 33 | 5 |
Journal of Graph Algorithms and Applications explores disciplines such as Combinatorics, Discrete mathematics, Planar graph, Graph and Graph drawing. The journal aims to bridge the gap between the study of Combinatorics and Planar. Journal of Graph Algorithms and Applications aims to investigate interdisciplinary topics such as Planar and Planarity testing.
The journal focuses on Discrete mathematics but the discussions also offer insight into other areas such as Algorithm, Bounded function and Embedding. Bounded function study tackled is connected to the field of Treewidth. Journal of Graph Algorithms and Applications holds forums on Planar graph that merges themes from other disciplines such as Outerplanar graph, Vertex (graph theory), Plane (geometry), Planar straight-line graph and Edge (geometry).
The research on Graph drawing featured in Journal of Graph Algorithms and Applications combines topics in other fields like Graph (abstract data type) and Theoretical computer science. The close relationship between Indifference graph and Pathwidth and Clique-sum is one of the points of interest dissected in Chordal graph research. The journal centers on topics in 1-planar graph, with a focus on Book embedding.
The journal articles are organized to address concerns in the fields of Combinatorics, Discrete mathematics, Planar graph, Theoretical computer science and 1-planar graph. The presentations in the published articles discussing Combinatorics offer insights in topics such as Graph, Outerplanar graph, Indifference graph, Time complexity and Book embedding. While the most cited articles focused on Discrete mathematics, they were also able to explore topics like Measure (mathematics), Clustering coefficient and Approximation algorithm.
Journal of Graph Algorithms and Applications mainly deals with areas of study such as Combinatorics, Embedding, Theoretical computer science, Graph (abstract data type) and Planar. Aside from investigating topics in Vertex (geometry), Bipartite graph and Planar graph under Combinatorics, the journal also explores concepts in Colored and Empirical comparison. The Planar graph research presented in the journal explores the relationship between Resolution (algebra) and the closely related topic of Graph.
The overlapping concepts between Structure (category theory) and Representation (mathematics) and Discrete mathematics are the key highlights of Graph study. While work presented in Journal of Graph Algorithms and Applications provided substantial information on Theoretical computer science, it also covered topics in Tree (data structure), Adjacency list, Vertex (graph theory), Solver and Kernel (image processing). The journal facilitates discussions on Graph (abstract data type) that incorporate concepts from other fields like Flow (mathematics), Pathwidth, Treewidth, Open problem and Stack (mathematics).
A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.
The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.
The top authors publishing in Journal of Graph Algorithms and Applications (based on the number of publications) are:
The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.
Only papers with recognized affiliations are considered
The top affiliations publishing in Journal of Graph Algorithms and Applications (based on the number of publications) are:
The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.
The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.
The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.
During the most recent 2021 edition, 95.65% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 0.00% were posted by at least one author from the top 10 institutions publishing in the journal. Another 100.00% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 0.00% of all publications and 0.00% were from other institutions.
A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.
The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.
The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.
Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).
The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:
The chart below illustrates experience levels of first authors in cases of publications with multiple authors.
Matthias Bentert;Alexander Dittmann;Leon Kellerhals;André Nichterlein
(2020)Michael Kaufmann;János Pach;Géza Tóth;Torsten Ueckerdt
(2021)Markus Chimani;Christine Dahn;Martina Juhnke-Kubitzke;Nils M. Kriege
(2020)Manuel Borrazzo;Giordano Da Lozzo;Giuseppe Di Battista;Fabrizio Frati
(2020)Aleksander Figiel;Anne-Sophie Himmel;André Nichterlein;Rolf Niedermeier
(2021)A. Arul Shantrinal;Sandi Klavžar;T.M. Rajalaxmi;R. Sundara Rajan
(2021)David Eppstein
(2021)For those interested in advancing their Computer Science education, numerous online options are available that cater to various career goals and budgets. Many professionals consider pursuing the easiest masters degree programs online, which offer a flexible path to gaining advanced knowledge while balancing work and personal commitments.
If you’re aiming for the highest academic qualification, exploring cheap online phd programs can make earning a doctorate more accessible without the traditional campus constraints or high costs.
Financing your education is crucial, and many online institutions listed under online colleges that accept fafsa provide affordable tuition alongside federal financial aid options. This support can significantly reduce the financial burden of studying online.
For quicker career advancement or skill development, the best online certificate programs can be a smart investment. These certifications often focus on in-demand tech skills, helping students and professionals alike increase their earning potential and job security.
