-
Network Analysis of the French Environmental Code
International audience -
The Network of French Legal Codes
International audience -
Three years of graphs and music : some results in graph theory and its applic...
This thesis consists in successive glimpses of different problems in discrete mathematics related to graph theory. Its mains focus is on graph colouring, i.e. on... -
Portfolio Symmetry and Momentum
International audience -
Discrete mode observability of switching linear systems with unknown inputs. ...
International audience -
Communication sequence selection to preserve reachability/observability in ne...
International audience -
Sparse Spanners vs. Compact Routing
International audience -
A SPATIO-TEMPORAL GRAPH-BASED MODEL FOR THE EVOLUTION OF GEOGRAPHICAL ENTITIES
Space and time are fundamental concepts needed for the analysis of the evolution of spatio-temporal entities. In order to model these evolutions, the changes and... -
Complex transportation networks: resilience, modelling and optimization
In this study, we have performed a comprehensive analysis of public transport networks(PTN) combining tools of complex network theory, computer modelling, and... -
Algebraic theory for discrete event systems
Algebraic theory for discrete event systems -
Radio k-Labelings for Cartesian Products of Graphs
International audience -
Linear and cyclic radio k-labelings of trees
International audience -
Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to T...
International audience -
2D-orthogonal packing and scheduling problems: modelling by graph theory and ...
The two dimensional orthogonal packing problem consists in deciding whether there exists a packing of rectangular items in a given bin. This is a hard combinatorial... -
Twelve-dimensional Pauli group contextuality
expanded version -
Sensor location for discrete mode observability of switching linear systems w...
International audience -
Handsome Non-Commutative Proof-Nets: perfect matchings, series-parallel order...
This paper provides a definition of proof-nets for non-commutative linear logic (cyclic linear logic and Lambek calculus) where there are no links, that are small... -
Airy Phenomena and Analytic Combinatorics of Connected Graphs
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal...
