Search
Search Results
-
A Bigraphs Paper of Sorts
Bigraphs are an expressive graphical modelling formalism to represent systems with a mix of both spatial and non-local connectivity. Currently it is...
-
VizChat: Enhancing Learning Analytics Dashboards with Contextualised Explanations Using Multimodal Generative AI Chatbots
Learning analytics dashboards (LADs) serve as pivotal tools in transforming complex learner data into actionable insights for educational...
-
Logical Modelling, Some Recent Methodological Advances Illustrated
Logical modelling is a popular mathematical framework for assessing the behaviour of regulatory and signalling networks. Despite its qualitative...
-
Roots in the Semiring of Finite Deterministic Dynamical Systems
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and...
-
Insights Gained After a Decade of Cellular Automata-Based Cryptography
Cellular Automata (CA) have been extensively used to implement symmetric cryptographic primitives, such as pseudorandom number generators and...
-
Dividing Permutations in the Semiring of Functional Digraphs
Functional digraphs are unlabelled finite digraphs where each vertex has exactly one out-neighbor. They are isomorphic classes of finite...
-
Minimizing Distances Between Vertices and Edges Through Tree t-Spanners
A tree t-spanner of a graph G is a spanning tree T of G in which any two adjacent vertices of G have distance at most t in T. We say that G is...
-
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
In this paper, we consider the problems of enumerating minimal vertex covers and minimal dominating sets with capacity and/or connectivity...
-
Resolving Unresolved Resolved and Unresolved Triplets Consistency Problems
The \(\mathcal {R}^{+-} \mathcal {F}^{+-}\) Consistency...
-
Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
A set of vertices in a graph forms a potential maximal clique if there exists a minimal chordal completion in which it is a maximal clique. Potential...
-
Resolving Sets in Temporal Graphs
A resolving set R in a graph G is a set of vertices such that every vertex of G is uniquely identified by its distances to the vertices of R....
-
Approximate Cycle Double Cover
The Cycle double cover (CDC) conjecture states that for every bridgeless graph G, there exists a family...
-
Parameterized Complexity of Paired Domination
The Paired Domination problem is one of the well-studied variants of the classical Dominating Set problem. In a graph G on n vertices, a dominating...
-
An Improved Bound for Equitable Proper Labellings
For every graph G with size m and no connected component isomorphic to \(K_2\)...
-
On the Design and Performance Evaluation of Android Based Alarming Applications
The aim of this paper is to investigate and discuss issues on the design and performance evaluation of Android applications concerning alarming...
-
SocialEcho: A Social Networking Platform with Community Guidelines Violation Pre-check
Social media has revolutionized the way people communicate, but it also comes with risks such as the proliferation of misinformation and...
-
Pre-planning for Plastic Surgery Using Machine Learning: A Proof of Concept
This paper presents a proof-of-concept study on AI-based pre-surgery planning in plastic surgery. The study addresses the challenge of technique...
-
DocBot: A System for Disease Detection and Specialized Doctor Recommendation Using Patient’s Speech of Symptoms
Nowadays, Machine Learning (ML) plays a crucial role in improving healthcare by enabling researchers, doctors, and patients to explore, diagnose, and...
-
A Graph Transformation-Based Engine for the Automated Exploration of Constraint Models
In this demonstration, we present an engine leveraging graph transformations for the automated reformulation of constraint specifications of...
-
To Read or Not to Read: Predicting Student Engagement in Interactive Reading
In this study, upper-elementary-age students used an interactive reading app to read from a classic children’s novel during a summer program....