Bernard Ries

From MaRDI portal
Person:266809

Available identifiers

zbMath Open ries.bernardDBLP10/6376WikidataQ96193598 ScholiaQ96193598MaRDI QIDQ266809

List of research outcomes





PublicationDate of PublicationType
Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius2024-12-03Paper
Finding \(k\)-community structures in special graph classes2024-11-06Paper
Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius2024-10-07Paper
Finding matching cuts in \(H\)-free graphs2024-09-11Paper
Locally checkable problems parameterized by clique-width2024-09-11Paper
On blockers and transversals of maximum independent sets in co-comparability graphs2024-08-09Paper
Maximizing Matching Cuts2023-12-20Paper
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs2023-11-13Paper
Finding matching cuts in \(H\)-free graphs2023-10-06Paper
https://portal.mardi4nfdi.de/entity/Q58755822023-02-03Paper
Matching Cuts in Graphs of High Girth and H-Free Graphs2022-12-23Paper
Graph colouring variations2022-12-21Paper
Using edge contractions to reduce the semitotal domination number2022-11-17Paper
On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs2022-10-21Paper
On some subclasses of split \(B_1\)-EPG graphs2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50924032022-07-21Paper
Finding $k$-community structures in special graph classes2022-06-29Paper
On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs2022-04-14Paper
Locally checkable problems parameterized by clique-width2022-03-06Paper
On some special classes of contact \(B_0\)-VPG graphs2022-01-05Paper
Reducing the domination number of \(( P_3 + k P_2 )\)-free graphs via one edge contraction2021-10-21Paper
Blocking total dominating sets via edge contractions2021-06-23Paper
Reducing the domination number of graphs via edge contractions and vertex deletions2021-01-21Paper
CPG graphs: some structural and hardness results2021-01-13Paper
Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width2020-03-12Paper
On split \(B_1\)-EPG graphs2020-02-12Paper
Maximum eccentric connectivity index for graphs with given diameter2019-09-19Paper
Detecting strong cliques2019-07-18Paper
Blocking dominating sets for $H$-free graphs via edge contractions2019-06-28Paper
Proper circular arc graphs as intersection graphs of paths on a grid2019-05-23Paper
Classifying \(k\)-edge colouring for \(H\)-free graphs2019-04-26Paper
Critical vertices and edges in \(H\)-free graphs2019-03-11Paper
Reducing the domination number of graphs via edge contractions2019-03-05Paper
On contact graphs of paths on a grid2019-02-15Paper
On the Parameterized Complexity of $k$-Edge Colouring2019-01-07Paper
Perfectness of clustered graphs2018-10-18Paper
Contraction and deletion blockers for perfect graphs and \(H\)-free graphs2018-09-27Paper
Characterising chordal contact \(B_0\)-VPG graphs2018-08-17Paper
Upper domination: towards a dichotomy through boundary properties2018-07-26Paper
Dominating induced matchings in graphs containing no long claw2018-07-13Paper
Reducing the chromatic number by vertex or edge deletions2018-04-09Paper
Graphs vertex-partitionable into strong cliques2018-04-05Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2017-12-20Paper
Finding a Perfect Phylogeny from Mixed Tumor Samples2017-07-25Paper
Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions2017-05-19Paper
A note on r-equitable k-colorings of trees2017-04-11Paper
On star and biclique edge-colorings2017-03-16Paper
Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions2016-11-30Paper
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid2016-10-17Paper
A Boundary Property for Upper Domination2016-09-29Paper
On some applications of the selective graph coloring problem2016-07-06Paper
Optimal edge-coloring with edge rate constraints2016-06-10Paper
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids2016-06-01Paper
On the minimum and maximum selective graph coloring problems in some graph classes2016-04-07Paper
Contraction Blockers for Graphs with Forbidden Induced Paths2015-09-21Paper
A Dichotomy for Upper Domination in Monogenic Classes2015-09-11Paper
On the maximum independent set problem in subclasses of subcubic graphs2015-03-24Paper
Blockers for the stability number and the chromatic number2015-01-20Paper
Coloring graphs characterized by a forbidden subgraph2014-11-28Paper
Characterizations of cographs as intersection graphs of paths on a grid2014-09-12Paper
Packing and covering with linear programming: a survey2014-07-27Paper
On the complexity of the selective graph coloring problem in some special classes of graphs2014-06-06Paper
https://portal.mardi4nfdi.de/entity/Q53967442014-02-03Paper
On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs2014-01-17Paper
Possible Winners in Approval Voting2013-12-17Paper
Solution methods for a scheduling problem with incompatibility and precedence constraints2013-12-11Paper
Minimum \(d\)-transversals of maximum-weight stable sets in trees2013-11-01Paper
Some properties of edge intersection graphs of single bend paths on a grid2013-10-10Paper
On the intersection graphs of orthogonal line segments in the plane: characterizations of some subclasses of chordal graphs2013-06-26Paper
\(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs2013-06-24Paper
The firefighter problem with more than one firefighter on trees2013-04-25Paper
Selective Graph Coloring in Some Special Classes of Graphs2012-11-02Paper
Coloring Graphs Characterized by a Forbidden Subgraph2012-09-25Paper
A note on chromatic properties of threshold graphs2012-05-30Paper
Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs2012-04-30Paper
Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures2012-04-30Paper
Colouring vertices of triangle-free graphs without forests2012-03-16Paper
https://portal.mardi4nfdi.de/entity/Q31099392012-01-26Paper
A 2-approximation for the maximum satisfying bisection problem2011-04-29Paper
Colouring Vertices of Triangle-Free Graphs2010-11-16Paper
On the use of graphs in discrete tomography2010-05-10Paper
Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid2009-12-15Paper
Blockers and transversals2009-12-10Paper
Mixed graph edge coloring2009-12-09Paper
Graph coloring with cardinality constraints on the neighborhoods2009-11-23Paper
Degree-constrained edge partitioning in graphs arising from discrete tomography2009-05-19Paper
On the use of graphs in discrete tomography2008-09-04Paper
Addendum to ``Bicolored matchings in some classes of graphs2008-08-20Paper
On a graph coloring problem arising from discrete tomography2008-07-29Paper
On two coloring problems in mixed graphs2008-04-22Paper
Bicolored matchings in some classes of graphs2007-05-29Paper
Bicolored matchings in some classes of graphs2007-04-26Paper
Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded RadiusN/APaper

Research outcomes over time

This page was built for person: Bernard Ries