<?xml version="1.0" encoding="utf-8"?><feed xmlns="http://www.w3.org/2005/Atom" ><generator uri="https://jekyllrb.com/" version="3.10.0">Jekyll</generator><link href="https://latower.github.io/feed.xml" rel="self" type="application/atom+xml" /><link href="https://latower.github.io/" rel="alternate" type="text/html" /><updated>2026-05-01T11:05:17+02:00</updated><id>https://latower.github.io/feed.xml</id><title type="html">anna latour</title><subtitle>personal description</subtitle><author><name>dr. anna latour</name></author><entry><title type="html">Fatemeh Jafari joins the team</title><link href="https://latower.github.io/posts/2026/04/fatemeh/" rel="alternate" type="text/html" title="Fatemeh Jafari joins the team" /><published>2026-04-21T00:00:00+02:00</published><updated>2026-04-21T00:00:00+02:00</updated><id>https://latower.github.io/posts/2026/04/fatemeh</id><content type="html" xml:base="https://latower.github.io/posts/2026/04/fatemeh/"><![CDATA[<p>Welcome to Fatemeh Jafari, the second doctoral student to join my team! I will co-supervise her with <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/applied-mathematics/people/dr-f-fabian-mies">dr. Fabian Mies</a> (<a href="https://www.tudelft.nl/en/eemcs/the-faculty/departments/applied-mathematics/">Delft Institute of Applied Mathematics</a>) and <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics/people/mathijs-de-weerdt">prof. dr. Mathijs de Weerdt</a> during her 4-year PhD journey at the <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics">Algorithmics section</a>.</p>

<p><img src="/images/2026/2026-04-20_fatemeh_25percent.jpg" alt="Casual photo of a young woman wearing sunglasses, a wine-red rain coat and a matching hijab. She's smiling at the camera, in front of a white palace with a copper-green roof, with a circular pond and carefully manicured lawn, decorated with colourful flowers." class="align-center" /></p>

<h2 id="about-fatemeh">About Fatemeh</h2>
<p>Fatemeh obtained her Bachelor’s degree in Electrical Engineering at the Sharif University of Technology in Tehran, Iran, and her Master’s degree in Communications and Electronics Engineering at the Technical University of Munich, Germany. She conducted her Master’s research on the topic of Reliable Wireless Communication Strategies in collaboration with BMW, under supervision of dr. Fidan Mehmeti (TUM) and dr. Luca Parolini (BMW).</p>

<p>Her interest in logical circuits, mathematical methods and artificial intelligence, as well as her demonstrated experience working on optimisation problems that are formulated probabilistic networks, make her an ideal candidate to join me during the four years of my <a href="/posts/2025/07/veni/">Veni project</a> on identifying important variables in probabilistic decision-making problems.</p>

<p>Fatemeh has already built a strong network of industrial contacts through her internships with, among others, Texas Instruments and BMW. This makes her a great addition to TU Delft in particular, since we value collaboration with industrial partners.</p>

<p>She has also demonstrated a dedication to building strong academic communities, by founding and hosting her own <a href="https://www.youtube.com/FTMedia">YouTube show</a>, as well as founding the <a href="https://www.youtube.com/SharifEE">YouTube Channel of the Department of Electical Engineering of Sharif University of Technology</a>. This commitment to community is also reflected in the mentorship and teaching assistant roles that she fulfilled as a student. I’m looking forward to seeing her grow in the role of mentor by co-supervising student projects with her.</p>

<p>During the interviews and the months leading up to her arrival in Delft, I’ve gotten to know Fatemeh a calm, intelligent, and motivated student with the ability to very quickly absorb new information. This sets her up for success in this collaboration between the <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology">Software Technology department</a> and the <a href="https://www.tudelft.nl/en/eemcs/the-faculty/departments/applied-mathematics/">Delft Institute of Applied Mathematics</a>. I am excited to welcome her to the team, and to see what she will make of the collaboration with our colleagues from Mathematics during the coming four years.</p>]]></content><author><name>dr. anna latour</name></author><category term="news" /><category term="collaboration" /><category term="formal methods" /><category term="combinatorial optimisation" /><category term="reasoning under uncertainty" /><category term="PhDLife" /><summary type="html"><![CDATA[Welcome to Fatemeh Jafari, the second doctoral student to join my team! I will co-supervise her with dr. Fabian Mies (Delft Institute of Applied Mathematics) and prof. dr. Mathijs de Weerdt during her 4-year PhD journey at the Algorithmics section.]]></summary></entry><entry><title type="html">Bruna Bazaluk joins the team</title><link href="https://latower.github.io/posts/2026/04/bruna/" rel="alternate" type="text/html" title="Bruna Bazaluk joins the team" /><published>2026-04-01T00:00:00+02:00</published><updated>2026-04-01T00:00:00+02:00</updated><id>https://latower.github.io/posts/2026/04/bruna</id><content type="html" xml:base="https://latower.github.io/posts/2026/04/bruna/"><![CDATA[<p>Welcome to <a href="https://www.ime.usp.br/~bazaluk/">Bruna Bazaluk</a>, the first doctoral student to join my team! I will co-supervise her with <a href="https://www.tudelft.nl/staff/s.e.verwer/">dr. Sicco Verwer</a> during her 4-year PhD journey at the <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics">Algorithmics section</a>.</p>

<p><img src="/images/2026/2026-04-01_bruna_25percent.jpg" alt="Casual photo of a young woman with very dark brown hair, wearing wine-red glasses and a denim jacket. She's smiling at the camera, in front of the cupola of an astronomical observatory against a clear blue sky." class="align-center" /></p>

<h2 id="about-bruna">About Bruna</h2>
<p>Bruna obtained her Bachelor’s and Master’s degrees in Computer Science at the University of São Paulo, Brazil. She conducted her Master’s research on the topic of Large Language Models and Causality, under supervision of Prof. Flávio Soares Corrêa da Silva (University of São Paulo), Prof. Denis D. Mauá (University of São Paulo) and Dr. Benjie Wang (UCLA).</p>

<p>Her interest in tractable probabilistic models and causal discovery and inference make her an ideal candidate to join me during the four years of my <a href="/posts/2025/07/veni/">Veni project</a> on identifying important variables in probabilistic decision-making problems.</p>

<p>Bruna has demonstrated a commitment to improving the culture in our scientific community, by organising the QueerInAI workshop at NeurIPS 2024 in Vancouver, Canada, and speaking about the benefits of a local community of FLOSS contributors at DebConf 2019 in Curitiba, Brazil. She has already built a strong international network through research visits at the StarAI lab at UCLA and the Copenhagen Causality Lab in Denmark, and through all the international workshops and conferences she attended to present her work.</p>

<p>In addition to her strong technical background and dedication to the community, Bruna also brings a passion for computer science education. She has already published on source code plagiarism<sup id="fnref:1" role="doc-noteref"><a href="#fn:1" class="footnote" rel="footnote">1</a></sup> and course scheduling<sup id="fnref:2" role="doc-noteref"><a href="#fn:2" class="footnote" rel="footnote">2</a></sup>, and has ample experience as a teaching assistant. I’m looking forward to co-supervising student projects with her.</p>

<p>During the interviews and the months leading up to her arrival in Delft, I’ve gotten to know Bruna as an intelligent, enthusiastic go-getter with a wide range of interests. I am confident that she will make a great addition to my team, and to the Algorithmics section as a whole. I am excited to see where her research and drive will bring her during the coming four years.</p>

<h2 id="footnotes">Footnotes</h2>

<div class="footnotes" role="doc-endnotes">
  <ol>
    <li id="fn:1" role="doc-endnote">
      <p>B. Bazaluk, F. S. C. da Silva, M. Holanda, and D. D. Silva, ‘Source Code Plagiarism in Computer Science Courses: Facts and Impressions’, in Workshop sobre Educação em Computação (WEI), SBC, Aug. 2023, pp. 111–121. doi: 10.5753/wei.2023.230066. <a href="#fnref:1" class="reversefootnote" role="doc-backlink">&#8617;</a></p>
    </li>
    <li id="fn:2" role="doc-endnote">
      <p>A. Lima et al., ‘LUNCH: an answer set programming system for course scheduling’, in Anais do Encontro Nacional de Inteligência Artificial e Computacional (ENIAC). Sep. 2023, pp. 954–968. doi: 10.5753/eniac.2023.234540. <a href="#fnref:2" class="reversefootnote" role="doc-backlink">&#8617;</a></p>
    </li>
  </ol>
</div>]]></content><author><name>dr. anna latour</name></author><category term="news" /><category term="formal methods" /><category term="combinatorial optimisation" /><category term="reasoning under uncertainty" /><category term="PhDLife" /><summary type="html"><![CDATA[Welcome to Bruna Bazaluk, the first doctoral student to join my team! I will co-supervise her with dr. Sicco Verwer during her 4-year PhD journey at the Algorithmics section.]]></summary></entry><entry><title type="html">Announcement: Denisa Arsene will present our work at Complex Networks</title><link href="https://latower.github.io/posts/2025/11/sana/" rel="alternate" type="text/html" title="Announcement: Denisa Arsene will present our work at Complex Networks" /><published>2025-11-29T00:00:00+01:00</published><updated>2025-11-29T00:00:00+01:00</updated><id>https://latower.github.io/posts/2025/11/sana</id><content type="html" xml:base="https://latower.github.io/posts/2025/11/sana/"><![CDATA[<p>On 9 December 2025, my student <a href="https://www.linkedin.com/in/denisa-arsene-912bb628b/">Denisa Arsene</a> will present <a href="/publication/2025-12-01-A-Simulated-Annealing-Approach-to-Social-Network-Anonymization-to-appear">our work</a> on social network anonymisation at the <a href="https://complexnetworks.org/">14th International Conference on Complex Networks and their Applications</a>, held in Binghamton, New York, USA!</p>

<h2 id="the-idea">The idea</h2>

<p>Social scientists produce social network data. In order to share that data with other scientists, they must ensure that the identity of the actual people in the networks is protected. Simple pseudonymisation is typically not enough, because the neighbourhoods of individuals (nodes) in the network (<em>i.e.</em>, what their friend group looks like) can be so unique as to leak information about their identity. After all, a lot of online social networking sites allow users to query details about other users’ connections on the social networking site.</p>

<p>Hence, some form of <em>anonymisation</em> is needed before social network data can be shared. This <em>network anonymisation</em> process typically consists of making subtle changes to the network to ensure that no individual has unique features. This particular criterion is called <em>2-anonymity</em>, meaning that for each node, there exists at least one other node (and hence: person) with the same exact features.</p>

<p>In our work, we focus <em>edge deletion</em>: given a budget of a number of edge deletions, we try to remove those edges that maximise the number of nodes that are 2-anonymous w.r.t. features that characterise how many connections each node has (the number of friends of the person represented by the node), and how many incident triangles the node has (how many friend relationships there are between friends of the person). This particular measure strikes a good balance between other popular measures that are either very expensive to compute, or too trivial to be a real threat.</p>

<p>In our approach, we choose for simulated annealing; a metaheuristic that uses stochastic search to first focus on exploring the search space, and then gradually shifts its focus to exploiting promising areas. We call our approach <em>SANA</em> (Simulated Annealing for Network Anonymisation). Our findings indicate that SANA tends to achieve better anonymisation (up to 18$times$ more $2$-anonymous nodes) than other heuristic algorithms with similar running times. When looking at other quality measures, related to how well the algorithm preserves key network properties, we find that SANA performs comparably to the SotA.</p>

<h2 id="the-collaboration">The collaboration</h2>

<p>A year and a half or so ago, two of my former colleagues from Leiden University, <a href="https://franktakes.nl/">dr. Frank F. Takes</a> and <a href="https://www.universiteitleiden.nl/en/staffmembers/1/rachel-de-jong#tab-1">Rachel G. De Jong</a>, and I decided to explore collaborations on the topic of social network anonymisation. After all, I had been working on uniquely identifying nodes in networks (<a href="/publication/2023-01-01-Solving-the-Identifying-Code-Set-Problem-with-Grouped-Independent-Support">LSM2023</a>, <a href="/publication/2024-07-01-The-Cardinality-of-Identifying-Code-Sets-for-Soccer-Ball-Graph-with-Application-to-Remote-Sensing-preprint">LSB+2024</a>), so it seemed only natural to me that I could apply the tricks that I used in that work to the <em>opposite</em> problem.</p>

<p>That turned out to be somewhat optimistic, but we decided to explore this topic further anyway, and I wrote a proposal for a BSc thesis project to explore network anonymisation, with Frank and Rachel as external advisors.</p>

<p>Denisa and four fellow students chose/were assigned to (it’s complicated) that project, and we spent 10 weeks exploring the topic from different angles. You can find posters that summarise their projects on <a href="https://cse3000-research-project.github.io/2025/Q4">this website</a> (Ctrl+F for “Network anonymization for science”). Frank, Rachel, Denisa and I ended up turning Denisa’s project into a research paper, and submitted it to the <a href="https://complexnetworks.org/">Complex Networks</a> conference.</p>

<h2 id="denisas-poster">Denisa’s poster</h2>

<p>The paper was accepted, so Denisa will travel to Binghamton, New York, USA to present our work to the community during a poster presentation! Many thanks to all of my (former) students who gave feedback on her poster and her pitch!</p>

<h2 id="acknowledgements">Acknowledgements</h2>
<p>We thank Denisa’s team mates, Andrei Ioniţă, Jakub Matyja, Mike J.J.S. Erkemeij, and Emke de Groot for their constructive feedback and discussions. We also thank the anonymous reviewers for their valuable comments that helped us improve the manuscript. Finally, we thank the TU Delft University Fund that, through their <a href="https://www.tudelft.nl/fast">FAST programme</a> has funded part of Denisa’s trip to the USA.</p>

<p><a href="/files/poster/ArsEtAl25.pdf"><img src="/images/2025/2025-11-29_SANA_poster.png" alt="Poster presenting the highlights of the research in the corresponding paper. Eyecatcher is a big vertical orange banner with the text: 'How to share research-relevant social netowrk data, while preserving privacy? SANA Simulated Annealing for Network Anonymization. Minimal changes. Maximal privacy. Up to 18 times more anonymized nodes. Same speed. Same data utility. It features diagrams that illustrate a type of attack model that is based on characteristics of the direct neighbourhood of nodes. It also has an example plot of how a simulated annealing approach converges to a particular level of anonymity. It then has a bunch of plots that give more details on running time, level of anonymization, and how SANA and the other algorithms perform in terms of data utility. The takeaways are that SANA provides fast and better anonymization and that it scales better with input size than the other algorithms studied here. Next challenges are to tackle multi-objective anonymity and utiliyt, and dynamic (real-time) anonymization." /></a></p>]]></content><author><name>dr. anna latour</name></author><category term="talk" /><category term="conference" /><category term="news" /><category term="research" /><category term="combinatorial optimisation" /><summary type="html"><![CDATA[On 9 December 2025, my student Denisa Arsene will present our work on social network anonymisation at the 14th International Conference on Complex Networks and their Applications, held in Binghamton, New York, USA!]]></summary></entry><entry><title type="html">ASK: Should I explain this?</title><link href="https://latower.github.io/posts/2025/11/ASK-should-I-explain-this/" rel="alternate" type="text/html" title="ASK: Should I explain this?" /><published>2025-11-22T00:00:00+01:00</published><updated>2025-11-22T00:00:00+01:00</updated><id>https://latower.github.io/posts/2025/11/ASK-should-i-explain-this</id><content type="html" xml:base="https://latower.github.io/posts/2025/11/ASK-should-I-explain-this/"><![CDATA[<p>Figuring out how much detail you should provide in your reports and presentations is tricky. Ask and answer three questions to gauge at which level you should explain things.</p>

<h2 id="expertise">Expertise</h2>

<p>One thing I notice about my students’ writing, is that they include a lot of technical terms that they don’t explain. I find that one of the reasons for this is that the students assume that the reader is familiar with those technical terms, so they don’t need to explain. In part, this might be due to the students not realising how quickly they gain very specific expertise while working on a research project:</p>

<table>
  <thead>
    <tr>
      <th style="text-align: center"><img src="https://imgs.xkcd.com/comics/average_familiarity.png" alt="xkcd webcomic: a single-panel comic that shows Ponytail and Cueball in conversation. Ponytail: &quot;Silicate chemistry is second nature to us geochemists, so it's easy to forget that the average person probably only knows the formulas for olivine and one or two feldspars.&quot; Cueball: &quot;And quartz, of course.&quot; Ponytail: &quot;Of course.&quot; Caption below the panel: &quot;Even when they're trying to compensate for it, experts in anything wildly overestimate the average person's familiarity with their field.&quot;" /></th>
    </tr>
  </thead>
  <tbody>
    <tr>
      <td style="text-align: center"><em>Source: <a href="https://xkcd.com/2501/">xkcd 2501</a>, copyright: Randall Munroe</em>.</td>
    </tr>
  </tbody>
</table>

<p>It’s my job to help my students figure out who their audience is and how to adjust their communication to that audience. That’s what this post is about.</p>

<h2 id="who-is-my-audience">Who is my audience?</h2>

<p>This is really the key question you should be asking whenever you are communicating. Whether it is a project report, a presentation, or even a meeting with your adviser.</p>

<p>Once upon a time I was an editor for <a href="https://www.sterrenkunde.nl/jwg/universum/"><em>Universum</em></a>, an astronomy magazine for kids. My fellow editors and I were always looking for ways to improve our skills. This led to us taking a writing class with <a href="https://www.schrijven-bij-de-overheid.nl/over-jet-sebus-2/">Jet Sebus</a>, who specialises in teaching experts how to write for laypeople. Exactly what we needed.</p>

<p>She taught us to always ask (and answer!) the following questions:</p>
<ol>
  <li>Who is my reader?</li>
  <li>What does my reader know/think/believe/want/do before reading my text?</li>
  <li>What should my reader know/think/believe/want/do after reading my text?</li>
</ol>

<p>This generalises to other forms of communication (such as presentations and meetings), so I would suggest that you replace “reader” with “audience”.</p>

<h2 id="example-robin">Example: Robin</h2>

<p>As an example of how to answer these questions, let’s consider Robin:</p>

<blockquote>
  <p>Robin is a 3rd-year Bachelor student at Delft University of Technology, majoring in <a href="https://www.tudelft.nl/en/onderwijs/opleidingen/bachelors/computer-science-and-engineering/bachelor-of-computer-science-and-engineering">Computer Science and Engineering</a>. During their second year, Robin chose the Data track for their Variant Courses. During their third year, Robin did a minor on Offshore Wind Energy at the Faculty of Aerospace Engineering. Robin’s final project before getting their diploma is a 10-week research project. At the end of this project Robin has to present their findings in a report and a presentation.</p>
</blockquote>

<p>All the students who I supervised for the Research Project (RP) struggled with deciding what to include and what to leave out in their reports and presentations. When that happens, I advise them to ask and answer the above questions. Let’s answer those questions together for Robin’s RP report.</p>

<h3 id="who-is-robins-reader">Who is Robin’s reader?</h3>

<p>This is a tricky one. After all: anyone might read Robin’s report and the presentations public events. Hence, Robin’s audience includes their supervisor, their external examiner, their fellow students, and maybe their friends and family. Quite a wide range. However, in academic educational settings, <em>generally speaking</em>, the expectation is that you write or present for your peers. That narrows it down.</p>

<p>In this case, Robin’s peers are fellow 3rd-year Bachelor students who did the same Computer Science program, but may not have chosen the same Variant Courses track, likely did not do the same minor, and definitely did not do the same research project as Robin.</p>

<h3 id="what-do-robins-peers-knowthinkbelievewantdo-before-reading-robins-rp-report">What do Robin’s peers know/think/believe/want/do before reading Robin’s RP report?</h3>

<p>Robin can reasonably assume that their peers have retained at least some knowledge from the courses that are in the main curriculum. Anything topic-specific that Robin had to learn during their project should be considered as unknown to their peers.</p>

<p>Without having specified a particular project, we cannot write specifics for the knowing/thinking/believing/wanting/doing part of the question. Furthermore, since Robin’s peers may not even have heard of the problem that Robin studied or the techniques they used, it is unlikely that Robin’s peers have any thoughts on that problem or those techniques at all. Hence, in answering this question it makes sense to stick to very high-level concepts that usually relate to the (potential) societal impact of Robin’s work. Familiarity with specific societal challenges will help motivate Robin’s work. Furthermore, we should consider which specific problems or techniques Robin’s audience should really know about and why. This helps Robin decide on what to include and exclude from their writing.</p>

<p>Below are some examples of statements that reflect what Robin’s peers might know/think/believe/want/do before reading Robin’s report, based on real student projects that I supervised over the last academic year. They are based on personal experience of Robin’s peers, on their general knowledge about the world, and on specific knowledge that they may have picked up in their classes:</p>

<ul>
  <li>Probabilistic inference is computationally expensive.</li>
  <li>Personal privacy is important. Social science is important.</li>
  <li>Launching satellites is expensive.</li>
  <li>I want to get enough sleep, but I have way too many lectures that start at 8:45 am.</li>
  <li>I try to eat well, but planning a weekly menu that is nutritious and affordable takes way too long.</li>
</ul>

<h3 id="what-should-robins-peers-knowthinkbelievedo-after-reading-robins-rp-report">What should Robin’s peers know/think/believe/do after reading Robin’s RP report?</h3>

<p>Generally speaking, we want academic texts to be <em>standalone</em>. Conceptually, this means that we want a member of the intended audience to be able to understand the main message of the text without having to read additional sources or appendices. Concretely, this means that a reader should be able to write a summary of the text. That summary should include answers to the “What, why, and how?” of the research.</p>

<p>It is Robin’s responsibility to include the information that the reader needs to be able to write that summary. Answering the question of what their reader should know <em>after</em> reading Robin’s report, combined with the answer to what they know <em>before</em> reading it, helps Robin to identify which <em>knowledge gap</em> they must fill.</p>

<p>Recall the example statements above, reflecting what Robin’s peers know/think/believe/want/do before reading their report. Below are companion statements for what they should know/think/believe/want/do <em>after</em> reading Robin’s report:</p>

<ul>
  <li>Weighted model counting and knowledge compilation make probabilistic inference fast in practice.</li>
  <li>In order to study social phenomena, researchers need access to social network data. Sharing social network data for research can compromise the privacy of the people in those networks.</li>
  <li>There are several exact combinatorial solving methods that can compute the smallest number of satellites that we need for the task of monitoring the Earth for disasters.</li>
  <li>A clever implementation of a simulated annealing algorithm can come up with a lecture roster that better accommodates students’ preferences.</li>
  <li>By using integer linear programming techniques we can automate the task of coming up with varied and frugal weekly menus.</li>
</ul>

<p>Having a list of what the audience knows and a list of what the audience should know after reading Robin’s report should help them answer the central question of this blog post: <em>“Should I explain this?”</em> If it is something that the audience can be expected to know: no. If it is something the audience cannot be expected to know, but is on the list of things they <em>should</em> know: yes. Finally, Robin may have to explain things that are not on the list of things the audience should know, but will help Robin bridge the knowledge gap for something that <em>is</em> on the list.</p>

<p>This also gives Robin a tool to test how well they did. Asking a fellow student to read a draft of their report and writing a 1/2-page summary gives Robin the opportunity to check if they filled the knowledge gap.</p>

<h2 id="knowing-thinking-believing-wanting-doing">Knowing, thinking, believing, wanting, doing</h2>

<p>Focus in the above was mostly on what the reader should <em>know</em>. However, the questions also specify “think/believe/want/do”.</p>

<p>As academics, we obviously don’t like being told what to think or believe or want. We do, however, write opinion pieces about where our research focus should be, what we should do to improve the quality of the research in our field, or about the ethics of (pursuing) certain research topics. Hence, you may find yourself in the position where you will need to convince others of your <em>opinion</em>. I believe that answering the above questions will help in that situation, also.</p>

<p>As for “doing”: academic writing contains implicit calls to action. When we build a new solver, we want people to see how great it is, and build on it or compare their own against it. When we curate a benchmark set, we want people to use it for their research. When we write a survey paper, we want people to read and cite it. These calls to action are often more explicit in and oral presentation. They may be spelled out on the slides, or said out loud. This is usually combined with an easy first step, like scanning a QR-code.</p>

<p>Hence, answers to the question of “what should my audience know/think/believe/want/do after listening to me?” may also include explicit calls to action, like:</p>

<ul>
  <li>Use my tool to solve problem X.</li>
  <li>Use my benchmarks to validate your solver.</li>
  <li>Submit benchmarks to my competition.</li>
  <li>Read and cite my survey paper.</li>
  <li>Join the conversation on the future of research field Y.</li>
</ul>

<h2 id="what-are-your-writing-tips">What are your writing tips?</h2>

<p>As I described above, I found answering these questions very helpful in streamlining my writing process. What is some good writing advice that you received and now pass on to others? Please share it with me?</p>]]></content><author><name>dr. anna latour</name></author><category term="ASK" /><category term="writing" /><category term="supervision" /><summary type="html"><![CDATA[Figuring out how much detail you should provide in your reports and presentations is tricky. Ask and answer three questions to gauge at which level you should explain things.]]></summary></entry><entry><title type="html">Sreevidya Iyer joins the team</title><link href="https://latower.github.io/posts/2025/11/sreevidya/" rel="alternate" type="text/html" title="Sreevidya Iyer joins the team" /><published>2025-11-17T00:00:00+01:00</published><updated>2025-11-17T00:00:00+01:00</updated><id>https://latower.github.io/posts/2025/11/sreevidya</id><content type="html" xml:base="https://latower.github.io/posts/2025/11/sreevidya/"><![CDATA[<p>Welcome to my new MSc student, <a href="https://www.linkedin.com/in/sreevidyaiyer">Sreevidya Iyer</a>, whose thesis project I will be supervising with Dr. Emir Demirović!</p>

<p><img src="/images/2025/2025-11-17_sreevidya-iyer.jpeg" alt="Professional photo of a young woman with black hair, wearing a pink-and-green flowery blouse. She's smiling at the camera, in front of a background of university buildings and blossoming trees." class="align-center" /></p>

<h2 id="about-sreevidya">About Sreevidya</h2>
<p>Sreevidya obtained a Bachelor’s degree in Computer Engineering from the Vivekanand Education Society’s Institute Of Technology. After three years of working in the Finance industry as a Software Engineer, she came to TU Delft to pursue a Master’s in Computer Science. Her strong technical skills, interest in societal problems, and methodical work ethic make her an ideal student to tackle this project.</p>

<h2 id="the-project-anonymising-social-networks">The Project: Anonymising Social Networks</h2>
<p>Sreevidya will be continuing a line of research that I have recently explored with my colleagues from Leiden University (Dr. Frank W. Takes and Rachel G. de Jong), and one of my other students (Denisa Arsene), where we explored methods for the anonymisation of social networks.</p>

<p>Anonymising social networks is important for the Social Sciences. Once social scientists have obtained a social network through their research, they typically want to share that network with other scientists, so they can study that network also. However, they have the obligation to protect the privacy of the people in that network. Simple pseudonymisation is typically insufficient, since the neighbourhood structure of each node can reveal a lot of information. Some online social networks allow you to inspect other people’s connections, thus providing access to structural information about the neighbourhoods of those people in the shared social network.</p>

<p>Hence, to protect people’s privacy, researchers can alter the network structure, to minimise the number of nodes that have the same neighbourhood structure, hence ensuring some level of anonymity. However, these changes should be minimal, as they might affect interesting network properties, like centrality and connectivity.</p>

<p>The literature studies different attack models and different measures for data utility. These all come with bespoke algorithms that are implemented in different languages and evaluated with different protocols, making it difficult for a user to predict the trade-off of privacy vs data utility for different attack models, data utility measures, network alteration strategies, and properties of the input network.</p>

<p>Sreevidya will develop a prototype of a framework for users to explore these trade-offs in a user-friendly, declarative constraint programming paradigm. I am much looking forward to my collaboration with her, and with Dr. Demirović’s group!</p>]]></content><author><name>dr. anna latour</name></author><category term="news" /><category term="supervision" /><category term="network analysis" /><category term="formal methods" /><category term="combinatorial optimisation" /><category term="reasoning under uncertainty" /><category term="constraint programming" /><summary type="html"><![CDATA[Welcome to my new MSc student, Sreevidya Iyer, whose thesis project I will be supervising with Dr. Emir Demirović!]]></summary></entry><entry><title type="html">Roxana Băcălie joins the team</title><link href="https://latower.github.io/posts/2025/11/roxana/" rel="alternate" type="text/html" title="Roxana Băcălie joins the team" /><published>2025-11-12T00:00:00+01:00</published><updated>2025-11-12T00:00:00+01:00</updated><id>https://latower.github.io/posts/2025/11/roxana</id><content type="html" xml:base="https://latower.github.io/posts/2025/11/roxana/"><![CDATA[<p>Welcome to <a href="https://www.linkedin.com/in/ioana-roxana-bacalie/">Roxana Băcălie</a>, my new MSc student, whose thesis project I will be co-supervising with Dr. Max Bannach and Dr. Neil Yorke-Smith!</p>

<p><img src="/images/2025/2025-11-12_roxana-bacalie.jpeg" alt="Professional 3/4 profile of a young woman with chestnut hair. She is dressed in navy blue, smiling at the camera and is photographed in an antique library." class="align-center" /></p>

<h2 id="about-roxana">About Roxana</h2>
<p>After completing a Bachelor’s degree in Computer Engineering at Gheorghe Asachi Technical University (Romania), Roxana came to the Netherlands to study Computer Science at Delft University of Technology. While passionate for the abstract elements of mathematics and puzzle-solving, Roxana enjoys applying her analytical skills to solving more concrete problems, also, as witnessed by her software development internship at Amazon.</p>

<h2 id="the-project-complex-satellite-constellation-design">The project: Complex satellite constellation design</h2>
<p>Over the coming 9 months, Roxana will be working on a very exciting collaboration with the <a href="https://www.esa.int/">European Space Agency</a>’s (ESA) <a href="https://www.esa.int/gsp/ACT/">Advanced Concepts Team</a> (ACT). In particular, she will be building on work done by <a href="https://www.esa.int/gsp/ACT/team/max_bannach/">Dr. Max Bannach</a>, who will be an external supervisor for this project. I met Dr. Bannach in September, while attending his Dagstuhl seminar on <a href="https://www.dagstuhl.de/de/seminars/seminar-calendar/seminar-details/25362">Optimization and Automated Reasoning for Designing Future Space Missions</a>, and I am thrilled that he agreed to be part of this project.</p>

<p>Dr. Bannach’s earlier work on <a href="https://openresearch.surrey.ac.uk/esploro/outputs/conferencePresentation/Reliability-of-Constellations-with-Inter-Satellite-Communication/99927464602346">modelling the communication reliability of satellite constellations</a> forms the inspiration of this project, along with my earlier work on <a href="/publication/2024-07-01-The-Cardinality-of-Identifying-Code-Sets-for-Soccer-Ball-Graph-with-Application-to-Remote-Sensing-preprint">satellite constellation design for monitoring</a> and <a href="/publication/2022-09-01-Optimal-decision-making-under-constraints-and-uncertainty-dissertation">network reliability optimisation</a>. Roxana will explore how the insights from this earlier work can be applied to future-proof and resource-efficient satellite constellations that provide highly reliable long-distance communication networks for quantum communication as well as classical communication.</p>

<p>I am very excited about this project and am confident that Roxana will be able to report some interesting findings by the end of it!</p>]]></content><author><name>dr. anna latour</name></author><category term="news" /><category term="supervision" /><category term="satellite constellation design" /><category term="formal methods" /><category term="combinatorial optimisation" /><category term="reasoning under uncertainty" /><category term="collaboration" /><summary type="html"><![CDATA[Welcome to Roxana Băcălie, my new MSc student, whose thesis project I will be co-supervising with Dr. Max Bannach and Dr. Neil Yorke-Smith!]]></summary></entry><entry><title type="html">Gianmaria Piergianni joins the team</title><link href="https://latower.github.io/posts/2025/10/gianmaria/" rel="alternate" type="text/html" title="Gianmaria Piergianni joins the team" /><published>2025-10-27T00:00:00+01:00</published><updated>2025-10-27T00:00:00+01:00</updated><id>https://latower.github.io/posts/2025/10/gianmaria</id><content type="html" xml:base="https://latower.github.io/posts/2025/10/gianmaria/"><![CDATA[<p>Welcome to my first Honours Student: <a href="https://gianmariapiergianni.com">Gianmaria Piergianni</a>!</p>

<h2 id="the-tu-delft-honours-programme">The TU Delft Honours Programme</h2>
<p>At Delft University of Technology, our top BSc students can apply to the Honours programme. During the 2-year programme, an Honours student will spend 15 ECTS working with a faculty member to do an original piece of research, culminating in a report, a presentation, and ideally also a publication. For more information, see <a href="https://www.tudelft.nl/studenten/ewi-studentenportal/onderwijs/honours-programme">this website</a>.</p>

<h2 id="the-project">The project</h2>
<p>In the coming two years, Gianmaria will be working on algorithms for optimal computer network monitoring system design. In doing so, he will build on <a href="/posts/2023/06/gismo/">my earlier work</a> on this topic, as well as on work by my former colleagues from Université catholique de Louvain (e.g., [<a href="https://link.springer.com/chapter/10.1007/978-3-031-60597-0_11">BSP2024</a>]).</p>

<p>I trust that the combination of hard-core formal methods and some challenging programming tasks are well-suited for someone like Gianmaria, who enjoys picking apart complex puzzles, so he can understand every detail. The approach we are taking is related to the work that I will start shortly for my <a href="/posts/2025/07/veni/">Veni project</a>, so I am keen to see what we can achieve. I am excited to have Gianmaria on board and I am looking forward to a fruitful collaboration.</p>

<hr />

<p><em>ECTS: <a href="https://en.wikipedia.org/wiki/European_Credit_Transfer_and_Accumulation_System#:~:text=The%20European%20Credit%20Transfer%20and,and%20other%20collaborating%20European%20countries.">European Credit Transfer and accumulation System</a>.</em></p>]]></content><author><name>dr. anna latour</name></author><category term="news" /><category term="supervision" /><category term="network reliability" /><category term="formal methods" /><category term="combinatorial optimisation" /><summary type="html"><![CDATA[Welcome to my first Honours Student: Gianmaria Piergianni!]]></summary></entry><entry><title type="html">News: I’m receiving a Veni research grant</title><link href="https://latower.github.io/posts/2025/07/veni/" rel="alternate" type="text/html" title="News: I’m receiving a Veni research grant" /><published>2025-07-20T00:00:00+02:00</published><updated>2025-07-20T00:00:00+02:00</updated><id>https://latower.github.io/posts/2025/07/veni</id><content type="html" xml:base="https://latower.github.io/posts/2025/07/veni/"><![CDATA[<p>I am honoured to announce that I am among the 2024 NWO Veni research grant recipients!</p>

<h2 id="nwo-veni-grants">NWO Veni grants</h2>

<p>NWO (Dutch Research Council) is one of the main suppliers of science funding in the Netherlands. Its role in funding fundamental research is especially important in the Dutch research funding landscape. The Veni grants are part of the NWO Talent Programme, and are awarded yearly to early-career researchers who have visionary research ideas, the CV to back them up, and the potential to become leaders in their research fields. This year, 15% of applications were awarded with a grant. Grant awardees receive a maximum of € 320 000.</p>

<p>Click <a href="https://www.nwo.nl/en/what-does-the-dutch-research-council-do">here</a> for more information about NWO, and <a href="https://www.nwo.nl/en/calls/nwo-talent-programme">here</a> to read more about the Veni, Vidi, Vici NWO Talent Programme.</p>

<h2 id="my-proposal">My proposal</h2>

<p>My proposal is titled “Finding Variables that Matter”, and I’m sharing the public summaries in English and Dutch below. Once I actually have the money and have taken the first steps in executing the research, I will be able to share more details. Keep an eye on this blog for updates!</p>

<h3 id="english-summary">English summary</h3>

<blockquote>
  <p>Real-world decision-making often relies on best guesses from domain experts. Even when a computer model is used to inform decisions, inputs are often based on expert opinion. We can gain more accurate estimates for these variables by gathering more data, which is expensive. Therefore, we want to know which parameters are most important in a problem, to allocate our resources wisely. Existing methods rely on expensive simulations, which might miss important variables. This project will conduct the first research into how to use independent supports to exploit the structure of problems to identify the variables that really matter in decision-making.</p>
</blockquote>

<h3 id="dutch-summary">Dutch summary</h3>

<blockquote>
  <p>We maken vaak beslissingen op basis van schattingen van experts. Zelfs wanneer we een computermodel gebruiken om te helpen met onze beslissingen, worden de inputwaardes afgeschat door experts. We kunnen nauwkeurigere schattingen maken door meer informatie te vergaren. Dit is typisch een duur process. Daarom willen we graag weten welke inputwaardes en beslissingen het belangrijkst zijn voor de uitkomst van een probleem, zodat we weten naar welke waardes we meer onderzoek moeten doen. Bestaande methodes gebruiken simulaties. Deze zijn duur, en kunnen belangrijke variabelen missen. In dit project gebruiken we de structuur van een probleem om belangrijke variabelen te identificeren.</p>
</blockquote>

<h2 id="acknowledgements">Acknowledgements</h2>

<p>Even though Veni grants are personal grants, I firmly believe that <a href="/posts/2022/10/acknowledgements/">Siegfried’s assertion that no piece of research ever is the product of just one person</a> also holds for grants. I received a tremendous amount of training, help, support, trust, and encouragement by a number of people, and I want to name a few of them explicitly.</p>

<p>First: <a href="https://www.tudelft.nl/staff/s.e.verwer/">dr. ir. Sicco Verwer</a> and <a href="https://www.tinanane.com/">dr. Tina Nane</a>. Sicco has been my academic mentor since I arrived at TU Delft just over a year ago, and has been invaluable for me. He’s been coaching me in how to approach this grant application, and pushing me to not let myself be paralised by my perfectionism. He’s been incredibly important for me in learning how to present my research, and helped me brainstorm and finetune my ideas. Tina’s support has also been incredibly important to me in this process. Not knowing me at all, she was nevertheless kind enough to listen to the vague ideas I had at the start of writing this proposal, and to help me sharpen them. It is through her that I get to expand my knowledge and experience, by tackling real-world problems. I look forward to working with her in the later phases of the project.</p>

<p>Next: <a href="https://www.tudelft.nl/staff/c.h.j.meuleman/">dr. ir. Corine Meuleman</a> and <a href="https://www.tudelft.nl/staff/t.w.breukel/">dr. Tom Breukel</a> were my main coaches from TU Delft’s impact and innovation office. They helped me even when I was missing deadlines or showed up underprepared. I learned so much from them and they were so patient and kind in their support. I’m also grateful to my other trainers, including <a href="https://www.tudelft.nl/staff/b.verbruggen/">Bas Verbruggen</a> and <a href="https://www.tudelft.nl/en/staff/m.sovago/">dr. Maria Sovago</a>.</p>

<p>I also want to acknowledge my colleagues, <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics/people/mathijs-de-weerdt">prof. dr. Mathijs de Weerdt</a> and <a href="https://sebdumancic.github.io/">dr. Sebastijan Dumančić</a> in particular. Both Mathijs and Sebastijan were crucial in me staying sane, despite the stress of applying to this grant. Both made time for me to provide me with professional advice, and friendly support when putting all of it in perspective. They helped me figure out the story and the framing of my ideas, and patiently gave feedback on early drafts.</p>

<p>Many of my other colleagues helped me by letting me vent, asking how things were going, or giving me feedback on my proposal and presentation. Shoutout to <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/applied-mathematics/people/dr-f-fabian-mies">dr. ir. Fabian Mies</a>, <a href="https://www.tudelft.nl/en/staff/g.gleizer/">dr. Gabriel de Albuquerque Gleizer</a>, <a href="https://harmgriffioen.github.io/">dr. Harm Griffioen</a>, <a href="https://www.tudelft.nl/en/staff/i.martinez/">dr. ir. Irene Martínez</a>, and <a href="https://www.tudelft.nl/staff/m.roviranavarro/">dr. Marc Rovira Navarro</a> in particular. I enjoyed my training sessions with them, value their feedback, and congratulate them on also seeing their Veni research proposals granted!</p>

<p>A somewhat hidden group of people I want to acknowledge are the those who run NWO, and the anonymous reviewers who kindly read and critiqued my proposal. I am also grateful to the committee who had to read all full proposals in the Science domain, interview all candidates, and finally make decisions on who gets the grant and who doesn’t.</p>

<p>Of course, I owe a great debt to my academic advisers from earlier years. This may be a personal grant, reflecting my research ideas, but I am the product of their expertise and mentoring. I particularly hear the voices of <a href="https://scs.gatech.edu/people/kuldeep-s-meel">prof. dr. Kuldeep Meel</a>, <a href="https://www.kuleuven.be/wieiswie/en/person/00052873">dr. Siegfried Nijssen</a>, <a href="https://hoos.ca/general.html">prof. dr. Holger Hoos</a> and <a href="https://www.cs.toronto.edu/~fbacchus/">prof. dr. Fahiem Bacchus</a> in my own writing and ideas.</p>

<p>Finally, my friends and family have been incredibly patient with me during this entire process. I know it isn’t healthy, but I couldn’t escape sometimes having a meeting while the others went to the beach, or leaving my loved-ones to do the dishes while I returned to my laptop to make a deadline. I hope they are proud of me.</p>

<h2 id="further-reading">Further reading</h2>

<ul>
  <li>NWO’s news release about this year’s recipients: <a href="https://www.nwo.nl/en/news/200-researchers-receive-veni-grants">200 Researchers receive Veni grants</a></li>
  <li>TU Delft’s news release about Delft’s recipients: <a href="https://www.tudelft.nl/en/2025/tu-delft/record-number-veni-grants-for-leading-tu-delft-researchers">Record number Veni grants for leading TU Delft researchers</a></li>
  <li>The Faculty of Electrical Engineering, Mathematics and Computer Science’s coverage about the Veni grants received at our faculty: <a href="https://www.tudelft.nl/en/2025/eemcs/six-veni-grants-for-eemcs-researchers">Six Veni grants for EEMCS researchers </a></li>
</ul>

<hr />

<p><strong>Reminder: <a href="/posts/2025/07/hiring/">I’m hiring!</a>. Please apply no later than 31 August 2025!</strong></p>]]></content><author><name>dr. anna latour</name></author><category term="news" /><category term="veni" /><category term="sensitivity analysis" /><category term="combinatorial optimisation" /><category term="formal methods" /><category term="statistics" /><category term="satisfiability" /><category term="funding" /><summary type="html"><![CDATA[I am honoured to announce that I am among the 2024 NWO Veni research grant recipients!]]></summary></entry><entry><title type="html">HIRING: fully funded PhD position in Symbolic AI and Reasoning under Uncertainty</title><link href="https://latower.github.io/posts/2025/07/hiring/" rel="alternate" type="text/html" title="HIRING: fully funded PhD position in Symbolic AI and Reasoning under Uncertainty" /><published>2025-07-09T00:00:00+02:00</published><updated>2025-07-09T00:00:00+02:00</updated><id>https://latower.github.io/posts/2025/07/hiring</id><content type="html" xml:base="https://latower.github.io/posts/2025/07/hiring/"><![CDATA[<p>I am looking for a PhD candidate to work on the intersection of Algorithmics and Statistics. <strong>Application deadline: 31 August 2025</strong>. Click <a href="https://careers.tudelft.nl/job/Delft-PhD-Position-Symbolic-AI-and-Reasoning-Under-Uncertainty-2628-CD/824585702/">here</a> for details.</p>

<p>Are you passionate about logic and reasoning, do you have a strong interest in statistics, and are you looking for a vibrant work environment with ample opportunities for networking and collaboration? Then I may have a vacancy for you.</p>

<p>I am looking to hire a PhD candidate who will join me at the <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics">Algorithmics section</a> of the <a href="https://www.tudelft.nl/en/eemcs/the-faculty/departments/software-technology">Software Technology department</a> of <a href="https://www.tudelft.nl/en/">Delft University of Technology</a>, to work on algorithmic and statistical methods for sensitivity analysis and other forms of reasoning under uncertainty and combinatorial optimisation. The supervisory team for this position will consist of me, <a href="https://fabian-mies.owlstown.net/">dr. ir. Fabian Mies</a> (Assistant Professor of Statistics) and <a href="https://www.tudelft.nl/staff/s.e.verwer/">dr. ir. Sicco Verwer</a> (Associate Professor of Algorithmics and Machine Learning).</p>

<p>For details on the position, required qualifications, and how to apply, please refer to TU Delft’s <a href="https://careers.tudelft.nl/job/Delft-PhD-Position-Symbolic-AI-and-Reasoning-Under-Uncertainty-2628-CD/824585702/">careers page</a>. Please <strong>apply no later than 31 August 2025</strong>.</p>

<p>I am looking forward to reading your application!</p>]]></content><author><name>dr. anna latour</name></author><category term="vacancy" /><category term="news" /><category term="phd" /><category term="combinatorial optimisation" /><category term="constraint programming" /><category term="constraint optimisation" /><category term="doctorate" /><category term="formal methods" /><category term="statistics" /><category term="satisfiability" /><summary type="html"><![CDATA[I am looking for a PhD candidate to work on the intersection of Algorithmics and Statistics. Application deadline: 31 August 2025. Click here for details.]]></summary></entry><entry><title type="html">Roy defends his work on ejection chains</title><link href="https://latower.github.io/posts/2025/06/roy-defends/" rel="alternate" type="text/html" title="Roy defends his work on ejection chains" /><published>2025-06-30T00:00:00+02:00</published><updated>2025-06-30T00:00:00+02:00</updated><id>https://latower.github.io/posts/2025/06/roy-defends</id><content type="html" xml:base="https://latower.github.io/posts/2025/06/roy-defends/"><![CDATA[<p>Many congratulations to <a href="https://www.linkedin.com/in/roy-katz-b687bb238/">ir. Roy Katz</a> for successfully defending his MSc thesis: <a href="https://repository.tudelft.nl/record/uuid:90eb4f66-b159-4b38-ae64-e929985f2cae">Adding Ejection Chain to Nurse Rostering Simulated Annealing Solver</a>!</p>

<p>Over the last nine months, I had the pleasure of co-supervising Roy, together with my colleague <a href="https://www.tudelft.nl/ewi/over-de-faculteit/afdelingen/software-technology/algorithmics/people/neil-yorke-smith">dr. Neil Yorke-Smith</a> at the Algorithmics group of TU Delft, and dr. Lotte Berghman and Eva van Rooijen from <a href="https://ortec.com">ORTEC</a>.</p>

<p><img src="/images/2025/2025-06-30_roy-katz_1024x768.jpg" alt="Roy presents in front of a big screen in a lecture room. The slide reads &quot;Example InfeasibleEC&quot; and shows a table that demonstrates an example NRP for one week, with four nurses and three types of shifts (morning, afternoon and night). It also shows constraints for each nurse in terms of maximum work load, maximum number of night shifts, and their preference w.r.t. how many sequential shifts they have. Below the table is an overview of the coverage constraints. The table itself contains a feasible solution." class="align-center" /></p>

<p>ORTEC kindly hosted Roy in this student project on improving an existing simulated annealing-based solver for the Nurse Rostering Problem (NRP). NRPs are tricky combinatorial optimisation problems, both from a modelling perspective and a solving perspective. After all hard constraints have been satisfied, the challenge is to satisfy as many of the soft constraints as possible, in order to accommodate nurses’ preferences, and to ensure healthy work-life balances.</p>

<p>Existing methods rely on stochastic local search paradigms to refine <em>feasible</em> solutions to <em>good</em> feasible solutions. Roy first did a literature study of NRP solving techniques. He finally focused on <em>ejection chains</em>, which are techniques aimed at leaving local minima by breaking a feasible solution and then repairing it through a series of propagating moves (in this case: shift swaps). He designed and implemented several variants of ejection chains in an existing NRP solver, and did a thorough analysis of how they perform in terms of eventual solution quality.</p>

<p>I’ve gotten to know Roy as a humble and friendly guy with a good sense of humour, an intellectually honest thinker, and a researcher who presents his findings with flair. I wish him all the best with his next career steps.</p>]]></content><author><name>dr. anna latour</name></author><category term="defence" /><category term="students" /><category term="teaching" /><category term="combinatorial optimisation" /><category term="constraint optimisation" /><summary type="html"><![CDATA[Many congratulations to ir. Roy Katz for successfully defending his MSc thesis: Adding Ejection Chain to Nurse Rostering Simulated Annealing Solver!]]></summary></entry></feed>