research
∙
02/13/2023
Snapshot disjointness in temporal graphs
In the study of temporal graphs, only paths respecting the flow of time ...
share
research
∙
08/12/2022
Mengerian graphs: characterization and recognition
A temporal graph G is a graph that changes with time. More specifically,...
research
∙
06/30/2022
Menger's Theorem for Temporal Paths (Not Walks)
A temporal graph is a graph whose edges are available only at specific t...
research
∙
02/28/2022
MaxCut on Permutation Graphs is NP-complete
In this paper, we prove that the MaxCut problem is NP-complete on permut...
research
∙
04/29/2021
Revising Johnson's table for the 21st century
What does it mean today to study a problem from a computational point of...
research
∙
04/22/2021
Explicit, time-reversible and symplectic integrator for Hamiltonians in isotropic uniformly curved geometries
The kinetic term of the N-body Hamiltonian system defined on the surface...
research
∙
03/12/2021
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits...
research
∙
12/17/2020
Maximum cut on interval graphs of interval count four is NP-complete
The computational complexity of the MaxCut problem restricted to interva...
research
∙
12/10/2020
Cycle convexity and the tunnel number of links
In this work, we introduce a new graph convexity, that we call Cycle Con...
research
∙
11/30/2020
On the proper orientation number of chordal graphs
An orientation D of a graph G=(V,E) is a digraph obtained from G by repl...
research
∙
05/20/2020
A Unifying Model for Locally Constrained Spanning Tree Problems
Given a graph G and a digraph D whose vertices are the edges of G, we in...
research
∙
04/23/2020
Coloring Problems on Bipartite Graphs of Small Diameter
We investigate a number of coloring problems restricted to bipartite gra...
research
∙
02/28/2020
Edge-Disjoint Branchings in Temporal Graphs
A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...
research
∙
09/04/2019
On Orthogonal Vector Edge Coloring
Given a graph G and a positive integer d, an orthogonal vector d-colorin...
research
∙
08/02/2019
b-continuity and Partial Grundy Coloring of graphs with large girth
A b-coloring of a graph is a proper coloring such that each color class ...
research
∙
07/24/2018
Connected greedy coloring H-free graphs
A connected ordering (v_1, v_2, ..., v_n) of V(G) is an ordering of the ...
research
∙
05/17/2018
Dual parameterization of Weighted Coloring
Given a graph G, a proper k-coloring of G is a partition c = (S_i)_i∈ [1...
research
∙
04/11/2018
