Hervé Kerivin

665 total citations
30 papers, 413 citations indexed

About

Hervé Kerivin is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Electrical and Electronic Engineering. According to data from OpenAlex, Hervé Kerivin has authored 30 papers receiving a total of 413 indexed citations (citations by other indexed papers that have themselves been cited), including 14 papers in Computational Theory and Mathematics, 10 papers in Computer Networks and Communications and 10 papers in Electrical and Electronic Engineering. Recurrent topics in Hervé Kerivin's work include Advanced Graph Theory Research (12 papers), Advanced Optical Network Technologies (10 papers) and Complexity and Algorithms in Graphs (8 papers). Hervé Kerivin is often cited by papers focused on Advanced Graph Theory Research (12 papers), Advanced Optical Network Technologies (10 papers) and Complexity and Algorithms in Graphs (8 papers). Hervé Kerivin collaborates with scholars based in France, United States and Canada. Hervé Kerivin's co-authors include Walid Ben‐Ameur, A. Ridha Mahjoub, Ali Ridha Mahjoub, Dritan Nace, Alain Quilliot, Margaret M. Wiecek, Renaud Sirdey, Jacques Carlier, Francisco Barahona and Jinhua Zhao and has published in prestigious journals such as SHILAP Revista de lepidopterología, Communications of the ACM and European Journal of Operational Research.

In The Last Decade

Hervé Kerivin

27 papers receiving 382 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Hervé Kerivin France	11	160	158	127	126	56	30	413
A. Ridha Mahjoub France	13	149 0.9×	173 1.1×	234 1.8×	235 1.9×	24 0.4×	53	504
Marie-Christine Costa France	10	71 0.4×	65 0.4×	85 0.7×	87 0.7×	37 0.7×	21	293
Thiago F. Noronha Brazil	11	83 0.5×	104 0.7×	281 2.2×	78 0.6×	79 1.4×	36	453
Christian Raack Germany	12	198 1.2×	328 2.1×	92 0.7×	43 0.3×	74 1.3×	30	500
Cristina Requejo Portugal	10	41 0.3×	71 0.4×	275 2.2×	67 0.5×	44 0.8×	27	407
Éric Gourdin France	12	236 1.5×	134 0.8×	216 1.7×	40 0.3×	15 0.3×	31	507
Jean-Marie Bourjolly Canada	9	76 0.5×	41 0.3×	173 1.4×	123 1.0×	34 0.6×	18	381
Eduardo G. Pardo Spain	13	96 0.6×	41 0.3×	414 3.3×	93 0.7×	39 0.7×	39	591
Pierre Chardaire United Kingdom	10	74 0.5×	54 0.3×	153 1.2×	54 0.4×	15 0.3×	15	328
Alain Sutter France	11	116 0.7×	63 0.4×	177 1.4×	101 0.8×	13 0.2×	13	360

Countries citing papers authored by Hervé Kerivin

Since Specialization

Citations

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

Fields of papers citing papers by Hervé Kerivin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Hervé Kerivin

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

Kerivin, Hervé, et al.. (2024). On non-superperfection of edge intersection graphs of paths. Discrete Optimization. 54. 100857–100857.

Kerivin, Hervé, et al.. (2023). Solving the routing and spectrum assignment problem, driven by combinatorial properties. Networks. 83(2). 390–407. 1 indexed citations

Baı̈ou, Mourad, et al.. (2023). Complexity, algorithmic, and computational aspects of a dial-a-ride type problem. European Journal of Operational Research. 310(2). 552–565.

Baı̈ou, Mourad, et al.. (2022). The complexity of the unit stop number problem and its implications to other related problems. Theoretical Computer Science. 919. 36–46. 2 indexed citations

Qin, Guoyang, et al.. (2022). Toward Privacy-Aware Multimodal Transportation: Convergence to Network Equilibrium under Differential Privacy. SSRN Electronic Journal. 3 indexed citations

Kerivin, Hervé, et al.. (2019). A novel integer linear programming model for routing and spectrum assignment in optical networks. SHILAP Revista de lepidopterología. 18. 127–134. 3 indexed citations

Kerivin, Hervé, et al.. (2018). Robust multiobjective optimization with application to Internet routing. Annals of Operations Research. 271(2). 487–525. 21 indexed citations

Kerivin, Hervé, et al.. (2017). Minimal arc-sets spanning dicycles. Discrete Applied Mathematics. 240. 33–43.

Kerivin, Hervé, et al.. (2014). Polyhedral study of the connected subgraph problem. Discrete Mathematics. 338(1). 80–92. 7 indexed citations

10.

Kerivin, Hervé & Jinhua Zhao. (2014). Polyhedral study for the maximum bounded r-tree problem. 140–145. 1 indexed citations

11.

Kerivin, Hervé, et al.. (2012). On the complexity of the Eulerian closed walk with precedence path constraints problem. Theoretical Computer Science. 439. 16–29. 1 indexed citations

12.

Kerivin, Hervé, et al.. (2010). On the complexity of the Eulerian closed walk with precedence path constraints problem. Electronic Notes in Discrete Mathematics. 36. 899–906. 1 indexed citations

13.

Kerivin, Hervé, et al.. (2008). On the Polytope of the (1,2)-Survivable Network Design Problem. SIAM Journal on Discrete Mathematics. 22(4). 1640–1666. 1 indexed citations

14.

Sirdey, Renaud, Jacques Carlier, Hervé Kerivin, & Dritan Nace. (2006). On a resource-constrained scheduling problem with application to distributed systems reconfiguration. European Journal of Operational Research. 183(2). 546–563. 11 indexed citations

15.

Kerivin, Hervé & Ali Ridha Mahjoub. (2005). On survivable network polyhedra. Discrete Mathematics. 290(2-3). 183–210. 11 indexed citations

16.

Kerivin, Hervé & A. Ridha Mahjoub. (2005). Design of Survivable Networks: A survey. Networks. 46(1). 1–21. 101 indexed citations

17.

Ben‐Ameur, Walid & Hervé Kerivin. (2005). Routing of Uncertain Traffic Demands. Optimization and Engineering. 6(3). 283–313. 98 indexed citations

18.

Barahona, Francisco & Hervé Kerivin. (2004). Separation of partition inequalities with terminals. Discrete Optimization. 1(2). 129–140. 3 indexed citations

19.

Kerivin, Hervé & Walid Ben‐Ameur. (2003). NEW ECONOMICAL VIRTUAL PRIVATE NETWORKS. Communications of the ACM. 46(6). 69–73. 31 indexed citations

20.

Kerivin, Hervé & Ali Ridha Mahjoub. (2002). Separation of partition inequalities for the (1,2)-survivable network design problem. Operations Research Letters. 30(4). 265–268. 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