{"id":2487,"date":"2024-02-12T16:44:52","date_gmt":"2024-02-12T15:44:52","guid":{"rendered":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/?page_id=2487"},"modified":"2026-02-08T23:03:43","modified_gmt":"2026-02-08T22:03:43","slug":"complex-network-sparsification","status":"publish","type":"page","link":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/complex-network-sparsification\/","title":{"rendered":"Workshop on Complex Network Sparsification"},"content":{"rendered":"<div  data-label=\"Content\" data-id=\"content--1\" data-export-id=\"content-12\" data-category=\"content\" class=\"content-12 content-section content-section-spacing\" id=\"content-1\" style=\"background-color: rgb(255, 255, 255);\"><div  class=\"gridContainer\"> <div  class=\"row text-center\"><div  class=\"section-title-col\" data-type=\"column\">  <h1 class=\"\" >3nd Workshop on Complex Network Sparsification &amp; Beyond<\/h1><p  class=\"lead\" style=\"text-align: justify;\">Graphs, also called networks,  are everywhere: social interactions, protein-protein interactions, chemical molecules, transportation networks, are all graphs. Most of these networks  are complex either by their size or by the entanglement of the links that compose them, or by both. This makes their analysis very challenging. To address scalability and performance issues when dealing with such networks, numerous algorithms are designed to simplify graphs in various fields and applications. The goal is to construct simpler or smaller representations for these graphs, primarily to save storage space, but also to use the obtained representations instead of the original graphs in applications where using the original graphs is time-intensive or consumes a lot of computational resources.  Sparsification  is one of these approaches aimed at constructing a subgraph of the original graph by removing non-important edges. The resulting graph is called a skeleton or a backbone. Sparsification generally depends on the application because the importance of an edge can vary from one application to another. The main idea is to obtain a smaller graph while preserving certain properties, even approximately, of the original graph.<br >\nThe aim of this workshop is to bring together researchers working on the broad theme of simplification of complex networks, and more generally graphs, through sparsification. This workshop aims to provide an opportunity for researchers from different communities to meet and discuss sparsification methods and their applications.<\/p><\/div> <\/div> <div  class=\"row center-xs middle-xs\"> <div  class=\"col-sm-9\" data-type=\"column\"> <\/div> <\/div><\/div> <\/div><div  data-label=\"Topics of interest include\" data-id=\"content--2\" data-export-id=\"content-12\" data-category=\"content\" class=\"content-12 content-section content-section-spacing\" id=\"topics-of-interest-include\" style=\"background-color: rgb(245, 250, 253);\"><div  class=\"gridContainer\"> <div  class=\"row text-center\"><div  class=\"section-title-col\" data-type=\"column\"> <h2  class=\"\">Topics of interest include<\/h2> <p  class=\"lead\" style=\"text-align: left;\">\u00b7       Sparsification methods<br >\n\u00b7       Sparsification of particular networks or graph classes<br >\n\u00b7       Learning-based models and approaches for graph sparsification<br >\n\u00b7       Sparsification of weighted networks<br >\n\u00b7       Applications of sparsified graphs<\/p><\/div> <\/div> <div  class=\"row center-xs middle-xs\"> <div  class=\"col-sm-9\" data-type=\"column\"> <\/div> <\/div><\/div> <\/div><div  data-label=\"Workshop chairs\" data-id=\"content--3\" data-export-id=\"content-12\" data-category=\"content\" class=\"content-12 content-section content-section-spacing\" id=\"workshop-chairs\" style=\"background-color: rgb(255, 255, 255);\"><div  class=\"gridContainer\"> <div  class=\"row text-center\"><div  class=\"section-title-col\" data-type=\"column\"> <h2  class=\"\">Workshop chairs<\/h2> <p  class=\"lead\" style=\"text-align: left;\"><span  style=\"font-weight: 700;\">Hamida Seba<\/span><br >\nUniversity Lyon 1<br >\n<a data-mce-href=\"mailto:Hamida.seba@univ-lyon1.fr\" href=\"mailto:Hamida.seba@univ-lyon1.fr\" target=\"_self\" data-mce-selected=\"inline-boundary\" data-cp-link=\"1\" rel=\"noopener noreferrer\">Hamida.seba@univ-lyon1.fr<\/a>\n<br ><br ><span  style=\"font-weight: 700;\">Hocine Cherifi<\/span><br >\nUniversity of Burgundy<br >\n<a data-mce-href=\"mailto:hocine.cherifi@u-bourgogne.fr\" href=\"mailto:hocine.cherifi@u-bourgogne.fr\" target=\"_self\" data-mce-selected=\"inline-boundary\" data-cp-link=\"1\" rel=\"noopener noreferrer\">hocine.cherifi@u-bourgogne.fr<\/a><\/p><\/div> <\/div> <div  class=\"row center-xs middle-xs\"> <div  class=\"col-sm-9\" data-type=\"column\"> <\/div> <\/div><\/div> <\/div><div  data-label=\"Program committee\" data-id=\"content--4\" data-export-id=\"content-12\" data-category=\"content\" class=\"content-12 content-section content-section-spacing\" id=\"program-committee\" style=\"background-color: rgb(245, 250, 253);\"><div  class=\"gridContainer\"> <div  class=\"row text-center\"><div  class=\"section-title-col\" data-type=\"column\"> <h2  class=\"\">Program committee<\/h2> <p  class=\"lead\" style=\"text-align: left;\">Julien Baste, University Lille 1<br >\nMohammed Haddad University Lyon 1<br >\nOlivier Togni, University of Burgundy<\/p><\/div> <\/div> <div  class=\"row center-xs middle-xs\"> <div  class=\"col-sm-9\" data-type=\"column\"> <\/div> <\/div><\/div> <\/div><div  data-label=\"Submission Guidelines\" data-id=\"content--5\" data-export-id=\"content-12\" data-category=\"content\" class=\"content-12 content-section content-section-spacing\" id=\"submission-guidelines\" style=\"background-color: rgb(255, 255, 255);\"><div  class=\"gridContainer\"> <div  class=\"row text-center\"><div  class=\"section-title-col\" data-type=\"column\"> <h2  class=\"\">Submission Guidelines<\/h2> <p  class=\"lead\" style=\"text-align: left;\"><span  style=\"color: rgb(251, 0, 25); font-weight: 700;\">\nDeadlines<\/span><br >\n\u2013 <span  style=\"font-weight: 600;\">Paper Submission Deadline<\/span>: <span  style=\"font-weight: 700; color: rgb(255, 51, 51);\">March 16, 2026<\/span><br >\u2013&nbsp;<span  style=\"font-weight: 600;\">Final Decisions Released<\/span>: March 31, 2026<br >\n\u2013 <span  style=\"font-weight: 600;\">Camera-Ready Deadline<\/span>: April 20, 2026<br ><br >The submission guidelines valid for the workshop are the same as for the ISCS conference. \n<br >They can be found at <a data-mce-href=\"..\/submissions\/\" href=\"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/submissions\" target=\"_self\" data-mce-selected=\"inline-boundary\" data-cp-link=\"1\" rel=\"noopener noreferrer\">https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/submissions\/<\/a><\/p><\/div> <\/div> <div  class=\"row center-xs middle-xs\"> <div  class=\"col-sm-9\" data-type=\"column\"> <\/div> <\/div><\/div> <\/div>","protected":false},"excerpt":{"rendered":"<p>3nd Workshop on Complex Network Sparsification &amp; BeyondGraphs, also called networks, are everywhere: social interactions, protein-protein interactions, chemical molecules, transportation networks, are all graphs. Most of these networks are complex either by their size or by the entanglement of the links that compose them, or by both. This makes their analysis very challenging. To address&hellip; <br \/> <a class=\"read-more\" href=\"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/complex-network-sparsification\/\">Lire la suite<\/a><\/p>\n","protected":false},"author":7,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"pro\/page-templates\/full-width-page.php","meta":{"footnotes":""},"class_list":["post-2487","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/pages\/2487","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/comments?post=2487"}],"version-history":[{"count":16,"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/pages\/2487\/revisions"}],"predecessor-version":[{"id":3646,"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/pages\/2487\/revisions\/3646"}],"wp:attachment":[{"href":"https:\/\/iutdijon.u-bourgogne.fr\/ccs-france\/wp-json\/wp\/v2\/media?parent=2487"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}