Massimo Lauria

553 total citations
34 papers, 154 citations indexed

About

Massimo Lauria is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Massimo Lauria has authored 34 papers receiving a total of 154 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 13 papers in Artificial Intelligence and 5 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Massimo Lauria's work include Complexity and Algorithms in Graphs (15 papers), Advanced Graph Theory Research (11 papers) and semigroups and automata theory (10 papers). Massimo Lauria is often cited by papers focused on Complexity and Algorithms in Graphs (15 papers), Advanced Graph Theory Research (11 papers) and semigroups and automata theory (10 papers). Massimo Lauria collaborates with scholars based in Italy, Sweden and United States. Massimo Lauria's co-authors include Nicola Galesi, Jakob Nordström, Andrew A. Chien, Scott Pakin, Olaf Beyersdorff, Albert Atserias, Yuval Filmus, Neil Thapen, Vojtěch Rödl and Andrea Clementi and has published in prestigious journals such as SHILAP Revista de lepidopterología, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Massimo Lauria

30 papers receiving 148 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Massimo Lauria Italy	8	106	74	42	20	20	34	154
Karl Wimmer United States	7	62 0.6×	57 0.8×	9 0.2×	11 0.6×	12 0.6×	28	124
Srikanth Srinivasan India	9	165 1.6×	111 1.5×	12 0.3×	19 0.9×	3 0.1×	52	189
Pritish Kamath United States	7	124 1.2×	111 1.5×	16 0.4×	10 0.5×	5 0.3×	21	168
Johan Thapper France	6	85 0.8×	18 0.2×	56 1.3×	11 0.6×	5 0.3×	15	103
Daniel Mölle Germany	5	106 1.0×	12 0.2×	61 1.5×	12 0.6×	6 0.3×	6	130
Kanstantsin Pashkovich Canada	6	111 1.0×	16 0.2×	12 0.3×	11 0.6×	2 0.1×	18	132
Jean-Xavier Rampon France	7	56 0.5×	15 0.2×	29 0.7×	4 0.2×	4 0.2×	21	94
Neil Thapen Czechia	8	153 1.4×	116 1.6×	14 0.3×	16 0.8×		38	174
Stanislav Bulygin Germany	8	36 0.3×	104 1.4×	10 0.2×	9 0.5×	19 0.9×	18	140
Piotr Micek Poland	8	137 1.3×	25 0.3×	25 0.6×	54 2.7×	2 0.1×	41	152

Countries citing papers authored by Massimo Lauria

Since Specialization

Citations

This map shows the geographic impact of Massimo Lauria'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 Massimo Lauria with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Massimo Lauria more than expected).

Fields of papers citing papers by Massimo Lauria

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Massimo Lauria. 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 Massimo Lauria. The network helps show where Massimo Lauria may publish in the future.

Co-authorship network of co-authors of Massimo Lauria

This figure shows the co-authorship network connecting the top 25 collaborators of Massimo Lauria. A scholar is included among the top collaborators of Massimo Lauria based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Massimo Lauria. Massimo Lauria is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Lauria, Massimo, et al.. (2023). Verification and generation of unrefinable partitions. Information Processing Letters. 181. 106361–106361. 1 indexed citations

Lauria, Massimo, et al.. (2022). Circular design strategies through Additive manufacturing: MoDom, a “circular building” housing model. SHILAP Revista de lepidopterología. 38. 3 indexed citations

Lauria, Massimo, et al.. (2022). On the maximal part in unrefinable partitions of triangular numbers. Aequationes Mathematicae. 96(6). 1339–1363. 2 indexed citations

Lauria, Massimo, et al.. (2021). The Power of Negative Reasoning. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

Lauria, Massimo. (2018). Cliques enumeration and tree-like resolution proofs. Information Processing Letters. 135. 62–67.

Atserias, Albert, et al.. (2018). Clique is hard on average for regular resolution. QRU Quaderns de Recerca en Urbanisme. 866–877. 3 indexed citations

Lauria, Massimo. (2018). A note about k -DNF resolution. Information Processing Letters. 137. 33–39. 5 indexed citations

Lauria, Massimo, Pavel Pudlák, Vojtěch Rödl, & Neil Thapen. (2016). The complexity of proving that a graph is Ramsey. COMBINATORICA. 37(2). 253–268. 3 indexed citations

Lauria, Massimo & Jakob Nordström. (2015). Tight size-degree bounds for sums-of-squares proofs. arXiv (Cornell University). 33. 448–466. 2 indexed citations

10.

Lauria, Massimo, et al.. (2015). Hardness of Approximation in PSPACE and Separation Results for Pebble Games. IRIS Research product catalog (Sapienza University of Rome). 466–485. 12 indexed citations

11.

Filmus, Yuval, et al.. (2015). Space Complexity in Polynomial Calculus. SIAM Journal on Computing. 44(4). 1119–1153. 4 indexed citations

12.

Filmus, Yuval, et al.. (2014). From Small Space to Small Width in Resolution. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 25. 300–311. 1 indexed citations

13.

Beyersdorff, Olaf, Nicola Galesi, & Massimo Lauria. (2013). Parameterized Complexity of DPLL Search Procedures. ACM Transactions on Computational Logic. 14(3). 1–21. 13 indexed citations

14.

Filmus, Yuval, et al.. (2012). Space Complexity in Polynomial Calculus. 19(132). 132.

15.

Filmus, Yuval, et al.. (2012). Space Complexity in Polynomial Calculus. ASEP. 185. 334–344. 9 indexed citations

16.

Galesi, Nicola, et al.. (2011). Paris-Harrington Tautologies. IRIS Research product catalog (Sapienza University of Rome). 93–103. 2 indexed citations

17.

Beyersdorff, Olaf, Nicola Galesi, Massimo Lauria, & Alexander Razborov. (2011). Parameterized Bounded-Depth Frege Is Not Optimal. Lecture notes in computer science. 4(3). 1–16. 1 indexed citations

18.

Calamoneri, Tiziana, et al.. (2008). Minimum-Energy Broadcast and disk cover in grid wireless networks. Theoretical Computer Science. 399(1-2). 38–53. 3 indexed citations

19.

Galesi, Nicola & Massimo Lauria. (2007). Extending Polynomial Calculus with k-DNF Resolution. Electronic colloquium on computational complexity. 14. 2 indexed citations

20.

Clementi, Andrea, et al.. (2007). On the bounded-hop MST problem on random Euclidean instances. Theoretical Computer Science. 384(2-3). 161–167. 4 indexed citations

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.

Explore authors with similar magnitude of impact