Bernard Ries

According to our database1, Bernard Ries
  • authored at least 67 papers between 2005 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
On star and biclique edge-colorings.
ITOR, 2017

Critical Vertices and Edges in $H$-free Graphs.
CoRR, 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.
Discrete Applied Mathematics, 2016

On the minimum and maximum selective graph coloring problems in some graph classes.
Discrete Applied Mathematics, 2016

On graphs vertex-partitionable into strong cliques.
CoRR, 2016

Upper Domination: towards a dichotomy through boundary properties.
CoRR, 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é.
Revue d'Intelligence Artificielle, 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 and Combinatorics, 2015

On some applications of the selective graph coloring problem.
European Journal of Operational Research, 2015

On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid.
Electronic Notes in Discrete Mathematics, 2015

Advances in Combinatorial Optimization.
Discrete Applied Mathematics, 2015

Coloring graphs characterized by a forbidden subgraph.
Discrete Applied Mathematics, 2015

Finding a perfect phylogeny from mixed tumor samples.
CoRR, 2015

Dominating induced matchings in graphs containing no long claw.
CoRR, 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.
Discrete Applied Mathematics, 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 and Combinatorics, 2013

Packing and covering with linear programming: A survey.
European Journal of Operational Research, 2013

Perfectness of clustered graphs.
Discrete Optimization, 2013

GO VII Meeting, Ovronnaz (CH), June 13-17, 2010.
Discrete Applied Mathematics, 2013

The firefighter problem with more than one firefighter on trees.
Discrete Applied Mathematics, 2013

On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 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.
Discrete Mathematics, 2012

Colouring vertices of triangle-free graphs without forests.
Discrete Mathematics, 2012

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

Coloring Graphs Characterized by a Forbidden Subgraph.
Proceedings of the Mathematical Foundations of Computer Science 2012, 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.
European Journal of Operational Research, 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.
Electronic Notes in Discrete Mathematics, 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures.
Discrete Applied Mathematics, 2011

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs.
Discrete Applied Mathematics, 2011

The firefighter problem with more than one firefighter on trees
CoRR, 2011

2010
Split-critical and uniquely split-colorable graphs.
Discrete Mathematics & Theoretical Computer Science, 2010

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

Complexity of two coloring problems in cubic planar bipartite mixed graphs.
Discrete Applied Mathematics, 2010

Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints.
Algorithmic Operations Research, 2010

On the use of graphs in discrete tomography.
Annals OR, 2010

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

Analyzing the performance of greedy maximal scheduling via local pooling and graph theory.
Proceedings of the 2010 ACM workshop on Wireless of the students, 2010

Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 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.
Electronic Notes in Discrete Mathematics, 2009

Blockers and transversals.
Discrete Mathematics, 2009

Mixed graph edge coloring.
Discrete Mathematics, 2009

Graph coloring with cardinality constraints on the neighborhoods.
Discrete Optimization, 2009

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

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

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

On the use of graphs in discrete tomography.
4OR, 2008

2007
Bicolored Matchings in Some Classes of Graphs.
Graphs and Combinatorics, 2007

Coloring some classes of mixed graphs.
Discrete Applied Mathematics, 2007

2005
Bicolored matchings in some classes of graphs.
Electronic Notes in Discrete Mathematics, 2005


  Loading...