Submission Data for 2020-2021 CORE Conference Ranking Process Graph Drawing

Submission Data for 2020-2021 CORE Conference Ranking Process Graph Drawing

Submission Data for 2020-2021 CORE conference Ranking process Graph Drawing Stephen Kobourov, Roberto Tamassia Conference Details Conference Title: Graph Drawing Acronym : GD Rank: A Requested Rank Rank: A Recent Years Proceedings Publishing Style Proceedings Publishing: series Link to most recent proceedings: https://link.springer.com/book/10.1007%2F978-3-030-35802-0 Further details: The International Symposium on Graph Drawing and Network Visualization (GD) has two tracks: Track 1: Combinatorial and algorithmic aspects Track 2: Experimental, applied, and network visualization aspects Regular papers in both tracks are 12 pages LNCS format. Both tracks also accept short paper (6 pages). A special issue of the Journal of Graph Algorithms and Applications is dedicated to the best papers from Track 1. The two best papers from Track 2 are invited to the IEEE Transactions on Visualization and Computer Graphics. Most Recent Years Most Recent Year Year: 2019 URL: https://kam.mff.cuni.cz/gd2019/ Location: Prague, Czech Republic Papers submitted: 100 Papers published: 42 Acceptance rate: 42 Source for numbers: https://link.springer.com/content/pdf/bfm%3A978-3-030-35802-0%2F1%2F1.pdf General Chairs No General Chairs Program Chairs Name: Csaba Toth Affiliation: California State University, Northridge Gender: M H Index: 25 GScholar url: https://scholar.google.com/citations?user=0E1Y4kgAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/t/CsabaDToth.html Name: Daniel Archambault Affiliation: Swansea University Gender: M H Index: 25 GScholar url: https://scholar.google.com/citations?user=DwSNWBoAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/185/1576.html 1 Second Most Recent Year Year: 2018 URL: https://dccg.upc.edu/gd2018/ Location: Barcelona, Spain Papers submitted: 85 Papers published: 41 Acceptance rate: 48 Source for numbers: https://link.springer.com/content/pdf/bfm%3A978-3-030-04414-5%2F1.pdf General Chairs No General Chairs Program Chairs Name: Therese Biedl Affiliation: University of Waterloo, Canada Gender: F H Index: 29 GScholar url: https://scholar.google.com/citations?user=gjNeD8cAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/23/2860.html Name: Andreas Kerren Affiliation: Linnaeus University, Sweden Gender: M H Index: 24 GScholar url: https://scholar.google.com/citations?user=FJ0hneUAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/44/6743.html Third Most Recent Year Year: 2017 URL: https://gd2017.ccis.northeastern.edu/ Location: Boston, MA Papers submitted: 87 Papers published: 43 Acceptance rate: 49 Source for numbers: https://link.springer.com/content/pdf/bfm%3A978-3-319-73915-1%2F1.pdf General Chairs No General Chairs Program Chairs Name: Fabrizio Frati Affiliation: Roma Tre University, Italy Gender: M H Index: 22 GScholar url: https://scholar.google.com/citations?user=hG1tUmsAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/09/2639.html Name: Kwan-Liu Ma Affiliation: University of California, Davis Gender: M H Index: 75 GScholar url: https://scholar.google.com/citations?user=LgL2HpkAAAAJ&hl=en&oi=ao DBLP url: https://dblp.org/pid/93/5838.html Policies Chair Selection: The GD conference has two chairs: one in charge of Track 1 ”Combinatorial and algorithmic aspects” and one in charge of Track 2 ”Experimental, applied, and network visualization aspects”. The GD steering committee nominates candidates for both chairs, aiming to balance experience and youth, representation in the theoretical and applied aspects of GD, and keeping an eye on diversity. Important selection criteria include (a) high visibility and standing in the GD community and beyond; (b) strong publication record commensurate with age, in GD and either other high-quality theory venues or other high-quality visualization venues. On average, every other year we have one male and one female chair. Here’s a list of recent female GD chairs: GD16 Anna Lubiw, GD18 Therese Biedl, GD21 Helen Purchase. Policy name: GD is a member of SafeTOC and follows a code of conduct. Policy url: http://graphdrawing.org/codeOfConduct.html Policy name: SafeTOC Policy url: https://safetoc.org/ 2 (Senior) Program Committee Link to (s)pc: https://kam.mff.cuni.cz/gd2019/committees.html#about File: http://portal.core.edu.au/core/media/conf_submissions_spc_file/preformatted-gd19-pc-edited_2KXJDzz.txt H-index plot: http://portal.core.edu.au/core/media/conf_submissions_hindex_plots/hindex_buckets_1456.png Information Contained within this graph is derived using the Elsevier Scopus Database 2021. Data and Metrics Google Scholar Metrics Sub-category url: https://scholar.google.com.au/citations?view_op=top_venues&hl=en&vq=eng_theoreticalcomputerscience Position in sub-category: 20+ Image of top 20: http://portal.core.edu.au/core/media/changes_h5/higherrank1456_gscholar_minh5.png 3 No Google Scholar h5 index available for this conference Potential reason for no h5 index: We could not find GD in the top20 list of theoretical computer science venues (as indicated above). However, Google does provide information about the H5-index of the GD conference (13) and H5-median (18): https://scholar.google.com.au/citations?hl=en&view_op=search_venues&vq=graph+drawing&btnG= ACM Metrics Not Sponsored by ACM Aminer Rank Not Listed in Aminer Other Rankings Not aware of any other Rankings Conferences in area: The GD conference publishes papers about algorithms and systems for graph visualization. GD is the only conference on this topic and is unique in its focus on theoretical and applied aspects of graph visualization. Naturally, graph algorithms and graph visualization are topics that other conferences publish papers about and list in their calls for papers but this is not their focus: SODA (A*), IEEE InfoVIS (A*), ESA (A), ISAAC (A), WG (A), SoCG (A), ICALP (A), COCOON (A), WADS (B), IWOCA (B), IEEE PacificVis (B), EuroVis (B), WALCOM (C). We contacted the Aminer.org team and they will add GD to their system but the analysis is not yet available. Lacking a way to extract the exact top10 most highly cited papers, we provide a list of 10 well-known GD papers along with their citations counts. Ellson, J., Gansner, E., Koutsofios, L., North, S., & Woodhull, G. GraphvizâĂŤopen source graph drawing tools. In International Symposium on Graph Drawing (GD), p. 483-484, 2001. 816 citations Purchase, H. Which aesthetic has the greatest effect on human understanding? In International Symposium on Graph Drawing (GD), p. 248-261, 1997. 701 citations Harel, D., & Koren, Y. A fast multi-scale method for drawing large graphs. In International Symposium on Graph Drawing (GD), p. 183-196, 2000. 466 citations 4 Garg, A., & Tamassia, R. On the computational complexity of upward and rectilinear planarity testing. In International Symposium on Graph Drawing (GD), p. 286-297, 1994. 436 citations Frick, A., Ludwig, A., & Mehldau, H. A fast adaptive layout algorithm for undirected graphs. In International Symposium on Graph Drawing (GD), p. 388-403, 1994. 448 citations Gansner, E. R., Koren, Y., & North, S. Graph drawing by stress majorization. In International Symposium on Graph Drawing (GD), p. 239-250, 2004. 375 citations Eades, P., & Feng, Q. W. Multilevel visualization of clustered graphs. In International Symposium on Graph Drawing (GD), p. 101-112, 1996. 323 citations Hachul, S., & JÃijnger, M. Drawing large graphs with a potential-field-based multilevel algorithm. In International Symposium on Graph Drawing (GD), p. 285-295, 2004. 300 citations Gutwenger, C., & Mutzel, P. A linear time implementation of SPQR-trees. In International Symposium on Graph Drawing (GD), p. 77-90, 2000. 280 citations Brandes, U., & Pich, C. Eigensolver methods for progressive multidimensional scaling of large data. In International Symposium on Graph Drawing (GD), p. 42-53, 2006. 230 citations Top People Publishing Here name: Michael Goodrich justification: - Distinguished Professor of Computer Science, University of California, Irvine; - IEEE Fellow; - ACM Fellow; - ACM Distinguished Scientist; - Fellow of the American Association for the Advancement of Science (AAAS); - Founding member of the Graph Drawing Symposium (GD) and steering committee member for 20 years; - H-index 68, citations 15209; - Google top20 (13) in data structures; - Google top20 (5) in graph drawing; - Google top20 (18) in computational geometry; https://scholar.google.com/citations?user=sSS9gSoAAAAJ&hl=en&oi=ao https://dblp.org/pid/g/MichaelTGoodrich.html 30 GD papers 21 SoCG papers 16 Algorithmica papers 15 SODA papers 13 SPAA papers 9 ESA papers 9 ISAAC papers 6 SIAM J of Computing papers 6 STOC papers 5 FOCS papers Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 0 0 0 1 2 Attendance: ALWAYS name: Peter Eades justification: - Professor of Computer Science, University of Sydney; - Distinguished NICTA researcher; - Founding member of the Graph Drawing Symposium (GD) and steering committee member for 20 years; - H-index 57, 17738 citations; https://scholar.google.com/citations?user=StEnGcEAAAAJ&hl=en&oi=ao 43 GD papers 11 TCS papers 10 PacificVis papers 9 Algorithmica papers 7 ISAAC papers Paper counts: Most Recent: Second most recent: Third most recent: Fourth most recent: Fifth most recent: 2 2 2 1 1 Attendance: ALWAYS name: Janos Pach justification: - Professor of Mathematics at EPFL, Switzerland; - Grunwald Medal; - Ford Award (Mathematical Association of America); - Renyi Award, Hungarian Academy of Sciences; - Academy Award, Hungarian Academy of Sciences; - ACM Fellow; - AMS Fellow; - H-index 55, citations 16036; https://scholar.google.com/citations?user=uOC_Z8QAAAAJ&hl=en&oi=ao

View Full Text

Details

  • File Type
    pdf
  • Upload Time
    -
  • Content Languages
    English
  • Upload User
    Anonymous/Not logged-in
  • File Pages
    10 Page
  • File Size
    -

Download

Channel Download Status
Express Download Enable

Copyright

We respect the copyrights and intellectual property rights of all users. All uploaded documents are either original works of the uploader or authorized works of the rightful owners.

  • Not to be reproduced or distributed without explicit permission.
  • Not used for commercial purposes outside of approved use cases.
  • Not used to infringe on the rights of the original creators.
  • If you believe any content infringes your copyright, please contact us immediately.

Support

For help with questions, suggestions, or problems, please contact us