Camil Demetrescu

2.5k total citations
88 papers, 1.2k citations indexed

About

Camil Demetrescu is a scholar working on Computer Networks and Communications, Artificial Intelligence and Hardware and Architecture. According to data from OpenAlex, Camil Demetrescu has authored 88 papers receiving a total of 1.2k indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Computer Networks and Communications, 21 papers in Artificial Intelligence and 18 papers in Hardware and Architecture. Recurrent topics in Camil Demetrescu's work include Parallel Computing and Optimization Techniques (18 papers), Complexity and Algorithms in Graphs (15 papers) and Software Testing and Debugging Techniques (14 papers). Camil Demetrescu is often cited by papers focused on Parallel Computing and Optimization Techniques (18 papers), Complexity and Algorithms in Graphs (15 papers) and Software Testing and Debugging Techniques (14 papers). Camil Demetrescu collaborates with scholars based in Italy, Romania and United Kingdom. Camil Demetrescu's co-authors include Giuseppe F. Italiano, Irene Finocchi, Emilio Coppa, Daniele Cono D’Elia, David S. Johnson, Andrew V. Goldberg, Mikkel Thorup, Marco Schaerf, Pierluigi Crescenzi and Rezaul Chowdhury and has published in prestigious journals such as Tectonophysics, Geophysical Journal International and IEEE Transactions on Software Engineering.

In The Last Decade

Camil Demetrescu

85 papers receiving 1.1k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Camil Demetrescu Italy 20 499 310 253 228 173 88 1.2k
Ramarathnam Venkatesan India 22 392 0.8× 226 0.7× 609 2.4× 169 0.7× 380 2.2× 98 2.0k
Feng Chen China 21 1.3k 2.6× 196 0.6× 648 2.6× 276 1.2× 301 1.7× 151 2.4k
Ricardo Vilalta United States 17 417 0.8× 140 0.5× 1.1k 4.5× 160 0.7× 393 2.3× 56 2.1k
Jan Van Leeuwen Netherlands 9 283 0.6× 370 1.2× 414 1.6× 88 0.4× 63 0.4× 25 1.0k
David P. Helmbold United States 25 829 1.7× 283 0.9× 1.2k 4.9× 98 0.4× 214 1.2× 73 2.5k
Anshul Gupta United States 19 844 1.7× 522 1.7× 317 1.3× 100 0.4× 196 1.1× 82 1.9k
Dror Maydan United States 13 621 1.2× 130 0.4× 230 0.9× 47 0.2× 130 0.8× 17 1.4k
Prasanna Balaprakash United States 22 342 0.7× 158 0.5× 483 1.9× 43 0.2× 146 0.8× 115 1.7k
Barbara Chapman United States 19 1.4k 2.9× 191 0.6× 361 1.4× 81 0.4× 391 2.3× 169 2.5k
Al Geist United States 14 1.3k 2.6× 192 0.6× 338 1.3× 82 0.4× 329 1.9× 31 2.3k

Countries citing papers authored by Camil Demetrescu

Since Specialization
Citations

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

Fields of papers citing papers by Camil Demetrescu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Camil Demetrescu

This figure shows the co-authorship network connecting the top 25 collaborators of Camil Demetrescu. A scholar is included among the top collaborators of Camil Demetrescu 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 Camil Demetrescu. Camil Demetrescu is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Coppa, Emilio, Heng Yin, & Camil Demetrescu. (2022). SymFusion: Hybrid Instrumentation for Concolic Execution. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 1–12. 5 indexed citations
2.
Coppa, Emilio, et al.. (2022). SENinja: A symbolic execution plugin for Binary Ninja. SoftwareX. 20. 101219–101219.
3.
Coppa, Emilio, et al.. (2021). FUZZOLIC: Mixing fuzzing and concolic execution. Computers & Security. 108. 102368–102368. 14 indexed citations
4.
Angelini, Marco, et al.. (2019). SymNav: Visually Assisting Symbolic Execution. IRIS Research product catalog (Sapienza University of Rome). 1–11. 6 indexed citations
5.
Coppa, Emilio, et al.. (2019). Memory models in symbolic execution: key ideas and new thoughts. Software Testing Verification and Reliability. 29(8). 10 indexed citations
6.
Demetrescu, Camil, et al.. (2011). Reactive imperative programming with dataflow constraints. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 407–426. 17 indexed citations
7.
D’Elia, Daniele Cono, Camil Demetrescu, & Irene Finocchi. (2011). Mining hot calling contexts in small space. IRIS - Institutional Research Information System (Libera Università Internazionale degli Studi Sociali Guido Carli). 516–527. 23 indexed citations
8.
Demetrescu, Camil, Andrew V. Goldberg, & David S. Johnson. (2009). The Shortest Path Problem. 64 indexed citations
9.
Demetrescu, Camil, et al.. (2009). Trading off space for passes in graph streaming problems. ACM Transactions on Algorithms. 6(1). 1–17. 14 indexed citations
10.
Demetrescu, Camil, et al.. (2007). Thermal signal propagation in soils in Romania: conductive and non-conductive processes. Climate of the past. 3(4). 637–645. 13 indexed citations
11.
Demetrescu, Camil & Giuseppe F. Italiano. (2006). Fully dynamic all pairs shortest paths with real edge weights. Journal of Computer and System Sciences. 72(5). 813–837. 44 indexed citations
12.
Demetrescu, Camil, et al.. (2006). Trading off space for passes in graph streaming problems. Symposium on Discrete Algorithms. 714–723. 27 indexed citations
13.
Demetrescu, Camil & Giuseppe F. Italiano. (2006). Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures. Journal of Discrete Algorithms. 4(3). 353–383. 19 indexed citations
14.
Demetrescu, Camil, et al.. (2004). Experimental analysis of dynamic all pairs shortest path algorithms. Symposium on Discrete Algorithms. 369–378. 29 indexed citations
15.
Demetrescu, Camil, Irene Finocchi, & Giuseppe F. Italiano. (2003). Algorithm engineering, Algorithmics Column.. Bulletin of the European Association for Theoretical Computer Science. 79. 48–63. 2 indexed citations
16.
Demetrescu, Camil & Irene Finocchi. (2003). Combinatorial algorithms for feedback problems in directed graphs. Information Processing Letters. 86(3). 129–136. 27 indexed citations
17.
Demetrescu, Camil & Mikkel Thorup. (2002). Oracles for distances avoiding a link-failure. Symposium on Discrete Algorithms. 838–843. 11 indexed citations
18.
Demetrescu, Camil & Irene Finocchi. (2001). Smooth Animation of Algorithms in a Declarative Framework. Journal of Visual Languages & Computing. 12(3). 253–281. 8 indexed citations
19.
Demetrescu, Camil & Giuseppe F. Italiano. (2000). What Do We Learn from Experimental Algorithmics?. 1 indexed citations
20.
Demetrescu, Camil, et al.. (1988). Induction model for the secular variation of the geomagnetic field in Europe. Physics of The Earth and Planetary Interiors. 50(3). 261–271. 5 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

Rankless by CCL
2026