-
Computing shortest, fastest, and foremost journeys in dynamic networks
New technologies and the deployment of mobile and nomadic services are driving the emergence of complex communications networks, that have a highly dynamic behavior.... -
Feasability, Portability, Predictability and Efficiency : Four Ambitious Goal...
We study the relationship between the design and analysis of graph algorithms in the coarsed grained parallel models and the behavior of the resulting code on todays... -
A Quantitative Theory of Social Cohesion
Community, a notion transversal to all areas of Social Network Analysis, has drawn tremendous amount of attention across the sciences in the past decades. Numerous... -
On treewidth approximations
We introduce a natural heuristic for approximating the treewidth of graphs. We prove that this heuristic gives a constant factor approximation for the treewidth of... -
Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Semin...
International audience -
Linear Time Split Decomposition Revisited
International audience -
A note on domino treewidth
International audience -
Path separability of graphs
International audience -
Computer Mathematics - Proceedings of the Fourth Asian Symposium - ASCM'2000
Ouvrage (éditeur).
