Goran Konjevod

2.5k total citations · 1 hit paper
49 papers, 1.5k citations indexed

About

Goran Konjevod is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Goran Konjevod has authored 49 papers receiving a total of 1.5k indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computer Networks and Communications, 18 papers in Computational Theory and Mathematics and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Goran Konjevod's work include Complexity and Algorithms in Graphs (16 papers), Advanced Graph Theory Research (15 papers) and Interconnection Networks and Systems (10 papers). Goran Konjevod is often cited by papers focused on Complexity and Algorithms in Graphs (16 papers), Advanced Graph Theory Research (15 papers) and Interconnection Networks and Systems (10 papers). Goran Konjevod collaborates with scholars based in United States, India and Germany. Goran Konjevod's co-authors include Karam S. Chatha, R. Ravi, K. Srinivasan, Naveen Garg, Hongyu Yu, Cheng Lv, Hanqing Jiang, K. Srinivasan, Robert D. Carr and Rida A. Bazzi and has published in prestigious journals such as Environmental Science & Technology, Scientific Reports and Mathematical Programming.

In The Last Decade

Goran Konjevod

47 papers receiving 1.4k citations

Hit Papers

Origami based Mechanical Metamaterials 2014 2026 2018 2022 2014 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. Origami based Mechanical Metamaterials
    2014 305 citations Cheng Lv, Goran Konjevod et al. Scientific Reports profile →

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Goran Konjevod United States 21 704 378 356 339 278 49 1.5k
Pao‐Ann Hsiung Taiwan 17 398 0.6× 562 1.5× 274 0.8× 265 0.8× 36 0.1× 185 1.2k
Mi Lu United States 17 190 0.3× 66 0.2× 348 1.0× 55 0.2× 73 0.3× 105 903
Devesh Tiwari United States 25 1.3k 1.9× 672 1.8× 548 1.5× 60 0.2× 55 0.2× 147 2.3k
Yuxin Wang China 17 262 0.4× 92 0.2× 265 0.7× 25 0.1× 91 0.3× 110 1.3k
Zhao Zhang China 21 697 1.0× 31 0.1× 265 0.7× 188 0.6× 14 0.1× 88 1.4k
Zhen Liu China 23 221 0.3× 170 0.4× 803 2.3× 26 0.1× 162 0.6× 179 1.8k
K. Baskaran India 17 283 0.4× 30 0.1× 595 1.7× 40 0.1× 95 0.3× 165 1.1k
Yilin Chen China 17 100 0.1× 49 0.1× 141 0.4× 100 0.3× 67 0.2× 38 953
Jinfeng Liu China 19 213 0.3× 46 0.1× 311 0.9× 20 0.1× 340 1.2× 87 1.8k
Sheng Xiao China 19 451 0.6× 78 0.2× 495 1.4× 31 0.1× 145 0.5× 58 1.4k

Countries citing papers authored by Goran Konjevod

Since Specialization
Citations

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

Fields of papers citing papers by Goran Konjevod

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Goran Konjevod

This figure shows the co-authorship network connecting the top 25 collaborators of Goran Konjevod. A scholar is included among the top collaborators of Goran Konjevod 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 Goran Konjevod. Goran Konjevod 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.
Konjevod, Goran, et al.. (2017). Deep Multi-modal Vehicle Detection in Aerial ISR Imagery. 916–923. 38 indexed citations
2.
Lv, Cheng, et al.. (2014). Origami based Mechanical Metamaterials. Scientific Reports. 4(1). 5979–5979. 305 indexed citations breakdown →
3.
Konjevod, Goran, et al.. (2014). Origami based Mechanical. 1 indexed citations
4.
Colbourn, Charles J., et al.. (2012). Randomized post-optimization of covering arrays. European Journal of Combinatorics. 34(1). 91–103. 22 indexed citations
5.
Chatha, Karam S., et al.. (2008). Automated Techniques for Synthesis of Application-Specific Network-on-Chip Architectures. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 27(8). 1425–1438. 25 indexed citations
6.
Carr, Robert D., Goran Konjevod, Greg Little, Venkatesh Natarajan, & Ojas Parekh. (2007). Compacting cuts: a new linear formulation for minimum cut. Symposium on Discrete Algorithms. 43–52. 5 indexed citations
7.
Konjevod, Goran, et al.. (2007). Optimal scale-free compact routing schemes in networks of low doubling dimension. Symposium on Discrete Algorithms. 939–948. 16 indexed citations
8.
Srinivasan, Krishnan, Karam S. Chatha, & Goran Konjevod. (2007). Application Specific Network-on-Chip Design with Guaranteed Quality Approximation Algorithms. 184–190. 24 indexed citations
9.
Li, Ke, Peng Zhang, John C. Crittenden, et al.. (2007). Development of a Framework for Quantifying the Environmental Impacts of Urban Development and Construction Practices. Environmental Science & Technology. 41(14). 5130–5136. 28 indexed citations
10.
Konjevod, Goran, et al.. (2006). On sampling in higher-dimensional peer-to-peer systems. 1 indexed citations
11.
Srinivasan, K., Karam S. Chatha, & Goran Konjevod. (2006). Linear-programming-based techniques for synthesis of network-on-chip architectures. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 14(4). 407–420. 198 indexed citations
12.
Bazzi, Rida A. & Goran Konjevod. (2006). On the establishment of distinct identities in overlay networks. Distributed Computing. 19(4). 267–287. 10 indexed citations
13.
Srinivasan, K., Karam S. Chatha, & Goran Konjevod. (2005). An automated technique for topology and route generation of application specific on-chip interconnection networks. International Conference on Computer Aided Design. 231–237. 78 indexed citations
14.
Carr, Robert D., Harvey J. Greenberg, William E. Hart, et al.. (2005). Robust optimization of contaminant sensor placement for community water systems. Mathematical Programming. 107(1-2). 337–356. 62 indexed citations
15.
Bazzi, Rida A. & Goran Konjevod. (2005). On the establishment of distinct identities in overlay networks. 312–320. 51 indexed citations
16.
Konjevod, Goran, et al.. (2005). A Modular Algorithm-Theoretic Framework for the Fair and Efficient Collaborative Prefetching of Continuous Media. IEEE Transactions on Broadcasting. 51(2). 200–215. 3 indexed citations
17.
Konjevod, Goran & R. Ravi. (2000). An approximation algorithm for the covering Steiner problem. Symposium on Discrete Algorithms. 338–344. 10 indexed citations
18.
Carr, Robert D., et al.. (2000). On the red-blue set cover problem. Symposium on Discrete Algorithms. 345–353. 78 indexed citations
19.
Blum, Avrim, Goran Konjevod, R. Ravi, & Santosh Vempala. (2000). Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theoretical Computer Science. 235(1). 25–42. 20 indexed citations
20.
Garg, Naveen, Goran Konjevod, & R. Ravi. (1998). A polylogarithmic approximation algorithm for the group Steiner tree problem. Symposium on Discrete Algorithms. 37(1). 253–259. 36 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 Pao‐Ann Hsiung Breakdown of academic impact, for papers by Mi Lu Breakdown of academic impact, for papers by Devesh Tiwari Breakdown of academic impact, for papers by Yuxin Wang Breakdown of academic impact, for papers by Zhao Zhang Breakdown of academic impact, for papers by Zhen Liu Breakdown of academic impact, for papers by K. Baskaran Breakdown of academic impact, for papers by Yilin Chen Breakdown of academic impact, for papers by Jinfeng Liu Breakdown of academic impact, for papers by Sheng Xiao
Rankless by CCL
2026