| Blockers and transversals R Zenklusen, B Ries, C Picouleau, D De Werra, MC Costa, C Bentz Discrete Mathematics 309 (13), 4306-4314, 2009 | 63 | 2009 |
| Analyzing the performance of greedy maximal scheduling via local pooling and graph theory B Birand, M Chudnovsky, B Ries, P Seymour, G Zussman, Y Zwols IEEE/ACM Transactions on Networking 20 (1), 163-176, 2011 | 52 | 2011 |
| Colouring vertices of triangle-free graphs without forests KK Dabrowski, V Lozin, R Raman, B Ries Discrete Mathematics 312 (7), 1372-1385, 2012 | 47 | 2012 |
| Colouring vertices of triangle-free graphs without forests KK Dabrowski, V Lozin, R Raman, B Ries Discrete Mathematics 312 (7), 1372-1385, 2012 | 47 | 2012 |
| On some applications of the selective graph coloring problem M Demange, T Ekim, B Ries, C Tanasescu European Journal of Operational Research 240 (2), 307-314, 2015 | 40 | 2015 |
| Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid B Ries, C Bentz, C Picouleau, D de Werra, MC Costa, R Zenklusen Discrete Mathematics 310 (1), 132-146, 2010 | 37 | 2010 |
| The firefighter problem with more than one firefighter on trees C Bazgan, M Chopin, B Ries Discrete Applied Mathematics 161 (7-8), 899-908, 2013 | 29 | 2013 |
| Some properties of edge intersection graphs of single-bend paths on a grid A Asinowski, B Ries Discrete Mathematics 312 (2), 427-440, 2012 | 27 | 2012 |
| On the complexity of the selective graph coloring problem in some special classes of graphs M Demange, J Monnot, P Pop, B Ries Theoretical Computer Science 540, 89-102, 2014 | 26 | 2014 |
| On the complexity of the selective graph coloring problem in some special classes of graphs M Demange, J Monnot, P Pop, B Ries Theoretical Computer Science 540, 89-102, 2014 | 26 | 2014 |
| Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. G Amanatidis, N Barrot, J Lang, E Markakis, B Ries AAMAS 15, 715-723, 2015 | 25 | 2015 |
| Coloring some classes of mixed graphs B Ries Discrete Applied Mathematics 155 (1), 1-6, 2007 | 25 | 2007 |
| On the maximum independent set problem in subclasses of subcubic graphs V Lozin, J Monnot, B Ries Journal of Discrete Algorithms 31, 104-112, 2015 | 24 | 2015 |
| Characterizations of cographs as intersection graphs of paths on a grid E Cohen, MC Golumbic, B Ries Discrete Applied Mathematics 178, 46-57, 2014 | 23 | 2014 |
| On two coloring problems in mixed graphs B Ries, D de Werra European Journal of Combinatorics 29 (3), 712-725, 2008 | 19 | 2008 |
| On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid L Alcón, F Bonomo, G Durán, M Gutierrez, MP Mazzoleni, B Ries, ... Discrete Applied Mathematics 234, 12-21, 2018 | 16 | 2018 |
| Coloring graphs characterized by a forbidden subgraph PA Golovach, D Paulusma, B Ries Discrete Applied Mathematics 180, 101-110, 2015 | 15 | 2015 |
| A dichotomy for upper domination in monogenic classes H AbouEisha, S Hussain, V Lozin, J Monnot, B Ries International Conference on Combinatorial Optimization and Applications, 258-267, 2014 | 15 | 2014 |
| On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs MC Golumbic, B Ries Graphs and Combinatorics 29 (3), 499-517, 2013 | 14 | 2013 |
| On a graph coloring problem arising from discrete tomography C Bentz, MC Costa, D De Werra, C Picouleau, B Ries Networks: An International Journal 51 (4), 256-267, 2008 | 14 | 2008 |
Vadim LozinUniversity of WarwickE-mail confirmado em warwick.ac.uk
