Gruiă Cälinescu

4.8k total citations · 1 hit paper
59 papers, 2.3k citations indexed

About

Gruiă Cälinescu is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Gruiă Cälinescu has authored 59 papers receiving a total of 2.3k indexed citations (citations by other indexed papers that have themselves been cited), including 46 papers in Computer Networks and Communications, 26 papers in Computational Theory and Mathematics and 12 papers in Electrical and Electronic Engineering. Recurrent topics in Gruiă Cälinescu's work include Complexity and Algorithms in Graphs (24 papers), Mobile Ad Hoc Networks (21 papers) and Cooperative Communication and Network Coding (18 papers). Gruiă Cälinescu is often cited by papers focused on Complexity and Algorithms in Graphs (24 papers), Mobile Ad Hoc Networks (21 papers) and Cooperative Communication and Network Coding (18 papers). Gruiă Cälinescu collaborates with scholars based in United States, Germany and Brazil. Gruiă Cälinescu's co-authors include Peng‐Jun Wan, Chandra Chekuri, J. Vondrák, Martin Pál, Ophir Frieder, Howard Karloff, Alex Zelikovsky, Yuval Rabani, X.‐Y. Li and Xiangyang Li and has published in prestigious journals such as IEEE Journal on Selected Areas in Communications, IEEE Transactions on Computers and IEEE/ACM Transactions on Networking.

In The Last Decade

Gruiă Cälinescu

57 papers receiving 2.2k citations

Hit Papers

Maximizing a Monotone Submodular Function Subject to a Ma... 2011 2026 2016 2021 2011 100 200 300
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
    2011 390 citations Gruiă Cälinescu, Chandra Chekuri et al. profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Gruiă Cälinescu United States 22 1.7k 652 630 274 256 59 2.3k
Piotr Berman United States 25 1.2k 0.7× 860 1.3× 470 0.7× 188 0.7× 410 1.6× 110 2.2k
Reuven Bar-Yehuda Israel 23 1.2k 0.7× 757 1.2× 290 0.5× 294 1.1× 220 0.9× 58 1.9k
Serge Plotkin United States 29 2.3k 1.4× 1.5k 2.3× 574 0.9× 242 0.9× 424 1.7× 69 3.3k
Jochen Könemann Canada 19 715 0.4× 497 0.8× 285 0.5× 116 0.4× 110 0.4× 50 1.2k
Yair Bartal Israel 24 1.2k 0.7× 728 1.1× 121 0.2× 182 0.7× 298 1.2× 74 1.9k
Harald Räcke United States 16 904 0.5× 525 0.8× 279 0.4× 55 0.2× 214 0.8× 50 1.3k
Greg N. Frederickson United States 30 1.3k 0.8× 1.1k 1.7× 287 0.5× 448 1.6× 425 1.7× 106 2.7k
Seth Pettie United States 20 792 0.5× 924 1.4× 130 0.2× 154 0.6× 448 1.8× 94 1.5k
Fabrizio Luccio Italy 19 559 0.3× 580 0.9× 252 0.4× 210 0.8× 586 2.3× 102 1.7k
Fabrizio Grandoni Switzerland 19 674 0.4× 870 1.3× 209 0.3× 93 0.3× 222 0.9× 84 1.4k

Countries citing papers authored by Gruiă Cälinescu

Since Specialization
Citations

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

Fields of papers citing papers by Gruiă Cälinescu

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Gruiă Cälinescu. 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 Gruiă Cälinescu. The network helps show where Gruiă Cälinescu may publish in the future.

Co-authorship network of co-authors of Gruiă Cälinescu

This figure shows the co-authorship network connecting the top 25 collaborators of Gruiă Cälinescu. A scholar is included among the top collaborators of Gruiă Cälinescu 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 Gruiă Cälinescu. Gruiă Cälinescu 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.
Cälinescu, Gruiă, et al.. (2023). An improved algorithm for finding maximum outerplanar subgraphs. Discrete Applied Mathematics. 342. 207–217. 1 indexed citations
2.
Cälinescu, Gruiă, et al.. (2022). Combination Algorithms for Steiner Tree Variants. Algorithmica. 85(1). 153–169.
3.
Cälinescu, Gruiă, et al.. (2021). A new LP rounding algorithm for the active time problem. Journal of Scheduling. 24(5). 543–552. 1 indexed citations
4.
Cälinescu, Gruiă, et al.. (2016). Improved Algorithms for Two Energy-Optimal Routing Problems in Ad-Hoc Wireless Networks. 509–516. 3 indexed citations
5.
Cälinescu, Gruiă. (2014). Relay placement for two-connectivity. Discrete Optimization. 14. 17–33. 2 indexed citations
6.
Cälinescu, Gruiă. (2014). Bounding the payment of approximate truthful mechanisms. Theoretical Computer Science. 562. 419–435. 5 indexed citations
7.
Cälinescu, Gruiă. (2014). 1.61-approximation for min-power strong connectivity with two power levels. Journal of Combinatorial Optimization. 31(1). 239–259. 5 indexed citations
8.
Cälinescu, Gruiă. (2013). Faster approximation for Symmetric Min-Power Broadcast.. Canadian Conference on Computational Geometry. 1 indexed citations
9.
Cälinescu, Gruiă & Cristina G. Fernandes. (2008). On the k-Structure Ratio in Planar and Outerplanar Graphs.. Discrete Mathematics & Theoretical Computer Science. 10(3). 1 indexed citations
10.
Cälinescu, Gruiă, et al.. (2007). Compressing rectilinear pictures and minimizing access control lists. Symposium on Discrete Algorithms. 1066–1075. 61 indexed citations
11.
Chekuri, Chandra, Gruiă Cälinescu, Martin Pál, & J. Vondrák. (2007). Maximizing a Submodular Set Function subject to a Matroid Constraint. 182–196. 136 indexed citations
12.
Cälinescu, Gruiă, et al.. (2006). Bounded-hops power assignment in ad hoc wireless networks. Discrete Applied Mathematics. 154(9). 1358–1371. 11 indexed citations
13.
Brinza, Dumitru, et al.. (2005). Energy-efficient continuous and event-driven monitoring. 167–169. 8 indexed citations
14.
Cälinescu, Gruiă, Adrian Dumitrescu, & Peng‐Jun Wan. (2004). Separating points by axis-parallel lines.. Canadian Conference on Computational Geometry. 7–10. 3 indexed citations
15.
Cälinescu, Gruiă, Ion Măndoiu, Peng‐Jun Wan, & Alex Zelikovsky. (2004). Selecting Forwarding Neighbors in Wireless Ad Hoc Networks. Mobile Networks and Applications. 9(2). 101–111. 82 indexed citations
16.
Li, Xiangyang, Gruiă Cälinescu, Peng‐Jun Wan, & Yu Wang. (2003). Localized Delaunay triangulation with application in ad hoc wireless networks. IEEE Transactions on Parallel and Distributed Systems. 14(10). 1035–1047. 157 indexed citations
17.
Cälinescu, Gruiă & Peng‐Jun Wan. (2002). Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. Theoretical Computer Science. 276(1-2). 33–50. 11 indexed citations
18.
Cälinescu, Gruiă, Howard Karloff, & Yuval Rabani. (2001). Approximation algorithms for the 0-extension problem. Symposium on Discrete Algorithms. 8–16. 50 indexed citations
19.
Cälinescu, Gruiă, Howard Karloff, & Yuval Rabani. (2000). An Improved Approximation Algorithm for MULTIWAY CUT. Journal of Computer and System Sciences. 60(3). 564–574. 76 indexed citations
20.
Wan, Peng‐Jun, Gruiă Cälinescu, & Ophir Frieder. (2000). Grooming of arbitrary traffic in SONET/WDM BLSRs. IEEE Journal on Selected Areas in Communications. 18(10). 1995–2003. 86 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

Breakdown of academic impact, for papers by Piotr Berman Breakdown of academic impact, for papers by Reuven Bar-Yehuda Breakdown of academic impact, for papers by Serge Plotkin Breakdown of academic impact, for papers by Jochen Könemann Breakdown of academic impact, for papers by Yair Bartal Breakdown of academic impact, for papers by Harald Räcke Breakdown of academic impact, for papers by Greg N. Frederickson Breakdown of academic impact, for papers by Seth Pettie Breakdown of academic impact, for papers by Fabrizio Luccio Breakdown of academic impact, for papers by Fabrizio Grandoni
Rankless by CCL
2026