Explainable Graph-theoretical Machine Learning: with Application to Alzheimer's Disease Prediction

Authors: Baghirova, Narmina, Vũ, Duy-Thanh, Can, Duy-Cat, Diaz, Christelle Schneuwly, Bodlet, Julien, Blanc, Guillaume, Hrusanov, Georgi, Ries, Bernard, Chén, Oliver Y.

Subject Terms: Computer Science - Machine Learning

Access URL: http://arxiv.org/abs/2503.16286

Maximizing Matching Cuts

Authors: Le, Van Bang, Lucke, Felicia, Paulusma, Daniël, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms

Access URL: http://arxiv.org/abs/2312.12960

On Blockers and Transversals of Maximum Independent Sets in Co-Comparability Graphs

Authors: Lucke, Felicia, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2311.07219

Dichotomies for Maximum Matching Cut: $H$-Freeness, Bounded Diameter, Bounded Radius

Authors: Lucke, Felicia, Paulusma, Daniël, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms

Access URL: http://arxiv.org/abs/2304.01099

Matching Cuts in Graphs of High Girth and H-Free Graphs

Authors: Feghali, Carl, Lucke, Felicia, Paulusma, Daniel, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms

Access URL: http://arxiv.org/abs/2212.12317

Finding Matching Cuts in $H$-Free Graphs

Authors: Lucke, Felicia, Paulusma, Daniël, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms

Access URL: http://arxiv.org/abs/2207.07095

Finding $k$-community structures in special graph classes

Authors: Baghirova, Narmina, Dallard, Clément, Ries, Bernard, Schindl, David

Subject Terms: Mathematics - Combinatorics, Computer Science - Discrete Mathematics, 05C85

Access URL: http://arxiv.org/abs/2206.14738

On The Complexity of Matching Cut for Graphs of Bounded Radius and $H$-Free Graphs

Authors: Lucke, Felicia, Paulusma, Daniël, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms

Access URL: http://arxiv.org/abs/2204.07129

Locally checkable problems parameterized by clique-width

Authors: Baghirova, Narmina, Gonzalez, Carolina Lucía, Ries, Bernard, Schindl, David

Subject Terms: Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, 05C69, 05C85, 68Q25, 68R10

Access URL: http://arxiv.org/abs/2203.02992

Finding [formula omitted]-community structures in special graph classes

Authors: Baghirova, Narmina, Dallard, Clément, Ries, Bernard, Schindl, David

Source: In Discrete Applied Mathematics 31 December 2024 359:159-175

Dichotomies for Maximum Matching Cut: H-freeness, bounded diameter, bounded radius

Authors: Lucke, Felicia, Paulusma, Daniël, Ries, Bernard

Source: In Theoretical Computer Science 21 November 2024 1017

On blockers and transversals of maximum independent sets in co-comparability graphs

Authors: Lucke, Felicia, Ries, Bernard

Source: In Discrete Applied Mathematics 30 October 2024 356:307-321

Using edge contractions to reduce the semitotal domination number

Authors: Galby, Esther, Lima, Paloma T., Mann, Felix, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2107.03755

Reducing the domination number of $P_3+kP_2$-free graphs via one edge contraction

Authors: Galby, Esther, Mann, Felix, Ries, Bernard

Subject Terms: Mathematics - Combinatorics, Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2010.14155

Blocking total dominating sets via edge contractions

Authors: Galby, Esther, Mann, Felix, Ries, Bernard

Subject Terms: Computer Science - Discrete Mathematics

Access URL: http://arxiv.org/abs/2009.08806

Using edge contractions to reduce the semitotal domination number

Authors: Galby, Esther, Lima, Paloma T., Mann, Felix, Ries, Bernard

Source: Theoretical computer science. 939:140-160

Availability: http://explore.bl.uk/primo_library/libweb/action/display.do?tabs=detailsTab&gathStatTab=true&ct=display&fn=search&doc=ETOCvdc_100175309985.0x000001&indx=1&recIds=ETOCvdc_100175309985.0x000001

Blocking dominating sets for $H$-free graphs via edge contractions

Authors: Galby, Esther, Lima, Paloma T., Ries, Bernard

Subject Terms: Computer Science - Discrete Mathematics, Computer Science - Computational Complexity, Mathematics - Combinatorics

Access URL: http://arxiv.org/abs/1906.12297

This result is not displayed to guests.
Login for full access.

This result is not displayed to guests.
Login for full access.

Reducing the domination number of graphs via edge contractions

Authors: Galby, Esther, Lima, Paloma T., Ries, Bernard

Subject Terms: Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Mathematics - Combinatorics

Access URL: http://arxiv.org/abs/1903.01800