<html><head></head><body><div class="ydpb0d83055yahoo-style-wrap" style="font-family:courier new, courier, monaco, monospace, sans-serif;font-size:16px;" dir="ltr" data-setdir="false"><div><div class="ydp3deb0e3egmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">Dear Colleagues, </div><div class="ydp3deb0e3egmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">----------</div><div class="ydp3deb0e3egmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">I apologize if you have received this message multiple times. </div><div class="ydp3deb0e3egmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">-------------</div></div><div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">We are pleased to announce a call for papers for our special issue titled "<b><a href="https://link.springer.com/journal/11227/updates/27347298" data-saferedirecturl="https://www.google.com/url?q=https://link.springer.com/journal/11227/updates/27347298&source=gmail&ust=1733346286316000&usg=AOvVaw0JbgwdccoK0LYnmii5VTrG" style="color: rgb(17, 85, 204); cursor: pointer;" rel="nofollow" target="_blank">Scalable and Deep Graph Learning and Mining</a></b>" in the <a href="https://link.springer.com/journal/11227" data-saferedirecturl="https://www.google.com/url?q=https://link.springer.com/journal/11227&source=gmail&ust=1733346286316000&usg=AOvVaw3AfPlvacRz2NdCPgind-zI" style="color: rgb(17, 85, 204); cursor: pointer;" rel="nofollow" target="_blank">J<b>ournal of Supercomputing</b></a>. This special issue focuses on graph representation learning and the associated research challenges, with an emphasis on scalability, fairness, and the application of graphs in real-world applications in diverse domains such as social networks, biology, cybersecurity, and recommendation systems. It also addresses the challenges of processing large, complex graphs in distributed environments, as centralized approaches often fail to scale efficiently in big data contexts. </div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">Topics of interest include, but are not limited to:</div></div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);" dir="ltr" data-setdir="false"><div><ul style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;"><li style="margin-left: 15px;">Large scale graph processing. </li><li style="margin-left: 15px;">Theoretical analysis of graph algorithms or models. </li><li style="margin-left: 15px;">Semi-supervised learning, online learning, active learning, transductive inference, and transfer learning in the context of graphs. </li><li style="margin-left: 15px;">Graph and vertex embeddings and representation learning on graphs. Explainable, fair, robust, and/or privacy preserving ML on big graphs. </li><li style="margin-left: 15px;">Big knowledge graphs.</li><li style="margin-left: 15px;">Benchmarking aspects of graph based learning. </li><li style="margin-left: 15px;">Libraries and tools for all of the above areas. </li><li style="margin-left: 15px;">Knowledge graph applications. </li><li style="margin-left: 15px;">Representation Learning over Knowledge Graphs. </li><li style="margin-left: 15px;">Dynamic knowledge graphs.</li><li style="margin-left: 15px;"> Large Language Models for Knowledge Graphs Knowledge. </li><li style="margin-left: 15px;">Graphs for Large Language Models. </li><li style="margin-left: 15px;">Prompt engineering and knowledge graphs.</li></ul></div><span><b style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;">Important Dates:</b></span><br></div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);" dir="ltr" data-setdir="false"><span><span style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;"><div style=""><ul style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;"><li style="margin-left: 15px;">Submission Open: 15th December 2024 </li><li style="margin-left: 15px;">Submission Deadline: 15th May 2025</li><li style="margin-left: 15px;">First Decision Notification: 30st September 2025</li></ul></div><span style="font-weight: bold;"><b style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;">Submission Guidelines:</b><span style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;"> </span></span><br></span></span></div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);" dir="ltr" data-setdir="false"><br></div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);" dir="ltr" data-setdir="false"><span><span style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;">All submissions must adhere to the Journal of Supercomputing's submission guidelines. Manuscripts should be prepared according to the journal's standard format and submitted through the journal's online system. Please select the special issue "</span><b style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;">Scalable and Deep Graph Learning and Mining</b><span style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;">" during the submission process.</span></span></div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);" dir="ltr" data-setdir="false"><span><span style="color: rgb(0, 0, 0); font-family: times new roman, serif; font-size: large;"><br></span></span></div><div class="ydp799521d5gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);" dir="ltr" data-setdir="false"><span><div><div class="ydp73125703gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">Best regards,</div><div class="ydp73125703gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">Wissem Inoubli</div><div class="ydp73125703gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">Sabeur Aridhi</div><div class="ydp73125703gmail_default" style="font-family: times new roman, serif; font-size: large; color: rgb(0, 0, 0);">Engelbert Mephu Nguifo</div></div></span></div><br></div></body></html>