Danny Hermelin

2.4k total citations
59 papers, 799 citations indexed

About

Danny Hermelin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Danny Hermelin has authored 59 papers receiving a total of 799 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 10 papers in Artificial Intelligence. Recurrent topics in Danny Hermelin's work include Advanced Graph Theory Research (37 papers), Complexity and Algorithms in Graphs (27 papers) and Optimization and Search Problems (17 papers). Danny Hermelin is often cited by papers focused on Advanced Graph Theory Research (37 papers), Complexity and Algorithms in Graphs (27 papers) and Optimization and Search Problems (17 papers). Danny Hermelin collaborates with scholars based in Israel, Germany and United States. Danny Hermelin's co-authors include Michael R. Fellows, Rodney G. Downey, Hans L. Bodlaender, Stéphane Vialette, Frances Rosamond, Ilan Newman, Oren Ben-Zwi, Daniel Lokshtanov, Dvir Shabtay and Dror Rawitz and has published in prestigious journals such as European Journal of Operational Research, Omega and Engineering Applications of Artificial Intelligence.

In The Last Decade

Danny Hermelin

56 papers receiving 770 citations

Peers

Danny Hermelin

CTM

CNC

IME

Stefan Kratsch Germany

Falk Hüffner Germany

Frances Rosamond Australia

Thore Husfeldt Denmark

Marcin Pilipczuk Poland

Michał Pilipczuk Poland

Christian Komusiewicz Germany

Petr A. Golovach Norway

Feodor F. Dragan United States

Henning Fernau Germany

Stefan Kratsch Germany

Danny Hermelin

553 ×1.0

CTM

188 ×0.8

CNC

110 ×0.8

61 ×0.7

IME

48 ×0.6

Citations per year, relative to Danny Hermelin Danny Hermelin (= 1×) peers Stefan Kratsch

Countries citing papers authored by Danny Hermelin

Since Specialization

Citations

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

Fields of papers citing papers by Danny Hermelin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Danny Hermelin

This figure shows the co-authorship network connecting the top 25 collaborators of Danny Hermelin. A scholar is included among the top collaborators of Danny Hermelin 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 Danny Hermelin. Danny Hermelin 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

Hermelin, Danny, Hendrik Molter, Rolf Niedermeier, Michael Pinedo, & Dvir Shabtay. (2025). Fairness in repetitive scheduling. European Journal of Operational Research. 323(3). 724–738. 2 indexed citations

Hermelin, Danny, Hendrik Molter, & Dvir Shabtay. (2023). Minimizing the Weighted Number of Tardy Jobs via (max,+)-Convolutions. INFORMS journal on computing. 36(3). 836–848. 1 indexed citations

Hermelin, Danny, et al.. (2022). A general scheme for solving a large set of scheduling problems with rejection in FPT time. Journal of Scheduling. 25(2). 229–255. 4 indexed citations

Hermelin, Danny, et al.. (2022). Equitable scheduling on a single machine. Journal of Scheduling. 26(2). 209–225. 5 indexed citations

Hermelin, Danny, et al.. (2019). On approximate preprocessing for domination and hitting subgraphs with connected deletion sets. Journal of Computer and System Sciences. 105. 158–170. 1 indexed citations

Chen, Jiehua, et al.. (2018). How hard is it to satisfy (almost) all roommates. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 15. 2 indexed citations

Bringmann, Karl, Danny Hermelin, Matthias Mnich, & Erik Jan van Leeuwen. (2016). Parameterized complexity dichotomy for Steiner Multicut. Journal of Computer and System Sciences. 82(6). 1020–1043. 3 indexed citations

Hermelin, Danny, Julián Mestre, & Dror Rawitz. (2014). Optimization problems in dotted interval graphs. Discrete Applied Mathematics. 174. 66–72. 4 indexed citations

Guo, Jiong, Danny Hermelin, & Christian Komusiewicz. (2013). Local search for string problems: Brute-force is essentially optimal. Theoretical Computer Science. 525. 30–41. 7 indexed citations

10.

Fellows, Michael R., Tobias Friedrich, Danny Hermelin, Nina Narodytska, & Frances Rosamond. (2012). Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable. Theoretical Computer Science. 472. 81–89. 4 indexed citations

11.

Hermelin, Danny, Sylvain Charlat, Jan Engelstädter, et al.. (2012). Mod/Resc Parsimony Inference: Theory and application. Information and Computation. 213. 23–32. 5 indexed citations

12.

Fellows, Michael R., Tobias Friedrich, Danny Hermelin, Nina Narodytska, & Frances Rosamond. (2011). Constraint satisfaction problems: convexity makes all different constraints tractable. Max Planck Institute for Plasma Physics. 522–527. 10 indexed citations

13.

Bar-Yehuda, Reuven, Danny Hermelin, & Dror Rawitz. (2011). Minimum vertex cover in rectangle graphs. Computational Geometry. 44(6-7). 356–364. 3 indexed citations

14.

Fellows, Michael R., Guillaume Fertin, Danny Hermelin, & Stéphane Vialette. (2010). Upper and lower bounds for finding connected motifs in vertex-colored graphs. Journal of Computer and System Sciences. 77(4). 799–811. 28 indexed citations

15.

Hermelin, Danny & Dror Rawitz. (2010). Optimization problems in multiple subtree graphs. Discrete Applied Mathematics. 159(7). 588–594. 1 indexed citations

16.

Bodlaender, Hans L., Rodney G. Downey, Michael R. Fellows, & Danny Hermelin. (2009). On problems without polynomial kernels. Journal of Computer and System Sciences. 75(8). 423–434. 208 indexed citations

17.

Blin, Guillaume, Guillaume Fertin, Danny Hermelin, & Stéphane Vialette. (2008). Fixed-parameter algorithms for protein similarity search under mRNA structure constraints. Journal of Discrete Algorithms. 6(4). 618–626. 5 indexed citations

18.

Fellows, Michael R., Danny Hermelin, Frances Rosamond, & Stéphane Vialette. (2008). On the parameterized complexity of multiple-interval graph problems. Theoretical Computer Science. 410(1). 53–61. 140 indexed citations

19.

Backofen, Rolf, Danny Hermelin, Gad M. Landau, et al.. (2007). Locality and Gaps in RNA Comparison. Journal of Computational Biology. 14(8). 1074–1087. 8 indexed citations

20.

Hermelin, Danny, et al.. (2007). Optimization problems in multiple-interval graphs. Symposium on Discrete Algorithms. 268–277. 9 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