Frédéric Roupin

410 total citations
18 papers, 210 citations indexed

About

Frédéric Roupin is a scholar working on Computational Theory and Mathematics, Numerical Analysis and Industrial and Manufacturing Engineering. According to data from OpenAlex, Frédéric Roupin has authored 18 papers receiving a total of 210 indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Computational Theory and Mathematics, 10 papers in Numerical Analysis and 6 papers in Industrial and Manufacturing Engineering. Recurrent topics in Frédéric Roupin's work include Complexity and Algorithms in Graphs (13 papers), Advanced Optimization Algorithms Research (10 papers) and Advanced Graph Theory Research (7 papers). Frédéric Roupin is often cited by papers focused on Complexity and Algorithms in Graphs (13 papers), Advanced Optimization Algorithms Research (10 papers) and Advanced Graph Theory Research (7 papers). Frédéric Roupin collaborates with scholars based in France, United States and Canada. Frédéric Roupin's co-authors include Jérôme Malick, Nathan Krislock, Marie-Christine Costa, Alain Billionnet, Laurent Alfandari, Camille Coti and Roberto Wolfler Calvo and has published in prestigious journals such as European Journal of Operational Research, Mathematical Programming and Computers & Operations Research.

In The Last Decade

Frédéric Roupin

17 papers receiving 196 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Frédéric Roupin France	8	121	65	64	52	40	18	210
Karl Heinz Borgwardt Germany	6	97 0.8×	75 1.2×	34 0.5×	37 0.7×	31 0.8×	14	217
Lorant Porkolab Germany	9	104 0.9×	44 0.7×	128 2.0×	119 2.3×	32 0.8×	14	267
A.M.H. Gerards Netherlands	11	361 3.0×	41 0.6×	97 1.5×	64 1.2×	28 0.7×	33	431
Aaron Sidford United States	8	90 0.7×	18 0.3×	56 0.9×	6 0.1×	146 3.6×	20	245
Kiyohito Nagano Japan	8	104 0.9×	7 0.1×	113 1.8×	13 0.3×	69 1.7×	11	224
Yahia Lebbah Algeria	7	66 0.5×	28 0.4×	47 0.7×	8 0.2×	31 0.8×	31	147
Glencora Borradaile United States	11	193 1.6×	6 0.1×	94 1.5×	21 0.4×	41 1.0×	31	293
Deepankar Medhi United States	7	28 0.2×	23 0.4×	200 3.1×	19 0.4×	34 0.8×	12	285
Rémi Triolet France	5	115 1.0×	6 0.1×	367 5.7×	8 0.2×	151 3.8×	7	601
Bertrand Cottenceau France	11	364 3.0×	7 0.1×	64 1.0×	42 0.8×	19 0.5×	38	431

Countries citing papers authored by Frédéric Roupin

Since Specialization

Citations

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

Fields of papers citing papers by Frédéric Roupin

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Frédéric Roupin

This figure shows the co-authorship network connecting the top 25 collaborators of Frédéric Roupin. A scholar is included among the top collaborators of Frédéric Roupin 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 Frédéric Roupin. Frédéric Roupin 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:

18 of 18 papers shown

Krislock, Nathan, Jérôme Malick, & Frédéric Roupin. (2017). BiqCrunch. ACM Transactions on Mathematical Software. 43(4). 1–23. 26 indexed citations

Roupin, Frédéric, et al.. (2017). Solving 0-1 Quadratic Problems with Two-Level Parallelization of the BiqCrunch Solver. Annals of Computer Science and Information Systems. 11. 445–452.

Krislock, Nathan, Jérôme Malick, & Frédéric Roupin. (2015). Computational results of a semidefinite branch-and-bound algorithm for k-cluster. Computers & Operations Research. 66. 153–159. 17 indexed citations

Alfandari, Laurent, et al.. (2015). Fast machine reassignment. Annals of Operations Research. 242(1). 133–160. 3 indexed citations

Malick, Jérôme & Frédéric Roupin. (2012). On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0–1 quadratic problems leading to quasi-Newton methods. Mathematical Programming. 140(1). 99–124. 12 indexed citations

Krislock, Nathan, Jérôme Malick, & Frédéric Roupin. (2012). Improved semidefinite branch-and-bound algorithm for k-cluster. 1 indexed citations

Krislock, Nathan, Jérôme Malick, & Frédéric Roupin. (2012). Improved semidefinite bounding procedure for solving Max-Cut problems to optimality. Mathematical Programming. 143(1-2). 61–86. 24 indexed citations

Malick, Jérôme & Frédéric Roupin. (2012). Solving $$k$$ -cluster problems to optimality with semidefinite programming. Mathematical Programming. 136(2). 279–300. 18 indexed citations

Malick, Jérôme & Frédéric Roupin. (2010). Numerical Study of Semidefinite Bounds for the k-cluster Problem. Electronic Notes in Discrete Mathematics. 36. 399–406. 3 indexed citations

10.

Roupin, Frédéric. (2009). Semidefinite relaxations of the quadratic assignment problem in a Lagrangian framework. International Journal of Mathematics in Operational Research. 1(1/2). 144–144. 1 indexed citations

11.

Roupin, Frédéric, et al.. (2008). Cardinality constrained and multicriteria (multi)cut problems. Journal of Discrete Algorithms. 7(1). 102–111. 2 indexed citations

12.

Roupin, Frédéric & Alain Billionnet. (2008). A deterministic approximation algorithm for the Densest k-Subgraph Problem. International Journal of Operational Research. 3(3). 301–301. 7 indexed citations

13.

Costa, Marie-Christine, et al.. (2008). Multicuts and integral multiflows in rings. European Journal of Operational Research. 196(3). 1251–1254. 5 indexed citations

14.

Costa, Marie-Christine, et al.. (2006). Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. Journal of Discrete Algorithms. 5(1). 36–54. 3 indexed citations

15.

Roupin, Frédéric, et al.. (2006). Partial Lagrangian relaxation for general quadratic programming. 4OR. 5(1). 75–88. 23 indexed citations

16.

Costa, Marie-Christine, et al.. (2004). Minimal multicut and maximal integer multiflow: A survey. European Journal of Operational Research. 162(1). 55–69. 53 indexed citations

17.

Costa, Marie-Christine, et al.. (2002). A greedy algorithm for multicut and integral multiflow in rooted trees. Operations Research Letters. 31(1). 21–27. 7 indexed citations

18.

Roupin, Frédéric. (1997). On approximating the memory-Constrained Module Allocation Problem. Information Processing Letters. 61(4). 205–208. 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