
Revising Johnson's table for the 21st century
What does it mean today to study a problem from a computational point of...
read it

Explicit, timereversible and symplectic integrator for Hamiltonians in isotropic uniformly curved geometries
The kinetic term of the Nbody Hamiltonian system defined on the surface...
read it

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs
An Eulerian walk (or Eulerian trail) is a walk (resp. trail) that visits...
read it

Maximum cut on interval graphs of interval count four is NPcomplete
The computational complexity of the MaxCut problem restricted to interva...
read it

Cycle convexity and the tunnel number of links
In this work, we introduce a new graph convexity, that we call Cycle Con...
read it

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...
read it

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...
read it

Coloring Problems on Bipartite Graphs of Small Diameter
We investigate a number of coloring problems restricted to bipartite gra...
read it

EdgeDisjoint Branchings in Temporal Graphs
A temporal digraph G is a triple (G, γ, λ) where G is a digraph, γ is a ...
read it

On Orthogonal Vector Edge Coloring
Given a graph G and a positive integer d, an orthogonal vector dcolorin...
read it

bcontinuity and Partial Grundy Coloring of graphs with large girth
A bcoloring of a graph is a proper coloring such that each color class ...
read it

Connected greedy coloring Hfree graphs
A connected ordering (v_1, v_2, ..., v_n) of V(G) is an ordering of the ...
read it

Dual parameterization of Weighted Coloring
Given a graph G, a proper kcoloring of G is a partition c = (S_i)_i∈ [1...
read it

Weighted proper orientations of trees and graphs of bounded treewidth
Given a simple graph G, a weight function w:E(G)→N∖{0}, and an orientati...
read it
Ana Silva
is this you? claim profile