Nicolas El Maalouly

According to our database, Nicolas El Maalouly authored at least 13 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2026

Exact Matching and Top-k Perfect Matching Parameterized by Neighborhood Diversity or Bandwidth.

Nicolas El Maalouly, Kostas Lakis

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2025

On Finding 𝓁-Th Smallest Perfect Matchings.

Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner, Lasse Wulf

Proceedings of the 33rd Annual European Symposium on Algorithms, 2025

2024

Towards a Deterministic Polynomial Time Algorithm for the Exact Matching Problem.

Nicolas El Maalouly

PhD thesis, 2024

On the Exact Matching Problem in Dense Graphs.

Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023

Exact Matching: Algorithms and Related Problems.

Nicolas El Maalouly

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Exact Matching: Correct Parity and FPT Parameterized by Independence Number.

Nicolas El Maalouly, Raphael Steiner, Lasse Wulf

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

The Complexity of Recognizing Geometric Hypergraphs.

Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs.

Anita Dürr, Nicolas El Maalouly, Lasse Wulf

Proceedings of the Approximation, 2023

2022

Counting Perfect Matchings in Dense Graphs Is Hard.

Nicolas El Maalouly, Yanheng Wang

CoRR, 2022

Exact Matching and the Top-k Perfect Matching Problem.

Nicolas El Maalouly, Lasse Wulf

CoRR, 2022

Topological Art in Simple Galleries.

Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber

Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Exact Matching in Graphs of Bounded Independence Number.

Nicolas El Maalouly, Raphael Steiner

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Compatible Spanning Trees in Simple Drawings of K_n.

Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022