Search
Search Results
-
Surrogate Constraints for Synchronized Energy Production/Consumption
We deal here with job scheduling under encapsulated renewable and non-renewable resource constraints, while relying on a case study related to energy...
-
Neuron Pairs in Binarized Neural Networks Robustness Verification via Integer Linear Programming
In the context of classification, robustness verification of a neural network is the problem which consists in determining if small changes of inputs...
-
Optimal Charging Station Location in a Linear Cycle Path with Deviations
Bicycle tourism is on the rise thanks to assisted-pedaling bikes, also known as e-bikes. While pedalling is still required on these bikes, they allow...
-
On a Geometric Graph-Covering Problem Related to Optimal Safety-Landing-Site Location
We develop a set-cover based integer-programming approach to an optimal safety-landing-site location arising in the design of urban...
-
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...
-
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\)...
-
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...
-
Generalized Weighted Type Graphs for Termination of Graph Transformation Systems
We refine the weighted type graph technique for proving termination of double pushout (DPO) graph transformation systems. We increase the power of...
-
Recent Advancements of Public Edge Platforms
Public edge platforms have drawn increasing attention from both academia and industry. This chapter performs the first measurement study on the...
-
Dynamic Workload Scheduling in Edge Computing
Edge computing has fixed and limited resource capacity, thus low resource scalability is one of the inherent shortages. Nevertheless, on the one...
-
Edge Service Caching
Edge computing, with service caching as a key application, is essential for reducing service response time and alleviating core network traffic...
-
Reconfiguration of Multisets with Applications to Bin Packing
We use the reconfiguration framework to analyze problems that involve the rearrangement of items among groups. In various applications, a group of...
-
Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs
We propose efficient algorithms for enumerating the celebrated combinatorial structures of maximal planar graphs, called canonical orderings and...