default search action
Nicolas El Maalouly
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Nicolas El Maalouly:
Towards a Deterministic Polynomial Time Algorithm for the Exact Matching Problem. ETH Zurich, Zürich, Switzerland, 2024 - [j1]Daniel Bertschinger, Nicolas El Maalouly
, Tillmann Miltzow
Topological Art in Simple Galleries. Discret. Comput. Geom. 71(3): 1092-1130 (2024) - [c8]Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf:
On the Exact Matching Problem in Dense Graphs. STACS 2024: 33:1-33:17 - [i9]Nicolas El Maalouly, Sebastian Haslebacher, Lasse Wulf:
On the Exact Matching Problem in Dense Graphs. CoRR abs/2401.03924 (2024) - 2023
- [c7]Anita Dürr, Nicolas El Maalouly, Lasse Wulf:
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. APPROX/RANDOM 2023: 18:1-18:21 - [c6]Daniel Bertschinger, Nicolas El Maalouly
The Complexity of Recognizing Geometric Hypergraphs. GD (1) 2023: 163-179 - [c5]Nicolas El Maalouly, Raphael Steiner, Lasse Wulf:
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. ISAAC 2023: 28:1-28:18 - [c4]Nicolas El Maalouly:
Exact Matching: Algorithms and Related Problems. STACS 2023: 29:1-29:17 - [i8]Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber
The Complexity of Recognizing Geometric Hypergraphs. CoRR abs/2302.13597 (2023) - [i7]Anita Dürr, Nicolas El Maalouly, Lasse Wulf:
An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs. CoRR abs/2307.02205 (2023) - 2022
- [c3]Oswin Aichholzer
Compatible Spanning Trees in Simple Drawings of Kn. GD 2022: 16-24 - [c2]Nicolas El Maalouly
Exact Matching in Graphs of Bounded Independence Number. MFCS 2022: 46:1-46:14 - [c1]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider
Topological Art in Simple Galleries. SOSA 2022: 87-116 - [i6]Nicolas El Maalouly, Raphael Steiner:
Exact Matching in Graphs of Bounded Independence Number. CoRR abs/2202.11988 (2022) - [i5]Nicolas El Maalouly:
Exact Matching: Algorithms and Related Problems. CoRR abs/2203.13899 (2022) - [i4]Nicolas El Maalouly, Raphael Steiner
Exact Matching: Correct Parity and FPT Parameterized by Independence Number. CoRR abs/2207.09797 (2022) - [i3]Nicolas El Maalouly, Lasse Wulf:
Exact Matching and the Top-k Perfect Matching Problem. CoRR abs/2209.09661 (2022) - [i2]Nicolas El Maalouly, Yanheng Wang:
Counting Perfect Matchings in Dense Graphs Is Hard. CoRR abs/2210.15014 (2022) - 2021
- [i1]Daniel Bertschinger, Nicolas El Maalouly, Tillmann Miltzow, Patrick Schnider, Simon Weber
Topological Art in Simple Galleries. CoRR abs/2108.04007 (2021)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-15 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: