BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:092f71b5e2a63647a87df9cf6ed2a0fd
DTSTAMP:20260609T083512Z
SUMMARY:Another CS MSc Thesis Presentation 5 June 2026
DESCRIPTION:Kontakt: birger.swahn@cs.lth.se\n\nFriday\, 5 June there will b
 e another master thesis presentation in Computer Science at Lund Universit
 y\, Faculty of Engineering.The presentation will take place in E:2116.Note
  to potential opponents: Register as an opponent to the presentation of yo
 ur choice by sending an email to the examiner for that presentation (first
 name.lastname@cs.lth.se). Do not forget to specify the presentation you re
 gister for! Note that the number of opponents may be limited (often to two
 )\, so you might be forced to choose another presentation if you register 
 too late. Registrations are individual\, just as the oppositions are! More
  instructions for opponents are found here on the LTH thesis project page.
 14:15-15:00 in E:2116Presenters: Gina Christoffersen\, Sandra Christoffers
 enTitle: A Comparative Study of Edge Addition Algorithms for Power Grid Ro
 bustnessExaminer: Flavius GruianSupervisor: Jonas Skeppstedt (LTH)Power gr
 id networks face huge expansion plans as the energy demand is expected to 
 grow each year. One critical perspective when developing modern power grid
 s is network robustness. Adding new transmission lines to improve robustne
 ss can be modeled as a graph optimization problem using edge addition algo
 rithms. The objective functions to optimize are often topological and elec
 trical robustness metrics. Two such metrics are effective graph resistance
  and algebraic connectivity\, that mostly have been studied on synthetic g
 rids. Further research is needed to better understand the relationship bet
 ween graph connectivity and robustness against cascading failures. In this
  study\, three greedy edge addition algorithms were compared and evaluated
  under targeted attacks and cascading simulations on a realistic Nordic tr
 ansmission model. The results indicated that both minimizing and maximizin
 g algebraic connectivity can increase power grid robustness against cascad
 ing effects in attack scenarios. Minimizing effective resistance demonstra
 ted varied robustness performances for different graph structures.Here is 
 a link to the popular science summary&nbsp\;\n\nMer information om händel
 sen: https://www.cs.lth.se/evenemang/another-cs-msc-thesis-presentation-5-
 june-2026
DTSTART;TZID=GMT:20260605T121500
DTEND;TZID=GMT:20260605T130000
LOCATION:E:2116
END:VEVENT
END:VCALENDAR