Marco Molinaro
Impact in
- Numerical Analysis top 10%
- Advanced Optimization Algorithms Research
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
Papers in
-
- Complexity and Algorithms in Graphs 15
-
- Optimization and Search Problems 11
- Co-authors
- Santanu S. Dey (10 shared papers)Alberto Del Pia (1 shared paper)R. Ravi (2 shared papers)Eduardo Sany Laber (6 shared papers)Anupam Gupta (2 shared papers)David P. Woodruff (2 shared papers)Grigory Yaroslavtsev (2 shared papers)Qianyi Wang (1 shared paper)
- Journals
- Mathematical Programming (9 papers)Mathematics of Operations Research (5 papers)Algorithmica (3 papers)Operations Research Letters (3 papers)Theoretical Computer Science (2 papers)
- Partner nations
- United StatesBrazilItaly
In The Last Decade
Marco Molinaro
33 papers receiving 232 citations
Peers
Comparison fields: 5 of 55
- Numerical Analysis 43
- Computational Theory and Mathematics 83
- Computer Networks and Communications 99
- Industrial and Manufacturing Engineering 38
- Computer Graphics and Computer-Aided Design 9
Countries citing papers authored by Marco Molinaro
This map shows the geographic impact of Marco Molinaro'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 Marco Molinaro with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Marco Molinaro more than expected).
Fields of papers citing papers by Marco Molinaro
This network shows the impact of papers produced by Marco Molinaro. 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 Marco Molinaro. The network helps show where Marco Molinaro may publish in the future.
Co-authors
The 25 scholars most cited alongside Marco Molinaro, 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 35 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 60 | |
| 2 | 2013 | 22 | |
| 3 | 2016 | 20 | |
| 4 | 2017 | 14 | |
| 5 | 2016 | 14 | |
| 6 | 2011 | 10 | |
| 7 | 2015 | 10 | |
| 8 | Binary Partitions with Approximate Minimum Impurity | 2018 | 10 |
| 9 | 2020 | 9 | |
| 10 | 2013 | 9 | |
| 11 | 2013 | 9 | |
| 12 | Beating the Direct Sum Theorem in Communication Complexity with Implications for Sketching | 2013 | 8 |
| 13 | 2023 | 6 | |
| 14 | 2012 | 6 | |
| 15 | 2012 | 6 | |
| 16 | 2009 | 4 | |
| 17 | 2022 | 4 | |
| 18 | 2015 | 4 | |
| 19 | 2015 | 3 | |
| 20 | 2015 | 3 |
About Marco Molinaro
Marco Molinaro is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Artificial Intelligence, Numerical Analysis and Management Science and Operations Research, having authored 35 papers that have together received 249 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (15 papers), Optimization and Search Problems (11 papers), Advanced Optimization Algorithms Research (6 papers), Sparse and Compressive Sensing Techniques (5 papers), Vehicle Routing Optimization Methods (5 papers), Optimization and Packing Problems (5 papers), Cryptography and Data Security (4 papers) and Machine Learning and Algorithms (4 papers). The work is most often cited by research in Numerical Analysis (43 citations), Computational Theory and Mathematics (83 citations), Computer Networks and Communications (99 citations), Industrial and Manufacturing Engineering (38 citations) and Computer Graphics and Computer-Aided Design (9 citations). Marco Molinaro has collaborated with scholars based in United States, Brazil and Italy. Frequent co-authors include Santanu S. Dey, Alberto Del Pia, R. Ravi, Eduardo Sany Laber, Anupam Gupta, David P. Woodruff, Grigory Yaroslavtsev, Qianyi Wang, Ferdinando Cicalese and Thomas Kalinowski. Their work appears in journals such as Mathematical Programming, Mathematics of Operations Research, Algorithmica, Operations Research Letters 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.