Finding k-community structures in special graph classes
Narmina Baghirova, Clément Dallard, Bernard Ries, David Schindl, Discrete Applied Mathematics (2024) | Artikel
Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius
Felicia Lucke, Daniël Paulusma, Bernard Ries, Theoretical Computer Science (2024) | Artikel
On blockers and transversals of maximum independent sets in co-comparability graphs
Felicia Lucke, Bernard Ries, Discrete Applied Mathematics (2024) | Artikel
Blocking Graph Parameters
, in Encyclopedia of Optimization
Felix Mann and Bernard Ries (2024)
| Buchkapitel
Maximizing Matching Cuts
, in Encyclopedia of Optimization
Van Bang Le and Felicia Lucke and Daniël Paulusma and Bernard Ries (2024)
| Buchkapitel
Dichotomies for Maximum Matching Cut H-Freeness, Bounded Diameter, Bounded Radius1
Bernard Ries and Felicia Lucke and Daniël Paulusma, (2024) | Preprint
Maximizing Matching Cuts
Van Bang Le and Felicia Lucke and Daniël Paulusma and Bernard Ries, (2023) | Preprint
On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs
Felicia Lucke and Bernard Ries, (2023) | Preprint
Finding Matching Cuts in H-Free Graphs
Felicia Lucke and Daniël Paulusma and Bernard Ries, Algorithmica (2023) | Artikel
Finding k-community structures in special graph classes
Narmina Baghirova and Clément Dallard and Bernard Ries and David Schindl, (2023) | Preprint
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2023) | Sonstiges
Preface
Paulusma, D. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023)
| Buch
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2023) | Sonstiges
Matching Cuts in Graphs of High Girth and H-Free Graphs
Feghali, Carl and Lucke, Felicia and Paulusma, Daniël and Ries, Bernard,
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
(2023) | Konferenz
Graph-Theoretic Concepts in Computer Science
Daniël Paulusma and Bernard Ries (Lecture Notes in Computer Science, 2023)
| Buch
Using edge contractions to reduce the semitotal domination number
Esther Galby and Paloma T. Lima and Felix Mann and Bernard Ries, Theoretical Computer Science (2023) | Artikel
Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius
Felicia Lucke and Daniël Paulusma and Bernard Ries and Jérôme Leroux and Sylvain Lombardy and David Peleg, (2023) | Preprint
Matching Cuts in Graphs of High Girth and H-Free Graphs
Carl Feghali and Felicia Lucke and Daniel Paulusma and Bernard Ries, (2022) | Preprint
On the complexity of matching cut for graphs of bounded radius and H-free graphs
Felicia Lucke and Daniël Paulusma and Bernard Ries, Theoretical Computer Science (2022) | Artikel
Finding Matching Cuts in $H$-Free Graphs
Felicia Lucke and Daniël Paulusma and Bernard Ries, (2022) | Preprint
Finding $k$-community structures in special graph classes
Narmina Baghirova and Clément Dallard and Bernard Ries and David Schindl, (2022) | Preprint
On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs
Felicia Lucke and Daniël Paulusma and Bernard Ries, (2022) | Preprint
On some special classes of contact B0-VPG graphs
Flavia Bonomo-Braberman and María Pía Mazzoleni and Mariano Leonardo Rean and Bernard Ries, Discrete Applied Mathematics (2022) | Artikel
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs
Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2022) | Sonstiges
LOCALLY CHECKABLE PROBLEMS PARAMETERIZED BY CLIQUE-WIDTH
Baghirova, N. and Gonzalez, C.L. and Ries, B. and Schindl, D.
, arXiv (2022) | Sonstiges
Finding Matching Cuts in H-Free Graphs
Lucke, F. and Paulusma, D. and Ries, B.,
Leibniz International Proceedings in Informatics, LIPIcs:
(2022) | Konferenz
Matching Cuts in Graphs of High Girth and H-Free Graphs
Feghali, C. and Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2022) | Sonstiges
Locally Checkable Problems Parameterized by Clique-Width
Narmina Baghirova and Carolina Lucía Gonzalez and Bernard Ries and David Schindl and Sang Won Bae and Heejin Park, (2022) | Preprint
Reducing the domination number of (P3+kP2)-free graphs via one edge contraction
Esther Galby and Felix Mann and Bernard Ries, Discrete Applied Mathematics (2021) | Artikel
Using edge contractions to reduce the semitotal domination number
Esther Galby and Paloma T. Lima and Felix Mann and Bernard Ries, (2021) | Preprint
Using edge contractions to reduce the semitotal domination number.
Esther Galby and Paloma T. Lima and Felix Mann and Bernard Ries, (2021) | Preprint
Blocking total dominating sets via edge contractions
Esther Galby and Felix Mann and Bernard Ries, Theoretical Computer Science (2021) | Artikel
Graph colouring variations
, in Topics in Algorithmic Graph Theory
Alain Hertz and Bernard Ries (2021)
| Buchkapitel
CPG graphs: Some structural and hardness results
Nicolas Champseix and Esther Galby and Andrea Munaro and Bernard Ries, Discrete Applied Mathematics (2021) | Artikel
New progress in combinatorial optimization
Bo Chen and Silvano Martello and Bernard Ries, Discrete Applied Mathematics (2021) | Artikel
Using edge contractions to reduce the semitotal domination number
Galby, E. and Lima, P.T. and Mann, F. and Ries, B.
, arXiv (2021) | Sonstiges
Reducing the domination number of graphs via edge contractions and vertex deletions
Esther Galby and Paloma T. Lima and Bernard Ries, Discrete Mathematics (2021) | Artikel
LATIN - On Some Subclasses of Split \(B_1\)-EPG Graphs
, in Lecture Notes in Computer Science
Zakir Deniz and Simon Nivelle and Bernard Ries and David Schindl (2020)
| Buchkapitel
Reducing the domination number of $P_3+kP_2$-free graphs via one edge contraction
Esther Galby and Felix Mann and Bernard Ries, (2020) | Preprint
Reducing the domination number of $P_3+kP_2$-free graphs via one edge\n contraction
Esther Galby and Felix Mann and Bernard Ries, (2020) | Preprint
Blocking total dominating sets via edge contractions
Esther Galby and Felix Mann and Bernard Ries, (2020) | Preprint
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Esther Galby and Andrea Munaro and Bernard Ries, Theoretical Computer Science (2020) | Artikel
Blocking total dominating sets via edge contractions
Galby, E. and Mann, F. and Ries, B.
, arXiv (2020) | Sonstiges
Blocking total dominating sets via edge contractions
Galby, E. and Mann, F. and Ries, B.
, arXiv (2020) | Sonstiges
Maximum eccentric connectivity index for graphs with given diameter
Pierre Hauweele and Alain Hertz and Hadrien Mélot and Bernard Ries and Gauvain Devillez, Discrete Applied Mathematics (2019) | Artikel
Detecting strong cliques
Ademir Hujdurović and Martin Milanič and Bernard Ries, Discrete Mathematics (2019) | Artikel
Blocking dominating sets for $H$-free graphs via edge contractions
Esther Galby and Paloma T. Lima and Bernard Ries, (2019) | Preprint
Classifying k-edge colouring for H-free graphs
Esther Galby and Paloma T. Lima and Daniël Paulusma and Bernard Ries, Information Processing Letters (2019) | Artikel
Proper circular arc graphs as intersection graphs of pathson a grid
Esther Galby and María Pía Mazzoleni and Bernard Ries, Discrete Applied Mathematics (2019) | Artikel
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016
Yves Crama and Bernard Gendron and Bernard Ries, Discrete Applied Mathematics (2019) | Artikel
Graph colouring variations
Alain Hertz and Bernard Ries
(2019) | Sonstiges
CPG graphs: Some structural and hardness results
Nicolas Champseix and Esther Galby and Andrea Munaro and Bernard Ries, (2019) | Preprint
Reducing the domination number of graphs via edge contractions
Esther Galby and Paloma T. Lima and Bernard Ries, (2019) | Preprint
Critical vertices and edges in H-free graphs
Daniël Paulusma and Christophe Picouleau and Bernard Ries, Discrete Applied Mathematics (2019) | Artikel
On the Parameterized Complexity of k-Edge Colouring.
Esther Galby and Paloma T. Lima and Daniël Paulusma and Bernard Ries, (2019) | Preprint
Blocking dominating sets for H-free graphs via edge contractions
Galby, E. and Lima, P.T. and Ries, B.
, arXiv (2019) | Sonstiges
Reducing the domination number of graphs via edge contractions
Galby, E. and Paloma, T.L. and Ries, B.
, arXiv (2019) | Sonstiges
CPG graphs: Some structural and hardness results
Champseix, N. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2019) | Sonstiges
On the parameterized complexity of k-edge colouring
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2019) | Sonstiges
Blocking dominating sets for H-free graphs via edge contractions
Galby, E. and Lima, P.T. and Ries, B.
, arXiv (2019) | Sonstiges
CPG graphs: Some structural and hardness results
Champseix, N. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2019) | Sonstiges
Reducing the domination number of graphs via edge contractions
Galby, E. and Paloma, T.L. and Ries, B.
, arXiv (2019) | Sonstiges
On the parameterized complexity of k-edge colouring
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2019) | Sonstiges
Graph Drawing - On contact graphs of paths on a grid
, in Lecture Notes in Computer Science
Zakir Deniz and Esther Galby and Andrea Munaro and Bernard Ries (2018)
| Buchkapitel
Planar CPG graphs
Nicolas Champseix and Esther Galby and Bernard Ries, (2018) | Preprint
Planar CPG graphs
Nicolas Champseix and Esther Galby and Bernard Ries, (2018) | Preprint
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width.
Esther Galby and Andrea Munaro and Bernard Ries, (2018) | Preprint
Semitotal Domination: New hardness results and a polynomial-time\n algorithm for graphs of bounded mim-width
Esther Galby and Andrea Munaro and Bernard Ries, (2018) | Preprint
Classifying k-Edge Colouring for H-free Graphs
Esther Galby and Paloma T. Lima and Daniël Paulusma and Bernard Ries, (2018) | Preprint
Contraction and deletion blockers for perfect graphs and H-free graphs
Öznur Yaşar Diner and Daniël Paulusma and Christophe Picouleau and Bernard Ries, Theoretical Computer Science (2018) | Artikel
Maximum Eccentric Connectivity Index for Graphs with Given Diameter
Pierre Hauweele and Alain Hertz and Hadrien Mélot and Bernard Ries and Gauvain Devillez, (2018) | Preprint
Proper circular arc graphs as intersection graphs of paths on a grid
Esther Galby and María Pía Mazzoleni and Bernard Ries, (2018) | Preprint
Detecting strong cliques
Ademir Hujdurović and Martin Milanič and Bernard Ries, (2018) | Preprint
Maximum eccentric connectivity index for graphs with given diameter
Pierre Hauweele and Alain Hertz and Hadrien Mélot and Bernard Ries and Gauvain Devillez
(2018) | Sonstiges
On some special classes of contact $B_0$-VPG graphs
Flavia Bonomo-Braberman and María Pía Mazzoleni and Mariano Leonardo Rean and Bernard Ries, (2018) | Preprint
ISCO - Characterising Chordal Contact $$B_0$$-VPG Graphs
Flavia Bonomo and María Pía Mazzoleni and Mariano Leonardo Rean and Bernard Ries (Lecture Notes in Computer Science, 2018)
| Buch
Graphs vertex-partitionable into strong cliques
Ademir Hujdurović and Martin Milanič and Bernard Ries, Discrete Mathematics (2018) | Artikel
LATIN - On Split $$B_1$$-EPG Graphs
, in Lecture Notes in Computer Science
Zakir Deniz and Simon Nivelle and Bernard Ries and David Schindl (2018)
| Buchkapitel
On contact graphs of paths on a grid
Zakir Deniz and Esther Galby and Bernard Ries, (2018) | Preprint
Planar CPG graphs
Champseix, N. and Galby, E. and Ries, B.
, arXiv (2018) | Sonstiges
Semitotal Domination: New hardness results and a polynomial-Time algorithm for graphs of bounded mim-width
Galby, E. and Munaro, A. and Ries, B.
, arXiv (2018) | Sonstiges
Classifying k-edge colouring for H-free graphs
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2018) | Sonstiges
Proper circular arc graphs as intersection graphs of paths on a grid
Galby, E. and Mazzoleni, M.P. and Ries, B.
, arXiv (2018) | Sonstiges
Detecting strong cliques
Hujdurovi?, A. and Milani?, M. and Ries, B.
, arXiv (2018) | Sonstiges
On some special classes of contact B<sub>0</sub>-VPG graphs
Bonomo, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B.
, arXiv (2018) | Sonstiges
On contact graphs of paths on a Grid
Deniz, Z. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2018) | Sonstiges
On some special classes of contact B<sub>0</sub>-VPG graphs
Bonomo-Braberman, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B.
, arXiv (2018) | Sonstiges
Proper circular arc graphs as intersection graphs of paths on a grid
Galby, E. and Mazzoleni, M.P. and Ries, B.
, arXiv (2018) | Sonstiges
Classifying k-edge colouring for H-free graphs
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2018) | Sonstiges
Detecting strong cliques
Hujdurovi?, A. and Milani?, M. and Ries, B.
, arXiv (2018) | Sonstiges
On contact graphs of paths on a Grid
Deniz, Z. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2018) | Sonstiges
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Liliana Alcón and Flavia Bonomo and Guillermo Durán and Marisa Gutierrez and María Pía Mazzoleni and Bernard Ries and Mario Valencia-Pabon, Discrete Applied Mathematics (2018) | Artikel
Reducing the Chromatic Number by Vertex or Edge Deletions
Christophe Picouleau and Daniël Paulusma and Bernard Ries, Electronic Notes in Discrete Mathematics (2017) | Artikel
Dominating induced matchings in graphs containing no long claw
Alain Hertz and Vadim V. Lozin and Bernard Ries and Victor Zamaraev and D. de Werra, Journal of Graph Theory (2017) | Artikel
Upper Domination: Towards a Dichotomy Through Boundary Properties
Hassan AbouEisha and Shahid Hussain and Vadim V. Lozin and Jérôme Monnot and Bernard Ries and Victor Zamaraev, Algorithmica (2017) | Artikel
Critical Vertices and Edges in $H$-free Graphs
Daniël Paulusma and Christophe Picouleau and Bernard Ries, (2017) | Preprint
Contraction and Deletion Blockers for Perfect Graphs and $H$-free Graphs
Öznur Yaşar Diner and Daniël Paulusma and Christophe Picouleau and Bernard Ries, (2017) | Preprint
TAMC - Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions
, in Lecture Notes in Computer Science
Daniël Paulusma and Christophe Picouleau and Bernard Ries (2017)
| Buchkapitel
Contraction and deletion blockers for perfect graphs and h-free graphs?
Diner, O.Y. and Paulusma, D. and Picouleau, C. and Ries, B.
, arXiv (2017) | Sonstiges
Critical Vertices and Edges in H-free Graphs<sup>?</sup>
Paulusma, D. and Picouleau, C. and Ries, B.
, arXiv (2017) | Sonstiges
Contraction and deletion blockers for perfect graphs and h-free graphs?
Diner, O.Y. and Paulusma, D. and Picouleau, C. and Ries, B.
, arXiv (2017) | Sonstiges
Critical Vertices and Edges in H-free Graphs<sup>?</sup>
Paulusma, D. and Picouleau, C. and Ries, B.
, arXiv (2017) | Sonstiges
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Liliana Alcón and Flavia Bonomo and Guillermo Durán and Marisa Gutierrez and María Pía Mazzoleni and Bernard Ries and Mario Valencia-Pabon, Electronic Notes in Discrete Mathematics (2015) | Artikel
Advances in Combinatorial Optimization
Silvano Martello and Bernard Ries, Discrete Applied Mathematics (2015) | Artikel
Vote par approbation pour les élections à vainqueurs multiples. Une famille générale de règles, leur complexité algorithmique et leur manipulabilité
Nathanaël Barrot and Jérôme Lang and Bernard Ries, Revue d’intelligence artificielle (2015) | Artikel
WABI - Finding a Perfect Phylogeny from Mixed Tumor Samples
, in Lecture Notes in Computer Science
Ademir Hujdurović and Urša Kačar and Martin Milanič and Bernard Ries and Alexandru I. Tomescu (2015)
| Buchkapitel
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Liliana Alcón and Flavia Bonomo and Guillermo Durán and Marisa Gutierrez and María Pía Mazzoleni and Bernard Ries and Mario Valencia-Pabon, (2015) | Preprint
Finding a perfect phylogeny from mixed tumor samples
Ademir Hujdurović and Urša Kačar and Martin Milanič and Bernard Ries and Alexandru I. Tomescu, (2015) | Preprint
Complexity and algorithms for finding a perfect phylogeny from mixed\n tumor samples
Ademir Hujdurović and Urša Kačar and Martin Milanič and Bernard Ries and Alexandru I. Tomescu, (2015) | Preprint
Complexity and algorithms for finding a perfect phylogeny from mixed tumor samples
Ademir Hujdurović and Urša Kačar and Martin Milanič and Bernard Ries and Alexandru I. Tomescu, (2015) | Preprint
CIAC - Contraction Blockers for Graphs with Forbidden Induced Paths
, in Lecture Notes in Computer Science
Öznur Yaşar Diner and Daniël Paulusma and Christophe Picouleau and Bernard Ries (2015)
| Buchkapitel
Dominating induced matchings in graphs containing no long claw
Alain Hertz and Vadim V. Lozin and Bernard Ries and Victor Zamaraev and D. de Werra, (2015) | Preprint
AAMAS - Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability
Georgios Amanatidis, Nathanaël Barrot, Jérôme Lang, Evangelos Markakis, Bernard Ries,
(4.5.2015) | Konferenz
Multiple Referenda and Multiwinner Elections Using Hamming Distances: Complexity and Manipulability
Georgios Amanatidis and Nathanaël Barrot and Jérôme Lang and Evangelos Markakis and Bernard Ries,
International Joint Conference on Autonomous Agents and Multiagent Systems:
(4.5.2015) | Konferenz
On the maximum independent set problem in subclasses of subcubic graphs
Vadim V. Lozin and Jérôme Monnot and Bernard Ries, Journal of Discrete Algorithms (2015) | Artikel
Multiple referenda and multiwinner elections using Hamming distances: Complexity and manipulability
Amanatidis, G. and Barrot, N. and Lang, J. and Markakis, E. and Ries, B.,
Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS:
(2015) | Konferenz
On some applications of the selective graph coloring problem
Marc Demange and Tınaz Ekim and Bernard Ries and Cerasela Tanasescu, European Journal of Operational Research (2015) | Artikel
ICORES - Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory.
Bernard Ries (2015)
| Buch
CTW - On the Minimum and Maximum Selective Graph Coloring Problems.
Marc Demange, Tınaz Ekim, Bernard Ries,
(2015) | Konferenz
Coloring graphs characterized by a forbidden subgraph
Petr A. Golovach and Daniël Paulusma and Bernard Ries, Discrete Applied Mathematics (2015) | Artikel
Blockers for the Stability Number and the Chromatic Number
Cristina Bazgan and Cédric Bentz and Christophe Picouleau and Bernard Ries, Graphs and Combinatorics (2013) | Artikel
Perfectness of clustered graphs
Flavia Bonomo and Denis Cornaz and Tınaz Ekim and Bernard Ries, Discrete Optimization (2013) | Artikel
A Note on \(r\)-Equitable \(k\)-Colorings of Trees
Alain Hertz and Bernard Ries
(2013) | Sonstiges
Packing and covering with linear programming: A survey
Cédric Bentz and Denis Cornaz and Bernard Ries, European Journal of Operational Research (2013) | Artikel
The firefighter problem with more than one firefighter on trees
Cristina Bazgan and Morgan Chopin and Bernard Ries, Discrete Applied Mathematics (2013) | Artikel
Optimal edge-coloring with edge rate constraints
Dariusz Dereniowski and Wieslaw Kubiak and Bernard Ries and Yori Zwols, Networks (2013) | Artikel
Editorial: GO VII Meeting, Ovronnaz (CH), June 13-17, 2010
Marc Demange and Vadim Lozin and Christophe Picouleau and Bernard Ries, Discrete Applied Mathematics (2013) | Artikel
Possible winners in approval voting
Barrot, N. and Gourvès, L. and Lang, J. and Monnot, J. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
| Buch
ADT - Possible Winners in Approval Voting
, in Lecture Notes in Computer Science
Nathanaël Barrot and Laurent Gourvès and Jérôme Lang and Jérôme Monnot and Bernard Ries (2013)
| Buchkapitel
IWOCA - On the Maximum Independent Set Problem in Subclasses of Subcubic Graphs
, in Lecture Notes in Computer Science
Vadim V. Lozin and Jérôme Monnot and Bernard Ries (2013)
| Buchkapitel
Solution Methods for a Scheduling Problem with Incompatibility and Precedence Constraints
François-Xavier Meuwly and Bernard Ries and Nicolas Zufferey, Algorithmic Operations Research (2010) | Artikel
S3@MobiCom - Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
Berk Birand and Maria Chudnovsky and Bernard Ries and Paul Seymour and Gil Zussman and Yori Zwols (Proceedings of the 2010 ACM workshop on Wireless of the students, by the students, for the students, 2010)
| Buch
INFOCOM - Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
Berk Birand, Maria Chudnovsky, Bernard Ries, Paul Seymour, Gil Zussman, Yori Zwols,
(14.3.2010) | Konferenz
Complexity of two coloring problems in cubic planar bipartite mixed graphs
Bernard Ries, Discrete Applied Mathematics (2010) | Artikel
Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
Berk Birand and Maria Chudnovsky and Bernard Ries and Paul Seymour and Gil Zussman and Yori Zwols,
2010 Proceedings IEEE INFOCOM:
(3.2010) | Konferenz
Split-critical and uniquely split-colorable graphs
Ekim, T. and Ries, B. and De Werra, D., Discrete Mathematics and Theoretical Computer Science (2010) | Artikel
WG - Colouring vertices of triangle-free graphs
, in Lecture Notes in Computer Science
Konrad K. Dabrowski and Vadim V. Lozin and Rajiv Raman and Bernard Ries (2010)
| Buchkapitel
Split-critical and uniquely split-colorable graphs
Tınaz Ekim and Bernard Ries and D. de Werra, Discrete Mathematics & Theoretical Computer Science (2010) | Artikel
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
Bernard Ries and Cédric Bentz and Christophe Picouleau and D. de Werra and Marie-Christine Costa and Rico Zenklusen, Discrete Mathematics (2010) | Artikel
Split-critical and uniquely split-colorable graphs
Tınaz Ekim and Bernard Ries and Dominique De Werra, Discrete Mathematics & Theoretical Computer Science (2010) | Artikel
Blockers and transversalsnext term in some previous termsubclasses of bipartite graphs: When caterpillars are dancing on a gridnext term
Cédric Bentz and Marie-Christine Costa and Bernard Ries and D. de Werra and Christophe Picouleau and Rico Zenklusen
(2010) | Sonstiges
On the use of graphs in discrete tomography
D. de Werra and Marie-Christine Costa and Christophe Picouleau and Bernard Ries, Annals of Operations Research (2009) | Artikel
Graph coloring with cardinality constraints on the neighborhoods
Marie-Christine Costa and D. de Werra and Christophe Picouleau and Bernard Ries, Discrete Optimization (2009) | Artikel
Some properties of edge intersection graphs of single bend paths on a grid
Bernard Ries, Electronic Notes in Discrete Mathematics (2009) | Artikel
Blockers and transversals
Rico Zenklusen and Bernard Ries and Christophe Picouleau and D. de Werra and Marie-Christine Costa and Cédric Bentz, Discrete Mathematics (2009) | Artikel
Mixed graph edge coloring
Hanna Furmańczyk and Adrian Kosowski and Bernard Ries and Paweł Żyliński, Discrete Mathematics (2009) | Artikel
d-bloqueurs et d-transversaux
Cédric Bentz and Marie-Christine Costa and D. de Werra and Christophe Picouleau and Bernard Ries and Rico Zenklusen
(2009) | Sonstiges
Degree-constrained edge partitioning in graphs arising from discrete tomography
Bentz, C. and Costa, M.-C. and Picouleau, C. and Ries, B. and de Werra, D., Journal of Graph Algorithms and Applications (2009) | Artikel
Degree-constrained edge partitioning in graphs arising from discrete tomography
Cédric Bentz and Marie-Christine Costa and Christophe Picouleau and Bernard Ries and D. de Werra, Journal of Graph Algorithms and Applications (2009) | Artikel
Addendum to “Bicolored Matchings in Some Classes of Graphs”
Marie-Christine Costa and D. de Werra and Christophe Picouleau and Bernard Ries, Graphs and Combinatorics (2008) | Artikel
On the use of graphs in discrete tomography
D. de Werra and Marie-Christine Costa and Christophe Picouleau and Bernard Ries, 4OR (2008) | Artikel
On two coloring problems in mixed graphs
Bernard Ries and D. de Werra, European Journal of Combinatorics (2008) | Artikel
On a graph coloring problem arising from discrete tomography
Bentz, C. and Costa, M.C. and De Werra, D. and Picouleau, C. and Ries, B., Networks (2008) | Artikel
Complexity of mixed graph coloring
Bernard Ries, Theoretical Computer Science (2008) | Artikel
