<meta http-equiv="Content-Type" content="text/html; charset=utf-8"><div dir="ltr"><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">Dear Graph Drawers,</div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">We are happy to share our Call for Papers for a Special Issue of Future Internet on "<b>Information Processing and Management for Large and Complex Networks</b>". </div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">The scope of the special issue includes graph drawing and network visualization. </div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">Please find here all the details:<br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><a href="https://urldefense.proofpoint.com/v2/url?u=https-3A__www.mdpi.com_journal_futureinternet_special-5Fissues_IPML-5FComplexNetworks&d=DwMFaQ&c=sJ6xIWYx-zLMB3EPkvcnVg&r=yQQsvTNAnbvDXGM4nDrXAje4pr0qHX2qIOcCQtJ5k3w&m=uJL9tC3jlkT4bl_vY90y3qYmPsqo5jEfFKRVgEID-Aw&s=GsE-hx26QC4mq0-cSOFzXHYoSSgIqbwSW6g2KwgsYhE&e=" target="_blank">https://www.mdpi.com/journal/futureinternet/special_issues/IPML_ComplexNetworks</a></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><b>Submission deadline: February 28, 2021</b></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><b><br></b></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">Best regards,<br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">Fabrizio and Walter</div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><br></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)">--------------------------------------------------------------------</div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><font size="4"><b>Special Issue on Information Processing and Management for Large and Complex Networks</b></font></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><font size="4"><b><br></b></font></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><font size="4"><b>Journal: Future Internet<br></b></font></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><font size="4"><b><br></b></font></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><p class="MsoNormal" style="margin:0in 0in 8pt;line-height:14.1333px;text-align:justify;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.5467px;font-family:Calibri,sans-serif;color:windowtext">Network-based models are pervasive in many fields of science and technology, as they naturally capture relationships between entities. The study of relationships emerged as a pivotal addition to standard social and behavioral research, going beyond the single attributes of the social units. Indeed, networks (or graphs) are widely used to model relational data in a variety of application domains, including social sciences, economy and finance, information and homeland security, management, biology, computer networks, marketing, and software design. With the increasing amount of relational data generated every day, processing, managing, and analyzing large-scale graphs have become prominent problems in data science, which pose several challenges ranging from the design of efficient graph algorithms to the development of scalable and effective systems.  </span></p><p class="MsoNormal" style="margin:0in 0in 8pt;line-height:14.1333px;text-align:justify;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.5467px;font-family:Calibri,sans-serif;color:windowtext">This special issue calls for papers that contribute to the multifaceted research on processing, managing, and analyzing large and complex networks. Interested authors are invited to contribute their original, unpublished work. Topics of interest include, but are not limited to, the following:</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">management information systems</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">big network data management</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">large-scale graph processing algorithms and systems</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">parallel and distributed graph algorithms</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">strategic information systems</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">decision support systems</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">graph drawing and network visualization techniques</span></p><p align="left" style="margin:0in 0in 0.0001pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">human-computer interaction for network analysis</span></p><p align="left" style="margin:0in 0in 8pt 17.85pt;line-height:14.2667px;font-size:10pt;font-family:"Palatino Linotype",serif;color:black"><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Symbol;color:windowtext">·<span style="font-variant-numeric:normal;font-variant-east-asian:normal;font-stretch:normal;font-size:7pt;line-height:normal;font-family:"Times New Roman"">        </span></span><span lang="EN-US" style="font-size:11pt;line-height:15.6933px;font-family:Calibri,sans-serif;color:windowtext">graph benchmarks and generators</span></p><i><span lang="EN-US" style="font-size:11pt;font-family:Calibri,sans-serif;color:windowtext">Guest Editors</span></i><span lang="EN-US" style="color:windowtext"><br></span></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><span lang="EN-US" style="color:windowtext">Prof. Fabrizio Montecchiani</span><span lang="EN-US" style="color:windowtext"><br></span></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><span lang="EN-US" style="color:windowtext">Prof. Walter Didimo</span><span lang="EN-US" style="color:windowtext"><br></span></div><div class="gmail_default" style="font-family:verdana,sans-serif;color:rgb(68,68,68)"><span lang="EN-US" style="color:windowtext">Prof. Andrea Fronzetti Colladon</span></div></div>