Bernard Ries

128 papers A* 1A 2B 11C 11Journal 101Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Explainable Graph-theoretical Machine Learning: with Application to Alzheimer's Disease Prediction.
CoRR
Narmina Baghirova, Duy-Thanh Vu, Duy-Cat Can, Christelle Schneuwly Diaz, Julien S. Bodelet, Guillaume Blanc, Georgi Hrusanov, Bernard Ries, Oliver Y. Chén
2025 J jnl
Matching Cuts in Graphs of High Girth and H-Free Graphs.
Algorithmica
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2024 J jnl
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius.
Theor. Comput. Sci.
Felicia Lucke, Daniël Paulusma, Bernard Ries
2024 J jnl
Finding k-community structures in special graph classes.
Discret. Appl. Math.
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
2024 J jnl
On blockers and transversals of maximum independent sets in co-comparability graphs.
Discret. Appl. Math.
Felicia Lucke, Bernard Ries
2023 B conf
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
MFCS
Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
CoRR
Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
Finding Matching Cuts in H-Free Graphs.
Algorithmica
Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 B ed.
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers
WG
Daniël Paulusma, Bernard Ries
2023 B conf
Matching Cuts in Graphs of High Girth and H-Free Graphs.
ISAAC
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
Maximizing Matching Cuts.
CoRR
Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
2023 J jnl
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs.
CoRR
Felicia Lucke, Bernard Ries
2023 J jnl
Using edge contractions to reduce the semitotal domination number.
Theor. Comput. Sci.
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
2022 B conf
Finding Matching Cuts in H-Free Graphs.
ISAAC
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
Finding Matching Cuts in H-Free Graphs.
CoRR
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
Finding k-community structures in special graph classes.
CoRR
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
2022 B conf
Locally Checkable Problems Parameterized by Clique-Width.
ISAAC
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl
2022 J jnl
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.
CoRR
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.
CoRR
Felicia Lucke, Daniël Paulusma, Bernard Ries
2022 J jnl
On some special classes of contact B0-VPG graphs.
Discret. Appl. Math.
Flavia Bonomo-Braberman, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries
2022 J jnl
On the complexity of matching cut for graphs of bounded radius and
Theor. Comput. Sci.
Felicia Lucke, Daniël Paulusma, Bernard Ries
2021 J jnl
Blocking total dominating sets via edge contractions.
Theor. Comput. Sci.
Esther Galby, Felix Mann, Bernard Ries
2021 J jnl
CPG graphs: Some structural and hardness results.
Discret. Appl. Math.
Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries
2021 J jnl
New progress in combinatorial optimization.
Discret. Appl. Math.
Bo Chen, Silvano Martello, Bernard Ries
2021 J jnl
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction.
Discret. Appl. Math.
Esther Galby, Felix Mann, Bernard Ries
2021 J jnl
Reducing the domination number of graphs via edge contractions and vertex deletions.
Discret. Math.
Esther Galby, Paloma T. Lima, Bernard Ries
2021 J jnl
Using edge contractions to reduce the semitotal domination number.
CoRR
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
2020 J jnl
Blocking total dominating sets via edge contractions.
CoRR
Esther Galby, Felix Mann, Bernard Ries
2020 B conf
On Some Subclasses of Split B
LATIN
Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl
2020 J jnl
Reducing the domination number of P
CoRR
Esther Galby, Felix Mann, Bernard Ries
2020 J jnl
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.
Theor. Comput. Sci.
Esther Galby, Andrea Munaro, Bernard Ries
2019 B conf
Blocking Dominating Sets for H-Free Graphs via Edge Contractions.
ISAAC
Esther Galby, Paloma T. Lima, Bernard Ries
2019 J jnl
Blocking dominating sets for $H$-free graphs via edge contractions.
CoRR
Esther Galby, Paloma T. Lima, Bernard Ries
2019 J jnl
CPG graphs: Some structural and hardness results.
CoRR
Esther Galby, Andrea Munaro, Bernard Ries
2019 J jnl
Classifying
Inf. Process. Lett.
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2019 J jnl
Critical vertices and edges in H-free graphs.
Discret. Appl. Math.
Daniël Paulusma, Christophe Picouleau, Bernard Ries
2019 J jnl
Detecting strong cliques.
Discret. Math.
Ademir Hujdurovic, Martin Milanic, Bernard Ries
2019 J jnl
Maximum eccentric connectivity index for graphs with given diameter.
Discret. Appl. Math.
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
2019 J jnl
On the Parameterized Complexity of k-Edge Colouring.
CoRR
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2019 J jnl
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016.
Discret. Appl. Math.
Yves Crama, Bernard Gendron, Bernard Ries
2019 J jnl
Proper circular arc graphs as intersection graphs of pathson a grid.
Discret. Appl. Math.
Esther Galby, María Pía Mazzoleni, Bernard Ries
2019 B conf
Reducing the Domination Number of Graphs via Edge Contractions.
MFCS
Esther Galby, Paloma T. Lima, Bernard Ries
2019 J jnl
Reducing the domination number of graphs via edge contractions.
CoRR
Esther Galby, Paloma T. Lima, Bernard Ries
2018 C conf
Characterising Chordal Contact B_0 -VPG Graphs.
ISCO
Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries
2018 J jnl
Classifying k-Edge Colouring for H-free Graphs.
CoRR
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
2018 J jnl
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2018 J jnl
Contraction and deletion blockers for perfect graphs and
Theor. Comput. Sci.
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
2018 J jnl
Detecting strong cliques.
CoRR
Ademir Hujdurovic, Martin Milanic, Bernard Ries
2018 J jnl
Dominating induced matchings in graphs containing no long claw.
J. Graph Theory
Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
2018 J jnl
Graphs vertex-partitionable into strong cliques.
Discret. Math.
Ademir Hujdurovic, Martin Milanic, Bernard Ries
2018 J jnl
Maximum Eccentric Connectivity Index for Graphs with Given Diameter.
CoRR
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
2018 A conf
On Contact Graphs of Paths on a Grid.
GD
Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries
2018 B conf
On Split B_1 B 1 -EPG Graphs.
LATIN
Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl
2018 J jnl
On contact graphs of paths on a grid.
CoRR
Zakir Deniz, Esther Galby, Bernard Ries
2018 J jnl
On some special classes of contact B
CoRR
Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries
2018 J jnl
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Discret. Appl. Math.
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
2018 J jnl
Planar CPG graphs.
CoRR
Nicolas Champseix, Esther Galby, Bernard Ries
2018 J jnl
Proper circular arc graphs as intersection graphs of paths on a grid.
CoRR
Esther Galby, María Pía Mazzoleni, Bernard Ries
2018 J jnl
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.
CoRR
Esther Galby, Andrea Munaro, Bernard Ries
2018 J jnl
Upper Domination: Towards a Dichotomy Through Boundary Properties.
Algorithmica
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
2017 C conf
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.
TAMC
Daniël Paulusma, Christophe Picouleau, Bernard Ries
2017 J jnl
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs.
CoRR
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
2017 J jnl
Critical Vertices and Edges in $H$-free Graphs.
CoRR
Daniël Paulusma, Christophe Picouleau, Bernard Ries
2017 J jnl
On star and biclique edge-colorings.
Int. Trans. Oper. Res.
Simone Dantas, Marina Groshaus, André Luiz Pires Guedes, Raphael C. S. Machado, Bernard Ries, Diana Sasaki
2017 J jnl
Reducing the Chromatic Number by Vertex or Edge Deletions.
Electron. Notes Discret. Math.
Christophe Picouleau, Daniël Paulusma, Bernard Ries
2016 C conf
A Boundary Property for Upper Domination.
IWOCA
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2016 J jnl
On graphs vertex-partitionable into strong cliques.
CoRR
Ademir Hujdurovic, Martin Milanic, Bernard Ries
2016 J jnl
On the minimum and maximum selective graph coloring problems in some graph classes.
Discret. Appl. Math.
Marc Demange, Tínaz Ekim, Bernard Ries
2016 J jnl
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids.
Discret. Appl. Math.
Guilherme Dias da Fonseca, Bernard Ries, Diana Sasaki
2016 C conf
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions.
ISCO
Daniël Paulusma, Christophe Picouleau, Bernard Ries
2016 J jnl
Upper Domination: towards a dichotomy through boundary properties.
CoRR
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
2015 J jnl
Advances in Combinatorial Optimization.
Discret. Appl. Math.
Silvano Martello, Bernard Ries
2015 C conf
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
ICORES
Bernard Ries
2015 J jnl
Blockers for the Stability Number and the Chromatic Number.
Graphs Comb.
Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries
2015 J jnl
Coloring graphs characterized by a forbidden subgraph.
Discret. Appl. Math.
Petr A. Golovach, Daniël Paulusma, Bernard Ries
2015 C conf
Contraction Blockers for Graphs with Forbidden Induced Paths.
CIAC
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
2015 J jnl
Dominating induced matchings in graphs containing no long claw.
CoRR
Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra
2015 C conf
Finding a Perfect Phylogeny from Mixed Tumor Samples.
WABI
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2015 J jnl
Finding a perfect phylogeny from mixed tumor samples.
CoRR
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
2015 A conf
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability.
AAMAS
Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries
2015 J jnl
On some applications of the selective graph coloring problem.
Eur. J. Oper. Res.
Marc Demange, Tínaz Ekim, Bernard Ries, Cerasela Tanasescu
2015 C conf
On the Minimum and Maximum Selective Graph Coloring Problems.
CTW
Marc Demange, Tínaz Ekim, Bernard Ries
2015 J jnl
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Electron. Notes Discret. Math.
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
2015 J jnl
On the maximum independent set problem in subclasses of subcubic graphs.
J. Discrete Algorithms
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2015 J jnl
Vote par approbation pour les élections à vainqueurs multiples. Une famille générale de règles, leur complexité algorithmique et leur manipulabilité.
Rev. d'Intelligence Artif.
Nathanaël Barrot, Jérôme Lang, Bernard Ries
2014 C conf
A Dichotomy for Upper Domination in Monogenic Classes.
COCOA
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2014 J jnl
Characterizations of cographs as intersection graphs of paths on a grid.
Discret. Appl. Math.
Elad Cohen, Martin Charles Golumbic, Bernard Ries
2014 J jnl
On the complexity of the selective graph coloring problem in some special classes of graphs.
Theor. Comput. Sci.
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
2013 J jnl
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.
Discret. Appl. Math.
Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries
2013 J jnl
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs.
Graphs Comb.
Martin Charles Golumbic, Bernard Ries
2013 C conf
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
IWOCA
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
2013 J jnl
Optimal edge-coloring with edge rate constraints.
Networks
Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols
2013 J jnl
Packing and covering with linear programming: A survey.
Eur. J. Oper. Res.
Cédric Bentz, Denis Cornaz, Bernard Ries
2013 J jnl
Perfectness of clustered graphs.
Discret. Optim.
Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries
2013 — conf
Possible Winners in Approval Voting.
ADT
Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
2013 J jnl
The firefighter problem with more than one firefighter on trees.
Discret. Appl. Math.
Cristina Bazgan, Morgan Chopin, Bernard Ries
2012 J jnl
A note on chromatic properties of threshold graphs.
Discret. Math.
Bernard Ries, Dominique de Werra, Rico Zenklusen
2012 J jnl
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
IEEE/ACM Trans. Netw.
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
2012 B conf
Coloring Graphs Characterized by a Forbidden Subgraph.
MFCS
Petr A. Golovach, Daniël Paulusma, Bernard Ries
2012 J jnl
Colouring vertices of triangle-free graphs without forests.
Discret. Math.
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
2012 C conf
Selective Graph Coloring in Some Special Classes of Graphs.
ISCO
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
2012 J jnl
Some properties of edge intersection graphs of single-bend paths on a grid.
Discret. Math.
Andrei Asinowski, Bernard Ries
2012 J jnl
d-Transversals of stable sets and vertex covers in weighted bipartite graphs.
J. Discrete Algorithms
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra
2011 J jnl
A 2-approximation for the maximum satisfying bisection problem.
Eur. J. Oper. Res.
Bernard Ries, Rico Zenklusen
2011 J jnl
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.
Discret. Appl. Math.
Maria Chudnovsky, Bernard Ries, Yori Zwols
2011 J jnl
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.
Discret. Appl. Math.
Maria Chudnovsky, Bernard Ries, Yori Zwols
2011 J jnl
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.
Electron. Notes Discret. Math.
Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
2011 J jnl
The firefighter problem with more than one firefighter on trees
CoRR
Cristina Bazgan, Morgan Chopin, Bernard Ries
2010 A* conf
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
INFOCOM
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
2010 — conf
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory.
S3@MobiCom
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
2010 J jnl
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.
Discret. Math.
Bernard Ries, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen
2010 B conf
Colouring Vertices of Triangle-Free Graphs.
WG
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
2010 J jnl
Complexity of two coloring problems in cubic planar bipartite mixed graphs.
Discret. Appl. Math.
Bernard Ries
2010 J jnl
On the use of graphs in discrete tomography.
Ann. Oper. Res.
Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
2010 J jnl
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints.
Algorithmic Oper. Res.
François-Xavier Meuwly, Bernard Ries, Nicolas Zufferey
2010 J jnl
Split-critical and uniquely split-colorable graphs.
Discret. Math. Theor. Comput. Sci.
Tínaz Ekim, Bernard Ries, Dominique de Werra
2009 J jnl
Blockers and transversals.
Discret. Math.
Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz
2009 J jnl
Degree-constrained edge partitioning in graphs arising from discrete tomography.
J. Graph Algorithms Appl.
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra
2009 J jnl
Graph coloring with cardinality constraints on the neighborhoods.
Discret. Optim.
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
2009 J jnl
Mixed graph edge coloring.
Discret. Math.
Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski
2009 J jnl
Some properties of edge intersection graphs of single bend paths on a grid.
Electron. Notes Discret. Math.
Bernard Ries
2008 J jnl
Addendum to "Bicolored Matchings in Some Classes of Graphs".
Graphs Comb.
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
2008 J jnl
On a graph coloring problem arising from discrete tomography.
Networks
Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
2008 J jnl
On the use of graphs in discrete tomography.
4OR
Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
2008 J jnl
On two coloring problems in mixed graphs.
Eur. J. Comb.
Bernard Ries, Dominique de Werra
2007 J jnl
Bicolored Matchings in Some Classes of Graphs.
Graphs Comb.
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
2007 J jnl
Coloring some classes of mixed graphs.
Discret. Appl. Math.
Bernard Ries
2005 J jnl
Bicolored matchings in some classes of graphs.
Electron. Notes Discret. Math.
Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries