new papers

Author: frasil

index.html

@@ -85,6 +85,7 @@ <h3 class="mb-0">Postdocs and PhD students</h3>
                     <ul>
                       <li>Cristian Boldrin (Ph.D student)</li>
                       <li><a href="https://it.linkedin.com/in/fabrizio-boninsegna">Fabrizio Boninsegna (Phd student)</a></li>
+                      <li>Paolo Bresolin (Ph.D student)</li>
                       <li>Antonio Collesei (Phd student)</li>
 		      <li>Francesco Pio Monaco (Research collaborator)</li>
                       <li>Dario Simionato (PhD student)</li>
@@ -108,12 +109,27 @@ <h3 class="mb-0">Postdocs and PhD students</h3>
                 <div class="resume-section-content">
                     <h2 class="mb-5">Recent Publications</h2>
 <!-- PUBS -->
-<h3 class="mb-0">2023</h3><ul>
-<li>Leonardo Pellegrina, Fabio Vandin <emph><a href="https://doi.org/10.1145/3628601">SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds</a></emph> ACM Trans. Knowl. Discov. Data</li>
-<li>Andrea Tonon, Fabio Vandin <emph><a href="https://doi.org/10.1007/s10115-022-01800-7">caSPiTa: mining statistically significant paths in time series data from an unknown network.</a></emph> Knowl. Inf. Syst.</li>
+<h3 class="mb-0">2024</h3><ul><li>Adam Charane, Matteo Ceccarello, Johann Gamper <emph><a href="https://doi.org/10.1007/978-3-031-68323-7_19">Comparison of Measures for Characterizing the Difficulty of Time Series Classification.</a></emph> DaWaK</li>
+<li>Adam Charane, Matteo Ceccarello, Johann Gamper <emph><a href="https://ceur-ws.org/Vol-3653/paper4.pdf">Shapelets Evaluation using Silhouettes for Time Series Classification.</a></emph> DOLAP</li>
+<li>Aristides Gionis, Lutz Oettershagen, Ilie Sarpe <emph><a href="https://doi.org/10.1145/3589335.3641245">Mining Temporal Networks.</a></emph> WWW</li>
+<li>Dario Simionato, Fabio Vandin <emph><a href="https://doi.org/10.1007/s10618-024-01069-0">Bounding the family-wise error rate in local causal discovery using Rademacher averages.</a></emph> Data Min. Knowl. Discov.</li>
+<li>Enrico Dandolo, Alessio Mazzetto, Andrea Pietracaprina, Geppino Pucci <emph><a href="https://doi.org/10.1016/j.jpdc.2024.104966">MapReduce algorithms for robust center-based clustering in doubling metrics.</a></emph> J. Parallel Distributed Comput.</li>
+<li>Ilie Sarpe, Fabio Vandin, Aristides Gionis <emph><a href="https://doi.org/10.1145/3637528.3671889">Scalable Temporal Motif Densest Subnetwork Discovery.</a></emph> KDD</li>
+<li>Leonardo Pellegrina, Fabio Vandin <emph><a href="https://www.vldb.org/pvldb/vol17/p2668-vandin.pdf">Efficient Discovery of Significant Patterns with Few-Shot Resampling.</a></emph> Proc. VLDB Endow.</li>
+<li>Leonardo Pellegrina, Fabio Vandin <emph><a href="https://doi.org/10.1145/3628601">SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Bounds.</a></emph> ACM Trans. Knowl. Discov. Data</li>
+<li>Leonardo Pellegrina, Fabio Vandin <emph><a href="https://doi.org/10.1145/3637528.3671989">Scalable Rule Lists Learning with Sampling.</a></emph> KDD</li>
+<li>Lorenzo Padoan, Francesco Silvestri , Bruno Zamengo <emph><a href="https://doi.org/10.1145/3678717.3691270">Mapping Passenger Trajectories to Train Schedules - industrial paper.</a></emph> SIGSPATIAL/GIS</li>
+<li>Lorenzo Padoan, Margherita Cesetti, Luca Brunello, Marco Antonelli, Bruno Zamengo, Francesco Silvestri  <emph><a href="https://doi.org/10.1109/MDM61037.2024.00061">Mobility ChatBot: supporting decision making in mobility data with chatbots.</a></emph> MDM</li>
+<li>Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci <emph><a href="https://doi.org/10.1145/3589334.3645568">Fast and Accurate Fair k-Center Clustering in Doubling Metrics.</a></emph> WWW</li>
+<li>Paolo Sylos Labini, Andrej Jurco, Matteo Ceccarello, Stefano Guarino, Enrico Mastrostefano, Flavio Vella <emph><a href="https://doi.org/10.1109/PDP62718.2024.00021">Scaling Expected Force: Efficient Identification of Key Nodes in Network-Based Epidemic Models.</a></emph> PDP</li>
+<li>Riko Jacob, Francesco Silvestri  <emph><a href="https://doi.org/10.1007/978-3-031-73257-7_3">Unplugging Dijkstra&apos;s Algorithm as a Mechanical Device.</a></emph> CMSC</li></ul>
+<h3 class="mb-0">2023</h3><ul><li>Andrea Tonon, Fabio Vandin <emph><a href="https://doi.org/10.1007/s10115-022-01800-7">caSPiTa: mining statistically significant paths in time series data from an unknown network.</a></emph> Knowl. Inf. Syst.</li>
 <li>Dario Simionato, Fabio Vandin <emph><a href="https://doi.org/10.24963/ijcai.2023/726">Bounding the Family-Wise Error Rate in Local Causal Discovery Using Rademacher Averages (Extended Abstract).</a></emph> IJCAI</li>
 <li>Enrico Dandolo, Andrea Pietracaprina, Geppino Pucci <emph><a href="https://doi.org/10.1007/978-3-031-39698-4_32">Distributed k-Means with Outliers in General Metrics.</a></emph> Euro-Par</li>
+<li>Fabrizio Boninsegna <emph><a href="https://ceur-ws.org/Vol-3478/paper56.pdf">Locality Sensitive Hashing of Trajectories Under Local Differential Privacy.</a></emph> SEBD</li>
 <li>Leonardo Pellegrina <emph><a href="https://doi.org/10.1145/3580305.3599325">Efficient Centrality Maximization with Rademacher Averages.</a></emph> KDD</li>
+<li>Martin Aumüller , Matteo Ceccarello <emph><a href="http://sites.computer.org/debull/A23sept/p89.pdf">Recent Approaches and Trends in Approximate Nearest Neighbor Search, with Remarks on Benchmarking.</a></emph> IEEE Data Eng. Bull.</li>
+<li>Martin Aumüller , Matteo Ceccarello <emph><a href="https://doi.org/10.1007/978-3-031-46994-7_17">Solving k-Closest Pairs in High-Dimensional Data.</a></emph> SISAP</li>
 <li>Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Federico Soldà <emph><a href="https://doi.org/10.1186/s40537-023-00717-4">Scalable and space-efficient Robust Matroid Center algorithms.</a></emph> J. Big Data</li>
 <li>Matteo Ceccarello, Anton Dignös, Johann Gamper, Christina Khnaisser <emph><a href="https://doi.org/10.1145/3603719.3603732">Indexing Temporal Relations for Range-Duration Queries.</a></emph> SSDBM</li>
 <li>Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci <emph><a href="https://doi.org/10.1007/978-3-031-38906-1_41">Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics.</a></emph> WADS</li>
@@ -160,11 +176,11 @@ <h3 class="mb-0">2020</h3><ul><li>Andrea Tonon, Fabio Vandin <emph><a href="http
 <li>Martin Aumüller , Rasmus Pagh, Francesco Silvestri  <emph><a href="https://doi.org/10.1145/3375395.3387648">Fair Near Neighbor Search: Independent Range Sampling in High Dimensions.</a></emph> PODS</li>
 <li>Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci <emph><a href="https://doi.org/10.1145/3402448">A General Coreset-Based Approach to Diversity Maximization under Matroid Constraints.</a></emph> ACM Trans. Knowl. Discov. Data</li>
 <li>Matteo Ceccarello, Andrea Pietracaprina, Geppino Pucci, Eli Upfal <emph><a href="https://doi.org/10.3390/a13090216">Distributed Graph Diameter Approximation.</a></emph> Algorithms</li>
-<li>Matteo Riondato, Fabio Vandin <emph><a href="https://doi.org/10.1145/3385653">MiSoSouP: Mining Interesting Subgroups with Sampling and Pseudodimension.</a></emph> ACM Trans. Knowl. Discov. Data</li>
 <li>Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci <emph><a href="https://doi.org/10.1109/DSAA49011.2020.00032">Dimensionality-adaptive k-center in sliding windows.</a></emph> DSAA</li>
 <li>Rezaul Chowdhury, Francesco Silvestri , Flavio Vella <emph><a href="https://doi.org/10.1145/3350755.3400252">A Computational Model for Tensor Core Units.</a></emph> SPAA</li>
 <li>Thomas D. Ahle, Francesco Silvestri  <emph><a href="https://doi.org/10.1007/978-3-030-60936-8_6">Similarity Search with Tensor Core Units.</a></emph> SISAP</li>
-<li>Yoo-Ah Kim, D. Wojtowicz, R. Sarto Basso, I. Sason, W. Robinson, D. S. Hochbaum, M. Leiserson, R. Sharan, F. Vandin, T. Przytycka. <emph><a href="https://pubmed.ncbi.nlm.nih.gov/32471470/">Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer</a></emph> Genome Medicine</li></ul>
+<li>Yoo-Ah Kim, D. Wojtowicz, R. Sarto Basso, I. Sason, W. Robinson, D. S. Hochbaum, M. Leiserson, R. Sharan, F. Vandin, T. Przytycka. <emph><a href="https://pubmed.ncbi.nlm.nih.gov/32471470/">Network-based approaches elucidate differences within APOBEC and clock-like signatures in breast cancer</a></emph> Genome Medicine</li>
+<li>Yoo-Ah Kim, R. Sarto Basso, D. Wojtowicz, A. S. Liu, D. S. Hochbaum, F. Vandin, T. Przytycka <emph><a href="https://pubmed.ncbi.nlm.nih.gov/33089107/">Identifying Drug Sensitivity Subnetworks with NETPHIX</a></emph> iScience</li></ul>
 <!-- PUBS -->
             </section>
             <hr class="m-0" />

manual_pubs.json

@@ -92,10 +92,10 @@
       "F. Vandin",
       "T. Przytycka"
     ],
-    "key": "KimetAl2020",
+    "key": "KimetAl2020b",
     "title": "Identifying Drug Sensitivity Subnetworks with NETPHIX",
     "url": "https://pubmed.ncbi.nlm.nih.gov/33089107/",
     "venue": "iScience",
     "year": "2020"
   }
-]
+]

update-papers.py

@@ -71,7 +71,7 @@ def format_year(pubs, year):
 def format_all(pubs):
     formatted = [
         format_year(pubs, str(year))
-        for year in reversed(range(2020, 2026))
+        for year in reversed(range(2020, 2025))
     ]
     return "\n".join(formatted)