Bernard Ries Assistant Professor Centre for Discrete Mathematics and its Applications (DIMAP) Operational Research and Management Sciences group (ORMS) Offices: B2.12 (Maths Institute); E0.22 (Social Studies, WBS) Phone: +44 (0)24 7657 3838 (MI); +44 (0)24 7652 4465 (WBS) Email: Bernard dot Ries at wbs dot ac dot uk

BIOGRAPHY

Bernard Ries obtained his M.Sc. in 2004 at the Ecole Polytechnique Fédérale de Lausanne, Switzerland. He finished his PhD thesis in 2007 at the same Institute. His PhD advisor was Prof. Dominique de Werra. In 2008-2009, he was a Postdoctoral Research Fellow at Columbia University, New York. He has been an invited researcher at several universities: CNAM (Paris, France), Memorial University (St. John's, Canada), University of Haifa (Haifa, Israel), and Gdansk University of Technology (Gdansk, Poland). Since October 2009, he's an Assistant Professor in the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. He is also member of the Operational Research and Management Sciences group (ORMS) at Warwick Business School.

A detailed CV can be found here.

RESEARCH INTERESTS

Graph Theory, Discrete Mathematics, Combinatorial Optimisation, Scheduling, Heuristics

TEACHING

• 2009-2010: Mathematical Programming II (MORSE 2nd year module), Quantitative Research Methods (PhD module)

PUBLICATIONS

• F.-X. Meuwly, B. Ries and N. Zufferey, Solution methods for a scheduling problem with incompability and precedence constraints, to appear in Algorithmic Operations Research

• T. Ekim, B. Ries and D. de Werra, Split-critical and uniquely split-colorable graphs, to appear in Discrete Mathematics and Theoretical Computer Science

• B. Ries, Complexity of two coloring problems in cubic planar bipartite mixed graphs,  Discrete Applied Mathematics 158 (2010) 592 - 596

• M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, On the use of graphs in discrete tomography, Annals of Operations Research 175 (2010) 287 - 307
  

• C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries and R. Zenklusen, Blockers and Transversals in some subclasses of bipartite graphs : when caterpillars are dancing on a grid, Discrete Mathematics 310 (1) (2010) 132 - 146
  

• M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, Graph coloring with cardinality constraints on the neighborhoods, Discrete Optimization 6 (2009) 362-369

 Ranked first in the TOP 25 hottest articles of Discrete Optimization for July - September 2009

• C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau, B. Ries and R. Zenklusen, Blockers and Transversals, Discrete Mathematics 309 (13) (2009) 4306-4314

• H. Furmanczyk, A. Kosowski, B. Ries and P. Zylinski, Mixed graph edge coloring, Discrete Mathematics 309 (12) (2009) 4027-4036

 Ranked 14 in the TOP 25 hottest articles of Discrete Mathematics for April - June 2009

• C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, Degree-constrained edge partitionings in graphs arising from discrete tomography, Journal of Graph Algorithms and Applications 13 (2) (2009) 99-118

• C. Bentz, M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, On a graph coloring problem arising from discrete tomography, Networks 51 (4) (2008) 256-267

• D. de Werra and B. Ries, On two coloring problems in mixed graphs, European Journal of Combinatorics 29 (2008) 712-725

 Ranked third in the TOP 25 hottest articles of European Journal of Combinatorics for January - March 2008

• M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, A tutorial on the use of graphs in discrete tomography, 4OR 6 (2008) 101-123

• M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, Addendum to Bicolored matchings in some classes of graphs, Graphs and Combinatorics 24 (2) (2008) 127-128

• B. Ries, Coloring some classes of mixed graphs, Discrete Applied Mathematics 155 (2007) 1-6

• M.-C. Costa, D. de Werra, C. Picouleau and B. Ries, Bicolored matchings in some classes of graphs, Graphs and Combinatorics 23 (1) (2007) 47-60

SUBMITTED PAPERS

• A. Asinowski and B. Ries, Some properties of edge intersection graphs of single bend paths in a grid

• K. Dabrowski, V. Lozin, R. Raman, B. Ries, Coloring vertices of triangle-free graphs

• B. Birand, M. Chudnovsky, B. Ries, P. Seymour, G. Zussman and Y. Zwols, Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory

• M. Chudnovsky, B. Ries and Y. Zwols, Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part I. Basic graphs

• M. Chudnovsky, B. Ries and Y. Zwols, Claw-Free Graphs With Strongly Perfect Complements. Fractional and Integral Version. Part II. Nontrivial strip-structures

• B. Ries, R. Zenklusen, A 2-approximation for the Maximum Satisfying Bisection Problem
  

PhD THESIS

• B. Ries, Variations of coloring problems related to scheduling and discrete tomography, PhD thesis, EPFL, (2007).

TECHNICAL REPORTS

• D. Bronner and B. Ries, An introduction to treewidth, Technical Report (2006)

CO-AUTHORS

Andrei Asinowski (Technion, Israel), Cédric Bentz (Université Paris-Sud, France), Berk Birand (Columbia University, USA), Maria Chudnovsky (Columbia University, USA), Marie-Christine Costa (ENSTA, France), Konrad Dabrowski (University of warwick, UK), Dominique de Werra (EPF Lausanne, Switzerland), Tinaz Ekim (Boğaziçi University, Turkey), Hanna Furmańczyk (University of Gdansk, Poland), Adrian Kosowski (Gdańsk University of Technology, Poland), Vadim Lozin (University of Warwick, UK), François-Xavier Meuwly, Christophe Picouleau (CNAM, France), Rajiv Raman (University of Warwick, UK), Paul Seymour (Princeton University, USA), Rico Zenklusen (ETH Zurich, Switzerland), Nicolas Zufferey (University of Geneva, Switzerland) Gil Zussman (Columbia University, USA), Yori Zwols (Columbia University, USA), Paweł Żyliński (University of Gdansk, Poland)

AWARDS / GRANTS

• 2008: Grant TR-PDR BFR08-17 from the "Fonds national de la recherche, Luxembourg" for postdoctoral research at Columbia University, New York, USA.

• 2004: Award from the Swiss OR Society for best Master dissertation in Operations Research in Switzerland.