Benoît Larose

870 total citations
43 papers, 422 citations indexed

About

Benoît Larose is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, Benoît Larose has authored 43 papers receiving a total of 422 indexed citations (citations by other indexed papers that have themselves been cited), including 41 papers in Computational Theory and Mathematics, 11 papers in Geometry and Topology and 10 papers in Computer Networks and Communications. Recurrent topics in Benoît Larose's work include Advanced Graph Theory Research (29 papers), Advanced Algebra and Logic (14 papers) and Complexity and Algorithms in Graphs (12 papers). Benoît Larose is often cited by papers focused on Advanced Graph Theory Research (29 papers), Advanced Algebra and Logic (14 papers) and Complexity and Algorithms in Graphs (12 papers). Benoît Larose collaborates with scholars based in Canada, United Kingdom and Spain. Benoît Larose's co-authors include Claude Tardif, Claudia Malvenuto, Andrei Krokhin, Pascal Tesson, Víctor Dalmau, François Laviolette, Hubie Chen, Matthew Valeriote, Adrien Lemaître and Arash Rafiey and has published in prestigious journals such as Advances in Mathematics, Theoretical Computer Science and Discrete Mathematics.

In The Last Decade

Benoît Larose

39 papers receiving 381 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Benoît Larose Canada	12	335	145	136	92	59	43	422
Michael Pinsker Austria	11	303 0.9×	161 1.1×	61 0.4×	181 2.0×	71 1.2×	46	361
Marcin Kozik Poland	10	376 1.1×	233 1.6×	39 0.3×	42 0.5×	55 0.9×	26	414
János Barát Hungary	9	215 0.6×	36 0.2×	127 0.9×	47 0.5×	35 0.6×	42	270
Charles Vanden Eynden United States	11	137 0.4×	28 0.2×	98 0.7×	52 0.6×	113 1.9×	55	305
Stephen C. Locke United States	10	263 0.8×	60 0.4×	174 1.3×	96 1.0×	19 0.3×	32	314
Po‐Shen Loh United States	11	281 0.8×	27 0.2×	269 2.0×	158 1.7×	23 0.4×	36	358
H. Meyniel France	11	293 0.9×	42 0.3×	108 0.8×	88 1.0×	29 0.5×	16	343
Omid Amini France	9	142 0.4×	39 0.3×	35 0.3×	75 0.8×	14 0.2×	28	207
Petar Marković Serbia	9	210 0.6×	89 0.6×	30 0.2×	25 0.3×	45 0.8×	24	241
Donald J. Miller Canada	8	262 0.8×	46 0.3×	104 0.8×	82 0.9×	10 0.2×	11	290

Countries citing papers authored by Benoît Larose

Since Specialization

Citations

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

Fields of papers citing papers by Benoît Larose

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Benoît Larose

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

Larose, Benoît, et al.. (2022). QCSP on Reflexive Tournaments. ACM Transactions on Computational Logic. 23(3). 1–22.

Bulatov, Andreĭ A., et al.. (2019). Long range actions, connectedness, and dismantlability in relational structures.. arXiv (Cornell University). 1 indexed citations

Dalmau, Víctor, et al.. (2015). Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy. 487–498. 1 indexed citations

Feder, Tomás, et al.. (2014). Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case. SIAM Journal on Discrete Mathematics. 28(2). 817–834.

Larose, Benoît & Adrien Lemaître. (2013). List-homomorphism problems on graphs and arc consistency. Discrete Mathematics. 313(22). 2525–2537. 3 indexed citations

Feder, Tomás, et al.. (2013). Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case. SIAM Journal on Discrete Mathematics. 27(4). 1940–1963. 2 indexed citations

Krokhin, Andrei, et al.. (2011). The Complexity of the List Homomorphism Problem for Graphs. Theory of Computing Systems. 51(2). 143–178. 11 indexed citations

Larose, Benoît, et al.. (2007). Symmetric Datalog and Constraint Satisfaction Problems in Logspace.. Electronic colloquium on computational complexity. 14.

Dalmau, Víctor, Andrei Krokhin, & Benoît Larose. (2007). Retractions onto series-parallel posets. Discrete Mathematics. 308(11). 2104–2114. 1 indexed citations

10.

Larose, Benoît, et al.. (2007). A Characterisation of First-Order Constraint Satisfaction Problems. Logical Methods in Computer Science. Volume 3, Issue 4. 30 indexed citations

11.

Larose, Benoît & Pascal Tesson. (2007). Universal Algebra and Hardness Results for Constraint Satisfaction Problems. Theoretical Computer Science. 410(18). 1629–1647. 1 indexed citations

12.

Larose, Benoît, et al.. (2007). Symmetric Datalog and Constraint Satisfaction Problems in Logspace. 20 indexed citations

13.

Dalmau, Víctor, Andrei Krokhin, & Benoît Larose. (2006). First-order Definable Retraction Problems for Posets and Reflexive Graphs. Journal of Logic and Computation. 17(1). 31–51. 3 indexed citations

14.

Dalmau, Víctor, Andrei Krokhin, & Benoît Larose. (2004). First-order definable retraction problems for posets and reflexive graphs. Durham Research Online (Durham University). 28. 232–241. 4 indexed citations

15.

Larose, Benoît & Claudia Malvenuto. (2003). Stable sets of maximal size in Kneser-type graphs. European Journal of Combinatorics. 25(5). 657–673. 70 indexed citations

16.

Larose, Benoît. (2003). Mailbox�A Note on minimal varieties generated by order-primal algebras. Algebra Universalis. 49(1). 107–109. 1 indexed citations

17.

Larose, Benoît. (2002). Strongly Projective Graphs. Canadian Journal of Mathematics. 54(4). 757–768. 1 indexed citations

18.

Larose, Benoît, François Laviolette, & Claude Tardif. (1998). On Normal Cayley Graphs and Hom-idempotent Graphs. European Journal of Combinatorics. 19(7). 867–881. 14 indexed citations

19.

Larose, Benoît, et al.. (1997). Algebraic properties and dismantlability of finite posets. Discrete Mathematics. 163(1-3). 89–99. 18 indexed citations

20.

Larose, Benoît. (1991). Finite projective ordered sets. Order. 8(1). 33–40. 8 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