Seminaires MASCOTTE


Path vs. Cutset Approaches for the Design of Virtual Survivable Topologies
21 February 2013 - Brigitte Jaumard
A crash course in Robust Optimization
12 February 2013 - Arie M.C.A. Koster
Electrical Flows for a faster Approximation of Maximum Flow in Undirected Graphs
05 February 2013 - Fatima zahra Moataz
Extended Cutset Inequalities for the Network Power Consumption Problem
18 December 2012 - Martin Tieves
Robust Metric Inequalities for the Gamma-Robust Network Loading Problem
05 December 2012 - Issam Tahiri
Eulerian and Hamiltonian Dicycles in Directed Hypergraphs
20 November 2012 - Guillaume Ducoffe
Metric dimension for random graphs
06 November 2012 - Dieter Mitsche
Proof of Caccetta Haggkvist conjecture for oriented graphs of independence number 2
16 October 2012 - Nicolas Lichiardopol
Un algorithme FPT simple exponentiel pour le problème Planar-F deletion
13 September 2012 - Christophe Paul
Insertion and Sorting in a Sequence of Numbers Minimizing the Maximum Sum of a Contiguous Subsequence
06 September 2012 - Ricardo Corea, Professeur UFC Fortaleza Bresil
The circumference of the square of a connected graph
01 June 2012 - Stefan Brandt
On the chromatic number of digraphs
22 May 2012 - Ararat Harutyunyan (Simon Fraser University, Vancouver, Canada)
Finding a long directed cycle
10 April 2012 - Ana Karolinna Maia de Oliviera
Cooperative Mobile Robots in a Planar Environment
13 March 2012 - Xavier Defago
'k-Chordal Graph: from Cops and Robber to Compact Routing via Treewidth
06 March 2012 - Bi Li
Graphs and ILP in Python
28 February 2012 - Remigiusz Modrzejewski
Recent results on Maximum Independent Set in P5-free graphs and the Struction Method
21 February 2012 - Grégory Morel
On computing the minimum 3-path vertex cover and dissociation number of graphs
24 January 2012 - Frantisek Kardos
Total unimodularity
17 January 2012 - Frederic Havet
Robust Planning of Green Wireless Networks
13 December 2011 - Grit Classen (University of Aachen)
The Recoverable Robust Knapsack Problem with $Gamma$-Scenarios
13 December 2011 - Manuel Kutschka (University of Aachen)
Dependent Arc and Coloring
30 November 2011 - Li-Da Tong (National Sun Yat Sen University, Taiwan)
Permutation and sorting networks
22 November 2011 - J.-C. Bermond
To Satisfy Impatient Web surfers is Hard
25 October 2011 - Nicolas Nisse
From Pyramids to Virtual Private Network Polyhedra
20 October 2011 - Andras Sebo
Points covered by many simplices
20 October 2011 - Daniel Kral
Perfect matchings in cubic graphs
18 October 2011 - Frantisek Kardos
Risk Models for Prize Collecting Steiner Tree Problem with Interval Data.
11 October 2011 - Bi Li
Scheduling real-time mixed-criticality jobs
04 October 2011 - Gianlorenzo D'Angelo
A survey on directed graph searching and process number relationship
27 September 2011 - Ronan Pardo Soares
Shortest paths and probabilities on time-dependent graphs: applications to transport networks
22 September 2011 - Sébastien Félix
Optimization Models for the Design of AC Power Grids
13 September 2011 - Arie Koster, RWTH Aachen University
On wheel-free graphs
06 September 2011 - Frédéric Havet
Modélisation et méthodes de résolution des casse-tête.
19 July 2011 - Sébastien Félix
Small Worlds
12 July 2011 - Nicolas Nisse
On the hull number of some graph classes.
05 July 2011 - Julio Araujo
Algorithmic Game Theory, Computational Aspects of Nash Equilibria and Congestion Games
28 June 2011 - Michele Flammini
Weighted Improper Colouring
14 June 2011 - Julio Araujo
Minimum Chromaticity of Circulant Graphs
31 May 2011 - Joseph Peters, Simon Fraser University, Canada
Advanced Sage -- Developper's side Cython and patches
19 May 2011 - Nathann Cohen
Energy saving in fixed wireless broadband networks.
17 May 2011 - Issam Tahiri
Basics of Python/Sage
28 April 2011 - Nathann Cohen
Community detection in large multiplex graphs
19 April 2011 - Felipe Menezes
Protrusions in graphs and their applications
12 April 2011 - Fedor Fomin
Outils algorithmiques de détection de communautés dans les grands graphes
22 March 2011 - Mikaila Tokoworou
Locating a target with an agent guided by unreliable local advice
15 March 2011 - Nicolas Nisse
Finding an (induced) subdivision of a digraph
22 February 2011 - F. Havet
Minimizing Routing Energy Consumption: from Theoretical to Practical Results
11 January 2011 - Joanna Moulierac
Difficulté d'instance et instances difficiles
04 January 2011 - Valentin Weber, G-SCOP, Grenoble
Conception and Evaluation for P2P Video Streaming
20 December 2010 - Yaning Liu
Building a Perfect Terrorist Organization
07 December 2010 - Victor Campos (Univ. Fed. do Ceara, Brazil)
Induced decompositions of graphs
02 December 2010 - Jean-Claude Bermond
Weighted Coloring
23 November 2010 - Julio Araujo
On Utilizing Speed in Networks of Mobile Agents
18 November 2010 - Janna Burman
Adding a referee to an interconnection network: what can(not) be computed in one round?
02 November 2010 - Nicolas Nisse
Polynomial-time FPT algorithms
14 October 2010 - Jan Arne Telle (Univ. of Bergen, Norway)
b-coloring tight graphs
05 October 2010 - Leonardo Sampaio
The alpha-arboricity of complete uniform hypergraphs.
28 September 2010 - Jean-Claude Bermond
Nombre Grundy et produit de graphes.
21 September 2010 - Frédéric Havet
Colouring triangle-free graphs
29 June 2010 - Frederic Havet
Quantum-inspired Evolutionary Algorithms for Optimization
15 June 2010 - C. Patvardhan (Dayalbagh Educational Institute Agra, INDIA)
Bandwidth Allocation for Reliable Fixed Broadband Wireless Networks
08 June 2010 - Napoleao Nepomuceno
Minizing data management cost.
03 June 2010 - Inza BAMBA
Two problems on (di)graphs
01 June 2010 - Joergen Bang-Jensen
On the (k-improper) Grundy number of a graph.
11 May 2010 - Leonardo Sampaio
Tradeoffs in Digraph Process Strategy Game
20 April 2010 - Dorian Mazauric
Complex networks: measures, deterministic models, implementation
16 March 2010 - Philippe Giabbanelli
Computing Treewidth by Integer Linear Programming
04 March 2010 - Arie Koster
Coping with Liars in Searching Procedures
04 March 2010 - Ugo Vaccaro
Coloration des graphes presque planaires
16 February 2010 - Frédéric Havet
Présentation des outils de simulation OSA et OSIF
09 February 2010 - Judicaël Ribault
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs
02 February 2010 - Karol Suchan
Speeding-up wireless network simulations for asymmetrical communications
26 January 2010 - Juan-Carlos Maureira
Grundy number on P4-classes
19 January 2010 - Julio Araujo
Cop and robber games when the robber can hide and ride
12 January 2010 - Nicolas Nisse
Energy and Networks
11 December 2009 - Dan Kilper
The spanning galaxy problem
08 December 2009 - Frederic Havet
Structure des grands réseaux d'interaction et dynamique de graphe
24 November 2009 - Christophe Crespelle
Optimization and Non-Cooperative Issues in Communication Networks
17 November 2009 - Gianpiero Monaco
Towards networked computers: What can be learned from distributed computing ?
14 October 2009 - David Peleg
Disjoint directed and undirected paths, cycles and trees in directed graphs
06 October 2009 - Joergen Bang-Jensen
The Recognition of Tolerance and Bounded Tolerance Graphs is NP-complete
29 September 2009 - George B. Mertzios
SAGEMath for Mascotte
28 July 2009 - Nathann Cohen
Edge-partitioning regular graphs (with traffic grooming as an excuse)
02 July 2009 - Ignasi Sau
Introduction to the probabilistic method
30 June 2009 - Frédéric Havet
Obstructions for Minor Ideals: a case study
23 June 2009 - Dimitrios M. Thilikos
Joint Optimization of Routing and Radio Configuration
11 June 2009 - Napoleao NEPOMUCENO
Acyclic edge coloring
31 March 2009 - Nathann Cohen
Directed acyclic graphs with the unique dipath property
19 March 2009 - Jean-Claude Bermond
Gestion du Stockage Distribué de Fichiers Evolutifs dans les Réseaux Ad Hoc Tolérants les Délais
26 February 2009 - Philippe Nain
Reconfiguration of the Routing in WDM Networks with Two Classes of Services
19 February 2009 - Dorian Mazauric
Algorithmes exacts pour le L(2,1)-labelling.
12 February 2009 - Frédéric Havet
Hilbert bases and RHS for flow problems
18 December 2008 - Alexandre Laugier
Generation of Realistic 802.11 Interferences in the Omnet++ INET Framework Based on Real Traffic Measurements
11 December 2008 - Juan-Carlos Maureira/Diego Dujovne
Ant-Colony Optimization Routing in Position-aware Mobile Ad-Hoc Networks
04 December 2008 - Jaroslav Opatrny
Approximation and On-line Algorithms in Optical Networks
10 November 2008 - Shmuel Zaks
Distributed graph searching
09 October 2008 - Nicolas Nisse
Efficient algorithms in interval graphs
07 October 2008 - George B. Mertzios
Families of graphs defined by their 3-connected components: universal behavior, enumeration and limit laws
18 June 2008 - Juanjo Rué Perna
Spiderman handover and 802.11 network provisioning on railways environments
10 June 2008 - Juan-Carlos Maureira
Corral: Block level versioning device for Linux
20 May 2008 - Julian Monteiro
Maximum Degree-Bounded Connected Subgraph: Hardness and Approximation
29 April 2008 - Ignasi Sau Valls
Réduction de graphe pour la multicoloration propre
23 April 2008 - Jean-Christophe Godin
Continuous Gathering Problem in Cycles
15 April 2008 - Patricio Reyes
Génération de Colonnes pour le Routage et l'Ordonnancement dans les Réseaux Radio Maillés
01 April 2008 - Christelle Molle
The Expected Clustering Coefficient of the Mori Graph
25 March 2008 - Nicole Eggemann
Coloration faciale
18 March 2008 - Frédéric Havet
Mobile Ad hoc Networks: Modelling, Simulation and Broadcast Based Applications
12 March 2008 - Luc Hogie
Contribution à la planification des réseaux optiques
07 February 2008 - N. Puech
Label Space Reduction in GMPLS Networks
23 January 2008 - Fernando Solano Donado