Bicolored matchings in some classes of graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2005)

Coloring some classes of mixed graphs. - Bernard Ries (Discret. Appl. Math., 2007)

On the use of graphs in discrete tomography. - Dominique de Werra; Marie-Christine Costa; Christophe Picouleau; Bernard Ries (4OR, 2008)

On two coloring problems in mixed graphs. - Bernard Ries; Dominique de Werra (Eur. J. Comb., 2008)

Addendum to "Bicolored Matchings in Some Classes of Graphs". - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Graphs Comb., 2008)

On a graph coloring problem arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Networks, 2008)

Graph coloring with cardinality constraints on the neighborhoods. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Discret. Optim., 2009)

Mixed graph edge coloring. - Hanna Furmanczyk; Adrian Kosowski; Bernard Ries; Pawel Zylinski (Discret. Math., 2009)

Blockers and transversals. - Rico Zenklusen; Bernard Ries; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Cédric Bentz (Discret. Math., 2009)

Some properties of edge intersection graphs of single bend paths on a grid. - Bernard Ries (Electron. Notes Discret. Math., 2009)

Degree-constrained edge partitioning in graphs arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Graph Algorithms Appl., 2009)

Colouring Vertices of Triangle-Free Graphs. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (WG, 2010)

Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints. - François-Xavier Meuwly; Bernard Ries; Nicolas Zufferey (Algorithmic Oper. Res., 2010)

Complexity of two coloring problems in cubic planar bipartite mixed graphs. - Bernard Ries (Discret. Appl. Math., 2010)

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. - Bernard Ries; Cédric Bentz; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Rico Zenklusen (Discret. Math., 2010)

Split-critical and uniquely split-colorable graphs. - Tínaz Ekim; Bernard Ries; Dominique de Werra (Discret. Math. Theor. Comput. Sci., 2010)

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs. - Maria Chudnovsky; Bernard Ries; Yori Zwols (Discret. Appl. Math., 2011)

Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures. - Maria Chudnovsky; Bernard Ries; Yori Zwols (Discret. Appl. Math., 2011)

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2011)

A 2-approximation for the maximum satisfying bisection problem. - Bernard Ries; Rico Zenklusen (Eur. J. Oper. Res., 2011)

Selective Graph Coloring in Some Special Classes of Graphs. - Marc Demange; Jérôme Monnot; Petrica C. Pop; Bernard Ries (ISCO, 2012)

Some properties of edge intersection graphs of single-bend paths on a grid. - Andrei Asinowski; Bernard Ries (Discret. Math., 2012)

Colouring vertices of triangle-free graphs without forests. - Konrad K. Dabrowski; Vadim V. Lozin; Rajiv Raman 001; Bernard Ries (Discret. Math., 2012)

A note on chromatic properties of threshold graphs. - Bernard Ries; Dominique de Werra; Rico Zenklusen (Discret. Math., 2012)

d-Transversals of stable sets and vertex covers in weighted bipartite graphs. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Discrete Algorithms, 2012)

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. - Berk Birand; Maria Chudnovsky; Bernard Ries; Paul D. Seymour; Gil Zussman; Yori Zwols (IEEE/ACM Trans. Netw., 2012)

Possible Winners in Approval Voting. - Nathanaël Barrot; Laurent Gourvès; Jérôme Lang; Jérôme Monnot; Bernard Ries (ADT, 2013)

The firefighter problem with more than one firefighter on trees. - Cristina Bazgan; Morgan Chopin; Bernard Ries (Discret. Appl. Math., 2013)

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. - Marc Demange; Vadim V. Lozin; Christophe Picouleau; Bernard Ries (Discret. Appl. Math., 2013)

Perfectness of clustered graphs. - Flavia Bonomo; Denis Cornaz; Tínaz Ekim; Bernard Ries (Discret. Optim., 2013)

Packing and covering with linear programming: A survey. - Cédric Bentz; Denis Cornaz; Bernard Ries (Eur. J. Oper. Res., 2013)

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. - Martin Charles Golumbic; Bernard Ries (Graphs Comb., 2013)

Optimal edge-coloring with edge rate constraints. - Dariusz Dereniowski; Wieslaw Kubiak; Bernard Ries; Yori Zwols (Networks, 2013)

A Dichotomy for Upper Domination in Monogenic Classes. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries (COCOA, 2014)

Characterizations of cographs as intersection graphs of paths on a grid. - Elad Cohen; Martin Charles Golumbic; Bernard Ries (Discret. Appl. Math., 2014)

On the complexity of the selective graph coloring problem in some special classes of graphs. - Marc Demange; Jérôme Monnot; Petrica C. Pop; Bernard Ries (Theor. Comput. Sci., 2014)

Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. - Georgios Amanatidis; Nathanaël Barrot; Jérôme Lang; Evangelos Markakis; Bernard Ries (AAMAS, 2015)

Contraction Blockers for Graphs with Forbidden Induced Paths. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (CIAC, 2015)

On the Minimum and Maximum Selective Graph Coloring Problems. - Marc Demange; Tínaz Ekim; Bernard Ries (CTW, 2015)

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. - Bernard Ries (ICORES, 2015)

Finding a Perfect Phylogeny from Mixed Tumor Samples. - Ademir Hujdurovic; Ursa Kacar; Martin Milanic; Bernard Ries; Alexandru I. Tomescu (WABI, 2015)

Coloring graphs characterized by a forbidden subgraph. - Petr A. Golovach; Daniël Paulusma; Bernard Ries (Discret. Appl. Math., 2015)

Advances in Combinatorial Optimization. - Silvano Martello; Bernard Ries (Discret. Appl. Math., 2015)

On some applications of the selective graph coloring problem. - Marc Demange; Tínaz Ekim; Bernard Ries; Cerasela Tanasescu (Eur. J. Oper. Res., 2015)

Blockers for the Stability Number and the Chromatic Number. - Cristina Bazgan; Cédric Bentz; Christophe Picouleau; Bernard Ries (Graphs Comb., 2015)

On the maximum independent set problem in subclasses of subcubic graphs. - Vadim V. Lozin; Jérôme Monnot; Bernard Ries (J. Discrete Algorithms, 2015)

Vote par approbation pour les élections à vainqueurs multiples. Une famille générale de règles, leur complexité algorithmique et leur manipulabilité. - Nathanaël Barrot; Jérôme Lang; Bernard Ries (Rev. d'Intelligence Artif., 2015)

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. - Daniël Paulusma; Christophe Picouleau; Bernard Ries (ISCO, 2016)

A Boundary Property for Upper Domination. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Victor Zamaraev (IWOCA, 2016)

On the minimum and maximum selective graph coloring problems in some graph classes. - Marc Demange; Tínaz Ekim; Bernard Ries (Discret. Appl. Math., 2016)

On the ratio between maximum weight perfect matchings and maximum weight matchings in grids. - Guilherme Dias da Fonseca; Bernard Ries; Diana Sasaki (Discret. Appl. Math., 2016)

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. - Daniël Paulusma; Christophe Picouleau; Bernard Ries (TAMC, 2017)

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (CoRR, 2017)

Reducing the Chromatic Number by Vertex or Edge Deletions. - Christophe Picouleau; Daniël Paulusma; Bernard Ries (Electron. Notes Discret. Math., 2017)

On star and biclique edge-colorings. - Simone Dantas; Marina Groshaus; André Luiz Pires Guedes; Raphael C. S. Machado; Bernard Ries; Diana Sasaki (Int. Trans. Oper. Res., 2017)

On Contact Graphs of Paths on a Grid. - Zakir Deniz; Esther Galby; Andrea Munaro; Bernard Ries (GD, 2018)

Characterising Chordal Contact B_0 -VPG Graphs. - Flavia Bonomo; María Pía Mazzoleni; Mariano Leonardo Rean; Bernard Ries (ISCO, 2018)

On Split B_1 B 1 -EPG Graphs. - Zakir Deniz; Simon Nivelle; Bernard Ries; David Schindl (LATIN, 2018)

Upper Domination: Towards a Dichotomy Through Boundary Properties. - Hassan AbouEisha; Shahid Hussain 004; Vadim V. Lozin; Jérôme Monnot; Bernard Ries; Viktor Zamaraev (Algorithmica, 2018)

On contact graphs of paths on a grid. - Zakir Deniz; Esther Galby; Bernard Ries (CoRR, 2018)

On some special classes of contact B0-VPG graphs. - Flavia Bonomo; María Pía Mazzoleni; Mariano Leonardo Rean; Bernard Ries (CoRR, 2018)

Proper circular arc graphs as intersection graphs of paths on a grid. - Esther Galby; María Pía Mazzoleni; Bernard Ries (CoRR, 2018)

Classifying k-Edge Colouring for H-free Graphs. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (CoRR, 2018)

Planar CPG graphs. - Nicolas Champseix; Esther Galby; Bernard Ries (CoRR, 2018)

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. - Liliana Alcón; Flavia Bonomo; Guillermo Durán; Marisa Gutierrez; María Pía Mazzoleni; Bernard Ries; Mario Valencia-Pabon (Discret. Appl. Math., 2018)

Graphs vertex-partitionable into strong cliques. - Ademir Hujdurovic; Martin Milanic; Bernard Ries (Discret. Math., 2018)

Dominating induced matchings in graphs containing no long claw. - Alain Hertz; Vadim V. Lozin; Bernard Ries; Viktor Zamaraev; Dominique de Werra (J. Graph Theory, 2018)

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. - Ademir Hujdurovic; Ursa Kacar; Martin Milanic; Bernard Ries; Alexandru I. Tomescu (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Contraction and deletion blockers for perfect graphs and H-free graphs. - Öznur Yasar Diner; Daniël Paulusma; Christophe Picouleau; Bernard Ries (Theor. Comput. Sci., 2018)

Blocking Dominating Sets for H-Free Graphs via Edge Contractions. - Esther Galby; Paloma T. Lima; Bernard Ries (ISAAC, 2019)

Reducing the Domination Number of Graphs via Edge Contractions. - Esther Galby; Paloma T. Lima; Bernard Ries (MFCS, 2019)

On the Parameterized Complexity of k-Edge Colouring. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (CoRR, 2019)

CPG graphs: Some structural and hardness results. - Esther Galby; Andrea Munaro; Bernard Ries (CoRR, 2019)

Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. - Yves Crama; Bernard Gendron; Bernard Ries (Discret. Appl. Math., 2019)

Proper circular arc graphs as intersection graphs of pathson a grid. - Esther Galby; María Pía Mazzoleni; Bernard Ries (Discret. Appl. Math., 2019)

Maximum eccentric connectivity index for graphs with given diameter. - Pierre Hauweele; Alain Hertz; Hadrien Mélot; Bernard Ries; Gauvain Devillez (Discret. Appl. Math., 2019)

Critical vertices and edges in H-free graphs. - Daniël Paulusma; Christophe Picouleau; Bernard Ries (Discret. Appl. Math., 2019)

Detecting strong cliques. - Ademir Hujdurovic; Martin Milanic; Bernard Ries (Discret. Math., 2019)

Classifying k-edge colouring for H-free graphs. - Esther Galby; Paloma T. Lima; Daniël Paulusma; Bernard Ries (Inf. Process. Lett., 2019)

On Some Subclasses of Split B1-EPG Graphs. - Zakir Deniz; Simon Nivelle; Bernard Ries; David Schindl (LATIN, 2020)

Reducing the domination number of P3+kP2-free graphs via one edge contraction. - Esther Galby; Felix Mann; Bernard Ries (CoRR, 2020)

Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. - Esther Galby; Andrea Munaro; Bernard Ries (Theor. Comput. Sci., 2020)

CPG graphs: Some structural and hardness results. - Nicolas Champseix; Esther Galby; Andrea Munaro; Bernard Ries (Discret. Appl. Math., 2021)

New progress in combinatorial optimization. - Bo Chen 002; Silvano Martello; Bernard Ries (Discret. Appl. Math., 2021)

Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. - Esther Galby; Felix Mann; Bernard Ries (Discret. Appl. Math., 2021)

Reducing the domination number of graphs via edge contractions and vertex deletions. - Esther Galby; Paloma T. Lima; Bernard Ries (Discret. Math., 2021)

Blocking total dominating sets via edge contractions. - Esther Galby; Felix Mann; Bernard Ries (Theor. Comput. Sci., 2021)

Locally Checkable Problems Parameterized by Clique-Width. - Narmina Baghirova; Carolina Lucía Gonzalez; Bernard Ries; David Schindl (ISAAC, 2022)

On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. - Felicia Lucke; Daniël Paulusma; Bernard Ries (CoRR, 2022)

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. - Carl Feghali; Felicia Lucke; Daniël Paulusma; Bernard Ries (CoRR, 2022)

On some special classes of contact B0-VPG graphs. - Flavia Bonomo-Braberman; María Pía Mazzoleni; Mariano Leonardo Rean; Bernard Ries (Discret. Appl. Math., 2022)

On the complexity of matching cut for graphs of bounded radius and H-free graphs. - Felicia Lucke; Daniël Paulusma; Bernard Ries (Theor. Comput. Sci., 2022)

Maximizing Matching Cuts. - Van Bang Le; Felicia Lucke; Daniël Paulusma; Bernard Ries (CoRR, 2023)

Using edge contractions to reduce the semitotal domination number. - Esther Galby; Paloma T. Lima; Felix Mann; Bernard Ries (Theor. Comput. Sci., 2023)

Finding Matching Cuts in H-Free Graphs. - Felicia Lucke; Daniël Paulusma; Bernard Ries (Algorithmica, 2023)

Finding k-community structures in special graph classes. - Narmina Baghirova; Clément Dallard; Bernard Ries; David Schindl (Discret. Appl. Math., 2024)

On blockers and transversals of maximum independent sets in co-comparability graphs. - Felicia Lucke; Bernard Ries (Discret. Appl. Math., 2024)

Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius. - Felicia Lucke; Daniël Paulusma; Bernard Ries (Theor. Comput. Sci., 2024)

Explainable Graph-theoretical Machine Learning: with Application to Alzheimer's Disease Prediction. - Narmina Baghirova; Duy-Thanh Vu; Duy-Cat Can; Christelle Schneuwly Diaz; Julien Bodelet; Guillaume Blanc; Georgi Hrusanov; Bernard Ries; Oliver Y. Chén (CoRR, 2025)

Matching Cuts in Graphs of High Girth and H-Free Graphs. - Carl Feghali; Felicia Lucke; Daniël Paulusma; Bernard Ries (Algorithmica, 2025)