Nicolas El Maalouly

Orcid: 0000-0002-1037-0203

According to our database1, Nicolas El Maalouly authored at least 11 papers between 2022 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Topological Art in Simple Galleries.
Discret. Comput. Geom., April, 2024

Towards a Deterministic Polynomial Time Algorithm for the Exact Matching Problem.
PhD thesis, 2024

On the Exact Matching Problem in Dense Graphs.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

2023
Exact Matching: Algorithms and Related Problems.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

Exact Matching: Correct Parity and FPT Parameterized by Independence Number.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

The Complexity of Recognizing Geometric Hypergraphs.
Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs.
Proceedings of the Approximation, 2023

2022
Counting Perfect Matchings in Dense Graphs Is Hard.
CoRR, 2022

Exact Matching and the Top-k Perfect Matching Problem.
CoRR, 2022

Exact Matching in Graphs of Bounded Independence Number.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

Compatible Spanning Trees in Simple Drawings of K<sub>n</sub>.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022


  Loading...