Technical Reports Published in 2025

  • IC-25-04 pdf bib
    The State of the Art connecting Socioenactive systems with Artificial Intelligence and the Emotional Contagion Phenomenon.
    Maria Cecília Calani Baranauskas Geovanna Evelyn Espinoza Taype and Julio Cesar dos Reis.
    August 2025. In English, 23 pages.

    Abstract: The Socioenactive approach is a new field of study exploring novel dimensions of the design and development of computational systems. Socioenactive systems are computational systems that consider the human brain, body, and the environment surrounding it in the design of interactions. This promising research area brings new perspectives to the Human-Computer Interaction field, studying phenomena that occur in humans' brains, bodies, and their environments, considering cognition, sensorimotor processes, perception, and emotions. In socio-emotional interactions, the emotion contagion phenomenon emerges through bodily expressions, in particular, through neurophysiological expressions. Artificial Intelligence (AI) is being used to analyze emotions from human neurophysiological data. This study conducts a literature review concerning socienactive systems associated with AI and the Emotional Contagion Phenomenon. Considering the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analyses) protocol, we guided our search for relevant studies. We identified studies from four different search libraries. We conducted a screening process based on the titles and abstracts of these investigations. After applying the exclusion criteria, we filtered and selected several studies. We analyzed the selected studies based on their main keywords and related concepts. We analyzed these studies considering their relevance for future studies.

  • IC-25-03 pdf bib
    Extending unlocked matchings in graphs.
    A. A. Pereira and C. N. Campos.
    October 2025. In English, 09 pages.

    Abstract: Let $M$ be a matching of a graph $G$ and let $S(M)$ and $U(M)$ be the sets of $M$-saturated and $M$-unsaturated vertices of $G$, respectively. A vertex $v \in U(M)$ is unlocked if there exists a vertex $u \in N(v) \cap U(M)$. The matching $M$ is unlocked if every vertex in $U(M)$ is unlocked. We say that a graph $G$ is $k$-fully-extendable if every unlocked matching $M$ in $G$ of size $k$ can be extended to a perfect matching of $G$. In this work, we study $k$-fully-extendable graphs of order $2n$, characterizing the cases $k = n-1$ and $k = n-2$. For the case $k = n-2$, we provide additional necessary conditions, based on degree bounds, as well as sufficient conditions, based on classes of graphs.

  • IC-25-02 pdf bib
    Matching extendability in cartesian product of hypercubes and paths.
    A. A. Pereira and C. N. Campos.
    October 2025. In English, 08 pages.

    Abstract: A matching $M$ in a graph $G$ is said to be extendable to a perfect matching if there exists a perfect matching $M^*$ of $G$ such that $M \subseteq M^*$. In this work, we study the extendability of matchings under a neighbourhood condition: no unsaturated vertex has all of its neighbours $M$-saturated. Vandenbussche and West showed that, in the hypercube $Q_n$, any matching of size at most $2n - 4$ is extendable to a perfect matching if and only if it satisfies this condition. We extend their result to the cartesian product $Q_n \ \square \ P_m$, by proving that every matching of size at most $2n - 2$ is extendable to a perfect matching if and only if it does not saturate the neighbourhood of any unsaturated vertex. Furthermore, we demonstrate that this bound is tight by constructing a matching of size $2n + 2\delta(H) - 3$ in $Q_n \ \square \ H$ that satisfies the neighbourhood condition but is not extendable to a perfect matching.

  • IC-25-01 pdf bib
    The domination and independent domination numbers of Goldberg Graphs.
    A. A. Pereira and C. N. Campos.
    October 2025. In English, 13 pages.

    Abstract: A dominating set of a graph $G$ is a subset $S \subseteq V(G)$ such that every vertex in $V(G)$ either belongs to $S$ or is adjacent to some vertex in $S$. The domination number $\gamma(G)$ is the minimum cardinality of a dominating set of $G$. An independent dominating set of $G$ is a dominating set that is also independent and $i(G)$ is the cardinality of minimum independent dominating set of $G$. The computational complexity of these problems has led to extensive research focused on establishing bounds or exact values for these parameters in for graph families, especially cubic graphs. Additionally, determining the gap between these two parameters is a challenging problem. In this work, we introduce a family of cubic graphs, called Goldberg Graphs $G_l$, which generalizes the well-known Goldberg Snarks and show that, for these graphs, $\gamma(G_l) = i(G_l) = \left\lceil \frac{11l}{5} \right\rceil$.

    • Instituto de Computação :: Universidade Estadual de Campinas
    Av. Albert Einstein, 1251 - Cidade Universitária Zeferino Vaz • 13083-852 Campinas, SP - Brasil • Fone: [19] 3521-5838