◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Bernard Ries

3 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • middle author1
  • last author2

Across the 3 of 3 papers where every author was matched, so the position is known.

fields
  • math.CO2
  • cs.LG1
ORCID 0000-0003-4395-5547

identity via Semantic Scholar / OpenAlex

activity
20222025
most citedFinding Matching Cuts in H-Free Graphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.LG2025

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

Narmina Baghirova, Duy-Thanh Vũ, Duy-Cat Can +6

Alzheimer's disease (AD) affects 50 million people worldwide and is projected to overwhelm 152 million by 2050. AD is characterized by cognitive decline due partly to disruptions i…

math.CO2023

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

Felicia Lucke, Bernard Ries

In this paper, we consider the following two problems: (i) Deletion Blocker(α) where we are given an undirected graph G=(V,E) and two integers k,d≥1 and ask whether there…

math.CO2022★ 1 cited

Finding Matching Cuts in H-Free Graphs

Felicia Lucke, Daniël Paulusma, Bernard Ries

The NP-complete problem Matching Cut is to decide if a graph has a matching that is also an edge cut of the graph. We prove new complexity results for Matching Cut restricted to $H…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.