Bernard Ries

986 total citations
62 papers, 440 citations indexed

About

Bernard Ries is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Bernard Ries has authored 62 papers receiving a total of 440 indexed citations (citations by other indexed papers that have themselves been cited), including 51 papers in Computational Theory and Mathematics, 21 papers in Computer Networks and Communications and 15 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Bernard Ries's work include Advanced Graph Theory Research (49 papers), Graph Labeling and Dimension Problems (18 papers) and Complexity and Algorithms in Graphs (16 papers). Bernard Ries is often cited by papers focused on Advanced Graph Theory Research (49 papers), Graph Labeling and Dimension Problems (18 papers) and Complexity and Algorithms in Graphs (16 papers). Bernard Ries collaborates with scholars based in France, Switzerland and United Kingdom. Bernard Ries's co-authors include D. de Werra, Christophe Picouleau, Tınaz Ekim, Rico Zenklusen, Vadim Lozin, Marc Demange, Yori Zwólš, Maria Chudnovsky, Jérôme Monnot and Daniël Paulusma and has published in prestigious journals such as European Journal of Operational Research, IEEE/ACM Transactions on Networking and Annals of Operations Research.

In The Last Decade

Bernard Ries

57 papers receiving 421 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Bernard Ries France 12 275 143 98 86 65 62 440
Ali Ridha Mahjoub France 15 512 1.9× 112 0.8× 209 2.1× 245 2.8× 49 0.8× 41 701
T. C. Hu United States 5 121 0.4× 117 0.8× 59 0.6× 57 0.7× 19 0.3× 10 293
D.J. Guan Taiwan 10 101 0.4× 124 0.9× 45 0.5× 113 1.3× 44 0.7× 37 376
Roberto Solis-Oba Canada 12 122 0.4× 179 1.3× 42 0.4× 221 2.6× 8 0.1× 46 408
Ewald Speckenmeyer Germany 8 341 1.2× 199 1.4× 32 0.3× 33 0.4× 18 0.3× 26 446
Daniel E. Steffy United States 8 183 0.7× 113 0.8× 66 0.7× 100 1.2× 3 0.0× 16 388
Laura Sanità Canada 7 215 0.8× 149 1.0× 89 0.9× 46 0.5× 4 0.1× 34 350
Toshimasa Watanabe Japan 11 302 1.1× 186 1.3× 51 0.5× 47 0.5× 8 0.1× 37 380
Richard Borie United States 9 165 0.6× 122 0.9× 21 0.2× 8 0.1× 21 0.3× 21 308
Bertrand Estellon France 10 82 0.3× 42 0.3× 13 0.1× 112 1.3× 14 0.2× 18 267

Countries citing papers authored by Bernard Ries

Since Specialization
Citations

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

Fields of papers citing papers by Bernard Ries

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Bernard Ries

This figure shows the co-authorship network connecting the top 25 collaborators of Bernard Ries. A scholar is included among the top collaborators of Bernard Ries 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 Bernard Ries. Bernard Ries is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Paulusma, Daniël, et al.. (2024). Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. Theoretical Computer Science. 1017. 114795–114795. 1 indexed citations
2.
Ries, Bernard, et al.. (2024). Finding k-community structures in special graph classes. Discrete Applied Mathematics. 359. 159–175.
3.
Ries, Bernard, et al.. (2024). On blockers and transversals of maximum independent sets in co-comparability graphs. Discrete Applied Mathematics. 356. 307–321.
4.
Ries, Bernard, et al.. (2020). Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Research Portal (Queen's University Belfast). 4 indexed citations
5.
Golovach, Petr A., Daniël Paulusma, & Bernard Ries. (2014). Coloring graphs characterized by a forbidden subgraph. Discrete Applied Mathematics. 180. 101–110. 10 indexed citations
6.
Golumbic, Martin Charles, et al.. (2014). Characterizations of cographs as intersection graphs of paths on a grid. Discrete Applied Mathematics. 178. 46–57. 11 indexed citations
7.
Hertz, Alain & Bernard Ries. (2013). A Note on \(r\)-Equitable \(k\)-Colorings of Trees. PolyPublie (École Polytechnique de Montréal). 1–8. 1 indexed citations
8.
Dabrowski, Konrad K., Vadim Lozin, Rajiv Raman, & Bernard Ries. (2012). Colouring vertices of triangle-free graphs without forests. Discrete Mathematics. 312(7). 1372–1385. 26 indexed citations
9.
Bazgan, Cristina, et al.. (2012). The firefighter problem with more than one firefighter on trees. Discrete Applied Mathematics. 161(7-8). 899–908. 15 indexed citations
10.
Picouleau, Christophe, et al.. (2012). d-Transversals of stable sets and vertex covers in weighted bipartite graphs. Journal of Discrete Algorithms. 17. 95–102. 3 indexed citations
11.
Golumbic, Martin Charles & Bernard Ries. (2012). On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. Graphs and Combinatorics. 29(3). 499–517. 5 indexed citations
12.
Hertz, Alain & Bernard Ries. (2011). On r-Equitable Colorings of Trees and Forests. PolyPublie (École Polytechnique de Montréal). 1–16. 1 indexed citations
13.
Ries, Bernard, et al.. (2011). Some properties of edge intersection graphs of single-bend paths on a grid. Discrete Mathematics. 312(2). 427–440. 15 indexed citations
14.
Chudnovsky, Maria, Bernard Ries, & Yori Zwólš. (2011). Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs. Discrete Applied Mathematics. 159(17). 1971–1995. 3 indexed citations
15.
Ries, Bernard, et al.. (2010). Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. Archive ouverte UNIGE (University of Geneva). 5(2). 75–85. 4 indexed citations
16.
Ries, Bernard, et al.. (2009). Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discrete Mathematics. 310(1). 132–146. 23 indexed citations
17.
Werra, D. de, et al.. (2009). Graph coloring with cardinality constraints on the neighborhoods. Discrete Optimization. 6(4). 362–369. 7 indexed citations
18.
Zenklusen, Rico, et al.. (2009). Blockers and transversals. Discrete Mathematics. 309(13). 4306–4314. 41 indexed citations
19.
Ries, Bernard. (2008). Complexity of mixed graph coloring. Theoretical Computer Science. 2 indexed citations
20.
Ries, Bernard. (2006). Coloring some classes of mixed graphs. Discrete Applied Mathematics. 155(1). 1–6. 13 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

Rankless by CCL
2026