Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

5

jun

Another CS MSc Thesis Presentation 5 June 2026

5 juni 2026 14:15 till 15:00 | Exjobbspresentationer

One more Computer Science MSc thesis to be presented on 5 June

Friday, 5 June there will be another master thesis presentation in Computer Science at Lund University, Faculty of Engineering.

The presentation will take place in E:2116.

Note to potential opponents: Register as an opponent to the presentation of your choice by sending an email to the examiner for that presentation (firstname [dot] lastname [at] cs [dot] lth [dot] se). Do not forget to specify the presentation you register 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:2116

  • Presenters: Gina Christoffersen, Sandra Christoffersen
  • Title: A Comparative Study of Edge Addition Algorithms for Power Grid Robustness
  • Examiner: Flavius Gruian
  • Supervisor: Jonas Skeppstedt (LTH)

Power grid networks face huge expansion plans as the energy demand is expected to grow each year. One critical perspective when developing modern power grids is network robustness. Adding new transmission lines to improve robustness can be modeled as a graph optimization problem using edge addition algorithms. The objective functions to optimize are often topological and electrical robustness metrics. Two such metrics are effective graph resistance and algebraic connectivity, that mostly have been studied on synthetic grids. Further research is needed to better understand the relationship between 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 transmission model. The results indicated that both minimizing and maximizing algebraic connectivity can increase power grid robustness against cascading effects in attack scenarios. Minimizing effective resistance demonstrated varied robustness performances for different graph structures.

Here is a link to the popular science summary 

Om evenemanget

Plats:

E:2116

Kontakt:

birger [dot] swahn [at] cs [dot] lth [dot] se