Segui
Nicolas El Maalouly
Nicolas El Maalouly
PhD in Computer Science, ETH Zurich
Email verificata su inf.ethz.ch
Titolo
Citata da
Citata da
Anno
Exact Matching: Algorithms and Related Problems
N El Maalouly
arXiv preprint arXiv:2203.13899, 2022
122022
Exact Matching in Graphs of Bounded Independence Number
N El Maalouly, R Steiner
arXiv preprint arXiv:2202.11988, 2022
122022
Topological Art in Simple Galleries∗
D Bertschinger, N El Maalouly, T Miltzow, P Schnider, S Weber
Symposium on Simplicity in Algorithms (SOSA), 87-116, 2022
102022
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
N El Maalouly, R Steiner, L Wulf
arXiv preprint arXiv:2207.09797, 2022
8*2022
An approximation algorithm for the exact matching problem in bipartite graphs
A Dürr, NE Maalouly, L Wulf
arXiv preprint arXiv:2307.02205, 2023
32023
Counting Perfect Matchings in Dense Graphs Is Hard
N El Maalouly, Y Wang
arXiv preprint arXiv:2210.15014, 2022
32022
Exact Matching and the Top-k Perfect Matching Problem
N El Maalouly, L Wulf
arXiv preprint arXiv:2209.09661, 2022
32022
On the Exact Matching Problem in Dense Graphs
NE Maalouly, S Haslebacher, L Wulf
arXiv preprint arXiv:2401.03924, 2024
22024
The Complexity of Recognizing Geometric Hypergraphs
D Bertschinger, N El Maalouly, L Kleist, T Miltzow, S Weber
International Symposium on Graph Drawing and Network Visualization, 163-179, 2023
22023
Compatible Spanning Trees in Simple Drawings of
O Aichholzer, K Knorr, W Mulzer, N El Maalouly, J Obenaus, R Paul, ...
arXiv preprint arXiv:2208.11875, 2022
12022
Il sistema al momento non può eseguire l'operazione. Riprova più tardi.
Articoli 1–10