Bernard Ries

ORCID

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 67

Top Venues

Publications

Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
Finding k-community structures in special graph classes. Discret. Appl. Math. 359 (2024)
Felicia Lucke, Bernard Ries
On blockers and transversals of maximum independent sets in co-comparability graphs. Discret. Appl. Math. 356 (2024)
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
Using edge contractions to reduce the semitotal domination number. Theor. Comput. Sci. 939 (2023)
Felicia Lucke, Bernard Ries
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs. CoRR (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Finding Matching Cuts in H-Free Graphs. Algorithmica 85 (10) (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. CoRR (2023)
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
Matching Cuts in Graphs of High Girth and H-Free Graphs. ISAAC (2023)
Van Bang Le, Felicia Lucke, Daniël Paulusma, Bernard Ries
Maximizing Matching Cuts. CoRR (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius. MFCS (2023)
Felicia Lucke, Daniël Paulusma, Bernard Ries
-free graphs. Theor. Comput. Sci. 936 (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Finding Matching Cuts in H-Free Graphs. ISAAC (2022)
Narmina Baghirova, Carolina Lucía Gonzalez, Bernard Ries, David Schindl
Locally Checkable Problems Parameterized by Clique-Width. ISAAC (2022)
Flavia Bonomo-Braberman, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries
On some special classes of contact B0-VPG graphs. Discret. Appl. Math. 308 (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
Finding Matching Cuts in H-Free Graphs. CoRR (2022)
Felicia Lucke, Daniël Paulusma, Bernard Ries
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs. CoRR (2022)
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl
Finding k-community structures in special graph classes. CoRR (2022)
Carl Feghali, Felicia Lucke, Daniël Paulusma, Bernard Ries
New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching. CoRR (2022)
Esther Galby, Felix Mann, Bernard Ries
Blocking total dominating sets via edge contractions. Theor. Comput. Sci. 877 (2021)
Esther Galby, Felix Mann, Bernard Ries
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction. Discret. Appl. Math. 305 (2021)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the domination number of graphs via edge contractions and vertex deletions. Discret. Math. 344 (1) (2021)
Esther Galby, Paloma T. Lima, Felix Mann, Bernard Ries
Using edge contractions to reduce the semitotal domination number. CoRR (2021)
Nicolas Champseix, Esther Galby, Andrea Munaro, Bernard Ries
CPG graphs: Some structural and hardness results. Discret. Appl. Math. 290 (2021)
Bo Chen, Silvano Martello, Bernard Ries
New progress in combinatorial optimization. Discret. Appl. Math. 290 (2021)
Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl
-EPG Graphs. LATIN (2020)
Esther Galby, Felix Mann, Bernard Ries
-free graphs via one edge contraction. CoRR (2020)
Esther Galby, Andrea Munaro, Bernard Ries
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. Theor. Comput. Sci. 814 (2020)
Esther Galby, Felix Mann, Bernard Ries
Blocking total dominating sets via edge contractions. CoRR (2020)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
On the Parameterized Complexity of k-Edge Colouring. CoRR (2019)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
Detecting strong cliques. Discret. Math. 342 (9) (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the domination number of graphs via edge contractions. CoRR (2019)
Yves Crama, Bernard Gendron, Bernard Ries
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016. Discret. Appl. Math. 261 (2019)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
-free graphs. Inf. Process. Lett. 146 (2019)
Esther Galby, María Pía Mazzoleni, Bernard Ries
Proper circular arc graphs as intersection graphs of pathson a grid. Discret. Appl. Math. 262 (2019)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Critical vertices and edges in H-free graphs. Discret. Appl. Math. 257 (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Blocking Dominating Sets for H-Free Graphs via Edge Contractions. ISAAC (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Reducing the Domination Number of Graphs via Edge Contractions. MFCS (2019)
Esther Galby, Paloma T. Lima, Bernard Ries
Blocking dominating sets for $H$-free graphs via edge contractions. CoRR (2019)
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
Maximum eccentric connectivity index for graphs with given diameter. Discret. Appl. Math. 268 (2019)
Esther Galby, Andrea Munaro, Bernard Ries
CPG graphs: Some structural and hardness results. CoRR (2019)
Esther Galby, María Pía Mazzoleni, Bernard Ries
Proper circular arc graphs as intersection graphs of paths on a grid. CoRR (2018)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Viktor Zamaraev
Upper Domination: Towards a Dichotomy Through Boundary Properties. Algorithmica 80 (10) (2018)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
Detecting strong cliques. CoRR (2018)
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Discret. Appl. Math. 234 (2018)
Zakir Deniz, Esther Galby, Andrea Munaro, Bernard Ries
On Contact Graphs of Paths on a Grid. Graph Drawing (2018)
Esther Galby, Andrea Munaro, Bernard Ries
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width. CoRR (2018)
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples. IEEE ACM Trans. Comput. Biol. Bioinform. 15 (1) (2018)
Nicolas Champseix, Esther Galby, Bernard Ries
Planar CPG graphs. CoRR (2018)
Zakir Deniz, Esther Galby, Bernard Ries
On contact graphs of paths on a grid. CoRR (2018)
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
-free graphs. Theor. Comput. Sci. 746 (2018)
Zakir Deniz, Simon Nivelle, Bernard Ries, David Schindl
On Split B_1 B 1 -EPG Graphs. LATIN (2018)
Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries
Characterising Chordal Contact B_0 -VPG Graphs. ISCO (2018)
Flavia Bonomo, María Pía Mazzoleni, Mariano Leonardo Rean, Bernard Ries
-VPG graphs. CoRR (2018)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
Graphs vertex-partitionable into strong cliques. Discret. Math. 341 (5) (2018)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Viktor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. J. Graph Theory 88 (1) (2018)
Esther Galby, Paloma T. Lima, Daniël Paulusma, Bernard Ries
Classifying k-Edge Colouring for H-free Graphs. CoRR (2018)
Pierre Hauweele, Alain Hertz, Hadrien Mélot, Bernard Ries, Gauvain Devillez
Maximum Eccentric Connectivity Index for Graphs with Given Diameter. CoRR (2018)
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs. CoRR (2017)
Christophe Picouleau, Daniël Paulusma, Bernard Ries
Reducing the Chromatic Number by Vertex or Edge Deletions. Electron. Notes Discret. Math. 62 (2017)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Critical Vertices and Edges in $H$-free Graphs. CoRR (2017)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions. TAMC (2017)
Simone Dantas, Marina Groshaus, André Luiz Pires Guedes, Raphael C. S. Machado, Bernard Ries, Diana Sasaki
On star and biclique edge-colorings. Int. Trans. Oper. Res. 24 (1-2) (2017)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
Upper Domination: towards a dichotomy through boundary properties. CoRR (2016)
Ademir Hujdurovic, Martin Milanic, Bernard Ries
On graphs vertex-partitionable into strong cliques. CoRR (2016)
Marc Demange, Tínaz Ekim, Bernard Ries
On the minimum and maximum selective graph coloring problems in some graph classes. Discret. Appl. Math. 204 (2016)
Guilherme Dias da Fonseca, Bernard Ries, Diana Sasaki
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids. Discret. Appl. Math. 207 (2016)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries, Victor Zamaraev
A Boundary Property for Upper Domination. IWOCA (2016)
Daniël Paulusma, Christophe Picouleau, Bernard Ries
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions. ISCO (2016)
Nathanaël Barrot, Jérôme Lang, Bernard Ries
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. 29 (3-4) (2015)
Marc Demange, Tínaz Ekim, Bernard Ries, Cerasela Tanasescu
On some applications of the selective graph coloring problem. Eur. J. Oper. Res. 240 (2) (2015)
Marc Demange, Tínaz Ekim, Bernard Ries
On the Minimum and Maximum Selective Graph Coloring Problems. CTW (2015)
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
Finding a Perfect Phylogeny from Mixed Tumor Samples. WABI (2015)
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
On the maximum independent set problem in subclasses of subcubic graphs. J. Discrete Algorithms 31 (2015)
Bernard Ries
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. ICORES (2015)
Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability. AAMAS (2015)
Ademir Hujdurovic, Ursa Kacar, Martin Milanic, Bernard Ries, Alexandru I. Tomescu
Finding a perfect phylogeny from mixed tumor samples. CoRR (2015)
Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries
Contraction Blockers for Graphs with Forbidden Induced Paths. CIAC (2015)
Petr A. Golovach, Daniël Paulusma, Bernard Ries
Coloring graphs characterized by a forbidden subgraph. Discret. Appl. Math. 180 (2015)
Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries
Blockers for the Stability Number and the Chromatic Number. Graphs Comb. 31 (1) (2015)
Silvano Martello, Bernard Ries
Advances in Combinatorial Optimization. Discret. Appl. Math. 196 (2015)
Alain Hertz, Vadim V. Lozin, Bernard Ries, Victor Zamaraev, Dominique de Werra
Dominating induced matchings in graphs containing no long claw. CoRR (2015)
Liliana Alcón, Flavia Bonomo, Guillermo Durán, Marisa Gutierrez, María Pía Mazzoleni, Bernard Ries, Mario Valencia-Pabon
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid. Electron. Notes Discret. Math. 50 (2015)
Hassan AbouEisha, Shahid Hussain, Vadim V. Lozin, Jérôme Monnot, Bernard Ries
A Dichotomy for Upper Domination in Monogenic Classes. COCOA (2014)
Elad Cohen, Martin Charles Golumbic, Bernard Ries
Characterizations of cographs as intersection graphs of paths on a grid. Discret. Appl. Math. 178 (2014)
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
On the complexity of the selective graph coloring problem in some special classes of graphs. Theor. Comput. Sci. 540 (2014)
Dariusz Dereniowski, Wieslaw Kubiak, Bernard Ries, Yori Zwols
Optimal edge-coloring with edge rate constraints. Networks 62 (3) (2013)
Marc Demange, Vadim V. Lozin, Christophe Picouleau, Bernard Ries
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010. Discret. Appl. Math. 161 (4-5) (2013)
Vadim V. Lozin, Jérôme Monnot, Bernard Ries
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs. IWOCA (2013)
Cédric Bentz, Denis Cornaz, Bernard Ries
Packing and covering with linear programming: A survey. Eur. J. Oper. Res. 227 (3) (2013)
Flavia Bonomo, Denis Cornaz, Tínaz Ekim, Bernard Ries
Perfectness of clustered graphs. Discret. Optim. 10 (4) (2013)
Nathanaël Barrot, Laurent Gourvès, Jérôme Lang, Jérôme Monnot, Bernard Ries
Possible Winners in Approval Voting. ADT (2013)
Cristina Bazgan, Morgan Chopin, Bernard Ries
The firefighter problem with more than one firefighter on trees. Discret. Appl. Math. 161 (7-8) (2013)
Martin Charles Golumbic, Bernard Ries
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs. Graphs Comb. 29 (3) (2013)
Andrei Asinowski, Bernard Ries
Some properties of edge intersection graphs of single-bend paths on a grid. Discret. Math. 312 (2) (2012)
Marc Demange, Jérôme Monnot, Petrica C. Pop, Bernard Ries
Selective Graph Coloring in Some Special Classes of Graphs. ISCO (2012)
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul D. Seymour, Gil Zussman, Yori Zwols
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory. IEEE/ACM Trans. Netw. 20 (1) (2012)
Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17 (2012)
Bernard Ries, Dominique de Werra, Rico Zenklusen
A note on chromatic properties of threshold graphs. Discret. Math. 312 (10) (2012)
Petr A. Golovach, Daniël Paulusma, Bernard Ries
Coloring Graphs Characterized by a Forbidden Subgraph. MFCS (2012)
Konrad K. Dabrowski, Vadim V. Lozin, Rajiv Raman, Bernard Ries
Colouring vertices of triangle-free graphs without forests. Discret. Math. 312 (7) (2012)
Bernard Ries, Rico Zenklusen
A 2-approximation for the maximum satisfying bisection problem. Eur. J. Oper. Res. 210 (2) (2011)

Bernard Ries.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Bernard Ries