Search
Search Results
-
High-Welfare Matching Markets via Descending Price
We consider the design of monetary mechanisms for two-sided matching. Mechanisms in the tradition of the deferred acceptance algorithm, even in...
-
Fair Division with Allocator’s Preference
We consider the problem of fairly allocating indivisible resources to agents, which has been studied for years. Most previous work focuses on...
-
A Robust Two-Stage Model for the Urban Air Mobility Flight Scheduling Problem
Thanks to recent technical progress, it is now possible to consider air mobility for people at the scale of a city. In this work, we focus on a...
-
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...
-
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...
-
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...
-
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\)...
-
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...
-
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....
-
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...
-
Popular Evolutionary Computation Algorithms
This chapter introduces several popular EAs, including the four classical paradigms of GA, GP, EP, and ES and also including the emerging mainstream...
-
Dynamic Optimization
Dynamic optimization problems (DOPs)Dynamic optimization problem have attracted more and more interest in recent years. On the one hand, there are...
-
Multimodal Optimization
This chapter will first introduce the definition of multimodal optimization. Next, most representative evolutionary multimodal optimization...
-
Multi-objective Optimization
In recent decades, evolutionary multi-objective optimization has attracted a growing interest due to the fact that many real-world applications are...
-
A Brief Introduction
In this chapter, we first introduce the background regarding Mobile Crowdsensing (MCS) and present an overview of MCS. Then, we specifically state...
-
Infinite Impulse Response Filter
After reading this chapter, the reader is expected to: