Salwa Faour
 |
Albert-Ludwigs-Universität Institut für Informatik Georges-Köhler-Allee 106 D - 79110 Freiburg im Breisgau
Email: salwa.faour@cs.uni-freiburg.de |
I am a PhD candidate at the University of Freiburg in the Algorithms and Complexity group. I earned both my M.Sc. and B.Sc. in mathematics from the Lebanese University, in Beirut, Lebanon. My current research interests lie in graph theory and distributed graph algorithms.
Teachings
- Seminar "Derandomization in Distributed and Parallel Algorithms" (Summer semester 2025)
- Graduate Course "Theoretical Computer Science - Bridge Course" (Summer semester 2025)
- Seminar "Cops and Robber Games on Graphs" (Winter semester 2024/25)
- Graduate Course "(Theory of) Distributed Systems" (Summer semester 2024)
- Seminar "Distributed Lower Bound Techniques Reading Group" (Winter semester 2023/24)
- Graduate Course "Algorithm Theory" (Winter semester 2023/24)
- Graduate Course "(Theory of) Distributed Systems" (Summer semester 2023)
- Seminar "Advanced Graph Algorithms Reading Group" (Summer semester 2023)
- Seminar "Algorithms and Complexity" (Winter semester 2022/23)
- Graduate Course "Algorithm Theory" (Winter semester 2022/23)
- Seminar "Algorithms and Complexity" (Summer semester 2022)
- Graduate Course "Theoretical Computer Science - Bridge Course" (Summer semester 2022)
- Graduate Course "Theoretical Computer Science - Bridge Course" (Winter semester 2021/22)
- Seminar "Distributed Algorithms" (Summer semester 2021)
- Graduate Course "(Theory of) Distributed Systems" (Summer semester 2021)
- Graduate Course "Theoretical Computer Science - Bridge Course" (Summer semester 2021)
- Seminar "Algorithms and Complexity" (Winter semester 2020/21)
- Graduate Course "Theoretical Computer Science - Bridge Course" (Winter semester 2020/21)
- Seminar "Distributed Algorithms" (Summer semester 2020)
- Graduate Course "Theoretical Computer Science - Bridge Course" (Summer semester 2020)
Publications
-
Journal Papers
- Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhoň
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
ACM Transactions on Algorithms (TALG 2025) (invited for special edition) - Salwa Faour and Fabian Kuhn
Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs - Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, and Václav Rozhoň
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
ACM Symposium on Discrete Algorithms (SODA 2023) (video) - Salwa Faour, Marc Fuchs, and Fabian Kuhn
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings
Conference on Principles of Distributed Systems (OPODIS 2021) (video) - Salwa Faour and Fabian Kuhn
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model
Conference on Principles of Distributed Systems (OPODIS 2020) (video)
(Best Paper Award)
Conference Papers (arXiv version)
Invited Talks
-
Approximating Bipartite Minimum Vertex Cover in the CONGEST Model
2021 Aalto CS Theory Seminar, Aalto University, Espoo, Finland
Activities
- Organizing committee member of DISC2021, Freiburg, Germany, 4-8 October