Bernard Ries

Orcid: 0000-0003-4395-5547

Affiliations:
  • Paris Dauphine University, Paris, France


According to our database1, Bernard Ries authored at least 99 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Finding Matching Cuts in H-Free Graphs.
Algorithmica, October, 2023

Using edge contractions to reduce the semitotal domination number.
Theor. Comput. Sci., 2023

Maximizing Matching Cuts.
CoRR, 2023

On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs.
CoRR, 2023

Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Matching Cuts in Graphs of High Girth and H-Free Graphs.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
On the complexity of matching cut for graphs of bounded radius and <i>H</i>-free graphs.
Theor. Comput. Sci., 2022

On some special classes of contact B0-VPG graphs.
Discret. Appl. Math., 2022

New Hardness Results for (Perfect) Matching Cut and Disconnected Perfect Matching.
CoRR, 2022

Finding k-community structures in special graph classes.
CoRR, 2022

On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs.
CoRR, 2022

Locally Checkable Problems Parameterized by Clique-Width.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Blocking total dominating sets via edge contractions.
Theor. Comput. Sci., 2021

Reducing the domination number of graphs via edge contractions and vertex deletions.
Discret. Math., 2021

Reducing the domination number of (P3+kP2)-free graphs via one edge contraction.
Discret. Appl. Math., 2021

New progress in combinatorial optimization.
Discret. Appl. Math., 2021

CPG graphs: Some structural and hardness results.
Discret. Appl. Math., 2021

2020
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.
Theor. Comput. Sci., 2020

Reducing the domination number of P<sub>3</sub>+kP<sub>2</sub>-free graphs via one edge contraction.
CoRR, 2020

On Some Subclasses of Split B<sub>1</sub>-EPG Graphs.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020

2019
Classifying <i>k</i>-edge colouring for <i>H</i>-free graphs.
Inf. Process. Lett., 2019

Detecting strong cliques.
Discret. Math., 2019

Critical vertices and edges in H-free graphs.
Discret. Appl. Math., 2019

Maximum eccentric connectivity index for graphs with given diameter.
Discret. Appl. Math., 2019

Proper circular arc graphs as intersection graphs of pathson a grid.
Discret. Appl. Math., 2019

Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016.
Discret. Appl. Math., 2019

CPG graphs: Some structural and hardness results.
CoRR, 2019

On the Parameterized Complexity of k-Edge Colouring.
CoRR, 2019

Reducing the Domination Number of Graphs via Edge Contractions.
Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Blocking Dominating Sets for H-Free Graphs via Edge Contractions.
Proceedings of the 30th International Symposium on Algorithms and Computation, 2019

2018
Contraction and deletion blockers for perfect graphs and <i>H</i>-free graphs.
Theor. Comput. Sci., 2018

Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Dominating induced matchings in graphs containing no long claw.
J. Graph Theory, 2018

Graphs vertex-partitionable into strong cliques.
Discret. Math., 2018

Planar CPG graphs.
CoRR, 2018

Classifying k-Edge Colouring for H-free Graphs.
CoRR, 2018

Proper circular arc graphs as intersection graphs of paths on a grid.
CoRR, 2018

On some special classes of contact B<sup>0</sup>-VPG graphs.
CoRR, 2018

On contact graphs of paths on a grid.
CoRR, 2018

Upper Domination: Towards a Dichotomy Through Boundary Properties.
Algorithmica, 2018

On Split B_1 B 1 -EPG Graphs.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Characterising Chordal Contact B_0 -VPG Graphs.
Proceedings of the Combinatorial Optimization - 5th International Symposium, 2018

On Contact Graphs of Paths on a Grid.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
On star and biclique edge-colorings.
Int. Trans. Oper. Res., 2017

Reducing the Chromatic Number by Vertex or Edge Deletions.
Electron. Notes Discret. Math., 2017

Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs.
CoRR, 2017

Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions.
Proceedings of the Theory and Applications of Models of Computation, 2017

2016
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids.
Discret. Appl. Math., 2016

On the minimum and maximum selective graph coloring problems in some graph classes.
Discret. Appl. Math., 2016

A Boundary Property for Upper Domination.
Proceedings of the Combinatorial Algorithms - 27th International Workshop, 2016

Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions.
Proceedings of the Combinatorial Optimization - 4th International Symposium, 2016

2015
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., 2015

On the maximum independent set problem in subclasses of subcubic graphs.
J. Discrete Algorithms, 2015

Blockers for the Stability Number and the Chromatic Number.
Graphs Comb., 2015

On some applications of the selective graph coloring problem.
Eur. J. Oper. Res., 2015

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Electron. Notes Discret. Math., 2015

Advances in Combinatorial Optimization.
Discret. Appl. Math., 2015

Coloring graphs characterized by a forbidden subgraph.
Discret. Appl. Math., 2015

Finding a Perfect Phylogeny from Mixed Tumor Samples.
Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Proceedings of the ICORES 2015, 2015

On the Minimum and Maximum Selective Graph Coloring Problems.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Contraction Blockers for Graphs with Forbidden Induced Paths.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability.
Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, 2015

2014
On the complexity of the selective graph coloring problem in some special classes of graphs.
Theor. Comput. Sci., 2014

Characterizations of cographs as intersection graphs of paths on a grid.
Discret. Appl. Math., 2014

A Dichotomy for Upper Domination in Monogenic Classes.
Proceedings of the Combinatorial Optimization and Applications, 2014

2013
Optimal edge-coloring with edge rate constraints.
Networks, 2013

On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs.
Graphs Comb., 2013

Packing and covering with linear programming: A survey.
Eur. J. Oper. Res., 2013

Perfectness of clustered graphs.
Discret. Optim., 2013

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.
Discret. Appl. Math., 2013

The firefighter problem with more than one firefighter on trees.
Discret. Appl. Math., 2013

Possible Winners in Approval Voting.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

2012
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
IEEE/ACM Trans. Netw., 2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs.
J. Discrete Algorithms, 2012

A note on chromatic properties of threshold graphs.
Discret. Math., 2012

Colouring vertices of triangle-free graphs without forests.
Discret. Math., 2012

Some properties of edge intersection graphs of single-bend paths on a grid.
Discret. Math., 2012

Selective Graph Coloring in Some Special Classes of Graphs.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
A 2-approximation for the maximum satisfying bisection problem.
Eur. J. Oper. Res., 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.
Electron. Notes Discret. Math., 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.
Discret. Appl. Math., 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.
Discret. Appl. Math., 2011

2010
Split-critical and uniquely split-colorable graphs.
Discret. Math. Theor. Comput. Sci., 2010

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.
Discret. Math., 2010

Complexity of two coloring problems in cubic planar bipartite mixed graphs.
Discret. Appl. Math., 2010

Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints.
Algorithmic Oper. Res., 2010

On the use of graphs in discrete tomography.
Ann. Oper. Res., 2010

Colouring Vertices of Triangle-Free Graphs.
Proceedings of the Graph Theoretic Concepts in Computer Science, 2010

2009
Degree-constrained edge partitioning in graphs arising from discrete tomography.
J. Graph Algorithms Appl., 2009

Some properties of edge intersection graphs of single bend paths on a grid.
Electron. Notes Discret. Math., 2009

Blockers and transversals.
Discret. Math., 2009

Mixed graph edge coloring.
Discret. Math., 2009

Graph coloring with cardinality constraints on the neighborhoods.
Discret. Optim., 2009

2008
On a graph coloring problem arising from discrete tomography.
Networks, 2008

Addendum to "Bicolored Matchings in Some Classes of Graphs".
Graphs Comb., 2008

On two coloring problems in mixed graphs.
Eur. J. Comb., 2008

2007
Coloring some classes of mixed graphs.
Discret. Appl. Math., 2007

2005
Bicolored matchings in some classes of graphs.
Electron. Notes Discret. Math., 2005


  Loading...