Proud of Denisa Arsene for presenting us and our work at the Complex Networks conference last week. She had a lot of engagement during her presentation, and made a ton of cool new science friends from all over the world 🤓 🌟

Key contribution: SANA (simulated annealing for network anonymisation), an algorithm that makes small alterations to social networks to protect the people in the network from de-anonymization attacks.

Motivation: Facilitating data sharing between social scientists while preserving the privacy of the people who were part of those studies.

More info, including preprint and poster (with ALT): https://latower.github.io/posts/2025/11/sana/

#Science #Research #ComputerScience #AI #StudentLife #Networking #SciComm #SocialNetworkAnalysis #Algorithmics #SimulatedAnnealing #AcademicMastodon #AcademicChatter #CombinatorialOptimisation #CombinatorialOptimization

The new algorithm for directed cheapest routes "slices the graph into layers, moving outward from the source like Dijkstra’s. But rather than deal with the whole frontier at each step, it uses the Bellman-Ford algorithm to pinpoint influential nodes, moves forward from these nodes to find the shortest paths to others, and later comes back to other frontier nodes. It doesn’t always find the nodes within each layer in order of increasing distance, so the sorting barrier doesn’t apply. And if you chop up the graph in the right way, it runs slightly faster than the best version of Dijkstra’s algorithm. It’s considerably more intricate, relying on many pieces that need to fit together just right. But curiously, none of the pieces use fancy mathematics."

https://www.quantamagazine.org/new-method-is-the-fastest-way-to-find-the-best-routes-20250806/

#graphTheory #shortestPath #navigation #networks #computing #CS #computerScience #algorithmics #algorithmic #algorithms #algorithm

New Method Is the Fastest Way To Find the Best Routes | Quanta Magazine

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Quanta Magazine

Hi everyone,

I feel like a re-introduction is long overdue!

My name is Anna, and I'm an assistant professor of Algorithmics at the Delft University of Technology, specialising in combinatorial optimisation, symbolic AI, constraint programming, propositional model counting, operations research and reasoning under uncertainty.

I'm a nerd, a feminist and a traveller, not always in that order.

In my spare time I like to hike and go geocaching. I try to go swing dancing a few times a week. I am a Trekkie. I want to learn how to draw. I am an Indomie and Obsidian enthusiast. Based in the Netherlands, I miss Belgium, Canada and Singapore.

Since a job in academia somehow always is personal, I have chosen to mix professional interactions with the more personal ones on this platform. At least for now. Obviously, my opinions do not necessarily reflect those of my employer yadiyadiyada.

Hope to keep interacting with you all!

#Introduction #AcademicMastodon #Algorithmics #SymbolicAI #CombinatorialOptimisation #ConstraintProgramming #ModelCounting #OperationsResearch #ProbabilisticInference #Geocaching #LindyHop #Jazz #SwingDancing #Hiking #Obsidian #StarTrek #Travel #TUDelft #MastoMiGoreng #Indomie #GNUTerryPratchett #Catstodon #Mastocats #Caturday #ExpatLife #MakanApaToda

2/n Very much like this visualisation presented by Frank Phillipson (based on a fig from Caceres-Cruz et al., 2014) of solvers for optimisation problems. Might try to use this or something like it in the course on algorithm for NP-hard problems that I am involved in.

#Algorithms #Algorithmics #CombinatorialOptimisation #CombinatorialOptimization #Optimisation #Optimization #SIGAlgo #SIGAlgo24 #ComputerScience

#HelloESR I'm a Senior/Expert Research Engineer in #Bioinformatics. I've been working as a researcher in hybrid #AI #Algorithmics (i.e. #metaheuristic optimization) for 20 years, but I'm now interested in engineering Semantic Knowledge Graphs stuff into Decision Support Systems & #ExplainableAI #XAI.

I compute Biomedicine against #Cancer at Institut Pasteur.

I'm the #ParadisEO (an optim framework), #Oncodash (tumor board #DSS), and #OntoWeaver (easy creation of #SKG on top of #BioCypher) maintainer.

Gestion du risque : IBM vide une partie de son portefeuille #algorithmics #silicon https://www.silicon.fr/gestion-risque-ubm-algorithmics-262039.html
Gestion du risque : IBM vide une partie de son portefeuille Algorithmics | Silicon

IBM lâche une part supplémentaire de son portefeuille Algorithmics (gestion du risque), vendue à SS&C.

Silicon