-
On the Cartesian product of an arbitrarily partitionable graph and a traceabl...
International audience -
Combinatorial mapping-tori, branched surfaces and free group automorphisms
International audience -
Is it possible to find the maximum clique in general graphs?
Finding the maximum clique is a known NP-Complete problem and it is also hard to approximate. This work proposes two efficient algorithms to obtain it. Nevertheless,... -
On Randomness in Hash Functions
International audience -
About Casting 2D-Bin Packing into Network Flow Theory
In this paper, we aim at making appear the way Flow and Multicommodity Flow Theory may be used in order to deal with combinatorial geometry problems like the 2D-Bin... -
Gaussian stationary processes over graphs, general frame and maximum likeliho...
In this paper, using spectral theory of Hilbertian operators, we study ARMA Gaussian processes indexed by graphs. We extend Whittle maximum likelihood estimation of... -
Homeomorphic Alignment of Weighted Trees
International audience -
Object Enumeration
15 pages -
Strasbourg Master Class on Geometry
International audience -
Mascopt - A Network Optimization Library: Graph Manipulation
This report introduces a JAVA library whose objective is to provide tools for solving some network optimization problems and that may be used to write prototype... -
Path Search Algorithm for Connections with Pumps in Crude Oil Pipe Networks
International audience -
Orthogonal Decomposition of Graphs
International audience -
Decomposing Graphs with Symmetries
International audience -
SYMMETRIZATION: RANKING AND CLUSTERING IN PROTEIN INTERFACES
International audience -
Non-preemptive scheduling algorithms and schedulability conditions for real-t...
First we justify our concern in latency constraints for real-time systems with precedence constraints. We evoke the model based on graph theory used to state and solve... -
Nonlocal PdEs on graphs for active contours models with applications to image...
International audience -
Fronts propagation and normalized p-laplacien on graphs : Algorithms and appl...
This work deals with the transcription of continuous partial derivative equations to arbitrary discrete domains by exploiting the formalism of partial difference... -
Types of online networking on professional social network sites : case study ...
Our study had been carried on members of a social network hosted on the professional social network site, LinkedIn. It produced two main outcomes. The first is a... -
KISSPLICE: de-novo calling alternative splicing events from RNA-seq data
International audience -
A new lower bound on the independence number of graphs
International audience
