F. Margot

461 total citations
10 papers, 258 citations indexed

About

F. Margot is a scholar working on Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Networks and Communications. According to data from OpenAlex, F. Margot has authored 10 papers receiving a total of 258 indexed citations (citations by other indexed papers that have themselves been cited), including 6 papers in Computational Theory and Mathematics, 4 papers in Industrial and Manufacturing Engineering and 3 papers in Computer Networks and Communications. Recurrent topics in F. Margot's work include Computational Geometry and Mesh Generation (3 papers), Advanced Graph Theory Research (3 papers) and Interconnection Networks and Systems (2 papers). F. Margot is often cited by papers focused on Computational Geometry and Mesh Generation (3 papers), Advanced Graph Theory Research (3 papers) and Interconnection Networks and Systems (2 papers). F. Margot collaborates with scholars based in Switzerland and United States. F. Margot's co-authors include Th. M. Liebling, A. Prodon, Franz Josef Radermacher and Ulrich Rieder and has published in prestigious journals such as Mathematical Programming, Discrete Applied Mathematics and Operations Research Letters.

In The Last Decade

F. Margot

10 papers receiving 242 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
F. Margot Switzerland	7	132	123	63	58	45	10	258
Uwe H. Suhl Germany	9	122 0.9×	105 0.9×	34 0.5×	21 0.4×	45 1.0×	12	266
Manoel Campêlo Brazil	9	147 1.1×	101 0.8×	63 1.0×	25 0.4×	29 0.6×	34	253
Nathan W. Brixius United States	5	72 0.5×	141 1.1×	12 0.2×	16 0.3×	89 2.0×	6	261
Laura Sanità Canada	7	215 1.6×	46 0.4×	32 0.5×	89 1.5×	149 3.3×	34	350
Laurent Gourvès France	9	120 0.9×	66 0.5×	70 1.1×	25 0.4×	61 1.4×	30	223
P. M. Dearing United States	12	80 0.6×	216 1.8×	12 0.2×	10 0.2×	69 1.5×	24	391
Shengli Zhao China	12	186 1.4×	76 0.6×	285 4.5×	45 0.8×	17 0.4×	54	366
Olivier Spanjaard France	8	70 0.5×	64 0.5×	74 1.2×	6 0.1×	27 0.6×	17	189
Mikhail Batsyn Russia	10	75 0.6×	79 0.6×	19 0.3×	7 0.1×	53 1.2×	19	208
Kyoichi Nakashima Japan	8	58 0.4×	25 0.2×	27 0.4×	14 0.2×	10 0.2×	32	325

Countries citing papers authored by F. Margot

Since Specialization

Citations

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

Fields of papers citing papers by F. Margot

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of F. Margot

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

10 of 10 papers shown

1.

Margot, F., et al.. (2007). Classification of orthogonal arrays by integer programming. Journal of Statistical Planning and Inference. 138(3). 654–666. 34 indexed citations

2.

Margot, F.. (2003). Small covering designs by branch-and-cut. Mathematical Programming. 94(2-3). 207–220. 24 indexed citations

3.

Margot, F.. (2003). Exploiting orbits in symmetric ILP. Mathematical Programming. 98(1-3). 3–21. 75 indexed citations

4.

Margot, F.. (2002). Pruning by isomorphism in branch-and-cut. Mathematical Programming. 94(1). 71–90. 69 indexed citations

5.

Margot, F., et al.. (1998). A catalog of minimally nonideal matrices. Mathematical Methods of Operations Research. 47(2). 221–241. 16 indexed citations

6.

Liebling, Th. M., et al.. (1995). Disjoint Paths in the Plane. INFORMS Journal on Computing. 7(1). 84–88. 1 indexed citations

7.

Margot, F.. (1994). Some complexity results about threshold graphs. Discrete Applied Mathematics. 49(1-3). 299–308. 11 indexed citations

8.

Margot, F., A. Prodon, & Th. M. Liebling. (1994). Tree polytope on 2-trees. Mathematical Programming. 63(1-3). 183–191. 22 indexed citations

9.

Margot, F.. (1992). Quick updates for p-opt TSP heuristics. Operations Research Letters. 11(1). 45–46. 5 indexed citations

10.

Liebling, Th. M., et al.. (1989). The poset scheduling problem. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 221–230. 1 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