researcher

R. Fabila-Monroy

41 papers hereh-index 14646 citations88 works total

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

author position

sole author1
first author16
middle author22
last author1

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

fields

math.CO20
cs.CG17
cs.DM2
math.MG2

same name

R. Fabila-Monroy — 11 papers, h 6
R. Fabila-Monroy — 1 paper, h 1

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity

20092026

most citedToken Graphs

65 citations · 165 across the 33 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

Domination number of Token Graphs

Ruy Fabila-Monroy, Sergio Gerardo Gómez-Galicia

The $k$ -token graph of $G$ is the graph, $F_{k} (G)$ , whose vertices are all the $k$ -subsets of $V (G)$ ; with two of them adjacent whenever their symmetric difference is a pair of adja…

cs.CG2025

The Euclidean $k$ -Matching Problem is NP-hard

José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López +3

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Domination number of Token Graphs

The Euclidean k-Matching Problem is NP-hard

The Euclidean $k$ -Matching Problem is NP-hard