Daniel Karapetyan

839 total citations
26 papers, 447 citations indexed

About

Daniel Karapetyan is a scholar working on Artificial Intelligence, Industrial and Manufacturing Engineering and Sociology and Political Science. According to data from OpenAlex, Daniel Karapetyan has authored 26 papers receiving a total of 447 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Artificial Intelligence, 12 papers in Industrial and Manufacturing Engineering and 8 papers in Sociology and Political Science. Recurrent topics in Daniel Karapetyan's work include Vehicle Routing Optimization Methods (9 papers), Access Control and Trust (8 papers) and Cryptography and Data Security (7 papers). Daniel Karapetyan is often cited by papers focused on Vehicle Routing Optimization Methods (9 papers), Access Control and Trust (8 papers) and Cryptography and Data Security (7 papers). Daniel Karapetyan collaborates with scholars based in United Kingdom, Canada and India. Daniel Karapetyan's co-authors include Gregory Gutin, Abraham P. Punnen, Andrew Parkes, Krishna T. Malladi, Shahriar Asta, Ahmed Kheiri, Ender Özcan, Jason Crampton, Andrei Gagarin and Boris Goldengorin and has published in prestigious journals such as European Journal of Operational Research, Information Sciences and Omega.

In The Last Decade

Daniel Karapetyan

25 papers receiving 421 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Daniel Karapetyan United Kingdom 10 265 156 85 79 67 26 447
Christos Voudouris United Kingdom 8 277 1.0× 134 0.9× 85 1.0× 82 1.0× 13 0.2× 14 434
Shuxin Ding China 11 98 0.4× 50 0.3× 38 0.4× 61 0.8× 68 1.0× 40 322
José Carlos Ortíz-Bayliss Mexico 15 323 1.2× 319 2.0× 159 1.9× 140 1.8× 10 0.1× 76 617
Moises Sudit United States 13 85 0.3× 151 1.0× 60 0.7× 194 2.5× 69 1.0× 28 459
Hitoshi Iima Japan 11 133 0.5× 150 1.0× 22 0.3× 71 0.9× 22 0.3× 77 349
Monte Zweben United States 8 325 1.2× 290 1.9× 83 1.0× 327 4.1× 30 0.4× 18 678
Sadok Bouamama Tunisia 12 99 0.4× 122 0.8× 23 0.3× 215 2.7× 26 0.4× 56 419
Toshiyuki Miyamoto Japan 12 183 0.7× 40 0.3× 65 0.8× 66 0.8× 9 0.1× 108 556
J.R. Yee United States 9 90 0.3× 49 0.3× 22 0.3× 274 3.5× 47 0.7× 30 443
Michael Kolonko Germany 11 174 0.7× 136 0.9× 51 0.6× 79 1.0× 53 0.8× 30 401

Countries citing papers authored by Daniel Karapetyan

Since Specialization
Citations

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

Fields of papers citing papers by Daniel Karapetyan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Daniel Karapetyan

This figure shows the co-authorship network connecting the top 25 collaborators of Daniel Karapetyan. A scholar is included among the top collaborators of Daniel Karapetyan 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 Daniel Karapetyan. Daniel Karapetyan 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.
Crampton, Jason, et al.. (2024). Bi-objective Optimization in Role Mining. ACM Transactions on Privacy and Security. 28(1). 1–22.
2.
Karapetyan, Daniel & Gregory Gutin. (2022). Solving the Workflow Satisfiability Problem Using General Purpose Solvers. IEEE Transactions on Dependable and Secure Computing. 20(6). 4474–4485. 3 indexed citations
3.
Crampton, Jason, et al.. (2021). Valued Authorization Policy Existence Problem. arXiv (Cornell University). 1 indexed citations
4.
Crampton, Jason, et al.. (2021). Valued Authorization Policy Existence Problem. 156. 83–94. 3 indexed citations
5.
Gutin, Gregory & Daniel Karapetyan. (2020). Constraint Branching in Workflow Satisfiability Problem. 9636. 93–103. 2 indexed citations
6.
Karapetyan, Daniel, Andrew Parkes, Gregory Gutin, & Andrei Gagarin. (2019). Pattern-Based Approach to the Workflow Satisfiability Problem with User-Independent Constraints. Repository@Nottingham (University of Nottingham). 10 indexed citations
7.
Karapetyan, Daniel, Abraham P. Punnen, & Andrew Parkes. (2017). Markov Chain methods for the Bipartite Boolean Quadratic Programming Problem. European Journal of Operational Research. 260(2). 494–506. 15 indexed citations
8.
Crampton, Jason, Gregory Gutin, & Daniel Karapetyan. (2015). Valued Workflow Satisfiability Problem. 3–13. 18 indexed citations
9.
Karapetyan, Daniel, et al.. (2015). Lessons from building an automated pre-departure sequencer for airports. Annals of Operations Research. 252(2). 435–453. 1 indexed citations
10.
Karapetyan, Daniel, et al.. (2015). Satellite downlink scheduling problem: A case study. Omega. 53. 115–123. 61 indexed citations
11.
Punnen, Abraham P., et al.. (2014). The quadratic balanced optimization problem. Discrete Optimization. 12. 47–60. 4 indexed citations
12.
Punnen, Abraham P., et al.. (2014). Average value of solutions for the bipartite boolean quadratic programs and rounding algorithms. Theoretical Computer Science. 565. 77–89. 7 indexed citations
13.
Karapetyan, Daniel, et al.. (2012). An Efficient Hybrid Ant Colony System for the Generalized Traveling Salesman Problem. arXiv (Cornell University). 7(1). 22–29. 6 indexed citations
14.
Karapetyan, Daniel & Gregory Gutin. (2010). Local Search Algorithms for the Generalized Traveling Salesman Problem. arXiv (Cornell University). 1 indexed citations
15.
Karapetyan, Daniel & Gregory Gutin. (2010). Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem. European Journal of Operational Research. 208(3). 221–232. 72 indexed citations
16.
Karapetyan, Daniel & Gregory Gutin. (2010). Lin-Kernighan Heuristic Adaptation for the Generalized Traveling Salesman Problem. 3 indexed citations
17.
Gutin, Gregory & Daniel Karapetyan. (2009). A memetic algorithm for the generalized traveling salesman problem. Natural Computing. 9(1). 47–60. 85 indexed citations
18.
Karapetyan, Daniel, et al.. (2009). Empirical evaluation of construction heuristics for the multidimensional assignment problem. arXiv (Cornell University). 107–122. 2 indexed citations
19.
Karapetyan, Daniel, et al.. (2008). Generalized Traveling Salesman Problem Reduction Algorithms. arXiv (Cornell University). 4(2). 144–154. 16 indexed citations
20.
Gutin, Gregory & Daniel Karapetyan. (2008). A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memetic Computing. 1(1). 25–34. 13 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