Amer E. Mouawad
Impact in
-
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Interconnection Networks and Systems
- Optimization and Search Problems
Papers in
-
- Advanced Graph Theory Research 20
- Complexity and Algorithms in Graphs 13
- semigroups and automata theory 3
-
- Interconnection Networks and Systems 10
- Optimization and Search Problems 4
- Co-authors
- Naomi Nishimura (7 shared papers)Akira Suzuki (3 shared papers)Venkatesh Raman (3 shared papers)Faisal N. Abu-Khzam (3 shared papers)Daniel Lokshtanov (9 shared papers)Saket Saurabh (6 shared papers)Mathieu Liedloff (1 shared paper)Khuzaima Daudjee (1 shared paper)
In The Last Decade
Amer E. Mouawad
24 papers receiving 106 citations
Peers
Comparison fields: 5 of 25
- Computational Theory and Mathematics 78
- Computer Networks and Communications 55
- Discrete Mathematics and Combinatorics 6
- Signal Processing 8
- Hardware and Architecture 4
Countries citing papers authored by Amer E. Mouawad
This map shows the geographic impact of Amer E. Mouawad's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Amer E. Mouawad with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Amer E. Mouawad more than expected).
Fields of papers citing papers by Amer E. Mouawad
This network shows the impact of papers produced by Amer E. Mouawad. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Amer E. Mouawad. The network helps show where Amer E. Mouawad may publish in the future.
Co-authors
The 22 scholars most cited alongside Amer E. Mouawad, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 28 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 18 | |
| 2 | 2016 | 11 | |
| 3 | 2011 | 10 | |
| 4 | 2015 | 10 | |
| 5 | 2018 | 9 | |
| 6 | 2017 | 9 | |
| 7 | 2015 | 7 | |
| 8 | 2018 | 5 | |
| 9 | 2018 | 4 | |
| 10 | 2023 | 4 | |
| 11 | 2023 | 3 | |
| 12 | 2022 | 3 | |
| 13 | 2014 | 2 | |
| 14 | 2021 | 2 | |
| 15 | 2016 | 2 | |
| 16 | 2018 | 2 | |
| 17 | 2025 | 1 | |
| 18 | 2023 | 1 | |
| 19 | 2024 | 1 | |
| 20 | 2012 | 1 |
About Amer E. Mouawad
Amer E. Mouawad is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Artificial Intelligence and Molecular Biology, having authored 28 papers that have together received 109 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Complexity and Algorithms in Graphs (13 papers), Interconnection Networks and Systems (10 papers), Optimization and Search Problems (4 papers), Limits and Structures in Graph Theory (4 papers), Algorithms and Data Compression (3 papers), semigroups and automata theory (3 papers) and Graph Theory and Algorithms (2 papers). The work is most often cited by research in Computational Theory and Mathematics (78 citations), Computer Networks and Communications (55 citations), Discrete Mathematics and Combinatorics (6 citations), Signal Processing (8 citations) and Hardware and Architecture (4 citations). Amer E. Mouawad has collaborated with scholars based in Lebanon, Canada and Norway. Frequent co-authors include Naomi Nishimura, Akira Suzuki, Venkatesh Raman, Faisal N. Abu-Khzam, Daniel Lokshtanov, Saket Saurabh, Mathieu Liedloff, Khuzaima Daudjee, Takehiro Ito and Hirotaka Ono. Their work appears in journals such as Algorithmica, Journal of Computer and System Sciences, SIAM Journal on Discrete Mathematics, Physical review. A and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.