Finding Matching Cuts in H-Free Graphs
Bernard Ries, Felicia Lucke, Daniël Paulusma, Algorithmica (2023) | Article
Using edge contractions to reduce the semitotal domination number
Galby, E. and Lima, P.T. and Mann, F. and Ries, B., Theoretical Computer Science (2023) | Article
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2023) | Autre
Finding k-community structures in special graph classes
Baghirova, N. and Dallard, C. and Ries, B. and Schindl, D.
, Research Square (2023) | Autre
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Lucke, F. and Paulusma, D. and Ries, B.,
Leibniz International Proceedings in Informatics, LIPIcs:
(2023) | Conférence
Preface
Paulusma, D. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023)
| Livre
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2023) | Autre
On some special classes of contact B_{0}-VPG graphs
Bonomo-Braberman, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B., Discrete Applied Mathematics (2022) | Article
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) | Autre
FINDING K-COMMUNITY STRUCTURES IN SPECIAL GRAPH CLASSES
Baghirova, N. and Dallard, C. and Ries, B. and Schindl, D.
, arXiv (2022) | Autre
LOCALLY CHECKABLE PROBLEMS PARAMETERIZED BY CLIQUE-WIDTH
Baghirova, N. and Gonzalez, C.L. and Ries, B. and Schindl, D.
, arXiv (2022) | Autre
Finding Matching Cuts in H-Free Graphs
Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2022) | Autre
Matching Cuts in Graphs of High Girth and H-Free Graphs
Feghali, C. and Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2022) | Autre
Finding Matching Cuts in H-Free Graphs
Lucke, F. and Paulusma, D. and Ries, B.,
Leibniz International Proceedings in Informatics, LIPIcs:
(2022) | Conférence
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) | Autre
On the complexity of matching cut for graphs of bounded radius and H-free graphs
Lucke, F. and Paulusma, D. and Ries, B., Theoretical Computer Science (2022) | Article
Locally Checkable Problems Parameterized by Clique-Width
Baghirova, N. and Gonzalez, C.L. and Ries, B. and Schindl, D.,
Leibniz International Proceedings in Informatics, LIPIcs:
(2022) | Conférence
Matching Cuts in Graphs of High Girth and H-Free Graphs
Feghali, C. and Lucke, F. and Paulusma, D. and Ries, B.
, arXiv (2022) | Autre
CPG graphs: Some structural and hardness results
Nicolas Champseix and Esther Galby and Andrea Munaro and Bernard Ries, Discrete Applied Mathematics (2021) | Article
Using edge contractions to reduce the semitotal domination number
Galby, E. and Lima, P.T. and Mann, F. and Ries, B.
, arXiv (2021) | Autre
Reducing the domination number of (P_{3}+kP_{2})-free graphs via one edge contraction
Galby, E. and Mann, F. and Ries, B., Discrete Applied Mathematics (2021) | Article
Reducing the domination number of graphs via edge contractions and vertex deletions
Galby, E. and Lima, P.T. and Ries, B., Discrete Mathematics (2021) | Article
Blocking total dominating sets via edge contractions
Galby, E. and Mann, F. and Ries, B., Theoretical Computer Science (2021) | Article
New progress in combinatorial optimization
Chen, B. and Martello, S. and Ries, B., Discrete Applied Mathematics (2021) | Article
Using edge contractions to reduce the semitotal domination number
Galby, E. and Lima, P.T. and Mann, F. and Ries, B.
, arXiv (2021) | Autre
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
Galby, E. and Munaro, A. and Ries, B., Theoretical Computer Science (2020) | Article
Blocking total dominating sets via edge contractions
Galby, E. and Mann, F. and Ries, B.
, arXiv (2020) | Autre
On Some Subclasses of Split B<sub>1</sub> -EPG Graphs
Deniz, Z. and Nivelle, S. and Ries, B. and Schindl, D. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2020)
| Livre
Blocking total dominating sets via edge contractions
Galby, E. and Mann, F. and Ries, B.
, arXiv (2020) | Autre
Critical vertices and edges in H-free graphs
Paulusma, D. and Picouleau, C. and Ries, B., Discrete Applied Mathematics (2019) | Article
Detecting strong cliques
Hujdurovi?, A. and Milani?, M. and Ries, B., Discrete Mathematics (2019) | Article
Classifying k-edge colouring for H-free graphs
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B., Information Processing Letters (2019) | Article
Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016
Crama, Y. and Gendron, B. and Ries, B., Discrete Applied Mathematics (2019) | Article
Proper circular arc graphs as intersection graphs of pathson a grid
Galby, E. and Mazzoleni, M.P. and Ries, B., Discrete Applied Mathematics (2019) | Article
Blocking dominating sets for H-free graphs via edge contractions
Galby, E. and Lima, P.T. and Ries, B.,
Leibniz International Proceedings in Informatics, LIPIcs:
(2019) | Conférence
Reducing the domination number of graphs via edge contractions
Galby, E. and Lima, P.T. and Ries, B.,
Leibniz International Proceedings in Informatics, LIPIcs:
(2019) | Conférence
Maximum eccentric connectivity index for graphs with given diameter
Hauweele, P. and Hertz, A. and Mélot, H. and Ries, B. and Devillez, G., Discrete Applied Mathematics (2019) | Article
Blocking dominating sets for H-free graphs via edge contractions
Galby, E. and Lima, P.T. and Ries, B.
, arXiv (2019) | Autre
Reducing the domination number of graphs via edge contractions
Galby, E. and Paloma, T.L. and Ries, B.
, arXiv (2019) | Autre
CPG graphs: Some structural and hardness results
Champseix, N. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2019) | Autre
On the parameterized complexity of k-edge colouring
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2019) | Autre
Blocking dominating sets for H-free graphs via edge contractions
Galby, E. and Lima, P.T. and Ries, B.
, arXiv (2019) | Autre
CPG graphs: Some structural and hardness results
Champseix, N. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2019) | Autre
Reducing the domination number of graphs via edge contractions
Galby, E. and Paloma, T.L. and Ries, B.
, arXiv (2019) | Autre
On the parameterized complexity of k-edge colouring
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2019) | Autre
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Alcón, L. and Bonomo, F. and Durán, G. and Gutierrez, M. and Mazzoleni, M.P. and Ries, B. and Valencia-Pabon, M., Discrete Applied Mathematics (2018) | Article
Upper Domination: Towards a Dichotomy Through Boundary Properties
AbouEisha, H. and Hussain, S. and Lozin, V. and Monnot, J. and Ries, B. and Zamaraev, V., Algorithmica (2018) | Article
On contact graphs of paths on a grid
Deniz, Z. and Galby, E. and Munaro, A. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
| Livre
On split B<inf>1</inf> -EPG graphs
Deniz, Z. and Nivelle, S. and Ries, B. and Schindl, D. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
| Livre
Dominating induced matchings in graphs containing no long claw
Hertz, A. and Lozin, V. and Ries, B. and Zamaraev, V. and de Werra, D., Journal of Graph Theory (2018) | Article
Contraction and deletion blockers for perfect graphs and H-free graphs
Diner, Ö.Y. and Paulusma, D. and Picouleau, C. and Ries, B., Theoretical Computer Science (2018) | Article
Characterising Chordal ContactB<inf>0</inf>-VPG Graphs
Bonomo, F. and Mazzoleni, M.P. and Rean, M.L. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018)
| Livre
Graphs vertex-partitionable into strong cliques
Hujdurovi?, A. and Milani?, M. and Ries, B., Discrete Mathematics (2018) | Article
Complexity and Algorithms for Finding a Perfect Phylogeny from Mixed Tumor Samples
Hujdurovic, A. and Kacar, U. and Milanic, M. and Ries, B. and Tomescu, A.I., IEEE/ACM Transactions on Computational Biology and Bioinformatics (2018) | Article
Planar CPG graphs
Champseix, N. and Galby, E. and Ries, B.
, arXiv (2018) | Autre
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) | Autre
Classifying k-edge colouring for H-free graphs
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2018) | Autre
Proper circular arc graphs as intersection graphs of paths on a grid
Galby, E. and Mazzoleni, M.P. and Ries, B.
, arXiv (2018) | Autre
Detecting strong cliques
Hujdurovi?, A. and Milani?, M. and Ries, B.
, arXiv (2018) | Autre
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) | Autre
On contact graphs of paths on a Grid
Deniz, Z. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2018) | Autre
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) | Autre
Proper circular arc graphs as intersection graphs of paths on a grid
Galby, E. and Mazzoleni, M.P. and Ries, B.
, arXiv (2018) | Autre
Planar CPG graphs
Champseix, N. and Galby, E. and Ries, B.
, arXiv (2018) | Autre
Classifying k-edge colouring for H-free graphs
Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B.
, arXiv (2018) | Autre
Detecting strong cliques
Hujdurovi?, A. and Milani?, M. and Ries, B.
, arXiv (2018) | Autre
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) | Autre
On contact graphs of paths on a Grid
Deniz, Z. and Galby, E. and Munaro, A. and Ries, B.
, arXiv (2018) | Autre
On star and biclique edge-colorings
Dantas, S. and Groshaus, M. and Guedes, A. and Machado, R.C.S. and Ries, B. and Sasaki, D., International Transactions in Operational Research (2017) | Article
Blocking independent sets for h -free graphs via edge contractions and vertex deletions
Paulusma, D. and Picouleau, C. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2017)
| Livre
Reducing the Chromatic Number by Vertex or Edge Deletions
Picouleau, C. and Paulusma, D. and Ries, B., Electronic Notes in Discrete Mathematics (2017) | Article
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) | Autre
Critical Vertices and Edges in H-free Graphs<sup>?</sup>
Paulusma, D. and Picouleau, C. and Ries, B.
, arXiv (2017) | Autre
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) | Autre
Critical Vertices and Edges in H-free Graphs<sup>?</sup>
Paulusma, D. and Picouleau, C. and Ries, B.
, arXiv (2017) | Autre
On the minimum and maximum selective graph coloring problems in some graph classes
Demange, M. and Ekim, T. and Ries, B., Discrete Applied Mathematics (2016) | Article
On the ratio between maximum weight perfect matchings and maximum weight matchings in grids
Da Fonseca, G.D. and Ries, B. and Sasaki, D., Discrete Applied Mathematics (2016) | Article
A boundary property for upper domination
Aboueisha, H. and Hussain, S. and Lozin, V. and Monnot, J. and Ries, B. and Zamaraev, V. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016)
| Livre
Reducing the clique and chromatic number via edge contractions and vertex deletions
Paulusma, D. and Picouleau, C. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2016)
| Livre
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) | Conférence
On some applications of the selective graph coloring problem
Demange, M. and Ekim, T. and Ries, B. and Tanasescu, C., European Journal of Operational Research (2015) | Article
Contraction blockers for graphs with forbidden induced paths
Diner, Ö.Y. and Paulusma, D. and Picouleau, C. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015)
| Livre
Coloring graphs characterized by a forbidden subgraph
Golovach, P.A. and Paulusma, D. and Ries, B., Discrete Applied Mathematics (2015) | Article
On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Alcón, L. and Bonomo, F. and Durán, G. and Gutierrez, M. and Pía Mazzoleni, M. and Ries, B. and Valencia-Pabon, M., Electronic Notes in Discrete Mathematics (2015) | Article
Finding a perfect phylogeny from mixed tumor samples
Hujdurovié, A. and Kacar, U. and Milani?, M. and Ries, B. and Tomescu, A.I. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015)
| Livre
Approval voting for committee election: A general family of rules, their complexity and their manipulability,Vote par approbation pour les élections à vainqueurs multiples: Une famille générale de règles, leur complexité algorithmique et leur manipulabilité
Barrot, N. and Lang, J. and Ries, B., Revue d’Intelligence Artificielle (2015) | Article
On the maximum independent set problem in subclasses of subcubic graphs
Lozin, V. and Monnot, J. and Ries, B., Journal of Discrete Algorithms (2015) | Article
Blockers for the Stability Number and the Chromatic Number
Bazgan, C. and Bentz, C. and Picouleau, C. and Ries, B., Graphs and Combinatorics (2015) | Article
Advances in combinatorial optimization
Martello, S. and Ries, B., Discrete Applied Mathematics (2015) | Article
On the complexity of the selective graph coloring problem in some special classes of graphs?
Demange, M. and Monnot, J. and Pop, P. and Ries, B., Theoretical Computer Science (2014) | Article
A note on r-equitable k-colorings of trees
Hertz, A. and Ries, B., Yugoslav Journal of Operations Research (2014) | Article
A dichotomy for upper domination in monogenic classes
Aboueisha, H. and Hussain, S. and Lozin, V. and Monnot, J. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014)
| Livre
Characterizations of cographs as intersection graphs of paths on a grid
Cohen, E. and Golumbic, M.C. and Ries, B., Discrete Applied Mathematics (2014) | Article
Perfectness of clustered graphs
Bonomo, F. and Cornaz, D. and Ekim, T. and Ries, B., Discrete Optimization (2013) | Article
GO VII Meeting, Ovronnaz (CH), June 13-17, 2010
Demange, M. and Lozin, V. and Picouleau, C. and Ries, B., Discrete Applied Mathematics (2013) | Article
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)
| Livre
The firefighter problem with more than one firefighter on trees
Bazgan, C. and Chopin, M. and Ries, B., Discrete Applied Mathematics (2013) | Article
On the maximum independent set problem in subclasses of subcubic graphs
Lozin, V. and Monnot, J. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2013)
| Livre
Optimal edge-coloring with edge rate constraints
Dereniowski, D. and Kubiak, W. and Ries, B. and Zwols, Y., Networks (2013) | Article
Packing and covering with linear programming: A survey
Bentz, C. and Cornaz, D. and Ries, B., European Journal of Operational Research (2013) | Article
On the Intersection Graphs of Orthogonal Line Segments in the Plane: Characterizations of Some Subclasses of Chordal Graphs
Golumbic, M.C. and Ries, B., Graphs and Combinatorics (2013) | Article
Coloring graphs characterized by a forbidden subgraph
Golovach, P.A. and Paulusma, D. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
| Livre
Some properties of edge intersection graphs of single-bend paths on a grid
Asinowski, A. and Ries, B., Discrete Mathematics (2012) | Article
Colouring vertices of triangle-free graphs without forests
Dabrowski, K.K. and Lozin, V. and Raman, R. and Ries, B., Discrete Mathematics (2012) | Article
A note on chromatic properties of threshold graphs
Ries, B. and De Werra, D. and Zenklusen, R., Discrete Mathematics (2012) | Article
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
Birand, B. and Chudnovsky, M. and Ries, B. and Seymour, P. and Zussman, G. and Zwols, Y., IEEE/ACM Transactions on Networking (2012) | Article
Selective graph coloring in some special classes of graphs
Demange, M. and Monnot, J. and Pop, P. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012)
| Livre
D-Transversals of stable sets and vertex covers in weighted bipartite graphs
Bentz, C. and Costa, M.-C. and Picouleau, C. and Ries, B. and De Werra, D., Journal of Discrete Algorithms (2012) | Article
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees
Bentz, C. and Costa, M.-C. and de Werra, D. and Picouleau, C. and Ries, B., Electronic Notes in Discrete Mathematics (2011) | Article
A 2-approximation for the maximum satisfying bisection problem
Ries, B. and Zenklusen, R., European Journal of Operational Research (2011) | Article
Claw-free graphs with strongly perfect complements. Fractional and integral version, Part II: Nontrivial strip-structures
Chudnovsky, M. and Ries, B. and Zwols, Y., Discrete Applied Mathematics (2011) | Article
Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs
Chudnovsky, M. and Ries, B. and Zwols, Y., Discrete Applied Mathematics (2011) | Article
Split-critical and uniquely split-colorable graphs
Ekim, T. and Ries, B. and De Werra, D., Discrete Mathematics and Theoretical Computer Science (2010) | Article
Complexity of two coloring problems in cubic planar bipartite mixed graphs
Ries, B., Discrete Applied Mathematics (2010) | Article
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid
Ries, B. and Bentz, C. and Picouleau, C. and de Werra, D. and Costa, M.-C. and Zenklusen, R., Discrete Mathematics (2010) | Article
Colouring vertices of triangle-free graphs
Dabrowski, K. and Lozin, V. and Raman, R. and Ries, B. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010)
| Livre
On the use of graphs in discrete tomography
de Werra, D. and Costa, M.-C. and Picouleau, C. and Ries, B., Annals of Operations Research (2010) | Article
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
Birand, B. and Chudnovsky, M. and Ries, B. and Seymour, P. and Zussman, G. and Zwols, Y.,
Proceedings - IEEE INFOCOM:
(2010) | Conférence
Analyzing the performance of greedy maximal scheduling via local pooling and graph theory
Birand, B. and Chudnovsky, M. and Ries, B. and Seymour, P. and Zussman, G. and Zwols, Y.,
Proceedings of the Annual International Conference on Mobile Computing and Networking, MOBICOM:
(2010) | Conférence
Split-critical and uniquely split-colorable graphs
Tınaz Ekim, Bernard Ries, Dominique De Werra, Discrete Mathematics & Theoretical Computer Science (2010) | Article
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) | Article
Graph coloring with cardinality constraints on the neighborhoods
Costa, M.-C. and de Werra, D. and Picouleau, C. and Ries, B., Discrete Optimization (2009) | Article
Mixed graph edge coloring
Furma?czyk, H. and Kosowski, A. and Ries, B. and Zyli?ski, P., Discrete Mathematics (2009) | Article
Blockers and transversals
Zenklusen, R. and Ries, B. and Picouleau, C. and de Werra, D. and Costa, M.-C. and Bentz, C., Discrete Mathematics (2009) | Article
Some properties of edge intersection graphs of single bend paths on a grid
Ries, B., Electronic Notes in Discrete Mathematics (2009) | Article
On the use of graphs in discrete tomography
De Werra, D. and Costa, M.-C. and Picouleau, C. and Ries, B., 4OR (2008) | Article
On two coloring problems in mixed graphs
Ries, B. and de Werra, D., European Journal of Combinatorics (2008) | Article
Bicolored matchings in some classes of graphs (Graphs and Combinatorics (2007) 23, (47-60))
Costa, M.C. and De Werra, D. and Picouleau, C. and Ries, B., Graphs and Combinatorics (2008) | Article
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) | Article