%
%
%
% automatically generated
% % ./bibtex2html mascotte-all-coauthors.cfg bruce-before-2003.bib bruce-03-05.bib luigi-03-05.bib luigi-before-2003.bib before-1997.bib sloop1997.bib sloop1998.bib sloop1999.bib mascotte2000.bib mascotte2001.bib mascotte2002.bib mascotte2003.bib mascotte2004.bib mascotte2005.bib mascotte2006.bib mascotte2007.bib mascotte2008.bib mascotte2009.bib mascotte2010.bib mascotte2011.bib mascotte2012.bib mascotte2013.bib mascotteToAppear.bib nisse-before-2008.bib giroire-before-2008.bib
% Date: Thu Oct 10 14:10:03 2013
% Author: dcoudert
%
%
%
@BOOK{CoSi10,
PUBLISHER = {Old City Publishing},
TITLE = {Ad Hoc & Sensor Wireless Networks, an International
Journal -- Special issue on Ad hoc, Mobile and Wireless Networks},
YEAR = {2010},
ALTAUTHOR = {},
EDITOR = {D. Coudert and D. Simplot-Ryl},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
OPTSERIES = {},
VOLUME = {9},
URL = {http://www.oldcitypublishing.com/AHSWN/AHSWN.html}
}
@BOOK{DaWa10,
PUBLISHER = {Sage},
TITLE = {SIMULATION: Transactions of the Society of Modeling and
Simulation International. Special Issue on Software Tools, Techniques
and Architectures for Computer Simulation},
YEAR = {2010},
ALTAUTHOR = {},
EDITOR = {O. Dalle and G. Wainer},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
VOLUME = {86}
}
@PROCEEDINGS{jdir10,
TITLE = {11es Journées Doctorales en Informatique et Réseaux
(JDIR 2010)},
YEAR = {2010},
ADDRESS = {Sophia Antipolis, France},
EDITOR = {F. Giroire and D. Mazauric},
MONTH = {March},
OPTNOTE = {},
NUMBER = {11},
ORGANIZATION = {Mascotte, INRIA, I3S(CNRS / Univ. of Nice-Sophia)},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/JDIR2010/}
}
@BOOK{Dal09,
PUBLISHER = {Springer Netherlands},
TITLE = {Mobile Networks and Applications (MONET) : Special Issue
on Development Tools and Techniques for Mobile Telecommunications},
YEAR = {2009},
ALTAUTHOR = {},
EDITOR = {O. Dalle and J. R. Heath and G. A. Wayne},
OPTADDRESS = {},
OPTEDITION = {},
MONTH = {December},
NOTE = {Online publication},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://springerlink.com/content/t51p44g148q080w5/?p=c735ba186ace4beea3b22eb5ac5a0744&pi=14}
}
@PROCEEDINGS{DPSW09,
TITLE = {2nd International Conference on Simulation Tools and
Techniques (SIMUTools 2009)},
YEAR = {2009},
ADDRESS = {Rome, Italy},
EDITOR = {O. Dalle and L.-F. Perrone and G. Stea and G. A. Wainer},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@PROCEEDINGS{adhocamc08,
TITLE = {1st International Workshop on Ad-hoc Ambient Computing
(AdhocAmC)},
YEAR = {2008},
ADDRESS = {Sophia Antipolis, France},
EDITOR = {D. Coudert and V. Issarny and N. Georgantas},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {I3S, CNRS, Université de Nice Sophia, INRIA},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/ADHOCAMC08}
}
@PROCEEDINGS{phdnow08,
TITLE = {PhD workshop (PhD-NOW)},
YEAR = {2008},
ADDRESS = {Sophia Antipolis, France},
EDITOR = {D. Coudert and S. Krco and K. Wrona},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {I3S, CNRS, Université de Nice Sophia, INRIA},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/PHDNOW08}
}
@PROCEEDINGS{CSS08,
TITLE = {7th International Conference on AD-HOC Networks &
Wireless (AdHoc-NOW)},
YEAR = {2008},
OPTADDRESS = {},
EDITOR = {D. Coudert and D. Simplot-Ryl and I. Stojmenovic},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5198},
URL = {http://dx.doi.org/10.1007/978-3-540-85209-4}
}
@PROCEEDINGS{DaWa08,
TITLE = {1st International Conference on Simulation and
Techniques for Communications, Networks and Systems (SIMU Tools 2008)},
YEAR = {2008},
ADDRESS = {Marseille, France},
EDITOR = {O. Dalle and G.A. Wainer},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@PROCEEDINGS{algotel07,
TITLE = {Neuvièmes Rencontres Francophones sur les Aspects
Algorithmiques des Télécommunications (AlgoTel'07)},
YEAR = {2007},
ADDRESS = {Ile d'Oléron, France},
EDITOR = {G. Chelius and D. Coudert},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {CNRS, LaBRI, Université Bordeaux I},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {9},
PAGES = {136p},
URL = {http://hal.inria.fr/ALGOTEL2007}
}
@BOOK{Dic06,
PUBLISHER = {Prof. Tuncer Ören},
TITLE = {Modeling and Simulation Dictionary:
English-French-Turkish},
YEAR = {2006},
AUTHOR = {T. Ören and L. Torres and F. Amblard and J.-P. Belaud and
J. Caussanel and O. Dalle and R. Duboz and A. Ferrarini and
C. Frydman and E.-A. M. Hamri and D. Hill and A. Naamane and P. Siron and
E. Tranvouez and G. Zacharewicz},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
PAGES = {298p}
}
@BOOK{HKP+05,
PUBLISHER = {Springer-Verlag},
TITLE = {Dissemination of Information in Communication Networks:
Broadcasting, Gossiping, Leader Election, and Fault-Tolerance},
YEAR = {2005},
AUTHOR = {J. Hromkovic and R. Klasing and A. Pelc and P. Ruzicka and
W. Unger},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Springer Monograph},
OPTVOLUME = {}
}
@BOOK{MR1952980,
PUBLISHER = {Springer-Verlag},
TITLE = {Recent advances in algorithms and combinatorics},
YEAR = {2003},
ALTAUTHOR = {},
EDITOR = {B. Reed and C. Linhares-Sales},
ADDRESS = {New York},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, 11},
OPTVOLUME = {},
PAGES = {xiv+351}
}
@BOOK{AlFe02,
PUBLISHER = {Springer-Verlag},
TITLE = {Proceedings of STACS 2002},
YEAR = {2002},
ALTAUTHOR = {},
EDITOR = {H. Alt and A. Ferreira},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2285}
}
@BOOK{MR1869439,
PUBLISHER = {Springer-Verlag},
TITLE = {Graph colouring and the probabilistic method},
YEAR = {2002},
AUTHOR = {M. Molloy and B. Reed},
ALTEDITOR = {},
ADDRESS = {Berlin},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Algorithms and Combinatorics},
VOLUME = {23},
PAGES = {xiv+326}
}
@PROCEEDINGS{DFR02,
TITLE = {Cinquième Ecole d'Hiver des Télécommunications},
YEAR = {2002},
ADDRESS = {Golfe Juan, France},
EDITOR = {O. Dalle and S. Frénot and M. Riveill},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {INRIA - CNRS - Univ. de Nice},
PUBLISHER = {INRIA},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{FeKr01,
PUBLISHER = {ACM/Baltzer},
TITLE = {Mobile Networks & Applications (MONET) -- Special Issue
on Discrete Algorithms and Methods for Mobile Computing and
Communications},
YEAR = {2001},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and D. Krob},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{FeRe01,
PUBLISHER = {Springer-Verlag},
TITLE = {Proceedings of STACS 2001},
YEAR = {2001},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and H. Reichel},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2010},
KEY = {b-edition}
}
@BOOK{MR1858793,
PUBLISHER = {John Wiley & Sons Ltd.},
TITLE = {Perfect graphs},
YEAR = {2001},
ALTAUTHOR = {},
EDITOR = {Ramìrez Alfonsìn, J. L. and B. Reed},
ADDRESS = {Chichester},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Wiley-Interscience Series in Discrete Mathematics and Optimization},
OPTVOLUME = {},
PAGES = {xxii+362}
}
@BOOK{FeKi00,
PUBLISHER = {Elsevier Science B. V.},
TITLE = {Parallel Computing -- Special Issue on High Performance
Computing in Operations Research},
YEAR = {2000},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and G. Kindervater},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
OPTSERIES = {},
VOLUME = {26}
}
@BOOK{AFG99,
PUBLISHER = {Interéditions},
TITLE = {Les réseaux satellitaires de télécommunications},
YEAR = {1999},
AUTHOR = {E. Altman and A. Ferreira and J. Galtier},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{BeFe98,
PUBLISHER = {Kluwer Academic Publisher},
TITLE = {Optical Interconnects and Parallel Processing: Trends at
the Interface},
YEAR = {1998},
ALTAUTHOR = {},
EDITOR = {P. Berthomé and A. Ferreira},
ADDRESS = {Boston (USA)},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {b-edition}
}
@BOOK{FeRo98,
PUBLISHER = {Academic Press},
TITLE = {Journal of Parallel and Distributed Computing -- Special
Issue on Irregular Problems},
YEAR = {1998},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and J. Rolim},
OPTADDRESS = {},
OPTEDITION = {},
MONTH = {April},
OPTNOTE = {},
NUMBER = {1/2},
OPTSERIES = {},
VOLUME = {50},
KEY = {e-editor}
}
@BOOK{FRST98,
PUBLISHER = {Springer-Verlag},
TITLE = {Solving Irregularly Structured Problems in Parallel --
Irregular'98},
YEAR = {1998},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and J. Rolim and H. Simon and S. Teng},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1457},
KEY = {b-edition}
}
@BOOK{MR1678554,
PUBLISHER = {Springer-Verlag},
TITLE = {Probabilistic methods for algorithmic discrete
mathematics},
YEAR = {1998},
ALTAUTHOR = {},
EDITOR = {M. Habib and C. McDiarmid and J. Ramirez-Alfonsin and
B. Reed},
ADDRESS = {Berlin},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Algorithms and Combinatorics},
VOLUME = {16},
PAGES = {xviii+323}
}
@BOOK{BFLR97,
PUBLISHER = {Springer-Verlag},
TITLE = {Parallel Algorithms for Solving Irregularly Structured
Problems -- Irregular'97},
YEAR = {1997},
ALTAUTHOR = {},
EDITOR = {G. Bilardi and A. Ferreira and R. Lüling and J. Rolim},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1253},
KEY = {b-edition}
}
@BOOK{FePa96,
PUBLISHER = {Springer-Verlag},
TITLE = {Solving Combinatorial Optimization Problems in Parallel:
Methods and Techniques},
YEAR = {1996},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and P. Pardalos},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {LNCS State-of-the-Art Surveys},
VOLUME = {1054},
KEY = {b-edition}
}
@BOOK{FeRo96,
PUBLISHER = {North-Holland},
TITLE = {Theoretical Computer Science -- Special Issue on
Irregularly Structured Problems},
YEAR = {1996},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and J. Rolim},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {e-editor}
}
@BOOK{FRST96,
PUBLISHER = {Springer-Verlag},
TITLE = {Parallel Algorithms for Solving Irregularly Structured
Problems -- Irregular'96},
YEAR = {1996},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and J. Rolim and Y. Saad and T. Yang},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1117},
KEY = {b-edition}
}
@BOOK{AGF+95,
PUBLISHER = {Hermes},
TITLE = {Algorithmique parallèle et applications irrégulières},
YEAR = {1995},
ALTAUTHOR = {},
EDITOR = {G. Authié and Jean-Marie Garcia and A. Ferreira and
J.L. Roch and G. Villard and J. Roman and C. Roucairol and B. Virot},
ADDRESS = {Paris (F)},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {b-edition}
}
@BOOK{FeRo94,
PUBLISHER = {Kluwer Academic Publisher},
TITLE = {Parallel Algorithms for Irregular Problems: State of the
Art},
YEAR = {1995},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and J. Rolim},
ADDRESS = {Boston (USA)},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {b-edition}
}
@BOOK{FeRo95,
PUBLISHER = {Springer-Verlag},
TITLE = {Parallel Algorithms for Solving Irregularly Structured
Problems -- Irregular'95},
YEAR = {1995},
ALTAUTHOR = {},
EDITOR = {A. Ferreira and J. Rolim},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {980},
KEY = {b-edition}
}
@BOOK{AFFS94,
PUBLISHER = {World Publisher Co.},
TITLE = {Parallel Processing Letters -- Special Issue on
Algorithmic and Structural Aspects of Interconnection Networks},
YEAR = {1994},
ALTAUTHOR = {},
EDITOR = {S. Akl and A. Ferreira and P. Fraigniaud and D. Sotteau},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {e-editor}
}
@BOOK{AFR+94,
PUBLISHER = {Hermes},
TITLE = {Algorithmes parallèles -- analyse et conception},
YEAR = {1994},
ALTAUTHOR = {},
EDITOR = {G. Authié and A. Ferreira and J.L. Roch and G. Villard and
J. Roman and C. Roucairol and B. Virot},
ADDRESS = {Paris (F)},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {b-edition}
}
@BOOK{CFP94,
PUBLISHER = {Springer-Verlag},
TITLE = {Parallel and Distributed Computing -- Theory and
Practice},
YEAR = {1994},
ALTAUTHOR = {},
EDITOR = {M. Cosnard and A. Ferreira and J. Peters},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {805},
KEY = {b-edition}
}
@BOOK{Rum94,
PUBLISHER = {Masson},
TITLE = {Communications dans les réseaux de processeurs},
YEAR = {1994},
AUTHOR = {Jean de RUMEUR},
ALTEDITOR = {},
ADDRESS = {Paris},
OPTEDITION = {},
OPTMONTH = {},
NOTE = {(including J.-C. Bermond, E. Darrot ,D. Lafaye de Micheaux and M. Syska)},
OPTNUMBER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@BOOK{Ber92,
PUBLISHER = {Discrete Applied Mathematics},
TITLE = {Interconnection Networks},
YEAR = {1992},
AUTHOR = {J.-C. Bermond, editor},
ALTEDITOR = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
NOTE = {(also appeared in Topics in Discrete Mathematics, Vol 5,1992, North Holland) 582 pp},
OPTNUMBER = {},
OPTSERIES = {},
VOLUME = {37,38},
PAGES = {582 pages}
}
@PHDTHESIS{Ara12,
AUTHOR = {J. Araujo},
SCHOOL = {University of Nice-Sophia Antipolis and Federal University of Ceará},
TITLE = {Graph Coloring and Graph Convexity},
YEAR = {2012},
OPTADDRESS = {},
MONTH = {September},
OPTNOTE = {},
OPTTYPE = {},
PDF = {http://tel.archives-ouvertes.fr/tel-00732919},
ABSTRACT = {In this thesis, we study several problems of Graph
Theory concerning Graph Coloring and Graph Convexity.
Most of the
results contained here are related to the computational complexity of
these problems for particular graph classes.
In the first and main
part of this thesis, we deal with Graph Coloring which is one of the
most studied areas of Graph Theory.
We first consider three graph
coloring problems called Greedy Coloring, Weighted Coloring and
Weighted Improper Coloring.
Then, we deal with a decision problem,
called Good Edge-Labeling, whose definition was motivated by the
Wavelength Assignment problem in optical networks.
The second part
of this thesis is devoted to a graph optimization parameter called
(geodetic) hull number.
The definition of this parameter is
motivated by an extension to graphs of the notions of convex sets and
convex hulls in the Euclidean space.
Finally, we present in the
appendix other works developed during this thesis, one about Eulerian
and Hamiltonian directed hypergraphs and the other concerning
distributed storage systems.}
}
@PHDTHESIS{Sam12,
AUTHOR = {L. Sampaio},
SCHOOL = {University of Nice-Sophia Antipolis},
TITLE = {Algorithmic aspects of graph colouring heuristics},
YEAR = {2012},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {},
PDF = {http://tel.archives-ouvertes.fr/tel-00759408},
ABSTRACT = {A proper colouring of a graph is a function that assigns
a
colour to each vertex with the restriction that adjacent
vertices
are assigned with distinct colours.
Proper colourings are a natural
model for many problems, like
scheduling, frequency assignment and
register
allocation.
The problem of finding a proper colouring of a
graph with the minimum
number of colours is a well-known NP-hard
problem.
In this thesis we study the Grundy number and the
b-chromatic number
of graphs, two parameters that evaluate
some
heuristics for finding proper colourings.
We start by giving the
state of the art of the results about these parameters.
Then, we
show that the problem of determining the Grundy number of
bipartite
or chordal graphs is NP-hard, but it
is solvable in polynomial time
for P5-free bipartite graphs.
After, we show that the problem of
determining the b-chromatic number
of a chordal distance-hereditary
graph is
NP-hard, and we give polynomial-time algorithms for some
subclasses of
block graphs, complement of bipartite
graphs and
P4-sparse graphs.
We also consider the fixed-parameter tractability
of determining the
Grundy number and the b-chromatic number,
and in
particular we show that deciding if the Grundy number (or the
b-chromatic number) of a graph G is at least
|V(G)| - k admits an
FPT algorithm when k is the parameter.
Finally, we consider the
computational complexity of many problems
related to comparing the
b-chromatic number
and the Grundy number with various other related
parameters of a graph.}
}
@PHDTHESIS{Wor12,
AUTHOR = {B. M. T. Worou},
SCHOOL = {University of Nice-Sophia Antipolis},
TITLE = {Outils Algorithmiques pour la Détection des Communautés
dans les Réseaux},
YEAR = {2012},
OPTADDRESS = {},
MONTH = {December},
OPTNOTE = {},
OPTTYPE = {},
ABSTRACT = {This thesis concerns the algorithmic aspects of the
communities' detection in large graphs.
The work can be used by a
telecommunications operator whose graphs are associated to telephone
calls and SMS or telecommunication networks.
In this context, the
detection of communities is used for the content recommendation, the
analysis of customer data, the classification of Web pages, the
detection of Web spamming, marketing activities and others.
This
thesis is organized around two major parts.
In the first part, we
introduce the field of detection of communities.
Indeed this
problem has been studied with different points of view during the
last years.
The main methods and applications are presented in this
descriptive part.
In the second part, we present our contribution
to the problem.
Our contribution consists of two main topics.
First, we introduce a new quality function, the fractional arboricity
which is more adapted to the problem of detecting communities in
social networks.
Then, we present a fast and performance guaranteed
algorithm to approximate the optimal fractional arboricity and
identifies the communities in question.
Second, we study the
detection of communities by optimizing the modularity, the most used
quality function for communities' detection.
We rewrite this
function, and then, find new interpretations of the modularity and
also links between the modularity and others cut functions.
Finally, we propose two heuristics to approximate the optimization of
the modularity.
The first is an algorithm that approximates the
modularity by using the Fiedler vector of the Laplacian matrix of the
graph.
The second algorithm is a fast heuristic based on the
representation of physical interaction of nodes in a metric space.
With this representation, we define an attraction/ repulsion
mechanism between the vertices and then we obtain clusters in
communities.
Finally, we combine the optimization of the fractional
arboricity and the optimization of the modularity into one
communities' detection tool.}
}
@PHDTHESIS{Coh11,
AUTHOR = {N. Cohen},
SCHOOL = {Ecole doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Some results in graph theory and its applications},
YEAR = {2011},
OPTADDRESS = {},
MONTH = {October},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://tel.archives-ouvertes.fr/tel-00645151/fr/},
ABSTRACT = {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 assignments of
integer values to
the vertices (or edges) of a graph satisfying a
set of local
constraints, most of the time the exclusion of specific
patterns in
the coloured graph. For several different types of
colouring (vertex
and edge choosability, acyclic or linear
colouring, ...) a state of
the art is provided, along with results
ensuring the existence of such
colourings on planar graphs or
subclasses of them -- with the aim of
minimising the number of
colours used for a given Maximum Degree, or
Maximum Average Degree.
This thesis also deals with decompositions of
graphs into induced
subgraphs, and asserts that similarly to what
Wilson's theorem
implies for non-induced graph decomposition, there
exists for any
graph $H$ an infinite sequence of dense graph whose
edge set can be
partitioned in induced copies of $H$. The proof
methodology involves
hypergraphs, for which a decomposition result is
presented, i.e.
that the complete 3-uniform hypergraph can be
partitioned into
$\lceil \frac {n(n-1)} 6\rceil$ $\alpha$-acyclic
hypergraphs as
conjectured. In a third part are gathered algorithmic
questions.
Those are problems of optimisation or existence motivated
by
telecommunications in networks, studied with the classical
framework
of computational complexity, or the search of subgraphs
through
parametrised complexity. In a fourth part it, considers
counting
problems belonging to the study of chemical graphs, and
finally
details some Integer LinearPrograms used in the Mathematics
software
Sage.}
}
@PHDTHESIS{Mau11,
AUTHOR = {Maureira Bravo, J-C},
SCHOOL = {Ecole doctorale STIC, Université de Nice Sophia-Antipolis},
TITLE = {Internet on Rails},
YEAR = {2011},
OPTADDRESS = {},
MONTH = {January},
OPTNOTE = {},
TYPE = {THESE},
KEYWORDS = {Train communications, WiFi, horizontal handover,
layer 2 routes update, infrastructure network,
combined chordal topologies, simulations.},
URL = {http://hal.inria.fr/tel-00594951/en},
PDF = {http://tel.archives-ouvertes.fr/docs/00/59/49/51/PDF/thesis-JcM-final.pdf},
ABSTRACT = {This thesis proposes a new method for providing network
connectivity to vehicles over a predefined trajectory (trains,
metros, urban buses, etc.). The communication between the vehicle and
the infrastructure network is based only on WiFi technology. The
contributions of this work are two-fold: 1) the horizontal handover
(between WiFi access points) and 2) the design and analysis of an
infrastructure network (backbone network plus WiFi access network)
deployed along the trajectory of the vehicle. In the first
contribution, we propose a handover scheme, called Spiderman
Handover, which describes the horizontal handover for an in-motion
network (on-board the vehicle) considering a procedure to update the
routing information of a bridged infrastructure network (OSI layer
2). We evaluate our proposal by means of simulation and we validate
our results by experimental measurements. In the second contribution,
we study theoretically the parameters of several chordal like
topologies in order to build a
backbone network for a linear access
network. By comparing these parameters, we propose a backbone network
composed by a combination of two chordal topologies. This backbone
network provides a good balance between their deployment cost, number
of hops to the gateway of the network and a reasonable resilience.
Finally, we evaluate the integration of this infrastructure network
and the handover scheme by means of simulations. Results showed that
the proposed handover scheme works properly on the proposed
infrastructure network, allowing the provision of a continuous
network connectivity to passengers on-board trains, metros or urban
buses.}
}
@PHDTHESIS{Maz11,
AUTHOR = {D. Mazauric},
SCHOOL = {Ecole doctorale STIC, Université de Nice Sophia-Antipolis},
TITLE = {Optimisation discrète dans les réseaux de
télécommunication: reconfiguration du routage, routage efficace en
énergie, ordonnancement de liens et placement de données},
YEAR = {2011},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://tel.archives-ouvertes.fr/tel-00643513/fr/},
PDF = {http://tel.archives-ouvertes.fr/docs/00/64/35/13/PDF/These-Dorian-Mazauric.pdf},
ABSTRACT = {Nous nous intÃ©ressons dans cette thÃ¨se Ã diffÃ©rents
types de rÃ©seaux
(optiques, sans-fil, pair-Ã -pair) ayant chacun
leurs spÃ©cificitÃ©s mais
partageant des problÃ©matiques communes :
assurer la meilleure qualitÃ© de
services possible, garantir la
stabilitÃ© du systÃ¨me, minimiser les
ressources et donc le coÃ»t
de fonctionnement. Tout d'abord, nous
Ã©tudions le problÃ¨me de la
reconfiguration du routage dans les rÃ©seaux
optiques consistant Ã
rerouter les requÃªtes de connexion en minimisant
les perturbations
pour les utilisateurs. Puis, nous nous intÃ©ressons au
problÃ¨me de
la dÃ©termination de routages efficaces en Ã©nergie dans les
rÃ©seaux coeur. Pour ce faire, nous Ã©tudions le problÃ¨me de trouver
des
routages minimisant le nombre d'Ã©quipements utilisÃ©s.
Ensuite, nous nous
intÃ©ressons aux algorithmes d'ordonnancement des
liens dans les rÃ©seaux
sans-fil en prÃ©sence d'interfÃ©rence.
Enfin, nous considÃ©rons le
problÃ¨me de stockage de donnÃ©es dans
les rÃ©seaux pair-Ã -pair. Nous
Ã©tudions l'impact de diffÃ©rentes
politiques de placement sur la durÃ©e de
vie des donnÃ©es et nous
dÃ©terminons un choix de placement optimal. Pour
rÃ©soudre ces
problÃ¨mes, nous utilisons les outils thÃ©oriques des
mathÃ©matiques discrÃ¨tes (graphes, configurations, optimisation
combinatoire), d'algorithmique (complexitÃ©, algorithmique
distribuÃ©e) et
de probabilitÃ©s.}
}
@PHDTHESIS{Rib11,
AUTHOR = {J. Ribault},
SCHOOL = {Ecole doctorale STIC, Université de Nice Sophia-Antipolis},
TITLE = {Reuse and Scalability in Modeling and Simulation
Software Engineering},
YEAR = {2011},
OPTADDRESS = {},
MONTH = {January},
OPTNOTE = {},
TYPE = {THESE},
KEYWORDS = {simulation, évènements discrets, aspects,
séparation des préoccupations, instrumentation, modélisation,
composant, simulation distribuée, réutilisation},
URL = {http://tel.archives-ouvertes.fr/tel-00604014/en/},
PDF = {http://tel.archives-ouvertes.fr/tel-00604014/PDF/ThesisJudicaelRibaultV4.pdf},
ABSTRACT = {L'{\'e}tude d'un syst{\`e}me {\`a} l'aide de simulations
informatiques {\`a} {\'e}v{\'e}nements discrets implique plusieurs
activit{\'e}s: sp{\'e}ci cation du mod{\`e}le conceptuel, description
de l'architecture logicielle du mod{\`e}le, d{\'e}veloppement des
logiciels, sc{\'e}narisation de la simulation, instrumentation, plani
cation d'exp{\'e}rimentation, con guration des ressources de calcul,
ex{\'e}cution, post-traitement et analyse, validation et de v{\'e}ri
cation (V\&V). De nombreux {\'e}l{\'e}ments logiciels sont requis
pour remplir toutes ces activit{\'e}s. Toutefois, il est fr{\'e}quent
de cr{\'e}er un nouveau simulateur {\`a} partir de rien quand on
commence une {\'e}tude {\`a} l'aide de simulation. Dans ce cas il est
n{\'e}cessaire de d{\'e}velopper de multiples outils prenant en
charge les activit{\'e}s de la simulation. Cette th{\`e}se aborde le
d{\'e} de la cr{\'e}ation de nouveaux simulateurs tout en
r{\'e}utilisant des mod{\`e}les et des outils provenant d'autres
simulateurs. En
e et, la r{\'e}utilisation de logiciel augmente la
abilit{\'e}, est moins sujette aux erreurs, permet une meilleure
utilisation des expertises compl{\'e}mentaires, am{\'e}liore la
conformit{\'e} aux normes, et acc{\'e}l{\`e}re le d{\'e}veloppement.
La r{\'e}utilisation de logiciels peut {\^e}tre appliqu{\'e}e {\`a}
toutes les activit{\'e}s de la simulation. Plusieurs probl{\`e}mes
doivent {\^e}tre r{\'e}solus pour tirer pleinement pro t de la
r{\'e}utilisation. Dans cette th{\`e}se, nous abordons trois
questions principales: Tout d'abord, nous {\'e}tudions les solutions
pratiques de r{\'e}utilisation permettant de combiner un ensemble
choisi d'{\'e}l{\'e}ments logiciels utiles pour la mod{\'e}lisation
et la simulation, en incluant aussi bien les mod{\`e}les, les moteurs
de simulation, les algorithmes et les outils; Deuxi{\`e}mement, nous
nous concentrons sur les questions li{\'e}es {\`a} l'instrumentation;
Troisi{\`e}mement, nous {\'e}tudions le probl{\`e}me de
l'int{\'e}gration d'{\'e}l{\'e}ments logiciels
provenant d'autres
simulateurs dans un nouveau simulateur. Pour atteindre ces objectifs,
nous {\'e}tudions des techniques avanc{\'e}es de du g{\'e}nie
logiciel, tels que le g{\'e}nie logiciel {\`a} base de composants
(CBSE) et la programmation orient{\'e}e aspect, sur lesquels nous
construisons une solution originale pour la mod{\'e}lisation et la
simulation {\`a} l'aide de multiples couches r{\'e}utilisables. Nous
avons d{\'e}velopp{\'e} un prototype d'architecture logicielle qui
prouve la faisabilit{\'e} de cette solution.}
}
@PHDTHESIS{Cou10,
AUTHOR = {D. Coudert},
SCHOOL = {Université de Nice Sophia-Antipolis (UNS)},
TITLE = {Algorithmique et optimisation dans les réseaux de
télécommunications},
YEAR = {2010},
OPTADDRESS = {},
MONTH = {March},
OPTNOTE = {},
TYPE = {Habilitation à Diriger des Recherches},
URL = {http://www-sop.inria.fr/members/David.Coudert/hdr/},
PDF = {http://www-sop.inria.fr/members/David.Coudert/hdr/HDR-Coudert.pdf}
}
@PHDTHESIS{Mon10,
AUTHOR = {Julian Monteiro},
SCHOOL = {Ecole doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Modeling and Analysis of Reliable Peer-to-Peer Storage
Systems},
YEAR = {2010},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://tel.archives-ouvertes.fr/tel-00545724/},
ABSTRACT = {Large scale peer-to-peer systems are foreseen as a way
to provide highly reliable data storage at low cost. To ensure high
durability and high resilience over a long period of time the system
must add redundancy to the original data. It is well-known that
erasure coding is a space efficient solution to obtain a high degree
of fault-tolerance by distributing encoded fragments into different
peers of the network. Therefore, a repair mechanism needs to cope
with the dynamic and unreliable behavior of peers by continuously
reconstructing the missing redundancy. Consequently, the system
depends on many parameters that need to be well tuned, such as the
redundancy factor, the placement policies, and the frequency of data
repair. These parameters impact the amount of resources, such as the
bandwidth usage and the storage space overhead that are required to
achieve a desired level of reliability, i.e., probability of losing
data. This thesis aims at providing tools to analyze and predict the
performance of general large scale data storage systems. We use these
tools to analyze the impact of different choices of system design on
different performance metrics. For instance, the bandwidth
consumption, the storage space overhead, and the probability of data
loss should be as small as possible. Different techniques are studied
and applied. First, we describe a simple Markov chain model that
harnesses the dynamics of a storage system under the effects of peer
failures and of data repair. Then we provide closed-form formulas
that give good approximations of the model. These formulas allow us
to understand the interactions between the system parameters. Indeed,
a lazy repair mechanism is studied and we describe how to tune the
system parameters to obtain an efficient utilization of bandwidth. We
confirm by comparing to simulations that this model gives correct
approximations of the system average behavior, but does not capture
its variations over time. We then propose a new stochastic model
based on a fluid approximation that indeed captures the deviations
around the mean behavior. These variations are most of the time
neglected by previous works, despite being very important to
correctly allocate the system resources. We additionally study
several other aspects of a distributed storage system: we propose
queuing models to calculate the repair time distribution under
limited bandwidth scenarios; we discuss the trade-offs of a Hybrid
coding (mixing erasure codes and replication); and finally we study
the impact of different ways to distribute data fragments among
peers, i.e., placement strategies.}
}
@PHDTHESIS{Nepo10,
AUTHOR = {N. Nepomuceno},
SCHOOL = {Ecole doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Network optimization for wireless microwave backhaul},
YEAR = {2010},
OPTADDRESS = {},
MONTH = {December},
OPTNOTE = {},
OPTTYPE = {},
KEYWORDS = {Wireless communications, Mathematical programming,
Network optimization, Multicommodity flows,
Microwave backhaul networks},
URL = {http://tel.archives-ouvertes.fr/tel-00593412/fr/},
PDF = {http://tel.archives-ouvertes.fr/docs/00/59/34/12/PDF/thesis.pdf},
ABSTRACT = {Technological breakthroughs have transformed the
telecommunications industry aiming at providing capacity and
efficiency to support the increasing demand for wireless broadband
services. With the advances in access technologies, the capacity
bottleneck of cellular networks is gradually moving from the radio
interface towards the backhaul -- the portion of the network
infrastructure that provides interconnectivity between the access and
core networks. The ability for microwave to be rapidly and
cost-effectively deployed is being a crucial point for successfully
tackling the backhaul bottleneck problem. However, backhaul solutions
available with this technology have received little attention from
the scientific community. Nevertheless, the growth of microwave
backhaul networks and their increasing complexity give rise to many
interesting optimization problems. In fact, unlike wired networks,
the capacity of a microwave radio link is prone to variations, either
due to external factors (e.g., weather) or by the action of the
network operator. This fundamental difference raises a variety of new
issues to be addressed appropriately. Therefore, more refined
approaches for dealing with network optimization in wireless
microwave backhaul need to be conceived. In this thesis, we
investigate network optimization problems related to the design and
configuration of wireless microwave backhaul. We are concerned with a
general class of problems expressed in terms of minimum cost
multicommodity flows with discontinuous step increasing cost
functions on the links of the network. These problems are among the
most important and challenging problems in network optimization.
Generally, they are computationally very difficult and, in practice,
can only be solved approximately. We introduce mathematical models
for some of these problems and present solution approaches
essentially based on general mixed integer programming,
chance-constrained programming, relaxation techniques, cutting plane
methods, as well as hybrid metaheuristics. This work was done in
collaboration with the SME~3Roam, and partially developed within the
scope of the joint project RAISOM (R\'eseaux de collecte IP sans fil
optimis\'es), among INRIA Sophia}
}
@PHDTHESIS{Per10,
AUTHOR = {S. Pérennes},
SCHOOL = {Université de Nice Sophia-Antipolis (UNS)},
TITLE = {Contribution à l'algorithmique des réseaux de
télécommunications},
YEAR = {2010},
OPTADDRESS = {},
MONTH = {March},
OPTNOTE = {},
TYPE = {Habilitation à Diriger des Recherches},
URL = {http://www-sop.inria.fr/members/Stephane.Perennes/}
}
@PHDTHESIS{Gom09,
AUTHOR = {C. Gomes},
SCHOOL = {Université de Nice-Sophia Antipolis (UNS)},
TITLE = {Radio Mesh Networks and the Round Weighting Problem},
YEAR = {2009},
OPTADDRESS = {},
MONTH = {December 1st},
OPTNOTE = {},
OPTTYPE = {},
KEYWORDS = {Radio Mesh Networks, Multi-objective Optimization,
Bandwidth allocation problem, Flow problem, Coloring Problem,
Fairness, Column Generation method, Convex Problems},
URL = {http://tel.archives-ouvertes.fr/tel-00449856},
PDF = {http://tel.archives-ouvertes.fr/docs/00/44/98/56/PDF/theseCGomes.pdf},
ABSTRACT = {In this thesis, we address the joint routing and slot
assignment problem between the routers and the gateways in radio mesh
access networks. We model the problem as a Round Weighting Problem
(RWP) in which the objective is to minimize the overall period of
slot activations providing enough capacity to satisfy the bandwidth
requirements of the routers. Solving the full problem means
generating an exponential set of simultaneous transmission rounds
which is intractable even for small networks. To cope with this
issue, we implement a mathematical multi-objective model to solve the
problem using a column generation method. We observe that the
bottleneck is usually located in a limited region around a gateway.
We propose a method to obtain lower bounds (considering only a
limited probable bottleneck region) and upper bounds for general
graphs. Our methods are applied to grid graphs providing closed
formulae for the case of uniform demands, and also optimal routing
strategies considering non-uniform demands. Motivated by the results
of the existence of a limited (bottleneck) region capable of
representing the whole network, we consider a variant of the RWP
dealing also with bandwidth allocation, but considering SINR
conditions in a CDMA network. We give sufficient conditions for the
whole network to be reduced to a single-hop around the gateway. It is
due to the fact that the problem is convex under some conditions that
are often met. }
}
@PHDTHESIS{Mol09,
AUTHOR = {C. Molle},
SCHOOL = {Ecole doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Optimisation de la capacité des réseaux radio maillés},
YEAR = {2009},
OPTADDRESS = {},
MONTH = {October},
OPTNOTE = {},
OPTTYPE = {},
KEYWORDS = {Optimisation, programmation linéaire,
réseaux radio maillés, capacité, génération de colonnes},
URL = {http://tel.archives-ouvertes.fr/tel-00428940/fr/},
PDF = {http://tel.archives-ouvertes.fr/docs/00/42/89/40/PDF/CMthese.pdf},
ABSTRACT = {Dans cette th\`ese, nous nous int\'eressons aux
probl\'ematiques d'optimisation de la capacit\'e des r\'eseaux radio
maill\'es. Cette architecture de r\'eseau d'acc\`es est
particuli\`erement pertinente en milieu urbain ou en situation
op\'erationnelle militaire. Nous d\'efinissons la capacit\'e d'un
r\'eseau comme la quantit\'e de flot que peut r\'epartir
\'equitablement une topologie aux utilisateurs qu'elle sert. Afin
d'obtenir des bornes th\'eoriques sur les performances du r\'eseau,
nous d\'eveloppons des mod\`eles d'optimisation int\'egrant les
caract\'eristiques inter-couche des communications radio. Nous
\'etudions plus pr\'ecis\'ement le probl\`eme joint du routage et de
l'ordonnancement. Nous d\'eveloppons, pour la relaxation lin\'eaire
de ce probl\`eme, une m\'ethode de r\'esolution efficace utilisant la
g\'en\'eration de colonnes. Nous d\'erivons ensuite une formulation
qui \'elimine le routage pour se concentrer sur la capacit\'e de
transport disponible sur les coupes du r\'eseau. L'\ 'equivalence des
solutions optimales est d\'emontr\'ee, et le processus de
r\'esolution est adapt\'e en une g\'en\'eration crois\'ee de lignes
et de colonnes. Ces \'etudes mettent en \'evidence la pr\'esence
d'une zone de contention autour de chaque point d'acc\`es qui
contraint la capacit\'e du r\'eseau. Ces r\'esultats permettent une
\'etude quantitative des effets du trafic d'acquittement sur la
capacit\'e. Nous pr\'esentons enfin une \'etude de la stabilit\'e
d'un protocole routant du trafic inject\'e de mani\`ere arbitraire au
cours du temps. Nous am\'eliorons les r\'esultats existants en
d\'emontrant la stabilit\'e quand le trafic inject\'e est un flot
maximum. L'ensemble de ces travaux a \'et\'e impl\'ement\'e dans la
biblioth\`eque open source MASCOPT (Mascotte Optimisation) d\'edi\'ee
aux probl\`emes d'optimisation des r\'eseaux.}
}
@PHDTHESIS{Mon09,
AUTHOR = {G. Monaco},
SCHOOL = {University of l'Aquila},
TITLE = {Optimization and Non-Cooperative Issues in Communication
Networks},
YEAR = {2009},
OPTADDRESS = {},
MONTH = {October},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://www.gianpieromonaco.com},
PDF = {http://www.gianpieromonaco.com/Thesis%20Gianpiero_Monaco.pdf},
ABSTRACT = {Communication networks and more in general distributed
systems are undergoing rapid advancements. The last few years have
experienced a steep growth in research on different related aspects.
However, although the great promise for our future communication
capabilities, several challenges need still to be addressed. A
crucial ingredient for the successful development end employment of
the corresponding arising technologies is the design of networks
better suited for the management of large bandwidth and high quality
services, as required by the emerging tasks, such as on-demand-video,
multimedia and data integrated networks, seamless and ubiquitous
access to system resources in mobile environments, secure on-demand
data, and so forth. In this thesis we focus on the analysis of the
performance and complexity of distributed systems such as optical
networks (representing the main contribution of the thesis) and
wireless networks. More specifically, we consider classical
combinatorial optimization problems arising in communication networks
from two different perspectives. In the first part we consider the
design of classical centralized polynomial time (approximation or
exact) algorithms. Such an investigation is conducted under a
traditional computational complexity setting in which time
constraints must be taking into account for tractability and
efficiency matters. The above perspective implicitly or explicitly
assumes that the resources of the system are directly accessible and
controllable by a centralized authority, but this assumption in
highly distributed systems might be too strong or unrealistic.
Therefore, in the second part of the thesis we consider communication
problems arising in networks with autonomous or non-cooperative
users. In such a scenario users pursue an own often selfish strategy
and the system evolves as a consequence of the interactions among
them. The interesting arising scenario is thus characterized by the
conflicting needs of the users aiming to maximize their personal
profit and of the system wishing to compute a socially efficient
solution. Algorithmic Game theory is considered the most powerful
tool dealing with such non-cooperative environments in which the lack
of coordination yields inefficiencies. In such a scenario we consider
the pure Nash equilibrium as the outcome of the game and in turn as
the concept capturing the notion of stable solution of the system.
Under the above perspectives, the thesis makes different progresses
on the understanding of a variety of problems in communication
networks. Our results include: polynomial time algorithms,
NP-complete results, approximation algorithms and inapproximability
results; analysis of performances, convergence and existence of Nash
equilibria in selfish scenarios.}
}
@PHDTHESIS{Per09,
AUTHOR = {Perez Seva, J.-P.},
SCHOOL = {Ecole doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Les optimisations d'algorithmes de traitement du signal
sur les architectures modernes parallèles et embarquées},
YEAR = {2009},
OPTADDRESS = {},
MONTH = {August},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Rey09,
AUTHOR = {P. Reyes},
SCHOOL = {Ecole doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Data Gathering in Radio Networks},
YEAR = {2009},
OPTADDRESS = {},
MONTH = {August},
OPTNOTE = {},
OPTTYPE = {},
KEYWORDS = {combinatorial optimization, algorithms, graph coloring,
data gathering, wireless networks, sensor networks},
URL = {http://tel.archives-ouvertes.fr/tel-00418297/en/},
ABSTRACT = {This thesis concerns the study of the algorithmic and
the complexity of the communications in radio networks. In
particular, we were interested in the problem of gathering
information from the nodes of a radio network in a central node. This
problem is motivated by a question of France Telecom (Orange Labs):
How to bring Internet in villages. Nodes represent the houses of the
villages which communicate between them by radio, the goal being to
reach a gateway connected to Internet by a satellite link. The same
problem can be found in sensor networks where the question is to
collect data from sensors to a base station. A peculiarity of radio
networks is that the transmission distance is limited and that the
transmissions interfere between them (interference phenomena). We
model these constraints by saying that two nodes (radio devices) can
communicate if they are at distance at most dT and a node interferes
with another one if their distance is at most dI. The distances are
considered in a graph representing the network. Thus, a communication
step will consist in a compatible (non interfering) set of
transmissions. Our goal is to find the minimum number of steps needed
to achieve such a gathering and design algorithms achieving this
minimum. For special topologies such as the path and the grid, we
have proposed optimal or near optimal solutions. We also considered
the systolic (or continuous) case where we want to maximize the
throughput (bandwidth) offered to each node.}
}
@PHDTHESIS{Sau09,
AUTHOR = {I. Sau},
SCHOOL = {Université de Nice-Sophia Antipolis (UNS) and Universitat Politècnica de Catalunya (UPC)},
TITLE = {Optimization in Graphs under Degree Constraints.
Application to Telecommunication Networks},
YEAR = {2009},
OPTADDRESS = {},
MONTH = {October},
OPTNOTE = {},
OPTTYPE = {},
KEYWORDS = {Graph theory, traffic grooming, optical networks,
graph partitioning, computational complexity,
approximation algorithms, parameterized complexity, branchwidth,
dynamic programming, graphs on surfaces},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/PhD_Ignasi.pdf},
ABSTRACT = {The first part of this thesis is devoted to traffic
grooming, which is a central problem in optical networks. It refers
to packing low-rate signals into higher-speed streams, in order to
improve bandwidth utilization and reduce the network cost. The
objective is to minimize the number of Add-Drop Multiplexers (ADMs),
which are devices that insert/extract low-rate traffic to/from a
high-speed stream. In graph-theoretical terms, the problem can be
translated into finding a partition of the edges of a request graph
into subgraphs with bounded number of edges, the objective being to
minimize the total number of vertices of the partition. We first
focus in Chapter~1 on a general request graph when the topology is a
ring or a path. We provide the first inapproximability result for
traffic grooming for fixed values of the \emph{grooming factor} $C$,
answering affirmatively to a conjecture in the literature. We also
provide a polynomial-time approximation algorithm for traffic
grooming in rings and paths, with an approximation ratio independent
of C. We introduce in Chapter~2 a new model of traffic grooming in
unidirectional rings, in order to design networks being able to
support \emph{any} request graph with bounded maximum degree. We show
that the problem is essentially equivalent to finding the least
integer $M(C,\Delta)$ such that the edges of any graph with maximum
degree at most $\Delta$ can be partitioned into subgraphs with at
most $C$ edges and each vertex appears in at most $M(C,\Delta)$
subgraphs, and we establish the value of $M(C,\Delta)$ for almost all
values of $C$ and $\Delta$. In Chapter~3 we focus on traffic grooming
in bidirectional rings with symmetric shortest path routing and
all-to-all unitary requests, providing general lower bounds and
infinite families of optimal solutions for $C=1,2,3$ and $C$ of the
form $k(k+1)/2$. In Chapter~4 we study traffic grooming for
two-period optical networks, a variation of the traffic grooming
problem for WDM unidirectional ring networks with two grooming
factors $C$ and $C'$ that allows some dynamism on the traffic. Using
tools of graph decompositions, we determine the minimum number of
ADMs for $C=4$, and $C'=1,2,3$. The study of the traffic grooming
problem leads naturally to the study of a family of graph-theoretical
problems dealing with general constraints on the degree. This is the
topic of the second part of this thesis. We begin in Chapter~5 by
studying the computational complexity of several families of
degree-constrained problems, giving hardness results and
polynomial-time approximation algorithms. We then study in Chapter~6
the parameterized complexity of finding degree-constrained subgraphs,
when the parameter is the size of the subgraphs. We prove hardness
results in general graphs and provide explicit fixed-parameter
tractable algorithms for minor-free graphs. We obtain in Chapter~7
subexponential parameterized and exact algorithms for several
families of degree-constrained subgraph problems on planar graphs,
using bidimensionality theory combined with novel dynamic programming
techniques. Finally, we provide in Chapter~8 a framework for the
design of dynamic programming algorithms for surface-embedded graphs
with single exponential dependence on branchwidth. Our approach is
based on a new type of branch decomposition called \emph{surface cut
decomposition}, which generalizes sphere cut decompositions for
planar graphs. The existence of such algorithms is proved using
diverse techniques from topological graph theory and analytic
combinatorics.}
}
@PHDTHESIS{Gal08a,
AUTHOR = {J. Galtier},
SCHOOL = {Université de Nice-Sophia Antipolis},
TITLE = {L'adaptativité dans les télécommunications},
YEAR = {2008},
OPTADDRESS = {},
MONTH = {February},
OPTNOTE = {},
TYPE = {Habilitation à Diriger des Recherches}
}
@PHDTHESIS{Huc08,
AUTHOR = {F. Huc},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Conception de Réseaux Dynamiques Tolérants aux Pannes},
YEAR = {2008},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {},
PDF = {http://www-sop.inria.fr/sloop/personnel/Florian.Huc/Publications/TheseComplete.pdf},
ABSTRACT = {Cette thÃ¨se aborde diffÃ©rents aspects de la conception
d'un rÃ©seau de tÃ©lÃ©communications. Un tel rÃ©seau utilise des
technologies hÃ©tÃ©rogÃ¨nes: liens antennes-satellites, radio, fibres
optiques ou bien encore rÃ©seaux embarquÃ©s dans un satellite. Les
problÃ©matiques varient en fonction de la partie du rÃ©seau
considÃ©rÃ©e, du type de requÃªtes et de l'objectif. Le cas des
requÃªtes de type paquets est abordÃ© dans le cadre des rÃ©seaux en
forme de grille, mais le thÃ¨me principal est le routage de requÃªtes
de type connections (unicast et multicast). Les objectifs
considÃ©rÃ©s sont : la conception d'un rÃ©seau embarquÃ© dans un
satellite de tÃ©lÃ©communication, de taille minimum et tolÃ©rant des
pannes de composants; le dimensionnement des liens d'un rÃ©seau afin
qu'il supporte des pannes corrÃ©lÃ©es ou qu'il offre une bonne
qualitÃ© de service, ou s'il autorise des connections multicast; le
dimensionnement de la taille des buffers d'un rÃ©seau d'accÃ©s radio;
et l'optimisation de l'utilisation des ressources d'un rÃ©seau
dynamique orientÃ© connections. Dans tous ces cas la problÃ©matique
du routage de connections est centrale. Mon approche consiste Ã
utiliser la complÃ©mentaritÃ© de techniques algorithmique et
d'optimisation combinatoire ainsi que d'outils issus de la thÃ©orie
des graphes tels la pathwidth et des notions reliÃ©es -process
number, jeux de captures et treewidth-, diffÃ©rents types de
coloration -impropre et pondÃ©rÃ©e, proportionnelle, directed star
colouring-, les graphes d'expansion et des techniques de partitions
telle la quasi partition.}
}
@PHDTHESIS{Ami07,
AUTHOR = {O. Amini},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Algorithmique des décompositions de graphes Applications
aux réseaux de télécommunications},
YEAR = {2007},
OPTADDRESS = {},
MONTH = {November 28},
OPTNOTE = {},
OPTTYPE = {},
ABSTRACT = {La th\`ese comprend trois parties relativement
ind\'ependantes. Le th\`eme central reliant ces parties est la
d\'ecomposition de graphes: la premi\`ere partie traite de la
d\'ecomposition arborescente; la deuxi\`eme, plus appliqu\'ee, se
fonde sur les applications des d\'ecompositions d'ar\^etes ou de
noeuds aux r\'eseaux de t\'el\'ecommunications, et la derni\`ere,
plus th\'eorique, concerne la coloration de graphes. Les chapitres de
la premi\`ere partie \'etudient la d\'ecomposition arborescente de
graphes et ses applications Ã la conception d'algorithmes dits
param\'etr\'es. La partie II regroupe des travaux sur les probl\`emes
issus des r\'eseaux de t\'el\'ecommunications. Deux types de
r\'eseaux sont \'etudi\'es: les r\'eseaux embarqu\'es dans les
satellites et les r\'eseaux optiques WDM. La troisi\`eme partie, plus
probabiliste, est essentiellement bas\'ee sur la coloration de
graphes et l'existence des cycles orient\'es dans les digraphes.}
}
@PHDTHESIS{Hav07,
AUTHOR = {F. Havet},
SCHOOL = {Université de Nice-Sophia Antipolis},
TITLE = {Graph colouring and applications},
YEAR = {2007},
OPTADDRESS = {},
MONTH = {December 12},
OPTNOTE = {},
TYPE = {Habilitation à Diriger des Recherches},
URL = {http://www-sop.inria.fr/mascotte/personnel/Frederic.Havet/habilitation/}
}
@PHDTHESIS{Hog07,
AUTHOR = {L. Hogie},
SCHOOL = {University of Le Havre, University of Luxembourg},
TITLE = {Mobile Ad Hoc Networks: Modelling, Simulation and
Broadcast-based Applications},
YEAR = {2007},
OPTADDRESS = {},
MONTH = {April},
OPTNOTE = {},
OPTTYPE = {},
ABSTRACT = {Over the last few years, personal communication devices
have invaded most developed countries and today, the majority of the
population owns a mobile phone and most of them use personal digital
assistants, mobile computers, etc. This tendency is reinforced and
occurs at the same time with a new trend: most of these devices get
equipped with one or several wireless networking interfaces.
Practically, Wi-Fi or/ and Bluetooth-enabled devices become of
frequent use. More than allowing the connection to some access point
(as they can be found in airport, train stations, city-centers,
restaurants, etc), these interfaces permit also to interconnect
directly with one another in a decentralized way and to hence
self-organize into ad hoc networks. A mobile ad hoc network (MANET)
is a set of mobile nodes able to communicate with other nodes in
their surroundings. These wireless communications happen in a
peer-topeer manner, without relying on any predefined infrastructure.
Today, MANETs are mainly used for sensing, gaming and military
purposes. But the steadily wider adoption of wireless technologies in
daily life let one foresee the next generation of MANETs
applications: environmental and medical monitoring, groupware,
customer-to-customer applications, risk management, entertainment,
advertising, etc. In order to enable the development and spreading of
these applications, a number of issues have to be solved. First, in
such network, end-to-end connectivity cannot be guaranteed. Indeed
MANETs may be partitioned and nodes may be sporadically present in
the network. As such, MANETs can be considered as Delay Tolerant
Networks (DTN). Second, the topology of the network changes over time
because of the mobility of the stations. Then, the way the
communication primitives were implemented in the context of wired
networks is no longer applicable. It is hence necessary to propose
new algorithms to enable those primitives, like broadcasting that
serves as a basic pattern for the design of many MANETs applications.
The design and implementation of such communication schemes, and more
generally of MANETs application, can be achieved using two different
ways: either by building a real network, or by resorting to modelling
and simulation. In the context of this work, where city-scale
environment were considered, simulation was hence unavoidable. The
development of such a simulator took place at the crossroad of some
projects in relation to complex system modelling, optimization and
middleware design for MANETs, and conducted in several European
countries. This diversity led to the design of a custom simulator
called Madhoc. Madhoc captures the major characteristics of DTNs, by
providing an extendable set of mobility models as well as a framework
for the de_nition of new applications. Madhoc was primarily used for
the investigation of the broadcasting issue. In this specific
context, networks composed of thousands devices using a variety of
wireless technologies were considered. These networks are partitioned
and exhibit heterogeneous densities. This led to the design of a
bandwidth-efficient broadcasting protocol called DFCN.}
}
@PHDTHESIS{Liq07,
AUTHOR = {L. Liquori},
SCHOOL = {Institut National Polytechnique de Lorraine (INPL)},
TITLE = {Peter, le langage qui n'existe pas... (Peter, the
language that does not exists...)},
YEAR = {2007},
OPTADDRESS = {},
MONTH = {6 Juillet},
OPTNOTE = {},
TYPE = {Habilitation à Diriger des Recherches},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HDR-Liquori.pdf}
}
@PHDTHESIS{Mor07,
AUTHOR = {N. Morales},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Algorithmique des réseaux de communication radio
modélisés par des graphes},
YEAR = {2007},
OPTADDRESS = {},
MONTH = {26 Janvier},
OPTNOTE = {},
OPTTYPE = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Mor07.pdf}
}
@PHDTHESIS{Gir06b,
AUTHOR = {F. Giroire},
SCHOOL = {Université Paris VI},
TITLE = {Réseaux, algorithmique et analyse combinatoire de grands
ensembles},
YEAR = {2006},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://algo.inria.fr/papers/pdf/Giroire06b.pdf},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir06b.pdf},
ABSTRACT = {Two classes of algorithmic problems motivated by network
thematics are studied in this thesis. The first problem is to
estimate the number of distinct elements or cardinality of very large
multisets while using a very small amount of auxiliary memory. The
number of applications of this very simple question is surprisingly
important. In particular, we may mention the detection of some kinds
of attack against networks. We proposed new families of algorithms to
answer this problem. They are validated by mathematical analysis as
well as by simulations with real traffic. The second problem is the
design of efficient on-board networks in satellites. On one hand
these networks must be able to tolerate a given number of mechanical
failures of their components. On the other hand they should be of
small sizes because of their extremely high cost. We introduced a new
class of networks and proposed minimal constructions in lots of
cases.}
}
@PHDTHESIS{Hui06,
AUTHOR = {G. Huiban},
SCHOOL = {University of Nice Sophia Antipolis & Federal University of Minas Gerais},
TITLE = {The reconfiguration problem in multifiber WDM networks},
YEAR = {2006},
OPTADDRESS = {},
MONTH = {July},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://tel.archives-ouvertes.fr/tel-00123437/fr/},
PDF = {http://tel.archives-ouvertes.fr/docs/00/12/36/64/PDF/these_g_huiban.pdf},
ABSTRACT = {An optical telecommunication network is configured to
transmit a given traffic in order to meet a given objective. However
the demand changes with time and infrastructure development. The
reconfiguration problem stands in this context. It consists in being
able to alter the configuration of the network to adjust it to the
new traffic. It is generally necessary to interrupt partially or
totally the traffic to reconfigure a network. Considering the amount
of data flowing on it, it may not be possible to regularly stop the
network, even for a short amount of time. Many parameters have to be
taken into account to find out a good solution, and many metrics can
be used in order to measure the quality of a solution. In a first
part, we focus on the reconfiguration problem as a mono-objective
optimization problem. We propose a mathematical model representing
the reconfiguration problem. However solving exactly the proposed
model may require a high computational time. We also propose a greedy
and a simulated annealing heuristics. Depending on the metric
optimized, the solutions have different characteristics. The greedy
algorithm is fast and provides decent solutions whereas the simulated
annealing algorithm provides solutions competing with the optimal
ones. In a second part, we focus on the multiobjective aspect of the
reconfiguration problem. We consider at the same time different
metrics and search for a set of solutions representing different
interesting trade-offs instead of a unique solution. We propose an
algorithm based on our mathematical formulation. We also adapt an
evolutionary algorithm. The proposed methods succeed in finding
different interesting trade-offs. Giving a little flexibility with
respect to a metric generally allows to significantly improve the
solutions with respect to the other metrics.}
}
@PHDTHESIS{Ser06,
AUTHOR = {J.-S. Sereni},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Colorations de graphes et applications},
YEAR = {2006},
OPTADDRESS = {},
MONTH = {Juillet},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Vog06c,
AUTHOR = {M-E. Voge},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Optimisation des réseaux de télécommunications: réseaux
multicouches, tolérance aux pannes et surveillance de trafic},
YEAR = {2006},
OPTADDRESS = {},
MONTH = {November 17},
OPTNOTE = {},
OPTTYPE = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/these_mevoge.pdf}
}
@PHDTHESIS{Jar05,
AUTHOR = {A. Jarry},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Connexité dans les réseaux de télécommunications},
YEAR = {2005},
OPTADDRESS = {},
MONTH = {March},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Lal04,
AUTHOR = {J.-F. Lalande},
SCHOOL = {École doctorale STIC, Université de Nice-Sophia Antipolis},
TITLE = {Conception de réseaux de télécommunications :
optimisation et expérimentations},
YEAR = {2004},
OPTADDRESS = {},
MONTH = {Décembre},
OPTNOTE = {},
OPTTYPE = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/these_conception_de_reseaux_de_telecommunications_optimisation_et_experimentations.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/these_conception_de_reseaux_de_telecommunications_optimisation_et_experimentations.ps.gz}
}
@PHDTHESIS{Riv03,
AUTHOR = {H. Rivano},
SCHOOL = {Université de Nice-Sophia Antipolis},
TITLE = {Algorithmique et télécommunications : coloration et
multiflot approchés et applications aux réseaux d'infrastructure},
YEAR = {2003},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {},
URL = {http://www-sop.inria.fr/mascotte/Herve.Rivano/?lang=fr&to_inc=thesis.php},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/these.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/these.ps.gz},
ABSTRACT = {Cette thèse s'intéresse aux problématiques fondamentales
d'optimisation combinatoire qui se dégagent de la modélisation
structurelle et algorithmique du dimensionnement des réseaux
d'infrastructure de télécommunication. L'optimisation de ces réseaux
est essentielle aux opérateurs de télécommunication, qui demandent la
garantie d'une exploitation efficace des ressources déployées. Nous
donnons une nouvelle modélisation des réseaux optiques WDM
multifibres. En considérant un routage agrégé au niveau des câbles,
nous optons pour une nouvelle lecture des contraintes d'affectation
de longueurs d'onde fondée sur des conflits de groupe. Nous étudions
aussi le problème de coloration de chemins, issu de l'affectation de
longueurs d'onde dans les réseaux optiques monofibres. Nous
développons, pour la relaxation linéaire de ce problème, un
algorithme polynomial efficace dans les arbres de degré borné, puis,
par extension, dans les graphes de largeur arborescente bornée. Nous
majorons le coût d'une telle coloration dans les arbres binaires et
donnons une (1+5/(3e)+o(1))-approximation aléatoire pour la
coloration entière dans les arbres de degré borné, ce qui améliore le
meilleur algorithme connu pour ce cas. Nous présentons enfin des
avancées algorithmiques pour les problèmes de multiflot entier et
fractionnaire. Nous donnons un algorithme d'arrondi aléatoire
incrémental pour l'approximation du multiflot entier. Motivés par le
besoin d'un calcul rapide de multiflot fractionnaire pour
l'algorithme précédent, nous nous intéressons aux approximations
combinatoires de ce problème. En employant des techniques de calcul
dynamique des plus courts chemins, nous améliorons l'un des meilleurs
algorithme de la littérature.}
}
@PHDTHESIS{Tou03,
AUTHOR = {C. Touati},
SCHOOL = {Université de Nice-Sophia Antipolis},
TITLE = {Les principes d'équité appliqués aux réseaux de
télécommunications},
YEAR = {2003},
OPTADDRESS = {},
MONTH = {September},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Cho02,
AUTHOR = {S. Choplin},
SCHOOL = {Université de Nice - Sophia Antipolis},
TITLE = {Dimensionnement de réseaux virtuels de télécommunication},
YEAR = {2002},
OPTADDRESS = {},
MONTH = {November},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Flo02,
AUTHOR = {L. Floriani},
SCHOOL = {Université de Nice--Sophia Antipolis},
TITLE = {Méthodes d'Analyse des Données Multivariables pour
l'étude des Mécanismes des Heuristiques},
YEAR = {2002},
OPTADDRESS = {},
MONTH = {January},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Lau02,
AUTHOR = {A. Laugier},
SCHOOL = {Université de Nice--Sophia Antipolis},
TITLE = {Cônes de Matrices et Programmation Mathématique :
Quelques Applications},
YEAR = {2002},
OPTADDRESS = {},
MONTH = {March},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Cou01b,
AUTHOR = {D. Coudert},
SCHOOL = {Université de Nice Sophia-Antipolis (UNSA)},
TITLE = {Algorithmique et optimisation de réseaux de
communications optiques},
YEAR = {2001},
OPTADDRESS = {},
MONTH = {Décembre},
OPTNOTE = {},
OPTTYPE = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/these.ps.gz},
ABSTRACT = {This thesis deals with optical communication networks,
especially free space optical networks and optical fiber networks.
First we address the design of free space optical networks using the
Optical Transpose Interconnection System (OTIS) architecture defined
in [MMHE93]. We give a model of these networks with H(p,q,d) digraphs
which we characterize. We take a specific interest in isomorphisms
between these digraphs and well known digraphs (de Bruijn, Kautz and
other alphabet graphs). We develop a family of alphabet digraphs
which includes a large number of digraphs isomorphic to the de Bruijn
and use it to obtain an optimal design of the de Bruijn with OTIS, in
terms of minimizing the number of lenses. Then, we study a family of
networks modeled by directed hypergraphs and called stack-Kautz, for
which we provide routing algorithms and control protocols. In a
second part we address the problem of WDM network survivability using
protection. This problem consists in using precomputed and dedicated
resources in order to ensure traffic continuity if a bundle of fibers
breaks down. We describe numerous strategies for protecting the
instance and the network. We go more deeply into subnetwork
protection where protection resources are shared by sets of request
describing a specific subnetwork (circuit). We give an optimal
solution to this problem when the network is a cycle and the requests
realize the All-to-All pattern. }
}
@PHDTHESIS{Bea00,
AUTHOR = {B. Beauquier},
SCHOOL = {université de Nice-Sophia Antipolis -- STIC},
TITLE = {Communications dans les réseaux optiques par
multiplexage en longueur d'onde},
YEAR = {2000},
OPTADDRESS = {},
MONTH = {janvier},
OPTNOTE = {},
OPTTYPE = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Publications/Bea00.ps.gz}
}
@PHDTHESIS{Jim00,
AUTHOR = {T. Jiménez},
SCHOOL = {université de Nice-Sophia Antipolis},
TITLE = {Simulation de trafic routier: Étude des méthodologies de
modélisation et parallélisation et mise en oe uvre},
YEAR = {2000},
OPTADDRESS = {},
MONTH = {September},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Mar00,
AUTHOR = {N. Marlin},
SCHOOL = {université de Nice-Sophia Antipolis},
TITLE = {Communications Structurées dans les Réseaux},
YEAR = {2000},
OPTADDRESS = {},
MONTH = {juin},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Dal99a,
AUTHOR = {O. Dalle},
SCHOOL = {Université de Nice - Sophia Antipolis, École doctorale Sciences Pour l'Ingénieur},
TITLE = {Techniques et outils pour les communications et la
répartition dynamique de charge dans les réseaux de stations de
travail},
YEAR = {1999},
OPTADDRESS = {},
MONTH = {Janvier},
OPTNOTE = {},
TYPE = {Thèse de Doctorat}
}
@PHDTHESIS{Fur99,
AUTHOR = {N. Furmento},
SCHOOL = {Université de Nice-Sophia Antipolis},
TITLE = {Schooner : Une Encapsulation Orintée Objet de Supports
d'Exécution pour Applications Réparties},
YEAR = {1999},
ADDRESS = {France},
MONTH = {May},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Liq96b,
AUTHOR = {L. Liquori},
SCHOOL = {University of Turin},
TITLE = {Type Assigment Systems for Lambda Calculi and for the
Lambda Calculus of Objects},
YEAR = {1996},
OPTADDRESS = {},
MONTH = {October},
OPTNOTE = {},
TYPE = {Ph.D. Thesis, 193 pp.},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/phd.ps.gz}
}
@PHDTHESIS{these3,
AUTHOR = {A. Ferreira},
SCHOOL = {Ecole Normale Supérieure de Lyon et Université Claude Bernard Lyon},
TITLE = {Structures de données et modélisation discrète pour
l'algorithmique des systèmes massivement parallèles},
YEAR = {1994},
ADDRESS = {France},
MONTH = {February},
OPTNOTE = {},
TYPE = {Habilitation à diriger des recherches},
HOWPUBLISHED = {Habilitation à diriger des recherches}
}
@PHDTHESIS{these2,
AUTHOR = {A. Ferreira},
SCHOOL = {Institut National Polytechnique de Grenoble},
TITLE = {Contributions à la Recherche dans des Ensembles Ordonnés
: du Séquentiel au Parallèle},
YEAR = {1990},
ADDRESS = {France},
MONTH = {Juanary},
OPTNOTE = {},
OPTTYPE = {}
}
@PHDTHESIS{Mussi90,
AUTHOR = {P. Mussi},
SCHOOL = {Université de Paris V},
TITLE = {Modèles quantitatifs pour le Parallélisme},
YEAR = {1990},
OPTADDRESS = {},
MONTH = {May},
OPTNOTE = {},
OPTTYPE = {}
}
@ARTICLE{AHL+13,
AUTHOR = {L. Addario-Berry and F. Havet and Linhares Sales, C. and
B. Reed and S. Thomassé},
JOURNAL = {Discrete Mathematics},
TITLE = {Oriented trees in digraphs},
YEAR = {2013},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {8},
PAGES = {967-974},
VOLUME = {313},
URL = {http://www.sciencedirect.com/science/article/pii/S0012365X13000289},
PDF = {http://hal.inria.fr/docs/00/55/11/33/PDF/RR-7502.pdf},
ABSTRACT = {"Let $f(k)$ be the smallest integer such that every
$f(k)$-chromatic digraph contains every oriented tree of order $k$.
Burr proved $f(k)\leq (k-1)^2$ in general, and he conjectured
$f(k)=2k-2$. Burr also proved that every $(8k-7)$-chromatic digraph
contains every antidirected tree. We improve both of Burr's bounds.
We show that $f(k)\leq k^2/2-k/2+1$ and that every antidirected tree
of order $k$ is contained in every $(5k-9)$-chromatic digraph. We
make a conjecture that explains why antidirected trees are easier to
handle. It states that if $|E(D)| > (k-2) |V(D)|$, then the digraph
$D$ contains every antidirected tree of order $k$. This is a common
strengthening of both Burr's conjecture for antidirected trees and
the celebrated Erd\H{o}s-S\'os Conjecture. The analogue of our
conjecture for general trees is false, no matter what function $f(k)$
is used in place of $k-2$. We prove our conjecture for antidirected
trees of diameter 3 and present some other evidence for it. Along the
way, we show that every acyclic $k$-chromatic digraph contains every
oriented tree of order $k$ and suggest a number of approaches for
making further progress on Burr's conjecture."}
}
@ARTICLE{ACG+13,
AUTHOR = {J. Araujo and V. Campos and F. Giroire and N. Nisse and
L. Sampaio and R. Soares},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the hull number of some graph classes},
YEAR = {2013},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1-12},
VOLUME = {475},
URL = {http://hal.inria.fr/inria-00576581/en/},
PDF = {http://hal.inria.fr/inria-00576581/PDF/hn-RR_v2.pdf},
ABSTRACT = {In this paper, we study the geodetic convexity of graphs
focusing on the problem of the complexity to compute
inclusion-minimum hull set of a graph in several graph classes. For
any two vertices $u,v\in V$ of a connected graph $G=(V,E)$, the {\em
closed interval} $I[u,v]$ of $u$ and $v$ is the the set of vertices
that belong to some shortest $(u,v)$-path. For any $S \subseteq V$,
let $I[S]= \bigcup\_{u,v\in S} I[u,v]$. A subset $S\subseteq V$ is
{\em geodesically convex} if $I[S] = S$. In other words, a subset $S$
is convex if, for any $u,v \in S$ and for any shortest $(u,v)$-path
$P$, $V(P) \subseteq S$. Given a subset $S\subseteq V$, the {\em
convex hull} $I\_h[S]$ of $S$ is the smallest convex set that
contains $S$. We say that $S$ is a {\em hull set} of $G$ if $I\_h[S]
= V$. The size of a minimum hull set of $G$ is the {\em hull number}
of $G$, denoted by $hn(G)$. The {\sc Hull Number} problem is to
decide whether $hn(G)\leq k$, for a given graph $G$ and an integer
$k$. Dourado {\it et al.} showed that this problem is NP-complete in
general graphs. In this paper, we answer an open question of Dourado
et al.\~\cite{Douradoetal09} by showing that the {\sc Hull Number}
problem is NP-hard even when restricted to the class of bipartite
graphs. Then, we design polynomial time algorithms to solve the {\sc
Hull Number} problem in several graph classes. First, we deal with
the class of complements of bipartite graphs. Then, we generalize
some results in\~\cite{ACGSS11} to the class of $(q,q-4)$-graphs and
to the class of cacti. Finally, we prove tight upper bounds on the
hull numbers. In particular, we show that the hull number of an
$n$-node graph $G$ without simplicial vertices is at most $1+\lceil
\frac{3(n-1)}{5}\rceil$ in general, at most $1+\lceil
\frac{n-1}{2}\rceil$ if $G$ is regular or has no triangle, and at
most $1+\lceil \frac{n-1}{3}\rceil$ if $G$ has girth at least $6$.}
}
@ARTICLE{bermond:hal-00869501,
AUTHOR = {Jean-Claude Bermond and Michel Cosnard and
Stéphane Pérennes},
JOURNAL = {Theoretical Computer Science},
TITLE = {Directed acyclic graphs with the unique dipath property},
YEAR = {2013},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {5-11},
VOLUME = {504},
KEYWORDS = {DAG (Directed acyclic graphs), load, wavelengths,
dipaths, good labelings, conflict graphs, intersection graphs,
chromatic number},
PUBLISHER = {Elsevier},
URL = {http://hal.archives-ouvertes.fr/hal-00869501},
PDF = {http://hal.archives-ouvertes.fr/hal-00869501/PDF/tcs270412.pdf},
ABSTRACT = {Let P be a family of dipaths of a DAG (Directed Acyclic
Graph) G. The load of an arc is the number of dipaths containing this
arc. Let $\pi$(G, P) be the maximum of the load of all the arcs and
let w(G, P) be the minimum number of wavelengths (colors) needed to
color the family of dipaths P in such a way that two dipaths with the
same wavelength are arc-disjoint. There exist DAGs such that the
ratio between w(G, P) and $\pi$(G, P) cannot be bounded. An internal
cycle is an oriented cycle such that all the vertices have at least
one predecessor and one successor in G (said otherwise every cycle
contain neither a source nor a sink of G). We prove that, for any
family of dipaths P, w(G, P) = $\pi$(G, P) if and only if G is
without internal cycle. We also consider a new class of DAGs, which
is of interest in itself, those for which there is at most one dipath
from a vertex to another. We call these digraphs UPP-DAGs. For these
UPP-DAGs we show that the load is equal to the maximum size of a
clique of the conflict graph. We prove that the ratio between w(G, P)
and $\pi$(G, P) cannot be bounded (a result conjectured in an other
article). For that we introduce "good labelings" of the conflict
graph associated to G and P, namely labelings of the edges such that
for any ordered pair of vertices (x, y) there do not exist two paths
from x to y with increasing labels.}
}
@ARTICLE{GHP+13,
AUTHOR = {S. Guillemot and F. Havet and C. Paul and A. Perez},
JOURNAL = {Algorithmica},
TITLE = {On the (non-)existence of polynomial kernels for
$P_l$-free edge modification problems},
YEAR = {2013},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {900-926},
VOLUME = {65},
PDF = {ftp://ftp-sop.inria.fr/coati/Publications/GHP+13.pdf},
ABSTRACT = {Given a graph $G=(V,E)$ and a positive integer $k$, an
edge modification problem for a graph property $\Pi$ consists in
deciding whether there exists a set $F$ of pairs of $V$ of size at
most $k$ such that the graph $H=(V,E\vartriangle F)$ satisfies the
property $\Pi$. In the $\Pi$ \emph{edge-completion problem}, the set
$F$ is constrained to be disjoint from $E$; in the $\Pi$
\emph{edge-deletion problem}, $F$ is a subset of $E$; no constraint
is imposed on $F$ in the $\Pi$ \emph{edge-editing problem}. A number
of optimization problems can be expressed in terms of graph
modification problems which have been extensively studied in the
context of parameterized complexity. When parameterized by the size
$k$ of the set $F$, it has been proved that if $\Pi$ is an hereditary
property characterized by a finite set of forbidden induced
subgraphs, then the three $\Pi$ edge-modification problems are FPT.
It was then natural to ask whether these problems also admit a
polynomial kernel. Using recent lower bound techniques, Kratsch and
Wahlstr\"om answered this question negatively. However, the problem
remains open on many natural graph classes characterized by forbidden
induced subgraphs. Kratsch and Wahlstr\"om asked whether the result
holds when the forbidden subgraphs are paths or cycles and pointed
out that the problem is already open in the case of $P_4$-free graphs
(i.e. cographs). This paper provides positive and negative results in
that line of research. We prove that \textsc{Parameterized cograph
edge-modification} problems have cubic vertex kernels whereas
polynomial kernels are unlikely to exist for the \textsc{$P_l$-free
edge-deletion} and the \textsc{$C_l$-free edge-deletion} problems for
$l\geq 7$ and $l\geq 4$ respectively. Indeed, if they exist, then $NP
\subseteq coNP / poly$.}
}
@INBOOK{GMM12,
PUBLISHER = {IGI Global},
TITLE = {Energy Efficient Routing by Switching-Off Network
Interfaces},
YEAR = {2012},
AUTHOR = {F. Giroire and D. Mazauric and J. Moulierac},
CHAPTER = {10 - Energy-Aware Systems and Networking for Sustainable Initiatives},
EDITOR = {Naima Kaabouch and Wen-Chen Hu},
PAGES = {207-236},
OPTADDRESS = {},
OPTEDITION = {},
MONTH = {june},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
URL = {http://www.igi-global.com/chapter/energy-efficient-routing-switching-off/67312},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-7234.pdf},
ABSTRACT = {Several studies exhibit that the traffic load of the
routers only has a small influence on their energy consumption.
Hence, the power consumption in networks is strongly related to the
number of active network elements, such as interfaces, line cards,
base chassis,...
The goal thus is to find a routing that minimizes
the (weighted) number of active network elements used when routing.
In this paper, we consider a simplified architecture where a
connection between two routers is represented as a link joining two
network interfaces.
When a connection is not used, both network
interfaces can be turned off.
Therefore, in order to reduce power
consumption, the goal is to find the routing that minimizes the
number of used links while satisfying all the demands.
We first
define formally the problem and we model it as an integer linear
program.
Then, we prove that this problem is not in APX, that is
there is no polynomial-time constant-factor approximation algorithm.
We propose a heuristic algorithm for this problem and we also prove
some negative results about basic greedy and probabilistic
algorithms.
Thus we present a study on specific topologies, such as
trees, grids and complete graphs, that provide bounds and results
useful for real topologies.
We then exhibit the gain in terms of
number of network interfaces (leading to a global reduction of
approximately 33 MWh for a medium-sized backbone network) for a set
of existing network topologies:
we see that for almost all
topologies more than one third of the network interfaces can be
spared for usual ranges of operation.
Finally, we discuss the
impact of energy efficient routing on the stretch factor and on fault
tolerance.}
}
@ARTICLE{APP+12,
AUTHOR = {O. Amini and D. Peleg and S. Pérennes and I. Sau and
S. Saurabh},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {On the approximability of some degree-constrained
subgraph problems},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {12},
PAGES = {1661 - 1679},
VOLUME = {160},
URL = {http://www.sciencedirect.com/science/article/pii/S0166218X12001291},
PDF = {http://www.lirmm.fr/~sau/Pubs/DA8948R2.pdf},
ABSTRACT = {In this article we provide hardness results and
approximation algorithms for the following three natural
degree-constrained subgraph problems, which take as input an
undirected graph G = ( V , E ) .
Let d â‰¥ 2 be a fixed integer.
The Maximum d âˆ’ degree-boundedÂ Connected Subgraph ( MDBCS d )
problem takes as additional input a weight function Ï‰ : E â†’ R + ,
and asks for a subset E â€² âŠ† E such that the subgraph induced by E
â€² is connected, has maximum degree at most d , and âˆ‘ e âˆˆ E â€²
Ï‰ ( e ) is maximized.
The Minimum Subgraph of Minimum Degree â‰¥ d
( MSMD d ) problem involves finding a smallest subgraph of G with
minimum degree at least d .
Finally, the Dual Degree-dense k
-Subgraph ( DDD k S ) problem consists in finding a subgraph H of G
such that | V ( H ) | â‰¤ k and the minimum degree in H is maximized.}
}
@ARTICLE{ABG+12,
AUTHOR = {J. Araujo and J-C. Bermond and F. Giroire and F. Havet and
D. Mazauric and R. Modrzejewski},
JOURNAL = {Journal of Discrete Algorithms},
TITLE = {Weighted improper colouring},
YEAR = {2012},
OPTMONTH = {},
NOTE = {Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011)},
OPTNUMBER = {},
PAGES = {53-66},
VOLUME = {16},
URL = {http://www.sciencedirect.com/science/article/pii/S1570866712001049},
PDF = {http://hal.archives-ouvertes.fr/docs/00/74/77/55/PDF/WIC-JDiscreteAlgo-Final.pdf},
ABSTRACT = {In this paper, we study a colouring problem motivated by
a practical frequency assignment problem and, up to our best
knowledge, new.
In wireless networks, a node interferes with other
nodes, the level of interference depending on numerous parameters:
distance between the nodes, geographical topography, obstacles, etc.
We model this with a weighted graph $(G,w)$ where the weight
function $w$ on the edges of $G$ represents the noise (interference)
between the two end-vertices.
The total interference in a node is
then the sum of all the noises of the nodes emitting on the same
frequency.
A weighted $t$-improper $k$-colouring of $(G,w)$ is a
$k$-colouring of the nodes of $G$ (assignment of $k$ frequencies)
such that the interference at each node does not exceed the threshold
$t$.
We consider here the Weighted Improper Colouring problem which
consists in determining the weighted $t$-improper chromatic number
defined as the minimum integer $k$ such that $(G,w)$ admits a
weighted $t$-improper $k$-colouring.
We also consider the dual
problem, denoted the Threshold Improper Colouring problem, where,
given a number $k$ of colours, we want to determine the minimum real
$t$ such that $(G,w)$ admits a weighted $t$-improper $k$-colouring.
We show that both problems are NP-hard and first present general
upper bounds for both problems;
in particular we show a
generalisation of Lov\'asz's Theorem for the weighted $t$-improper
chromatic number.
Motivated by the original application, we then
study a special interference model on various grids (square,
triangular, hexagonal) where a node produces a noise of intensity 1
for its neighbours and a noise of intensity 1/2 for the nodes at
distance two.
We derive the weighted $t$-improper chromatic number
for all values of $t$.}
}
@ARTICLE{ACG+12,
AUTHOR = {J. Araujo and N. Cohen and F. Giroire and F. Havet},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Good edge-labelling of graphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {18},
PAGES = {2501-2513},
VOLUME = {160},
URL = {http://www.sciencedirect.com/science/article/pii/S0166218X11002824},
PDF = {http://hal.inria.fr/docs/00/38/48/23/PDF/RR-6934.pdf},
ABSTRACT = {{A {\it good edge-labelling} of a graph $G$ is a
labelling of its edges such that for any two distinct vertices $u$,
$v$, there is at most one $(u,v)$-path with non-decreasing labels.
This notion was introduced in~\cite{BCP09} to solve wavelength
assignment problems for specific categories of graphs.
In this
paper, we aim at characterizing the class of graphs that admit a good
edge-labelling.
First, we exhibit infinite families of graphs for
which no such edge-labelling can be found. We then show that deciding
if a graph admits a good edge-labelling is NP-complete.
Finally, we
give
large classes of graphs admitting a good edge-labelling:
$C_3$-free outerplanar graphs, planar graphs of girth at least 6,
subcubic $\{C_3,K_{2,3}\}$-free graphs.}
doi =
{10.1016/j.dam.2011.07.021}}
}
@ARTICLE{ArLi12,
AUTHOR = {J. Araujo and Linhares Sales, C.},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {On the Grundy number of graphs with few P4's},
YEAR = {2012},
OPTMONTH = {},
NOTE = {V Latin American Algorithms, Graphs, and Optimization Symposium â€” Gramado, Brazil, 2009},
NUMBER = {18},
PAGES = {2514-2522},
VOLUME = {160},
URL = {http://www.sciencedirect.com/science/article/pii/S0166218X11003258},
PDF = {http://hal.inria.fr/docs/00/63/90/08/PDF/grundy_p4-full-withmodifs.pdf},
ABSTRACT = {"The Grundy number of a graph $G$ is the largest number
of colors used by any execution of the greedy algorithm to color $G$.
The problem of determining the Grundy number of $G$ is polynomial if
$G$ is a $P_4$-free graph and NP-hard if $G$ is a $P_5$-free graph.
In this article, we define a new class of graphs, the fat-extended
$P_4$-laden graphs, and we show a polynomial time algorithm to
determine the Grundy number of any graph in this class. Our class
intersects the class of $P_5$-free graphs and strictly contains the
class of $P_4$-free graphs. More precisely, our result implies that
the Grundy number can be computed in polynomial time for any graph of
the following classes: $P_4$-reducible, extended $P_4$-reducible,
$P_4$-sparse, extended $P_4$-sparse, $P_4$-extendible, $P_4$-lite,
$P_4$-tidy, $P_4$-laden and extended $P_4$-laden, which are all
strictly contained in the fat-extended $P_4$-laden class."}
}
@ARTICLE{BHT12,
AUTHOR = {J. Bang-Jensen and F. Havet and N. Trotignon},
JOURNAL = {Theoretical Computer Science},
TITLE = {Finding an induced subdivision of a digraph},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {10-24},
VOLUME = {443},
URL = {http://hal.inria.fr/inria-00527518/fr/},
PDF = {http://hal.inria.fr/docs/00/52/75/18/PDF/RR-7430.pdf},
ABSTRACT = {We consider the following problem for oriented graphs
and digraphs: Given an oriented graph (digraph) $G$, does it contain
an induced subdivision of a prescribed digraph $D$?
The complexity
of this problem depends on $D$ and on whether $H$ must be an oriented
graph or is allowed to contain 2-cycles.
We give a number of
examples of polynomial instances as well as several NP-completeness
proofs.}
}
@ARTICLE{BFF+12,
AUTHOR = {L. Barrière and P. Flocchini and F. Fomin and
P. Fraigniaud and N. Nisse and N. Santoro and D. Thilikos},
JOURNAL = {Information and Computation},
TITLE = {Connected Graph Searching},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1-16},
VOLUME = {219},
URL = {http://dx.doi.org/10.1016/j.ic.2012.08.004},
PDF = {http://hal.inria.fr/docs/00/74/19/48/PDF/journalFinal.pdf},
ABSTRACT = {In graph searching game the opponents are a set of
searchers and a fugitive in a graph.
The searchers try to capture
the fugitive by applying some sequence moves that include placement,
removal, or sliding of a searcher along an edge.
The fugitive tries
to avoid capture by moving along unguarded paths.
The search number
of a graph is the minimum number of searchers required to guarantee
the capture of the fugitive.
In this paper, we initiate the study
of this game under the natural restriction of connectivity where we
demand that in each step of the search the locations of the graph
that are clean (i.e. non-accessible to the fugitive) remain
connected.
We give evidence that many of the standard mathematical
tools used so far in the classic graph searching fail under the
connectivity requirement.
We also settle the question on ``the
price of connectivity'' that is how many searchers more are required
for searching a graph when the connectivity demand is imposed.
We
make estimations of the price of connectivity on general graphs and
we provide tight bounds for the case of trees.
In particular, for
an $n$-vertex graph the ratio between the connected searching number
and the non-connected one is $O(\log n)$ while for trees this ratio
is always at most 2.
We also conjecture that this constant-ratio
upper bound for trees holds also for all graphs.
Our combinatorial
results imply a complete characterization of connected graph
searching on trees.
It is based on a forbidden-graph
characterization of the connected search number.
We prove that the
connected search game is monotone for trees, i.e. restricting search
strategies to only those where the clean territories increase
monotonically does not require more searchers.
A consequence of our
results is that the connected search number can be computed in
polynomial time on trees, moreover, we show how to make this
algorithm distributed.
Finally, we reveal connections of this
parameter to other invariants on trees such as the Horton-Stralher
number.}
}
@ARTICLE{BBD+12,
AUTHOR = {S. Baruah and V. Bonifaci and G. D'Angelo and H. Li and
A. Marchetti-Spaccamela and N. Megow and L. Stougie},
JOURNAL = {IEEE Transactions on Computers},
TITLE = {Scheduling Real-time Mixed-criticality Jobs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {8},
PAGES = {1140-1152},
VOLUME = {61},
PUBLISHER = {IEEE},
URL = {http://hal.inria.fr/hal-00643942},
PDF = {http://hal.inria.fr/hal-00643942/PDF/MixedCriticality-journal.pdf},
ABSTRACT = {Many safety-critical embedded systems are subject to
certification requirements;
some systems may be required to meet
multiple sets of certification requirements, from different
certification authorities.
Certification requirements in such
"mixed-criticality" systems give rise to interesting scheduling
problems, that cannot be satisfactorily addressed using techniques
from conventional scheduling theory.
In this paper, we study a
formal model for representing such mixed-criticality workloads.
We
demonstrate first the intractability of determining whether a system
specified in this model can be scheduled to meet all its
certification requirements, even for systems subject to merely two
sets of certification requirements.
Then we quantify, via the
metric of processor speedup factor, the effectiveness of two
techniques, reservation-based scheduling and priority-based
scheduling, that are widely used in scheduling such mixed-criticality
systems, showing that the latter of the two is superior to the
former.
We also show that the speedup factors we obtain are tight
for these two techniques.}
}
@ARTICLE{BDD+12,
AUTHOR = {R. Bauer and G. D'Angelo and D. Delling and A. Schumm and
D. Wagner},
JOURNAL = {Journal of Graph Algorithms and Applications},
TITLE = {The Shortcut Problem - Complexity and Algorithms},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {447-481},
VOLUME = {16},
PUBLISHER = {Journal of Graph Algorithms and Applications},
URL = {http://hal.inria.fr/hal-00728877},
PDF = {http://hal.inria.fr/hal-00728877/PDF/02-IJGAA.pdf},
ABSTRACT = {We study a graph-augmentation problem arising from a
technique applied in recent approaches for route planning.
Many
such methods enhance the graph by inserting shortcuts, i.e.,
additional edges (u,v) such that the length of (u,v) is the distance
from u to v.
Given a weighted, directed graph G and a number c in
Z, the shortcut problem asks how to insert c shortcuts into G such
that the expected number of edges that are contained in an
edge-minimal shortest path from a random node s to a random node t is
minimal.
In this work, we study the algorithmic complexity of the
problem and give approximation algorithms for a special graph class.
Further, we state ILP-based exact approaches and show how to
stochastically evaluate a given shortcut assignment on graphs that
are too large to do so exactly.}
}
@ARTICLE{BCM+11,
AUTHOR = {J-C. Bermond and D. Coudert and J. Moulierac and
S. Pérennes and I. Sau and Solano Donado, F.},
JOURNAL = {Theoretical Computer Science (TCS)},
TITLE = {GMPLS Label Space Minimization through Hypergraph
Layouts},
YEAR = {2012},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {3-16},
VOLUME = {444},
URL = {http://dx.doi.org/10.1016/j.tcs.2012.01.033},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/RR-7071.pdf},
ABSTRACT = {{A}ll-{O}ptical {L}abel {S}witching ({AOLS}) is a new
technology that performs packet forwarding without any
optical-electrical-optical conversions. {I}n this report, we study
the problem of routing a set of requests in {AOLS} networks using
{GMPLS} technology, with the aim of minimizing the number of labels
required to ensure the forwarding. {W}e first formalize the problem
by associating to each routing strategy a logical hypergraph, called
a hypergraph layout, whose hyperarcs are dipaths of the physical
graph, called tunnels in {GMPLS} terminology. {W}e define a cost
function for the hypergraph layout, depending on its total length
plus its total hop count. {M}inimizing the cost of the design of an
{AOLS} network can then be expressed as finding a minimum cost
hypergraph layout. {W}e prove hardness results for the problem,
namely for general directed networks we prove that it is {NP}-hard to
find a {C} log n-approximation, where {C} is a positive constant and
n is the number of nodes of the
network. {F}or symmetric directed
networks, we prove that the problem is {APX}-hard. {T}hese hardness
results hold even if the traffic instance is a partial broadcast.
{O}n the other hand, we provide approximation algorithms, in
particular an {O}(log n)-approximation for symmetric directed
networks. {F}inally, we focus on the case where the physical network
is a directed path, providing a polynomial-time dynamic programming
algorithm for a fixed number k of sources running in {O}(n^{k+2})
time.}
}
@ARTICLE{BeMo12,
AUTHOR = {J-C. Bermond and J. Moulierac},
JOURNAL = {Revue TDC Textes et documents pour la Classe : la révolution Internet},
TITLE = {Internet et la théorie des graphes},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {32-33},
VOLUME = {1042},
URL = {http://hal.archives-ouvertes.fr/hal-00747752},
PDF = {http://hal.archives-ouvertes.fr/hal-00747752/PDF/TDCfinal.pdf},
ABSTRACT = {La th{\'e}orie des graphes constitue un domaine des
math{\'e}matiques qui s'est d{\'e}velopp{\'e} au sein de disciplines
diverses telles que la chimie (mod{\'e}lisation de structures), la
biologie (g{\'e}nome), les sciences sociales (mod{\'e}lisation des
relations) et le transport (r{\'e}seaux routiers, {\'e}lectriques,
etc.).
Le cycle eul{\'e}rien et le cycle hamiltonien R{\'e}seaux
internet et graphes " petit-monde " Comment calculer un plus court
chemin ?}
}
@ARTICLE{BePe12,
AUTHOR = {J-C. Bermond and J. Peters},
JOURNAL = {Theoretical Computer Science},
TITLE = {Optimal Gathering in Radio Grids with Interference},
YEAR = {2012},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {10-26},
VOLUME = {457},
URL = {http://hal.archives-ouvertes.fr/hal-00747751},
PDF = {http://hal.archives-ouvertes.fr/docs/00/74/77/51/PDF/bermond-peters-revised.pdf},
ABSTRACT = {We study the problem of gathering information from the
nodes
of a
radio network into a central node. We model the network
of possible transmissions by a graph and consider a binary model of
interference in which two transmissions interfere if the distance in
the graph from the sender of one transmission to the receiver of the
other is $d_I$ or less. A {\em round} is a set of non-interfering
transmissions. In this paper, we determine the exact number of
rounds
required to gather one piece of information from each node of
a square
two-dimensional grid into the central node. If $d_I = 2k-1$
is odd,
then the number of rounds is $k(N-1)-c_k$ where $N$ is the
number of
nodes and $c_k$ is a constant that depends on $k$. If $d_I
= 2k$ is
even, then the number of rounds is
$(k+\frac{1}{4})(N-1)-c'_k$ where
$c'_k$ is a constant that depends
on $k$.
The even case uses a method based on linear programming
duality to
prove the lower bound, and sophisticated algorithms using
the symmetry
of the grid and non-shortest paths to establish the
matching upper
bound. We then generalize our results to hexagonal
grids.}
}
@ARTICLE{BhFe12,
AUTHOR = {S. Bhadra and A. Ferreira},
JOURNAL = {J. Internet Services and Applications},
TITLE = {Computing multicast trees in dynamic networks and the
complexity of connected components in evolving graphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {269-275},
VOLUME = {3},
URL = {http://hal.inria.fr/inria-00072057},
PDF = {http://hal.inria.fr/docs/00/07/20/57/PDF/RR-4531.pdf},
ABSTRACT = {New technologies and the deployment of mobile and
nomadic services are driving the emergence of complex communications
networks, that have a highly dynamic behavior.
This naturally
engenders new route-discovery problems under changing conditions over
these networks.
Unfortunately, the temporal variations in the
network topology are hard to be effectively captured in a classical
graph model.
In this paper, we use and extend a recently proposed
graph theoretic model, which helps capture the evolving
characteristi- c of such networks, in order to compute multicast
trees with minimum overall transmission time for a class of wireless
mobile dynamic networks.
We first show that computing different
types of strongly connected components in this model is NP-Complete,
and then propose an algorithm to build all rooted directed minimum
spanning trees in already identified strongly connected components.}
}
@ARTICLE{CGH+12,
AUTHOR = {V. Campos and A. Gyárfás and F. Havet and
Linhares Sales, C. and F. Maffray},
JOURNAL = {Journal of Graph Theory},
TITLE = {New bounds on the Grundy number of products of graphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {78-88},
VOLUME = {71},
URL = {http://hal.archives-ouvertes.fr/inria-00470158/fr/},
PDF = {http://hal.archives-ouvertes.fr/docs/00/47/01/58/PDF/RR-7243.pdf},
ABSTRACT = {The Grundy number of a graph $G$ is the largest $k$ such
that $G$ has a greedy $k$-colouring, that is, a colouring with $k$
colours obtained by applying the greedy algorithm according to some
ordering of the vertices of $G$.
In this paper, we give new bounds
on the Grundy number of the product of two graphs.}
}
@ARTICLE{CLL+11,
AUTHOR = {Y. Chen and E. Le Merrer and Z. Li and Y. Liu and
G. Simon},
JOURNAL = {Computer Networks},
TITLE = {OAZE: A Network-Friendly Distributed Zapping System for
Peer-to-Peer IPTV},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {365-377},
VOLUME = {56},
URL = {http://dx.doi.org/10.1016/j.comnet.2011.09.002},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CLL+11.pdf},
ABSTRACT = {IPTV systems attracting millions of users are now
commonly deployed on peer-to-peer (P2P) infrastructures. Each channel
is associated with a P2P overlay network for\
med by the users who
receive, watch and redistribute this channel. However, zapping from
one P2P overlay to another requires a significant amount of time, and
therefore the P2P\
IPTV experience is not as good as for a
multicast-based IPTV. In order to speed up the switching process and
to reduce the overall cross-domain traffic generated by the IPTV s\
ystem, we propose a distributed algorithm called OAZE for Overlay
Augmentation for Zapping Experience. The main idea is that every peer
maintains connections to other peers in \
a subset of all channels
to which it is likely to zap, and collaborates with the other peers
in its channel for the remaining channels. We present in this paper
the OAZE mechan\
ism. We focus in particular on the channel
assignment problem, which consists in determining the optimal
distribution of the responsibility to maintain contact peers in other
c\
hannels in a given overlay. We propose an approximate algorithm
having guaranteed performances in comparison to the optimal one, and
an algorithm that is simpler and more pract\
ical. Simulations show
that OAZE leads to substantial improvements on the connections
between peers, resulting in less switching delay and lower network
cost. This approach is \
overlay independent and is an appealing
add-on for existing P2P IPTV systems.}
}
@ARTICLE{CHM11,
AUTHOR = {D. Coudert and F. Huc and D. Mazauric},
JOURNAL = {Algorithmica},
TITLE = {A Distributed Algorithm for Computing the Node Search
Number in Trees},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {158-190},
VOLUME = {63},
URL = {http://dx.doi.org/10.1007/s00453-011-9524-3},
PDF = {http://hal.inria.fr/docs/00/58/78/19/PDF/bare_conf-noformat.pdf},
ABSTRACT = {We present a distributed algorithm to compute the node
search number
in trees. This algorithm extends the centralized
algorithm proposed
by Ellis \emph{et al.} [EST94]. It can be
executed in an
asynchronous environment, requires an overall
computation time of
$O(n\log{n})$, and $n$ messages of $\log_3{n}+4$
bits each.
The main contribution of this work lies in the data
structure
proposed to design our algorithm, called
\emph{hierarchical
decomposition}. This simple and flexible data
structure is used
for four operations: updating the node search
number after addition
or deletion of any tree-edges in a distributed
fashion; computing it
in a tree whose edges are added sequentially
and in any order;
computing other graph invariants such as the
process number and the
edge search number, by changing only
initialization rules; extending
our algorithms for trees and forests
of unknown size (using messages
of up to $2\log_3{n}+5$ bits).}
}
@ARTICLE{DDN12a,
AUTHOR = {G. D'Angelo and Di Stefano, G. and A. Navarra},
JOURNAL = {Algorithmica},
TITLE = {Minimize the Maximum Duty in Multi-interface Networks},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {274-295},
VOLUME = {63},
PUBLISHER = {Springer},
URL = {http://hal.inria.fr/hal-00643961},
PDF = {http://hal.inria.fr/hal-00643961/PDF/Min-Max-coverage.pdf},
ABSTRACT = {We consider devices equipped with multiple wired or
wireless interfaces.
By switching of various interfaces, each
device might establish several connections.
A connection is
established when the devices at its endpoints share at least one
active interface.
Each interface is assumed to require an
activation cost.
In this paper, we consider two basic networking
problems in the field of multi-interface networks.
The first one,
known as the Coverage problem, requires to establish the connections
defined by a network.
The second one, known as Connectivity
problem, requires to guarantee a connecting path between any pair of
nodes of a network.
Both are subject to the constraint of keeping
as low as possible the maximum cost set of active interfaces at each
single node.
We study the problems of minimizing the maximum cost
set of active interfaces among the nodes of the network in order to
cover all the edges in the first case, or to ensure connectivity in
the second case.
We prove that the Coverage problem is NP-hard for
any fixed $\Delta$$\ge$5 and k$\ge$16, with $\Delta$ being the
maximum degree, and k being the number of different interfaces among
the network.
We also show that, unless P=NP, the problem cannot be
approximated within a factor of $\eta$$\Delta$, for a certain
constant $\eta$.
We then provide a general approximation algorithm
which guarantees a factor of O((1+b)$\Delta$), with b being a
parameter depending on the topology of the input graph.
Interestingly, b can be bounded by a constant for many graph classes.
Other approximation and exact algorithms for special cases are
presented.
Concerning the Connectivity problem, we prove that it is
NP-hard for any fixed $\Delta$$\ge$3 and k$\ge$10.
Also for this
problem, the inapproximability result holds, that is, unless P=NP,
the problem cannot be approximated within a factor of $\eta$$\Delta$,
for a certain constant $\eta$.
We then provide approximation and
exact algorithms for the general problem and for special cases,
respectively.}
}
@ARTICLE{EKK12,
AUTHOR = {L. Esperet and F. Kardos and D. Král'},
JOURNAL = {European Journal of Combinatorics},
TITLE = {A superlinear bound on the number of perfect matchings
in cubic bridgeless graphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {767-798},
VOLUME = {33},
URL = {http://dx.doi.org/10.1016/j.ejc.2011.09.027},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/EKK11.pdf},
ABSTRACT = {Lov{\'{a}}sz and Plummer conjectured in the 1970â€™s
that cubic bridgeless
graphs have exponentially many perfect
matchings. This conjecture has
been verified for bipartite graphs
by Voorhoeve in 1979, and for planar
graphs by Chudnovsky and
Seymour in 2008, but in general only linear
bounds are known. In
this paper, we provide the first superlinear bound
in the general
case.}
}
@ARTICLE{FJ12,
AUTHOR = {A. Ferreira and A. Jarry},
JOURNAL = {Journal of Green Engineering},
TITLE = {Minimum-Energy Broadcast Routing in Dynamic Wireless
Networks},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {115-123},
VOLUME = {2},
PDF = {http://riverpublishers.com/journal/journal_articles/RP_Journal_1904-4720_222.pdf},
ABSTRACT = {One of the new challenges facing research in wireless
networks is the design of algorithms and protocols that are energy
aware.
A good example is the minimum-energy broadcast routing
problem for a static network in the plane, which attracted a great
deal of attention these past years.
The problem is NP-hard and its
approximation ratio complexity is a solution proved to be within a
factor 6 of the optimal, based on finding a Minimum Spanning Tree of
the static planar network.
In this paper, we use for the first time
the evolving graph combinatorial model as a tool to prove an
NP-Completeness result, namely that computing a Minimum Spanning Tree
of a planar network in the presence of mobility is actually
NP-Complete.
This result implies that the above approximation
solution cannot be used in dynamic wireless networks.
On the
positive side, we give a polynomial-time algorithm to build a rooted
spanning tree of an on/off network, that minimizes the maximum energy
used.}
}
@ARTICLE{GHP+12,
AUTHOR = {D. Gonçalves and F. Havet and A. Pinlou and S. Thomassé},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {On spanning galaxies in digraphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {744-754},
VOLUME = {160},
URL = {http://dx.doi.org/10.1016/j.dam.2011.07.013},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GHP+12b.pdf},
ABSTRACT = {In a directed graph, a {\it star} is an arborescence
with at least one arc, in which the root dominates all the other
vertices.
A {\it galaxy} is a vertex-disjoint union of stars.
In
this paper, we consider the \textsc{Spanning Galaxy} problem of
deciding whether a digraph $D$ has a spanning galaxy or not.
We
show that although this problem is NP-complete (even when restricted
to acyclic digraphs), it becomes polynomial-time solvable when
restricted to strong digraphs.
In fact, we prove that restricted to
this class, the \pb\ is equivalent to the problem of deciding if a
strong digraph has a strong digraph with an even number of vertices.
We then show a polynomial-time algorithm to solve this problem.
We
also consider some parameterized version of the \pb.
Finally, we
improve some results concerning the notion of directed star
arboricity of a digraph $D$, which is the minimum number of galaxies
needed to cover all the arcs of $D$.
We show in particular that
$dst(D)\leq \Delta(D)+1$ for every digraph $D$ and that $dst(D)\leq
\Delta(D)$ for every acyclic digraph $D$.}
}
@ARTICLE{HLS12,
AUTHOR = {F. Havet and Linhares Sales, C. and L. Sampaio},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {b-coloring of tight graphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {18},
PAGES = {2709-2715},
VOLUME = {160},
URL = {http://www.sciencedirect.com/science/article/pii/S0166218X11003921}
}
@ARTICLE{HRS12,
AUTHOR = {F. Havet and B. Reed and J.-S. Sereni},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Griggs and Yeh's conjecture and $L(p,1)$-labellings},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {145-168},
VOLUME = {26},
URL = {http://dx.doi.org/10.1137/090763998},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HRS12.pdf},
ABSTRACT = {An $L(p,1)$-labeling of a graph is a function $f$ from
the vertex set to the positive integers such that
$|f(x)-f(y)|\geqslant p$ if dist$(x,y)=1$ and $|f(x)-f(y)|\geqslant
1$ if dist$(x,y)=2$, where dist$(x,y)$ is the distance between the
two vertices $x$ and $y$ in the graph.
The span of an
$L(p,1)$-labeling $f$ is the difference between the largest and the
smallest labels used by $f$. In 1992, Griggs and Yeh conjectured that
every graph with maximum degree $\Delta\geqslant 2$ has an
$L(2,1)$-labeling with span at most $\Delta^2$.
We settle this
conjecture for $\Delta$ sufficiently large.
More generally, we show
that for any positive integer $p$ there exists a constant $\Delta_p$
such that every graph with maximum degree $\Delta\geqslant \Delta_p$
has an $L(p,1)$-labeling with span at most $\Delta^2$.
This yields
that for each positive integer $p$, there is an integer $C_p$ such
that every graph with maximum degree $\Delta$ has an
$L(p,1)$-labeling with span at most $\Delta^2+C_p$.}
}
@ARTICLE{NRS12,
AUTHOR = {N. Nisse and I. Rapaport and K. Suchan},
JOURNAL = {Theoretical Computer Science},
TITLE = {Distributed computing of efficient routing schemes in
generalized chordal graphs},
YEAR = {2012},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {27},
PAGES = {17-27},
VOLUME = {444},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512000333},
PDF = {http://hal.inria.fr/docs/00/74/19/70/PDF/SiroccoTCSFinal.pdf},
ABSTRACT = {Efficient algorithms for computing routing tables should
take advantage of the particular properties arising in large scale
networks.
There are in fact at least two properties that any
routing scheme must consider: low (logarithmic) diameter and high
clustering coefficient.
High clustering coefficient implies the
existence of few large induced cycles.
Therefore, we propose a
routing scheme that computes short routes in the class of k-chordal
graphs, i.e., graphs with no chordless cycles of length more than k.
We study the tradeoff between the length of routes and the time
complexity for computing them.
In the class of k-chordal graphs,
our routing scheme achieves an additive stretch of at most k-1, i.e.,
for all pairs of nodes, the length of the route never exceeds their
distance plus k-1.
In order to compute the routing tables of any
n-node graph with diameter D we propose a distributed algorithm which
uses O(log n)-bit messages and takes O(D) time.
We then propose a
slightly modified version of the algorithm for computing routing
tables in time O(min{Delta.D, n}), where Delta is the the maximum
degree of the graph.
Using these tables, our routing scheme
achieves a better additive stretch of 1 in chordal graphs (notice
that chordal graphs are 3-chordal graphs).
The routing scheme uses
addresses of size log n bits and local memory of size 2(d-1) log n
bits in a node of degree d.}
}
@INBOOK{BES11,
PUBLISHER = {Springer-Verlag},
TITLE = {Quisquater Festschrift},
YEAR = {2011},
AUTHOR = {J-C. Bermond and F. Ergincan and M. Syska},
CHAPTER = {Line Directed Hypergraphs},
EDITOR = {D. Naccache},
PAGES = {25-34},
ADDRESS = {Berlin Heidelberg},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Lecture Notes in Computer Science},
OPTTYPE = {},
VOLUME = {6805},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BES11.pdf},
ABSTRACT = {In this article we generalize the concept of line
digraphs to line
dihypergraphs. We give some general properties in
particular
concerning connectivity parameters of dihypergraphs and
their line
dihypergraphs, like the fact that the arc connectivity of
a
line dihypergraph is greater than or equal to that of the
original
dihypergraph. Then we show that the De Bruijn and Kautz
dihypergraphs
(which are among the best known bus networks) are
iterated line
digraphs. Finally we give short proofs that they are
highly connected.}
}
@INBOOK{WAD+11a,
PUBLISHER = {Taylor and Francis},
TITLE = {Discrete-Event Modeling and Simulation: Theory and
Applications},
YEAR = {2011},
AUTHOR = {G. A. Wainer and K. Al-Zoubi and O. Dalle and R.C. Hill and
S. Mittal and J. L. R. Martin and H. Sarjoughian and L. Touraille and
M. K. Traoré and B. P. Zeigler},
CHAPTER = {18 - Standardizing DEVS Simulation Middleware},
EDITOR = {G. Wainer and P. Mosterman},
PAGES = {459-494},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
URL = {http://cell-devs.sce.carleton.ca/publications/2010/WADHMMSTTZ10}
}
@INBOOK{WAD+11b,
PUBLISHER = {Taylor and Francis},
TITLE = {Discrete-Event Modeling and Simulation: Theory and
Applications},
YEAR = {2011},
AUTHOR = {G . Wainer and K. Al-Zoubi and O. Dalle and R. C. Hill and
S. Mittal and J. L. R. Martin and H. Sarjoughian and L. Touraille and
M. K. Traoré and B. P. Zeigler},
CHAPTER = {17 - Standardizing DEVS model representation},
EDITOR = {G. Wainer and P. Mosterman},
PAGES = {427-458},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
URL = {http://cell-devs.sce.carleton.ca/publications/2010/WADHMMSTTZ10}
}
@ARTICLE{ACS11,
AUTHOR = {V. Andova and N. Cohen and R. Skrekovski},
JOURNAL = {MATCH Commun. Math. Comput. Chem.},
TITLE = {Graph Classes (Dis)satisfying the Zagreb Indices
Inequality},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {647-658},
VOLUME = {65},
PDF = {http://www.imfm.si/preprinti/PDF/01108.pdf},
ABSTRACT = {Recently Hansen and Vuki\^cevi\'c proved that the
inequality $M_1/n \leq M_2/m$, where $M_1$ and $M_2$ are the first
and
second Zagreb indices, holds for chemical graphs, and
Vuki\^cevi\'c
and Graovac proved that this also holds for trees. In
both works is
given a distinct counterexample for which this
inequality is false in
general. Here, we present some classes of
graphs with prescribed
degrees, that satisfy $M_1/n \leq M_2/m$:
Namely every graph $G$ whose
degrees of vertices are in the interval
$[c; c + \sqrt c]$ for some integer $c$ satisies this inequality. In
addition, we prove that for
any $\Delta \geq 5$, there is an
infinite family of graphs of maximum
degree $\Delta$ such that the
inequality is false. Moreover, an
alternative and slightly shorter
proof for trees is presented, as
well as for unicyclic graphs.}
}
@ARTICLE{BCC+11b,
AUTHOR = {M. Basavaraju and L. S. Chandran and N. Cohen and
F. Havet and T. Müller},
JOURNAL = {SIAM Journal of Discrete Mathematics},
TITLE = {Acyclic edge-coloring of planar graphs},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {463--478},
VOLUME = {25},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCC+11.pdf},
ABSTRACT = {A proper edge-coloring with the property that every
cycle contains edges of
at least three distinct colors is called an
{\it acyclic
edge-coloring}. The {\it acyclic chromatic index} of a
graph $G$,
denoted $\chi'_a(G)$ is the minimum $k$ such that $G$
admits an {\it
acyclic edge-coloring} with $k$ colors.
We
conjecture that if $G$ is planar and $\Delta(G)$ is large enough then
$\chi'_a(G)=\Delta(G)$.
We settle this conjecture for planar graphs
with girth at least $5$.
We also show that $\chi'_a(G)\leq \Delta(G)
+ 12$ for all planar $G$, which improves a previous result by
Fiedorowicz et al.}
}
@ARTICLE{BBK11,
AUTHOR = {J. Beauquier and J. Burman and S. Kutten},
JOURNAL = {Theoretical Computer Science},
TITLE = {A self-stabilizing Transformer for Population Protocols
with Covering},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {33},
PAGES = {4247-4259},
VOLUME = {412},
URL = {http://dx.doi.org/10.1016/j.tcs.2010.09.016},
ABSTRACT = {Developing \emph{self-stabilizing} solutions is
considered to be more challenging and complicated than developing
classical solutions, where a proper initialization of the variables
can be assumed. Hence, to ease the task of the developers, some
automatic techniques have been proposed to design self-stabilizing
algorithms. In this paper, we propose an \emph{automatic transformer}
for algorithms in an extended \emph{population protocol model}.
Population protocols is a model that was introduced recently for
networks with a large number of resource-limited mobile agents. We
use a variant of this model. First, we assume agents having
characteristics (e.g., moving speed, communication radius) affecting
their intercommunication ``speed'', which is reflected by their
\emph{cover times}. Second, we assume the existence of a special
agent with an unbounded memory, the \emph{base station}. The
automatic transformer takes as an input an algorithm solving a
\emph{static problem} (and meeting some additional
rather natural
requirements) and outputs a self-stabilizing algorithm for the same
problem. The transformer is built using a \emph{re-execution
approach} (the technique consisting of executing an algorithm
repeatedly in order to obtain its self-stabilizing version). We show
that in the model we use, a transformer based on such an approach is
impossible without the assumption of an unbounded memory agent.}
}
@ARTICLE{BCC+11a,
AUTHOR = {J.-C. Bermond and Y. M. Chee and N. Cohen and X. Zhang},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {The $\alpha$-Arboricity of Complete Uniform Hypergraphs},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {600-610},
VOLUME = {25},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCCZ11.pdf},
ABSTRACT = {The $\alpha$-arboricity of the complete 3-uniform
hypergraph is determined completely.$\alpha$-Acyclicity is an
important notion in database theory. The $\alpha$-arboricity
of a
hypergraph H is the minimum number of $\alpha$-acyclic hypergraphs
that
partition the edge set of H.}
}
@ARTICLE{BMS11,
AUTHOR = {J-C. Bermond and X. Muñoz and I. Sau},
JOURNAL = {Networks},
TITLE = {Traffic Grooming in Bidirectional WDM Ring Networks},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {20-35},
VOLUME = {58},
URL = {http://dx.doi.org/10.1002/net.20410},
PDF = {http://hal.inria.fr/docs/00/42/91/55/PDF/RR-7080.pdf},
ABSTRACT = {We study the minimization of ADMs (Add-Drop
Multiplexers) in optical WDM bidirectional rings considering
symmetric shortest path routing and all-to-all unitary requests. We
precisely formulate the problem in terms of graph decompositions, and
state a general lower bound for all the values of the grooming factor
$C$ and $N$, the size of the ring. We first study exhaustively the
cases $C=1$, $C = 2$, and $C=3$, providing improved lower bounds,
optimal constructions for several infinite families, as well as
asymptotically optimal constructions and approximations. We then
study the case $C>3$, focusing specifically on the case $C =
k(k+1)/2$ for some $k \geq 1$. We give optimal decompositions for
several congruence classes of $N$ using the existence of some
combinatorial designs. We conclude with a comparison of the cost
functions in unidirectional and bidirectional WDM rings.}
}
@ARTICLE{BFM+11,
AUTHOR = {V. Bilo and M. Flammini and G. Monaco and L. Moscardelli},
JOURNAL = {Journal of Combinatorial Optimization},
TITLE = {On the performances of Nash equilibria in isolation
games},
YEAR = {2011},
OPTMONTH = {},
NOTE = {Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference},
OPTNUMBER = {},
PAGES = {378-391},
VOLUME = {22},
PUBLISHER = {Springer Netherlands},
URL = {http://dx.doi.org/10.1007/s10878-010-9300-3},
ABSTRACT = {We study the performances of Nash equilibria in
isolation games, a class of competitive location games recently
introduced in Zhao et al. (Proc. of the 19th International Symposium
on Algorithms and Computation (ISAAC), pp. 148â€“159, 2008 ). For all
the cases in which the existence of Nash equilibria has been shown,
we give tight or asymptotically tight bounds on the prices of anarchy
and stability under the two classical social functions mostly
investigated in the scientific literature, namely, the minimum
utility per player and the sum of the playersâ€™ utilities. Moreover,
we prove that the convergence to Nash equilibria is not guaranteed in
some of the not yet analyzed cases.}
}
@ARTICLE{BKK+11,
AUTHOR = {B. Bresar and F. Kardos and J. Katrenic and G. Semanisin},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Minimum $k$-path vertex cover},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {12},
PAGES = {1189-1195},
VOLUME = {159},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BKK+11.pdf},
ABSTRACT = {A subset $S$ of vertices of a graph $G$ is called a {\em
$k$-path vertex cover} if every path of order $k$ in $G$ contains at
least one vertex from $S$. Denote by $\psi_k(G)$ the minimum
cardinality of a $k$-path vertex cover in $G$. It is shown that the
problem of determining $\psi_k(G)$ is NP-hard for each $k\geq2$,
while for trees the problem can be solved in linear time.
We
investigate upper bounds on the value of $\psi_k(G)$ and provide
several estimations and exact values of $\psi_k(G)$. We also prove
that $\psi_3(G)\le (2n+m)/6$, for every graph $G$ with $n$ vertices
and $m$ edges. }
}
@ARTICLE{CPR11,
AUTHOR = {C. Caillouet and S. Pérennes and H. Rivano},
JOURNAL = {Computer Communications},
TITLE = {Framework for Optimizing the Capacity of Wireless Mesh
Networks},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {13},
PAGES = {1645-1659},
VOLUME = {34},
KEYWORDS = {Wireless mesh networks, capacity, routing, scheduling,
linear programming, column and cut generation.},
PUBLISHER = {Elsevier},
URL = {http://hal.inria.fr/inria-00572967/en},
ABSTRACT = {In this paper, we address the problem of computing the
transport capacity of Wireless Mesh Networks (WMNs) dedicated to
Internet access. Routing and transmission scheduling have a major
impact on the capacity provided to the clients. A cross-layer
optimization of these problems allows the routing to take into
account contentions due to radio interference. We present a generic
Mixed Integer Linear Programing description of the congurations of a
given WMN, addressing gateway placement, routing, and scheduling
optimizations. We then develop new optimization models that can take
into account a large variety of radio interference models, and QoS
requirements on the routing. We also provide efficient resolution
methods that deal with realistic size instances. It allows to work
around the combinatoric of simultaneously achievable transmissions
and point out a critical region in the network bounding the network
achievable capacity. Based upon strong duality arguments, it is then
possible to restrict the
computation to a bounded area. It allows
for computing solutions very efficiently on large networks.}
}
@ARTICLE{CCN+11,
AUTHOR = {J. Chalopin and V. Chepoi and N. Nisse and Y. Vaxès},
JOURNAL = {SIAM Journal of Discrete Maths.},
TITLE = {Cop and robber games when the robber can hide and ride},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {333-359},
VOLUME = {25},
URL = {http://hal.archives-ouvertes.fr/inria-00448243/fr/},
PDF = {http://hal.archives-ouvertes.fr/docs/00/44/82/43/PDF/RR-7178.pdf},
ABSTRACT = {In the classical cop and robber game, two players, the
cop
C and the robber R, move alternatively along edges of a finite
graph
G=(V,E). The cop captures the robber if both players are on
the same
vertex at the same moment of time. A graph G is called cop
win if the
cop always captures the robber after a finite number of
steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized
the cop-win graphs as graphs admitting a dismantling scheme. In this
paper, we characterize in a similar way the cop-win graphs in the
game
in which the cop and the robber move at different speeds s' and
s,
s'<= s. We also investigate several dismantling schemes necessary
or
sufficient for the cop-win graphs in the game in which the robber
is
visible only every k moves for a fixed integer k>1. We
characterize
the graphs which are cop-win for any value of k.}
}
@ARTICLE{CCM+11,
AUTHOR = {N. Cohen and D. Coudert and D. Mazauric and
N. Nepomuceno and N. Nisse},
JOURNAL = {Theoretical Computer Science (TCS)},
TITLE = {Tradeoffs in process strategy games with application in
the WDM reconfiguration problem},
YEAR = {2011},
MONTH = {August},
OPTNOTE = {},
NUMBER = {35},
PAGES = {4675-4687},
VOLUME = {412},
URL = {http://dx.doi.org/10.1016/j.tcs.2011.05.002},
PDF = {http://hal.inria.fr/docs/00/59/25/07/PDF/paper-noformat.pdf},
ABSTRACT = {We consider a variant of the graph searching games that
models the
routing reconfiguration problem in WDM networks. In the
digraph
processing game, a team of agents aims at {\it processing},
or
clearing, the vertices of a digraph~$D$. We are interested in
two
different measures: 1) the total number of agents used, and 2)
the
total number of vertices occupied by an agent during the
processing
of $D$. These measures respectively correspond to the
maximum number
of simultaneous connections interrupted and to the
total number of
interruptions during a routing reconfiguration
in a
WDM network.
Previous works have studied the problem of
independently minimizing
each of these parameters. In particular,
the
corresponding minimization problems are APX-hard, and the first
one
is known not to be in APX. In this paper, we give several
complexity results and study tradeoffs between these conflicting
objectives. In particular, we show that minimizing one of these
parameters while the other is constrained is NP-complete. Then, we
prove that there exist some digraphs for which minimizing one of
these objectives arbitrarily impairs the quality of the solution for
the other one. We show that such bad tradeoffs may happen even for a
basic class of digraphs. On the other hand, we exhibit classes of
graphs for which good tradeoffs can be achieved. We finally detail
the relationship between this game and the routing reconfiguration
problem. In particular, we prove that any instance of the processing
game, i.e. any digraph, corresponds to an instance of the routing
reconfiguration problem.}
}
@ARTICLE{CoHa11,
AUTHOR = {N. Cohen and F. Havet},
JOURNAL = {Graphs and Combinatorics},
TITLE = {Linear and 2-Frugal Choosability of Graphs of Small
Maximum Average Degree},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {831-849},
VOLUME = {27},
URL = {http://hal.inria.fr/inria-00459692/},
PDF = {http://hal.inria.fr/docs/00/45/96/92/PDF/RR-7213.pdf},
ABSTRACT = {
A proper vertex colouring of a graph $G$ is {\it
2-frugal} (resp. {\it linear}) if the graph induced by the vertices
of any two colour classes is of maximum degree 2 (resp. is a forest
of paths). A graph $G$ is {\it 2-frugally} (resp. {\it linearly})
{\it $L$-colourable} if for a given list assignment $L:V(G)\mapsto
2^{\mathbb N}$, there exists a 2-frugal (resp. linear) colouring $c$
of $G$ such that $c(v)\in L(v)$ for all $v\in V(G)$. If $G$ is
2-frugally (resp. linearly) $L$-list colourable for any list
assignment such that $|L(v)|\ge k$ for all $v\inV(G)$, then $G$ is
{\it 2-frugally} (resp. {\it linearly}) {\it $k$-choosable}. In this
paper, we improve some bounds on the 2-frugal choosability and linear
choosability of graphs with small maximum average degree.}
}
@ARTICLE{CGS11,
AUTHOR = {D. Coudert and F. Giroire and I. Sau},
JOURNAL = {Journal of Interconnection Networks (JOIN)},
TITLE = {Circuits in graphs through a prescribed set of ordered
vertices},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3-4},
PAGES = {121-141},
VOLUME = {11},
URL = {http://dx.doi.org/10.1142/S0219265910002763},
PDF = {http://hal.inria.fr/docs/00/58/55/61/PDF/join-final-noformat.pdf},
ABSTRACT = {A \emph{circuit} in a simple undirected graph $G=(V,E)$
is a sequence of vertices $\{v_1,v_2,\ldots,v_{k+1}\}$ such that
$v_1=v_{k+1}$ and $\{v_i,v_{i+1}\} \in E$ for $i=1,\ldots,k$. A
circuit $C$ is said to be \emph{edge-simple} if no edge of $G$ is
used twice in $C$. In this article we study the following problem:
which is the largest integer $k$ such that, given any subset of $k$
ordered vertices of a graph $G$, there exists an edge-simple circuit
visiting the $k$ vertices in the prescribed order? We first study the
case when $G$ has maximum degree at most 3, establishing the value of
$k$ for several subcases, such as when $G$ is planar or
3-vertex-connected. Our main result is that $k=10$ in infinite square
grids. To prove this, we introduce a methodology based on the notion
of core graph, in order to reduce the number of possible vertex
configurations, and then we test each one of the resulting
configurations with an Integer Linear Program (ILP) solver.}
}
@ARTICLE{CoSe11,
AUTHOR = {D. Coudert and J-S. Sereni},
JOURNAL = {Discrete Applied Mathematics (DAM)},
TITLE = {Characterization of graphs and digraphs with small
process number},
YEAR = {2011},
MONTH = {July},
OPTNOTE = {},
NUMBER = {11},
PAGES = {1094-1109},
VOLUME = {159},
URL = {http://dx.doi.org/10.1016/j.dam.2011.03.010},
PDF = {http://hal.inria.fr/docs/00/58/77/17/PDF/dam-noformat.pdf},
ABSTRACT = {We introduce the process number of a digraph as a tool
to study
rerouting issues in \wdm networks. This parameter is
closely related
to the vertex separation (or pathwidth). We consider
the recognition
and the characterization of (di)graphs with small
process number. In
particular, we give a linear time algorithm to
recognize (and
process) graphs with process number at most $2$,
along with a
characterization in terms of forbidden minors, and a
structural
description. As for digraphs with process number $2$, we
exhibit a
characterization that allows one to recognize (and
process) them in
polynomial time.}
}
@ARTICLE{CJK11,
AUTHOR = {J. Czap and S. Jendrol' and F. Kardos},
JOURNAL = {Ars Mathematica Contemporanea},
TITLE = {Facial parity edge colouring},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {255-269},
VOLUME = {4},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CJK11.pdf},
ABSTRACT = {A \emph{facial parity edge colouring} of a connected
bridgeless plane graph is such an edge colouring in which no two
face-adjacent edges (consecutive edges of a facial walk of some face)
receive the same colour, in addition, for each face $\alpha$ and each
colour $c$, either no edge or an odd number of edges incident with
$\alpha$ is coloured with $c$. From Vizing's theorem it follows that
every $3$-connected plane graph has a such colouring with at most
$\Delta^* +1$ colours, where $\Delta^* $ is the size of the largest
face. In this paper we prove that any connected bridgeless plane
graph has a facial parity edge colouring with at most $92$ colours. }
}
@ARTICLE{CJKa11,
AUTHOR = {J. Czap and S. Jendrol' and F. Kardos},
JOURNAL = {Discussiones Mathematicae Graph Theory},
TITLE = {On the strong parity chromatic number},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {587-600},
VOLUME = {31},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CJKa11.pdf},
ABSTRACT = {A vertex colouring of a 2-connected plane graph $G$ is a
strong parity vertex colouring if for every face $f$ and each colour
$c$, the number of vertices incident with $f$ coloured by $c$ is
either zero or odd. Czap et al. [Discrete Math. 311 (2011) 512Â–520]
proved that every 2-connected plane graph has a proper strong parity
vertex colouring with at most 118 colours. In this paper we improve
this upper bound for some classes of plane graphs }
}
@ARTICLE{CJK+11,
AUTHOR = {J. Czap and S. Jendrol' and F. Kardos and J. Miskuf},
JOURNAL = {Graphs and Combinatorics},
TITLE = {Looseness of Plane Graphs},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {73-85},
VOLUME = {27},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CJK+11.pdf},
ABSTRACT = {A face of a vertex coloured plane graph is called {\em
loose} if the number of colours used on its vertices is at least
three. The {\em looseness} of a plane graph $G$ is the minimum $k$
such that any surjective $k$-colouring involves a loose face.
In
this paper we prove that the looseness of a connected plane graph $G$
equals the maximum number of vertex disjoint cycles in a dual graph
$G^*$ increased by 2. We also show upper and lower bounds on the
looseness of graphs based on the number of vertices, the edge
connectivity, and the girth of the dual graph. These bounds improve
the result of Negami for the looseness of plane triangulations.
We
also present infinite classes of graphs where the equalities are
attained. }
}
@ARTICLE{DDN+11,
AUTHOR = {G. D'Angelo and Di Stefano, Gabriele and Alfredo Navarra and
Cristina Pinotti},
JOURNAL = {IEEE Transactions on Computers},
TITLE = {Recoverable Robust Timetables: An Algorithmic Approach
on Trees},
YEAR = {2011},
MONTH = {March},
OPTNOTE = {},
NUMBER = {3},
PAGES = {433 - 446},
VOLUME = {60},
PUBLISHER = {IEEE},
URL = {http://hal.inria.fr/hal-00643980/en/},
PDF = {http://hal.inria.fr/hal-00643980/PDF/RobustTree.pdf},
ABSTRACT = {In the context of scheduling and timetabling, we study a
challenging combinatorial problem which is very interesting for both
practical and theoretical points of view. The motivation behind it is
to cope with scheduled activities which might be subject to
unavoidable disruptions, such as delays, occurring during the
operational phase. The idea is to preventively plan some extra time
for the scheduled activities in order to be "prepared" if a delay
occurs, and absorb it without the necessity of rescheduling all the
activities from scratch. This realizes the concept of designing
robust timetables. During the planning phase, one should also
consider recovery features that might be applied at runtime if
disruptions occur. This leads to the concept of recoverable robust
timetables. In this new concept, it is assumed that recovery
capabilities are given as input along with the possible disruptions
that must be considered. The main objective is the minimization of
the overall needed time. The quality
of a robust timetable is
measured by the price of robustness, i.e., the ratio between the cost
of the robust timetable and that of a nonrobust optimal timetable. We
show that finding an optimal solution for this problem is NP-hard
even though the topology of the network, which models dependencies
among activities, is restricted to trees. However, we manage to
design a paeudopolynomial time algorithm based on dynamic programming
and apply it on both random networks and real case scenarios provided
by Italian railways. We evaluate the effect of robustness on the
scheduling of the activities and provide the price of robustness with
respect to different scenarios. We experimentally show the practical
effectiveness and efficiency of the proposed algorithm.}
}
@ARTICLE{Dal11a,
AUTHOR = {O. Dalle},
JOURNAL = {Modeling & Simulation Magazine},
TITLE = {Should Simulation Products Use Software Engineering
Techniques or Should They Reuse Products of Software Engineering? --
Part 1},
YEAR = {2011},
MONTH = {07},
NOTE = {Online publication},
NUMBER = {3},
OPTPAGES = {},
VOLUME = {11},
PUBLISHER = {Sage Publishers},
URL = {http://hal.inria.fr/inria-00638553},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal11.pdf},
ABSTRACT = {This two-part article addresses the issues concerning
the building
of new simulation software by either reusing existing
general purpose software
products and frameworks or by writing the
simulation software from scratch.
As a means of discussing the use
of existing software, this first part
escribes a selected list of
such existing software: the Eclipse IDE as
graphical user front-end,
Maven for the management and building of projects,
Bonita for
supporting simulation workflows, Ruby on Rails and its Hobo
extension to provide online persistence, and the Fractal Component
Model for
supporting the popular Component-Based Modeling \&
Simulation approach. The
second part, to be published in the next
issue of the \emph{M\&S Magazine},
will further explore some
interesting features found in the selected software
solutions, and
discuss their benefits when applied to simulation. }
}
@ARTICLE{Dal11b,
AUTHOR = {O. Dalle},
JOURNAL = {Modeling & Simulation Magazine},
TITLE = {Should Simulation Products Use Software Engineering
Techniques or Should They Reuse Products of Software Engineering? --
Part 2},
YEAR = {2011},
MONTH = {10},
NOTE = {Online publication},
NUMBER = {4},
OPTPAGES = {},
VOLUME = {11},
PUBLISHER = {Sage Publishers},
URL = {http://hal.inria.fr/inria-00638555_v1/},
ABSTRACT = {This two-part article addresses the issues concerning
the building
of new simulation software by either reusing existing
general purpose software
products and frameworks or by writing the
simulation software from scratch.
As a means of discussing the use
of existing software, this first part
escribes a selected list of
such existing software: the Eclipse IDE as
graphical user front-end,
Maven for the management and building of projects,
Bonita for
supporting simulation workflows, Ruby on Rails and its Hobo
extension to provide online persistence, and the Fractal Component
Model for
supporting the popular Component-Based Modeling \&
Simulation approach. The
second part, to be published in the next
issue of the \emph{M\&S Magazine},
will further explore some
interesting features found in the selected software
solutions, and
discuss their benefits when applied to simulation. }
}
@ARTICLE{EHL+11,
AUTHOR = {R. Erman and F. Havet and B. Lidicky and O. Pangrác},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {5-colouring graphs with 4 crossings},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {401-422},
VOLUME = {25},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/EHL+11.pdf},
ABSTRACT = {We disprove a conjecture of
Oporowski and Zhao stating
that every graph with crossing number at most 5
and clique number at
most 5 is 5-colourable.
However, we show that every graph with
crossing number at most 4 and
clique number at most 5 is
5-colourable.
We also show some colourability results on graphs that
can
be made planar by removing few edges.
In particular, we show
that if there exists three edges whose removal
leaves the graph
planar then it is $5$-colourable.}
}
@ARTICLE{EKK+11,
AUTHOR = {L. Esperet and F. Kardos and A. D. King and D. Král' and
S. Norine},
JOURNAL = {Advances in Mathematics},
TITLE = {Exponentially many perfect matchings in cubic graphs},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {1646-1664},
VOLUME = {227},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/EKK+11.pdf},
ABSTRACT = {We show that every cubic bridgeless graph $G$ has at
least $2^{|V(G)|/3656}$ perfect matchings. This confirms an old
conjecture of Lov{\'{a}}sz and Plummer. }
}
@ARTICLE{GiPe10,
AUTHOR = {P. Giabbanelli and J. G. Peters},
JOURNAL = {Technique et Science Informatiques},
TITLE = {Complex networks and epidemics},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {181-212},
VOLUME = {20},
ABSTRACT = {The study of spreading processes, such as infectious
diseases or
computer worms, is well-motivated by its financial
impact and
humanitarian aspects. A vast amount of research has
emerged through the
theory of complex networks, that sheds light on
the properties found in a
wide range of "real-world" networks. We
review these properties in the
context of spreads, with an emphasis
on the settings underlying some of
the major claims in the
literature such as whether or not a scale-free
network is
particularly prone to spreading phenomena. Stochastic models
have
been well studied in the literature, and thus we focus on
deterministic models, highlighting the connections between the two
approaches. Finally, we classify immunization strategies into four
categories, which allows comparisons on common features from a
computer
science perspective. Several topics for future work are
suggested. For
example, it remains open whether immunization
strategies, such as those
based on degree, benefit from complex
network properties.}
}
@ARTICLE{HJS+11,
AUTHOR = {F. Havet and S. Jendrol' and R. Soták and
E. Skrabul'áková},
JOURNAL = {Journal of Graph Theory},
TITLE = {Facial non-repetitive edge-colouring of plane graphs},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {38--48},
VOLUME = {66},
URL = {http://hal.inria.fr/inria-00366589/en/},
PDF = {http://hal.inria.fr/docs/00/36/65/89/PDF/RR-6873.pdf},
ABSTRACT = {A sequence $r_1,r_2,\dots,r_{2n}$ such that
$r_i=r_{n+i}$ for all $1\leq i \leq n$, is called a {\em repetition}.
A sequence $S$ is called {\em non-repetitive} if no {\it block} (i.e.
subsequence of consecutive terms of $S$) is a repetition. Let $G$ be
a graph whose edges are coloured. A trail is called {\em
non-repetitive} if the sequence of colours of its edges is
non-repetitive. If $G$ is a plane graph, a {\em facial non-repetitive
edge-colouring} of $G$ is an edge-colouring such that any {\it facial
trail} (i.e. trail of consecutive edges on the boundary walk of a
face) is non-repetitive. We denote $\pi'_f(G)$ the minimum number of
colours of a facial non-repetitive edge-colouring of $G$. In this
paper, we show that $\pi'_f(G)\leq 8$ for any plane graph $G$. We
also get better upper bounds for $\pi'_f(G)$ in the cases when $G$ is
a tree, a plane triangulation, a simple $3$-connected plane graph, a
hamiltonian plane graph, an outerplanar graph or a Halin graph. The
bound $4$ for trees is tight.
}
}
@ARTICLE{HKK+11,
AUTHOR = {F. Havet and M. Klazar and J. Kratochvìl and D. Kratsch and
M. Liedloff},
JOURNAL = {Algorithmica},
TITLE = {Exact algorithms for L(2,1)-labelling},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {169--194},
VOLUME = {59},
PDF = {http://hal.archives-ouvertes.fr/docs/00/30/33/30/PDF/RR-6587.pdf},
ABSTRACT = {The notion of distance constrained graph labelings,
motivated by the
Frequency Assignment Problem, reads as follows: A
mapping from the
vertex set of a graph $G=(V,E)$ into an interval of
integers
$\{0, \dots ,k\}$ is an $L(2,1)$-labeling of $G$ of span
$k$ if any two
adjacent vertices are mapped onto integers that are
at least 2
apart, and every two vertices with a common neighbor are
mapped onto
distinct integers. It is known that for any fixed $k\ge
4$, deciding
the existence of such a labeling is an NP-complete
problem. We
present exact exponential time algorithms that are
faster than the
naive $O((k+1)^n)$ algorithm that would try all
possible mappings.
The improvement is best seen in the first
NP-complete case of $k=4$
-- here the running time of our algorithm
is $O(1.3006^n)$. % $O(1.3161^n)$.
Furthermore we show that dynamic
programming can be used to establish
%an $O(c^n)$ algorithm to
compute an optimal $L(2,1)$-labeling, for a constant $c< 4$.
an
$O(3.8730^n)$ algorithm to compute an optimal $L(2,1)$-labeling.}
}
@ARTICLE{KKS11,
AUTHOR = {F. Kardos and J. Katrenic and I. Schiermeyer},
JOURNAL = {Theoretical Computer Science},
TITLE = {On computing the minimum 3-path vertex cover and
dissociation number of graphs},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {50},
PAGES = {7009-7017},
VOLUME = {412},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/KKS11.pdf},
ABSTRACT = {The dissociation number of a graph $G$ is the number of
vertices in a maximum size induced subgraph of $G$ with vertex degree
at most 1. A $k$-path vertex cover of a graph $G$ is a subset $S$ of
vertices of $G$ such that every path of order $k$ in $G$ contains at
least one vertex from $S$. The minimum $3$-path vertex cover is a
dual problem to the dissociation number. For this problem we present
an exact algorithm with a running time of $\mathcal{O}^*(1.5171^n)$
on a graph with $n$ vertices.
We also provide a polynomial time
randomized approximation algorithm with an expected approximation
ratio of $\frac{23}{11}$ for the minimum $3$-path vertex cover. }
}
@ARTICLE{KKV11,
AUTHOR = {F. Kardos and D. Král' and J. Volec},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Fractional colorings of cubic graphs with large girth},
YEAR = {2011},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {1454-1476},
VOLUME = {25},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/KKV11.pdf},
ABSTRACT = {We show that every (sub)cubic $n$-vertex graph with
sufficiently large girth has fractional chromatic number at most
$2.2978$ which implies that it contains an independent set of size at
least $0.4352n$. Our bound on the independence number is valid to
random cubic graphs as well as it improves existing lower bounds on
the maximum cut in cubic graphs with large girth. }
}
@INBOOK{CCC+10a,
PUBLISHER = {},
TITLE = {Calcul mathématique avec Sage},
YEAR = {2010},
AUTHOR = {A. Casamayou and N. Cohen and G. Connan and T. Dumont and
L. Fousse and F. Maltey and M. Meulien and M. Mezzarobba and
C. Pernet and N.M. Thiéry and P. Zimmermann},
CHAPTER = {Théorie des graphes},
ALTEDITOR = {},
ALTPAGES = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
URL = {http://sagebook.gforge.inria.fr/}
}
@INBOOK{CCC+10b,
PUBLISHER = {},
TITLE = {Calcul mathématique avec Sage},
YEAR = {2010},
AUTHOR = {A. Casamayou and N. Cohen and G. Connan and T. Dumont and
L. Fousse and F. Maltey and M. Meulien and M. Mezzarobba and
C. Pernet and N. M. Thiéry and P. Zimmermann},
CHAPTER = {Programmation Linéaire},
ALTEDITOR = {},
ALTPAGES = {},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
URL = {http://sagebook.gforge.inria.fr/}
}
@INBOOK{CCF+09,
PUBLISHER = {Springer},
TITLE = {Graphs and Algorithms in Communication Networks: Studies
in Broadband, Optical, Wireless, and Ad Hoc Networks},
YEAR = {2010},
AUTHOR = {T. Cinkler and D. Coudert and M. Flammini and G. Monaco and
L. Moscardelli and X. Muñoz and I. Sau and M. Shalom and S. Zaks},
CHAPTER = {Traffic Grooming: Combinatorial Results and Practical Resolutions},
ALTEDITOR = {},
PAGES = {63-94},
OPTADDRESS = {},
EDITION = {A. Koster and X. Muñoz},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {EATCS Texts in Theoretical Computer Science},
OPTTYPE = {},
VOLUME = {XXVII},
URL = {http://www.springer.com/computer/foundations/book/978-3-642-02249-4},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CCF+09.pdf},
ABSTRACT = {In an optical network using the wavelength division
multiplexing (WDM) technology, routing a request consists in
assigning it a route in the physical network and a wavelength. If
each request uses $1/g$ of the bandwidth of the wavelength, we will
say that the grooming factor is $g$. That means that on a given edge
of the network we can groom (group) at most $g$ requests on the same
wavelength. With this constraint the objective can be either to
minimize the number of wavelengths (related to the transmission cost)
or minimize the number of Add Drop Multiplexers\index{add drop
multiplexer} (shortly ADM) used in the network (related to the cost
of the nodes). Here, we first survey the main theoretical results
obtained for different grooming factors on various topologies:
complexity, (in)approximability, optimal constructions, approximation
algorithms, heuristics, etc. Then, we give an ILP formulation for
multilayer traffic grooming and present some experimental results.}
}
@ARTICLE{AK+09,
AUTHOR = {L. Addario-Berry and W.S. Kennedy and A.D. King and
Z. Li and B. Reed},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Finding the maximum-weight induced $k$-partite subgraph
of an $i$-triangulated graph},
YEAR = {2010},
MONTH = {April},
OPTNOTE = {},
NUMBER = {7},
PAGES = {765-770},
VOLUME = {158},
URL = {http://dx.doi.org/10.1016/j.dam.2008.08.020},
ABSTRACT = {An i-triangulated graph is a graph in which every odd
cycle has two non-crossing chords; i-triangulated graphs form a
subfamily of perfect graphs. A slightly more general family of
perfect graphs are clique-separable graphs. A graph is
clique-separable precisely if every induced subgraph either has a
clique cutset, or is a complete multipartite graph or a clique joined
to an arbitrary bipartite graph. We exhibit a polynomial time
algorithm for finding a maximum-weight induced k-partite subgraph of
an i-triangulated graph, and show that the problem of finding a
maximum-size bipartite induced subgraph in a clique-separable graph
is View the MathML source-complete.}
}
@ARTICLE{AGHP10,
AUTHOR = {O. Amini and F. Giroire and F. Huc and S. Pérennes},
JOURNAL = {Networks},
TITLE = {Minimal selectors and fault tolerant networks},
YEAR = {2010},
MONTH = {July},
OPTNOTE = {},
NUMBER = {4},
PAGES = {326-340},
VOLUME = {55},
URL = {http://doi.wiley.com/10.1002/net.20326},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AG+07.pdf},
ABSTRACT = {In this paper we study a combinatorial optimization
problem issued from on-board networks in satellites. In this kind of
networks the entering signals (inputs) should be routed to amplifiers
(outputs). The connections are made via expensive switches with four
links available. The paths connecting inputs to outputs should be
link-disjoint. More formally, we call {it $\plk-$network } an
undirected graph with $p+\lambda$ inputs, $p+k$ outputs and internal
vertices of degree four. A $\plk-$network is \emph{valid} if it is
tolerant to a restricted number of faults in the network, i.e. if for
any choice of at most $k$ faulty inputs and $\lambda$ faulty outputs,
there exist $p$ edge-disjoint paths from the remaining inputs to the
remaining outputs. In the special case $\lambda=0$, a $\plk-$network
is already known as a \emph{selector}. Our optimization problem
consists of determining $N\plk$, the minimum number of nodes in a
valid $\plk-$network. For this, we present validity certificates and
a gluing lemma from which derive lower bounds for $N\plk$. We also
provide constructions, and hence upper bounds, based on expanders.
The problem is very sensitive to the order of $\lambda$ and $k$. For
instance, when $\lambda$ and $k$ are small compared to $p$, the
question reduces to avoid certain forbidden local configurations. For
larger values of $\lambda$ and $k$, the problem is to find graphs
with a good expansion property for small sets. This leads us to
introduce a new parameter called \emph{$\alpha$-robustness}. We use
$\alpha$-robustness to generalize our constructions to higher order
values of $k$ and $\lambda$. In many cases, we provide asymptotically
tight bounds for $N\plk$. }
}
@ARTICLE{AHH+10,
AUTHOR = {O. Amini and F. Havet and F. Huc and S. Thomassé},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {WDM and directed star arboricity},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {161--182},
VOLUME = {19},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHH+10.pdf},
ABSTRACT = {A digraph is $m$-labelled if every arc is labelled by an
integer in $\{1, \dots ,m\}$. Motivated by wavelength assignment for
multicasts in optical networks, we introduce and study $n$-fibre
colourings of labelled digraphs. These are colourings of the arcs of
$D$ such that at each vertex $v$, and for each colour $\alpha$,
$in(v,\alpha)+out(v,\alpha)\leq n$ with $in(v,\alpha)$ the number of
arcs coloured $\alpha$ entering $v$ and $out(v,\alpha)$ the number of
labels $l$ such that there is at least one arc of label $l$ leaving
$v$ and coloured with $\alpha$. The problem is to find the minimum
number of colours $\lambda_n(D)$ such that the $m$-labelled digraph
$D$ has an $n$-fibre colouring. In the particular case when $D$ is
$1$-labelled, $\lambda_1(D)$ is called the directed star arboricity
of $D$, and is denoted by $dst(D)$. We first show that $dst(D)\leq
2\Delta^-(D)+1$, and conjecture that if $\Delta^-(D)\geq 2$, then
$dst(D)\leq 2\Delta^-(D)$. We also prove that for a subcubic digraph
$D$, then $dst(D)\leq 3$, and that if $\Delta^+(D), \Delta^-(D)\leq
2$, then $dst(D)\leq 4$. Finally, we study
$\lambda_n(m,k)=\max\{\lambda_n(D) \tq D \mbox{ is $m$-labelled} \et
\Delta^-(D)\leq k\}$. We show that if $m\geq n$, then $\ds
\left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil +
\frac{k}{n} \right\rceil\leq \lambda_n(m,k)
\leq\left\lceil\frac{m}{n}\left\lceil \frac{k}{n}\right\rceil +
\frac{k}{n} \right\rceil + C \frac{m2\log k}{n}$ for some constant
$C$. We conjecture that the lower bound should be the right value of
$\lambda_n(m,k)$.}
}
@ARTICLE{AHL10,
AUTHOR = {M. Asté and F. Havet and Linhares Sales, C.},
JOURNAL = {Discrete Mathematics},
TITLE = {Grundy number and products of graphs},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {9},
PAGES = {1482--1490},
VOLUME = {310},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHL10.pdf},
ABSTRACT = {The {\em Grundy number} of a graph $G$, denoted by
$\Gamma (G)$, is the largest $k$ such that $G$ has a {\em greedy}
$k$-colouring, that is a colouring with $k$ colours obtained by
applying the greedy algorithm according to some ordering of the
vertices of $G$. In this paper, we study the Grundy number of the
lexicographic and the cartesian products of two graphs in terms of
the Grundy numbers of these graphs. Regarding the lexicographic
product, we show that $\Gamma(G)\times \Gamma(H)\leq \Gamma(G[H])\leq
2^{\Gamma(G)-1}(\Gamma(H)-1)+\Gamma(G)$. In addition, we show that if
$G$ is a tree or $\Gamma(G)=\Delta(G)+1$, then
$\Gamma(G[H])=\Gamma(G)\times\Gamma(H)$. We then deduce that for
every fixed $c\geq 1$, given a graph $G$, it is CoNP-Complete to
decide if $\Gamma(G)\leq c\times \chi(G)$ and it is CoNP-Complete to
decide if $\Gamma(G)\leq c\times \omega(G)$. Regarding the cartesian
product, we show that there is no upper bound of $\Gamma(G\square H)$
as a function of $\Gamma(G)$ and $\Gamma(H)$. Nevertheless, we prove
that $\Gamma(G\square H) \leq \Delta(G)\cdot 2^{\Gamma(H)-1} +
\Gamma(H)$.}
}
@ARTICLE{BCG+10,
AUTHOR = {J-C. Bermond and C. J. Colbourn and L. Gionfriddo and
G. Quattrocchi and I. Sau},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Drop Cost and Wavelength Optimal Two-Period Grooming
with Ratio 4},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {400-419},
VOLUME = {24},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCG+10.pdf},
ABSTRACT = {We study grooming for two-period optical networks, a
variation of the traffic grooming problem for WDM ring networks
introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-period
grooming problem, during the first period of time there is all-to-all
uniform traffic among $n$ nodes, each request using $1/C$ of the
bandwidth; and during the second period, there is all-to-all uniform
traffic only among a subset $V$ of $v$ nodes, each request now being
allowed to use $1/C'$ of the bandwidth, where $C' < C$. We determine
the minimum drop cost (minimum number of ADMs) for any $n,v$ and
$C=4$ and $C' \in \{1,2,3\}$. To do this, we use tools of graph
decompositions. Indeed the two-period grooming problem corresponds to
minimizing the total number of vertices in a partition of the edges
of the complete graph $K_n$ into subgraphs, where each subgraph has
at most $C$ edges and where furthermore it contains at most $C'$
edges of the complete graph on $v$ specified vertices. Subject to the
condition that the two-period grooming has the least drop cost, the
minimum number of wavelengths required is also determined in each
case.}
}
@ARTICLE{BGR10,
AUTHOR = {J-C. Bermond and L. Gargano and A. A. Rescigno},
JOURNAL = {JOIN},
TITLE = {Gathering with minimum completion time in sensor tree
networks},
YEAR = {2010},
OPTMONTH = {},
NOTE = {A preliminary version has been presented at Sirocco08},
NUMBER = {1-2},
PAGES = {1-33},
VOLUME = {11},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/BGR10.pdf},
ABSTRACT = {Data gathering is a fundamental operation in wireless
sensor networks in which data packets generated at sensor nodes are
to be collected at a base station. In this paper we suppose that each
sensor is equipped with an halfâ€“duplex interface; hence, a node
cannot receive and transmit at the same time. Moreover, each node is
equipped with omnidirectional antennas allowing the transmission over
distance R. The network is a multi-hop wireless network and the time
is slotted so that oneâ€“hop transmission of one data item consumes
one time slot. We model the network with a graph where the vertices
represent the nodes and two nodes are connected if they are in the
transmission range of each other. We suppose that the interference
range is the same as the transmission range; therefore due to
interferences a collision happens at a node if two or more of its
neighbors try to transmit at the same time. Furthermore we suppose
that an intermediate node should forward a message as soon as it
receives it. We give an optimal collision free gathering schedule for
tree networks whenever each node has exactly one data packet to send. }
}
@ARTICLE{BHHL10,
AUTHOR = {J-C. Bermond and F. Havet and F. Huc and
Linhares Sales, C.},
JOURNAL = {Discrete Mathematics, Algorithms and Applications},
TITLE = {Improper colouring of weighted grid and hexagonal graphs},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {395-411},
VOLUME = {2},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BHHL10.pdf},
ABSTRACT = {{W}e study a weighted improper colouring problem
motivated by a frequency allocation problem. {I}t consists of
associating to each vertex a set of $p(v)$ (weight) distinct colours
(frequencies), such that the set of vertices having a given colour
induces a graph of degree at most $k$ (the case $k=0$ corresponds to
proper colouring). {T}he objective is to minimize the number of
colours. We propose approximation algorithms to compute such a
colouring for general graphs. {W}e apply these to obtain good
approximation ratio for grid and hexagonal graphs. {F}urthermore we
give exact results for the 2-dimensional grid and the triangular
lattice when the weights are all the same.}
}
@ARTICLE{BeYu10,
AUTHOR = {J-C. Bermond and M-L. Yu},
JOURNAL = {Ad Hoc and Sensor Wireless Networks},
TITLE = {Optimal gathering algorithms in multi-hop radio tree
networks with interferences},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {109-128},
VOLUME = {9},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/BeYu10.pdf},
ABSTRACT = {We study the problem of gathering information from the
nodes of a multi-hop radio network into a pre-defined destination
node under the interference constraints. In such a network, a message
can only be properly received if there is no interference from
another message being simultaneously transmitted. The network is
modeled as a graph, where the vertices represent the nodes and the
edges, the possible com- munications. The interference constraint is
modeled by a fixed integer dI ? 1, which implies that nodes within
distance d I in the graph from one sender cannot receive messages
from another node. In this paper, we suppose that it takes one unit
of time (slot) to transmit a unit-length message. A step (or round)
consists of a set of non interfering (compat- ible) calls and uses
one slot. We present optimal algorithms that give minimum number of
steps (delay) for the gathering problem with buffer- ing possibility,
when the network is a tree, the root is the destination and dI = 1.
In fact we study the equivalent personalized broadcasting problem
instead. }
}
@ARTICLE{CFK+09,
AUTHOR = {I. Caragiannis and A. Ferreira and C. Kaklamanis and
S. Pérennes and H. Rivano},
JOURNAL = {Algorithmica},
TITLE = {Fractional Path Coloring in Bounded Degree Trees with
Applications},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {516-540},
VOLUME = {58},
URL = {http://dx.doi.org/10.1007/s00453-009-9278-3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Herve.Rivano/Biblio/cfkpr09.pdf},
ABSTRACT = {This paper studies the natural linear programming
relaxation of the path coloring problem. We prove constructively that
finding an optimal fractional path coloring is Fixed Parameter
Tractable (FPT), with the degree of the tree as parameter: the
fractional coloring of paths in a bounded degree trees can be done in
a time which is linear in the size of the tree, quadratic in the load
of the set of paths, while exponential in the degree of the tree. We
give an algorithm based on the generation of an efficient polynomial
size linear program. Our algorithm is able to explore in polynomial
time the exponential number of different fractional colorings, thanks
to the notion of trace of a coloring that we introduce. We further
give an upper bound on the cost of such a coloring in binary trees
and extend this algorithm to bounded degree graphs with bounded
treewidth. Finally, we also show some relationships between the
integral and fractional problems, and derive a (1 + 5/3e) ~= 1.61
approximation algorithm for the path coloring problem in bounded
degree trees, improving on existing results. This classic
combinatorial problem finds applications in the minimization of the
number of wavelengths in wavelength division multiplexing (WDM)
optical networks.}
}
@ARTICLE{CDK+10,
AUTHOR = {N. Cohen and D. Dimitrov and R. Krakovski and
R. Skrekovski and V. Vukasinovic},
JOURNAL = {MATCH Commun. Math. Comput. Chem.},
TITLE = {On Wiener Index of Graphs and Their Line Graphs},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {683-698},
VOLUME = {64},
PDF = {http://www.imfm.si/preprinti/PDF/01113.pdf},
ABSTRACT = {The Wiener index of a graph $G$, denoted by $W(G)$, is
the sum of distances between all pairs of vertices in $G$. In this
paper, we consider the relation between the Wiener index of a graph,
$G$, and its line graph, $L(G)$. We show that if $G$ is of minimum
de\ gree at least two, then $W(G) â‰¤ W(L(G))$. We prove that for
every non-negative integer g0, there exists $g > g_0$, such that
there are infinitely many graphs $G$ of girth $g$, satisfying $W(G) =
W(L(G))$. This partially answers a question raised by Dobrynin and
Melâ€™nikov \ [8] and encourages us to conjecture that the answer to
a stronger form of their question is affirmative.}
}
@ARTICLE{CFG+10,
AUTHOR = {N. Cohen and F. V. Fomin and G. Gutin and E. Jung Kim and
S. Saurabh and A. Yeo},
JOURNAL = {Journal of Computer and System Sciences},
TITLE = {Algorithm for finding k-vertex out-trees and its
application to k-internal out-branching problem},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {7},
PAGES = {650 - 662},
VOLUME = {76},
URL = {http://www.sciencedirect.com/science/article/B6WJ0-4Y7P4VB-1/2/82e1f60c51c64592592c857c9c99062b},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/k-out-tree.pdf},
ABSTRACT = {" An out-tree T is an oriented tree with only one vertex
of in-degree zero. A vertex x of T is internal if its out-degree is
positive. We design randomized and deterministic algorithms for
deciding whether an input digraph contains a given out-tree with k
vertices. The algorithms are of running time O*(5.704k) and
O*(6.14k), respectively. We apply the deterministic algorithm to
obtain a deterministic algorithm of runtime O*(ck), where c is a
constant, for deciding whether an input digraph contains a spanning
out-tree with at least k internal vertices. This answers in
affirmative a question of Gutin, Razgon and Kim (Proc. AAIM'08)."}
}
@ARTICLE{CoHa10,
AUTHOR = {N. Cohen and F. Havet},
JOURNAL = {Discrete Mathematics},
TITLE = {Planar graphs with maximum degree $\Delta\geq 9$ are
($\Delta+1$)-edge-choosable -- short proof},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {21},
PAGES = {3049--3051},
VOLUME = {310},
KEYWORDS = {edge-colouring, list colouring,
List Colouring Conjecture, planar graphs},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CoHa10.pdf},
ABSTRACT = {{W}e give a short proof of the following theorem due to
{B}orodin~\cite{{B}or90}. {E}very planar graph with maximum degree
$\{D}elta\geq 9$ is $(\{D}elta+1)$-edge-choosable.}
}
@ARTICLE{CNR10,
AUTHOR = {D. Coudert and N. Nepomuceno and H. Rivano},
JOURNAL = {Computer Communications, Special Section on Hot Topics in Mesh Networking},
TITLE = {Power-Efficient Radio Configuration in Fixed Broadband
Wireless Networks},
YEAR = {2010},
MONTH = {May},
OPTNOTE = {},
NUMBER = {8},
PAGES = {898-906},
VOLUME = {33},
PUBLISHER = {Elsevier},
URL = {http://dx.doi.org/10.1016/j.comcom.2010.01.006},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CNR10.pdf},
ABSTRACT = {In this work, we investigate on determining feasible
radio configurations in fixed broadband wireless networks, focusing
on power efficiency. Under this scenario, a power-efficient
configuration can be characterized by a modulation constellation size
and a transmission power level. Every link holds a set of
power-efficient configurations, each of them associating a capacity
with its energy cost. We introduce a joint optimization of data
routing and radio configuration that minimizes the total energy
consumption while handling all the traffic requirements
simultaneously. An exact mathematical formulation of the problem is
presented. It relies on a minimum cost multicommodity flow with step
increasing cost functions, which is very hard to optimize. We then
propose a piecewise linear convex function, obtained by linear
interpolation of power-efficient points, that provides a good
approximation of the energy consumption on the links, and present a
relaxation of the previous formulation that exploits the convexity of
the cost functions. This yields lower bounds on the total energy
expenditure, and finally heuristic algorithms based on the fractional
optimum are employed to produce feasible configuration solutions. Our
models are validated through extensive experiments that are reported
and discussed. The results testify the potentialities behind this
novel approach.}
}
@ARTICLE{WQD+10,
AUTHOR = {O. Dalle and Q. Liu and G. Wainer and B. P. Zeigler},
JOURNAL = {Simulation & Gaming},
TITLE = {Applying Cellular Automata and DEVS Methodologies to
Digital Games: A Survey},
YEAR = {2010},
MONTH = {December},
NOTE = {EA DISSIMINET (Associated Team)},
NUMBER = {6},
PAGES = {796-823},
VOLUME = {41},
PUBLISHER = {Sage Publications},
URL = {http://hal.inria.fr/inria-00530927},
ABSTRACT = {Cellular automata were designed by John von Neumann in
the 1940s, as a mathematical abstraction for modeling
self-replicating algorithms. Since then, cellular automata have been
widely studied theoretically and evolved into multiple variants. In
the 1970s, Bernard P. Zeigler proposed a formalism rooted on systems
theory principles, named DEVS (discrete-event systems
specifications), which paved the way for component-based modeling and
simulation and related methodologies. The purpose of this article is
to survey how cellular automata and its variant, called cell-DEVS,
may be used to implement computer simulations that can be used as
digital serious games. The authors illustrate that implementation
through some of the practical applications of such cellular automata.
They show various serious game applications using real case studies:
first, a simple bouncing ball and pinball game, a particle collision
model, another on gossip propagation, and an application on human
behavior at a metro station. Then, they show an application to social
simulation using a voters game, a theoretical application (a model
called Daisy World, which is derived from Gaia theory), and
applications to physical phenomena such as a sandpile formation model
or, finally, a three-dimensional model of a "virtual clay" that
changes its shape when it is subject to pressure effects.}
}
@ARTICLE{EHN10,
AUTHOR = {N. Eggemann and F. Havet and S. Noble},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {k-L(2,1)-Labelling for Planar Graphs is NP-Complete for
$k\geq 4$},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {16},
PAGES = {1777--1788},
VOLUME = {158},
URL = {http://hal.inria.fr/inria-00360505/fr/},
PDF = {http://hal.inria.fr/docs/00/36/05/05/PDF/RR-6840.pdf OPTx-editorial-board=yes},
ABSTRACT = {A mapping from the vertex set of a graph $G=(V,E)$ into
an interval of integers $\{0, \dots ,k\}$ is an $L(2,1)$-labelling of
$G$ of span $k$ if any two adjacent vertices are mapped onto integers
that are at least 2 apart, and every two vertices with a common
neighbour are mapped onto distinct integers. It is known that for any
fixed $k\ge 4$, deciding the existence of such a labelling is an
NP-complete problem while it is polynomial for $k\leq 3$. For even
$k\geq 8$, it remains NP-complete when restricted to planar graphs.
In this paper, we show that it remains NP-complete for any $k \ge 4$
by reduction from Planar Cubic Two-Colourable Perfect Matching.
Schaefer stated without proof that Planar Cubic Two-Colourable
Perfect Matching is NP-complete. In this paper we give a proof of
this. }
}
@ARTICLE{EPS+10,
AUTHOR = {C. Eslahchi and H. Pezeshk and M. Sadeghi and
P. Giabbanelli and F. Movahedi and V. Dabbaghian},
JOURNAL = {World Journal of Modelling and Simulation (WJMS)},
TITLE = {A Probabilistic Model for the Spread of HIV Infection
among Injection Drug Users},
YEAR = {2010},
MONTH = {November},
OPTNOTE = {},
NUMBER = {4},
PAGES = {267-273},
VOLUME = {6},
PDF = {http://www.worldacademicunion.com/journal/1746-7233WJMS/wjmsvol06no04paper03.pdf},
ABSTRACT = {By sharing contaminated needles, injecting drug users
contribute in a significant manner to the spread of the human
immunodeficiency virus (HIV) in Asia and in some European countries.
Furthermore, injecting drug users may also be sex workers, and risky
sexual activities allow the virus to spread to other parts of the
population. Mathematical models of needle sharing have been used to
evaluate the success of needle exchange programs, and have led to
advances such as new legislations. We use epidemiological classes to
model how injecting drug users may start or cease sharing needles
under social influences, and may become infected with HIV when
sharing. Numerous models based on epidemiological classes were
proposed regarding several aspects of HIV, and were commonly studied
by differential equations. We instead show how to analyze the
theoretical behaviour of the model using the technique of discrete
Markov chains. Using simulations, we observed that the prevalence of
HIV depended very little on the probability of transmission of HIV
when sharing a needle, but almost only on the encouragement and
discouragement regarding needle sharing in the community. By
measuring the cost of resources required to decrease factors
encouraging needle sharing and to increase discouraging ones, our
model could be refined to provide an estimate of the expected
prevalence of HIV among injecting drug users.}
}
@ARTICLE{Fer10,
AUTHOR = {A. Ferreira},
JOURNAL = {Teoria e Debate},
TITLE = {Uma estratégia face à Revolução Digital},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {20-23},
VOLUME = {87},
PUBLISHER = {Editora Fundação Perseu Abramo},
ABSTRACT = {A revolu{\c{c}}{\~a}o digital {\'e} o principal motor do
atual ritmo acelerado do progresso cient{\'\i}fico e da
inova{\c{c}}{\~a}o. O poder criativo e a produtividade
tecnol{\'o}gica dos indiv{\'\i}duos est{\~a}o sendo ativados em
propor{\c{c}}{\~o}es antes desconhecidas, produzindo
ininterruptamente novos produtos e processos, em quase todas as
{\'a}reas do conhecimento humano. O Information Economy Report
2007-2008 da CNUCED detalha como a ind{\'u}stria das Tecnologias da
Informa{\c{c}}{\~a}o e da Comunica{\c{c}}{\~a}o (TIC) cresce mais
rapidamente do que muitas ind{\'u}strias a n{\'\i}vel mundial.
Atualmente, o setor das TIC representa cerca de 7\% do PIB mundial e
emprega mais de 15 milh{\~o}es de pessoas nos pa{\'\i}ses da OECD. Em
dados de 2007, as receitas mundiais das 250 maiores empresas em TIC
atingiram 3,8 trilh{\~o}es de d{\'o}lares. Como afirmado por Kofi
Annan, antigo Secret{\'a}rio-Geral das Na{\c{c}}{\~o}es Unidas: \"Se
o mundo pretende seriamente alcan{\c{c}}ar o Objectivo de
Desenvolvimento do Mil{\^e}nio de reduzir em metade o n{\'u}mero de
pessoas vivendo em extrema pobreza at{\'e} o ano de 2015, as TIC
devem figurar proeminentemente neste esfor{\c{c}}o. Todos â€“
governos, sociedade civil e as empresas do setor privado â€“ devem
ajudar a fomentar oportunidades na era digital e colocar as TIC ao
servi{\c{c}}o do desenvolvimento.\" Surpreendentemente, por{\'e}m,
mesmo se tal contribui{\c{c}}{\~a}o enorme do setor econ{\^o}mico das
TIC ao PIB mundial {\'e} bem compreendida e reconhecida, o impacto
real de todas as Ci{\^e}ncias e Tecnologias da Computa{\c{c}}{\~a}o e
da Comunica{\c{c}}{\~a}o como facilitadoras e catalisadoras da
inova{\c{c}}{\~a}o e do progresso em outros setores econ{\^o}micos e
outras disciplinas cient{\'\i}ficas, como a gen{\^o}mica por exemplo,
que tamb{\'e}m impactam a sociedade, {\'e} largamente ignorado. Neste
artigo proponho-me a mostrar a import{\^a}ncia de um posicionamento
estrat{\'e}gico em rela{\c{c}}{\~a}o {\`a} revolu{\c{c}}{\~a}o
digital, informado por atividades multidisciplinares de prospectiva.}
}
@ARTICLE{FGM09,
AUTHOR = {A. Ferreira and A. Goldman and J. Monteiro},
JOURNAL = {Wireless Networks},
TITLE = {Performance evaluation of routing protocols for MANETs
with known connectivity patterns using evolving graphs},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {627--640},
VOLUME = {16},
URL = {http://www.springerlink.com/content/c82014477847t646},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/FGM09.pdf},
ABSTRACT = {The assessment of routing protocols for mobile wireless
networks is a difficult task, because of the networksÃ¢Â€Â™ dynamic
behavior and the absence of benchmarks. However, some of these
networks, such as intermittent wireless sensors networks, periodic or
cyclic networks, and some delay tolerant networks (DTNs), have more
predictable dynamics, as the temporal variations in the network
topology can be considered as deterministic, which may make them
easier to study. Recently, a graph theoretic modelÃ¢Â€Â”the evolving
graphsÃ¢Â€Â”was proposed to help capture the dynamic behavior of such
networks, in view of the construction of least cost routing and other
algorithms. The algorithms and insights obtained through this model
are theoretically very efficient and intriguing. However, there is no
study about the use of such theoretical results into practical
situations. Therefore, the objective of our work is to analyze the
applicability of the evolving graph theory in the construction of
efficient routing protocols in realistic scenarios. In this paper, we
use the NS2 network simulator to first implement an evolving graph
based routing protocol, and then to use it as a benchmark when
comparing the four major ad hoc routing protocols (AODV, DSR, OLSR
and DSDV). Interestingly, our experiments show that evolving graphs
have the potential to be an effective and powerful tool in the
development and analysis of algorithms for dynamic networks, with
predictable dynamics at least. In order to make this model widely
applicable, however, some practical issues still have to be addressed
and incorporated into the model, like adaptive algorithms. We also
discuss such issues in this paper, as a result of our experience.}
}
@ARTICLE{FMM+10,
AUTHOR = {M. Flammini and G. Monaco and L. Moscardelli and
H. Shachnai and M. Shalom and T. Tamir and S. Zaks},
JOURNAL = {Theoretical Computer Science},
TITLE = {Minimizing Total Busy Time in Parallel Scheduling with
Application to Optical Networks},
YEAR = {2010},
MONTH = {September},
OPTNOTE = {},
NUMBER = {40-42},
PAGES = {3553-3562},
VOLUME = {411},
ABSTRACT = {We consider a scheduling problem in which a bounded
number of jobs can be processed simultaneously by a single machine.
The input is a set of $n$ jobs $\mathcal{J}= \{J_1, \ldots , J_n \}$.
Each job, $J_j$, is associated with an interval $[s_j, c_j]$ along
which it should be processed. Also given is the parallelism parameter
$g \ge 1$, which is the maximal number of jobs that can be processed
simultaneously by a single machine. Each machine operates along a
contiguous time interval, called its {\em busy interval}, which
contains all the intervals corresponding to the jobs it processes.
The goal is to assign the jobs to machines such that the total busy
time of the machines is minimized. The problem is known to be NP-hard
already for $g=2$. We present a $4$-approximation algorithm for
general instances, and approximation algorithms with improved ratios
for instances with bounded lengths, for instances where any two
intervals intersect, and for instances where no interval is properly
contained in another. Our study has important application in
optimizing the switching costs of optical networks.}
}
@ARTICLE{FGK+10,
AUTHOR = {F. V. Fomin and P. A. Golovach and J. Kratochvil and
N. Nisse and K. Suchan},
JOURNAL = {Theoretical Computer Science},
TITLE = {Pursuing a fast robber on a graph},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {7-9},
PAGES = {1167-1181},
VOLUME = {411},
URL = {http://dx.doi.org/10.1016/j.tcs.2009.12.010},
PDF = {http://dx.doi.org/10.1016/j.tcs.2009.12.010},
ABSTRACT = {The Cops and Robbers game as originally defined
independently by Quillot and by Nowakowski and Winkler in the
1980Ã¢??s has been much studied, but very few results pertain to
algorithmic and complexity aspects of it. In this paper we prove that
computing the minimum number of cops that are guaranteed too catch a
robber on a given graph is NP-hard and that the parametrized version
of the problem is W[2]-hard; the proof extends to the case where the
robber moves s time faster than the cops. We show that on split
graphs, the problem is polynomially solvable if s=1 but is NP-hard if
s=2. We further prove that on graphs of bounded cliquewidth the
problem is polynomially solvable for s<=2. Finally, we show that for
planar graphs the minimum number of cops is unbounded if the robber
is faster than the cops.}
}
@ARTICLE{HKS+10,
AUTHOR = {F. Havet and D. Král and J.-S. Sereni and R. Skrekovski},
JOURNAL = {European Journal of Combinatorics},
TITLE = {Facial coloring using Hall's theorems},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1001--1019},
VOLUME = {31},
URL = {http://dx.doi.org/10.1137/060664124},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HKS+10.pdf},
ABSTRACT = {A vertex coloring of a plane graph is $\ell$-facial if
every two distinct vertices joined by a facial walk of length at most
$\ell$ receive distinct colors. It has been conjectured that every
plane graph has an $\ell$-facial coloring with at most $3\ell+1$
colors. We improve the currently best known bound and show that every
plane graph has an $\ell$-facial coloring with at most $\lfloor
7\ell/2\rfloor+6$ colors. Our proof uses the standard discharging
technique, however, in the reduction part we have successfully
applied Hall's Theorem, which seems to be quite an innovative
approach in this area.}
}
@ARTICLE{molle:2010:inria-00629556:1,
AUTHOR = {C. Molle},
JOURNAL = {4OR: A Quarterly Journal of Operations Research},
TITLE = {Optimization of the Capacity of Wireless Mesh Networks},
YEAR = {2010},
MONTH = {December},
OPTNOTE = {},
NUMBER = {4},
PAGES = {425-428},
VOLUME = {8},
PUBLISHER = {Springer Berlin / Heidelberg},
URL = {http://hal.inria.fr/inria-00629556/en}
}
@ARTICLE{molle:2010:inria-00629560:1,
AUTHOR = {C. Molle and M-E. Voge},
JOURNAL = {IEEE Communications Letters},
TITLE = {A quantitative analysis of the capacity of wireless mesh
networks},
YEAR = {2010},
MONTH = {May},
OPTNOTE = {},
NUMBER = {5},
PAGES = {438-440},
VOLUME = {14},
PUBLISHER = {IEEE},
URL = {http://hal.inria.fr/inria-00629560/en}
}
@ARTICLE{RTV10,
AUTHOR = {H. Rivano and F. Theoleyre and F. Valois},
JOURNAL = {Ad Hoc and Sensor Wireless networks (AHSWN)},
TITLE = {A Framework for the Capacity Evaluation of Multihop
Wireless Networks},
YEAR = {2010},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3-4},
PAGES = {139-162},
VOLUME = {9},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Herve.Rivano/Biblio/rtv09.pdf},
ABSTRACT = {The specific challenges of multihop wireles networks
lead to a strong research effort on efficient protocols design where
the offered capacity is a key objective. More specifically, routing
strategy largely impacts the network capacity, i.e. the throughput
offered to each flow. In this work, we propose a complete framework
to compute the upper and the lower bounds of the network capacity
according to a physical topology and a given routing protocol. The
radio resource sharing principles of CSMA-CA is modeled as a set of
linear constraints with two models of fairness. The first one assumes
that nodes have a fair access to the channel, while the second one
assumes that on the radio links. We then develop a pessimistic and an
optimistic scenarios for radio resource sharing, yielding a lower
bound and an upper bound on the network capacity for each fairness
case. Our approach is independent of the network topology and the
routing protocols, and provides therefore a relevant framework for
their comparison. We apply our models to a comparative analysis of a
well-known flat routing protocol OLSR against two main self-organized
structure approaches, VSR and localized CDS.}
}
@ARTICLE{SaTh10,
AUTHOR = {I. Sau and D. M. Thilikos},
JOURNAL = {Journal of Discrete Algorithms},
TITLE = {Subexponential Parameterized Algorithms for
Degree-constrained Subgraph Problems on Planar Graphs},
YEAR = {2010},
MONTH = {September},
OPTNOTE = {},
NUMBER = {3},
PAGES = {330-338},
VOLUME = {8},
URL = {http://dx.doi.org/10.1016/j.jda.2010.02.002},
PDF = {http://www.cs.technion.ac.il/~ignasi/Pubs/SaTh10.pdf},
ABSTRACT = {We present subexponential parameterized algorithms on
planar graphs for a family of problems of the following shape: given
a graph, find a connected (induced) subgraph with bounded maximum
degree and with maximum number of edges (or vertices). These problems
are natural generalisations of the \textsc{Longest Path} problem. Our
approach uses bidimensionality theory combined with novel dynamic
programming techniques over branch decompositions of the input graph.
These techniques can be applied to a more general family of problems
that deal with finding connected subgraphs under certain degree
constraints.}
}
@INBOOK{BCF+09,
PUBLISHER = {Springer},
TITLE = {Graphs and Algorithms in Communication Networks: Studies
in Broadband, Optical, Wireless, and Ad Hoc Networks},
YEAR = {2009},
AUTHOR = {V. Bilò and I. Caragiannis and A. Fanelli and
M. Flammini and C. Kaklamanis and G. Monaco and L. Moscardelli},
CHAPTER = {Game-Theoretic Approaches to Optimization Problems in Communication Networks},
ALTEDITOR = {},
PAGES = {241-264},
OPTADDRESS = {},
EDITION = {A. Koster and X. Muñoz},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {EATCS Texts in Theoretical Computer Science},
OPTTYPE = {},
VOLUME = {XXVII},
URL = {http://www.springer.com/computer/foundations/book/978-3-642-02249-4},
PDF = {http://www.gianpieromonaco.com/293chap-selfish.pdf},
ABSTRACT = {In this chapter we consider fundamental communication
problems arising in networks with non-cooperative users. The
uncoordinated usersÃ¢Â€Â™ behavior, addressing communication
primitives in an individualistic and selfish manner, poses several
intriguing questions ranging from the definition of reasonable and
practical models, to the quantification of the efficiency loss due to
the lack of users' cooperation. We present several results lately
achievied in this research area and propose interesting future
research directions. }
}
@INBOOK{SaZe09,
PUBLISHER = {Springer},
TITLE = {Graphs and Algorithms in Communication Networks: Studies
in Broadband, Optical, Wireless, and Ad Hoc Networks},
YEAR = {2009},
AUTHOR = {I. Sau and J. Zerovnik},
CHAPTER = {Permutation Routing and $(\ell,k)$-Routing on Plane Grids},
ALTEDITOR = {},
PAGES = {265-279},
OPTADDRESS = {},
EDITION = {A. Koster and X. Muñoz},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {EATCS Texts in Theoretical Computer Science},
OPTTYPE = {},
VOLUME = {XXVII},
URL = {http://www.springer.com/computer/foundations/book/978-3-642-02249-4},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/SaZe09.pdf},
ABSTRACT = {The packet routing problem plays an essential role in
communication networks. It involves how to transfer data from some
origins to some destinations within a reasonable amount of time. In
the $(\ell,k)$-routing problem, each node can send at most $\ell$
packets and receive at most $k$ packets. Permutation routing is the
particular case $\ell=k=1$. In the $r$-centralrouting problem, all
nodes at distance at most $r$ from a fixed node $v$ want to send a
packet to $v$.Here we survey the results on permutation routing, the
$r$-central routing and the general $(\ell,k)$-routing problems on
plane grids, that is square grids, triangular grids and hexagonal
grids. We assume the \emph{store-and-forward} $\Delta$-port model,
and we consider both full and half-duplex networks.}
}
@ARTICLE{ABR09,
AUTHOR = {L. Addario-Berry and N. Broutin and B. Reed},
JOURNAL = {Random Structures and Algorithms},
TITLE = {Critical random graphs and the structure of a minimum
spanning tree},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {323--347},
VOLUME = {35},
URL = {http://portal.acm.org/citation.cfm?id=1598965},
PDF = {algo.inria.fr/broutin/pub/AdBrRe2009a.pdf},
ABSTRACT = {We consider the complete graph on n vertices whose edges
are weighted by independent and identically distributed edge weights
and build the associated minimum weight spanning tree. We show that
if the random weights are all distinct, then the expected diameter of
such a tree is Î˜(n1-3). This settles a question of Frieze and
Mc-Diarmid (Random Struct Algorithm 10 (1997), 5â€“42). The proofs
are based on a precise analysis of the behavior of random graphs
around the critical point. Â© 2008 Wiley Periodicals, Inc. Random
Struct. Alg., 2009}
}
@ARTICLE{AdRe09,
AUTHOR = {L. Addario-Berry and B. Reed},
JOURNAL = {Annals of Probability},
TITLE = {Minima in branching random walks},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1044--1079},
VOLUME = {37},
URL = {http://arxiv.org/abs/0712.2582},
PDF = {http://arxiv.org/pdf/0712.2582v3},
ABSTRACT = {Given a branching random walk, let $M_n$ be the minimum
position of any member of the $n$th generation. We calculate
$\mathbf{E}M_n$ to within O(1) and prove exponential tail bounds for
$\mathbf{P}\{|M_n-\mathbf{E}M_n|>x\}$, under quite general conditions
on the branching random walk. In particular, together with work by
Bramson [Z. Wahrsch. Verw. Gebiete 45 (1978) 89--108], our results
fully characterize the possible behavior of $\mathbf {E}M_n$ when the
branching random walk has bounded branching and step size.}
}
@ARTICLE{AHP09,
AUTHOR = {O. Amini and F. Huc and S. Pérennes},
JOURNAL = {SIAM Journal of Discrete Mathematics},
TITLE = {On the pathwidth of planar graphs},
YEAR = {2009},
MONTH = {August},
OPTNOTE = {},
NUMBER = {3},
PAGES = {1311-1316},
VOLUME = {23},
URL = {http://dx.doi.org/10.1137/060670146},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHP07.pdf},
ABSTRACT = {In this paper, we present a result concerning the
relation between the path-with of a planar graph and the path-width
of its dual. More precisely, we prove that for a 3-connected planar
graph $G$, $pw(G) \leq 3pw(G^*)+2$. For $4$-connected planar graphs,
and more generally for Hamiltonian planar graphs, we prove a stronger
bound $\pw(G^*) \leq 2 \ \pw(G)+c$. The best previously known bound
was obtained by Fomin and Thilikos who proved that $\pw(G^*) \leq 6 \
\pw(G)+cte$. The proof is based on an algorithm which, given a fixed
spanning tree of $G$, transforms any given decomposition of $G$ into
one of $G^*$. The ratio of the corresponding parameters is bounded by
the maximum degree of the spanning tree. }
}
@ARTICLE{AMN+09,
AUTHOR = {O. Amini and F. Mazoit and N. Nisse and S. Thomassé},
JOURNAL = {Discrete Mathematics},
TITLE = {Submodular partition functions},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {20},
PAGES = {6000-6008},
VOLUME = {309},
URL = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/},
ABSTRACT = {Adapting the method introduced in Graph Minors X, we
propose a new proof of the duality between the bramble-number of a
graph and its tree-width. Our approach is based on a new definition
of submodularity on partition functions which naturally extends the
usual one on set functions. The proof does not rely on Menger's
theorem, and thus greatly generalises the original one. It thus
provides a dual for matroid tree-width. One can also derive all known
dual notions of other classical width-parameters from it.}
}
@ARTICLE{APS09,
AUTHOR = {O. Amini and S. Pérennes and I. Sau},
JOURNAL = {Theoretical Computer Science},
TITLE = {Hardness and Approximation of Traffic Grooming},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {38-40},
PAGES = {3751-3760},
VOLUME = {410},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/APS09.pdf},
ABSTRACT = {Traffic grooming is a central problem in optical
networks. It refers to packing low rate signals into higher speed
streams, in order to improve bandwidth utilization and reduce network
cost. In WDM networks, the most accepted criterion is to minimize the
number of electronic terminations, namely the number of SONET
Add-Drop Multiplexers (ADMs). In this article we focus on ring and
path topologies. On the one hand, we provide an inapproximability
result for Traffic Grooming for fixed values of the grooming factor
g, answering authorrmatively the conjecture of Chow and Lin
(Networks, 44:194-202, 2004 ). More precisely, we prove that Ring
Traffic Grooming for fixed $g\leq 1$ and Path Traffic Grooming for
fixed $g \leq 2$ are Apx-complete. That is, they do not accept a PTAS
unless P = NP. Both results rely on the fact that finding the maximum
number of edge-disjoint triangles in a tripartite graph (and more
generally cycles of length $2g + 1$ in a $(2g + 1)$-partite graph of
girth $2g + 1$) is Apx-complete. On the other hand, we provide a
polynomial-time approximation algorithm for Ring and Path Traffic
Grooming, based on a greedy cover algorithm, with an approximation
ratio independent of $g$. Namely, the approximation guarantee is
${\mathcal O} (n^{1/3}\log^2(n))$ for any $g\leq 1$, $n$ being the
size of the network. This is useful in practical applications, since
in backbone networks the grooming factor is usually greater than the
network size. Finally, we improve this approximation ratio under some
extra assumptions about the request graph.}
}
@ARTICLE{BCY09,
AUTHOR = {J-C. Bermond and R. Correa and M.-L. Yu},
JOURNAL = {Discrete Mathematics},
TITLE = {Optimal Gathering Protocols on Paths under Interference
Constraints},
YEAR = {2009},
MONTH = {September},
NOTE = {A preliminary version has been presented at CIAC06},
NUMBER = {18},
PAGES = {5574-5587},
VOLUME = {309},
URL = {http://dx.doi.org/10.1016/j.disc.2008.04.037},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BCY08.pdf},
ABSTRACT = {We study the problem of gathering information from the
nodes of a multi-hop radio network into a predefined destination node
under reachability and interference constraints. In such a network, a
node is able to send messages to other nodes within reception
distance, but doing so it might create interference with other
communications. Thus, a message can only be properly received if the
receiver is reachable from the sender and there is no interference
from another message being transmitted simultaneously. The network is
modeled as a graph, where the vertices represent the nodes of the
network and the edges, the possible communications. The interference
constraint is modeled by a fixed integer d?1, which implies that
nodes within distance d in the graph from one sender cannot receive
messages from another node. In this paper, we suppose that each node
has one unit-length message to transmit and, furthermore, we suppose
that it takes one unit of time (slot) to transmit a unit-length
message and during such a slot we can have only calls which do not
interfere (called compatible calls). A set of compatible calls is
referred to as a round. We give protocols and lower bounds on the
minimum number of rounds for the gathering problem when the network
is a path and the destination node is either at one end or at the
center of the path. These protocols are shown to be optimal for any d
in the first case, and for 1?d?4, in the second case.}
}
@ARTICLE{BBR09,
AUTHOR = {E. Birmelé and J. A. Bondy and B. Reed},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Tree-width of graphs without a 3 by 3 grid minor},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {2577--2598},
VOLUME = {157},
URL = {http://portal.acm.org/citation.cfm?id=1553060},
PDF = {http://stat.genopole.cnrs.fr/Members/ebirmele/page-web/publications-1/BBRGrid.pdf},
ABSTRACT = {We show that graphs with no minor isomorphic to the 3x3
grid have tree-width at most 7.}
}
@ARTICLE{CHS09,
AUTHOR = {R. Correa and F. Havet and J-S. Sereni},
JOURNAL = {Australasian Journal of Combinatorics},
TITLE = {About a Brooks-type theorem for improper colouring},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {219--230},
VOLUME = {43},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHS09.pdf},
ABSTRACT = {A graph is $k$-improperly \l-colourable if its vertices
can be partitioned into \l parts such that each part induces a
subgraph of maximum degree at most $k$. A result of Lov\'asz states
that for any graph $G$, such a partition exists if
$\l\ge\left\lceil\frac{\Delta(G)+1}{k+1}\right\rceil$. When $k=0$,
this bound can be reduced by Brooks' Theorem, unless $G$ is complete
or an odd cycle. We study the following question, which can be seen
as a generalisation of the celebrated Brooks' Theorem to improper
colouring: does there exist a polynomial-time algorithm that decides
whether a graph $G$ of maximum degree $\Delta$ has $k$-improper
chromatic number at most $\lceil \frac{\Delta + 1}{k + 1} \rceil -
1$? We show that the answer is no, unless $\mathcal P = \mathcal NP$,
when $\Delta = \ell(k + 1)$, $k \geq 1$ and $\ell + \sqrt{\ell} \leq
2k + 3$. We also show that, if $G$ is planar, $k=1$ or $k=2$, $\Delta
= 2k + 2$, and $\ell = 2$, then the answer is still no, unless
$\mathcal P = \mathcal NP$. These results answer some questions of
Cowen et al. [Journal of Graph Theory 24(3):205-219, 1997].}
}
@ARTICLE{FFN09,
AUTHOR = {F. V. Fomin and P. Fraigniaud and N. Nisse},
JOURNAL = {Algorithmica},
TITLE = {Nondeterministic Graph Searching: From Pathwidth to
Treewidth},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {358-373},
VOLUME = {53},
URL = {http://www.springerlink.com/content/42g5tp1588w89186/},
PDF = {http://www.springerlink.com/content/42g5tp1588w89186/fulltext.pdf},
ABSTRACT = {We introduce nondeterministic graph searching with a
controlled amount of nondeterminism and show how this new tool can be
used in algorithm design and combinatorial analysis applying to both
pathwidth and treewidth. We prove equivalence between this
game-theoretic approach and graph decompositions called q -branched
tree decompositions, which can be interpreted as a parameterized
version of tree decompositions. Path decomposition and (standard)
tree decomposition are two extreme cases of q-branched tree
decompositions. The equivalence between nondeterministic graph
searching and q-branched tree decomposition enables us to design an
exact (exponential time) algorithm computing q-branched treewidth for
all q, which is thus valid for both treewidth and pathwidth. This
algorithm performs as fast as the best known exact algorithm for
pathwidth. Conversely, this equivalence also enables us to design a
lower bound on the amount of nondeterminism required to search a
graph with the minimum number of searchers.}
}
@ARTICLE{Gal09,
AUTHOR = {J. Galtier},
JOURNAL = {Wireless Networks},
TITLE = {Real-time resource allocation for LEO satellite
constellations},
YEAR = {2009},
MONTH = {August},
OPTNOTE = {},
NUMBER = {6},
PAGES = {791-803},
VOLUME = {15},
PUBLISHER = {Springer},
URL = {http://dx.doi.org/10.1007/s11276-007-0075-0},
ABSTRACT = {The paper addresses the need of controling the access of
terminals with guaranteed ressources on the high dynamic systems
offered by LEO satellite constellations. A call-access-control scheme
that guarantees the reservation of permanent resources of satellite
constellations in $O(\sqrt{n}\log(n))$ time, where n is the number of
user present in the system, is described. A tradeoff between
computational time of call-access-control and optimization of the use
of the spectrum is identified. Some experimental results are
presented. }
}
@ARTICLE{GGR+09,
AUTHOR = {J. Geelen and B. Gerards and B. Reed and P. Seymour and
A. Vetta},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
TITLE = {On the odd-minor variant of Hadwiger's conjecture},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {20--29},
VOLUME = {99},
URL = {http://portal.acm.org/citation.cfm?id=1465824},
PDF = {http://www.math.princeton.edu/~pds/papers/oddhadwiger/paper.ps},
ABSTRACT = {A Kl-expansion consists of l vertex-disjoint trees,
every two of which are joined by an edge. We call such an expansion
odd if its vertices can be two-coloured so that the edges of the
trees are bichromatic but the edges between trees are monochromatic.
We show that, for every l, if a graph contains no odd Kl-expansion
then its chromatic number is View the MathML source. In doing so, we
obtain a characterization of graphs which contain no odd Kl-expansion
which is of independent interest. We also prove that given a graph
and a subset S of its vertex set, either there are k vertex-disjoint
odd paths with endpoints in S, or there is a set X of at most 2kâˆ’2
vertices such that every odd path with both ends in S contains a
vertex in X. Finally, we discuss the algorithmic implications of
these results.}
}
@ARTICLE{Gir09,
AUTHOR = {F. Giroire},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Order statistics and estimating cardinalities of massive
data sets},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {406-427},
VOLUME = {157},
URL = {http://dx.doi.org/10.1016/j.dam.2008.06.020},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir08.pdf},
ABSTRACT = {A new class of algorithms to estimate the cardinality of
very large multisets using constant memory and doing only one pass on
the data is introduced here. It is based on order statistics rather
than on bit patterns in binary representations of numbers. Three
families of estimators are analyzed. They attain a standard error of
using M units of storage, which places them in the same class as the
best known algorithms so far. The algorithms have a very simple
internal loop, which gives them an advantage in terms of processing
speed. For instance, a memory of only 12 kB and only few seconds are
sufficient to process a multiset with several million elements and to
build an estimate with accuracy of order 2 percent. The algorithms
are validated both by mathematical analysis and by experimentations
on real internet traffic.}
}
@ARTICLE{Hav09,
AUTHOR = {F. Havet},
JOURNAL = {Discrete Mathematics},
TITLE = {Choosability of the square of planar subcubic graphs
with large girth},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {3553--3563},
VOLUME = {309},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav07.pdf},
ABSTRACT = {We show that the choice number of the square of a
subcubic graph with maximum average degree less than $18/7$ is at
most $6$. As a corollary, we get that the choice number of the square
of a subcubic planar graph with girth at least $9$ is at most $6$. We
then show that the choice number of the square of a subcubic planar
graph with girth at least $13$ is at most $5$.}
}
@ARTICLE{HKM+09,
AUTHOR = {F. Havet and R. Kang and T. Müller and J.-S. Sereni},
JOURNAL = {Journal of Graph Theory},
TITLE = {Circular choosability},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {241--334},
VOLUME = {61},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HKM+09.pdf},
ABSTRACT = {We study circular choosability, a notion recently
introduced by Mohar and by Zhu. First, we provide a negative answer
to a question of Zhu about circular cliques. We next prove that
$\cch(G) = O\left( \ch(G) + \ln |V(G)| \right)$ for every graph $G$.
We investigate a generalisation of circular choosability, the
circular $f$-choosability, where $f$ is a function of the degrees. We
also consider the circular choice number of planar graphs. Mohar
asked for the value of $\tau := \sup {\cch(G) : G\text{ is planar}}$,
and we prove that $6\le\tau\le8$, thereby providing a negative answer
to another question of Mohar. We also study the circular choice
number of planar and outerplanar graphs with prescribed girth, and
graphs with bounded density.}
}
@ARTICLE{HKS09,
AUTHOR = {F. Havet and R. Kang and J.-S. Sereni},
JOURNAL = {Networks},
TITLE = {Improper Colouring of Unit Disk Graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {150--164},
VOLUME = {54},
ABSTRACT = {Motivated by a satellite communications problem, we
consider a generalised colouring problem on unit disk graphs. A
colouring is \emph{$k$-improper} if no more than $k$ neighbours of
every vertex have the same colour as that assigned to the vertex. The
\emph{$k$-improper chromatic number $\chi^k(G)$} is the least number
of colours needed in a $k$-improper colouring of a graph $G$. The
main subject of this work is analysing the complexity of computing
$\chi^k$ for the class of unit disk graphs and some related classes,
e.g.~hexagonal graphs and interval graphs. We show NP-completeness in
many restricted cases and also provide both positive and negative
approximability results. Due to the challenging nature of this topic,
many seemingly simple questions remain: for example, it remains open
to determine the complexity of computing $\chi^k$ for unit interval
graphs.}
}
@ARTICLE{HaTh09,
AUTHOR = {F. Havet and S. Thomassé},
JOURNAL = {Dicrete Applied Mathematics},
TITLE = {Complexity of $(p,1)$-total labelling},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {2859--2870},
VOLUME = {157},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaTh09.pdf},
ABSTRACT = {A {\it $(p,1)$-total labelling} of a graph $G=(V,E)$ is
a total coloring $L$ from $V\cup E$ into ${0,\dots ,l}$ such that
$|L(v)-L(e)|\geq p$ whenever an edge $e$ is incident to a vertex $v$.
The minimum $l$ for which $G$ admits a $(p,1)$-total labelling is
denoted by $\lambda_p(G)$. The case $p=1$ corresponds to the usual
notion of total colouring, which is NP-hard to compute even for cubic
bipartite graphs~\cite{MDSA94}. In this paper we assume $p\geq 2$. It
is easy to show that $\lambda_p(G)\geq \Delta +p-1$, where $\Delta$
is the maximum degree of $G$. Moreover, when $G$ is bipartite,
$\Delta +p$ is an upper bound for $\lambda_p(G)$, leaving only two
possible values. In this paper, we completely settle the
computational complexity of deciding whether $\lambda_p(G)$ is equal
to $\Delta +p-1$ or to $\Delta +p$ when $G$ is bipartite. This is
trivial when $\Delta \leq p$, polynomial when $\Delta =3$ and $p=2$,
and NP-complete in the remaining cases.}
}
@ARTICLE{HSZ09,
AUTHOR = {F. Huc and I. Sau and J. Zerovnik},
JOURNAL = {Journal of Interconnection Networks},
TITLE = {$(\ell,k)$-Routing on Plane Grids},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {27-57},
VOLUME = {10},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HSZ09.pdf},
ABSTRACT = {The packet routing problem plays an essential role in
communication networks. It involves how to transfer data from some
origins to some destinations within a reasonable amount of time. In
the $(\ell,k)$-routing problem, each node can send at most $\ell$
packets and receive at most $k$ packets. Permutation routing is the
particular case $\ell=k=1$. In the $r$-central routing problem, all
nodes at distance at most $r$ from a fixed node $v$ want to send a
packet to $v$. In this article we study the permutation routing, the
$r$-central routing and the general $(\ell,k)$-routing problems on
plane grids, that is square grids, triangular grids and hexagonal
grids. We use the \emph{store-and-forward} $\Delta$-port model, and
we consider both full and half-duplex networks. The main
contributions are the following: \begin{itemize} \item[1.] Tight
permutation routing algorithms on full-duplex hexagonal grids, and
half duplex triangular and hexagonal grids. \item[2.] Tight
$r$-central routing algorithms on triangular and hexagonal grids.
\item[3.] Tight $(k,k)$-routing algorithms on square, triangular and
hexagonal grids. \item[4.] Good approximation algorithms (in terms of
running time) for $(\ell,k)$-routing on square, triangular and
hexagonal grids, together with new lower bounds on the running time
of any algorithm using shortest path routing. \end{itemize} \noindent
All these algorithms are completely distributed, i.e. can be
implemented independently at each node. Finally, we also formulate
the $(\ell,k)$-routing problem as a \textsc{Weighted Edge Coloring}
problem on bipartite graphs.}
}
@ARTICLE{INS09,
AUTHOR = {D. Ilcinkas and N. Nisse and D. Soguet},
JOURNAL = {Distributed Computing},
TITLE = {The Cost of Monotonicity in Distributed Graph Searching},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {117-127},
VOLUME = {22},
URL = {http://www.springerlink.com/content/l8371258177lv2j0/},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/IlcinkasNisseSoguet.pdf},
ABSTRACT = {Blin et al. (TCS 2008) proposed a dis- tributed protocol
enabling the smallest possible num- ber of searchers to clear any
unknown graph in a de- centralized manner. However, the strategy that
is actu- ally performed lacks of an important property, namely the
monotonicity. This paper deals with the smallest number of searchers
that are necessary and sufficient to monotonously clear any unknown
graph in a decen- tralized manner. The clearing of the graph is
required to be connected, i.e., the clear part of the graph must
remain permanently connected, and monotone, i.e., the clear part of
the graph only grows. We prove that a dis- tributed protocol clearing
any unknown n-node graph in a monotone connected way, in a
decentralized set- ting, can achieve but cannot beat competitive
ratio of Theta(log n /n), compared with the centralized minimum
number of searchers. Moreover, our lower bound holds even in a
synchronous setting, while our constructive upper bound holds even in
an asynchronous setting.}
}
@ARTICLE{JP09,
AUTHOR = {A. Jarry and S. Pérennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Disjoint Path in symmetric Graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {90-97},
VOLUME = {157}
}
@ARTICLE{KLR09,
AUTHOR = {K. Kawarabayashi and O. Lee and B. Reed},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
TITLE = {Removable cycles in non-bipartite graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {30--38},
VOLUME = {99},
URL = {http://portal.acm.org/citation.cfm?id=1465820},
ABSTRACT = {In this paper we prove the following result. Suppose
that s and t are vertices of a 3-connected graph G such that G-s-t is
not bipartite and there is no cutset X of size three in G for which
some component U of G-X is disjoint from {s,t}. Then either (1) G
contains an induced path P from s to t such that G-V(P) is not
bipartite or (2) G can be embedded in the plane so that every odd
face contains one of s or t. Furthermore, if (1) holds then we can
insist that G-V(P) is connected, while if G is 5-connected then (1)
must hold and P can be chosen so that G-V(P) is 2-connected.}
}
@ARTICLE{KaRe09,
AUTHOR = {K. Kawarabayashi and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {Highly parity linked graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {215--225},
VOLUME = {29},
URL = {http://portal.acm.org/citation.cfm?id=1569773},
ABSTRACT = {A graph G is k-linked if G has at least 2k vertices, and
for any 2k vertices x 1,x 2, â€¦, x k ,y 1,y 2, â€¦, y k , G contains
k pairwise disjoint paths P 1, â€¦, P k such that P i joins x i and y
i for i = 1,2, â€¦, k. We say that G is parity-k-linked if G is
k-linked and, in addition, the paths P 1, â€¦, P k can be chosen such
that the parities of their length are prescribed. Thomassen [22] was
the first to prove the existence of a function f(k) such that every
f(k)-connected graph is parity-k-linked if the deletion of any 4k-3
vertices leaves a nonbipartite graph. In this paper, we will show
that the above statement is still valid for 50k-connected graphs.
This is the first result that connectivity which is a linear function
of k guarantees the ErdÅ‘s-PÃ³sa type result for parity-k-linked
graphs.}
}
@ARTICLE{KLN+09,
AUTHOR = {R. Klasing and Z. Lotker and A. Navarra and S. Pérennes},
JOURNAL = {Algorithmic Operations Research (AlgOR)},
TITLE = {From Balls and Bins to Points and Vertices},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {133-143},
VOLUME = {4},
ABSTRACT = {Given a graph $G = (V, E)$ with $|V| = n$, we consider
the following problem. Place $m = n$ points on the vertices of G
independently and uniformly at random. Once the points are placed,
relocate them using a bijection from the points to the vertices that
minimizes the maximum distance between the random place of the points
and their target vertices. We look for an upper bound on this maximum
relocation distance that holds with high probability (over the
initial placements of the points). For general graphs and in the case
$m \leq n$, we prove the $\#P$-hardness of the problem and that the
maximum relocation distance is ${\cal O}(\sqrt{n})$ with high
probability. We present a Fully Polynomial Randomized Approximation
Scheme when the input graph admits a polynomial-size family of
witness cuts while for trees we provide a 2-approximation algorithm.
Many applications concern the variation in which $m = (1 âˆ’ q)n for
some 0 < q < 1$. We provide several bounds for the maximum relocation
distance according to different graph topologies.}
}
@ARTICLE{LMRT09,
AUTHOR = {B. Lévêque and F. Maffray and B. Reed and N. Trotignon},
JOURNAL = {Theoretical Computer Science},
TITLE = {Coloring Artemis graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {2234--2240},
VOLUME = {410},
URL = {http://portal.acm.org/citation.cfm?id=1530984},
PDF = {www.lirmm.fr/~leveque/Publications/ColArtemis-TCS.pdf},
ABSTRACT = {We consider the class of graphs that contain no odd
hole, no antihole, and no ''prism'' (a graph consisting of two
disjoint triangles with three disjoint paths between them). We give
an algorithm that can optimally color the vertices of these graphs in
time O(n^2m).}
}
@ARTICLE{MSZ09b,
AUTHOR = {G. B. Mertzios and I. Sau and S. Zaks},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {A New Intersection Model and Improved Algorithms for
Tolerance Graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1800-1813},
VOLUME = {23},
URL = {http://dx.doi.org/10.1137/09075994X},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MSZ09b.pdf},
ABSTRACT = {Tolerance graphs model interval relations in such a way
that intervals can tolerate a certain degree of overlap without being
in conflict. This class of graphs, which generalizes in a natural way
both interval and permutation graphs, has attracted many research
efforts since their introduction in [10], as it finds many important
applications in constraint-based temporal reasoning, resource
allocation, and scheduling problems, among others. In this article we
propose the first non-trivial intersection model for general
tolerance graphs, given by three-dimensional parallelepipeds, which
extends the widely known intersection model of parallelograms in the
plane that characterizes the class of bounded tolerance graphs. Apart
from being important on its own, this new representation also enables
us to improve the time complexity of three problems on tolerance
graphs. Namely, we present optimal $O(n log n)$ algorithms for
computing a minimum coloring and a maximum clique, and an $O(n^2)$
algorithm for computing a maximum weight independent set in a
tolerance graph with $n$ vertices, thus improving the best known
running times $O(n^2)$ and $O(n^3)$ for these problems, respectively}
}
@ARTICLE{Nis09,
AUTHOR = {N. Nisse},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Connected graph searching in chordal graphs},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {12},
PAGES = {2603-2610},
VOLUME = {157},
URL = {http://portal.acm.org/citation.cfm?id=1553062},
PDF = {http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6TYW-4TC2RT8-1-5&_cdi=5629&_user=10&_orig=search&_coverDate=09%2F03%2F2008&_sk=999999999&view=c&wchp=dGLbVtb-zSkzV&md5=7b91cf0e2d0c8e82bebf037c73af4ad1&ie=/sdarticle.pdf},
ABSTRACT = {Graph searching was introduced by Parson [T. Parson,
Pursuit-evasion in a graph, in: Theory and Applications of Graphs,
in: Lecture Notes in Mathematics, Springer-Verlag, 1976, pp.
426--441]: given a contaminated graph G (e.g., a network containing a
hostile intruder), the search number s(G) of the graph G is the
minimum number of searchers needed to clear the graph (or to capture
the intruder). A search strategy is connected if, at every step of
the strategy, the set of cleared edges induces a connected subgraph.
The connected search number cs(G) of a graph G is the minimum k such
that there exists a connected search strategy for the graph G using
at most k searchers. This paper is concerned with the ratio between
the connected search number and the search number. We prove that, for
any chordal graph G of treewidth tw(G), cs(G)/s(G)=O(tw(G)). More
precisely, we propose a polynomial-time algorithm that, given any
chordal graph G, computes a connected search strategy for G using at
most (tw(G)+2)(2s(G)-1) searchers. Our main tool is the notion of
connected tree-decomposition. We show that, for any connected graph G
of chordality k, there exists a connected search strategy using at
most (tw(G)^{k/2}+2)(2s(T)-1) searchers where T is an optimal
tree-decomposition of G.}
}
@ARTICLE{NiSo09,
AUTHOR = {N. Nisse and D. Soguet},
JOURNAL = {Theoretical Computer Science},
TITLE = {Graph Searching with Advice},
YEAR = {2009},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {14},
PAGES = {1307-1318},
VOLUME = {410},
URL = {http://www.springerlink.com/content/10t1l145m1182477/},
PDF = {http://www.springerlink.com/content/10t1l145m1182477/fulltext.pdf},
ABSTRACT = {Fraigniaud et al. [L. Blin, P. Fraigniaud, N. Nisse, S.
Vial, Distributing chasing of network intruders, in: 13th Colloquium
on Structural Information and Communication Complexity, SIROCCO, in:
LNCS, vol. 4056, Springer-Verlag, 2006, pp. 70--84] introduced a new
measure of difficulty for a distributed task in a network. The
smallest number of bits of advice of a distributed problem is the
smallest number of bits of information that has to be available to
nodes in order to accomplish the task efficiently. Our paper deals
with the number of bits of advice required to perform efficiently the
graph searching problem in a distributed setting. In this variant of
the problem, all searchers are initially placed at a particular node
of the network. The aim of the team of searchers is to clear a
contaminated graph in a monotone connected way, i.e., the cleared
part of the graph is permanently connected, and never decreases while
the search strategy is executed. Moreover, the clearing of the graph
must be performed using the optimal number of searchers, i.e. the
minimum number of searchers sufficient to clear the graph in a
monotone connected way in a centralized setting. We show that the
minimum number of bits of advice permitting the monotone connected
and optimal clearing of a network in a distributed setting is
$\Theta(nlogn)$, where n is the number of nodes of the network. More
precisely, we first provide a labelling of the vertices of any graph
G, using a total of O(nlogn) bits, and a protocol using this
labelling that enables the optimal number of searchers to clear G in
a monotone connected distributed way. Then, we show that this number
of bits of advice is optimal: any distributed protocol requires
$\Omega(nlogn)$ bits of advice to clear a network in a monotone
connected way, using an optimal number of searchers.}
}
@INBOOK{AdRe08,
PUBLISHER = {Springer},
TITLE = {Horizons of Combinatorics},
YEAR = {2008},
AUTHOR = {L. Addario-Berry and B. Reed},
CHAPTER = {Ballot Theorems, Old and New},
ALTEDITOR = {},
PAGES = {9-35},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Bolyai Society Mathematical Studies},
OPTTYPE = {},
VOLUME = {17}
}
@INCOLLECTION{NPC08,
AUTHOR = {N. Nepomuceno and P.R. Pinheiro and A.L.V. Coelho},
BOOKTITLE = {Recent Advances in Evolutionary Computation for Combinatorial Optimization},
PUBLISHER = {Springer},
TITLE = {A Hybrid Optimization Framework for Cutting and Packing
Problems: Case Study on Constrained 2D Non-guillotine Cutting},
YEAR = {2008},
OPTADDRESS = {},
CHAPTER = {6},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {87-99},
SERIES = {Studies in Computational Intelligence},
OPTTYPE = {},
VOLUME = {153},
URL = {http://dx.doi.org/10.1007/978-3-540-70807-0_6},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC08.pdf},
ABSTRACT = {This work presents a hybrid optimization framework for
tackling cutting and packing problems, which is based upon a
particular combination scheme between heuristic and exact methods. A
metaheuristic engine works as a generator of reduced instances for
the original optimization problem, which are formulated as
mathematical programming models. These instances, in turn, are solved
by an exact optimization technique (solver), and the performance
measures accomplished by the respective models are interpreted as
score (fitness) values by the metaheuristic, thus guiding its search
process. As a means to assess the potentialities behind the novel
approach, we provide an instantiation of the framework for dealing
specifically with the constrained two-dimensional non-guillotine
cutting problem. Computational experiments performed over standard
benchmark problems are reported and discussed here, evidencing the
effectiveness of the novel approach.}
}
@ARTICLE{ACH+08,
AUTHOR = {L. Addario-Berry and M. Chudnovsky and F. Havet and
B. Reed and P. Seymour},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
TITLE = {Bisimplicial vertices in even-hole-free graphs},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {1119--1164},
VOLUME = {98},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACH+08.pdf},
ABSTRACT = {A hole in a graph is an induced subgraph which is a
cycle of length at least four. A hole is called even if it has an
even number of vertices. An even-hole-free graph is a graph with no
even holes. A vertex of a graph is bisimplicial if the set of its
neighbours is the union of two cliques. In this paper we prove that
every even-hole-free graph has a bisimplicial vertex, which was
originally conjectured by Reed.}
}
@ARTICLE{ADR08,
AUTHOR = {L. Addario-Berry and K. Dalal and B. Reed},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Degree-Constrained Subgraphs},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1168-1174},
VOLUME = {156}
}
@ARTICLE{BBMM08,
AUTHOR = {Ben Ali, N. and B. Belghith and J. Moulierac and
M. Molnár},
JOURNAL = {Computer Communications},
TITLE = {QoS multicast aggregation under multiple additive
constraints},
YEAR = {2008},
MONTH = {September},
OPTNOTE = {},
NUMBER = {15},
PAGES = {3564-3578},
VOLUME = {31},
SERIES = {Elsevier},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/benali08qos.pdf},
ABSTRACT = {IP Multicast has been proposed in order to manage group
communications over the Internet in a bandwidth efficient manner.
Although such a proposition has been well studied, there are still
some inherent problems for its widespread deployment. In this paper,
we propose a new algorithm coined mQMA that deals with the two main
problems of traditional IP multicast, i.e., multicast forwarding
state scalability and multi-constrained QoS routing. The algorithm
mQMA is a QoS multicast aggregation algorithm which handles multiple
additive QoS constraints. It builds few trees and maintains few
forwarding states for the groups thanks to the technique of multicast
tree aggregation, which allows several groups to share the same
delivery tree. Moreover, the algorithm mQMA builds trees satisfying
multiple additive QoS constraints. We show via extensive simulations
that mQMA reduces dramatically the number of trees to be maintained
and reduces the utilization of the network resources, yet it
leverages the same overall QoS performances as Mamcra which is the
main known multi-constrained multicast routing algorithm.}
}
@ARTICLE{BCL08,
AUTHOR = {J-C. Bermond and D. Coudert and B. Lévêque},
JOURNAL = {Journal of Interconnection Networks (JOIN)},
TITLE = {Approximations for All-to-all Uniform Traffic Grooming
on Unidirectional Ring},
YEAR = {2008},
MONTH = {December},
OPTNOTE = {},
NUMBER = {4},
PAGES = {471-486},
VOLUME = {9},
URL = {http://dx.doi.org/10.1142/S0219265908002394},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCL-JOIN08.pdf},
ABSTRACT = {Traffic grooming in a WDM network consists of assigning
to each request (lightpath) a wavelength with the constraint that a
given wavelength can carry at most C requests or equivalently a
request uses at most 1/C of the bandwidth. C is known as the grooming
ratio. A request (lightpath) need two SONET add-drop multiplexers
(ADMs) at each end node~; using grooming different requests can share
the same ADM. The so called traffic grooming problem consists of
minimizing the total number of ADMs to be used (in order to reduce
the overall cost of the network). Here we consider the traffic
grooming problem in WDM unidirectional rings with all-to-all uniform
unitary traffic. This problem has been optimally solved for specific
values of the grooming ratio, namely C=2,3,4,5,6. In this paper we
present various simple constructions for the grooming problem
providing good approximation of the total number of ADMs. For that we
use the fact that the problem corresponds to a partition of the edges
of the complete graph into subgraphs, where each subgraph has at most
C edges and where the total number of vertices has to be minimized.}
}
@ARTICLE{BFNV08,
AUTHOR = {L. Blin and P. Fraigniaud and N. Nisse and S. Vial},
JOURNAL = {Theoretical Computer Science},
TITLE = {Distributed chasing of network intruders},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {12-37},
VOLUME = {399},
URL = {http://dx.doi.org/10.1016/j.tcs.2008.02.004},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Sirocco06VJ.ps},
ABSTRACT = {Graph searching is one of the most popular tools for
analyzing the chase for a powerful and hostile software agent (called
the "intruder"), by a set of software agents (called the "searchers")
in a network. The existing solutions for the graph searching problem
suffer however from a serious drawback: they are mostly centralized
and assume a global synchronization mechanism for the searchers. In
particular: (1) the search strategy for every network is computed
based on the knowledge of the entire topology of the network, and (2)
the moves of the searchers are controlled by a centralized mechanism
that decides at every step which searcher has to move, and what
movement it has to perform. This paper addresses the graph searching
problem in a distributed setting. We describe a distributed protocol
that enables searchers with logarithmic size memory to clear any
network, in a fully decentralized manner. The search strategy for the
network in which the searchers are launched is computed online by the
searchers themselves without knowing the topology of the network in
advance. It performs in an asynchronous environment, i.e., it
implements the necessary synchronization mechanism in a decentralized
manner. In every network, our protocol performs a connected strategy
using at most k+1 searchers, where k is the minimum number of
searchers required to clear the network in a monotone connected way
using a strategy computed in the centralized and synchronous setting.}
}
@ARTICLE{CF+08,
AUTHOR = {M. Cerioli and L. Faria and T. Ferreira and C. Martinhon and
F. Protti and B. Reed},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Partition into cliques for cubic graphs: Planar case,
complexity and approximation},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {2270-2278},
VOLUME = {156}
}
@ARTICLE{CCL07a,
AUTHOR = {R. Chand and M. Cosnard and L. Liquori},
JOURNAL = {Future Generation Computer Systems},
TITLE = {Powerful resource discovery for Arigatoni overlay
network},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {31--38},
VOLUME = {24},
PUBLISHER = {Elsevier},
URL = {http://dx.doi.org/10.1016/j.future.2007.02.009e},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fgcs-07.pdf}
}
@ARTICLE{FHRV08,
AUTHOR = {S. Fiorini and N. Hardy and B. Reed and A. Vetta},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Planar graph bipartization in linear time},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1175-1180},
VOLUME = {156},
ABSTRACT = {For each constant k, we present a linear time algorithm
that, given a planar graph G, either finds a minimum odd cycle vertex
transversal in G or guarantees that there is no transversal of size
at most k.}
}
@ARTICLE{FKNP07b,
AUTHOR = {M. Flammini and R. Klasing and A. Navarra and
S. Pérennes},
JOURNAL = {Wireless Networks},
TITLE = {Tightening the Upper Bound for the Minimum Energy
Broadcasting problem},
YEAR = {2008},
MONTH = {October},
NOTE = {Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005)},
NUMBER = {5},
PAGES = {659--669},
VOLUME = {14},
URL = {http://www.springerlink.com/content/l4262574u4802253/}
}
@ARTICLE{FMNP08,
AUTHOR = {M. Flammini and L. Moscardelli and A. Navarra and
S. Pérennes},
JOURNAL = {Theory of Computing Systems},
TITLE = {Asymptotically Optimal Solutions for Small World Graphs},
YEAR = {2008},
MONTH = {May},
OPTNOTE = {},
NUMBER = {4},
PAGES = {632-650},
VOLUME = {42},
URL = {http://www.springerlink.com/content/h42450h68063628g/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/FNMP08.pdf},
ABSTRACT = {We consider the problem of determining constructions
with an asymptotically optimal oblivious diameter in small world
graphs under the Kleinbergâ€™s model. In particular, we give the
first general lower bound holding for any monotone distance
distribution, that is induced by a monotone generating function.
Namely, we prove that the expected oblivious diameter is Î©(logâ€‰2
n) even on a path of n nodes. We then focus on deterministic
constructions and after showing that the problem of minimizing the
oblivious diameter is generally intractable, we give asymptotically
optimal solutions, that is with a logarithmic oblivious diameter, for
paths, trees and Cartesian products of graphs, including
d-dimensional grids for any fixed value of d.}
}
@ARTICLE{FoRe08,
AUTHOR = {N. Fountoulakis and B. Reed},
JOURNAL = {Random Structures and Algorithms},
TITLE = {The evolution of the mixing rate of a simple random walk
on the giant component of a random graph},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {68-86},
VOLUME = {33}
}
@ARTICLE{FrNi08,
AUTHOR = {P. Fraigniaud and N. Nisse},
JOURNAL = {Information and Computation},
TITLE = {Monotony Properties of Connected Visible Graph Searching},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {12},
PAGES = {1383-1393},
VOLUME = {206},
ABSTRACT = {{Search games are attractive for their correspondence
with classical width parameters. For instance, the \emph{invisible}
search number (a.k.a. \emph{node} search number) of a graph is equal
to its pathwidth plus~1, and the \emph{visible} search number of a
graph is equal to its treewidth plus~1. The \emph{connected} variants
of these games ask for search strategies that are connected, i.e., at
every step of the strategy, the searched part of the graph induces a
connected subgraph. We focus on \emph{monotone} search strategies,
i.e., strategies for which every node is searched exactly once. The
monotone connected visible search number of an $n$-node graph is at
most $O(\log n)$ times its visible search number. First, we prove
that this logarithmic bound is tight. Precisely, we prove that there
is an infinite family of graphs for which the ratio monotone
connected visible search number over visible search number is
$\Omega(\log n)$. Second, we prove that, as opposed to the
non-connected variant of visible graph searching, ``recontamination
helps" for connected visible search. Precisely, we prove that, for
any $k \geq 4$, there exists a graph with connected visible search
number at most $k$, and monotone connected visible search number
$>k$.}, url =
{http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2006.html}, pdf
=
{http://www-sop.inria.fr/members/Nicolas.Nisse/publications/WG06_nisse.ps},
OPTx-editorial-board={yes}, OPTx-proceedings={yes},
OPTx-international-audience={yes}, sorte = "rev-int", }
}
@ARTICLE{HSS08,
AUTHOR = {F. Havet and J.-S. Sereni and R. Skrekovski},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {3-facial colouring of plane graphs},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {231--247},
VOLUME = {22},
URL = {http://dx.doi.org/10.1137/060664124},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/HSS08.pdf},
ABSTRACT = {A plane graph is \l-facially $k$-colourable if its
vertices can be coloured with $k$ colours such that any two distinct
vertices on a facial walk of length at most \l are coloured
differently. We prove that every plane graph is $3$-facially
$11$-colourable. As a consequence, we derive that every $2$-connected
plane graph with maximum face-size at most $7$ is cyclically
$11$-colourable. These two bounds are for one off from those that are
proposed by the $(3\l+1)$-Conjecture and the Cyclic Conjecture.}
}
@ARTICLE{HTY08,
AUTHOR = {F. Havet and S. Thomassé and A. Yeo},
JOURNAL = {Discrete Mathematics},
TITLE = {Hoang-Reed conjecture for tournaments},
YEAR = {2008},
MONTH = {August},
OPTNOTE = {},
NUMBER = {15},
PAGES = {3412--3415},
VOLUME = {308},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HTY08.pdf},
ABSTRACT = {Ho\`ang-Reed conjecture asserts that every digraph $D$
has a collection $\cal C$ of circuits $C_1,\dots,C_{\delta ^+}$,
where $\delta ^+$ is the minimum outdegree of $D$, such that the
circuits of $\cal C$ have a forest-like structure. Formally,
$|V(C_i)\cap (V(C_1)\cup \dots \cup V(C_{i-1}))|\leq 1$, for all
$i=2,\dots ,\delta^+$. We verify this conjecture for the class of
tournaments.}
}
@ARTICLE{HaYu08,
AUTHOR = {F. Havet and M.-L. Yu},
JOURNAL = {Discrete Mathematics},
TITLE = {$(p,1)$-total labelling of graphs},
YEAR = {2008},
MONTH = {February},
OPTNOTE = {},
NUMBER = {4},
PAGES = {496--513},
VOLUME = {308},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaYu08.pdf},
ABSTRACT = {A $(p,1)$-total labelling of a graph $G$ is an
assignment of integers to $V(G)\cup E(G)$ such that: (i) any two
adjacent vertices of $G$ receive distinct integers, (ii) any two
adjacent edges of $G$ receive distinct integers, and (iii) a vertex
and its incident edge receive integers that differ by at least $p$ in
absolute value. The {\it span} of a $(p,1)$-total labelling is the
maximum difference between two labels. The minimum span of a
$(p,1)$-total labelling of $G$ is called the {\it $(p,1)$-total
number} and denoted by $\lambda_p^T(G)$. We provide lower and upper
bounds for the $(p,1)$-total number. In particular, generalizing the
Total Colouring Conjecture, we conjecture that $\lambda_p^T\leq
\Delta+ 2p - 1$ and give some evidences to support it. Finally, we
determine the exact value of $\lambda^T_p(K_n)$, except for even $n$
in the interval $[p+5, 6p2-10p+4]$ for which we show that
$\lambda_p^T(K_n) \in n+2p-3, n+2p-2$.}
}
@ARTICLE{KMS07,
AUTHOR = {R. J. Kang and T. Müller and J.-S. Sereni},
JOURNAL = {Discrete Mathematics},
TITLE = {Improper colouring of (random) unit disk graphs},
YEAR = {2008},
MONTH = {April},
NOTE = {The Special Issue devoted to EuroComb 2005},
OPTNUMBER = {},
PAGES = {1438--1454},
VOLUME = {308},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/KMS07.pdf}
}
@ARTICLE{KLRW08,
AUTHOR = {K. Kawarabayashi and O. Lee and B. Reed and P. Wollan},
JOURNAL = {Journal of Combinatorial Theory (Series B)},
TITLE = {A weaker version of Lovasz' path removable conjecture},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {972-979},
VOLUME = {98}
}
@ARTICLE{KaRe08a,
AUTHOR = {K. Kawarabayashi and B. Reed},
JOURNAL = {European Journal of Combinatorics},
TITLE = {Fractional coloring and the odd Hadwiger's conjecture},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {411-417},
VOLUME = {29},
ABSTRACT = {Gerards and Seymour (see [T.R. Jensen, B. Toft, Graph
Coloring Problems, Wiley-Interscience, 1995], page 115) conjectured
that if a graph has no odd complete minor of order p, then it is
(p-1)-colorable. This is an analogue of the well known conjecture of
Hadwiger, and in fact, this would immediately imply Hadwiger's
conjecture. The current best known bound for the chromatic number of
graphs without an odd complete minor of order p is O(plogp) by the
recent result by Geelen et al. [J. Geelen, B. Gerards, B. Reed, P.
Seymour, A. Vetta, On the odd variant of Hadwiger's conjecture
(submitted for publication)], and by Kawarabayashi [K. Kawarabayashi,
Note on coloring graphs without odd K"k-minors (submitted for
publication)] (but later). But, it seems very hard to improve this
bound since this would also improve the current best known bound for
the chromatic number of graphs without a complete minor of order p.
Motivated by this problem, we prove that the ''fractional chromatic
number'' of a graph G without odd K"p-minor is at most 2p; that is,
it is possible to assign a rational q(S)>=0 to every stable set SV(G)
so that "S"vq(S)=1 for every vertex v, and "Sq(S)2p. This generalizes
the result of Reed and Seymour [B. Reed, P.D. Seymour, Fractional
chromatic number and Hadwiger's conjecture, J. Combin. Theory Ser. B
74 (1998) 147-152] who proved that the fractional chromatic number of
a graph with no K"p"+"1-minor is at most 2p.}
}
@ARTICLE{KMP08,
AUTHOR = {R. Klasing and N. Morales and S. Pérennes},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the Complexity of Bandwidth Allocation in Radio
Networks},
YEAR = {2008},
MONTH = {October},
OPTNOTE = {},
NUMBER = {3},
PAGES = {225-239},
VOLUME = {406},
URL = {http://dx.doi.org/10.1016/j.tcs.2008.06.048},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/KMP08.pdf},
ABSTRACT = {"We define and study an optimization problem that is
motivated by bandwidth allocation in radio networks. Because radio
transmissions are subject to interference constraints in radio
networks, physical space is a common resource that the nodes have to
share in such a way, that concurrent transmissions do not interfere.
The bandwidth allocation problem we study under these constraints is
the following. Given bandwidth (traffic) demands between the nodes of
the network, the objective is to schedule the radio transmissions in
such a way that the traffic demands are satisfied. The problem is
similar to a multicommodity flow problem, where the capacity
constraints are replaced by the more complex notion of
non-interfering transmissions. We provide a formal specification of
the problem that we call round weighting. By modeling non-interfering
radio transmissions as independent sets, we relate the complexity of
round weighting to the complexity of various independent set problems
(e.g. maximum weight independent set, vertex coloring, fractional
coloring). From this relation, we deduce that in general, round
weighting is hard to approximate within n1âˆ’Îµ (n being the size of
the radio network). We also provide polynomial (exact or
approximation) algorithms e.g. in the following two cases: (a) when
the interference constraints are specific (for instance for a network
whose vertices belong to the Euclidean space), or (b) when the
traffic demands are directed towards a unique node in the network
(also called gathering, analogous to single commodity flow)."}
}
@ARTICLE{LMR08,
AUTHOR = {C. Linhares-Sales and F. Maffray and B. Reed},
JOURNAL = {SIAM Journal of Discrete Mathematics},
TITLE = {On Planar Quasi-Parity Graphs},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {329-347},
VOLUME = {22}
}
@ARTICLE{MaNi08,
AUTHOR = {F. Mazoit and N. Nisse},
JOURNAL = {Theoretical Computer Science},
TITLE = {Monotonicity of non-deterministic graph searching},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {169-178},
VOLUME = {399},
URL = {http://dx.doi.org/10.1016/j.tcs.2008.02.036},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Grasta06.pdf},
ABSTRACT = {In graph searching, a team of searchers are aiming at
capturing a fugitive moving in a graph. In the initial variant,
called invisible graph searching, the searchers do not know the
position of the fugitive until they catch it. In another variant, the
searchers permanently know the position of the fugitive, i.e. the
fugitive is visible. This latter variant is called visible graph
searching. A search strategy that catches any fugitive in such a way
that the part of the graph reachable by the fugitive never grows is
called monotone. A priori, monotone strategies may require more
searchers than general strategies to catch any fugitive. This is
however not the case for visible and invisible graph searching. Two
important consequences of the monotonicity of visible and invisible
graph searching are: (1) the decision problem corresponding to the
computation of the smallest number of searchers required to clear a
graph is in NP, and (2) computing optimal search strate gies is
simplified by taking into account that there exist some that never
backtrack. Fomin et al. [F.V. Fomin, P. Fraigniaud, N. Nisse,
Nondeterministic graph searching: From pathwidth to treewidth, in:
Proceedings of the 30th International Symposium on Mathematical
Foundations of Computer Science, MFCS 2005, pp. 364--375] introduced
an important graph searching variant, called non-deterministic graph
searching, that unifies visible and invisible graph searching. In
this variant, the fugitive is invisible, and the searchers can query
an oracle that permanently knows the current position of the
fugitive. The question of the monotonicity of non-deterministic graph
searching was however left open. In this paper, we prove that
non-deterministic graph searching is monotone. In particular, this
result is a unified proof of monotonicity for visible and invisible
graph searching. As a consequence, the decision problem corresponding
to non-deterministic graph searching belongs to NP. Moreover, the
exact algorithms designed by Fomin et al. do compute optimal
non-deterministic search strategies.}
}
@ARTICLE{McRe08,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {On the maximum degree of a random planar graph},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {591-601},
VOLUME = {17}
}
@ARTICLE{MeRe08,
AUTHOR = {C. Meagher and B. Reed},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Fractionally total colouring ${G}_{n,p}$},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1112-1124},
VOLUME = {156}
}
@ARTICLE{Ree08,
AUTHOR = {B. Reed},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Skew Partitions in Perfect Graphs},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1150-1156},
VOLUME = {156}
}
@ARTICLE{SaZe08,
AUTHOR = {I. Sau and J. Zerovnik},
JOURNAL = {Discrete Mathematics and Theoretical Computer Science},
TITLE = {An Optimal Permutation Routing Algorithm on Full-Duplex
Hexagonal Networks},
YEAR = {2008},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {49-62},
VOLUME = {10},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/SZ08.pdf},
ABSTRACT = {In the permutation routing problem, each processor is
the origin of at most one packet and the destination of no more than
one packet. The goal is to minimize the number of time steps required
to route all packets to their respective destinations, under the
constraint that each link can be crossed simultaneously by no more
than one packet. We study this problem in a hexagonal network, i.e. a
finite subgraph of a triangular grid, which is a widely used network
in practical applications. We present an optimal distributed
permutation routing algorithm for full-duplex hexagonal networks,
using the addressing scheme described by F.G. Nocetti, I.
Stojmenovi\'{c} and J. Zhang (IEEE TPDS 13(9): 962-971, 2002).
Furthermore, we prove that this algorithm is oblivious and
translation invariant.}
}
@ARTICLE{ADM+07,
AUTHOR = {L. Addario-Berry and K. Dalal and C. McDiarmid and
B. Reed and A. Thomason},
JOURNAL = {Combinatorica},
TITLE = {Vertex Colouring Edge Weightings},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1-12},
VOLUME = {27}
}
@ARTICLE{AHT07,
AUTHOR = {L. Addario-Berry and F. Havet and S. Thomassé},
JOURNAL = {Journal of Combinatorial Theory Ser. B},
TITLE = {Paths with two blocks in $n$-chromatic digraphs},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {620--626},
VOLUME = {97},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHT07.pdf}
}
@ARTICLE{ADL+07,
AUTHOR = {E. Alba and B. Dorronsoro and F. Luna and A.J. Nebro and
P. Bouvry and L. Hogie},
JOURNAL = {Computer Communications},
TITLE = {A cellular multi-objective genetic algorithm for optimal
broadcasting strategy in metropolitan MANETs},
YEAR = {2007},
MONTH = {August},
OPTNOTE = {},
NUMBER = {4},
PAGES = {685--697},
VOLUME = {30},
ADDRESS = {Newton, MA, USA},
PUBLISHER = {Butterworth-Heinemann},
URL = {http://www.springerlink.com/content/qk6747wq32478r42/fulltext.pdf},
ABSTRACT = {Mobile Ad-hoc Networks (MANETs) are composed of a set of
communicating devices which are able to spontaneously interconnect
without any pre-existing infrastructure. In such scenario,
broadcasting becomes an operation of capital importance for the own
existence and operation of the network. Optimizing a broadcast
strategy in MANETs is a multi-objective problem accounting for three
goals: reaching as many stations as possible, minimizing the network
utilization, and reducing the makespan. In this paper, we study the
fine-tuning of broadcast strategies by using a cellular
multi-objective genetic algorithm (cMOGA) that computes a Pareto
front of the solutions to empower a human designer with the ability
of choosing the preferred configuration for the network. We define
two formulations of the problem, one with three objectives and
another one with two objectives plus a constraint. Our experiments
using a complex and realistic MANET simulator reveal that using cMOGA
is a promising approach to solve the optimum broadcast problem.}
}
@ARTICLE{BLS07a,
AUTHOR = {R. Bayon and N. Lygeros and J.-S. Sereni},
JOURNAL = {Applied Mathematics E-Notes},
TITLE = {Orders with ten elements are circle orders},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {16--22},
VOLUME = {7},
URL = {http://www.math.nthu.edu.tw/~amen/},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/BLS07a.pdf}
}
@ARTICLE{BBC07,
AUTHOR = {J-C. Bermond and L. Braud and D. Coudert},
JOURNAL = {Theoretical Computer Science},
TITLE = {Traffic Grooming on the Path},
YEAR = {2007},
MONTH = {October},
OPTNOTE = {},
NUMBER = {2-3},
PAGES = {139-151},
VOLUME = {384},
URL = {http://dx.doi.org/10.1016/j.tcs.2007.04.028},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BBC-to-tcsa.pdf},
ABSTRACT = {In a WDM network, routing a request consists in
assigning it a route in the physical network and a wavelength. If
each request uses at most 1/C of the bandwidth of the wavelength, we
will say that the grooming factor is C. That means that on a given
edge of the network we can groom (group) at most C requests on the
same wavelength. With this constraint the objective can be either to
minimize the number of wavelengths (related to the transmission cost)
or minimize the number of Add Drop Multiplexers (shortly ADM) used in
the network (related to the cost of the nodes). We consider here the
case where the network is a path on N nodes, P_N. Thus the routing is
unique. For a given grooming factor C minimizing the number of
wavelengths is an easy problem, well known and related to the load
problem. But minimizing the number of ADM's is NP-complete for a
general set of requests and no results are known. Here we show how to
model the problem as a graph partition problem and using tools of
design theory we completely solve the case where C=2 and where we
have a static uniform all-to-all traffic (one request for each pair
of vertices).}
}
@ARTICLE{BFPP07,
AUTHOR = {J-C. Bermond and A. Ferreira and S. Pérennes and
J. Peters},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Neighbourhood Broadcasting in Hypercubes},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {823-843},
VOLUME = {21},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BFPP07.pdf},
ABSTRACT = {In the broadcasting problem, one node needs to broadcast
a message to all other nodes in a network. If nodes can only
communicate with one neighbor at a time, broadcasting takes at least
$\lceil \log_2 N \rceil$ rounds in a network of $N$ nodes. In the
neighborhood broadcasting problem, the node that is broadcasting
needs to inform only its neighbors. In a binary hypercube with $N$
nodes, each node has $\log_2 N$ neighbors, so neighborhood
broadcasting takes at least $\lceil \log_2 \log_2 (N+1) \rceil$
rounds. In this paper, we present asymptotically optimal neighborhood
broadcast protocols for binary hypercubes.}
}
@ARTICLE{BeYu07,
AUTHOR = {J-C. Bermond and M.-L. Yu},
JOURNAL = {Networks},
TITLE = {Vertex disjoint routings of cycles over tori},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {217-225},
VOLUME = {49},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BeYu07.pdf}
}
@ARTICLE{BBR07b,
AUTHOR = {E. Birmelé and J. A. Bondy and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {The Erdos-Posa property for long circuits},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {135-145},
VOLUME = {27}
}
@ARTICLE{CTY07,
AUTHOR = {P. Charbit and S. Thomassé and A. Yeo},
JOURNAL = {Combinatorics, Probability and Computing},
TITLE = {The minimum feedback arc set problem is NP-hard for
tournament},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--4},
VOLUME = {16}
}
@ARTICLE{CLM07,
AUTHOR = {A. Ciaffaglione and L. Liquori and M. Miculan},
JOURNAL = {JAR, Journal of Automated Reasoning},
TITLE = {Reasoning about Object-based Calculi in (Co)Inductive
Type Theory and the Theory of Contexts},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--47},
VOLUME = {39},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jar-07.pdf}
}
@ARTICLE{CDP+07,
AUTHOR = {D. Coudert and P. Datta and S. Perennes and H. Rivano and
M-E. Voge},
JOURNAL = {Parallel Processing Letters},
TITLE = {Shared Risk Resource Group: Complexity and
Approximability issues},
YEAR = {2007},
MONTH = {June},
OPTNOTE = {},
NUMBER = {2},
PAGES = {169-184},
VOLUME = {17},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CDP+-PPL06.pdf},
ABSTRACT = {This article investigates complexity and approximability
properties of combinatorial optimization problems yielded by the
notion of Shared Risk Resource Group (SRRG). SRRG has been introduced
in order to capture network survivability issues where a failure may
break a whole set of resources, and has been formalized as colored
graphs, where a set of resources is represented by a set of edges
with same color. We consider here the analogous of classical problems
such as determining paths or cuts with the minimum numbers of colors
or color disjoint paths. These optimization problems are much more
difficult than their counterparts in classical graph theory. In
particular standard relationship such as the Max Flow - Min Cut
equality do not hold any longer. In this article we identify cases
where these problems are polynomial, for example when the edges of a
given color form a connected subgraph, and otherwise give hardness
and non approximability results for these problems.}
}
@ARTICLE{CHS07,
AUTHOR = {D. Coudert and F. Huc and J.-S. Sereni},
JOURNAL = {Journal of Graph Theory},
TITLE = {Pathwidth of outerplanar graphs},
YEAR = {2007},
MONTH = {May},
OPTNOTE = {},
NUMBER = {1},
PAGES = {27-41},
VOLUME = {55},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHS-JGT06.pdf},
ABSTRACT = {We are interested in the relation between the pathwidth
of a biconnected outerplanar graph and the pathwidth of its
(geometric) dual. Bodlaender and Fomin, after having proved that the
pathwidth of every biconnected outerplanar graph is always at most
twice the pathwidth of its (geometric) dual plus two, conjectured
that there exists a constant c such that the pathwidth of every
biconnected outerplanar graph is at most c plus the pathwidth of its
dual. They also conjectured that this was actually true with c being
one for every biconnected planar graph. Fomin proved that the second
conjecture is true for all planar triangulations. First, we construct
for each p>=1 a biconnected outerplanar graph of pathwidth 2p 1 whose
(geometric) dual has pathwidth p 1, thereby disproving both
conjectures. Next, we also disprove two other conjectures (one of
Bodlaender and Fomin, implied by one of Fomin). Finally we prove, in
an algorithmic way, that the pathwidth of every biconnected
outerplanar graph is at most twice the pathwidth of its (geometric)
dual minus one. A tight interval for the studied relation is
therefore obtained, and we show that all cases in the interval
happen.}
}
@ARTICLE{FHRV07,
AUTHOR = {S. Fiorini and N. Hardy and B. Reed and A. Vetta},
JOURNAL = {Mathematical Programming Ser. B},
TITLE = {Approximate min-max relations for odd cycles in planar
graphs},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {71--91},
VOLUME = {110},
SERIES = {B}
}
@ARTICLE{FKNP07a,
AUTHOR = {M. Flammini and R. Klasing and A. Navarra and
S. Pérennes},
JOURNAL = {Algorithmica},
TITLE = {Improved approximation results for the Minimum Energy
Broadcasting problem},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {318-336},
VOLUME = {49},
URL = {http://dx.doi.org/10.1007/s00453-007-9077-7},
ABSTRACT = {In this paper we present new results on the performance
of the Minimum Spanning Tree heuristic for the Minimum Energy
Broadcast Routing (MEBR) problem. We first prove that, for any number
of dimensions dâ‰¥2, the approximation ratio of the heuristic does
not increase when the power attenuation coefficient Î±, that is the
exponent to which the coverage distance must be raised to give the
emission power, grows. Moreover, we show that, for any fixed
instance, as a limit for Î± going to infinity, the ratio tends to the
lower bound of Clementi et al., Wan et al. given by the d-dimensional
kissing number, thus closing the existing gap between the upper and
the lower bound. We then introduce a new analysis allowing to
establish a 7.45-approximation ratio for the 2-dimensional case, thus
significantly decreasing the previously known 12 upper bound
(actually corrected to 12.15 in Klasing et al.). Finally, we extend
our analysis to any number of dimensions dâ‰¥2 and any Î±â‰¥d,
obtaining a general approximation ratio of 3 d âˆ’1, again
independent of Î±. The improvements of the approximation ratios are
specifically significant in comparison with the lower bounds given by
the kissing numbers, as these grow at least exponentially with
respect to d.}
}
@ARTICLE{FoRe07,
AUTHOR = {N. Fountoulakis and B. Reed},
JOURNAL = {Probability Theory and Related Fields},
TITLE = {Faster Mixing and Small Bottlenecks},
YEAR = {2007},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {475-486},
VOLUME = {137}
}
@ARTICLE{GaLa07,
AUTHOR = {J. Galtier and A. Laugier},
JOURNAL = {Journal of Interconnection Networks},
TITLE = {Flow on data network and a positive semidefinite
representable delay function},
YEAR = {2007},
MONTH = {March},
OPTNOTE = {},
NUMBER = {1},
PAGES = {29--43},
VOLUME = {8},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GaLa07.pdf},
ABSTRACT = {Data networks are subject to congestion, thereby the
delay to go across the network may be large enough in order to
dishearten customers to keep on using such a network. In this paper
we address the problem of determining in a given network a routing
which minimizes the delay or keeps it under a certain bound. This
problem was already shown as complete. Our main contribution is to
study it in the special context of the positive semidefinite
programming and we present a column generation approach to solve the
underlying problem.}
}
@ARTICLE{GCN07,
AUTHOR = {L. Grigori and M. Cosnard and E. G. Ng},
JOURNAL = {BIT Numerical Mathematics},
TITLE = {On the row merge for sparse LU factorization with
partial pivoting},
YEAR = {2007},
MONTH = {March},
OPTNOTE = {},
NUMBER = {1},
PAGES = {45--76},
VOLUME = {47},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GCN07.pdf},
ABSTRACT = {We consider the problem of structure prediction for
sparse LU factorization with partial pivoting. In this context, it is
well known that the column elimination tree plays an important role
for matrices satisfying an irreducibility condition, called the
strong Hall property. Our primary goal in this paper is to address
the structure prediction problem for matrices satisfying a weaker
assumption, which is the Hall property. For this we consider the row
merge matrix, an upper bound that contains the nonzeros in L and U
for all possible row permutations that can be performed during the
numerical factorization with partial pivoting. We discuss the row
merge tree, a structure that represents information obtained from the
row merge matrix; that is, information on the dependencies among the
columns in Gaussian elimination with partial pivoting and on
structural upper bounds of the factors L and U. We present new
theoretical results that show that the nonzero structure of the row
merge matrix can be described in terms of branches and subtrees of
the row merge tree. These results lead to an efficient algorithm for
the computation of the row merge tree, that uses as input the
structure of A, and has a time complexity almost linear in the number
of nonzeros in A. We also investigate experimentally the usage of the
row merge tree for structure prediction purposes on a set of matrices
that satisfy only the Hall property. We analyze in particular the
size of upper bounds of the structure of L and U, the reordering of
the matrix based on a postorder traversal and its impact on the
factorization runtime. We show experimentally that for some matrices,
the row merge tree is a preferred alternative to the column
elimination tree.}
}
@ARTICLE{HLL07,
AUTHOR = {F. Honsell and M. Lenisa and L. Liquori},
JOURNAL = {Electronic Notes in Theoretical Computer Science},
TITLE = {A Framework for Defining Logical Frameworks},
YEAR = {2007},
OPTMONTH = {},
NOTE = {Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin},
OPTNUMBER = {},
PAGES = {399 - 436},
VOLUME = {172},
URL = {http://www.sciencedirect.com/science/article/B75H1-4N7RX2N-G/2/7c4694b4f44f7479705fd7df4e5a6ba0},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/plotkin-feist-07.pdf},
ABSTRACT = {" In this paper, we introduce a General Logical
Framework, called GLF, for defining Logical Frameworks, based on
dependent types, in the style of the well known Edinburgh Logical
Framework LF. The framework GLF features a generalized form of lambda
abstraction where [beta]-reductions fire provided the argument
satisfies a logical predicate and may produce an n-ary substitution.
The type system keeps track of when reductions have yet to fire. The
framework GLF subsumes, by simple instantiation, LF as well as a
large class of generalized constrained-based lambda calculi, ranging
from well known restricted lambda calculi, such as Plotkin's
call-by-value lambda calculus, to lambda calculi with patterns. But
it suggests also a wide spectrum of new calculi which have intriguing
potential as Logical Frameworks. We investigate the metatheoretical
properties of the calculus underpinning GLF and illustrate its
expressive power. In particular, we focus on two interesting
instantiations of GLF. The first is the Pattern Logical Framework
(PLF), where applications fire via pattern-matching in the style of
Cirstea, Kirchner, and Liquori. The second is the Closed Logical
Framework (CLF) which features, besides standard [beta]-reduction,
also a reduction which fires only if the argument is a closed term.
For both these instantiations of GLF we discuss standard
metaproperties, such as subject reduction, confluence and strong
normalization. The GLF framework is particularly suitable, as a
metalanguage, for encoding rewriting logics and logical systems,
where rules require proof terms to have special syntactic
constraints, e.g. logics with rules of proof, in addition to rules of
derivations, such as, e.g., modal logic, and call-by-value lambda
calculus."}
}
@ARTICLE{LiRo07,
AUTHOR = {L. Liquori and Ronchi Della Rocca, S.},
JOURNAL = {IC, Journal of Information and Computation},
TITLE = {Intersection Typed System à la Church},
YEAR = {2007},
MONTH = {September},
OPTNOTE = {},
NUMBER = {9},
PAGES = {1371--1386},
VOLUME = {205},
URL = {http://dx.doi.org/10.1016/j.ic.2007.03.005},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ic-07.pdf}
}
@INBOOK{BRS+06,
PUBLISHER = {Springer},
TITLE = {Topics in Discrete Mathematics, Dedicated to Jarik
Nesetril on the Occasion of his 60th birthday},
YEAR = {2006},
AUTHOR = {J. Bang-Jensen and B. Reed and M. Schacht and R. Sámal and
B. Toft and U. Wagner},
CHAPTER = {On six problems posed by Jarik Nesetril},
ALTEDITOR = {},
PAGES = {613--627},
ADDRESS = {Berlin},
EDITION = {M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas and P. Valtr},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Algorithms and Combinatorics},
OPTTYPE = {},
VOLUME = {26}
}
@INBOOK{BeCo06,
PUBLISHER = {Chapman & Hall- CRC Press, editors C.J. Colbourn and J.H. Dinitz},
TITLE = {Handbook of Combinatorial Designs (2nd edition)},
YEAR = {2006},
AUTHOR = {J-C. Bermond and D. Coudert},
CHAPTER = {VI.27, Grooming},
ALTEDITOR = {},
PAGES = {494-496},
OPTADDRESS = {},
OPTEDITION = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Discrete mathematics and Applications},
OPTTYPE = {},
VOLUME = {42},
URL = {http://www.cems.uvm.edu/~dinitz/hcd.html},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/BeCo06.pdf},
ABSTRACT = {State-of-the-art on traffic grooming with a design
theory approach}
}
@INCOLLECTION{AAG+06,
AUTHOR = {S. Alouf and E. Altman and J. Galtier and J.-F. Lalande and
C. Touati},
BOOKTITLE = {Combinatorial Optimization in Communication Networks},
PUBLISHER = {Kluwer Academic Publishers},
TITLE = {Quasi-Optimal Resource Allocation in Multi-Spot MFTDMA
Satellite Networks},
YEAR = {2006},
OPTADDRESS = {},
CHAPTER = {12},
OPTEDITION = {},
EDITOR = {M. Cheng and Y. Li and D.-Z. Du},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {325-366},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AAG+06.pdf}
}
@ARTICLE{BBDF06,
AUTHOR = {D. Bartha and P. Berthomé and M. Diallo and A. Ferreira},
JOURNAL = {Discrete Optimization},
TITLE = {Revisiting parametric multi-terminal problems: Maximum
flows, minimum cuts and cut-tree computations},
YEAR = {2006},
MONTH = {September},
OPTNOTE = {},
NUMBER = {3},
PAGES = {195--205},
VOLUME = {3}
}
@ARTICLE{BCG+06,
AUTHOR = {J. Becker and Z. Csizmadia and J. Galtier and A. Laugier and
J. Szabó and L. Szego},
JOURNAL = {Networks},
TITLE = {An integer programming approach to routing in Daisy
networks},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {116--121},
VOLUME = {47},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCG+06.pdf}
}
@ARTICLE{BGKM+06a,
AUTHOR = {J-C. Bermond and J. Galtier and R. Klasing and
N. Morales and S. Pérennes},
JOURNAL = {Parallel Processing Letters},
TITLE = {Hardness and approximation of Gathering in static radio
networks},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {165--183},
VOLUME = {16},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGK+06c.pdf},
ABSTRACT = {In this paper, we address the problem of gathering
information in a specific node (or \emph{sink}) of a radio network,
where interference constraints are present. We take into account the
fact that, when a node transmits, it produces interference in an area
bigger than the area in which its message can actually be received.
The network is modeled by a graph; a node is able to transmit one
unit of information to the set of vertices at distance at most $\dt$
in the graph, but when doing so it generates interference that does
not allow nodes at distance up to $\di$ ($\di \ge \dt$) to listen to
other transmissions. Time is synchronous and divided into time-steps
in each of which a round (set of non-interfering radio transmissions)
is performed. We give general lower bounds on the number of rounds
required to gather into a sink of a general graph, and present an
algorithm working on any graph, with an approximation factor of 4. We
also show that the problem of finding an optimal strategy for
gathering is \textsc{NP-hard}, for any values of $\di$ and $\dt$. If
$\di>\dt$, we show that the problem remains hard when restricted to
the uniform case where each vertex in the network has exactly one
piece of information to communicate to the sink. }
}
@ARTICLE{BHT06,
AUTHOR = {J-C. Bermond and F. Havet and D. Tóth},
JOURNAL = {Networks},
TITLE = {Fault tolerant on board networks with priorities},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {9--25},
VOLUME = {47},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHT06.pdf},
ABSTRACT = {We consider on-board networks in satellites
interconnecting entering signals (inputs) to amplifiers (outputs).
The connections are made via expensive switches, each of which has
four available links. The paths connecting inputs to outputs should
be link-disjoint. Some of the input signals, called priorities, must
be connected to the amplifiers which provide the best quality of
service (that is to some specific outputs). In practice, amplifiers
are prone to fail and the faults cannot be repaired. Therefore, extra
outputs have to be built into the network to ensure that every input
can be routed to operational outputs. Given three integers, $n$, $p$,
and $f$, we would like to design a low cost network (where the
network cost is proportional to the total number of switches) such
that it is possible to route all $n$ inputs to $n$ operational
amplifiers, and to route the $p$ priorities to the $p$ best quality
amplifiers for any set of $f$ faulty and $p$ best-quality amplifiers.
Let $R(n,p,f)$ be the minimum number of switches of such a network.
We prove here that $R(n,p,f)\leq \frac{n+f}{2} \lceil \log_2 p \rceil
+\frac{5}{2}(n-p) +g(f)$ with $g$ a function depending only on $f$.
We then compute $R(n,p,f)$ exactly for a few small values of $p$ and
$f$. }
}
@ARTICLE{BBH06,
AUTHOR = {S. Bessy and E. Birmelé and F. Havet},
JOURNAL = {Journal of Graph Theory},
TITLE = {Arc-chromatic number of digraphs in which each vertex
has bounded outdegree or bounded indegree},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {315--332},
VOLUME = {53},
URL = {http://www.inria.fr/rrrt/rr-5364.html},
PDF = {ftp://ftp.inria.fr/INRIA/publication/publi-pdf/RR/RR-5364.pdf}
}
@ARTICLE{MR2223630,
AUTHOR = {A. Bondy and J. Shen and S. Thomassé and C. Thomassen},
JOURNAL = {Combinatorica},
TITLE = {Density conditions for triangles in multipartite graphs},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {121--131},
VOLUME = {26}
}
@ARTICLE{DLL06,
AUTHOR = {D. J. Dougherty and P. Lescanne and L. Liquori},
JOURNAL = {Journal of Mathematical Structures in Computer Science},
TITLE = {Addressed Term Rewriting Systems: Application to a Typed
Object Calculus},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {667--709},
VOLUME = {16},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/mscs-06.pdf}
}
@ARTICLE{FNP06,
AUTHOR = {M. Flammini and A. Navarra and S. Pérennes},
JOURNAL = {ACM Journal of Experimental Algorithmics},
TITLE = {The Real Approximation Factor of the MST heuristic for
the Minimum Energy Broadcasting},
YEAR = {2006},
OPTMONTH = {},
NOTE = {(Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005))},
OPTNUMBER = {},
PAGES = {1--13},
VOLUME = {11}
}
@ARTICLE{Hav06a,
AUTHOR = {F. Havet},
JOURNAL = {Journal of Interconnection Networks},
TITLE = {Repartitors, selectors and superselectors},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {391--415},
VOLUME = {7},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav06a.pdf}
}
@ARTICLE{HaSe06,
AUTHOR = {F. Havet and J.-S. Sereni},
JOURNAL = {Journal of Graph Theory},
TITLE = {Improper choosability of graphs and maximum average
degree},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {181--199},
VOLUME = {52},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/HaSe06.pdf}
}
@ARTICLE{McRe06,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Random Structures and Algorithms},
TITLE = {Concentration for self-bounding functions and an
inequality of talagrand},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {549--557},
VOLUME = {29}
}
@ARTICLE{MGM06a,
AUTHOR = {J. Moulierac and A. Guitton and M. Molnár},
JOURNAL = {Journal of Communications (JCM)},
TITLE = {Hierarchical Aggregation of Multicast Trees in Large
Domains},
YEAR = {2006},
MONTH = {September},
OPTNOTE = {},
NUMBER = {1},
PAGES = {33--44},
VOLUME = {6},
SERIES = {Academy Publisher},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06hierarchical.pdf},
ABSTRACT = {Multicast tree aggregation is a technique that reduces
the control overhead and the number of states induced by multicast.
The main idea of this protocol is to route several groups to the same
distribution tree in order to reduce the total number of multicast
forwarding states. In this article, we show that this technique
cannot be applied to large domains. Indeed, when the number of border
routers is large, actual tree aggregation protocols are unable to
find similar groups to aggregate to the same tree. However, by
dividing the domain into several smaller sub-domains, we prove that
it is possible to achieve important savings. A hierarchical protocol
is designed to interconnect the trees of the sub-domains together.
While previous protocols cannot cope with more than 25 border
routers, our protocol still shows significant benefits for domains
with 200 border routers.}
}
@ARTICLE{TAG06,
AUTHOR = {C. Touati and E. Altman and J. Galtier},
JOURNAL = {Computer Networks},
TITLE = {Generalized Nash Bargaining Solution for bandwidth
allocation},
YEAR = {2006},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {3242--3263},
VOLUME = {50},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/TAG06.pdf}
}
@ARTICLE{MR2145514,
AUTHOR = {L. Addario-Berry and R. E. L. Aldred and K. Dalal and
B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Vertex colouring edge partitions},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {237--244},
VOLUME = {94}
}
@ARTICLE{MR2127410,
AUTHOR = {D. Avis and De Simone, C. and B. Reed},
JOURNAL = {Oper. Res. Lett.},
TITLE = {On the fractional chromatic index of a graph and its
complement},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {385--388},
VOLUME = {33}
}
@ARTICLE{BLS05,
AUTHOR = {R. Bayon and N. Lygeros and J.-S. Sereni},
JOURNAL = {Applied Mathematics E-Notes},
TITLE = {New progress in enumeration of mixed models},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {60--65},
VOLUME = {5},
URL = {http://www.math.nthu.edu.tw/~amen/},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/BLS05.pdf}
}
@ARTICLE{BCC+05,
AUTHOR = {J-C. Bermond and C. Colbourn and D. Coudert and G. Ge and
A. Ling and X. Muñoz},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Traffic Grooming in Unidirectional WDM Rings With
Grooming Ratio C=6},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {523-542},
VOLUME = {19},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCC+-DM05.pdf},
ABSTRACT = {SONET/WDM networks using wavelength add-drop
multiplexing can be constructed using certain graph decompositions
used to form a grooming, consisting of unions of primitive rings. The
cost of such a decomposition is the sum, over all graphs in the
decompositio n, of the number of vertices of nonzero degree in the
graph. The existence of such decompositions with minimum cost, when
every pair of sites employs no mo re than $\frac{1}{6}$~of the
wavelength capacity, is determined with a finite number of possible
exceptions. Indeed, when the number $N$ of sites satisfies $N \equiv
1 \pmod{3}$, the determination is complete, and when $N \equiv 2
\pmod{3}$, the only value le ft undetermined is $N = 17$. When $N
\equiv 0 \pmod{3}$, a finite number of values of $N$ remain, the
largest being $N = 2580$. The techniques developed rely heavily on
tools from combinatorial design theory.}
}
@ARTICLE{CJP05,
AUTHOR = {S. Choplin and A. Jarry and S. Pérennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Virtual network embedding in the cycle},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {368--375},
VOLUME = {145}
}
@ARTICLE{CKZ05a,
AUTHOR = {C. Cooper and R. Klasing and M. Zito},
JOURNAL = {Internet Mathematics},
TITLE = {Lower Bounds and Algorithms for Dominating Sets in Web
Graphs},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {275--300},
VOLUME = {2}
}
@ARTICLE{DLLL05,
AUTHOR = {D. J. Dougherty and P. Lescanne and L. Liquori and
F. Lang},
JOURNAL = {TERMGRAPH: International Workshop on Computing with Terms and Graphs. Electr. Notes Theor. Comput. Sci.},
TITLE = {Addressed Term Rewriting Systems: Syntax, Semantics, and
Pragmatics: Extended Abstract},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {57--82},
VOLUME = {127},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/termgraph-04.ps.gz}
}
@ARTICLE{MR2132584,
AUTHOR = {H. Everett and de Figueiredo, C. M. H. and S. Klein and
B. Reed},
JOURNAL = {Theor. Inform. Appl.},
TITLE = {The perfection and recognition of bull-reducible Berge
graphs},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {145--160},
VOLUME = {39}
}
@ARTICLE{MR2117935,
AUTHOR = {B. Farzad and M. Molloy and B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {$(\Delta-k)$-critical graphs},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {173--185},
VOLUME = {93}
}
@ARTICLE{FlPe05,
AUTHOR = {M. Flammini and S. Pérennes},
JOURNAL = {Information and Computation},
TITLE = {Lower bounds on systolic gossip},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {71--94},
VOLUME = {196}
}
@ARTICLE{LiRo05,
AUTHOR = {L. Liquori and S. Ronchi Della Rocca},
JOURNAL = {ITRS: Workshop on Intersection Types and Related Systems. Electr. Notes Theor. Comput. Sci.},
TITLE = {Towards an Intersection Typed System à la Church},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {43--56},
VOLUME = {136},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/itrs-04.ps.gz}
}
@ARTICLE{LiWa05,
AUTHOR = {L. Liquori and B. Wack},
JOURNAL = {WRLA: International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci.},
TITLE = {The Polymorphic Rewriting-calculus: [Type Checking vs.
Type Inference]},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {89--111},
VOLUME = {117},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/wrla-04.ps.gz}
}
@ARTICLE{MR2109199,
AUTHOR = {B. Reed and B. Sudakov},
JOURNAL = {Combinatorica},
TITLE = {List colouring when the chromatic number is close to the
order of the graph},
YEAR = {2005},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {117--123},
VOLUME = {25}
}
@ARTICLE{BCLY04,
AUTHOR = {J.-C. Bermond and C.J. Colbourn and A. Ling and M.-L. Yu},
JOURNAL = {Discrete Mathematics, Lindner's Volume},
TITLE = {Grooming in unidirectional rings : $K_4 -e$ designs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {57--62},
VOLUME = {284},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BCLY04.pdf}
}
@ARTICLE{BBH+04,
AUTHOR = {H.-J. Böckenhauer and D. Bongartz and J. Hromkovic and
R. Klasing and G. Proietti and S. Seibert and W. Unger},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the hardness of constructing minimal 2-connected
spanning subgraphs in complete graphs with sharpened triangle
inequality},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--3},
PAGES = {137--153},
VOLUME = {326}
}
@ARTICLE{CFKP+04,
AUTHOR = {I. Caragiannis and A. Ferreira and C. Kaklamanis and
S. Pérennes and P. Persiano and H. Rivano},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Approximate Constrained Bipartite Edge Coloring},
YEAR = {2004},
MONTH = {September},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {54--61},
VOLUME = {143},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/CFKP+04.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/CFKP+04.ps.gz},
ABSTRACT = {We study the following Constrained Bipartite Edge
Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of
maximum degree l with n vertices, in which some of the edges have
been legally colored with c colors. We wish to complete the coloring
of the edges of G minimizing the total number of colors used. The
problem has been proved to be NP-hard event for bipartite graphs of
maximum degree three. }
}
@ARTICLE{CJY04,
AUTHOR = {M. Cosnard and E. Jeannot and T. Yang},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Compact Dag Representation and its Symbolic Scheduling},
YEAR = {2004},
MONTH = {August},
OPTNOTE = {},
NUMBER = {8},
PAGES = {921--935},
VOLUME = {64}
}
@ARTICLE{CeHa04,
AUTHOR = {S. Céroi and F. Havet},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Trees with three leaves are $(n+1)$-unavoidable},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {19--39},
VOLUME = {141},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CeHa04.pdf}
}
@ARTICLE{MR2087864,
AUTHOR = {S. Dantas and de Figueiredo, C. M. H. and S. Klein and
S. Gravier and B. Reed},
JOURNAL = {Discrete Appl. Math.},
TITLE = {Stable skew partition problem},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {17--22},
VOLUME = {143}
}
@ARTICLE{MR2047529,
AUTHOR = {M. DeVos and G. Ding and B. Oporowski and D. P. Sanders and
B. Reed and P. Seymour and D. Vertigan},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Excluding any graph as a minor allows a low tree-width
2-coloring},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {25--41},
VOLUME = {91}
}
@ARTICLE{Fer04,
AUTHOR = {A. Ferreira},
JOURNAL = {IEEE Network},
TITLE = {Building a reference combinatorial model for MANETs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {24--29},
VOLUME = {18}
}
@ARTICLE{MR2089462,
AUTHOR = {G. Fertin and A. Raspaud and B. Reed},
JOURNAL = {J. Graph Theory},
TITLE = {Star coloring of graphs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {163--182},
VOLUME = {47}
}
@ARTICLE{FlPe04,
AUTHOR = {M. Flammini and S. Pérennes},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Lower Bounds on the Broadcasting and Gossiping Time of
Restricted Protocols},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {521--540},
VOLUME = {17},
PUBLISHER = {SIAM, Philadelphia, USA},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/FlPe04.pdf}
}
@ARTICLE{GPPR04,
AUTHOR = {C. Gavoille and D. Peleg and S. Pérennes and R. Raz},
JOURNAL = {Journal of Algorithms},
TITLE = {Distance labeling in Graphs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {85--112},
VOLUME = {53},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/GPPR04.pdf}
}
@ARTICLE{Hav04,
AUTHOR = {F. Havet},
JOURNAL = {Journal of Graph Theory},
TITLE = {Pancyclic arcs and connectivity in tournaments},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {87--110},
VOLUME = {47},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav04.pdf}
}
@ARTICLE{Hav04b,
AUTHOR = {F. Havet},
JOURNAL = {Discrete Mathematics},
TITLE = {Stable set meeting every longest path},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--3},
PAGES = {169--173},
VOLUME = {289},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav04b.pdf}
}
@ARTICLE{HaWe04,
AUTHOR = {F. Havet and M. Wennink},
JOURNAL = {Networks},
TITLE = {The Push Tree Problem},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {281--291},
VOLUME = {44},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaWe04.pdf}
}
@ARTICLE{MR2134417,
AUTHOR = {C. T. Hoàng and B. Reed},
JOURNAL = {SIAM J. Discrete Math.},
TITLE = {On the co-$P\sb 3$-structure of perfect graphs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {571--576 (electronic)},
VOLUME = {18}
}
@ARTICLE{KlLa04,
AUTHOR = {R. Klasing and C. Laforest},
JOURNAL = {Information Processing Letters},
TITLE = {Hardness results and approximation algorithms of
$k$-tuple domination in graphs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {75--83},
VOLUME = {89},
PUBLISHER = {Elsevier North-Holland, Inc.},
URL = {http://dx.doi.org/10.1016/j.ipl.2003.10.004}
}
@ARTICLE{MR2079904,
AUTHOR = {B. Reed and P. Seymour},
JOURNAL = {European J. Combin.},
TITLE = {Hadwiger's conjecture for line graphs},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {873--876},
VOLUME = {25}
}
@ARTICLE{MR2057781,
AUTHOR = {B. Reed and K. Smith and A. Vetta},
JOURNAL = {Oper. Res. Lett.},
TITLE = {Finding odd cycle transversals},
YEAR = {2004},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {299--301},
VOLUME = {32}
}
@ARTICLE{MR2065894,
AUTHOR = {B. Reed and S. W. Song and J. L. Szwarcfiter},
JOURNAL = {Discrete Appl. Math.},
TITLE = {Preface [Brazilian Symposium on Graphs, Algorithms and
Combinatorics]},
YEAR = {2004},
OPTMONTH = {},
NOTE = {Held in Fortaleza, 2001},
NUMBER = {1-3},
PAGES = {1},
VOLUME = {141}
}
@INBOOK{CoMu03,
PUBLISHER = {Research Signpost. Kerala, India},
TITLE = {Recent Research Developments in Optics, 3},
YEAR = {2003},
AUTHOR = {D. Coudert and X. Muñoz},
CHAPTER = {37, Graph Theory and Traffic Grooming in WDM Rings},
ALTEDITOR = {},
PAGES = {759-778},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
NOTE = {ISBN: 81-271-0028-5},
OPTNUMBER = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CoMu03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CoMu03.ps.gz},
ABSTRACT = {This paper has a double purpose. In the first part of
the paper we give an overview of different aspects of graph theory
which can be applied in communication engineering, not trying to
present immediate results to be applied neither a complete survey of
results, but to give a flavor of how graph theory can help research
in optical networks. The second part of this paper is a detailed
example of the usage of graph theory, but it is also a complete
survey of recent results in minimization of the number of add--drop
multiplexers (ADMs) required in a WDM ring with traffic grooming.}
}
@INCOLLECTION{MR1952984,
AUTHOR = {B. Reed},
BOOKTITLE = {Recent advances in algorithms and combinatorics},
PUBLISHER = {Springer},
TITLE = {Algorithmic aspects of tree width},
YEAR = {2003},
ADDRESS = {New York},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {85--107},
SERIES = {CMS Books Math./Ouvrages Math. SMC},
OPTTYPE = {},
VOLUME = {11}
}
@ARTICLE{BBPY03,
AUTHOR = {R. Balakhrishnan and J.-C. Bermond and P. Paulraja and
M.-L. Yu},
JOURNAL = {Discrete Mathematics},
TITLE = {On Hamilton cycle decompositions of the tensor product
of complete graphs},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {49--58},
VOLUME = {268},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBPY03.pdf}
}
@ARTICLE{BCRV03,
AUTHOR = {O. Barrientos and R. Correa and P. Reyes and
A. Valdebenito},
JOURNAL = {Comput. Optim. Appl.},
TITLE = {A Branch and Bound Method for Solving Integer Separable
Concave Problems},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {155--171},
VOLUME = {26},
ADDRESS = {Norwell, MA, USA},
PUBLISHER = {Kluwer Academic Publishers},
URL = {http://dx.doi.org/10.1023/A:1025746430535},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BCRV03.pdf},
ABSTRACT = {A branch and bound algorithm is proposed for solving
integer separable concave problems. The method uses Lagrangian
duality to obtain lower and upper bounds. We show that the dual
program of a separable concave problem is a linear program. Moreover,
we identify an excellent candidate to test on each region of the
branch and we show an optimality sufficient condition for this
candidate. Preliminary computational results are reported.}
}
@ARTICLE{BBPP03,
AUTHOR = {J.-C. Bermond and J. Bond and D. Peleg and S. Pérennes},
JOURNAL = {Discrete Applied Mathematics, Editor's Choice},
TITLE = {The power of small coalitions in graphs},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {399-414},
VOLUME = {127},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBPP03.pdf}
}
@ARTICLE{BeCe03,
AUTHOR = {J.-C. Bermond and S. Ceroi},
JOURNAL = {Networks},
TITLE = {Minimizing SONET ADMs in unidirectional WDM rings with
grooming ratio 3},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {83--86},
VOLUME = {41},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BeCe03.pdf}
}
@ARTICLE{BCP03,
AUTHOR = {J.-C. Bermond and S. Choplin and S. Pérennes},
JOURNAL = {Theory of Computing Systems},
TITLE = {Hierarchical ring networks design},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {663--682},
VOLUME = {36},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BCP03.pdf}
}
@ARTICLE{BCY03,
AUTHOR = {J-C. Bermond and D. Coudert and M-L. Yu},
JOURNAL = {Journal of Combinatorial Designs},
TITLE = {On DRC-Covering of $K_n$ by cycles},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {100-112},
VOLUME = {11},
URL = {http://dx.doi.org/10.1002/jcd.10040},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCY-JCD03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCY-JCD03.ps.gz},
ABSTRACT = {This paper considers the cycle covering of complete
graphs motivated by the design of survivable WDM networks, where the
requests are routed on sub-networks which are protected independently
from each other. The problem can be stated as follows~: for a given
graph $G$, find a cycle covering of the edge set of $K_n$, where
$V(K_n) = V(G)$, such that each cycle in the covering satisfies the
disjoint routing constraint (DRC), relatively to $G$, which can be
stated as follows~: to each edge of $K_n$ we associate in G a path
and all the paths associated to the edges of a cycle of the covering
must be vertex disjoint. Here we consider the case where $G = C_n$, a
ring of size $n$ and we want to minimize the number of cycles in the
covering. We give optimal solutions for the problem as well as for
variations of the problem, namely, its directed version and the case
when the cycle length is fixed to 4.}
}
@ARTICLE{BFIP03,
AUTHOR = {J.-C. Bermond and Di Ianni, M. and M. Flammini and
S. Pérennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Acyclic orientations for deadlock prevention in usual
networks},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {31--47},
VOLUME = {129},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDFP03.pdf}
}
@ARTICLE{BMPP03,
AUTHOR = {J.-C. Bermond and N. Marlin and D. Peleg and S. Pérennes},
JOURNAL = {Theoretical Computer Science},
TITLE = {Directed Virtual Path Layout in ATM networks},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {3--28},
VOLUME = {291},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BMPP03.pdf}
}
@ARTICLE{BFJ03a,
AUTHOR = {B. Bui-Xuan and A. Ferreira and A. Jarry},
JOURNAL = {International Journal of Foundations of Computer Science},
TITLE = {Computing shortest, fastest, and foremost journeys in
dynamic networks},
YEAR = {2003},
MONTH = {April},
OPTNOTE = {},
NUMBER = {2},
PAGES = {267--285},
VOLUME = {14}
}
@ARTICLE{MR1999215,
AUTHOR = {G. Calinescu and C. G. Fernandes and B. Reed},
JOURNAL = {J. Algorithms},
TITLE = {Multicuts in unweighted graphs and digraphs with bounded
degree and bounded tree-width},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {333--359},
VOLUME = {48}
}
@ARTICLE{CKLW03,
AUTHOR = {H. Cirstea and C. Kirchner and L. Liquori and B. Wack},
JOURNAL = {WRS, International Workshop on Reduction Strategies in Rewriting and Programming. Electr. Notes Theor. Comput. Sci.},
TITLE = {Rewrite strategies in the Rewriting Calculus},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
OPTPAGES = {},
VOLUME = {86},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/wrs-03.ps.gz}
}
@ARTICLE{CFPP+03,
AUTHOR = {A. Clementi and A. Ferreira and P. Penna and S. Pérennes and
R. Silvestri},
JOURNAL = {Algorithmica},
TITLE = {The Minimum Range Assignment Problem on Linear Radio
Networks},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {95--110},
VOLUME = {35},
KEY = {j}
}
@ARTICLE{FPRR+03,
AUTHOR = {A. Ferreira and S. Pérennes and A. W. Richa and
H. Rivano and N. Stier},
JOURNAL = {Telecommunication Systems},
TITLE = {Models, Complexity and Algorithms for the Design of
Multi-fiber WDM Networks},
YEAR = {2003},
MONTH = {October},
OPTNOTE = {},
NUMBER = {2},
PAGES = {123--138},
VOLUME = {24},
URL = {http://www.springerlink.com/content/m38310658021/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs03a.pdf},
ABSTRACT = {In this paper, we study multi-fiber optical networks
with wavelength division multiplexing (WDM). We extend the definition
of the well-known Wavelength Assignment Problem (WAP) to the case of
k fibers per link and w wavelengths per fiber, generalization that we
will call (k,w)-WAP. We develop a new model for the (k,w)-WAP based
on conflict hypergraphs. Furthermore, we consider two natural
optimization problems that arise from the (k,w)-WAP: minimizing the
number of fibers k given a number of wavelengths w, on one hand, and
minimizing w given k, on the other. We develop and analyze the
practical performance of two methodologies based on hypergraph
coloring. }
}
@ARTICLE{GHHN+03,
AUTHOR = {J. Galtier and F. Hurtado and M. Noy and S. Pérennes and
J. Hurrutia},
JOURNAL = {International Journal of Computational Geometry and Applications},
TITLE = {Simultaneous edge flipping in triangulations},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {113--133},
VOLUME = {13}
}
@ARTICLE{GLO03,
AUTHOR = {O. Goldschmidt and A. Laugier and E. Olinick},
JOURNAL = {Discrete Applied Math.},
TITLE = {SONET/SDH ring assignment with capacity constraints},
YEAR = {2003},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {99--128},
VOLUME = {129},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GLO03.pdf}
}
@ARTICLE{Hav03,
AUTHOR = {F. Havet},
JOURNAL = {Graphs and Combinatorics},
TITLE = {On unavoidability of trees with $k$ leaves},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {101--110},
VOLUME = {19},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav03.pdf}
}
@ARTICLE{MR2025948,
AUTHOR = {M. Loebl and J. Nesetril and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {A note on random homomorphism from arbitrary graphs to
$\mathbb Z$},
YEAR = {2003},
OPTMONTH = {},
NOTE = {EuroComb'01 (Barcelona)},
NUMBER = {1-3},
PAGES = {173--181},
VOLUME = {273}
}
@ARTICLE{MR2025949,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {Channel assignment on graphs of bounded treewidth},
YEAR = {2003},
OPTMONTH = {},
NOTE = {EuroComb'01 (Barcelona)},
NUMBER = {1-3},
PAGES = {183--192},
VOLUME = {273}
}
@ARTICLE{MR2146357,
AUTHOR = {B. Reed},
JOURNAL = {J. ACM},
TITLE = {The height of a random binary search tree},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {306--332 (electronic)},
VOLUME = {50}
}
@ARTICLE{TAG03c,
AUTHOR = {C. Touati and E. Altman and J. Galtier},
JOURNAL = {Game Theory and Applications},
TITLE = {Semi-definite programming approach for bandwidth
allocation and routing in networks},
YEAR = {2003},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {169--179},
VOLUME = {9},
PUBLISHER = {Nova}
}
@INCOLLECTION{Cos02,
AUTHOR = {M. Cosnard},
BOOKTITLE = {Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications},
PUBLISHER = {Kluwer Academic Publishers},
TITLE = {Introduction to the Complexity of Parallel Algorithms},
YEAR = {2002},
ADDRESS = {Boston (USA)},
CHAPTER = {1, part I},
OPTEDITION = {},
EDITOR = {R. Corrêa and I. Dutra and M. Fiallos and F. Gomes},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {3--25},
SERIES = {Applied Optimization},
OPTTYPE = {},
OPTVOLUME = {}
}
@INCOLLECTION{MR1940135,
AUTHOR = {L. Devroye and C. McDiarmid and B. Reed},
BOOKTITLE = {Mathematics and computer science, II (Versailles, 2002)},
PUBLISHER = {Birkhäuser},
TITLE = {Giant components for two expanding graph processes},
YEAR = {2002},
ADDRESS = {Basel},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {161--173},
SERIES = {Trends Math.},
OPTTYPE = {},
OPTVOLUME = {}
}
@INCOLLECTION{Fer02a,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Encyclopedia of Optimization},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {Parallel Computing: Models},
YEAR = {2002},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {C. Floudas and P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {}
}
@INCOLLECTION{FGP02,
AUTHOR = {A. Ferreira and J. Galtier and P. Penna},
BOOKTITLE = {Handbook of Wireless Networks and Mobile Computing},
PUBLISHER = {John Wiley and Sons},
TITLE = {Topological design, routing and hand-over in satellite
networks},
YEAR = {2002},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {I. Stojmenovic},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {473--507},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/FGP02.pdf}
}
@INCOLLECTION{FeGu02,
AUTHOR = {A. Ferreira and I. Guérin-Lassous},
BOOKTITLE = {Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications},
PUBLISHER = {Kluwer Academic Publishers},
TITLE = {Discrete Computing with Coarse Grained Systems},
YEAR = {2002},
ADDRESS = {Boston (USA)},
CHAPTER = {5, part I},
OPTEDITION = {},
EDITOR = {R. Corrêa and I. Dutra and M. Fiallos and F. Gomes},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {117--143},
SERIES = {Applied Optimization},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{BeDa02,
AUTHOR = {B. Beauquier and E. Darrot},
JOURNAL = {Parallel Processing Letters},
TITLE = {On Arbitrary Size Waksman Networks and their
Vulnerability},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
OPTPAGES = {},
VOLUME = {12},
PUBLISHER = {World Scientific}
}
@ARTICLE{BDD02,
AUTHOR = {J.-C. Bermond and E. Darrot and O. Delmas},
JOURNAL = {Networks},
TITLE = {Design of fault tolerant on-board networks in satellites},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {202--207},
VOLUME = {40},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDD02.pdf}
}
@ARTICLE{BHK+02,
AUTHOR = {H.-J. Böckenhauer and J. Hromkovic and R. Klasing and
S. Seibert and W. Unger},
JOURNAL = {Theoretical Computer Science},
TITLE = {Towards the Notion of Stability of Approximation for
Hard Optimization Tasks and the Traveling Salesman Problem},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {3--24},
VOLUME = {285}
}
@ARTICLE{CDF+02,
AUTHOR = {E. Caceres and F. Dehne and A. Ferreira and P. Flocchini and
I. Rieping and A. Roncato and N. Santoro and S. Song},
JOURNAL = {Algorithmica},
TITLE = {Efficient Parallel Graph Algorithms For Coarse Grained
Multicomputers and BSP},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {183--200},
VOLUME = {33}
}
@ARTICLE{CKL02,
AUTHOR = {H. Cirstea and C. Kirchner and L. Liquori},
JOURNAL = {WRLA, International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci.},
TITLE = {Rewriting Calculus with(out) Types},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
VOLUME = {71},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/wrla-02.ps.gz}
}
@ARTICLE{MR1909501,
AUTHOR = {C. Cooper and A. Frieze and B. Reed},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {Random regular graphs of non-constant degree:
connectivity and Hamiltonicity},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {249--261},
VOLUME = {11}
}
@ARTICLE{MR1918719,
AUTHOR = {C. Cooper and A. Frieze and B. Reed and O. Riordan},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {Random regular graphs of non-constant degree:
independence and chromatic number},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {323--341},
VOLUME = {11}
}
@ARTICLE{CFP02,
AUTHOR = {D. Coudert and A. Ferreira and S. Pérennes},
JOURNAL = {Networks (Wiley-Interscience)},
TITLE = {Isomorphisms of the De Bruijn Digraph and Free-Space
Optical Networks},
YEAR = {2002},
MONTH = {October},
OPTNOTE = {},
NUMBER = {3},
PAGES = {155-164},
VOLUME = {40},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-Networks-ac02.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-Networks-ac02.ps.gz},
ABSTRACT = {The de Bruijn digraph $B(d,D)$ has degree $d$, diameter
$D$, $d^D$ vertices and $d^{D+1}$ arcs. It is usually defined by
words of size $D$ on an alphabet of cardinality $d$, through a cyclic
left shift permutation on the words, after which the rightmost symbol
is changed. In this paper, we show that any digraph defined on words
of a given size, through an {\em arbitrary} permutation on the
alphabet {\bf and} an {\em arbitrary} permutation on the word
indices, is isomorphic to the de Bruijn digraph, provided that this
latter permutation is {\em cyclic}. We use this result to improve
from $O\left(d^{D+1}\right)$ to $\Theta\left(\sqrt{d^{D+1}}\right)$
the number of lenses required for the implementation of $B(d,D)$ by
the Optical Transpose Interconnection System proposed by Marsden {\em
et al.} (Optics Letters 18(13):1083-1085, July 1993).}
}
@ARTICLE{FGM+02,
AUTHOR = {A. Ferreira and I. Guérin-Lassous and K. Marcus and
A. Rau-Chaplin},
JOURNAL = {Concurrency and Computation - Practice and Experience},
TITLE = {Parallel Computation on Interval Graphs: Algorithms and
Experiments},
YEAR = {2002},
MONTH = {january},
OPTNOTE = {},
NUMBER = {1},
PAGES = {47--70},
VOLUME = {56}
}
@ARTICLE{Hav02a,
AUTHOR = {F. Havet},
JOURNAL = {Discrete Mathematics},
TITLE = {Trees in Tournament},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--3},
PAGES = {121--134},
VOLUME = {243},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Hav02a.pdf}
}
@ARTICLE{HaZe02,
AUTHOR = {F. Havet and J. Zerovnik},
JOURNAL = {Discrete Mathematics},
TITLE = {Finding a Five Bicolouring of a Triangle-Free Subgraph
of the Triangular Lattice},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {103--108},
VOLUME = {244}
}
@ARTICLE{MR1930121,
AUTHOR = {B. Reed and B. Sudakov},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Asymptotically the list colouring constants are 1},
YEAR = {2002},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {27--37},
VOLUME = {86}
}
@INCOLLECTION{MR1861358,
AUTHOR = {H. Everett and de Figueiredo, C. M. H. and
C. Linhares-Sales and F. Maffray and O. Porto and B. Reed},
BOOKTITLE = {Perfect graphs},
PUBLISHER = {Wiley},
TITLE = {Even pairs},
YEAR = {2001},
ADDRESS = {Chichester},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {67--92},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
OPTTYPE = {},
OPTVOLUME = {}
}
@INCOLLECTION{Fer01,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Encyclopedia of Optimization -- Vol. IV},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {Parallel Computing: Models},
YEAR = {2001},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {C. A. Floudas and P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {264--269},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@INCOLLECTION{MR1861360,
AUTHOR = {R. Hayward and B. Reed},
BOOKTITLE = {Perfect graphs},
PUBLISHER = {Wiley},
TITLE = {Forbidding holes and antiholes},
YEAR = {2001},
ADDRESS = {Chichester},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {113--137},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
OPTTYPE = {},
OPTVOLUME = {}
}
@INCOLLECTION{MR1861365,
AUTHOR = {B. Reed},
BOOKTITLE = {Perfect graphs},
PUBLISHER = {Wiley},
TITLE = {A gentle introduction to semi-definite programming},
YEAR = {2001},
ADDRESS = {Chichester},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {233--259},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
OPTTYPE = {},
OPTVOLUME = {}
}
@INCOLLECTION{MR1861356,
AUTHOR = {B. Reed},
BOOKTITLE = {Perfect graphs},
PUBLISHER = {Wiley},
TITLE = {From conjecture to theorem},
YEAR = {2001},
ADDRESS = {Chichester},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {13--24},
SERIES = {Wiley-Intersci. Ser. Discrete Math. Optim.},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{AlCo01,
AUTHOR = {J.-P. Allouche and M. Cosnard},
JOURNAL = {Acta Mathematica Hungarica},
TITLE = {Non-integer bases, iteration of continuous real maps,
and an arithmetic self-similar set},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {325--332},
VOLUME = {91}
}
@ARTICLE{ABJ+01,
AUTHOR = {E. Altman and E. Baçsar and T. Jiménez and N. Shimkin},
JOURNAL = {IEEE Trans. on Automatic Control},
TITLE = {Competitive Routing in Networks with Polynomial Cost},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {}
}
@ARTICLE{AJK01,
AUTHOR = {E. Altman and T. Jiménez and G. Koole},
JOURNAL = {PEIS},
TITLE = {Comparing tandem queueing systems and their fluid limits},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
OPTPAGES = {},
OPTVOLUME = {}
}
@ARTICLE{BDP01,
AUTHOR = {B. Beauquier and O. Delmas and S. Pérennes},
JOURNAL = {Journal of Interconnection Network},
TITLE = {Tight Bounds for Broadcasting in the Linear Cost Model},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {175--188},
VOLUME = {2},
PUBLISHER = {World Scientific}
}
@ARTICLE{BFGP01,
AUTHOR = {P. Bergé and A. Ferreira and J. Galtier and J.-N. Petit},
JOURNAL = {International Journal on Telecommunication Systems},
TITLE = {A Probabilistic Study of Inter-Satellite Links Load in
Polar Orbit Satellite Constellations},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {123--135},
VOLUME = {18},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BFGP01.pdf}
}
@ARTICLE{BMM01,
AUTHOR = {J.-C. Bermond and X. Muñoz and A. Marchetti-Spaccamela},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {A Broadcasting Protocol in Line Digraphs},
YEAR = {2001},
MONTH = {August},
OPTNOTE = {},
NUMBER = {8},
PAGES = {1013--1032},
VOLUME = {61},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BMM01.pdf}
}
@ARTICLE{CoJe01,
AUTHOR = {M. Cosnard and E. Jeannot},
JOURNAL = {Parallel Processing Letters},
TITLE = {Automatic Parallelization Techniques Based on Compact
DAG Extraction and Symbolic Scheduling},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {151--168},
VOLUME = {11}
}
@ARTICLE{DFR01,
AUTHOR = {M. Diallo and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Parallel Processing Letters},
TITLE = {A note on communication-efficient deterministic p aralle
algorithms for planar point location and 2D Voronoi diagram},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2/3},
PAGES = {327--340},
VOLUME = {11}
}
@ARTICLE{FGPR01,
AUTHOR = {A. Ferreira and J. Galtier and J.-N. Petit and H. Rivano},
JOURNAL = {Annals of Telecommunications},
TITLE = {Re-routing algorithms in a meshed satellite
constellation},
YEAR = {2001},
MONTH = {march/april},
OPTNOTE = {},
NUMBER = {3/4},
PAGES = {169--174},
VOLUME = {56},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/FGPR01.pdf},
ABSTRACT = {In this paper we present a simple model for satellite
constellations with polar orbits and inter-satellite links. This
model is used to propose and study two algorithms for routing and
re-routing communications, which aim at improving the quality of
service for long communications. In order to study these algorithms,
we have developed a satellite constellation simulator. Some of its
results are presented.}
}
@ARTICLE{FlPe01,
AUTHOR = {M. Flammini and S. Pérennes},
JOURNAL = {SIAM J. Discrete Math.},
TITLE = {On the optimality of general lower bounds for
broadcasting and gossiping},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {267--282},
VOLUME = {14}
}
@ARTICLE{FPPP01,
AUTHOR = {P. Fraigniaud and A. Pelc and D. Peleg and S. Pérennes},
JOURNAL = {Distributed Computing},
TITLE = {Assigning labels in unknown network with a leader},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {163--183},
VOLUME = {14}
}
@ARTICLE{Gal01a,
AUTHOR = {J. Galtier},
JOURNAL = {Telecommunication Systems},
TITLE = {Geographical reservation for guaranteed handover and
routing in low earth orbit constellations},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1/3},
PAGES = {101--121},
VOLUME = {18},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal01a.pdf}
}
@ARTICLE{GHP01,
AUTHOR = {L. Gargano and P. Hell and S. Pérennes},
JOURNAL = {Journal of Graph Theory},
TITLE = {Coloring all directed paths in a symmetric tree, with an
application to optical networks},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {183--196},
VOLUME = {38}
}
@ARTICLE{GPPV01,
AUTHOR = {L. Gargano and A. Pelc and S. Pérennes and U. Vaccaro},
JOURNAL = {Networks},
TITLE = {Efficient communication in unknown networks},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {39--49},
VOLUME = {38}
}
@ARTICLE{Havet01a,
AUTHOR = {F. Havet},
JOURNAL = {Discrete Mathematics},
TITLE = {Channel assignement and multicolouring of the induced
subgraphs of the triangular lattice},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {219--231},
VOLUME = {233}
}
@ARTICLE{HMP00,
AUTHOR = {M.-C. Heydemann and N. Marlin and S. Pérennes},
JOURNAL = {European Journal of Combinatorics},
TITLE = {Complete Rotations in Cayley Graphs},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {179-196},
VOLUME = {22},
URL = {http://dx.doi.org/10.1006/eujc.2000.0460}
}
@ARTICLE{MR1876582,
AUTHOR = {C. Linhares-Sales and F. Maffray and B. Reed},
JOURNAL = {Graphs Combin.},
TITLE = {Recognizing planar strict quasi-parity graphs},
YEAR = {2001},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {745--757},
VOLUME = {17}
}
@ARTICLE{MR1832451,
AUTHOR = {D. Rautenbach and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {The Erdos-Pósa property for odd cycles in highly
connected graphs},
YEAR = {2001},
OPTMONTH = {},
NOTE = {Paul Erdos and his mathematics (Budapest, 1999)},
NUMBER = {2},
PAGES = {267--278},
VOLUME = {21}
}
@ARTICLE{ABJ+00b,
AUTHOR = {E. Altman and E. Baçsar and T. Jiménez and N. Shimkin},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Routing into Two Parallel Links:Game-Theoretic
Distributed Algorithms},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {Special Issue on Routing in Computer and Communication Networks},
OPTPAGES = {},
OPTVOLUME = {}
}
@ARTICLE{AJK00,
AUTHOR = {E. Altman and T. Jiménez and G. Koole},
JOURNAL = {IEEE Trans. on Communications},
TITLE = {On optimal call admission control},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {}
}
@ARTICLE{BBDD+00,
AUTHOR = {M. Becker and A.-L. Beylot and O. Dalle and R. Dhaou and
M. Marot and P. Mussi and C. Rigal and V. Sutter},
JOURNAL = {Networking and Information Systems Journal},
TITLE = {The ASIMUT Simulation Workshop},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {335--348},
VOLUME = {3}
}
@ARTICLE{MR1735345,
AUTHOR = {C. Berge and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {Optimal packings of edge-disjoint odd cycles},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {197--202},
VOLUME = {211}
}
@ARTICLE{BBM+00,
AUTHOR = {J.-C. Bermond and J. Bond and C. Martin and A. Pekec and
F. S. Roberts},
JOURNAL = {JOIN},
TITLE = {Optimal orientation of annular networks},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {21-46},
VOLUME = {1},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBM+00.pdf}
}
@ARTICLE{BGPR+00,
AUTHOR = {J.-C. Bermond and L. Gargano and S. Pérennes and
A.A. Rescigno and U. Vaccaro},
JOURNAL = {Theoretical Computer Science},
TITLE = {Efficient Collective Communications in Optical Networks},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {165--189},
VOLUME = {233},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGP+00.pdf}
}
@ARTICLE{BMY00,
AUTHOR = {J.-C. Bermond and S. Marshall and M.L. Yu},
JOURNAL = {JOIN},
TITLE = {Improved bounds for gossiping in mesh-bus networks},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1-19},
VOLUME = {1},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BMY00.pdf}
}
@ARTICLE{BFMP+00,
AUTHOR = {P. Berthomé and A. Ferreira and S. Pérennes and
G. Plaxton and B. Maggs},
JOURNAL = {Algorithmica},
TITLE = {Sorting-based selection algorithms on hypercubic
networks},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {237--254},
VOLUME = {26}
}
@ARTICLE{BDLM00,
AUTHOR = {M. Bugliesi and G. Delzanno and L. Liquori and
M. Martelli},
JOURNAL = {Journal of Logic and Computation},
TITLE = {Object Calculi in Linear Logic},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {75--104},
VOLUME = {10},
EDITOR = {Oxford University Press},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jlc-00.ps.gz}
}
@ARTICLE{CFM00b,
AUTHOR = {D. Coudert and A. Ferreira and X. Muñoz},
JOURNAL = {IEEE/OSA Journal of Lightwave Technology},
TITLE = {A Multihop-Multi-OPS Optical Interconnection Network},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {12},
PAGES = {2076-2085},
VOLUME = {18},
KEY = {December},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-JLT00.ps.gz},
ABSTRACT = {In this paper we study the design of regular multicast
networks implemented with Optical Passive Star (OPS) couplers. We
focus on an architecture based on both Kautz graphs and stack-graphs,
and show that it is very cost-effective with respect to its resources
requirements, namely the number of OPS couplers, power budget,
scalability and number of transceivers, and presents a large ratio
number-of-nodes/diameter. The important issue of medium access
control is also addressed and control protocols for accessing the
optical couplers are given and analyzed. Finally, we show through
simulation that these control protocols efficiently implement
shortest path routing on these networks.}
}
@ARTICLE{CFM00,
AUTHOR = {D. Coudert and A. Ferreira and X. Muñoz},
JOURNAL = {OSA Applied Optics -- Information Processing},
TITLE = {Topologies for Optical Interconnection Networks Based on
the Optical Transpose Interconnection System},
YEAR = {2000},
MONTH = {June},
OPTNOTE = {},
NUMBER = {17},
PAGES = {2965-2974},
VOLUME = {39},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-AO00.ps.gz},
ABSTRACT = {Many results exist in the literature describing
technological and theoretical advances in optical network topologies
and design. However, an essential effort has yet to be done in
linking those results together. In this paper, we propose a step in
this direction, by giving optical layouts for several
graph-theoretical topologies studied in the literature, using the
Optical Transpose Interconnection System (OTIS) architecture. These
topologies include the family of Partitioned Optical Passive Star
(POPS) and stack-Kautz networks as well as a generalization of the
Kautz and de Bruijn digraphs.}
}
@ARTICLE{FGS00,
AUTHOR = {A. Ferreira and A. Goldman and S. W. Song},
JOURNAL = {Journal of Interconnection Networks - JOIN},
TITLE = {Broadcasting in bus interconnection networks},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {73--94},
VOLUME = {1}
}
@ARTICLE{FeSc00,
AUTHOR = {A. Ferreira and Nicolas Schabanel},
JOURNAL = {Parallel Processing Letters},
TITLE = {A randomized BSP/CGM algorithm for the maximal
independent set},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {411--422},
VOLUME = {9},
ADDRESS = {Australia}
}
@ARTICLE{Gal00b,
AUTHOR = {J. Galtier},
JOURNAL = {Computers and Artificial Intelligence},
TITLE = {Load Balancing Issues in the Prepartitioning Method},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
OPTPAGES = {},
VOLUME = {19},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal00b.pdf}
}
@ARTICLE{MR1793319,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Networks},
TITLE = {Channel assignment and weighted coloring},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {114--117},
VOLUME = {36}
}
@ARTICLE{MR1792120,
AUTHOR = {L. Perkovic and B. Reed},
JOURNAL = {Internat. J. Found. Comput. Sci.},
TITLE = {An improved algorithm for finding tree decompositions of
small width},
YEAR = {2000},
OPTMONTH = {},
NOTE = {Selected papers from the Workshop on Theoretical Aspects of Computer Science (WG 99), Part 1 (Ascona)},
NUMBER = {3},
PAGES = {365--371},
VOLUME = {11}
}
@ARTICLE{MR1737626,
AUTHOR = {B. Reed and R. Thomas},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Clique minors in graphs and their complements},
YEAR = {2000},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {81--85},
VOLUME = {78}
}
@INCOLLECTION{BBP99,
AUTHOR = {R. Balakhrishnan and J.-C. Bermond and P. Paulraja},
BOOKTITLE = {Editors Special Issues of Discrete Mathematics},
PUBLISHER = {North Holland},
TITLE = {Combinatorics and Number Theory},
YEAR = {1999},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1-220},
OPTSERIES = {},
OPTTYPE = {},
VOLUME = {206},
JOURNAL = {Discrete Mathematics}
}
@INCOLLECTION{Fer99,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Parallel Processing of Discrete Problems},
PUBLISHER = {Springer Verlag},
TITLE = {On the design of parallel discrete algorithms for high
performance computing systems},
YEAR = {1999},
ADDRESS = {New York (USA)},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {75-83},
SERIES = {The IMA Volumes in Mathematics and its Aplications},
OPTTYPE = {},
VOLUME = {106}
}
@INCOLLECTION{Fer99,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Parallel Processing of Discrete Problems},
PUBLISHER = {Springer Verlag},
TITLE = {On the design of parallel discrete algorithms for high
performance computing systems},
YEAR = {1999},
ADDRESS = {New York (USA)},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {75-83},
SERIES = {The IMA Volumes in Mathematics and its Aplications},
OPTTYPE = {},
VOLUME = {106},
KEY = {bc-chapter}
}
@INCOLLECTION{MR1673506,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {Graph theory and combinatorial biology (Balatonlelle, 1996)},
PUBLISHER = {János Bolyai Math. Soc.},
TITLE = {Graph colouring via the probabilistic method},
YEAR = {1999},
ADDRESS = {Budapest},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {125--155},
SERIES = {Bolyai Soc. Math. Stud.},
OPTTYPE = {},
VOLUME = {7}
}
@INCOLLECTION{MR1660786,
AUTHOR = {M. Molloy and B. Reed and William Steiger},
BOOKTITLE = {Randomization methods in algorithm design (Princeton, NJ, 1997)},
PUBLISHER = {Amer. Math. Soc.},
TITLE = {On the mixing rate of the triangulation walk},
YEAR = {1999},
ADDRESS = {Providence, RI},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {179--190},
SERIES = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.},
OPTTYPE = {},
VOLUME = {43}
}
@ARTICLE{Bea99,
AUTHOR = {B. Beauquier},
JOURNAL = {Networks},
TITLE = {All-To-All Communication in some Wavelength-Routed
All-Optical Networks},
YEAR = {1999},
MONTH = {May},
OPTNOTE = {},
NUMBER = {3},
PAGES = {179--187},
VOLUME = {33},
PUBLISHER = {Wiley-Interscience}
}
@ARTICLE{MR1703423,
AUTHOR = {C. Berge and B. Reed},
JOURNAL = {Ann. Inst. Fourier (Grenoble)},
TITLE = {Edge-disjoint odd cycles in graphs with small chromatic
number},
YEAR = {1999},
OPTMONTH = {},
NOTE = {Symposium à la Mémoire de François Jaeger (Grenoble, 1998)},
NUMBER = {3},
PAGES = {783--786},
VOLUME = {49}
}
@ARTICLE{BBKP+99,
AUTHOR = {J.-C. Bermond and A. Bonnecaze and T. Kodate and
S. Pérennes and P. Solé},
JOURNAL = {Annales de l'Institut Fourier},
TITLE = {Symetric flows and broadcasting in hypercubes},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {787-807},
VOLUME = {49},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBK+99.pdf}
}
@ARTICLE{BBDL99,
AUTHOR = {V. Bono and M. Bugliesi and M. Dezani-Ciancaglini and
L. Liquori},
JOURNAL = {Fundamenta Informaticae},
TITLE = {Subtyping for Extensible, Incomplete Objects},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {325--364},
VOLUME = {38},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fi-99.ps.gz}
}
@ARTICLE{CFR99,
AUTHOR = {R. Corrêa and A. Ferreira and P. Rebreyend},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
TITLE = {Integrating list heuristics in genetic algorithms for
multiprocessor scheduling},
YEAR = {1999},
MONTH = {August},
OPTNOTE = {},
NUMBER = {8},
PAGES = {825-837},
VOLUME = {10},
KEY = {j}
}
@ARTICLE{CFR99,
AUTHOR = {R. Corrêa and A. Ferreira and P. Rebreyend},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
TITLE = {Scheduling multiprocessor tasks with genetic algorithms},
YEAR = {1999},
MONTH = {August},
OPTNOTE = {},
NUMBER = {8},
PAGES = {825-837},
VOLUME = {10},
KEY = {j-journal}
}
@ARTICLE{DFRU99,
AUTHOR = {M. Diallo and A. Ferreira and A. Rau-Chaplin and
S. Ubéda},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Scalable 2d convex hull and triangulation algorithms for
coarse-grained multicomputers},
YEAR = {1999},
MONTH = {January},
OPTNOTE = {},
NUMBER = {1},
PAGES = {47--70},
VOLUME = {56}
}
@ARTICLE{FKRU99,
AUTHOR = {A. Ferreira and C. Kenyon and A. Rau-Chaplin and
S. Ubéda},
JOURNAL = {Algorithmica},
TITLE = {d-Dimensional Range Search on Multicomputers},
YEAR = {1999},
OPTMONTH = {},
NOTE = {Special Issue on Coarse Grained Parallel Algorithms},
NUMBER = {3/4},
PAGES = {195-208},
VOLUME = {24}
}
@ARTICLE{FeUb99,
AUTHOR = {A. Ferreira and S. Ubéda},
JOURNAL = {IEEE Transactions on Pattern Analysis & Machine Intelligence (PAMI)},
TITLE = {Computing the medial axis transform in parallel with 8
scan operations},
YEAR = {1999},
MONTH = {March},
OPTNOTE = {},
NUMBER = {3},
PAGES = {277-282},
VOLUME = {21}
}
@ARTICLE{MR1643445,
AUTHOR = {Hugh Hind and M. Molloy and B. Reed},
JOURNAL = {SIAM J. Comput.},
TITLE = {Total coloring with $\Delta+{\rm poly}(\log\Delta)$
colors},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {816--821 (electronic)},
VOLUME = {28}
}
@ARTICLE{MR1666954,
AUTHOR = {F. Maffray and B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {A description of claw-free perfect graphs},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {134--156},
VOLUME = {75}
}
@ARTICLE{MR1665964,
AUTHOR = {N. V. R. Mahadev and B. A. Reed},
JOURNAL = {J. Graph Theory},
TITLE = {A note on vertex orders for stability number},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {113--120},
VOLUME = {30}
}
@ARTICLE{MR1675915,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {Colouring proximity graphs in the plane},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {123--137},
VOLUME = {199}
}
@ARTICLE{MR1712383,
AUTHOR = {M. Molloy and B. Reed},
JOURNAL = {Electron. J. Combin.},
TITLE = {Critical subgraphs of a random graph},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {Research Paper 35, 13 pp. (electronic)},
VOLUME = {6}
}
@ARTICLE{MR1699199,
AUTHOR = {B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {A strengthening of Brooks' theorem},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {136--149},
VOLUME = {76}
}
@ARTICLE{MR1684925,
AUTHOR = {B. Reed},
JOURNAL = {Oper. Res. Lett.},
TITLE = {Edge coloring nearly bipartite graphs},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {11--14},
VOLUME = {24}
}
@ARTICLE{MR1723044,
AUTHOR = {B. Reed},
JOURNAL = {Combinatorica},
TITLE = {Mangoes and blueberries},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {267--296},
VOLUME = {19}
}
@ARTICLE{MR1686286,
AUTHOR = {B. Reed},
JOURNAL = {J. Graph Theory},
TITLE = {The list colouring constants},
YEAR = {1999},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {149--153},
VOLUME = {31}
}
@INCOLLECTION{CFP98,
AUTHOR = {R. Corrêa and A. Ferreira and S. Porto},
BOOKTITLE = {Handbook of Combinatorial Optimization},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {Selected Algorithmic Techniques for Parallel
Optimization},
YEAR = {1998},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {D. Du and P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {407-456},
OPTSERIES = {},
OPTTYPE = {},
VOLUME = {3},
KEY = {bc-chapter}
}
@INCOLLECTION{Fer98,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Optical Interconnects and Parallel Processing: Trends at the Interface},
PUBLISHER = {Kluwer Academic Publisher},
TITLE = {Towards effective models for OPS--based lightwave
networks},
YEAR = {1998},
ADDRESS = {Boston (USA)},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {P. Berthomé and A. Ferreira},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {209-233},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@INCOLLECTION{FeGu98,
AUTHOR = {A. Ferreira and I. Guérin-Lassous},
BOOKTITLE = {Parallélisme et Répartitions},
PUBLISHER = {Hermes},
TITLE = {Algorithmique discrète parallèle : le chaînon manquant},
YEAR = {1998},
ADDRESS = {Paris (F)},
CHAPTER = {II},
OPTEDITION = {},
EDITOR = {J.-F. Myoupo},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {23-47},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@INCOLLECTION{MR1678562,
AUTHOR = {A. M. Frieze and B. Reed},
BOOKTITLE = {Probabilistic methods for algorithmic discrete mathematics},
PUBLISHER = {Springer},
TITLE = {Probabilistic analysis of algorithms},
YEAR = {1998},
ADDRESS = {Berlin},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {36--92},
SERIES = {Algorithms Combin.},
OPTTYPE = {},
VOLUME = {16}
}
@ARTICLE{BHP98,
AUTHOR = {B. Beauquier and P. Hell and S. Pérennes},
JOURNAL = {DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science},
TITLE = {Optimal Wavelength-routed Multicasting},
YEAR = {1998},
MONTH = {May},
OPTNOTE = {},
NUMBER = {1-3},
OPTPAGES = {},
VOLUME = {84},
URL = {citeseer.nj.nec.com/312543.html}
}
@ARTICLE{BDDP98,
AUTHOR = {J.-C. Bermond and E. Darrot and O. Delmas and
S. Pérennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Hamilton circuits in the directed wrapped butterfly
network},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {21-42},
VOLUME = {84},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDDP98b.pdf}
}
@ARTICLE{BDDP98a,
AUTHOR = {J.-C. Bermond and E. Darrot and O. Delmas and
S. Pérennes},
JOURNAL = {Parallel Processing Letters},
TITLE = {Hamilton cycle decomposition of the butterfly networks},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {371-385},
VOLUME = {8},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDDP98a.pdf}
}
@ARTICLE{BGP98,
AUTHOR = {J.-C. Bermond and L. Gargano and S. Pérennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Optimal sequential gossiping by short messages},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2-3},
PAGES = {145-155},
VOLUME = {86},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGP98.pdf}
}
@ARTICLE{BGRV98,
AUTHOR = {J.-C. Bermond and L. Gargano and A.A. Rescigno and
U. Vaccaro},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Fast gossiping by short messages},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {917-941},
VOLUME = {27},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGRV98.pdf}
}
@ARTICLE{BFM98,
AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
JOURNAL = {Computer Networks and ISDN Systems},
TITLE = {A performance comparison between graph and hypergraph
topologies for passive star WDM lightwave networks},
YEAR = {1998},
MONTH = {May},
OPTNOTE = {},
NUMBER = {30},
PAGES = {805-819},
VOLUME = {8},
KEY = {j-journal}
}
@ARTICLE{MR1656544,
AUTHOR = {M. Molloy and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {A bound on the total chromatic number},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {241--280},
VOLUME = {18}
}
@ARTICLE{MR1664335,
AUTHOR = {M. Molloy and B. Reed},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {The size of the giant component of a random graph with a
given degree sequence},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {295--305},
VOLUME = {7}
}
@ARTICLE{Per98,
AUTHOR = {S. Perennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Broadcasting and gossiping on de Bruijn, shuffle
exchange and similar networks.},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {247-262},
VOLUME = {83},
KEY = {0106}
}
@ARTICLE{MR1610746,
AUTHOR = {B. Reed},
JOURNAL = {J. Graph Theory},
TITLE = {$\omega,\ \Delta$, and $\chi$},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {177--212},
VOLUME = {27}
}
@ARTICLE{MR1654153,
AUTHOR = {B. Reed and P. Seymour},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Fractional colouring and Hadwiger's conjecture},
YEAR = {1998},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {147--152},
VOLUME = {74}
}
@INCOLLECTION{FeMo97,
AUTHOR = {A. Ferreira and M. Morvan},
BOOKTITLE = {Parallel Computing in Optimization},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {Models for Parallel Algorithm Design: An Introduction},
YEAR = {1997},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {A. Migdalas and P. Pardalos and S. Storoy},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--26},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@INCOLLECTION{MR1477746,
AUTHOR = {B. A. Reed},
BOOKTITLE = {Surveys in combinatorics, 1997 (London)},
PUBLISHER = {Cambridge Univ. Press},
TITLE = {Tree width and tangles: a new connectivity measure and
some applications},
YEAR = {1997},
ADDRESS = {Cambridge},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {87--162},
SERIES = {London Math. Soc. Lecture Note Ser.},
OPTTYPE = {},
VOLUME = {241}
}
@ARTICLE{BDE97,
AUTHOR = {J.-C. Bermond and R. Dawes and F.O. Ergincan},
JOURNAL = {Networks},
TITLE = {De Bruijn and Kautz bus networks},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {205-218},
VOLUME = {30},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDE97.pdf}
}
@ARTICLE{BHLP97,
AUTHOR = {J.-C. Bermond and H.A. Harutyunyan and A.L. Liestman and
S. Pérennes},
JOURNAL = {International Journal of Foundations of Computer Science},
TITLE = {A note on the dimensionalityof modified Knödel Graphs},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {109-116},
VOLUME = {8},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHLP97.pdf}
}
@ARTICLE{BLS97,
AUTHOR = {J.-C. Bermond and Z. Liu and M. Syska},
JOURNAL = {Networks},
TITLE = {Mean eccentricities of de Bruijn networks},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {187-203},
VOLUME = {30},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BLS97.pdf}
}
@ARTICLE{BeFe97,
AUTHOR = {P. Berthomé and A. Ferreira},
JOURNAL = {International Journal of Foundations of Computer Science},
TITLE = {Communication Issues in Parallel Systems with Optical
Interconnections},
YEAR = {1997},
OPTMONTH = {},
NOTE = {Special Issue on Interconnection Networks},
NUMBER = {2},
PAGES = {143--162},
VOLUME = {8},
KEY = {j-journal}
}
@ARTICLE{CoGo97,
AUTHOR = {M. Cosnard and E. Goles},
JOURNAL = {Neural Networks},
TITLE = {Discrete state neural networks and energies},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {327-334},
VOLUME = {10}
}
@ARTICLE{MR1429790,
AUTHOR = {H. Everett and S. Klein and B. Reed},
JOURNAL = {Discrete Appl. Math.},
TITLE = {An algorithm for finding homogeneous pairs},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {209--218},
VOLUME = {72}
}
@ARTICLE{GJMS97,
AUTHOR = {B. Gaujal and A. Jean-Marie and P. Mussi and G. Siegel},
JOURNAL = {Parallel Computing},
TITLE = {High speed simulation of discrete event systems by
mixing process oriented and equational approaches},
YEAR = {1997},
MONTH = {April},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {219--233},
VOLUME = {23}
}
@ARTICLE{MR1645682,
AUTHOR = {H. Hind and M. Molloy and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {Colouring a graph frugally},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {469--482},
VOLUME = {17}
}
@ARTICLE{MR1451490,
AUTHOR = {C. Linhares-Sales and F. Maffray and B. Reed},
JOURNAL = {Graphs Combin.},
TITLE = {On planar perfectly contractile graphs},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {167--187},
VOLUME = {13}
}
@ARTICLE{MR1438613,
AUTHOR = {M. Molloy and B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {A bound on the strong chromatic index of a graph},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {103--109},
VOLUME = {69}
}
@ARTICLE{Per97,
AUTHOR = {S. Perennes},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {A Proof of Jean de Rumeur's conjecture},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {295-299},
VOLUME = {74},
KEY = {0105}
}
@ARTICLE{MR1439301,
AUTHOR = {L. Perkovic and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {Edge coloring regular graphs of high degree},
YEAR = {1997},
OPTMONTH = {},
NOTE = {Graphs and combinatorics (Marseille, 1995)},
OPTNUMBER = {},
PAGES = {567--578},
VOLUME = {165/166}
}
@ARTICLE{BLRU97,
AUTHOR = {van Bakel, S. and L. Liquori and Ronchi della Rocca, S. and
P. Urzyczyn},
JOURNAL = {Annals of Pure and Applied Logics},
TITLE = {Comparing Cubes of Typed and Type Assignment System},
YEAR = {1997},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {267--303},
VOLUME = {86},
PUBLISHER = {North-Holland},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/apal-97.ps.gz}
}
@INCOLLECTION{CoFe96,
AUTHOR = {R. Corrêa and A. Ferreira},
BOOKTITLE = {Solving Combinatorial Optimization Problems in Parallel},
PUBLISHER = {Springer-Verlag},
TITLE = {Parallel Best-First Branch-and-Bound in Discrete
Optimization: A Framework},
YEAR = {1996},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {A. Ferreira and P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {171--200},
SERIES = {LNCS State-of-the-Art Surveys},
OPTTYPE = {},
VOLUME = {1054},
KEY = {bc-chapter}
}
@INCOLLECTION{Fer96,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Handbook of Parallel and Distributed Computing},
PUBLISHER = {McGraw-Hill},
TITLE = {Parallel and Communication Algorithms for Hypercube
Multiprocessors},
YEAR = {1996},
ADDRESS = {New York (USA)},
CHAPTER = {19},
OPTEDITION = {},
EDITOR = {A. Zomaya},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {568--589},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@INCOLLECTION{FePa96b,
AUTHOR = {A. Ferreira and P. Pardalos},
BOOKTITLE = {Solving Combinatorial Optimization Problems in Parallel},
PUBLISHER = {Springer-Verlag},
TITLE = {SCOOP -- Solving Combinatorial Optimization Problems in
Parallel},
YEAR = {1996},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {A. Ferreira and P. Pardalos},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--6},
SERIES = {LNCS State-of-the-Art Surveys},
OPTTYPE = {},
VOLUME = {1054},
KEY = {bc-chapter}
}
@ARTICLE{BBCFMRS96a,
AUTHOR = {F. Baude and F. Belloncle and D. Caromel and N. Furmento and
P. Mussi and Y. Roudier and G. Siegel},
JOURNAL = {Information Sciences},
TITLE = {Parallel Object-Oriented Programming for Parallel
Simulations},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
PUBLISHER = {Elsevier}
}
@ARTICLE{BeEr96,
AUTHOR = {J.-C. Bermond and F.O. Ergincan},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Bus Interconnection Networks},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1-15},
VOLUME = {68},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BeEr96.pdf}
}
@ARTICLE{BPST96,
AUTHOR = {J.-C. Bermond and C. Peyrat and I. Sakho and M. Tchuente},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Parallelization of Gauss elimination algorithm on
systolic arrays},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {69--75},
VOLUME = {33}
}
@ARTICLE{BFP96,
AUTHOR = {P. Berthomé and A. Ferreira and S. Pérennes},
JOURNAL = {IEEE Transactions on Parallel and Distributed Systems},
TITLE = {Decomposing hierarchical Cayley graphs, with
applications to information dissemination and algorithm design},
YEAR = {1996},
MONTH = {December},
OPTNOTE = {},
NUMBER = {12},
PAGES = {1292--1300},
VOLUME = {7},
KEY = {j-journal}
}
@ARTICLE{BoCo96,
AUTHOR = {O. Bournez and M. Cosnard},
JOURNAL = {Theoretical Computer Science},
TITLE = {On the computational power of dynamical systems and
hybrid systems},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {417--459},
VOLUME = {168}
}
@ARTICLE{MR1395689,
AUTHOR = {C. Cooper and A. Frieze and M. Molloy and B. Reed},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {Perfect matchings in random $r$-regular, $s$-uniform
hypergraphs},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1--14},
VOLUME = {5}
}
@ARTICLE{FGS96,
AUTHOR = {A. Ferreira and A. Goldman and S. W. Song},
JOURNAL = {Parallel Algorithms and Applications},
TITLE = {Gossiping in bus interconnection networks},
YEAR = {1996},
OPTMONTH = {},
NOTE = {Special Issue on Algorithms for Enhanced Meshes},
OPTNUMBER = {},
PAGES = {309--331},
VOLUME = {8},
KEY = {j-journal}
}
@ARTICLE{FeGr96,
AUTHOR = {A. Ferreira and M. Grammatikakis},
JOURNAL = {Theoretical Computer Science},
TITLE = {Randomized routing in generalized hypercubes},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1--2},
PAGES = {53--64},
VOLUME = {158},
KEY = {j-journal}
}
@ARTICLE{FeRo96b,
AUTHOR = {A. Ferreira and J.M. Robson},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Fast and Scalable Parallel Algorithms for Knapsack and
Similar Problems},
YEAR = {1996},
MONTH = {November},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1--13},
VOLUME = {39},
KEY = {j-journal}
}
@ARTICLE{MR1385380,
AUTHOR = {S. E. Markossian and G. S. Gasparian and B. A. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {$\beta$-perfect graphs},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1--11},
VOLUME = {67}
}
@ARTICLE{MR1411088,
AUTHOR = {B. Reed},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {Paths, stars and the number three},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {277--295},
VOLUME = {5}
}
@ARTICLE{MR1433641,
AUTHOR = {B. Reed and N. Robertson and P. Seymour and R. Thomas},
JOURNAL = {Combinatorica},
TITLE = {Packing directed circuits},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {535--554},
VOLUME = {16}
}
@ARTICLE{MR1433642,
AUTHOR = {B. A. Reed and F. B. Shepherd},
JOURNAL = {Combinatorica},
TITLE = {The Gallai-Younger conjecture for planar graphs},
YEAR = {1996},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {555--566},
VOLUME = {16}
}
@INCOLLECTION{CoFe95,
AUTHOR = {R. Corrêa and A. Ferreira},
BOOKTITLE = {Solving Irregular Problems in Parallel: State of the Art},
PUBLISHER = {Kluwer Academic Publisher, Boston (USA)},
TITLE = {A Distributed Implementation of Asynchronous Parallel
Branch and Bound},
YEAR = {1995},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {A. Ferreira and J. Rolim},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {157--176},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@ARTICLE{MR1711792,
AUTHOR = {M. Albert and A. Frieze and B. Reed},
JOURNAL = {Electron. J. Combin.},
TITLE = {Comments on: ``Multicoloured Hamilton cycles''
[Electron. J. Combin. 2 (1995), Research Paper 10, 13 pp.
(electronic); MR1327570 (96b:05058)]},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {Research Paper 10, Comment 1, 1 HTML document (electronic)},
VOLUME = {2}
}
@ARTICLE{MR1327570,
AUTHOR = {M. Albert and A. Frieze and B. Reed},
JOURNAL = {Electron. J. Combin.},
TITLE = {Multicoloured Hamilton cycles},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {Research Paper 10, approx. 13 pp. (electronic)},
VOLUME = {2}
}
@ARTICLE{BCH95,
AUTHOR = {J.-C. Bermond and F. Comellas and D.F. Hsu},
JOURNAL = {Journal of Parallel and Distributed Computing},
TITLE = {Distributed Loop Computer Networks: a survey},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {2--10},
VOLUME = {24}
}
@ARTICLE{BFP95,
AUTHOR = {J.-C. Bermond and P. Fraigniaud and J.G. Peters},
JOURNAL = {Networks},
TITLE = {Antepenultimate Broadcasting},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {125--137},
VOLUME = {26}
}
@ARTICLE{BeFe95,
AUTHOR = {P. Berthomé and A. Ferreira},
JOURNAL = {DIMACS series in Discrete Mathematics and Theoretical Computer Science},
TITLE = {On Broadcasting Schemes in Restricted Optical Passive
Star Systems},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {19--29},
VOLUME = {21},
EDITOR = {D. Frank Hsu and A. L. Rosenberg and D. Sotteau},
KEY = {j-journal}
}
@ARTICLE{CoFe95b,
AUTHOR = {R. Corrêa and A. Ferreira},
JOURNAL = {DIMACS series in Discrete Mathematics and Theoretical Computer Science},
TITLE = {Modeling Parallel Branch-and-Bound for Asynchronous
Implementations},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {45--56},
VOLUME = {22},
BOOKTITLE = {Proceedings of the DIMACS Workshop on Parallel Processing of Discrete Optimization},
EDITOR = {Panos M. Pardalos and Mauricio G.C Resende and
K.G. Ramakrishnan},
KEY = {j-journal},
PUBLISHER = {American Mathematical Society}
}
@ARTICLE{CoFe95c,
AUTHOR = {R. Corrêa and A. Ferreira},
JOURNAL = {Parallel Processing Letters},
TITLE = {On the effectivenes of parallel branch and bound},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {375--386},
VOLUME = {5},
KEY = {j-journal}
}
@ARTICLE{DFR95,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Computer Vision and Image Understanding},
TITLE = {Parallel processing of pointer based quadtrees},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1--10},
VOLUME = {62},
KEY = {j-journal}
}
@ARTICLE{MR1361150,
AUTHOR = {L. Devroye and B. Reed},
JOURNAL = {SIAM J. Comput.},
TITLE = {On the variance of the height of random binary search
trees},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {1157--1162},
VOLUME = {24}
}
@ARTICLE{DFG95,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
JOURNAL = {Microprocessors & Microprogramming Journal},
TITLE = {A Scalable Design for VLSI Dictionary Machines},
YEAR = {1995},
OPTMONTH = {},
NOTE = {Special Issue on Parallel Programmable Architectures and Compilation for Multi-dimensional Processing},
OPTNUMBER = {},
PAGES = {359--372},
VOLUME = {41},
KEYWORDS = {parallelisme, grain fin, machine dico},
KEY = {j-journal}
}
@ARTICLE{Fer95,
AUTHOR = {A. Ferreira},
JOURNAL = {International Journal of High Speed Computing},
TITLE = {Work and memory efficient parallel algorithms for the
knapsack problem},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {595--606},
VOLUME = {4},
KEY = {j-journal}
}
@ARTICLE{MR1333850,
AUTHOR = {A. Frieze and R. M. Karp and B. Reed},
JOURNAL = {SIAM J. Comput.},
TITLE = {When is the assignment bound tight for the asymmetric
traveling-salesman problem?},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {484--493},
VOLUME = {24}
}
@ARTICLE{MR1364022,
AUTHOR = {A. Frieze and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {Covering the edges of a random graph by cliques},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {489--497},
VOLUME = {15}
}
@ARTICLE{MR1341476,
AUTHOR = {B. Gamble and W. Pulleyblank and B. Reed and B. Shepherd},
JOURNAL = {Graphs Combin.},
TITLE = {Right angle free subsets in the plane},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {121--129},
VOLUME = {11}
}
@ARTICLE{MR1356578,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {Almost every graph can be covered by
$\lceil{\Delta/2}\rceil$ linear forests},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {257--268},
VOLUME = {4}
}
@ARTICLE{MR1369064,
AUTHOR = {M. Molloy and B. Reed},
JOURNAL = {Random Structures Algorithms},
TITLE = {The dominating number of a random cubic graph},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {209--221},
VOLUME = {7}
}
@ARTICLE{MR1327776,
AUTHOR = {B. Reed},
JOURNAL = {Discrete Appl. Math.},
TITLE = {Rooted routing in the plane},
YEAR = {1995},
OPTMONTH = {},
NOTE = {Combinatorial optimization 1992 (CO92) (Oxford)},
NUMBER = {2-3},
PAGES = {213--227},
VOLUME = {57}
}
@ARTICLE{MR1341480,
AUTHOR = {B. Reed and N. Sbihi},
JOURNAL = {Graphs Combin.},
TITLE = {Recognizing bull-free perfect graphs},
YEAR = {1995},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {171--178},
VOLUME = {11}
}
@INCOLLECTION{DFG94,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
BOOKTITLE = {Algorithmes parallèles -- analyse et conception},
PUBLISHER = {Hermes},
TITLE = {6: Algorithmique Parallèle -- Structures de Données
Arborescentes},
YEAR = {1994},
ADDRESS = {Paris (F)},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {G. Authié and A. Ferreira and J.L. Roch and G. Villard and
J. Roman and C. Roucairol and B. Virot},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {129--171},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@ARTICLE{BeFr94,
AUTHOR = {J.-C. Bermond and P. Fraigniaud},
JOURNAL = {SIAM Journal on Computing},
TITLE = {Broadcasting and Gossiping in de Bruijn Networks},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {212--225},
VOLUME = {23}
}
@ARTICLE{BeFe94,
AUTHOR = {P. Berthomé and A. Ferreira},
JOURNAL = {Parallel Algorithms and Applications},
TITLE = {Time-optimal geometric algorithms in hypercubic networks},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {169--181},
VOLUME = {4},
KEY = {j-journal},
PUBLISHER = {IMACS - North Holland}
}
@ARTICLE{DFR94,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Parallel Computing},
TITLE = {A massively parallel knowledge-base server using a
hypercube multiprocessor},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1369--1382},
VOLUME = {20},
KEY = {j-journal}
}
@ARTICLE{FeUb94,
AUTHOR = {A. Ferreira and S. Ubéda},
JOURNAL = {Pattern Recognition},
TITLE = {Ultra-fast parallel contour tracking, with applications
to thinning},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {7},
PAGES = {867--878},
VOLUME = {27},
ADDRESS = {Grenoble (Fr)},
KEY = {j-journal}
}
@ARTICLE{MR1271267,
AUTHOR = {C. McDiarmid and B. Reed and A. Schrijver and
B. Shepherd},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Induced circuits in planar graphs},
YEAR = {1994},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {169--176},
VOLUME = {60}
}
@INCOLLECTION{MR1224703,
AUTHOR = {B. Bollobás and B. Reed and A. Thomason},
BOOKTITLE = {Graph structure theory (Seattle, WA, 1991)},
PUBLISHER = {Amer. Math. Soc.},
TITLE = {An extremal function for the achromatic number},
YEAR = {1993},
ADDRESS = {Providence, RI},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {161--165},
SERIES = {Contemp. Math.},
OPTTYPE = {},
VOLUME = {147}
}
@INCOLLECTION{MR1224702,
AUTHOR = {B. Reed},
BOOKTITLE = {Graph structure theory (Seattle, WA, 1991)},
PUBLISHER = {Amer. Math. Soc.},
TITLE = {Counterexamples to a conjecture of Las Vergnas and
Meyniel},
YEAR = {1993},
ADDRESS = {Providence, RI},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {157--159},
SERIES = {Contemp. Math.},
OPTTYPE = {},
VOLUME = {147}
}
@INCOLLECTION{MR1224712,
AUTHOR = {B. A. Reed and N. Robertson and A. Schrijver and
P. D. Seymour},
BOOKTITLE = {Graph structure theory (Seattle, WA, 1991)},
PUBLISHER = {Amer. Math. Soc.},
TITLE = {Finding disjoint trees in planar graphs in linear time},
YEAR = {1993},
ADDRESS = {Providence, RI},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {295--301},
SERIES = {Contemp. Math.},
OPTTYPE = {},
VOLUME = {147}
}
@ARTICLE{BeHe93,
AUTHOR = {J.-C. Bermond and P. Hell},
JOURNAL = {Journal of Graph theory},
TITLE = {On even factorizations and the chromatic index of the
Kautz and de Bruijn digraphs},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {647--655},
VOLUME = {17},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BeHe93.pdf}
}
@ARTICLE{BLSS93,
AUTHOR = {J.-C. Bermond and E. Lazard and D. Sotteau and M. Syska},
JOURNAL = {Courrier du CNRS, la recherche en informatique},
TITLE = {La Théorie des graphes},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {54--55},
VOLUME = {80},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BLSS93.pdf}
}
@ARTICLE{BHP93,
AUTHOR = {J.-C. Bermond and N. Homobono N. and C. Peyrat},
JOURNAL = {Discrete Mathematics},
TITLE = {Connectivity of Kautz Networks},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {51--62},
VOLUME = {114}
}
@ARTICLE{MR1244930,
AUTHOR = {G. Cornuéjols and B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Complete multi-partite cutsets in minimal imperfect
graphs},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {191--198},
VOLUME = {59}
}
@ARTICLE{Fer93,
AUTHOR = {A. Ferreira},
JOURNAL = {Theoretical Computer Science},
TITLE = {On space-efficient algorithms for certain NP-Complete
problems},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {311--315},
VOLUME = {120},
KEYWORDS = {parallelisme, optimisation, knapsack},
KEY = {j-journal}
}
@ARTICLE{FeZe93,
AUTHOR = {A. Ferreira and J. Zerovnik},
JOURNAL = {International Journal on Computers & Mathematics with Applications},
TITLE = {Bounding the probability of success of stochastic
methods for global optimization},
YEAR = {1993},
OPTMONTH = {},
NOTE = {2nd Special Issue on Global Optimization, Control and Games},
NUMBER = {10/11},
PAGES = {1--8},
VOLUME = {25},
KEY = {j-journal}
}
@ARTICLE{MR1230055,
AUTHOR = {A. Frieze and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {Polychromatic Hamilton cycles},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {69--74},
VOLUME = {118}
}
@ARTICLE{MR1262919,
AUTHOR = {K. Kilakos and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {Fractionally colouring total graphs},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {435--440},
VOLUME = {13}
}
@ARTICLE{MR1198401,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {On total colourings of graphs},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {122--130},
VOLUME = {57}
}
@ARTICLE{MR1259161,
AUTHOR = {B. Reed},
JOURNAL = {CWI Quarterly},
TITLE = {Rooted routing in the plane},
YEAR = {1993},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {241--255},
VOLUME = {6}
}
@INCOLLECTION{DFR92,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
BOOKTITLE = {Algorithmique Parallèle},
PUBLISHER = {Masson},
TITLE = {Algorithmique SIMD},
YEAR = {1992},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = { M.Cosnard and M.Nivat and Y.Robert},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {65--80},
SERIES = {Etudes et Recherches en Informatique},
OPTTYPE = {},
OPTVOLUME = {},
KEY = {bc-chapter}
}
@INCOLLECTION{MR1218208,
AUTHOR = {K. Kilakos and B. Reed},
BOOKTITLE = {Sets, graphs and numbers (Budapest, 1991)},
PUBLISHER = {North-Holland},
TITLE = {A semi-integral total colouring},
YEAR = {1992},
ADDRESS = {Amsterdam},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {429--438},
SERIES = {Colloq. Math. Soc. János Bolyai},
OPTTYPE = {},
VOLUME = {60}
}
@ARTICLE{ACF92,
AUTHOR = {S. Akl and M. Cosnard and A. Ferreira},
JOURNAL = {Theoretical Computer Science},
TITLE = {Data-movement-intensive problems : two folk theorems in
parallel computation revisited},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {323--337},
VOLUME = {95},
KEY = {j-journal}
}
@ARTICLE{MR1194728,
AUTHOR = {N. Alon and C. McDiarmid and B. Reed},
JOURNAL = {Combinatorica},
TITLE = {Star arboricity},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {375--380},
VOLUME = {12}
}
@ARTICLE{BDQ92,
AUTHOR = {J.-C. Bermond and C. Delorme and J-J. Quisquater},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Table of large $({\Delta},D)$-graphs},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {575--577},
VOLUME = {37/38}
}
@ARTICLE{BHLP92b,
AUTHOR = {J.-C. Bermond and P. Hell and A. L. Liestman and
J. G. Peters},
JOURNAL = {SIAM Journal on Discrete Mathematics},
TITLE = {Broadcasting in bounded degree graphs},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {10--24},
VOLUME = {5},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHLP92b.pdf}
}
@ARTICLE{BHLP92,
AUTHOR = {J.-C. Bermond and P. Hell and A. L. Liestman and
J. G. Peters},
JOURNAL = {Discrete Applied Mathematics},
TITLE = {Sparse broadcast graphs},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {97--130},
VOLUME = {36}
}
@ARTICLE{BHQ92,
AUTHOR = {J.-C. Bermond and P. Hell and J.-J. Quisquater},
JOURNAL = {Parallel Processing Letters},
TITLE = {Construction of large packet radio networks},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {3-12},
VOLUME = {2},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHQ92.pdf}
}
@ARTICLE{BMT92,
AUTHOR = {J.-C. Bermond and P. Michallon and D. Trystram},
JOURNAL = {Parallel Computing},
TITLE = {Broadcasting in wraparound meshes with parallel
monodirectional links},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {639--648},
VOLUME = {18}
}
@ARTICLE{DFR92b,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Computational Geometry - Theory and Applications},
TITLE = {Parallel fractional cascading on hypercube
multiprocessors},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {141--167},
VOLUME = {2},
KEY = {j-journal}
}
@ARTICLE{FeSo92,
AUTHOR = {A. Ferreira and S.W. Song},
JOURNAL = {Integration: the VLSI journal},
TITLE = {Achieving optimality for gate matrix layout and PLA
folding : a graph theoretic approach},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {173--195},
VOLUME = {14},
KEY = {j-journal}
}
@ARTICLE{MR1174859,
AUTHOR = {A. Frieze and C. McDiarmid and B. Reed},
JOURNAL = {Ars Combin.},
TITLE = {On a conjecture of Bondy and Fan},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {329--336},
VOLUME = {33}
}
@ARTICLE{MR1208807,
AUTHOR = {B. Reed and C. McDiarmid},
JOURNAL = {Combin. Probab. Comput.},
TITLE = {The strongly connected components of $1$-in, $1$-out},
YEAR = {1992},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {265--274},
VOLUME = {1}
}
@ARTICLE{MR1109695,
AUTHOR = {N. Alon and C. McDiarmid and B. Reed},
JOURNAL = {Random Structures Algorithms},
TITLE = {Acyclic coloring of graphs},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {277--288},
VOLUME = {2}
}
@ARTICLE{BeKo91,
AUTHOR = {J.-C. Bermond and J.-C. Konig},
JOURNAL = {TSI},
TITLE = {Un protocole distribué pour la 2-connexité},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {269--274},
VOLUME = {10}
}
@ARTICLE{BeTz91,
AUTHOR = {J.-C. Bermond and D. Tzvieli},
JOURNAL = {Networks},
TITLE = {Minimal diameter double loop networks, part II: dense
optimal families},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--9},
VOLUME = {21}
}
@ARTICLE{CoFe91,
AUTHOR = {M. Cosnard and A. Ferreira},
JOURNAL = {Parallel Processing Letters},
TITLE = {On the real power of loosely coupled parallel
architectures},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {103--111},
VOLUME = {1},
KEY = {j-journal}
}
@ARTICLE{Fer91,
AUTHOR = {A. Ferreira},
JOURNAL = {IEEE Transactions on Computers},
TITLE = {A parallel time/hardware tradeoff $T.H = O(2^{n/2})$ for
the knapsack problem},
YEAR = {1991},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {221--225},
VOLUME = {40},
KEY = {j-journal}
}
@ARTICLE{BHL90a,
AUTHOR = {J.-C. Bermond and K. Heinrich and M.L. Yu},
JOURNAL = {Journal Europeen de Combinatoire},
TITLE = {Existence of resolvable path designs},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {205--211},
VOLUME = {11}
}
@ARTICLE{BHL90b,
AUTHOR = {J.-C. Bermond and K. Heinrich and M.L. Yu},
JOURNAL = {Journal Europeen de Combinatoire},
TITLE = {On resolvable mixed path designs},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {313--318},
VOLUME = {11}
}
@ARTICLE{CDF90,
AUTHOR = {M. Cosnard and J. Duprat and A. Ferreira},
JOURNAL = {Information Processing Letters},
TITLE = {The complexity of searching in X+Y and other multisets},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {34},
PAGES = {103--109},
OPTVOLUME = {},
KEY = {j-journal}
}
@ARTICLE{DFR90,
AUTHOR = {F. Dehne and A. Ferreira and A. Rau-Chaplin},
JOURNAL = {Parallel Computing},
TITLE = {Parallel branch and bound on fine grained hypercube
multiprocessors},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-3},
PAGES = {201--209},
VOLUME = {15},
KEY = {j-journal}
}
@ARTICLE{triexp:j,
AUTHOR = {A. Ferreira and M. Gastaldo},
JOURNAL = {La Lettre du Transputer},
TITLE = {Experimentations de deux algorithmes de tri sur un
hypercube de transputers},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {5},
PAGES = {311--21},
OPTVOLUME = {},
KEY = {qf-congnat}
}
@ARTICLE{MR1053934,
AUTHOR = {A. Frieze and C. McDiarmid and B. Reed},
JOURNAL = {SIAM J. Comput.},
TITLE = {Greedy matching on the line},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {666--672},
VOLUME = {19}
}
@ARTICLE{MR1138434,
AUTHOR = {C. McDiarmid and B. Reed},
JOURNAL = {Random Structures Algorithms},
TITLE = {Linear arboricity of random regular graphs},
YEAR = {1990},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {443--445},
VOLUME = {1}
}
@ARTICLE{MR1001383,
AUTHOR = {J.-C. Bermond and K. Berrada and J. Bond},
JOURNAL = {Discrete Math.},
TITLE = {Extensions of networks with given diameter},
YEAR = {1989},
OPTMONTH = {},
NOTE = {Graph theory and combinatorics (In honor of P. Erdös' 75, Cambridge, 1988)},
NUMBER = {1-3},
PAGES = {31--40},
VOLUME = {75}
}
@ARTICLE{MR992988,
AUTHOR = {J.-C. Bermond and O. Favaron and M. Mahéo},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Hamiltonian decomposition of Cayley graphs of degree $4$},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {142--153},
VOLUME = {46}
}
@ARTICLE{MR1000955,
AUTHOR = {J.-C. Bermond and J.-M. Fourneau},
JOURNAL = {Theoret. Comput. Sci.},
TITLE = {Independent connections: an easy characterization of
baseline-equivalent multistage interconnection networks},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {191--201},
VOLUME = {64}
}
@ARTICLE{MR998267,
AUTHOR = {J.-C. Bermond and N. Homobono and C. Peyrat},
JOURNAL = {Graphs Combin.},
TITLE = {Large fault-tolerant interconnection networks},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {107--123},
VOLUME = {5}
}
@ARTICLE{BePe89b,
AUTHOR = {J.-C. Bermond and C. Peyrat},
JOURNAL = {SIAM J. Discrete Math.},
TITLE = {Induced subgraphs of the power of a cycle},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {452--455},
VOLUME = {2}
}
@ARTICLE{CDF89,
AUTHOR = {M. Cosnard and J. Duprat and A. Ferreira},
JOURNAL = {Theoretical Computer Science},
TITLE = {Complexity of selection in X+Y},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {115--120},
VOLUME = {67},
KEY = {j-journal}
}
@ARTICLE{CoFe89,
AUTHOR = {M. Cosnard and A. Ferreira},
JOURNAL = {The Computer Journal},
TITLE = {Generating Permutations on a VLSI Suitable Linear
Network},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
PAGES = {571--573},
VOLUME = {32},
KEY = {j-journal}
}
@ARTICLE{MR989133,
AUTHOR = {C. T. Hoàng and B. A. Reed},
JOURNAL = {Discrete Math.},
TITLE = {$P\sb 4$-comparability graphs},
YEAR = {1989},
OPTMONTH = {},
NOTE = {Graph colouring and variations},
NUMBER = {1-2},
PAGES = {173--200},
VOLUME = {74}
}
@ARTICLE{MR1010579,
AUTHOR = {C. T. Hoàng and B. A. Reed},
JOURNAL = {J. Graph Theory},
TITLE = {Some classes of perfectly orderable graphs},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {445--463},
VOLUME = {13}
}
@ARTICLE{MR1006990,
AUTHOR = {C. J. H. McDiarmid and B. A. Reed},
JOURNAL = {J. Algorithms},
TITLE = {Building heaps fast},
YEAR = {1989},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {352--365},
VOLUME = {10}
}
@ARTICLE{MR983247,
AUTHOR = {J.-C. Bermond and J.-M. Fourneau and A. Jean-Marie},
JOURNAL = {Discrete Appl. Math.},
TITLE = {A graph theoretical approach to equivalence of
multistage interconnection networks},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {201--214},
VOLUME = {22}
}
@ARTICLE{MR992909,
AUTHOR = {J.-C. Bermond and C. Peyrat},
JOURNAL = {Congr. Numer.},
TITLE = {Broadcasting in de Bruijn networks},
YEAR = {1988},
OPTMONTH = {},
NOTE = {Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988)},
OPTNUMBER = {},
PAGES = {283--292},
VOLUME = {66}
}
@ARTICLE{MR958437,
AUTHOR = {M. Bertschi and B. A. Reed},
JOURNAL = {Discrete Math.},
TITLE = {Erratum: ``A note on even pairs'' [Discrete Math. 65
(1987), no. 3, 317--318; MR0897656 (88f:05066)] by Reed},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {187},
VOLUME = {71}
}
@ARTICLE{CFH88,
AUTHOR = {M. Cosnard and A. Ferreira and H. Herbelin},
JOURNAL = {Parallel Computing},
TITLE = {The Two-List Algorithm for the Knapsack Problem on a FPS
T20},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {9},
PAGES = {385--388},
OPTVOLUME = {},
KEY = {j-journal}
}
@ARTICLE{MR961145,
AUTHOR = {A. M. Frieze and B. Jackson and C. J. H. McDiarmid and
B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Edge-colouring random graphs},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {135--149},
VOLUME = {45}
}
@ARTICLE{MR956196,
AUTHOR = {C. L. Monma and B. Reed and Trotter, Jr., W. T.},
JOURNAL = {J. Graph Theory},
TITLE = {Threshold tolerance graphs},
YEAR = {1988},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {343--362},
VOLUME = {12}
}
@ARTICLE{MR920635,
AUTHOR = {J.-C. Bermond and J. Bond and D. Sotteau},
JOURNAL = {Annals of Discrete mathematics},
TITLE = {On regular packings and coverings},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {81--100},
VOLUME = {34},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBS87.pdf}
}
@ARTICLE{BFJ87,
AUTHOR = {J.-C. Bermond and J.-M. Fourneau and A. Jean-Marie},
JOURNAL = {Information Processing Letters},
TITLE = {Equivalence of multistage interconnection networks},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {45--50},
VOLUME = {26}
}
@ARTICLE{MR900933,
AUTHOR = {C. T. Hoàng and B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {A note on short cycles in digraphs},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1-2},
PAGES = {103--107},
VOLUME = {66}
}
@ARTICLE{MR897656,
AUTHOR = {B. A. Reed},
JOURNAL = {Discrete Math.},
TITLE = {A note on even pairs},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {317--318},
VOLUME = {65}
}
@ARTICLE{MR904406,
AUTHOR = {B. Reed},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {A semistrong perfect graph theorem},
YEAR = {1987},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {223--240},
VOLUME = {43}
}
@ARTICLE{BaMu86,
AUTHOR = {F. Baccelli and P. Mussi},
JOURNAL = {IEEE Transactions on Computers},
TITLE = {An asynchronous parallel interpreter for arithmetic
expressions and its evaluation},
YEAR = {1986},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {245--256},
VOLUME = {C35-3},
PUBLISHER = {IEEE}
}
@ARTICLE{BDQ86,
AUTHOR = {J.-C. Bermond and C. Delorme and J.-J. Quisquater},
JOURNAL = {J. Parallel Distributed Computing},
TITLE = {Strategies for interconnection networks: some methods
from graph theory},
YEAR = {1986},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {433--449},
VOLUME = {3},
ADDRESS = {Orlando, FL, USA},
PUBLISHER = {Academic Press, Inc.},
URL = {http://dx.doi.org/10.1016/0743-7315(86)90008-0}
}
@ARTICLE{BePa86,
AUTHOR = {J.-C. Bermond and M. Paoli},
JOURNAL = {Discrete Mathematics},
TITLE = {Research problem: Hamilton powers of graphs},
YEAR = {1986},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {329--331},
VOLUME = {62}
}
@ARTICLE{MR787499,
AUTHOR = {B. Reed},
JOURNAL = {Discrete Math.},
TITLE = {A note on the semistrong perfect graph conjecture},
YEAR = {1985},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {111--112},
VOLUME = {54}
}
@ARTICLE{MR742385,
AUTHOR = {J.-C. Bermond and C. Delorme and G. Farhi},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Large graphs with given degree and diameter. II},
YEAR = {1984},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {32--48},
VOLUME = {36}
}
@ARTICLE{MR772276,
AUTHOR = {J.-C. Bermond and J.-L. Fouquet and M. Habib and
B. Péroche},
JOURNAL = {Discrete Math.},
TITLE = {On linear $k$-arboricity},
YEAR = {1984},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2-3},
PAGES = {123--132},
VOLUME = {52}
}
@ARTICLE{MR747707,
AUTHOR = {J.-C. Bermond and Las Vergnas, M.},
JOURNAL = {Discrete Math.},
TITLE = {Regular factors in nearly regular graphs},
YEAR = {1984},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {9--13},
VOLUME = {50}
}
@ARTICLE{FHBM84,
AUTHOR = {M. Hébert and P. Mussi and O. Faugeras and
J.-D. Boissonnat},
JOURNAL = {Computer Vision, Graphics, and Image Processing},
TITLE = {Polyhedral Approximation of 3-D Objects without Holes},
YEAR = {1984},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTPAGES = {},
VOLUME = {25}
}
@INCOLLECTION{MR721179,
AUTHOR = {J.-C. Bermond and J. Bond and M. Paoli and C. Peyrat},
BOOKTITLE = {Surveys in combinatorics (Southampton, 1983)},
PUBLISHER = {Cambridge Univ. Press},
TITLE = {Graphs and interconnection networks: diameter and
vulnerability},
YEAR = {1983},
ADDRESS = {Cambridge},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {1--30},
SERIES = {London Math. Soc. Lecture Note Ser.},
OPTTYPE = {},
VOLUME = {82}
}
@ARTICLE{MR735197,
AUTHOR = {J.-C. Bermond and Bill Jackson and François Jaeger},
JOURNAL = {J. Combin. Theory Ser. B},
TITLE = {Shortest coverings of graphs with cycles},
YEAR = {1983},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {297--308},
VOLUME = {35}
}
@INCOLLECTION{MR671900,
AUTHOR = {J.-C. Bermond and C. Delorme and G. Farhi},
BOOKTITLE = {Graph theory},
PUBLISHER = {North-Holland},
TITLE = {Large graphs with given degree and diameter. III},
YEAR = {1982},
ADDRESS = {Amsterdam},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {Présenté au Colloque Cambridge, England, 1981},
OPTNUMBER = {},
PAGES = {23--31},
SERIES = {North-Holland Math. Stud.},
OPTTYPE = {},
VOLUME = {62}
}
@INCOLLECTION{MR806968,
AUTHOR = {J.-C. Bermond and G. Farhi},
BOOKTITLE = {Theory and practice of combinatorics},
PUBLISHER = {North-Holland},
TITLE = {Sur un problème combinatoire d'antennes en
radioastronomie. II},
YEAR = {1982},
ADDRESS = {Amsterdam},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {49--53},
SERIES = {North-Holland Math. Stud.},
OPTTYPE = {},
VOLUME = {60}
}
@ARTICLE{MR678026,
AUTHOR = {J.-C. Bermond and C. Delorme and J.-J. Quisquater},
JOURNAL = {Inform. Process. Lett.},
TITLE = {Tables of large graphs with given degree and diameter},
YEAR = {1982},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {10--13},
VOLUME = {15}
}
@ARTICLE{MR647983,
AUTHOR = {J.-C. Bermond and A. Germa and M.-C. Heydemann and
D. Sotteau},
JOURNAL = {Combinatorica},
TITLE = {Longest paths in digraphs},
YEAR = {1981},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {337--341},
VOLUME = {1},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGHS81.pdf}
}
@ARTICLE{MR604304,
AUTHOR = {J.-C. Bermond and C. Thomassen},
JOURNAL = {J. Graph Theory},
TITLE = {Cycles in digraphs---a survey},
YEAR = {1981},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {1--43},
VOLUME = {5}
}
@ARTICLE{MR573645,
AUTHOR = {J.-C. Bermond and P. Frankl and F. Sterboul},
JOURNAL = {Discrete Math.},
TITLE = {On the maximum number of edges in a hypergraph whose
linegraph contains no cycle},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {295--298},
VOLUME = {30}
}
@ARTICLE{MR584678,
AUTHOR = {J.-C. Bermond and A. Germa and M.-C. Heydemann and
D. Sotteau},
JOURNAL = {J. Graph Theory},
TITLE = {Girth in digraphs},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {337--341},
VOLUME = {4},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGHS80.pdf}
}
@ARTICLE{MR598914,
AUTHOR = {J.-C. Bermond and C. Huang and A. Rosa and D. Sotteau},
JOURNAL = {Ars Combin.},
TITLE = {Decomposition of complete graphs into isomorphic
subgraphs with five vertices},
YEAR = {1980},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {211--254},
VOLUME = {10},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHRS80.pdf}
}
@ARTICLE{MR597188,
AUTHOR = {J.-C. Bermond and D. Sotteau and A. Germa and
M.-C. Heydemann},
JOURNAL = {Ann. Discrete Math.},
TITLE = {Chemins et circuits dans les graphes orientés},
YEAR = {1980},
OPTMONTH = {},
NOTE = {Présenté au Colloque Combinatorics 79, Univ. Montréal, Montreal, Canada, 1979},
OPTNUMBER = {},
PAGES = {293--309},
VOLUME = {8},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BSGH80pdf}
}
@INBOOK{Ber79,
PUBLISHER = {Academic Press},
TITLE = {Hamiltonian Graphs},
YEAR = {1979},
AUTHOR = {J.-C. Bermond},
CHAPTER = {6},
EDITOR = {L. Beineke and R. Wilson},
PAGES = {127-167},
OPTADDRESS = {},
OPTEDITION = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
SERIES = {Selected Topics in Graph Theory},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{MR555158,
AUTHOR = {J.-C. Bermond and A. Germa and M.-C. Heydemann},
JOURNAL = {Canad. Math. Bull.},
TITLE = {Hamiltonian cycles in strong products of graphs},
YEAR = {1979},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {305--309},
VOLUME = {22}
}
@ARTICLE{MR530289,
AUTHOR = {J.-C. Bermond and A. Germa and D. Sotteau},
JOURNAL = {J. Combin. Theory Ser. A},
TITLE = {Resolvable decomposition of $K\sp{\ast} \sb{n}$},
YEAR = {1979},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {179--185},
VOLUME = {26},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGS79.pdf}
}
@ARTICLE{MR522008,
AUTHOR = {J.-C. Bermond and Anton Marczyk},
JOURNAL = {C. R. Acad. Sci. Paris Sér. A-B},
TITLE = {Comparaison des puissances de graphes},
YEAR = {1979},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1},
PAGES = {A13--A15},
VOLUME = {288}
}
@ARTICLE{MR557475,
AUTHOR = {J.-C. Bermond and Sim oes-Pereira, J. M. S. and
Christina M. Zamfirescu},
JOURNAL = {Math. Japon.},
TITLE = {On non-Hamiltonian homogeneously traceable digraphs},
YEAR = {1979},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {4},
PAGES = {423--426},
VOLUME = {24}
}
@ARTICLE{MR0505807,
AUTHOR = {J.-C. Bermond},
JOURNAL = {Ann. Discrete Math.},
TITLE = {Hamiltonian decompositions of graphs, directed graphs
and hypergraphs},
YEAR = {1978},
OPTMONTH = {},
NOTE = {Présenté au Cambridge Combinatorial Conf., Advances in graph theory , Trinity College, Cambridge, England, 1977},
OPTNUMBER = {},
PAGES = {21--28},
VOLUME = {3}
}
@ARTICLE{MR543175,
AUTHOR = {J.-C. Bermond and A. Germa and M.-C. Heydemann},
JOURNAL = {Cahiers Centre Études Rech. Opér.},
TITLE = {Graphes représentatifs d'hypergraphes},
YEAR = {1978},
OPTMONTH = {},
NOTE = {Présenté au Colloque Mathématiques Discrètes: Codes et Hypergraphes, Brussels, 1978},
NUMBER = {3-4},
PAGES = {325--329},
VOLUME = {20}
}
@ARTICLE{MR504873,
AUTHOR = {J.-C. Bermond and C. Huang and D. Sotteau},
JOURNAL = {Ars Combin.},
TITLE = {Balanced cycle and circuit designs: even cases},
YEAR = {1978},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {293--318},
VOLUME = {5},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHS78.pdf}
}
@ARTICLE{MR0457287,
AUTHOR = {J.-C. Bermond and P. Frankl},
JOURNAL = {Bull. London Math. Soc.},
TITLE = {On a conjecture of Chvátal on $m$-intersecting
hypergraphs},
YEAR = {1977},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {310--312},
VOLUME = {9}
}
@ARTICLE{MR0472571,
AUTHOR = {J.-C. Bermond and A. Germa and D. Sotteau},
JOURNAL = {Ars Combinatoria},
TITLE = {Hypergraph-designs},
YEAR = {1977},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {47--66},
VOLUME = {3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGS77.pdf}
}
@ARTICLE{MR0463003,
AUTHOR = {J. C. Bermond and M. C. Heydemann and D. Sotteau},
JOURNAL = {Discrete Math.},
TITLE = {Line graphs of hypergraphs. I},
YEAR = {1977},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
PAGES = {235--241},
VOLUME = {18},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BHS77.pdf}
}
@ARTICLE{MR0480188,
AUTHOR = {J.-C. Bermond and J. Schönheim},
JOURNAL = {Discrete Math.},
TITLE = {$G$-decomposition of $K\sb{n}$, where $G$ has four
vertices or less},
YEAR = {1977},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {113--120},
VOLUME = {19}
}
@ARTICLE{MR0396273,
AUTHOR = {},
JOURNAL = {},
TITLE = {Unsolved problems},
YEAR = {1976},
OPTMONTH = {},
NOTE = {Chairman: P. Erdos, With contributions by C. C. Chen, D. E. Daykin, B. Bollobás, P. Erdos, A. Frank, A. Gardiner, F. Jaeger, A. Bondy, L. Lovász, A. Recski, S. Maurer, A. Rényi, C. St. J. A. Nash-Williams, B. Recamán, D. A. Waller, D. D. Grant, M. Las Vergnas, S. E. Eldridge, A. D. Keedwell, J. Sheehan, A. J. W. Hilton, J.-C. Bermond, R. J. Wilson, J. A. Bondy, and R. L. Hemminger},
OPTNUMBER = {},
PAGES = {678--696. Congressus Numerantium, No. XV},
OPTVOLUME = {}
}
@ARTICLE{MR0429627,
AUTHOR = {J.-C. Bermond and V. Faber},
JOURNAL = {J. Combinatorial Theory Ser. B},
TITLE = {Decomposition of the complete directed graph into
$k$-circuits},
YEAR = {1976},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
PAGES = {146--155},
VOLUME = {21}
}
@ARTICLE{MR0416971,
AUTHOR = {J.-C. Bermond and Y. Kodratoff},
JOURNAL = {Rev. Française Automat. Informat. Recherche Opérationnelle Sér. Rouge Informat. Théor.},
TITLE = {Une heuristique pour le calcul de l'indice de
transitivité d'un tournoi},
YEAR = {1976},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {R-1},
PAGES = {83--92},
VOLUME = {10}
}
@INCOLLECTION{MR0382044,
AUTHOR = {},
BOOKTITLE = {Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974)},
PUBLISHER = {Academia},
TITLE = {Problems},
YEAR = {1975},
ADDRESS = {Prague},
OPTCHAPTER = {},
OPTEDITION = {},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {Contributed by P. Erdos, M. Simonovits, V. T. Sós, L. Lovász, J.-C. Bermond, G. O. H. Katona, T. Tarján, R. A. Brualdi, L. S. Mel' nikov and B. Toft},
OPTNUMBER = {},
PAGES = {541--544},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {}
}
@ARTICLE{MR0404040,
AUTHOR = {J.-C. Bermond},
JOURNAL = {Cahiers Centre Études Recherche Opér.},
TITLE = {$1$-graphes réguliers minimaux de girth donné},
YEAR = {1975},
OPTMONTH = {},
NOTE = {Présenté au Colloque sur la Théorie des Graphes, Paris, 1974},
NUMBER = {2-4},
PAGES = {125--135},
VOLUME = {17}
}
@ARTICLE{MR0406865,
AUTHOR = {J.-C. Bermond and J. C. Meyer},
JOURNAL = {Cahiers Centre Études Recherche Opér.},
TITLE = {Hypergraphes et configurations},
YEAR = {1975},
OPTMONTH = {},
NOTE = {Présenté au Colloque sur la Théorie des Graphes, Paris, 1974},
NUMBER = {2-4},
PAGES = {137--154},
VOLUME = {17}
}
@ARTICLE{MR0340094,
AUTHOR = {J.-C. Bermond},
JOURNAL = {Discrete Math.},
TITLE = {An application of the solution of Kirkman's schoolgirl
problem: the decomposition of the symmetric oriented complete graph
into $3$-circuits},
YEAR = {1974},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {301--304},
VOLUME = {8}
}
@ARTICLE{MR0392642,
AUTHOR = {J.-C. Bermond},
JOURNAL = {J. London Math. Soc. (2)},
TITLE = {Nombre chromatique total du graphe $r$-parti complet},
YEAR = {1974},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {279--285},
VOLUME = {9}
}
@ARTICLE{MR0416967,
AUTHOR = {J.-C. Bermond},
JOURNAL = {Discrete Math.},
TITLE = {Some Ramsey numbers for directed graphs},
YEAR = {1974},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {313--321},
VOLUME = {9}
}
@ARTICLE{MR0357227,
AUTHOR = {J.-C. Bermond and J. C. Meyer},
JOURNAL = {J. Math. Pures Appl. (9)},
TITLE = {Graphe représentatif des arêtes d'un multigraphe},
YEAR = {1973},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {299--308},
VOLUME = {52},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BeMe73.pdf}
}
@ARTICLE{MR0366733,
AUTHOR = {J.-C. Bermond and P. Rosenstiehl},
JOURNAL = {Cahiers Centre Études Recherche Opér.},
TITLE = {Pancyclisme du carré du graphe aux arêtes d'un graphe},
YEAR = {1973},
OPTMONTH = {},
NOTE = {Présenté au Colloque sur la Théorie des Graphes,Brussels, 1973},
OPTNUMBER = {},
PAGES = {285--286},
VOLUME = {15}
}
@ARTICLE{MR0307953,
AUTHOR = {J.-C. Bermond},
JOURNAL = {C. R. Acad. Sci. Paris Sér. A-B},
TITLE = {Arbres maximaux ayant au plus $n$ sommets pendants},
YEAR = {1972},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {A1878--A1881},
VOLUME = {274}
}
@ARTICLE{MR0300927,
AUTHOR = {J.-C. Bermond},
JOURNAL = {Math. Sci Humaines},
TITLE = {Ordres à distance minimum d'un tournoi et graphes
partiels sans circuits maximaux},
YEAR = {1972},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {37},
PAGES = {5--25},
OPTVOLUME = {}
}
@ARTICLE{MR0269547,
AUTHOR = {J.-C. Bermond},
JOURNAL = {C. R. Acad. Sci. Paris Sér. A-B},
TITLE = {Graphes orientés fortement $k$-connexes et graphes ``$k$
arc hamiltoniens''},
YEAR = {1970},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
PAGES = {A141--A144},
VOLUME = {271}
}
@INCOLLECTION{DDN+12d,
AUTHOR = {G. D'Angelo and Di Stefano, G. and A. Navarra},
BOOKTITLE = {Search Games and Rendezvous},
PUBLISHER = {Springer},
TITLE = {Gathering asynchronous and oblivious robots on basic
graph topologies under the Look -Compute-Move model},
YEAR = {0},
OPTADDRESS = {},
OPTCHAPTER = {},
OPTEDITION = {},
EDITOR = {Steve Alpern and Robbert Fokkink and Leszek Gasieniec and
Roy Lindelauf and VS Subrahmanian},
OPTMONTH = {},
NOTE = {Volume dedicated to the Workshop on Search and Rendezvous that took place in May 2012 in Lorentz Centre. To appear.},
OPTNUMBER = {},
OPTPAGES = {},
OPTSERIES = {},
OPTTYPE = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00755407},
PDF = {http://hal.inria.fr/hal-00755407/PDF/main.pdf},
ABSTRACT = {Recent and challenging models of robot-based computing
systems consider identical, oblivious and mobile robots placed on the
nodes of anonymous graphs. Robots operate asynchronously in order to
reach a common node and remain with it. This task is known in the
literature as the athering or rendezvous problem. The target node is
neither chosen in advance nor marked differently compared to the
other nodes. In fact, the graph is anonymous and robots have minimal
capabilities. In the context of robot-based computing systems,
resources are always limited and precious. Then, the research of the
minimal set of assumptions and capabilities required to accomplish
the gathering task as well as for other achievements is of main
interest. Moreover, the minimality of the assumptions stimulates the
investigation of new and challenging techniques that might reveal
crucial peculiarities even for other tasks. The model considered in
this chapter is known in the literature as the Look-Compute-Move
model. Identical robots initially placed at different nodes of an
anonymous input graph operate in asynchronous Look-Compute-Move
cycles. In each cycle, a robot takes a snapshot of the current global
configuration (Look), then, based on the perceived configuration,
takes a decision to stay idle or to move to one of its adjacent nodes
(Compute), and in the latter case it makes an instantaneous move to
this neighbor (Move). Cycles are performed asynchronously for each
robot. This means that the time between Look, Compute, and Move
operations is finite but unbounded, and it is decided by the
adversary for each robot. Hence, robots may move based on
significantly outdated perceptions. The only constraint is that moves
are instantaneous, and hence any robot performing a Look operation
perceives all other robots at nodes of the ring and not on edges.
Robots are all identical, anonymous, and execute the same
deterministic algorithm. They cannot leave any marks at visited
nodes, nor can they send messages to other robots. In this chapter,
we aim to survey on recent results obtained for the gathering task
over basic graph topologies, that are rings, grids, and trees. Recent
achievements to this matter have attracted many researchers, and have
provided interesting approaches that might be of main interest to the
community that studies robot-based computing systems.}
}
@ARTICLE{BeHa,
AUTHOR = {S. Bessy and F. Havet},
JOURNAL = {Journal of Combinatorial Optimization},
TITLE = {Enumerating the edge-colourings and total colourings of
a regular graph},
YEAR = {0},
OPTMONTH = {},
NOTE = {to appear},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
PDF = {http://hal.inria.fr/inria-00602188/PDF/RR-7652.pdf},
ABSTRACT = {In this paper, we are interested in computing the number
of edge colourings and total colourings of a graph. We prove that the
maximum number of $k$-edge-colourings of a $k$-regular graph on $n$
vertices is $k\cdot(k-1!)^{n/2}$. Our proof is constructible and
leads to a branching algorithm enumerating all the
$k$-edge-colourings of a $k$-regular graph using a time
$O^*((k-1!)^{n/2})$ and polynomial space. In particular, we obtain a
algorithm on time $O^*(2^{n/2})=O^*(1.4143^n)$ and polynomial space
to enumerate all the $3$-edge colourings of a cubic graph, improving
the running time of $O^*(1.5423^n)$ of the algorithm due to Golovach
et al.\~\cite{GKC10}. We also show that the number of
$4$-total-colourings of a connected cubic graph is at most
$3.2^{3n/2}$. Again, our proof yields a branching algorithm to
enumerate all the $4$-total-colourings of a connected cubic graph.}
}
@ARTICLE{CGM+13,
AUTHOR = {S. Caron and F. Giroire and D. Mazauric and J. Monteiro and
S. Pérennes},
JOURNAL = {ELSEVIER Journal of Peer-to-Peer Networking and Applications, Springer},
TITLE = {P2P Storage Systems: Study of Different Placement
Policies},
YEAR = {0},
OPTMONTH = {},
NOTE = {To appear},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/coati/Publications/CGM+13.pdf},
ABSTRACT = {In a P2P storage system using erasure codes, a data
block is encoded in many redundancy fragments. These fragments are
then sent to distinct peers of the network. In this work, we study
the impact of different placement policies of these fragments on the
performance of storage systems. Several practical factors (easier
control, software reuse, latency) tend to favor data placement
strategies that preserve some degree of locality. We compare three
policies: two of them are {\em local}, in which the data are stored
in logical neighbors, and the other one, {\em global}, in which the
data are spread randomly in the whole system. We focus on the study
of the probability to lose a data block and the bandwidth consumption
to maintain such redundancy. We use simulations to show that, without
resource constraints, the average values are the same no matter which
placement policy is used. However, the variations in the use of
bandwidth are much more bursty under the {\em local} policies. When
the bandwidth is limited, these bursty variations induce longer
maintenance time and henceforth a higher risk of data loss. We then
show that a suitable degree of locality could be introduced in order
to combine the efficiency of the global policy with the practical
advantages of a local placement. Additionally, we propose a new {\em
external reconstruction} strategy that greatly improves the
performance of local placement strategies. Finally, we give
analytical methods to estimate the mean time to the occurrence of
data loss for the three policies.}
}
@ARTICLE{CDD+12,
AUTHOR = {S. Cicerone and G. D'Angelo and Di Stefano, G. and
D. Frigioni and V. Maurizio},
JOURNAL = {Algorithmica},
TITLE = {Engineering a new algorithm for distributed shortest
paths on dynamic networks},
YEAR = {0},
OPTMONTH = {},
NOTE = {to appear},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
PUBLISHER = {Springer},
URL = {http://hal.inria.fr/hal-00728876},
PDF = {http://hal.inria.fr/hal-00728876/PDF/main.pdf},
ABSTRACT = {We study the problem of dynamically updatingall-pairs
shortest paths in a distributed network while edge update operations
occur to the network. We consider the practical case of a dynamic
network in which an edge update can occur while one or more other
edge updates are under processing. A node of the network might be
affected by a subset of these changes, thus being involved in the
concurrent executions related to such changes. In this paper, we
provide a new algorithm for this problem, and experimentally compare
its performance with respect to those of the most popular solutions
in the literature: the classical distributed Bellman-Ford method,
which is still used in real network and implemented in the RIP
protocol, and DUAL, the Diffuse Update ALgorithm, which is part of
CISCO's widely used EIGRP protocol. As input to the algorithms, we
used both real-world and artificial instances of the problem. The
experiments performed show that the space occupancy per node required
by the new algorithm is smaller than that required by both
Bellman-Ford and DUAL. In terms of messages, the new algorithm
outperforms both Bellman-Ford and DUAL on the real-world topologies,
while on artificial instances, the new algorithm sends a number of
messages that is more than that of DUAL and much smaller than that of
Bellman-Ford.}
}
@ARTICLE{DDN12,
AUTHOR = {G. D'Angelo and Di Stefano, G. and A. Navarra},
JOURNAL = {IEEE Transactions on Computers},
TITLE = {Flow problems in multi-interface networks},
YEAR = {0},
OPTMONTH = {},
NOTE = {to appear},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00728878},
PDF = {http://hal.inria.fr/hal-00728878/PDF/main.pdf},
ABSTRACT = {In heterogeneous networks, devices communicate by means
of multiple wired or wireless interfaces. By switching among
interfaces or by combining the available ones, each device might
establish several connections. A connection may be established when
the devices at its endpoints share at least one active interface. In
this paper, we consider two fundamental optimization problems. In the
first one (Maximum Flow in Multi-Interface Networks MFMI), we aim to
establish the maximal bandwidth that can be guaranteed between two
given nodes of the input network. In the second problem (Minimum-Cost
Flow in Multi-Interface Networks MCFMI), we look for activating the
cheapest set of interfaces among a network in order to guarantee a
minimum bandwidth B of communication between two specified nodes. We
show that MFMI is polynomially solvable while MCFMI is NP-hard even
for a bounded number of different interfaces and bounded degree
networks. Moreover, we provide polynomial approximation algorithms
for MCFMI and exact algorithms for relevant sub-problems. Finally, we
experimentally analyze the proposed approximation algorithm, showing
that in practical cases it guarantees a low approximation ratio.}
}
@ARTICLE{FLL+12,
AUTHOR = {W. Fang and X. Liang and S. Li and L. Chiaraviglio and
N. Xiong},
JOURNAL = {Computer Networks},
TITLE = {VMPlanner: Optimizing Virtual Machine Placement and
Traffic Flow Routing to Reduce Network Power Costs in Cloud Data
Centers},
YEAR = {0},
MONTH = {September},
NOTE = {To appear},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
PUBLISHER = {Elsevier},
PDF = {http://www.telematica.polito.it/oldsite/chiaraviglio/papers/VMPlanner.pdf},
ABSTRACT = {In recent years, the power costs of cloud data centers
have become a practical concern and have attracted significant
attention from both industry and academia. Most of the early works on
data center energy efficiency have focused on the biggest power
consumers (i.e., computer servers and cooling systems), yet without
taking the networking part into consideration. However, recent
studies have revealed that the network elements consume 10-20\% of
the total power in the data center, which poses a great challenge to
effectively reducing network power cost without adversely affecting
overall network performance. Based on the analysis on topology
characteristics and traffic patterns of data centers, this paper
presents a novel approach, called VMPlanner, for network power
reduction in the virtualization-based data centers. The basic idea of
VMPlanner is to optimize both virtual machine placement and traffic
flow routing so as to turn off as many unneeded network elements as
possible for power saving. We formulate the optimization problem,
analyze its hardness, and solve it by designing VMPlanner as a
stepwise optimization approach with three approximation algorithms.
VMPlanner is implemented and evaluated in a simulated environment
with traffic traces collected from a data center test-bed, and the
experiment results illustrate the efficacy and efficiency of this
approach.}
}
@ARTICLE{HaSa11,
AUTHOR = {F. Havet and L. Sampaio},
JOURNAL = {Algorithmica},
TITLE = {On the Grundy and $b$-chromatic Numbers of a Graph},
YEAR = {0},
OPTMONTH = {},
NOTE = {To appear},
OPTNUMBER = {},
PAGES = {1-15},
OPTVOLUME = {},
PUBLISHER = {Springer New York}
}
@ARTICLE{HaZh,
AUTHOR = {F. Havet and X. Zhu},
JOURNAL = {Journal of Combinatorial Optimization},
TITLE = {The game Grundy number of graphs},
YEAR = {0},
OPTMONTH = {},
NOTE = {To appear},
OPTNUMBER = {},
OPTPAGES = {},
OPTVOLUME = {},
KEYWORDS = {colouring game, game Grundy number, trees,
partial 2-trees},
URL = {http://hal.inria.fr/inria-00600738},
PDF = {http://hal.inria.fr/inria-00600738/PDF/RR-7646.pdf},
ABSTRACT = {Given a graph G = (V;E), two players, Alice and Bob,
alternate their turns in choosing uncoloured vertices to be coloured.
Whenever an uncoloured vertex is chosen, it is coloured by the least
positive integer not used by any of its coloured neighbours. Alice's
goal is to minimize the total number of colours used in the game, and
Bob's goal is to maximize it. The game Grundy number of G is the
number of colours used in the game when both players use optimal
strategies. It is proved in this paper that the maximum game Grundy
number of forests is 3, and the game Grundy number of any partial
2-tree is at most 7.}
}
@INPROCEEDINGS{ABC+12,
AUTHOR = {M. Ajmone-Marsan and S. Buzzi and L. Chiaraviglio and
M. Meo and C. Guerrero and F. Idzikowski and Y. Ye and
Lopez Vizcaino, J.},
BOOKTITLE = {SustainIT 2012 - The Second IFIP Conference on Sustainable Internet and ICT for Sustainability},
TITLE = {TREND: Toward Real Energy-efficient Network Design},
YEAR = {2012},
ADDRESS = {Pisa, Italy},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-6},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www.telematica.polito.it/oldsite/chiaraviglio/papers/SustainIT2012.pdf},
ABSTRACT = {This paper briefly describes the objectives of the TREND
(Toward Real Energy-efficient Network Design) Network of Excellence
of the European Commission 7th Framework Programme, and outlines some
of the main results obtained so far within the project, looking at
wireless access networks, core networks, and content distribution
issues.}
}
@INPROCEEDINGS{BBD+12a,
AUTHOR = {S. Baruah and V. Bonifaci and G. D'Angelo and H. Li and
A. Marchetti-Spaccamela and Van Der Ster, S. and L. Stougie},
BOOKTITLE = {24th Euromicro Conference on Real-Time Systems (ECRTS12)},
TITLE = {The preemptive uniprocessor scheduling of
mixed-criticality implicit-deadline sporadic task systems},
YEAR = {2012},
ADDRESS = {Pisa, Italy},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {145-154},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00728995},
PDF = {http://hal.inria.fr/hal-00728995/PDF/14-ECRTS12.pdf},
ABSTRACT = {Systems in many safety-critical application domains are
subject to certification requirements.
For any given system,
however, it may be the case that only a subset of its functionality
is safety-critical and hence subject to certification;
the rest of
the functionality is non safety critical and does not need to be
certified, or is certified to a lower level of assurance.
An
algorithm called EDF-VD (for Earliest Deadline First with Virtual
Deadlines) is described for the scheduling of such mixed-criticality
task systems.
Analyses of EDF-VD significantly superior to
previously-known ones are presented, based on metrics such as
processor speedup factor (EDF-VD is proved to be optimal with respect
to this metric) and utilization bounds.}
}
@INPROCEEDINGS{BKN+12,
AUTHOR = {F. Becker and A. Kosowski and N. Nisse and I. Rapaport and
K. Suchan},
BOOKTITLE = {24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)},
TITLE = {Interconnection network with a shared whiteboard: Impact
of (a)synchronicity on computing power},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {11-17},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00627910/fr/},
PDF = {http://hal.inria.fr/inria-00627910/PDF/RR-7746.pdf},
ABSTRACT = {In this work we study the computational power of
graph-based models of distributed computing in which each node
additionally has access to a global whiteboard.
A node can read the
contents of the whiteboard and, when activated, can write one message
of $O(\log n)$ bits on it.
A message is only based on the local
knowledge of the node and the current content of the whiteboard.
When the protocol terminates, each node computes the output based on
the final contents of the whiteboard in order to answer some question
on the network's topology.
We propose a framework to formally
define several scenarios modelling how nodes access the whiteboard,
in a synchronous way or not.
This extends the work of Becker {\it
et al.} [IPDPS 2011] where nodes were imposed to create their
messages only based on their local knowledge (i.e., with the
whiteboard empty).
We prove that the four models studied have
increasing power of computation: any problem that can be solved in
the weakest one can be solved in the the second, and so on.
Moreover, we exhibit problems that {\it separate} models, i.e., that
can be solved in one model but not in a weaker one.
These problems
are related to Maximal Independent Set and detection of cycles.
Finally we investigate problems related to connectivity as the
construction of spanning- or BFS-tree in our different models.}
}
@INPROCEEDINGS{BCM+12,
AUTHOR = {S. Belhareth and D. Coudert and D. Mazauric and N. Nisse and
I. Tahiri},
BOOKTITLE = {IEEE ICC Workshop on New Trends in Optical Networks Survivability},
TITLE = {Reconfiguration with physical constraints in WDM
networks},
YEAR = {2012},
ADDRESS = {Ottawa, Canada},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6346-6350},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00654111/en},
PDF = {http://hal.inria.fr/docs/00/65/41/11/PDF/RR-7850.pdf},
ABSTRACT = {In a WDM network, setting up a new wavelength in a fiber
requires recalibrating the other wavelengths passing through this
fiber. This induces a cost (e.g., time, energy, degradation of QoS)
that depends nonlinearly on the number of wavelengths using the
fiber. When a set of connection requests must change their optical
paths in the network (e.g., during a maintenance operation on a link
in the network), the order in which requests are switched affects the
total cost of the operation. That is, the reconfiguration of the
routing in a WDM network has some cost due to physical layer
impairments. We initiate the study of the corresponding optimization
problem by modeling the cost of switching a request as a non-linear
function depending on the load of the links used by the new
lightpath. We prove that determining the optimal rerouting order is
NP-complete for a $2$-nodes network. We then give general lower and
upper bounds on the minimum cost and we identify classes of instances
where the problem can be solved in polynomial time. Finally, we
design heuristics for this problem and we analyze and compare them by
simulations.}
}
@INPROCEEDINGS{BCD+12,
AUTHOR = {J-C. Bermond and D. Coudert and G. D'Angelo and
F. Z. Moataz},
BOOKTITLE = {ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop},
TITLE = {Diverse Routing in networks with star SRLGs},
YEAR = {2012},
ADDRESS = {Nice, France},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-2},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.archives-ouvertes.fr/hal-00747757},
PDF = {http://hal.archives-ouvertes.fr/hal-00747757/PDF/conext26102012.pdf},
ABSTRACT = {The notion of \emph{Shared Risk Link Group}, SRLG has
been
introduced to capture multiple correlated failures in a
network. A
SRLG is a set of links that fail simultaneously if a
given event (risk)
occurs. In such multiple failures scenario, the
problem of Diverse
Routing consists in finding two SRLG-disjoint
paths between a pair
of nodes. We consider such problem for
localized failures, when all
the links of a SRLG verify the star
property i.e. when they are
incident to the same node. We prove that
in this case the problem
is in general NP-complete and determine
some polynomial cases.}
}
@INPROCEEDINGS{BBN12c,
AUTHOR = {L. Blin and J. Burman and N. Nisse},
BOOKTITLE = {26th International Symposium on Distributed Computing (DISC)},
TITLE = {Brief Announcement: Distributed Exclusive and Perpetual
Tree Searching},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {403-404},
PUBLISHER = {Springer, LNCS},
OPTSERIES = {},
VOLUME = {7611},
URL = {http://hal.inria.fr/hal-00741982},
PDF = {http://hal.inria.fr/docs/00/74/19/82/PDF/disc2012-final88-2.pdf},
ABSTRACT = {We tackle a practical version of the well known {\it
graph searching} problem, where a team of robots aims at capturing an
intruder in a graph.
The robots and the intruder move along the
edges of the graph.
The intruder is invisible, arbitrary fast, and
omniscient.
It is caught whenever it stands on a node occupied by a
robot, and cannot escape to a neighboring node.
We study graph
searching in the CORDA model of mobile computing: robots are
asynchronous, and they perform cycles of {\it Look-Compute-Move}
actions.
Moreover, motivated by physical constraints, we consider
the \emph{exclusive} property, stating that no two or more robots can
occupy the same node at the same time.
In addition, we assume that
the network and the robots are anonymous.
Finally, robots are
\emph{oblivious}, i.e., each robot performs its move actions based
only on its current ''vision'' of the positions of the other robots.
Our objective is to characterize, for a graph $G$, the set of
integers $k$ such that graph searching can be achieved by a team of
$k$ robots starting from \emph{any} $k$ distinct nodes in $G$.
Our
main result consists in a full characterization of this set, for any
asymmetric tree.
Towards providing a characterization for all
trees, including trees with non-trivial automorphisms, we have also
provides a set of positive and negative results, including a full
characterization for any line.
All our positive results are based
on the design of algorithms enabling \emph{perpetual} graph searching
to be achieved with the desired number of robots.}
}
@INPROCEEDINGS{BBN12b,
AUTHOR = {L. Blin and J. Burman and N. Nisse},
BOOKTITLE = {14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Nettoyage perpétuel de réseaux},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {31-34},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.archives-ouvertes.fr/hal-00675233},
PDF = {http://hal.archives-ouvertes.fr/docs/00/67/52/33/PDF/RR-7897.pdf},
ABSTRACT = {Dans le cadre du {\it nettoyage de graphes contaminÃˆs}
({\it graph searching}), des agents mobiles se d\'eplacent
successivement le long des ar\^etes du graphe afin de les {\it
nettoyer}.
Le but g\'en\'eral est le nettoyage en utilisant le
moins d'agents possible.
Nous plaÃons notre Ãˆtude dans le mod\`ele
de calcul distribu\'e {\it CORDA minimaliste}.
Ce mod\`ele est muni
d'hypoth\`eses tr\`es faibles : les n\oe{}uds du r\'eseau et les
agents sont anonymes, n'ont pas de m\'emoire du pass\'e ni sens
commun de l'orientation et agissent par \emph{cycles} {\it
Voir-Calculer-Agir} de mani\`ere \emph{asynchrone}.
Un int\'er\^et
de ce mod\`ele vient du fait que si le nettoyage peut \^etre fait \`a
partir de positions arbitraires des agents (par exemple, apr\`es
pannes ou recontamination), l'absence de m\'emoire implique un
nettoyage perp\'etuel et donc fournit une premi\`ere approche de
nettoyage de graphe {\it tol\'erant aux pannes}.
Les contraintes
dues au mod\`ele {\it CORDA minimaliste} nous am\`enent \`a d\'efinir
une nouvelle variante de nettoyage de graphes - le {\it nettoyage
sans collision}, autrement dit, plusieurs agents ne peuvent occuper
simultan\'ement un m\^eme sommet.
Nous montrons que, dans un
contexte \emph{centralis\'e}, cette variante ne satisfait pas
certaines propri\'et\'es classiques de nettoyage comme par exemple la
monotonie.
Nous montrons qu'interdire les ``collisions'' peut
augmenter le nombre d'agents n\'ecessaires d'un facteur au plus
$\Delta$ le degr\'e maximum du graphe et nous illustrons cette borne.
De plus, nous caract\'erisons compl\`etement le nettoyage sans
collision dans les arbres.
Dans le contexte \emph{distribu\'e}, la
question qui se pose est la suivante.
Existe-t-il un algorithme
qui, \'etant donn\'e un ensemble d'agents mobiles arbitrairement
r\'epartis sur des sommets distincts d'un r\'eseau, permet aux agents
de nettoyer perp\'etuellement le graphe?
Dans le cas des chemins,
nous montrons que la r\'eponse est n\'egative si le nombre d'agents
est pair dans un chemin d'ordre impair, ou si il y a au plus deux
agents dans un chemin d'ordre au moins $3$.
Nous proposons un
algorithme qui nettoie les chemins dans tous les cas restants, ainsi
qu'un algorithme pour nettoyer les arbres lorsqu'un nombre suffisant
d'agents est disponible initialement.}
}
@INPROCEEDINGS{ChCi12,
AUTHOR = {L. Chiaraviglio and A. Cianfrani},
BOOKTITLE = {20th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2012)},
TITLE = {On the Effectiveness of Sleep Modes in Backbone Networks
with Limited Configurations},
YEAR = {2012},
ADDRESS = {Split, Croatia},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-6},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www.telematica.polito.it/oldsite/chiaraviglio/papers/SleepModeEffectiveness.pdf},
ABSTRACT = {We study the problem of putting in sleep mode devices of
a backbone network, while limiting the number of times each device
changes its power state (full power mode or sleep mode).
Our aim is
to limit the number of network configurations, i.e., the change of
the current set of network devices at full power.
We develop a
model, based on random graph theory, to compute the energy saving
given a traffic variation, QoS constraints, and the number of allowed
network configurations.
Results show that the energy savings with
few configurations (two or three per day) are close to the maximum
one, in which a new configuration is applied for each traffic matrix.
Thus, we can conclude that a practical implementation of sleep mode
strategies for network operators is to define, on the basis of
typical traffic trend, few configurations to be activated in specific
time instants.}
}
@INPROCEEDINGS{CHL+12,
AUTHOR = {D. Coudert and L. Hogie and A. Lancin and
D. Papadimitriou and S. Pérennes and I. Tahiri},
BOOKTITLE = {PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012},
TITLE = {Feasibility study on distributed simulations of BGP},
YEAR = {2012},
ADDRESS = {Zhangjiajie, Chine},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00706415},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHL+12.pdf},
ABSTRACT = {The Autonomous System (AS) topology of the Internet (up
to 61k ASs) is growing at a rate of about 10\% per year.
The Border
Gateway Protocol (BGP) starts to show its limits in terms of the
number of routing table entries it can dynamically process and
control.
Due to the increasing routing information processing and
storage, the same trend is observed for routing model simulators such
as DRMSim specialized in large-scale simulations of routing models.
Therefore, DRMSim needs enhancements to support the current size of
the Internet topology and its evolution (up to 100k ASs).
To this
end, this paper proposes a feasibility study of the extension of
DRMSim so as to support the Distributed Parallel Discrete Event
paradigm.
We first detail the possible distribution models and
their associated communication overhead.
Then, we analyze this
overhead by executing BGP on a partitioned topology according to
different scenarios.
Finally, we conclude on the feasibility of
such a simulator by computing the expected additional time required
by a distributed simulation of BGP compared to its sequential
simulation.}
}
@INPROCEEDINGS{DDF+12,
AUTHOR = {G. D'Angelo and M. D'Emidio and D. Frigioni and
V. Maurizio},
BOOKTITLE = {11th International Symposium on Experimental Algorithms (SEA2012)},
TITLE = {Engineering a new loop-free shortest paths routing
algorithm},
YEAR = {2012},
ADDRESS = {Bordeaux, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {123-134},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7276},
URL = {http://hal.inria.fr/hal-00729005},
PDF = {http://hal.inria.fr/hal-00729005/PDF/main.pdf},
ABSTRACT = {We present LFR (Loop Free Routing), a new loop-free
distance vector routing algorithm, which is able to update the
shortest paths of a distributed network with n nodes in fully dynamic
scenarios.
If Phi is the total number of nodes affected by a set of
updates to the network, and phi is the maximum number of destinations
for which a node is affected, then LFR requires O(Phi*Delta) messages
and O(n + phi*Delta) space per node, where Delta is the maximum
degree of the nodes of the network.
We experimentally compare LFR
with DUAL, one of the most popular loop-free distance vector
algorithms, which is part of CISCO's EIGRP protocol and requires
O(Phi*Delta) messages and $\Theta$(n*Delta) space per node.
The
experiments are based on both real-world and artificial instances and
show that LFR is always the best choice in terms of memory require-
ments, while in terms of messages LFR outperforms DUAL on real-world
instances, whereas DUAL is the best choice on artificial instances.}
}
@INPROCEEDINGS{DDF+12b,
AUTHOR = {G. D'Angelo and M. D'Emidio and D. Frigioni and
D. Romano},
BOOKTITLE = {1st Mediterranean Conference on Algorithms},
TITLE = {Enhancing the computation of distributed shortest paths
on real dynamic networks},
YEAR = {2012},
ADDRESS = {Ein-Gedi, Israel},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {148-158},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7659},
URL = {http://hal.inria.fr/hal-00755395},
PDF = {http://hal.inria.fr/hal-00755395/PDF/main.pdf},
ABSTRACT = {The problem of finding and updating shortest paths in
distributed networks is considered crucial in today's practical
applications.
In the recent past, there has been a renewed interest
in devising new efficient distance-vector algorithms as an attractive
alternative to link-state solutions for large-scale Ethernet
networks, in which scalability and reliability are key issues or the
nodes can have limited storage capabilities.
In this paper we
present Distributed Computation Pruning (DCP), a new technique, which
can be combined with every distance-vector routing algorithm based on
shortest paths, allowing to reduce the total number of messages sent
by that algorithm and its space occupancy per node.
To check its
effectiveness, we combined DCP with DUAL (Diffuse Update ALgorithm),
one of the most popular distance-vector algorithm in the literature,
which is part of CISCO's widely used EIGRP protocol, and with the
recently introduced LFR (Loop Free Routing) which has been shown to
have good performances on real networks.
We give experimental
evidence that these combinations lead to a significant gain both in
terms of number of messages sent and memory requirements per node.}
}
@INPROCEEDINGS{DDF+12a,
AUTHOR = {G. D'Angelo and M. D'Emidio and D. Frigioni and
C. Vitale},
BOOKTITLE = {11th International Symposium on Experimental Algorithms (SEA2012)},
TITLE = {Fully Dynamic Maintenance of Arc-Flags in Road Networks},
YEAR = {2012},
ADDRESS = {Bordeaux, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {135-147},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7276},
URL = {http://hal.inria.fr/hal-00729008},
PDF = {http://hal.inria.fr/hal-00729008/PDF/main.pdf},
ABSTRACT = {The problem of finding best routes in road networks can
be solved by applying Dijkstra's shortest paths algorithm.
Unfortunately, road networks deriving from real-world applications
are huge yielding unsustainable times to compute shortest paths.
For this reason, great research efforts have been done to accelerate
Dijkstra's algorithm on road networks.
These efforts have led to
the development of a number of speed-up techniques, as for example
Arc-Flags, whose aim is to compute additional data in a preprocessing
phase in order to accelerate the shortest paths queries in an on-line
phase.
The main drawback of most of these techniques is that they
do not work well in dynamic scenarios.
In this paper we propose a
new algorithm to update the Arc-Flags of a graph subject to edge
weight decrease operations.
To check the practical performances of
the new algorithm we experimentally analyze it, along with a
previously known algorithm for edge weight increase operations, on
real-world road networks subject to fully dynamic sequences of
operations.
Our experiments show a significant speed-up in the
updating phase of the Arc-Flags, at the cost of a small space and
time overhead in the preprocessing phase.}
}
@INPROCEEDINGS{DDK12,
AUTHOR = {G. D'Angelo and Di Stefano, G. and R. Klasing and
A. Navarra},
BOOKTITLE = {19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012)},
TITLE = {Gathering of Robots on Anonymous Grids without
multiplicity detection},
YEAR = {2012},
ADDRESS = {Reykjavìk, Iceland},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {327-338},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7355},
URL = {http://hal.inria.fr/hal-00728988},
PDF = {http://hal.inria.fr/hal-00728988/PDF/main.pdf},
ABSTRACT = {The paper studies the gathering problem on grid
networks.
A team of robots placed at different nodes of a grid,
have to meet at some node and remain there.
Robots operate in
Look-Compute-Move cycles; in one cycle, a robot perceives the current
configuration in terms of occupied nodes (Look), decides whether to
move towards one of its neighbors (Compute), and in the positive case
makes the computed move instantaneously (Move).
Cycles are
performed asynchronously for each robot.
The problem has been
deeply studied for the case of ring networks.
However, the known
techniques used on rings cannot be directly extended to grids.
Moreover, on rings, another assumption concerning the so-called
multiplicity detection capability was required in order to accomplish
the gathering task.
That is, a robot is able to detect during its
Look operation whether a node is empty, or occupied by one robot, or
occupied by an undefined number of robots greater than one.
In this
paper, we provide a full characterization about gatherable
configurations for grids.
In particular, we show that in this case,
the multiplicity detection is not required.
Very interestingly,
sometimes the problem appears trivial, as it is for the case of grids
with both odd sides, while sometimes the involved techniques require
new insights with respect to the well-studied ring case.
Moreover,
our results reveal the importance of a structure like the grid that
allows to overcome the multiplicity detection with respect to the
ring case.}
}
@INPROCEEDINGS{DDN12c,
AUTHOR = {G. D'Angelo and Di Stefano, G. and A. Navarra},
BOOKTITLE = {26th International Symposium on Distributed Computing (DISC 2012)},
TITLE = {How to gather asynchronous oblivious robots on anonymous
rings},
YEAR = {2012},
ADDRESS = {Salvador, Brazil},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {330-344},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7611},
URL = {http://hal.inria.fr/hal-00728979},
PDF = {http://hal.inria.fr/hal-00728979/PDF/main.pdf},
ABSTRACT = {A set of robots arbitrarily placed on different nodes of
an anonymous ring have to meet at one common node and remain in
there.
This problem is known in the literature as the gathering.
Anonymous and oblivious robots operate in Look-Compute-Move cycles;
in one cycle, a robot takes a snapshot of the current configuration
(Look), decides whether to stay idle or to move to one of its
neighbors (Compute), and in the latter case makes the computed move
instantaneously (Move).
Cycles are asynchronous among robots.
Moreover, each robot is empowered by the so called multiplicity
detection capability, that is, it is able to detect during its Look
operation whether a node is empty, or occupied by one robot, or
occupied by an undefined number of robots greater than one.
The
described problem has been extensively studied during the last years.
However, the known solutions work only for specific initial
configurations and leave some open cases.
In this paper, we provide
an algorithm which solves the general problem, and is able to detect
all the ungatherable configurations.
It is worth noting that our
new algorithm makes use of a unified and general strategy for any
initial configuration, even those left open by previous works.}
}
@INPROCEEDINGS{DaMa12,
AUTHOR = {O. Dalle and E. Mancini},
BOOKTITLE = {Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques},
TITLE = {Integrated tools for the simulation analysis of
peer-to-peer backup systems},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {178-183},
PUBLISHER = {ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering)},
SERIES = {SIMUTOOLS '12},
OPTVOLUME = {},
URL = {http://dl.acm.org/citation.cfm?id=2263019.2263042},
PDF = {http://hal.inria.fr/hal-00669241/PDF/paper.pdf},
ABSTRACT = {In order to evaluate the performance and estimate the
resource usage of peer-to-peer backup systems, it is important to
analyze the time they spend in storing, retrieving and keeping the
redundancy of the stored files.
The analysis of such systems is
difficult due to the random behavior of the peers and the variations
of network conditions.
Simulations provide a unique means for
reproducing such varying conditions in a controlled way.
In this
paper we describe a general meta-model for peer-to-peer backup
systems and a tool-chain, based on SimGrid, to help in their
analysis.
We validated the meta-model and tool-chain through the
analysis of a common scenario, and verified that they can be used,
for example, for retrieving the relations between the storage size,
the saved data fragment sizes and the induced network workload.}
}
@INPROCEEDINGS{FGJ+12b,
AUTHOR = {F. V. Fomin and F. Giroire and A. Jean-Marie and
D. Mazauric and N. Nisse},
BOOKTITLE = {14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Satisfaire un internaute impatient est difficile},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {best paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {79-82},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00625703/en/},
PDF = {http://hal.inria.fr/inria-00625703/PDF/RR-7740.pdf},
ABSTRACT = {Consid\'erons un internaute qui va d'une page Web \`a
une autre en suivant les liens qu'il rencontre.
Pour \'eviter que
l'internaute ne (s'im)patiente, il est important d'essayer de
t\'el\'echarger les documents avant que l'internaute ne les atteigne.
Cependant, le co\^ut d'un tel pr\'e-t\'el\'echargement ne doit pas
exc\'eder le gain en temps qu'il g\'en\`ere.
Ainsi, il faut
minimiser la bande passante utilis\'ee pour le
pr\'e-t\'el\'echargement tout en s'assurant que l'internaute
impatient n'attende jamais.
Nous mod\'elisons ce probl\`eme sous
forme d'un jeu de type {\it Cops and Robber} dans les graphes.
En
particulier, \'etant donn\'es un graphe $G$ qui repr\'esente le
graphe du Web et une page Web de d\'epart $v_0 \in V(G)$, nous
d\'efinissons l'{\it indice de contr\^ole} de $G$, $ic(G,v_0) \in
\mathbb{N}$, qui mod\'elise la vitesse minimum de t\'el\'echargement
suffisante pour que l'internaute partant de $v_0$ n'attende jamais
quoi qu'il fasse.
Nous consid\'erons le probl\`eme de d\'ecider si
$ic(G,v_0) \leq k$ et d\'emontrons plusieurs r\'esultats de
complexit\'e.
En particulier, d\'ecider si $ic(G,v_0) \leq 2$ est
NP-difficile si $G$ est cordal, et d\'ecider si $ic(G,v_0) \leq 4$
est PSPACE-complet si $G$ est un graphe orient\'e acyclique.
Nous
donnons un algorithme exponentiel exact qui calcule $ic(G,v_0)$ en
temps $O^*(2^n)$ dans un graphe de $n$ sommets quelconque.
Puis,
nous montrons que le probl\`eme est polynomial dans le cas des arbres
et des graphes d'intervalles.
Enfin, nous donnons une
caract\'erisation combinatoire de l'indice de contr\^ole.
Pour tout
graphe $G$ et $v_0 \in V(G)$, $ic(G,v_0) \geq \max_{S} \lceil
\frac{|N[S]|-1}{|S|} \rceil$ avec $v_0 \in S \subseteq V$, $S$ induit
un sous-graphe connexe et $N[S]$ l'ensemble des sommets de $S$ ou
voisins d'un sommet de $S$.
Il y a de plus \'egalit\'e dans le cas
des arbres.}
}
@INPROCEEDINGS{FGJ+12a,
AUTHOR = {F. V. Fomin and F. Giroire and A. Jean-Marie and
D. Mazauric and N. Nisse},
BOOKTITLE = {6th International Conference on FUN with Algorithms (FUN)},
TITLE = {To Satisfy Impatient Web surfers is Hard},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {166-176},
PUBLISHER = {Springer, LNCS},
OPTSERIES = {},
VOLUME = {7288},
URL = {http://hal.inria.fr/inria-00625703/en/},
PDF = {http://hal.inria.fr/inria-00625703/PDF/RR-7740.pdf},
ABSTRACT = {Prefetching is a basic mechanism to avoid to waste time
when accessing data.
However, a tradeoff must be established
between the amount of network's resources wasted by the prefetching
and the gain of time.
For instance, in the Web, browsers may
download documents in advance while an Internaut is surfing on the
Web.
Since the web surfer follows the hyperlinks in an
unpredictable way, the choice of the web pages to be prefetched must
be computed online.
The question is then to determine the minimum
amount of resources used by prefetching and that ensures that all
documents accessed by the web surfer have previously been loaded in
the cache.
We model this problem as a game similar to Cops and
Robber Games in graphs.
A fugitive starts on a marked vertex of a
(di)graph G. Turn by turn, an observer marks at most k >= 1 vertices
and then the fugitive can move along one edge/arcs of G.
The
observer wins if he prevents the fugitive to reach an unmarked
vertex.
The fugitive wins otherwise, i.e., if she enters an
unmarked vertex.
The surveillance number of a graph is the least k
>=1 allowing the observer to win whatever the fugitive does.
We
also consider the connected variant of this game, i.e., when a vertex
can be marked only if it is adjacent to an already marked vertex.
All our results hold for both variants, connected or not.
We show
that deciding whether the surveillance number of a chordal graph
equals 2 is NP-hard.
Deciding if the surveillance number of a DAG
equals 4 is PSPACE-complete.
Moreover, computing the surveillance
number is NP-hard in split graphs.
On the other hand, we provide
polynomial time algorithms to compute surveillance number of trees
and interval graphs.
Moreover, in the case of trees, we establish a
combinatorial characterization, related to isoperimetry, of the
surveillance number.}
}
@INPROCEEDINGS{GMP+12,
AUTHOR = {F. Giroire and J. Moulierac and T.K. Phan and F. Roudaut},
BOOKTITLE = {IFIP Networking},
TITLE = {Minimization of Network Power Consumption with
Redundancy Elimination},
YEAR = {2012},
ADDRESS = {Prague, Czech Republic},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {247-258},
PUBLISHER = {Springer},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00721855},
PDF = {http://hal.inria.fr/docs/00/72/18/55/PDF/GMP_12.pdf},
ABSTRACT = {Recently, energy-aware routing has gained increasing
popularity in the networking research community.
The idea is that
traffic demands are aggregated over a subset of the network links,
allowing other links to be turned off to save energy.
In this
paper, we propose GreenRE - a new energy-aware routing model with the
support of the new technique of data redundancy elimination (RE).
This technique, enabled within the routers, can identify and remove
repeated content from network transfers.
Hence, capacity of network
links are virtually increased and more traffic demands can be
aggregated.
Based on our real experiments on Orange Labs platform,
we show that performing RE consumes some energy.
Thus, while
preserving connectivity and QoS, it is important to identify at which
routers to enable RE and which links to turn off so that the power
consumption of the network is minimized.
We model the problem as an
Integer Linear Program and propose a greedy heuristic algorithm.
Simulations on several network
topologies show that GreenRE can
gain further 30% of energy savings in comparison with the traditional
energy-aware routing model.}
}
@INPROCEEDINGS{GPF12,
AUTHOR = {A. Goldman and P. Floriano and A. Ferreira},
BOOKTITLE = {Proceedings of the 4th Extreme Conference on Communication},
TITLE = {A tool for obtaining information on DTN traces},
YEAR = {2012},
ADDRESS = {Zurique, CH},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {extremecom2012.ee.ethz.ch/papers/12-extremecom2012-Floriano.pdf},
ABSTRACT = {The applications for dynamic networks are growing every
day, and thus, so is the number of studies on them.
An important
part of such studies is the generation of results through simulation
and comparison with other works.
We implemented a tool to generate
information on a given network trace, obtained by building its
corresponding evolving graph.
This information is useful to help
researchers choose the most suitable trace for their work, to
interpret the results correctly and to compare data from their work
to the optimal results in the network.
In this work, we present the
implementation of the DTNTES tool which provides the aforementioned
services and use the system to evaluate the DieselNet trace.}
}
@INPROCEEDINGS{IDJ+12,
AUTHOR = {F. Idzikowski and R. Duque and F. Jimenez and
Le Rouzic, E. and L. Chiaraviglio and M. Ajmone-Marsan},
BOOKTITLE = {ECOC 2012 - European Conference and Exhibition on Optical Communication},
TITLE = {Energy Saving in Optical Operator Networks: the
Challenges, the TREND Vision, and Some Results},
YEAR = {2012},
ADDRESS = {Amsterdam, Netherlands},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-3},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www.telematica.polito.it/oldsite/chiaraviglio/papers/ECOC2012.pdf},
ABSTRACT = {We discuss how to save energy in IP-over-WDM networks,
presenting the vision of TREND, the FP7 NoE, and the saving that can
be obtained with an adaptive routing solution that puts network
interfaces of various granularities to sleep in periods of low
traffic.
Results refer to two operator networks, considering power
and traffic forecasts for 2020.}
}
@INPROCEEDINGS{KLN+12c,
AUTHOR = {A. Kosowski and B. Li and N. Nisse and K. Suchan},
BOOKTITLE = {14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {k-Chordal Graphs: from Cops and Robber to Compact
Routing via Treewidth},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {83-86},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00671861},
PDF = {http://hal.archives-ouvertes.fr/docs/00/67/18/97/PDF/RR-7888.pdf},
ABSTRACT = {{\it Cops and robber games} concern a team of cops that
must capture a robber moving in a graph.
We consider the class of
$k$-chordal graphs, i.e., graphs with no induced cycle of length
greater than $k$, $k\geq 3$.
We prove that $k-1$ cops are always
sufficient to capture a robber in $k$-chordal graphs.
This leads us
to our main result, a new structural decomposition for a graph class
including $k$-chordal graphs.
We present a quadratic algorithm
that, given a graph $G$ and $k\geq 3$, either returns an induced
cycle larger than $k$ in $G$, or computes a {\it tree-decomposition}
of $G$, each {\it bag} of which contains a dominating path with at
most $k-1$ vertices.
This allows us to prove that any $k$-chordal
graph with maximum degree $\Delta$ has treewidth at most
$(k-1)(\Delta-1)+2$, improving the $O(\Delta (\Delta-1)^{k-3})$ bound
of Bodlaender and Thilikos (1997).
Moreover, any graph admitting
such a tree-decomposition has hyperbolicity $\leq\lfloor
\frac{3}{2}k\rfloor$.
As an application, for any $n$-node graph
admitting such a tree-decomposition, we propose a {\it compact
routing scheme} using routing tables, addresses and headers of size
$O(\log n)$ bits and achieving an additive stretch of $O(k\log
\Delta)$.
As far as we know, this is the first routing scheme with
$O(\log n)$-routing tables and small additive stretch for $k$-chordal
graphs.}
}
@INPROCEEDINGS{KLN+12b,
AUTHOR = {A. Kosowski and B. Li and N. Nisse and K. Suchan},
BOOKTITLE = {39th International Colloquium on Automata, Languages and Programming (ICALP, track C)},
TITLE = {k-Chordal Graphs: from Cops and Robber to Compact
Routing via Treewidth},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {610-622},
PUBLISHER = {Springer, LNCS},
OPTSERIES = {},
VOLUME = {7392},
URL = {http://hal.inria.fr/hal-00671861},
PDF = {http://hal.archives-ouvertes.fr/docs/00/67/18/97/PDF/RR-7888.pdf},
ABSTRACT = {{\it Cops and robber games} concern a team of cops that
must capture a robber moving in a graph.
We consider the class of
$k$-chordal graphs, i.e., graphs with no induced cycle of length
greater than $k$, $k\geq 3$.
We prove that $k-1$ cops are always
sufficient to capture a robber in $k$-chordal graphs.
This leads us
to our main result, a new structural decomposition for a graph class
including $k$-chordal graphs.
We present a quadratic algorithm
that, given a graph $G$ and $k\geq 3$, either returns an induced
cycle larger than $k$ in $G$, or computes a {\it tree-decomposition}
of $G$, each {\it bag} of which contains a dominating path with at
most $k-1$ vertices.
This allows us to prove that any $k$-chordal
graph with maximum degree $\Delta$ has treewidth at most
$(k-1)(\Delta-1)+2$, improving the $O(\Delta (\Delta-1)^{k-3})$ bound
of Bodlaender and Thilikos (1997).
Moreover, any graph admitting
such a tree-decomposition has hyperbolicity $\leq\lfloor
\frac{3}{2}k\rfloor$.
As an application, for any $n$-node graph
admitting such a tree-decomposition, we propose a {\it compact
routing scheme} using routing tables, addresses and headers of size
$O(\log n)$ bits and achieving an additive stretch of $O(k\log
\Delta)$.
As far as we know, this is the first routing scheme with
$O(\log n)$-routing tables and small additive stretch for $k$-chordal
graphs.}
}
@INPROCEEDINGS{PMT+12,
AUTHOR = {J. Moulierac and T.K. Phan and N. Thoai and N.C. Tran},
BOOKTITLE = {ACM CoNEXT Student Workshop},
TITLE = {Xcast6 Treemap Islands - Revisiting Multicast Model},
YEAR = {2012},
ADDRESS = {Nice, France},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00749266},
PDF = {http://hal.inria.fr/docs/00/74/92/66/PDF/stud16-phan.pdf},
ABSTRACT = {Due to the complexity and poor scalability, IP Multicast
has not been used on the Internet. Recently, Xcast6 - a complementary
protocol of IP Multicast has been proposed.
However, the key
limitation of Xcast6 is that it only supports small multicast
sessions.
To overcome this, we propose Xcast6 Treemap islands
(X6Ti) - a hybrid model of Overlay Multicast and Xcast6.
In
summary, X6Ti has many advantages: support large multicast groups,
simple and easy to deploy on the Internet, no router configuration,
no restriction on the number of groups, no multicast routing protocol
and no group management protocol.
Based on simulation, we compare
X6Ti with IP Multicast and NICE protocols to show the benefits of our
new model.}
}
@INPROCEEDINGS{PTN+12,
AUTHOR = {D.D. Nguyen and T.K. Phan and N. Thoai and T.T. Tran},
BOOKTITLE = {Modeling, Simulation and Optimization of Complex Processes},
TITLE = {MaxNet and TCP Reno/RED on Mice Traffic},
YEAR = {2012},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {247-255},
PUBLISHER = {Springer Berlin Heidelberg},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00721882},
PDF = {http://hal.inria.fr/docs/00/72/18/82/PDF/PTN_12.pdf},
ABSTRACT = {Congestion control is a distributed algorithm to share
network bandwidth among competing users on the Internet.
In the
common case, quick response time for mice traffic (HTTP traffic) is
desired when mixed with elephant traffic (FTP traffic).
The current
approach using loss-based with Additive Increase, Multiplicative
Decrease (AIMD) is too greedy and eventually, most of the network
bandwidth would be consumed by elephant traffic.
As a result, it
causes longer response time for mice traffic because there is no room
left at the routers.
MaxNet is a new TCP congestion control
architecture using an explicit signal to control transmission rate at
the source node.
In this paper, we show that MaxNet can control
well the queue length at routers and therefore the response time to
HTTP traffic is several times faster than with TCP Reno/RED.}
}
@INPROCEEDINGS{ABG+11b,
AUTHOR = {J. Araujo and J-C. Bermond and F. Giroire and F. Havet and
D. Mazauric and R. Modrzejewski},
BOOKTITLE = {Combinatorial Algorithms},
TITLE = {Weighted Improper Colouring},
YEAR = {2011},
ADDRESS = {Victoria, Canada},
EDITOR = {C. S. Iliopoulos and W. F. Smyth},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-18},
PUBLISHER = {Springer Berlin Heidelberg},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {7056},
URL = {http://dx.doi.org/10.1007/978-3-642-25011-8_1},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ABG+11b.pdf},
ABSTRACT = {In this paper, we study a colouring problem motivated by
a
practical frequency assignment problem and up to our best
knowledge new. In wireless networks, a node interferes with the
other nodes the level of interference depending on numerous
parameters: distance between the nodes, geographical topography,
obstacles, etc. We model this with a weighted graph $G$ where the
weights on the edges represent the noise (interference) between the
two end-nodes. The total interference in a node is then the sum of
all the noises of the nodes emitting on the same frequency. A
weighted $t$-improper $k$-colouring of $G$ is a $k$-colouring of the
nodes of $G$ (assignment of $k$ frequencies) such that the
interference at each node does not exceed some threshold
$t$. The
Weighted Improper Colouring problem, that we consider here
consists
in determining the weighted $t$-improper chromatic number
defined as
the minimum integer $k$ such that $G$ admits a weighted
$t$-improper
$k$-colouring. We also consider the dual problem, denoted the
Threshold Improper Colouring problem, where given a number $k$ of
colours (frequencies) we want to determine the minimum real $t$ such
that $G$ admits a weighted $t$-improper $k$-colouring. We show that
both problems are NP-hard and first present general upper bounds; in
particular we show a generalisation of Lov\'asz's Theorem for the
weighted $t$-improper chromatic number. We then show how to
transform an instance of the Threshold Improper Colouring problem
into another equivalent one where the weights are either 1 or $M$,
for a sufficient big value $M$. Motivated by the original
application, we study a special interference model on various grids
(square, triangular, hexagonal) where a node produces a noise of
intensity 1 for its neighbours and a noise of intensity 1/2 for the
nodes that are at distance 2. Consequently, the problem consists of
determining the weighted $t$-improper chromatic number when $G$ is
the square of a grid and the weights of the edges are 1, if
their
end nodes are adjacent in the grid, and 1/2 otherwise.
Finally, we
model the problem using linear integer programming,
propose and test
heuristic and exact Branch-and-Bound algorithms on
random cell-like
graphs, namely the Poisson-Voronoi tessellations.}
}
@INPROCEEDINGS{ACGS+11b,
AUTHOR = {J. Araujo and V. Campos and F. Giroire and L. Sampaio and
R. Soares},
BOOKTITLE = {Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'11)},
TITLE = {On the hull number of some graph classes},
YEAR = {2011},
ADDRESS = {Budapest, Hungary},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {49-55},
OPTPUBLISHER = {},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {38},
URL = {http://www.sciencedirect.com/science/article/pii/S1571065311000783},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACGS+11b.pdf},
ABSTRACT = {Given a graph G = (V, E), the closed interval of a pair
of vertices u, v \in V ,
denoted by I[u, v], is the set of vertices
that belongs to some shortest (u, v)-path.
For a given S \subseteq V
, let I[S] = u,v \in S I[u, v]. We say that S \subseteq V is a convex
set if
I[S] = S.
The convex hull Ih [S] of a subset S \subseteq V
is the smallest convex set that contains
S. We say that S is a hull
set if Ih [S] = V . The cardinality of a minimum hull set
of G is
the hull number of G, denoted by hn(G).
We show that deciding if
hn(G) \leq k is an NP-complete problem, even if G is
bipartite. We
also prove that hn(G) can be computed in polynomial time for cactus
and P4 -sparse graphs.
}
}
@INPROCEEDINGS{AGM11,
AUTHOR = {J. Araujo and F. Giroire and J. Monteiro},
BOOKTITLE = {Proceedings of Fourth International Conference on Data Management in Grid and P2P Systems (Globe'11)},
TITLE = {Hybrid Approaches for Distributed Storage Systems},
YEAR = {2011},
ADDRESS = {Toulouse, France},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00635781/fr/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGM11.pdf},
ABSTRACT = {Distributed or peer-to-peer storage solutions rely on
the in-
troduction of redundant data to be fault-tolerant and to
achieve high
reliability. One way to introduce redundancy is by
simple replication.
This strategy allows an easy and fast access to
data, and a good band-
width efficiency to repair the missing
redundancy when a peer leaves or
fails in high churn systems.
However, it is known that erasure codes, like Reed-Solomon, are an
effi-
cient solution in terms of storage space to obtain high
durability when
compared to replication.
Recently, the Regenerating
Codes were proposed as an improvement of
erasure codes to better use
the available bandwidth when reconstructing
the missing
information.
In this work, we compare these codes with two hybrid
approaches. The
first was already proposed and mixes erasure codes
and replication. The
second one is a new proposal that we call
Double Coding. We compare
these approaches with the traditional
Reed-Solomon code and also Re-
generating Codes from the point of
view of availability, durability and
storage space. This comparison
uses Markov Chain Models that take into
account the reconstruction
time of the systems.
}
}
@INPROCEEDINGS{BHT11,
AUTHOR = {J. Bang-Jensen and F. Havet and N. Trotignon},
BOOKTITLE = {VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011)},
TITLE = {Finding an induced subdivision of a digraph},
YEAR = {2011},
ADDRESS = {Bariloche, Argentina},
OPTEDITOR = {},
MONTH = {04},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {09-14},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {37},
JOURNAL = {Electronic Notes on Discrete Mathematics},
ABSTRACT = {We consider the following problem for oriented graphs
and digraphs:
Given an oriented graph (digraph) $G$, does it contain
an induced
subdivision of a prescribed digraph $D$? The complexity
of
this problem depends on $D$ and on whether $H$ must be an
oriented
graph or is allowed to contain 2-cycles. We give a number
of examples of polynomial instances as well as several
NP-completeness proofs.
}
}
@INPROCEEDINGS{BBD+11b,
AUTHOR = {Baruah, K., Sanjoy and Vincenzo Bonifaci and G. D'Angelo and
Alberto Marchetti-Spaccamela and Ster, Van Der, Suzanne and
Leen Stougie},
BOOKTITLE = {19th Annual European Symposium on Algorithms (ESA 2011)},
TITLE = {Mixed-Criticality Scheduling of Sporadic Task Systems},
YEAR = {2011},
ADDRESS = {Saarbruecken, Germany},
EDITOR = {Camil Demetrescu and Magnús M. Halldórsson},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {555-566},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6942},
URL = {http://hal.inria.fr/hal-00643987/en/},
PDF = {http://hal.inria.fr/hal-00643987/PDF/MixedTasks.pdf},
ABSTRACT = {We consider the scheduling of mixed-criticality task
systems, that is, systems where each task to be scheduled has
multiple levels of worst-case execution time estimates. We design a
scheduling algorithm, EDF-VD, whose effectiveness we analyze using
the processor speedup metric: we show that any 2-level task system
that is schedulable on a unit-speed processor is correctly scheduled
by EDF-VD using speed $\phi$; here $\phi$ 2 criticality levels.We
finally consider 2-level instances on m identical machines. We prove
speedup bounds for scheduling an independent collection of jobs and
for the partitioned scheduling of a 2-level task system.}
}
@INPROCEEDINGS{BBB+11,
AUTHOR = {J. Beauquier and P. Blanchard and J. Burman and
S. Delaet},
BOOKTITLE = {13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011},
TITLE = {Computing Time Complexity of Population Protocols with
Cover Times - the ZebraNet Example},
YEAR = {2011},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {47-61},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00639583/en/},
ABSTRACT = {Population protocols are a communication model for
large
sensor networks with resource-limited mobile agents. The
agents move
asynchronously and communicate via pair-wise
interactions. The original
fairness assumption of this model
involves a high level of asynchrony
and prevents an evaluation of
the convergence time of a protocol (via
deterministic means). The
introduction of some "partial synchrony" in
the model, under the
form of cover times, is an extension that allows
evaluating the time
complexities.
In this paper, we take advantage of this extension and
study a data
collection protocol used in the ZebraNet project for
the wild-life tracking
of zebras in a reserve in central Kenya. In
ZebraNet, sensors are attached
to zebras and the sensed data is
collected regularly by a mobile base
station crossing the area. The
data collection protocol of ZebraNet has
been analyzed through
simulations, but to our knowledge, this is the rst
time, that a
purely analytical study is presented. Our first result is that,
in
the original protocol, some data may never be delivered to the base
station. We then propose two slightly modify ed and correct protocols
and
we compute their worst case time complexities. Still, in both
cases, the
result is far from the optimal.}
}
@INPROCEEDINGS{BeBu11,
AUTHOR = {J. Beauquier and J. Burman},
BOOKTITLE = {15th International Conference On Principles Of Distributed Systems, OPODIS 2011},
TITLE = {Self-stabilizing Mutual Exclusion and Group Mutual
Exclusion for Population Protocols with Covering},
YEAR = {2011},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00639651/en/},
ABSTRACT = {This paper presents and proves correct two
self-stabilizing deterministic
algorithms solving the mutual
exclusion and the group mutual exclusion problems
in the model of
population protocols with covering. In this variant of the
population protocol model, a local fairness is used and bounded state
anonymous
mobile agents interact in pairs according to constraints
expressed in terms of their
cover times. The cover time is an
indicator of the "time" for an agent to communicate
with all the
other agents. This indicator is expressed in the number of the
pairwise communications (events) and is unknown to agents. In the
model, we
also assume the existence of a particular agent, the base
station. In contrast with
the other agents, it has a memory size
proportional to the number of the agents.
We prove that without this
kind of assumption, the mutual exclusion problem has
no solution.
The algorithms in the paper use a phase clock tool. This is a
synchronization
tool that was recently proposed in the model we use.
For our needs, we extend
the functionality of this tool to support
also phases with unbounded (but finite)
duration. This extension
seems to be useful also in the future works.}
}
@INPROCEEDINGS{BBM11,
AUTHOR = {J. Beauquier and J. Burman and V. Malykh},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {ZebraNet Analysé dans le Modéle des Protocoles de
Population},
YEAR = {2011},
ADDRESS = {Cap Estérel, France},
EDITOR = {et Bertrand et Felber et Pascal, Ducourthial},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00586503/fr/},
ABSTRACT = {Nous \'etudions le protocole de collecte de donn\'ees du
projet ZebraNet, dans le modÄle des protocoles de population. Dans
ce
projet des capteurs sont attach\'es \'a une population de
z\'ebres, en Afrique Centrale, et fournissent des donn\'ees aux
biologistes
qui \'etudient leurs structures migratoires et
comportementales. Nous montrons qu'un protocole voisin de celui
utilis\'e dans ce
projet ne se termine pas. Cela entra\^ine que le
protocole originel ne se termine pas non plus. Aussi proposons nous
une
modification qui fournit la terminaison. Nous prouvons la
correction de ce protocole modifi\'e et nous analysons sa
complexit\'e
en temps au pire, dans le mod\'ele des protocoles de
population avec temps de couverture. La comparaison de cette
complexit\'e
avec celle du protocole optimal est tr\'es
d\'efavorable.
Le protocole de collecte de donn\'ees de ZebraNet a
fait l'objet de simulations, mais c'est la premi\'ere fois, \'a notre
connaissance,
qu'est r\'ealis\'ee une \'etude purement analytique.}
}
@INPROCEEDINGS{BMN+11,
AUTHOR = {F. Becker and M. Matamala and N. Nisse and I. Rapaport and
K. Suchan and I. Todinca},
BOOKTITLE = {25th IEEE International Parallel & Distributed Processing Symposium (IPDPS)},
TITLE = {Adding a referee to an interconnection network: What
can(not) be computed in one round},
YEAR = {2011},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {508-514},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://arxiv.org/abs/1009.4447},
PDF = {http://arxiv.org/pdf/1009.4447v2},
ABSTRACT = {{In this paper we ask which properties of a distributed
network can be computed from a little amount of local information
provided by its nodes. The distributed model we consider is a
restriction of the classical CONGEST (distributed) model and it is
close to the simultaneous messages (communication complexity) model
defined by Babai, Kimmel and Lokam. More precisely, each of these n
nodes -which only knows its own ID and the IDs of its neighbors- is
allowed to send a message of O(log n) bits to some central entity,
called the referee. Is it possible for the referee to decide some
basic structural properties of the network topology G? We show that
simple questions like, "does G contain a square?", "does G contain a
triangle?" or "Is the diameter of G at most 3? cannot be solved in
general. On the other hand, the referee can decode the messages in
order to have full knowledge of G when G belongs to many graph
classes such as planar graphs, bounded treewidth graphs and, more
generally, bounded
degeneracy graphs. We leave open questions
related to the connectivity of arbitrary graphs. },
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={yes},
x-pays = {CL},
sorte = "conf-int",
}
}
@INPROCEEDINGS{BMN+11b,
AUTHOR = {F. Becker and M. Matamala and N. Nisse and I. Rapaport and
K. Suchan and I. Todinca},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Reconstruire un graphe en une ronde},
YEAR = {2011},
ADDRESS = {Cap Estérel, France},
EDITOR = { Ducourthial and et Felber, Bertrand and Pascal},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00587250/en},
ABSTRACT = {{Nous Ã©tudions quelles propriÃ©tÃ©s d'un rÃ©seau
peuvent Ãªtre calculÃ©es Ã partir d'une petite quantitÃ©
d'informations locales fournie par ses noeuds. Notre modÃ¨le est une
restriction de CONGEST, un modÃ¨le distribuÃ© classique. Il est
proche du modÃ¨le de complexitÃ© de communication avec messages
simultanÃ©s de Babai et al. Chacun des n noeuds --qui ne connaissent
que leur identifiant, ceux de leurs voisins et la taille du graphe--
envoie un message de taille O(log(n)) bits Ã une entitÃ© centrale, le
superviseur. Celui-ci doit alors dÃ©terminer une certaine propriÃ©tÃ©
du rÃ©seau. Nous montrons que des questions telles que: ''Est-ce que
le graphe contient un triangle? un carrÃ© ? Quel est son diamÃ¨tre?"
ne peuvent pas Ãªtre rÃ©solues dans ce modÃ¨le. En revanche, pour de
nombreuses classes de graphes : celles de dÃ©gÃ©nÃ©rescence bornÃ©e
(incluant les graphes planaires, ceux de largeur arborescente
bornÃ©e... ), les sommets peuvent succinctement donner une
description complÃ¨te du graphe au superviseur. Nous laissons
ouverte la question de dÃ©cider la connexitÃ©.},
x-editorial-board={yes},
x-proceedings={yes},
x-international-audience={no},
x-pays= {CL},
sorte = "conf-nat",
}
}
@INPROCEEDINGS{BCM+11,
AUTHOR = {S. Belhareth and D. Coudert and D. Mazauric and N. Nisse and
I. Tahiri},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Reconfiguration avec contraintes physiques dans les
réseaux WDM},
YEAR = {2011},
ADDRESS = {Cap Estérel, France},
EDITOR = {et Bertrand et Felber et Pascal, Ducourthial},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00583829/en},
PDF = {http://hal.inria.fr/docs/00/58/77/09/PDF/reconf-20110406.pdf},
ABSTRACT = {Dans un rÃ©seau WDM, utiliser une nouvelle longueur
d'onde dans une ï¬bre demande Ã recalibrer les autres longueurs
d'ondes. Cela gÃ©nÃ¨re un coÃ»t (e.g., Ã©nergÃ©tique) qui dÃ©pend non
linÃ©airement du nombre de longueurs d'ondes utilisant la ï¬bre.
Lorsqu'un ensemble de requÃªtes doivent changer de chemins optiques
dans le rÃ©seau (lors d'une opÃ©ration de maintenance sur un lien du
rÃ©seau), l'ordre dans lequel les requÃªtes sont dÃ©placÃ©es inï¬‚ue
sur le coÃ»t total de l'opÃ©ration. Nous initions l'Ã©tude du
problÃ¨me d'optimisation correspondant. Nous prouvons que dÃ©terminer
l'ordre de dÃ©placements optimal est NP-complet pour un rÃ©seau de 2
nÅ“uds. Nous donnons des bornes gÃ©nÃ©rales et identiï¬ons des
classes d'instances faciles. Enï¬n, nous proposons et Ã©valuons par
simulations des heuristiques pour ce problÃ¨me.}
}
@INPROCEEDINGS{BGP+11,
AUTHOR = {J-C. Bermond and L. Gargano and
and
A.A. Rescigno, S. Pérennes and U. Vaccaro},
BOOKTITLE = {SIROCCO 2011},
TITLE = {Optimal Time Data Gathering in Wireless Networks
with
Omni-Directional Antennas},
YEAR = {2011},
ADDRESS = {Gdansk, Poland},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {306-317},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6796},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGPRV11.pdf},
ABSTRACT = {We study algorithmic and complexity issues originating
from
the problem of data gathering
in wireless networks.
We give
an algorithm to construct
minimum makespan transmission schedules
for data gathering
when the communication graph
$G$ is a tree
network, the interference range is \emph{any}
integer $m\geq 2$, and
no buffering is allowed at intermediate nodes.
In the interesting
case in which all nodes in the network have to deliver
an arbitrary
non-zero number of packets,
we provide a closed formula for the
makespan of the optimal gathering schedule.
Additionally, we
consider the problem of determining the
computational complexity of
data gathering in general graphs
and show that the problem is weakly
NP-complete. On the positive side,
we design
a simple $(1+2/m)$
factor approximation algorithm for general networks.}
}
@INPROCEEDINGS{CaKo11,
AUTHOR = {C. Caillouet and A. Koster},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Routage et Ordonnancement Robustes dans les Réseaux
Radio Maillés},
YEAR = {2011},
ADDRESS = {Cap Estérel, France},
EDITOR = { Ducourthial and et Felber, Bertrand and Pascal},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00586698/en}
}
@INPROCEEDINGS{CLR11,
AUTHOR = {C. Caillouet and X. Li and T. Razafindralambo},
BOOKTITLE = {10th International Conference on Ad Hoc Networks and Wireless (AdHocNow)},
TITLE = {A Multi-objective Approach for Data Collection in
Wireless Sensor Networks},
YEAR = {2011},
ADDRESS = {Padderborn, Germany},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00601679/en}
}
@INPROCEEDINGS{CaRa11,
AUTHOR = {C. Caillouet and T. Razafindralambo},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Compromis énergie-délai pour la collecte de données dans
les réseaux de capteurs},
YEAR = {2011},
ADDRESS = {Cap Estérel, France},
EDITOR = { Ducourthial and et Felber, Bertrand and Pascal},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00586681/en}
}
@INPROCEEDINGS{CLM+11,
AUTHOR = {V. Campos and Linhares Sales, C. and A. K. Maia and
N. Martins and R. Sampaio},
BOOKTITLE = {VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'11)},
TITLE = {Restricted coloring problems on graphs with few $P_4$'s},
YEAR = {2011},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {57-62},
OPTPUBLISHER = {},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {37},
URL = {http://www.sciencedirect.com/science/article/pii/S1571065311000126},
PDF = {http://hal.inria.fr/docs/00/64/31/80/PDF/col-fewP4.pdf},
ABSTRACT = {In this paper, we obtain polynomial time algorithms to
determine the acyclic chromatic number, the star chromatic number and
the harmonious
chromatic number of $P_4$ -tidy graphs and $(q , q
âˆ’ 4)$-graphs, for every fixed q. These classes include cographs,
$P_4$ -sparse and $P_4$ -lite graphs. We also
obtain a polynomial
time algorithm to determine the Grundy number of $(q , q âˆ’
4)$-graphs. All these coloring problems are known to be NP-hard for
general
graphs.}
}
@INPROCEEDINGS{CCKN11b,
AUTHOR = {G. Classen and D. Coudert and A. Koster and
N. Nepomuceno},
BOOKTITLE = {International Network Optimization Conference (INOC)},
TITLE = {A Chance-Constrained Model & Cutting Planes for Fixed
Broadband Wireless Networks},
YEAR = {2011},
ADDRESS = {Hamburg, Germany},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {37-42},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6701},
PDF = {http://hal.inria.fr/docs/00/58/76/69/PDF/ClCoKoNe-noformat.pdf},
ABSTRACT = {In this paper, we propose a chance-constrained
mathematical program for fixed broadband wireless networks under
unreliable channel conditions. The model is reformulated as integer
linear program and valid inequalities are derived for the
corresponding polytope. Computational results show that by an exact
separation approach the optimality gap is closed by~$42$\,\% on
average.}
}
@INPROCEEDINGS{CCKN11,
AUTHOR = {G. Classen and D. Coudert and A. Koster and
N. Nepomuceno},
BOOKTITLE = {12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM)},
TITLE = {Bandwidth assignment for reliable fixed broadband
wireless networks},
YEAR = {2011},
ADDRESS = {Lucca, Italy},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-6},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://hal.inria.fr/docs/00/58/76/98/PDF/bare_conf-noformat.pdf},
ABSTRACT = {In this paper, we investigate on conceiving reliable
fixed broadband wireless networks under outage probability
constraints. We introduce a joint optimization of data routing and
bandwidth assignment that minimizes the total renewal fees of
licenses, while handling all the traffic requirements simultaneously.
This problem differs from classical capacity planning in the sense
that the capacity of microwave radio links are prone to variations
due to external factors (e.g., weather). Therefore, we must consider
probabilistic constraints to deal with random parameters (viz.,
modulation schemes) and guarantee a desirable reliability level of
the solution. We propose a (joint) chance-constrained programming
approach to tackle this problem. This approach remains one of the
main challenges of modern stochastic programming and it is still
considered as very difficult and widely intractable. We then derive
integer linear programming (ILP) counterparts for these
chance-constrained programs and propose
cutset-based valid
inequalities to enhance the performance of ILP solvers. Preliminary
computational results illustrate the price of reliability and present
a comparative study on the performance of the different formulations.}
}
@INPROCEEDINGS{CNT11b,
AUTHOR = {D. Coudert and N. Nepomuceno and I. Tahiri},
BOOKTITLE = {International Network Optimization Conference (INOC)},
TITLE = {Energy saving in fixed wireless broadband networks},
YEAR = {2011},
ADDRESS = {Hamburg, Germany},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {484-489},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6701},
PDF = {http://hal.inria.fr/docs/00/58/76/85/PDF/CNT11-noformat.pdf},
ABSTRACT = {In this paper, we present a mathematical formulation for
saving energy in fixed broadband wireless networks by selectively
turning off idle communication devices in low-demand scenarios. This
problem relies on a fixed-charge capacitated network design (FCCND),
which is very hard to optimize. We then propose heuristic algorithms
to produce feasible solutions in a short time.}
}
@INPROCEEDINGS{CNT11,
AUTHOR = {D. Coudert and N. Nepomuceno and I. Tahiri},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Optimisation de la consommation énergétique dans les
réseaux sans fil fixes},
YEAR = {2011},
ADDRESS = {Cap Estérel France},
EDITOR = {Ducourthial, Bertrand et Felber, Pascal},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00588129/en/},
PDF = {http://hal.inria.fr/inria-00588129/PDF/document.pdf},
ABSTRACT = {{N}ous {\'e}tudions le probl{\`e}me d'optimisation
{\'e}nerg{\'e}tique dans les r{\'e}seaux sans fil fixes dans le cas
d'une faible demande de trafic par rapport {\`a} la capacit{\'e} du
r{\'e}seau. {N}ous proposons un programme lin{\'e}aire pour
r{\'e}soudre le probl{\`e}me, puis nous pr{\'e}sentons une
heuristique permettant de trouver rapidement une bonne solution.}
}
@INPROCEEDINGS{DDF+11,
AUTHOR = {G. D'Angelo and Mattia D'Emidio and Daniele Frigioni and
Vinicio Maurizio},
BOOKTITLE = {11th International Conference on Computational Science and Its Applications (ICCSA 2011)},
TITLE = {A Speed-Up Technique for Distributed Shortest Paths
Computation},
YEAR = {2011},
ADDRESS = {Santander, Spain},
EDITOR = {Beniamino Murgante and Osvaldo Gervasi and
Andrés Iglesias and David Taniar and Bernady O. Apduhan},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {578-593},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6783},
URL = {http://hal.inria.fr/hal-00644049/en/},
PDF = {http://hal.inria.fr/hal-00644049/PDF/dlp.pdf},
ABSTRACT = {We propose a simple and practical speed-up technique,
which can be combined with every distance vector routing algorithm
based on shortest paths, allowing to reduce the total number of
messages sent by that algorithm. We combine the new technique with
two algorithms known in the literature: DUAL, which is part of
CISCO's widely used EIGRP protocol, and the recent DUST, which has
been shown to be very effective on networks with power law node
degree distribution. We give experimental evidence that these
combinations lead to an important gain in terms of the number of
messages sent by DUAL and DUST at the price of a little increase in
terms of space occupancy per node.}
}
@INPROCEEDINGS{DDN11e,
AUTHOR = {G. D'Angelo and Di Stefano, Gabriele and Alfredo Navarra},
BOOKTITLE = {37th Conference on Current Trends in Theory and Practice of Computer Science},
TITLE = {Bandwidth Constrained Multi-interface Networks},
YEAR = {2011},
ADDRESS = {Novy Smokovec, Slovakia},
EDITOR = {Ivana Cerná and Tibor Gyimóthy and Juraj Hromkovic and
Keith Jefferey and Rastislav Královic and Marko Vukolic and
Stefan Wolf},
MONTH = {January},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {202-213},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6543},
URL = {http://hal.inria.fr/hal-00644104/en/},
PDF = {http://hal.inria.fr/hal-00644104/PDF/MultiInterfacesFlowTheor.pdf},
ABSTRACT = {In heterogeneous networks, devices can communicate by
means of multiple wired or wireless interfaces. By switching among
interfaces or by combining the available interfaces, each device
might establish several connections. A connection is established when
the devices at its endpoints share at least one active interface.
Each interface is assumed to require an activation cost, and provides
a communication bandwidth. In this paper, we consider the problem of
activating the cheapest set of interfaces among a network
Gâ€‰=â€‰(V,E) in order to guarantee a minimum bandwidth B of
communication between two specified nodes. Nodes V represent the
devices, edges E represent the connections that can be established.
In practical cases, a bounded number k of different interfaces among
all the devices can be considered. Despite this assumption, the
problem turns out to be NP-hard even for small values of k and
$\Delta$, where $\Delta$ is the maximum degree of the network. In
particular, the problem is NP-hard for
any fixed kâ€‰$\ge$â€‰2 and
$\Delta$â€‰$\ge$â€‰3, while it is polynomially solvable when
kâ€‰=â€‰1, or $\Delta$â€‰$\le$â€‰2 and kâ€‰=â€‰O(1). Moreover, we
show that the problem is not approximable within $\eta$logB or
$\Omega$(loglog|V|) for any fixed kâ€‰$\ge$â€‰3,
$\Delta$â€‰$\ge$â€‰3, and for a certain constant $\eta$, unless P=NP.
We then provide an approximation algorithm with ratio guarantee of b
max , where b max is the maximum communication bandwidth allowed
among all the available interfaces. Finally, we focus on particular
cases by providing complexity results and polynomial algorithms for
$\Delta$â€‰$\le$â€‰2.}
}
@INPROCEEDINGS{DDN11b,
AUTHOR = {G. D'Angelo and Di Stefano, Gabriele and Alfredo Navarra},
BOOKTITLE = {Structural Information and Communication Complexity},
TITLE = {Gathering of Six Robots on Anonymous Symmetric Rings},
YEAR = {2011},
ADDRESS = {Gdansk, Poland},
EDITOR = {Adrian Kosowski and Masafumi Yamashita},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {174-185},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6796},
URL = {http://hal.inria.fr/hal-00644039/en/},
PDF = {http://hal.inria.fr/hal-00644039/PDF/GatheringSixRobots.pdf},
ABSTRACT = {The paper deals with a recent model of robot-based
computing which makes use of identical, memoryless mobile robots
placed on nodes of anonymous graphs. The robots operate in
Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of
the current configuration (Look), takes a decision whether to stay
idle or to move to one of its adjacent nodes (Compute), and in the
latter case makes an instantaneous move to this neighbor (Move).
Cycles are performed asynchronously for each robot. In particular, we
consider the case of only six robots placed on the nodes of an
anonymous ring in such a way they constitute a symmetric placement
with respect to one single axis of symmetry, and we ask whether there
exists a strategy that allows the robots to gather at one single
node. This is in fact the first case left open after a series of
papers [1,2,3,4] dealing with the gathering of oblivious robots on
anonymous rings. As long as the gathering is feasible, we provide a
new distributed approach that
guarantees a positive answer to the
posed question. Despite the very special case considered, the
provided strategy turns out to be very interesting as it neither
completely falls into symmetry-breaking nor into symmetry-preserving
techniques.}
}
@INPROCEEDINGS{DDN11d,
AUTHOR = {G. D'Angelo and Di Stefano, Gabriele and Alfredo Navarra},
BOOKTITLE = {5th International Conference on Ubiquitous Information Management and Communication},
TITLE = {Maximum Flow and Minimum-Cost Flow in Multi-Interface
Networks},
YEAR = {2011},
ADDRESS = {Seoul, Korea, Republic Of},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {19},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/hal-00644073/en/},
PDF = {http://hal.inria.fr/hal-00644073/PDF/MultiInterfacesFlowExp.pdf},
ABSTRACT = {In heterogeneous networks, devices can communicate by
means of multiple wired or wireless interfaces. By switching among
interfaces or by combining the available interfaces, each device
might establish several connections. A connection is established when
the devices at its endpoints share at least one active interface.
Each interface is assumed to require an activation cost, and provides
a communication bandwidth. In this paper, we consider two fundamental
optimization problems. In the first one, we aim to activate a set of
interfaces in the network G = (V, E) in order to guarantee the
maximal bandwidth between two given nodes. Nodes V represent the
devices, edges E represent the connections that can be established
according to the availability of the interfaces in the devices. In
the second problem, we look for activating the cheapest set of
interfaces among a network in order to guarantee a minimum bandwidth
B of communication between two specified nodes. We show that the
first problem is
polynomially solvable while the second one is
NP-Hard. However, we experimentally analyzed an algorithm for the
second problem, showing that in practical cases it guarantees a low
approximation ratio which allows us to use it in real-world networks.}
}
@INPROCEEDINGS{DDN11f,
AUTHOR = {G. D'Angelo and Di Stefano, Gabriele and Alfredo Navarra},
BOOKTITLE = {37th Conference on Current Trends in Theory and Practice of Computer Science},
TITLE = {Min-Max Coverage in Multi-interface Networks},
YEAR = {2011},
ADDRESS = {Novy Smokovec, Slovakia},
EDITOR = {Ivana Cerná and Tibor Gyimóthy and Juraj Hromkovic and
Keith Jefferey and Rastislav Královic and Marko Vukolic and
Stefan Wolf},
MONTH = {January},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {190-201},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6543},
URL = {http://hal.inria.fr/hal-00644084/en/},
PDF = {http://hal.inria.fr/hal-00644084/PDF/MultiInterfacesCoverage.pdf},
ABSTRACT = {We consider devices equipped with multiple wired or
wireless interfaces. By switching among interfaces or by combining
the available interfaces, each device might establish several
connections. A connection is established when the devices at its
endpoints share at least one active interface. Each interface is
assumed to require an activation cost. In this paper, we consider the
problem of establishing the connections defined by a network
Gâ€‰=â€‰(V,E) while keeping as low as possible the maximum cost set
of active interfaces at the single nodes. Nodes V represent the
devices, edges E represent the connections that must be established.
We study the problem of minimizing the maximum cost set of active
interfaces among the nodes of the network in order to cover all the
edges. We prove that the problem is NP-hard for any fixed
$\Delta$â€‰$\ge$â€‰5 and kâ€‰$\ge$â€‰16, with $\Delta$ being the
maximum degree, and k being the number of different interfaces among
the network. We also show that the problem cannot be
approximated
within $\Omega$(ln $\Delta$). We then provide a general approximation
algorithm which guarantees a factor of O((1â€‰+â€‰b)ln ($\Delta$)),
with b being a parameter depending on the topology of the input
graph. Interestingly, b can be bounded by a constant for many graph
classes. Other approximation and exact algorithms for special cases
are presented.}
}
@INPROCEEDINGS{DDV11c,
AUTHOR = {G. D'Angelo and Daniele Frigioni and Camillo Vitale},
BOOKTITLE = {10th International Symposium, SEA 2011},
TITLE = {Dynamic Arc-Flags in Road Networks},
YEAR = {2011},
ADDRESS = {Kolimpari, Chania, Crete, Greece},
EDITOR = {Panos M. Pardalos and Steffen Rebennack},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {88-99},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6630},
URL = {http://hal.inria.fr/hal-00644054/en/},
PDF = {http://hal.inria.fr/hal-00644054/PDF/RoadSigns.pdf},
ABSTRACT = {In this work we introduce a new data structure, named
Road-Signs, which allows us to efficiently update the Arc-Flags of a
graph in a dynamic scenario. Road-Signs can be used to compute
Arc-Flags, can be efficiently updated and do not require large space
consumption for many real-world graphs like, e.g., graphs arising
from road networks. In detail, we define an algorithm to preprocess
Road-Signs and an algorithm to update them each time that a weight
increase operation occurs on an edge of the network. We also
experimentally analyze the proposed algorithms in real-world road
networks showing that they yields a significant speed-up in the
updating phase of Arc-Flags, at the cost of a very small space and
time overhead in the preprocessing phase.}
}
@INPROCEEDINGS{DaMa11,
AUTHOR = {O. Dalle and E. Mancini},
BOOKTITLE = {Winter Simulation Conference},
TITLE = {Traces Generation To Simulate Large-Scale Distributed
Applications},
YEAR = {2011},
ADDRESS = {Phoenix, AZ, États-Unis},
EDITOR = {S. Jain and R. R. Creasey and J. Himmelspach and
K. P. White and M. Fu},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {10p.},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00638561},
PDF = {http://hal.inria.fr/inria-00638561/PDF/MaDa11.pdf},
ABSTRACT = {In order to study the performance of scheduling
algorithms, simulators of parallel and distributed applications need
accurate models of the application's behavior during execution.
For
this purpose, traces of low-level events collected during the actual
execution of real applications are needed.
Collecting such traces
is a difficult task due to the timing, to the interference of
instrumentation code, and to the storage and transfer of the
collected data.
To address this problem we propose a comprehensive
software architecture, which instruments the application's
executables, gather hierarchically the traces, and post-process them
in order to feed simulation models.
We designed it to be scalable,
modular and extensible.}
}
@INPROCEEDINGS{DaRi11,
AUTHOR = {O. Dalle and J. Ribault},
BOOKTITLE = {Proceedings of the Symposium On Theory of Modeling and Simulation -- DEVS Integrative M&S Symposium (TMS/DEVS 2011)},
TITLE = {Some Desired Features for the DEVS Architecture
Description Language},
YEAR = {2011},
ADDRESS = {Boston, MA, États-Unis},
OPTEDITOR = {},
MONTH = {04},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {258-263},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {Book 4 -- Symposium on Theory of Modeling & Simulation - DEVS Integrative M&S Symposium (TMS/DEVS)},
URL = {http://hal.inria.fr/inria-00638565/en/},
PDF = {http://hal.inria.fr/inria-00638565/PDF/document.pdf},
ABSTRACT = {ADL are particularly well suited for component-based
model
frameworks that support hierarchical composition, such as DEVS
with coupled
models. In this paper we present some features found in
the ADL of another
hierarchical component model, namely the Fractal
Component Model (FCM).
To our best knowledge, these features are not
yet available in most of the
current DEVS implementations. Using a
few examples coming from our experience,
we demonstrate the
usefulness of these features for Modeling & Simulation and
their
potential relevance for inclusion in a future DEVS implementation
standard.}
}
@INPROCEEDINGS{Fe11,
AUTHOR = {S. Felix and J. Galtier},
BOOKTITLE = {Proceedings of the 11th International Conference on ITS Telecommunications},
TITLE = {Shortest Paths and Probabilities on Time-Dependent
Graphs - Applications to Transport Networks},
YEAR = {2011},
ADDRESS = {Saint Petersburg, Russia},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {56--62},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=06060121},
ABSTRACT = {In this paper, we focus on time-dependent graphs
which
seem to be a good way to model transport networks. In
the first
part, we remind some notations and techniques related
to
time-dependent graphs. In the second one, we introduce new
algorithms to take into account the notion of probability related
to
paths in order to guarantee travelling times with a certain
accuracy. We also discuss different probabilistic models and show
the links between them.}
}
@INPROCEEDINGS{GMM11,
AUTHOR = {F. Giroire and D. Mazauric and J. Moulierac},
BOOKTITLE = {13es Rencontres Francophones sur les Aspects
Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Routage efficace en énergie},
YEAR = {2011},
ADDRESS = {Cap Estérel, France},
EDITOR = {et Bertrand et Felber et Pascal, Ducourthial},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00587944/fr},
ABSTRACT = {De rÃ©centes Ã©tudes montrent que la charge de trafic
des
routeurs n'a qu'une faible influence sur leur consommation
Ã©nergÃ©tique. Par consÃ©quent, la consommation dans les rÃ©seaux
est
fortement liÃ©e au nombre d'Ã©quipements du rÃ©seau activÃ©s
(interfaces,
chassis, etc). Dans un objectif de minimisation de
l'Ã©nergie dans les
rÃ©seaux, il est intÃ©ressant de minimiser le
nombre (pondÃ©rÃ©)
d'Ã©quipements utilisÃ©s lors du routage. Dans
cet article, nous
considÃ©rons une architecture simplifiÃ©e oÃ¹ un
lien entre deux routeurs
relie deux interfaces. Quand un lien n'est
pas activÃ©, les deux
interfaces correspondantes peuvent Ãªtre
Ã©teintes. Par consÃ©quent, afin
de rÃ©duire la consommation
d'Ã©nergie, l'objectif est de trouver un
routage qui minimise le
nombre de liens utilisÃ©s et satisfait toutes
les demandes. Nous
montrons des rÃ©sultats d'inapproximabilitÃ© de ce
problÃ¨me, mÃªme
si l'on considÃ¨re des instances particuliÃ¨res. Nous
prouvons des
bornes en gÃ©nÃ©ral et pour des topologies particuliÃ¨res
telles que
la grille, l'arbre ou le graphe complet. Nous proposons
ensuite une
heuristique dont nous Ã©valuons les performances Ã l'aide
de
simulations sur des topologies rÃ©elles. Nous Ã©tudions ensuite
l'impact de ces solutions efficaces en Ã©nergie sur la tolÃ©rance
aux
pannes et sur la longueur moyenne des routes.}
}
@INPROCEEDINGS{LiSi+11,
AUTHOR = {Y. Liu and G. Simon},
BOOKTITLE = {IEEE International Conference on Communications (ICC'2011)},
TITLE = {Peer-Assisted Time-shifted Streaming Systems: Design and
Promises},
YEAR = {2011},
ADDRESS = {Kyoto, Japan},
OPTEDITOR = {},
MONTH = {06},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/LS+11.pdf},
ABSTRACT = {Time-shifted streaming (or catch-up TV) allows viewers
to watch their TV programs within an expanded time window. In this
paper, we emphasize the challenging characteristics of time-shifted
TV systems that prevent known delivery systems to be used. We model
time-shifted TV as multiple-interval graph, then we present a
Peer-Assisted Catch-Up Streaming system, namely PACUS, where a set of
end users' computers assists the server for the content delivery. We
show in particular how the PACUS tracker server can be efficiently
implemented for catch-up TV. We demonstrate the benefits of PACUS by
simulations. We especially highlight that PACUS reduces the traffic
at the server side with the advantages of lightweight and
self-adaptive unstructured peer-to-peer systems.}
}
@INPROCEEDINGS{MaMo11b,
AUTHOR = {F. Maffray and G. Morel},
BOOKTITLE = {12e congrès annuel de la ROADEF},
TITLE = {Algorithmes linÃ©aires pour les graphes sans $P_5$
3-colorables},
YEAR = {2011},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{ACC+10,
AUTHOR = {E. Alvarez-Miranda and A. Candia and X. Chen and X. Hu and
B. Li},
BOOKTITLE = {Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM)},
TITLE = {Efficient Algorithms for the Prize Collecting Steiner
Tree Problems with Interval Data},
YEAR = {2010},
ADDRESS = {Weihai, China},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {13-24},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6124},
URL = {http://dx.doi.org/10.1007/978-3-642-14355-7_3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACC+10.pdf},
ABSTRACT = {Given a graph $G=(V,E)$ with a cost on each edge in $E$
and a prize at each vertex in $V$, and a target set $V'\subseteq V$,
the Prize Collecting Steiner Tree (PCST) problem is to find a tree
$T$ interconnecting vertices in $V'$ that has minimum total costs on
edges and maximum total prizes at vertices in $T$. This problem is
NP-hard in general, and it is polynomial-time solvable when graphs
$G$ are restricted to 2-trees. In this paper, we study how to deal
with PCST problem with uncertain costs and prizes. We assume that
edge $e$ could be included in $T$ by paying cost
$x_e\in[c_e^-,c_e^+]$ while taking risk $\frac{ c_e^+-x_e}{
c_e^+-c_e^-}$ of losing $e$, and vertex $v$ could be awarded prize
$p_v\in [p_v^-,p_v^+]$ while taking risk $\frac{
y_v-p_v^-}{p_v^+-p_v^-}$ of losing the prize. We establish two risk
models for the PCST problem, one minimizing the maximum risk over
edges and vertices in $T$ and the other minimizing the sum of risks.
Both models are subject to upper bounds on the budget for
constructing a tree. We propose two polynomial-time algorithms for
these problems on 2-trees, respectively. Our study shows that the
risk models have advantages over the tradional robust optimization
model, which yields NP-hard problems even if the original
optimization problems are polynomial-time solvable. }
}
@INPROCEEDINGS{ASL10,
AUTHOR = {J. Araujo and Linhares Sales, C. and I. Sau},
BOOKTITLE = {11es Journées Doctorales en Informatique et Réseaux (JDIR 2010)},
TITLE = {Weighted Coloring on $P_4$-sparse Graphs},
YEAR = {2010},
ADDRESS = {Sophia Antipolis, France},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {33--38},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ASL10.pdf},
ABSTRACT = {Given an undirected graph G = (V, E) and a weight
function w : V â†’ R+, a vertex coloring of G is a partition of V
into independent sets, or color classes. The weight of a vertex
coloring of G is defined as the sum of the weights of its color
classes, where the weight of a color class is the weight of a
heaviest vertex belonging to it. In the WEIGHTED COLORING problem, we
want to determine the minimum weight among all vertex colorings of G
[1]. This problem is NP-hard on general graphs, as it reduces to
determining the chromatic number when all the weights are equal. In
this article we study the WEIGHTED COLORING problem on P4-sparse
graphs, which are defined as graphs in which every subset of five
vertices induces at most one path on four vertices [2]. This class of
graphs has been extensively studied in the literature during the last
decade, and many hard optimization problems are known to be in P when
restricted to this class. Note that cographs (that is, P4-free
graphs) are P4-sparse, and that P4-sparse graphs are P5-free. The
WEIGHTED COLORING problem is in P on cographs [3] and NP-hard on
P5-free graphs [4]. We show that WEIGHTED COLORING can be solved in
polynomial time on a subclass of P4-sparse graphs that strictly
contains cographs, and we present a 2-approximation algorithm on
general P4-sparse graphs. The complexity of WEIGHTED COLORING on P4-
sparse graphs remains open.}
}
@INPROCEEDINGS{BeBu10,
AUTHOR = {J. Beauquier and J. Burman},
BOOKTITLE = {Distributed Computing in Sensor Systems, 6th IEEE International Conference, DCOSS 2010},
TITLE = {Self-stabilizing Synchronization in Mobile Sensor
Networks with Covering},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {362-378},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6131},
PDF = {http://dx.doi.org/10.1007/978-3-642-13651-1_26},
ABSTRACT = {Synchronization is widely considered as an important
service in distributed systems which may simplify protocol design.
\emph{Phase clock} is a general synchronization tool that provides a
form of a logical time. This paper presents a \emph{self-stabilizing}
(a tolerating state-corrupting transient faults) phase clock
algorithm suited to the model of \emph{population protocols with
covering}. This model has been proposed recently for sensor networks
with a very large, possibly \emph{unknown} number of \emph{anonymous}
mobile agents having \emph{small memory}. Agents interact in pairs in
an \emph{asynchronous} way subject to the constraints expressed in
terms of the \emph{cover times} of agents. The cover time expresses
the ``frequency'' of an agent to communicate with all the others and
abstracts agent's communication characteristics (e.g. moving
speed/patterns, transmitting/receiving capabilities). We show that a
phase clock is impossible in the model with only constant-state
agents. Hence, we assume an existence of resource-unlimited agent -
the base station. The clock size and duration of each phase of the
proposed phase clock tool are adjustable by the user. We provide
application examples of this tool and demonstrate how it can simplify
the design of protocols. In particular, it yields a solution to Group
Mutual Exclusion problem.}
}
@INPROCEEDINGS{BBC+10,
AUTHOR = {J. Beauquier and J. Burman and J. Clement and S. Kutten},
BOOKTITLE = {Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010},
TITLE = {On Utilizing Speed in Networks of Mobile Agents},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {305-314},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://doi.acm.org/10.1145/1835698.1835775},
ABSTRACT = {Population protocols are a model presented recently for
networks with a very large, possibly unknown number of mobile agents
having small memory. This model has certain advantages over
alternative models (such as DTN) for such networks. However, it was
shown that the computational power of this model is limited to
semi-linear predicates only. Hence, various extensions were
suggested. We present a model that enhances the original model of
population protocols by introducing a (weak) notion of speed of the
agents. This enhancement allows us to design fast converging
protocols with only weak requirements (for example, suppose that
there are different types of agents, say agents attached to sick
animals and to healthy animals, two meeting agents just need to be
able to estimate which of them is faster, e.g., using their types,
but not to actually know the speeds of their types). Then, using the
new model, we study the gathering problem, in which there is an
unknown number of anonymous agents that have values they should
deliver to a base station (without replications). We develop
efficient protocols step by step searching for an optimal solution
and adapting to the size of the available memory. The protocols are
simple, though their analysis is somewhat involved. We also present a
more involved result - a lower bound on the length of the worst
execution for any protocol. Our proofs introduce several techniques
that may prove useful also in future studies of time in population
protocols.}
}
@INPROCEEDINGS{BMM+10,
AUTHOR = {J-C. Bermond and D. Mazauric and V. Misra and P. Nain},
BOOKTITLE = {SIGMETRICS 2010},
TITLE = {A Distributed Scheduling Algorithm for Wireless Networks
with Constant Overhead and Arbitrary Binary Interference},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {2p},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BMMN10.pdf},
ABSTRACT = {This work investigates distributed transmission
scheduling in wireless networks. Due to interference constraints,
"neighboring links" cannot be simultaneously activated, otherwise
transmissions will fail. Here, we consider any binary model of
interference. We follow the model described by Bui, Sanghavi, and
Srikant in SBS07,SBS09. We suppose that time is slotted and during
each slot we have two phases: one control phase which determines what
links will be activated and send data during the second phase. We
assume random arrivals on each link during each slot, therefore a
queue is associated to each link. Since nodes do not have a global
knowledge of the network, our aim (like in SBS07,SBS09) is to design
for the control phase, a distributed algorithm which determines a set
of non interfering links. To be efficient the control phase should be
as short as possible; this is done by exchanging control messages
during a constant number of mini-slots (constant overhead). In this
article we design the first fully distributed local algorithm with
the following properties: it works for any arbitrary binary
interference model; it has a constant overhead (independent of the
size of the network and the values of the queues); and it needs no
knowledge. Indeed contrary to other existing algorithms, we do not
need to know the values of the queues of the "neighboring links",
which are difficult to obtain in a wireless network with
interference. We prove that this algorithm gives a maximal set of
active links (in each interference set, there is at least one active
edge). We also give sufficient conditions for stability under
Markovian assumptions. Finally the performance of our algorithm
(throughput, stability) is investigated and compared via simulations
to that of previously proposed schemes.}
}
@INPROCEEDINGS{HCN+10,
AUTHOR = {C. Caillouet and F. Huc and N. Nisse and S. Pérennes and
H. Rivano},
BOOKTITLE = {12th Workshop on Advances in Parallel and Distributed Computational Models},
TITLE = {Stability of a localized and greedy routing algorithm},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00331807},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HCN+10.pdf},
ABSTRACT = {In this work, we study the problem of routing packets
between undifferentiated sources and sinks in a network modeled by a
multigraph. We consider a distributed and local algorithm that
transmits packets hop by hop in the network and study its behavior.
At each step, a node transmits its queued packets to its neighbors in
order to optimize a local gradient. This protocol is greedy since it
does not require to record the history about the past actions, and
localized since nodes only need information about their neighborhood.
A transmission protocol is \emph{stable} if the number of packets in
the network does not diverge. To prove the stability, it is
sufficient to prove that the number of packets stored in the network
remains bounded as soon as the sources inject a flow that another
method could have exhausted. The localized and greedy protocol
considered has been shown to be stable in some specific cases related
to the arrival rate of the packets. We investigate its stability in a
more general context and therefore reinforce results from the
literature that worked for differentiated suboptimal flows. We show
that, to prove the stability of this protocol, it is sufficient to
prove the intuitive following conjecture: roughly, if the protocol is
stable when all sources inject the maximum number of packets at each
turn and no packets are lost, then the protocol is stable whatever be
the behavior of the network (i.e., when less packets are injected and
some of them may be lost).}
}
@INPROCEEDINGS{CPR10,
AUTHOR = {C. Caillouet and S. Perennes and H. Rivano},
BOOKTITLE = {International Symposium on Combinatorial Optimization (ISCO)},
TITLE = {Cross line and column generation for the cut covering
problem in wireless networks},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {March},
NOTE = {To appear},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.lamsade.dauphine.fr/~isco/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CPR10.pdf},
ABSTRACT = {In this paper, we address the problem of bandwidth
allocation and routing in wire- less networks. A first model of this
problem is known as the Round Weighting Problem (RWP) in which a
weight is assigned to the set of rounds, i.e. a set of pairwise
non-interfering links. We present a new formulation that forgets
about the routing and concentrate on the capacity available on the
network cuts. We use the maximum flow/minimum cut theorem known in
graph theory to develop the Cut Covering Problem (CCP) and prove that
it computes equivalent optimal round weights than RWP. We develop a
primal/dual algorithm combining line and column generation to deal
with the exponential number of variables and constraints of CCP.}
}
@INPROCEEDINGS{CGM+10c,
AUTHOR = {S. Caron and F. Giroire and D. Mazauric and J. Monteiro and
S. Pérennes},
BOOKTITLE = {Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe)},
TITLE = {Data Life Time for Different Placement Policies in P2P
Storage Systems},
YEAR = {2010},
ADDRESS = {Bilbao, Spain},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {75--88},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6265},
KEYWORDS = {P2P storage system, data placement, performance,
data durability, Markov chain model},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CGM+10c.pdf},
ABSTRACT = {Peer-to-peer systems are foreseen as an efficient
solution to achieve reliable data storage at low cost. To deal with
common P2P problems such as peer failures or churn, such systems
encode the user data into redundant fragments and distribute them
among peers. The way they distribute it, known as placement policy,
has a significant impact on their behavior and reliability. In this
paper, we study the impact of different placement policies on the
data life time. More precisely, we describe methods to compute and
approximate the mean time before the system loses data (Mean Time to
Data Loss). We compare this metric for three placement policies: two
of them local, in which the data is stored in logical peer
neighborhoods, and one of them global in which fragments are parted
uniformly at random among the different peers.}
}
@INPROCEEDINGS{CGM+10b,
AUTHOR = {S. Caron and F. Giroire and D. Mazauric and J. Monteiro and
S. Pérennes},
BOOKTITLE = {12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {P2P Storage Systems: Data Life Time for Different
Placement Policies},
YEAR = {2010},
ADDRESS = {Belle Dune France},
EDITOR = {et Hervé Rivano, Maria Gradinariu Potop-Butucaru},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {P2P storage system, data placement, performance,
data durability, Markov chain model},
URL = {http://hal.inria.fr/inria-00479537/en/},
PDF = {http://hal.inria.fr/inria-00479537/PDF/placement-algotel2010-finale.pdf},
ABSTRACT = {{L}es syst{\`e}mes pair-{\`a}-pair {\`a} grande
{\'e}chelle repr{\'e}sentent un moyen fiable pour stocker des
donn{\'e}es {\`a} faible co{\^u}t. {A}fin d'assurer la
p{\'e}rennit{\'e} des donn{\'e}es des utilisateurs, il est
n{\'e}cessaire d'ajouter de la redondance. {A}insi {\`a} partir de s
fragments initiaux composant un bloc de donn{\'e}es, s+r fragments
sont g{\'e}n{\'e}r{\'e}s et r{\'e}partis entre les pairs du
r{\'e}seau. {N}ous {\'e}tudions dans ce papier l'impact des
diff{\'e}rentes politiques de placement sur la dur{\'e}e de vie des
donn{\'e}es. {P}lus particuli{\`e}rement nous d{\'e}crivons des
m{\'e}thodes pour calculer et approximer le temps moyen avant que le
syst{\`e}me perde une donn{\'e}e ({M}ean {T}ime to {D}ata {L}oss).
{N}ous comparons cette m{\'e}trique pour trois politiques de
placement: deux sont locales, distribuant les fragments sur des
voisins logiques, et la troisi{\`e}me est globale.}
}
@INPROCEEDINGS{CCN+10b,
AUTHOR = {J. Chalopin and V. Chepoi and N. Nisse and Y. Vaxes},
BOOKTITLE = {8th French Combinatorial Conference},
TITLE = {Cop and robber games when the robber can hide and ride},
YEAR = {2010},
ADDRESS = {Orsay},
OPTEDITOR = {},
MONTH = {June},
NOTE = {selection on abstract},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
ABSTRACT = {In the classical cop and robber game, two players, the
cop C and the robber R, move alternatively along edges of a finite
graph G = (V , E). The cop captures the robber if both players are on
the same vertex at the same moment of time. A graph G is called cop
win if the cop always captures the robber after a finite number of
steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized
the cop-win graphs as dismantlable graphs. In this talk, we will
characterize in a similar way the class CWFR(s, s') of cop-win graphs
in the game in which the cop and the robber move at different speeds
s' and s, s' ? s. We also establish some connections between cop-win
graphs for this game with s'< s and Gromovâ€™s hyperbolicity. In the
particular case s' = 1 and s = 2, we prove that the class of cop-win
graphs is exactly the well-known class of dually chordal graphs. We
show that all classes CWFR(s,1), s ? 3, coincide and we provide a
structural characterization of these graphs. We also investigate
several dismantling schemes necessary or sufficient for the cop-win
graphs (which we call k-winnable and denote by CWW(k)) in the game in
which the robber is visible only every k moves for a fixed integer k
> 1. We characterize the graphs which are k-winnable for any value of
k.}
}
@INPROCEEDINGS{CCM+10,
AUTHOR = {N. Cohen and D. Coudert and D. Mazauric and
N. Nepomuceno and N. Nisse},
BOOKTITLE = {Fifth International conference on Fun with Algorithms (FUN 2010)},
TITLE = {Tradeoffs in process strategy games with application in
the WDM reconfiguration problem},
YEAR = {2010},
ADDRESS = {Ischia Island, Italy},
EDITOR = {P. Boldi and L. Gargano},
MONTH = {June},
NOTE = {http://hal.inria.fr/inria-00495443},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {121-132},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {6099},
URL = {http://dx.doi.org/10.1007/978-3-642-13122-6_14},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CCM+10.pdf},
ABSTRACT = {We consider a variant of the graph searching games that
is closely related to the routing reconfiguration problem in WDM
networks. In the digraph processing game, a team of agents is aiming
at clearing, or processing, the vertices of a digraph D. In this
game, two important measures arise: 1) the total number of agents
used, and 2) the total number of vertices occupied by an agent during
the processing of D. Previous works have studied the problem of
minimizing each of these parameters independently. In particular,
both of these optimization problems are not in APX. In this paper, we
study the tradeoff between both these conflicting objectives. More
precisely, we prove that there exist some instances for which
minimizing one of these objectives arbitrarily impairs the quality of
the solution for the other one. We show that such bad tradeoffs may
happen even in the case of basic network topologies. On the other
hand, we exhibit classes of instances where good tradeoffs can be
achieved. We also show that minimizing one of these parameters while
the other is constrained is not in APX.}
}
@INPROCEEDINGS{CCM+10b,
AUTHOR = {N. Cohen and D. Coudert and D. Mazauric and
N. Nepomuceno and N. Nisse},
BOOKTITLE = {12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Tradeoffs in routing reconfiguration problems},
YEAR = {2010},
ADDRESS = {Belle Dune France},
EDITOR = {et Hervé Rivano, Maria Gradinariu Potop-Butucaru},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00477413/en/},
PDF = {http://hal.inria.fr/inria-00477413/PDF/algotel.pdf},
ABSTRACT = {{N}ous {\'e}tudions le probl{\`e}me du reroutage d'un
ensemble de connexion dans un r{\'e}seau. {I}l consiste {\`a} passer
d'un routage initial (ensemble de chemins reliant des paires de
noeuds) {\`a} un autre, en traitant s{\'e}quentiellement chaque
connexion. {I}l est parfois indispensable d'en interrompre
temporairement certaines au cours du processus de reconfiguration, ce
qui nous am{\`e}ne {\`a} {\'e}tudier les compromis possibles entre
deux mesures d'efficacit{\'e} : le nombre total de connexions
interrompues et le nombre maximum de connexions interrompues
simultan{\'e}ment. {N}ous prouvons qu'{\'e}tablir de tels compromis
m{\`e}ne {\`a} des probl{\`e}mes {NP}-complets et difficiles {\`a}
approcher ({APX}-difficiles voir non {APX}). {N}ous montrons ensuite
que de bons compromis sont impossibles en g{\'e}n{\'e}ral. {E}nfin,
nous exhibons une classe d'instances de reroutage pour laquelle il
est possible de minimiser le nombre de requ{\^e}tes interrompues
simultan{\'e}ment sans "trop" augmenter le nombre total de connexions
interrompues. {C}es r{\'e}sultats sont obtenus en mod{\'e}lisant ce
probl{\`e}me par un jeu {\`a} l'aide d'agents mobiles.}
}
@INPROCEEDINGS{Cou10b,
AUTHOR = {D. Coudert},
BOOKTITLE = {24th European Conference on Operational Research (EURO)},
TITLE = {Graph searching games for the WDM reconfiguration
problem},
YEAR = {2010},
ADDRESS = {Lisbon, Portugal},
OPTEDITOR = {},
MONTH = {July},
NOTE = {Invited talk},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00482113},
ABSTRACT = {The routing reconfiguration problem in WDM networks is
to schedule the switching's of a set of lightpaths from one routing
to a new predetermined one. This problem is modeled as a digraph
processing game, closely related to graph searching games, in which a
team of agents is aiming at clearing, or processing, the vertices of
a digraph. In this talk, we will survey the main results on digraph
processing games, and in particular the complexity and hardness of
optimizing tradeoffs between the total number of agents used and the
total number of vertices occupied by an agent during the strategy}
}
@INPROCEEDINGS{Gia10b,
AUTHOR = {P. Giabbanelli},
BOOKTITLE = {Proceedings of the IEEE Globecom 2010 Workshop on Complex and Communication Networks (CCNet 2010)},
TITLE = {Impact of complex network properties on routing in
backbone networks},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/gia10b.pdf},
ABSTRACT = {The properties found in complex networks (e.g.,
small-world, scale-free) have been used to characterize the behaviour
of several processes such as epidemics or oscillators. We analyze the
impact of such properties on the quality of a routing process. Using
a Mixed Integer/Linear Program, the routing minimizes the number of
ports installed in the network. Ports are network components which we
use as a simplification of the capital cost in communication
networks. Using data mining techniques, we are able to predict the
minimal number of ports of a network with small error rate given the
networkâ€™s properties and under the assumption of a realistic
traffic distribution. We find that the average betweenness and the
average path length are good indicators of the number of ports. We
then present exploratory work on the dynamic aspects by considering
that nodes join the network, which corresponds to the deployment of
communication equipment. We consider several approaches to deploy the
equipment, and report on the number of ports for each approach. By
comparing approaches, having less edges can still yield better
performances which motivates investigations on the design.
Furthermore, this dynamic case confirms the static one since a
tradeoff between the average betweenness and the average path length
seems to be a key element in efficient designs. }
}
@INPROCEEDINGS{GAD+10,
AUTHOR = {P. Giabbanelli and A. Alimadad and V. Dabbaghian and
D. T. Finegood},
BOOKTITLE = {XI International Conference on Obesity (ICO)},
TITLE = {Modeling the influence of social networks and
environment on energy balance and obesity},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {July},
NOTE = {Acceptance rate 8.6%},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GMB10,
AUTHOR = {P. Giabbanelli and D. Mazauric and J-C. Bermond},
BOOKTITLE = {Proceedings of the 2nd Workshop on Complex Networks (CompleNet)},
TITLE = {Average path length of deterministic and stochastics
recursive networks},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1--12},
PUBLISHER = {Springer-Verlag},
SERIES = {Communications in Computer and Information Science (CCIS)},
VOLUME = {116},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMB10.pdf},
ABSTRACT = {The average shortest path distance between all pairs of
nodes in real-world networks tends to be small compared to the number
of nodes. Providing a closed-form formula for remains challenging in
several network models, as shown by recent papers dedicated to this
sole topic. For example, Zhang et al. proposed the deterministic
model ZRG and studied an upper bound on . In this paper, we use
graph-theoretic techniques to establish a closed-form formula for in
ZRG. Our proof is of particular interests for other network models
relying on similar re- cursive structures, as found in fractal
models. We extend our approach to a stochastic version of ZRG in
which layers of triangles are added with probability p. We find a
first-order phase transition at the critical probability pc = 0.5,
from which the expected number of nodes becomes infinite whereas
expected distances remain finite. We show that if tri- angles are
added independently instead of being constrained in a layer, the
first-order phase transition holds for the very same critical
probabil- ity. Thus, we provide an insight showing that models can be
equivalent, regardless of whether edges are added with grouping
constraints. Our detailed computations also provide thorough
practical cases for readers unfamiliar with graph-theoretic and
probabilistic techniques.}
}
@INPROCEEDINGS{GMP10,
AUTHOR = {P. Giabbanelli and D. Mazauric and S. Pérennes},
BOOKTITLE = {12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'10)},
TITLE = {Computing the average path length and a label-based
routing in a small-world graph},
YEAR = {2010},
ADDRESS = {Belle Dune France},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Recursive graph, Labeling scheme, Decentralized routing},
URL = {http://hal.archives-ouvertes.fr/inria-00472215/en/},
PDF = {http://hal.archives-ouvertes.fr/inria-00472215/PDF/algotel.pdf},
ABSTRACT = {{W}e study two characteristics of a small-world graph
proposed by {Z}hang et al. to model complex networks. {O}ur study
relies on the recursive structure of the graph. {F}irstly, we use it
to design a labelling scheme in order to create an implicit routing
(i.e., a routing scheme based on the label of vertices). {S}econdly,
proving the average distance in this graph was arduous, thus {Z}hang
et al. chose to study the diameter: we establish a closed-form
formula of the average distance, proved using the recursive
structure. {T}hus, we characterize that the graph is small-world and
not ultra small-world as was still possible. {O}ur proof is of
particular interest for other graphs based on similar recursive
structures.}
}
@INPROCEEDINGS{GMM10b,
AUTHOR = {F. Giroire and D. Mazauric and J. Moulierac and
B. Onfroy},
BOOKTITLE = {IEEE/ACM International Conference on Green Computing and Communications (GreenCom'10)},
TITLE = {Minimizing Routing Energy Consumption: from Theoretical
to Practical Results},
YEAR = {2010},
ADDRESS = {Hangzhou, China},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://hal.archives-ouvertes.fr/inria-00464318/PDF/RR-7234.pdf},
ABSTRACT = {Several studies exhibit that the traffic load of the
routers only has a small influence on their energy consumption.
Hence, the power consumption in networks is strongly related to the
number of active network elements, such as interfaces, line cards,
base chassis,... The goal thus is to find a routing that minimizes
the (weighted) number of active network elements used when routing.
In this paper, we consider a simplified architecture where a
connection between two routers is represented as a link joining two
network interfaces. When a connection is not used, both network
interfaces can be turned off. Therefore, in order to reduce power
consumption, the goal is to find the routing that minimizes the
number of used links while satisfying all the demands. We first
define formally the problem and we model it as an integer linear
program. Then, we prove that this problem is not in APX, that is
there is no polynomial-time constant-factor approximation algorithm.
We propose a heuristic algorithm for this problem and we also prove
some negative results about basic greedy and probabilistic
algorithms. Thus we present a study on specific topologies, such as
trees, grids and complete graphs, that provide bounds and results
useful for real topologies. We then exhibit the gain in terms of
number of network interfaces (leading to a global reduction of
approximately 33 MWh for a medium-sized backbone network) for a set
of existing network topologies: we see that for almost all topologies
more than one third of the network interfaces can be spared for usual
ranges of operation. Finally, we discuss the impact of energy
efficient routing on the stretch factor and on fault tolerance.}
}
@INPROCEEDINGS{GMP10b,
AUTHOR = {F. Giroire and J. Monteiro and S. Pérennes},
BOOKTITLE = {Proceedings of the IEEE Global Communications Conference (GLOBECOM)},
TITLE = {Peer-to-Peer Storage Systems: a Practical Guideline to
be Lazy},
YEAR = {2010},
ADDRESS = {Miami, EUA},
OPTEDITOR = {},
MONTH = {12},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-6},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dx.doi.org/10.1109/GLOCOM.2010.5683761},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMP10.pdf},
ABSTRACT = {Distributed and peer-to-peer storage systems are
foreseen as an alternative to the traditional data centers and
in-house backup solutions. In the past few years many peer-to- peer
storage systems have been proposed. Most of them rely on the use of
erasure codes to introduce redundancy to the data. This kind of
system depends on many parameters that need to be well tuned, such as
the factor of redundancy, the frequency of data repair and the size
of a data block. In this paper we give closed-form mathematical
expressions that estimate the system average behavior. These
expressions are derived from a Markov chain. Our contribution is a
guideline to system designers and administrators to choose the best
set of parameters. That is, how to tune the system parameters to
obtain a desired level of reliability under a given constraint of
bandwidth consumption. We confirm that a lazy repair strategy can be
employed to amortize the repairing cost. Moreover, we propose a
formula to calculate the optimal threshold value that minimizes the
bandwidth consumption. Finally, we additionally discuss the impact of
different system characteristics on the performance metrics, such as
the number of peers, the amount of stored data, and the disk failure
rate. To the best of our knowledge this is the first work to give
close-form formulas to estimate the bandwidth consumption for a lazy
repair, and the loss rate taking into account the repair time.}
}
@INPROCEEDINGS{HIK+10c,
AUTHOR = {N. Hanusse and D. Ilcinkas and A. Kosowski and N. Nisse},
BOOKTITLE = {12ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'10)},
TITLE = {Comment battre la marche aléatoire en comptant ?},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.archives-ouvertes.fr/inria-00475863/fr/},
PDF = {http://hal.archives-ouvertes.fr/docs/00/47/58/63/PDF/Menteurs-algotel2010.pdf},
ABSTRACT = {Nous \'etudions le probl\`eme consistant \`a trouver une
destination t dans un r\'eseau, non fiable, gr\^ace \`a un agent
mobile. Chaque noeud du r\'eseau peut donner un conseil quant au
prochain sommet \`a visiter pour se rapprocher de t. Malheureusement,
k noeuds, appel\'es menteurs, donnent de mauvais conseils. Il est
connu que pour un graphe G de n sommets et de degr\'e maximum Delta
>= 3, atteindre une cible \`a distance d de la position initiale peut
demander un temps moyen de 2^{Omega(min{d,k})}, pour tout d,k=O(log
n), mÃƒÂªme lorsque G est un arbre. Ce papier \'etudie une
strat\'egie, appel\'ee R/A, utilisant un compteur (d'\'etapes) pour
alterner entre les phases al\'eatoires (R) oÃƒÂ¹ l'agent choisit
al\'eatoirement une arÃƒÂªte incidente, et celles (A) oÃƒÂ¹ l'agent
suit le conseil local. Aucune connaissance des param\`etres n, d, ou
k n'est requise, et l'agent n'a pas besoin de se rappeler par quel
lien il est entr\'e dans le sommet qu'il occupe. Nous \'etudions les
performances de cette strat\'egie pour deux classes de graphes,
extrÃƒÂªmes pour ce qui est de l'expansion: les anneaux et les
graphes r\'eguliers al\'eatoires (une importante classe d'
expanders). Pour l'anneau, l'algorithme R/A requiert un temps moyen
de 2d+k^{Theta(1)} (polynomial en d et k) pour une distribution des
menteurs la plus d\'efavorable. A l'oppos\'e, nous montrons que dans
un anneau, une marche al\'eatoire biais\'ee requiert un temps moyen
exponentiel en d et k. Pour les graphes al\'eatoires r\'eguliers, le
temps de recherche moyen de l'algorithme R/A est O(k3 log3 n) a.a.s.\
Le terme polylogarithmique de cette borne ne peut pas ÃƒÂªtre
am\'elior\'e, puisque nous montrons une borne inf\'erieure de
Omega(log n) pour d,k=Omega(log log n) dans les graphes al\'eatoires
r\'eguliers a.a.s. qui s'applique mÃƒÂªme lorsque l'agent a le sens
de l'orientation.}
}
@INPROCEEDINGS{HIK+10b,
AUTHOR = {N. Hanusse and D. Ilcinkas and A. Kosowski and N. Nisse},
BOOKTITLE = {29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10)},
TITLE = {Locating a target with an agent guided by unreliable
local advice},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {to appear},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {10p},
PUBLISHER = {ACM},
OPTSERIES = {},
VOLUME = {XXXX},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/podc2010.pdf},
ABSTRACT = {{W}e study the problem of finding a destination node $t$
by a mobile agent in an unreliable network having the structure of an
unweighted graph, in a model first proposed by {H}anusse {\it et
al.}~\cite{{HKK}00,{HKKK}08}. {E}ach node of the network is able to
give advice concerning the next node to visit so as to go closer to
the target $t$. {U}nfortunately, exactly $k$ of the nodes, called
\emph{liars}, give advice which is incorrect. {I}t is known that for
an $n$-node graph ${G}$ of maximum degree $\{D}elta \geq 3$, reaching
a target at a distance of $d$ from the initial location may require
an expected time of $2^{\{O}mega(\min\{d,k\})}$, for any
$d,k={O}(\log n)$, even when ${G}$ is a tree. {T}his paper focuses on
strategies which efficiently solve the search problem in scenarios in
which, at each node, the agent may only choose between following the
local advice, or randomly selecting an incident edge. {T}he strategy
which we put forward, called \algo{{R}/{A}}, makes use of a timer
(step counter) to alternate between phases of ignoring advice
(\algo{{R}}) and following advice (\algo{{A}}) for a certain number
of steps. {N}o knowledge of parameters $n$, $d$, or $k$ is required,
and the agent need not know by which edge it entered the node of its
current location. {T}he performance of this strategy is studied for
two classes of regular graphs with extremal values of expansion,
namely, for rings and for random $\maxdeg$-regular graphs (an
important class of expanders). {F}or the ring, \algo{{R}/{A}} is
shown to achieve an expected searching time of $2d+k^{\{T}heta(1)}$
for a worst-case distribution of liars, which is polynomial in both
$d$ and $k$. {F}or random $\maxdeg$-regular graphs, the expected
searching time of the \algo{{R}/{A}} strategy is ${O}(k3 \log3 n)$
a.a.s. {T}he polylogarithmic factor with respect to $n$ cannot be
dropped from this bound; in fact, we show that a lower time bound of
$\{O}mega (\log n)$ steps holds for all $d,k=\{O}mega(\log\log n)$ in
random $\maxdeg$-regular graphs a.a.s.\ and applies even to
strategies which make use of some knowledge of the environment.
{F}inally, we study oblivious strategies which do not use any memory
(in particular, with no timer). {S}uch strategies are essentially a
form of a random walk, possibly biased by local advice. {W}e show
that such biased random walks sometimes achieve drastically worse
performance than the \algo{{R}/{A}} strategy. {I}n particular, on the
ring, no biased random walk can have a searching time which is
polynomial in $d$ and $k$}
}
@INPROCEEDINGS{HaSa10,
AUTHOR = {F. Havet and L. Sampaio},
BOOKTITLE = {Proceedings of the International Symposium on Parameterized and Exact Computation(IPEC)},
TITLE = {On the Grundy number of a graph},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
NUMBER = {6478},
OPTORGANIZATION = {},
PAGES = {170-179},
OPTPUBLISHER = {},
SERIES = {Lecture Notes on Computer science},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaSa10.pdf},
ABSTRACT = {The Grundy number of a graph $G$, denoted by $\Gamma
(G)$, is the largest $k$ such that $G$ has a greedy $k$-colouring,
that is a colouring with $k$ colours obtained by applying the greedy
algorithm according to some ordering of the vertices of $G$.
Trivially $\Gamma(G)\leq \Delta(G)+1$. In this paper, we show that
deciding if $\Gamma(G)\leq \Delta(G)$ is NP-complete. We then show
that deciding if $\Gamma(G)\geq |V(G)|-k$ is fixed parameter
tractable with respect to the parameter $k$.}
}
@INPROCEEDINGS{HPT+10,
AUTHOR = {L. Hogie and D. Papadimitriou and I. Tahiri and
F. Majorczyk},
BOOKTITLE = {24th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS)},
TITLE = {Simulating routing schemes on large-scale topologies},
YEAR = {2010},
ADDRESS = {Atlanta},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
ABSTRACT = {The expansion of the Internet routing system results in
a number of research challenges, in particular, the Border Gateway
Protocol (BGP) starts to show its limits a.o. in terms of the number
of routing table entries it can dynamically process and control.
Dynamic routing protocols showing better scaling properties are thus
under investigation. However, because deploying under-development
routing protocols on the Internet is not practicable at a large-scale
(due to the size of the Internet topology), simulation is an
unavoidable step to validate the properties of a newly proposed
routing scheme. Unfortunately, the simulation of inter-domain routing
protocols over large networks (order of tens of thousands of nodes)
poses real challenges due to the limited memory and computational
power that computers impose. This paper presents the Dynamic Routing
Model simulator \drmsim which addresses the specific problem of
large-scale simulations of (inter-domain) routing models on large
networks. The motivation for developing a new simulator lies in the
limitation of existing simulation tools in terms of the number of
nodes they can handle and in the models they propose.}
}
@INPROCEEDINGS{JBS+10b,
AUTHOR = {B. Jaumard and N.N. Bhuiyan and S. Sebbah and F. Huc and
D. Coudert},
BOOKTITLE = {10th INFORMS Telecommunications Conference},
TITLE = {A New Framework for Efficient Shared Segment Protection
Scheme for WDM Networks},
YEAR = {2010},
ADDRESS = {Montréal, Canada},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {Informs},
PAGES = {2p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {https://symposia.cirrelt.ca/Informs-Telecom2010/},
ABSTRACT = {This work introduces a new shared segment protection
scheme that ensures both node and link protection in an efficient
manner in terms of cost and bandwidth, while taking full advantage of
the optical hop endpoints of the primary logical hops (induced by the
routing) without adding extra ones for protection. As opposed to the
link or path protection schemes, the segment protection scheme has
been less studied although it offers an interesting compromise
between those two protection schemes, attempting to encompass all
their advantages. We investigate two different Shared Segment
Protection (SSP) schemes: Basic Shared Segment Protection (BSSP) and
Shared Segment Protection with segment Overlap (SSPO), and propose a
design of 100\% single segment protections. In SSPO, we study the
extra protection capabilities, node failure and dual link failure
survivability, offered by the single 100\% single segment protection.
For both BSSP and SSPO schemes, we propose two novel efficient ILP
formulations, based on a column generation mathematical modeling.
While (SSPO) offers the advantage over (BSSP) to ensure both node and
link protection, it is not necessarily much more costly. Indeed,
depending on the network topology and the traffic instances, it can
be shown that none of the two SSP schemes dominates the other one.
Therefore, the SSPO protection scheme should be favored as it offers
more protection, i.e., it adds the node protection to the link
protection at the expense of a minor additional cost. }
}
@INPROCEEDINGS{JBS+10a,
AUTHOR = {B. Jaumard and N.N. Bhuiyan and S. Sebbah and F. Huc and
D. Coudert},
BOOKTITLE = {IEEE High Performance Switching and Routing (HPSR)},
TITLE = {A New Framework for Efficient Shared Segment Protection
Scheme for WDM Networks},
YEAR = {2010},
ADDRESS = {Richardson, TX, USA},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dx.doi.org/10.1109/HPSR.2010.5580274},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/JBS+10a.pdf},
ABSTRACT = {This work introduces a new shared segment protection
scheme that ensures both node and link protection in an efficient
manner in terms of cost and bandwidth, while taking full advantage of
the optical hop endpoints of the primary logical hops (induced by the
routing) without adding extra ones for protection. As opposed to the
link or path protection schemes, the segment protection scheme has
been less studied although it offers an interesting compromise
between those two protection schemes, attempting to encompass all
their advantages. We investigate two different Shared Segment
Protection (SSP) schemes: Basic Shared Segment Protection (BSSP) and
Shared Segment Protection with segment Overlap (SSPO), and propose a
design of 100\% single segment protections. In SSPO, we study the
extra protection capabilities, node failure and dual link failure
survivability, offered by the single 100\% single segment protection.
For both BSSP and SSPO schemes, we propose two novel efficient ILP
formulations, based on a column generation mathematical modeling.
While (SSPO) offers the advantage over (BSSP) to ensure both node and
link protection, it is not necessarily much more costly. Indeed,
depending on the network topology and the traffic instances, it can
be shown that none of the two SSP schemes dominates the other one.
Therefore, the SSPO protection scheme should be favored as it offers
more protection, i.e., it adds the node protection to the link
protection at the expense of a minor additional cost. }
}
@INPROCEEDINGS{MSZ10b,
AUTHOR = {G. B. Mertzios and I. Sau and S. Zaks},
BOOKTITLE = {Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS)},
TITLE = {The Recognition of Tolerance and Bounded Tolerance
Graphs},
YEAR = {2010},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {585-596},
PUBLISHER = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
SERIES = {LIPIcs},
VOLUME = {5},
URL = {http://dx.doi.org/10.4230/LIPIcs.STACS.2010.2487},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MSZ10b.pdf},
ABSTRACT = {Tolerance graphs model interval relations in such a way
that intervals can tolerate a certain degree of overlap without being
in conflict. This subclass of perfect graphs has been extensively
studied, due to both its interesting structure and its numerous
applications. Several efficient algorithms for optimization problems
that are NP-hard on general graphs have been designed for tolerance
graphs. In spite of this, the recognition of tolerance graphs
--~namely, the problem of deciding whether a given graph is a
tolerance graph~-- as well as the recognition of their main subclass
of bounded tolerance graphs, have been the most fundamental open
problems on this class of graphs (cf.~the book on tolerance
graphs~\cite{GolTol04}) since their introduction in
1982~\cite{GoMo82}. In this article we prove that both recognition
problems are NP-complete, even in the case where the input graph is a
trapezoid graph. The presented results are surprising because, on the
one hand, most subclasses of perfect graphs admit polynomial
recognition algorithms and, on the other hand, bounded tolerance
graphs were believed to be efficiently recognizable as they are a
natural special case of trapezoid graphs (which can be recognized in
polynomial time) and share a very similar structure with them. For
our reduction we extend the notion of an \emph{acyclic orientation}
of permutation and trapezoid graphs. Our main tool is a new algorithm
that uses \emph{vertex splitting} to transform a given trapezoid
graph into a permutation graph, while preserving this new acyclic
orientation property. This method of vertex splitting is of
independent interest; very recently, it has been proved a powerful
tool also in the design of efficient recognition algorithms for other
classes of graphs~\cite{MC-Trapezoid}.}
}
@INPROCEEDINGS{MoPe10,
AUTHOR = {J. Monteiro and S. Pérennes},
BOOKTITLE = {11es Journées Doctorales en Informatique et Réseaux (JDIR 2010)},
TITLE = {Systèmes de stockage P2P : un guide pratique},
YEAR = {2010},
ADDRESS = {Sophia Antipolis France},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {15--20},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00483214/en/},
ABSTRACT = {{L}es syst{\`e}mes pair-{\`a}-pair {\`a} grande
{\'e}chelle ont {\'e}t{\'e} propos{\'e} comme un moyen fiable
d'assurer un stockage de donn{\'e}e {\`a} faible c{\^o}ut. {P}our
assurer la p{\'e}rennit{\'e} des donn{\'e}es, ces syst{\`e}mes codent
les fichiers des utilisateurs en un ensemble de fragments redondants
qui sont rÃ©partis entre les pairs. {N}ous Ã©tudions dans ce rapport
l'impact des diffÃ©rents param{\`e}tres de configuration du
syst{\`e}me, comme par exemple, le facteur de redondance et la
fr{\'e}quence de r{\'e}paration des donn{\'e}es. {P}lus
particuliÃ¨rement, dans ce papier nous derivons des formules
approch{\'e}es {\`a} partir d'une chaine de {M}arkov. {C}es formules
nous donnent une estimation de la bande passante n{\'e}cessaire pour
maintenir la redondance et de la probabilit{\'e} de perdre un bloc de
donn{\'e}e.}
}
@INPROCEEDINGS{Nis10,
AUTHOR = {N. Nisse},
BOOKTITLE = {24th European Conference on Operational Research (EURO)},
TITLE = {Graph Searching and Graph Decompositions},
YEAR = {2010},
ADDRESS = {Lisbon, Portugal},
OPTEDITOR = {},
MONTH = {July},
NOTE = {Invited talk},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00482115},
ABSTRACT = {Graph searching is a game where a team of mobile agents
must catch a fugitive hidden in a network (modelled by a graph).
Equivalently, graph search- ing may be defined in terms of clearing a
contaminated network. Besides of its practical interests, graph
searching has been widely studied for its relationship with important
graph parameters, in particular pathwidth and treewidth. Many
versions of graph searching problems have been considered. They all
look for a strategy that allows to catch the fugitive using the
minimum number of agents. Variants of graph searching differ on
various parameters. We first give a brief survey of the numerous
research directions in this field. Then, we focus on the relationship
between search games and graph decompositions (path- and tree-
decompositions). Namely, search games provide a very interesting
algorithmic interpretation of the pathwidth and the treewidth of
graphs. we explain the equivalence between theses games and graph
decompositions through an impor- tant property of these two search
games: the monotonicity. This point of view allowed us to obtain new
duality results generalyzing those obtained by Robert- son and
Seymour in the Graph Minors Theory}
}
@INPROCEEDINGS{RDD+10,
AUTHOR = {J. Ribault and O. Dalle and D. Conan and S. Leriche},
BOOKTITLE = {In Proc. of 3rd Intl. ICST Conference on Simulation Tools and Techniques (SIMUTools'2010)},
TITLE = {OSIF: A Framework To Instrument, Validate, and Analyze
Simulations},
YEAR = {2010},
ADDRESS = {Torremolinos, Spain},
OPTEDITOR = {},
MONTH = {15-19 March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00465141/en/},
ABSTRACT = {{I}n most existing simulators, the outputs of a
simulation run consist either in a simulat ion report generated at
the end of the run and summarizing the statistics of interest, or in
a (set of) trace file(s) containing raw data samples produced and
saved regularly during the run, for later post-processing. {I}n this
paper, we address issues related to the management of these data and
their on-line processing, such as: (i)~the instrumentation code is
mixed in the modeling code; (ii)~the amount of data to be stored may
be enormous, and often, a significant part of these data are useless
while their collect may consume a significant amount of the computing
resources; and (iii)~it is difficult to have confidence in the
treatment applied to the data and then make comparisons between
studies since each user (model developer) builds its own ad-hoc
instrumentation and data processing. {I}n this paper, we propose
{OSIF}, a new component-based instrumentation framework designed to
solve the above mentioned issues. {OSIF} is based on several mature
software engineering techniques and frameworks, such as {COSMOS},
{F}ractal and its {ADL}, and {AOP}.}
}
@INPROCEEDINGS{UMD10a,
AUTHOR = {P. Uribe and Maureira Bravo, J-C. and O. Dalle},
BOOKTITLE = {Proc. of the 2010 Intl. ICST Workshop on OMNeT++ (OMNeT++ 2010)},
TITLE = {Extending INET Framework for Directional and
Asymmetrical Wireless Communications},
YEAR = {2010},
ADDRESS = {Torremolinos, Spain},
OPTEDITOR = {},
MONTH = {15-19 March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1--8},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{ANB09,
AUTHOR = {E. Altman and P. Nain and J-C. Bermond},
BOOKTITLE = {INFOCOM 2009},
TITLE = {Distributed Storage Management of Evolving Files in
Delay Tolerant Ad Hoc Networks},
YEAR = {2009},
ADDRESS = {Rio De Janeiro, Brazil},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1431 - 1439},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dx.doi.org/10.1109/INFCOM.2009.5062059},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/ABN08.pdf},
ABSTRACT = {This work focuses on a class of distributed storage
systems whose content may evolve over time. Each component or node of
the storage system is mobile and the set of all nodes forms a delay
tolerant (ad hoc) network (DTN). The goal of the paper is to study
efficient ways for distributing evolving files within DTNs and for
managing dynamically their content. We specify to dynamic files where
not only the latest version is useful but also previous ones; we
restrict however to files where a file has no use if another more
recent version is available. There are $N+1$ mobile nodes including a
{\em single} source which at some points in time makes available a
new version of a {\em single} file $F$. We consider both the cases
when (a) nodes do not cooperate and (b) nodes cooperate. In case (a)
only the source may transmit a copy of the latest version of $F$ to a
node that it meets, while in case (b) any node may transmit a copy of
$F$ to a node that it meets. A file management policy is a set of
rules specifying when a node may send a copy of $F$ to a node that it
meets. The objective is to find file management policies which
maximize some system utility functions under a constraint on the
resource consumption. Both myopic ({\em static}) and state-dependent
({\em dynamic}) policies are considered, where the state of a node is
the age of the copy of $F$ it carries. Scenario (a) is studied under
the assumption that the source updates $F$ at discrete times
$t=0,1,\ldots$. During a slot $[t,t+1)$ the source meets any node
with a fixed probability. We find the optimal static (resp. dynamic)
policy which maximizes a general utility function under a constraint
on the number of transmissions within a slot. In particular, we show
the existence of a threshold dynamic policy. In scenario (b) $F$ is
updated at random points in time, with the consequence that between
two meetings with the source a node does not know the age evolution
of the version of $F$ it holds. Under Markovian assumptions regarding
nodes mobility and update frequency of $F$, we study the stability of
the system (aging of the nodes) and derive an (approximate) optimal
static policy. We then revisit scenario (a) when the source does not
know parameter $N$ (node population) and $q$ (node meeting
probability) and derive a stochastic approximation algorithm which we
show to converge to the optimal static policy found in the complete
information setting. Numerical results illustrate the respective
performance of optimal static and dynamic policies as well as the
benefit of node cooperation.}
}
@INPROCEEDINGS{ACGH09a,
AUTHOR = {J. Araujo and N. Cohen and F. Giroire and F. Havet},
BOOKTITLE = {proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09)},
TITLE = {Good edge-labelling of graphs},
YEAR = {2009},
ADDRESS = {Gramado, Brazil},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {275--280},
PUBLISHER = {Springer},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {35},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACGH09.pdf},
ABSTRACT = {A good edge-labelling of a graph G is a labelling of its
edges such that for any two distinct vertices u, v, there is at most
one (u,v)-path with non-decreasing labels. This notion was introduced
in [J-C. Bermond, M. Cosnard, and S. PÃ©rennes. Directed acyclic
graphs with unique path property. Technical Report RR-6932, INRIA,
May 2009] to solve wavelength assignment problems for specific
categories of graphs. In this paper, we aim at characterizing the
class of graphs that admit a good edge-labelling. First, we exhibit
infinite families of graphs for which no such edge-labelling can be
found. We then show that deciding if a graph admits a good
edge-labelling is NP-complete. Finally, we give large classes of
graphs admitting a good edge-labelling: C3-free outerplanar graphs,
planar graphs of girth at least 6, subcubic {C3,K2,3}-free graphs.}
}
@INPROCEEDINGS{ArLi09,
AUTHOR = {J. Araujo and Linhares Sales, C.},
BOOKTITLE = {proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09)},
TITLE = {Grundy number on $P_4$-classes},
YEAR = {2009},
ADDRESS = {Gramado, Brazil},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {21--27},
PUBLISHER = {Springer},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {35},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ArLi09.pdf},
ABSTRACT = {In this article, we define a new class of graphs, the
fat-extended P4-laden graphs, and we show a polynomial time algorithm
to determine the Grundy number of the graphs in this class. This
result implies that the Grundy number can be found in polynomial time
for any graph of the following classes: P4-reducible, extended
P4-reducible, P4-sparse, extended P4-sparse, P4-extendible, P4-lite,
P4-tidy, P4-laden and extended P4-laden, which are all strictly
contained in the fat-extended P4-laden class.}
}
@INPROCEEDINGS{AMC09,
AUTHOR = {J. Araujo and P. Moura and M. Campêlo},
BOOKTITLE = {Encontro Regional de Pesquisa Operacional do Nordeste},
TITLE = {Sobre a complexidade de Coloração Mista},
YEAR = {2009},
ADDRESS = {Fortaleza, Brazil},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1--10},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AMC10.pdf},
ABSTRACT = {Grafos mistos sËœao estruturas matemÂ´aticas que mesclam
caracterÂ´Ä±sticas de grafos direcionados e nËœao-direcionados.
Formalmente, um grafo misto pode ser definido por uma tripla GM = (V;
A;E), onde V , A e E representam, respectivamente, um conjunto de
vÂ´ertices, de arcos e de arestas. Uma k-coloracÂ¸ Ëœao mista de GM =
(V; A;E) Â´e funcÂ¸ Ëœao c : V ! f0; : : : ; k Â¡ 1g tal que c(u) <
c(v), se (u; v) 2 A, e c(u) 6= c(v), se [u; v] 2 E. O problema de
ColoracÂ¸ Ëœao Mista consiste em determinar o nÂ´umero cromÂ´atico
misto de GM, denotado por Ã‚M(GM), que Â´e menor inteiro k tal que GM
admite uma k-coloracÂ¸ Ëœao mista. Esse problema modela variacÂ¸
Ëœoes de problemas de escalonamento que consideram simultaneamente
restricÂ¸ Ëœoes de precedË†encia e de compartilhamento de recursos.
Neste trabalho, mostramos que ColoracÂ¸ Ëœao Mista Â´e NP-difÂ´Ä±cil
para as classes dos grafos cordais, dos grafos linha de grafos
bipartidos e dos grafos linha de grafos periplanares. }
}
@INPROCEEDINGS{BJF+09,
AUTHOR = {D. Barman and J. Chandrashekar and N. Taft and
M. Faloutsos and L. Huang and F. Giroire},
BOOKTITLE = {ACM SIGCOMM Workshop on Research on Enterprise Networking -- WREN},
TITLE = {Impact of IT Monoculture on Behavioral End Host
Intrusion Detection},
YEAR = {2009},
ADDRESS = {Barcelona, Spain},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {ACM},
PAGES = {27--36},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/BCF09.pdf},
ABSTRACT = {In this paper, we study the impact of today's IT
policies, defined based upon a monoculture approach, on the
performance of endhost anomaly detectors. This approach leads to the
uniform configuration of Host intrusion detection systems (HIDS)
across all hosts in an enterprise networks. We assess the performance
impact this policy has from the individual's point of view by
analyzing network traces collected from 350 enterprise users. We
uncover a great deal of diversity in the user population in terms of
the Ã¢â‚¬Å“tailÃ¢â‚¬ behavior, i.e., the component which matters for
anomaly detection systems. We demonstrate that the monoculture
approach to HIDS configuration results in users that experience
wildly different false positive and false negatives rates. We then
introduce new policies, based upon leveraging this diversity and show
that not only do they dramatically improve performance for the vast
majority of users, but they also reduce the number of false positives
arriving in centralized IT operation centers, and can reduce attack
strength.}
}
@INPROCEEDINGS{BCM+09b,
AUTHOR = {J-C. Bermond and D. Coudert and J. Moulierac and
S. Perennes and H. Rivano and I. Sau and Solano Donado, F.},
BOOKTITLE = {IFIP Networking},
TITLE = {MPLS label stacking on the line network},
YEAR = {2009},
ADDRESS = {Aachen, Germany},
EDITOR = {et al., L. Fratta},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {809-820},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5550},
URL = {http://hal.inria.fr/inria-00354267/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/bermond09mpls.pdf},
ABSTRACT = {All-Optical Label Switching (AOLS) is a new technology
that performs forwarding without any Optical-Electrical-Optical (OEO)
conversions. In this report, we study the problem of routing a set of
requests in AOLS networks with the aim of minimizing the number of
labels required to ensure the forwarding. In order to spare the label
space, we consider label stacking, allowing the configuration of
tunnels. We study particularly this network design problem when the
network is a line. We provide an exact algorithm for the case in
which all the requests have a common source and present some
approximation algorithms and heuristics when an arbitrary number of
sources are distributed over the line. We contrast the performance of
our proposed algorithms by simulations.}
}
@INPROCEEDINGS{BCM+09d,
AUTHOR = {J-C. Bermond and D. Coudert and J. Moulierac and
S. Perennes and I. Sau and Solano Donado, F.},
BOOKTITLE = {16th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
TITLE = {Designing Hypergraph Layouts to GMPLS Routing Strategies},
YEAR = {2009},
ADDRESS = {Piran, Slovenia},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {57--71},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5869},
URL = {http://hal.inria.fr/inria-00428685/fr/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/bermond09designing.pdf},
ABSTRACT = {All-Optical Label Switching (AOLS) is a new technology
that performs packet forwarding without any
Optical-Electrical-Optical (OEO) conversions. In this paper, we study
the problem of routing a set of requests in AOLS networks using GMPLS
technology, with the aim of minimizing the number of labels required
to ensure the forwarding. We first formalize the problem by
associating to each routing strategy a logical hypergraph whose
hyperedges are dipaths of the physical graph, called \emph{tunnels}
in GMPLS terminology. Such a hypergraph is called a \emph{hypergraph
layout}, to which we assign a cost function given by its physical
length plus the total number of hops traveled by the traffic.
Minimizing the cost of the design of an AOLS network can then be
expressed as finding a minimum cost hypergraph layout. We prove
hardness results for the problem, namely $C \log n$ hardness for
directed networks and non-existence of \textsc{PTAS} for undirected
networks, where $C $ is a a positive constant and $n$ is the number
of nodes of the network. These hardness results hold even is the
traffic instance is a partial broadcast. On the other hand, we
provide an $\mathcal{O}(\log n)$-approximation algorithm to the
problem for a general network. Finally, we focus on the case where
the physical network is a path, providing a polynomial-time dynamic
programming algorithm for a bounded number of sources, thus extending
the algorithm of~\cite{BCM+09b} for a single source. }
}
@INPROCEEDINGS{BMN09,
AUTHOR = {J-C. Bermond and D. Mazauric and P. Nain},
BOOKTITLE = {10èmes Journées Doctorales en Informatique et Réseaux (JDIR)},
TITLE = {Algorithmes distribués d'ordonnancement dans les réseaux
sans-fil},
YEAR = {2009},
ADDRESS = {Belfort, France},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BMN09.pdf},
ABSTRACT = {Nous consid\'erons dans cet article le probl\`eme
d'ordonnancement distribu\'e dans les r\'eseaux sans-fil. En raison
des interf\'erences dans ce type de r\'eseau, ne peuvent \^etre
activ\'es simultan\'ement que des liens n'interf\'erant pas entre
eux. Par exemple dans un mod\`ele primaire, on ne peut activer que
des liens deux \`a deux non adjacents. Nous nous pla\c cons dans un
contexte d'arriv\'ee al\'eatoire de messages et l'objectif est
d'assurer un bon comportement du r\'eseau en particulier d'assurer la
stabilit\'e des files d'attente, en limitant le nombre moyen de
messages en attente. Des algorithmes centralis\'es permettant de
d\'ecider quels liens sont activ\'es \`a chaque \'etape existent mais
ils supposent une connaissance globale du r\'eseau et sont peu
adapt\'es aux applications. Il est donc n\'ecessaire de concevoir des
algorithmes distribu\'es qui utilisent une connaissance tr\`es locale
du r\'eseau. Nous proposons dans cet article deux algorithmes
distribu\'es, valides quelque soit le mod\`ele d'interf\'erence
binaire et avec une phase de contr\^ole de dur\'ee constante,
am\'eliorant les algorithmes existants v\'erifiant uniquement l'un ou
l'autre de ces deux crit\`eres.}
}
@INPROCEEDINGS{BNRR09,
AUTHOR = {J-C. Bermond and N. Nisse and P. Reyes and H. Rivano},
BOOKTITLE = {11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09)},
TITLE = {Fast Data Gathering in Radio Grid Networks},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.lif.univ-mrs.fr/algotel09},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BNRR09.pdf},
ABSTRACT = {Nous prÃ©sentons des algorithmes efficaces pour la
collecte d'informations par une station de base au sein d'un rÃ©seau
sans-fil multi sauts en prÃ©sence d'interfÃ©rences. Nous nous
focalisons sur les rÃ©seaux en grille car ils sont un bon modÃ¨le des
rÃ©seaux d'accÃ¨s comme des rÃ©seaux alÃ©atoires de capteurs. Le
temps est divisÃ© en Ã©tapes Ã©lÃ©mentaires. Au cours d'une Ã©tape,
un nÅ“ud peut transmettre au plus un message Ã l'un de ces voisins.
Chaque appareil est Ã©quipÃ© d'un interface half duplex et ne peut
donc Ã©mettre et recevoir Ã la mÃªme Ã©tape. Ainsi, au cours d'une
Ã©tape, l'ensemble des transmissions valides induit un couplage de la
grille. Le problÃ¨me consiste Ã minimiser le nombre d'Ã©tapes
nÃ©cessaires Ã la collecte de tous les messages par la station de
base. Le meilleur algorithme connu Ã©tait une 3/2 approximation. Nous
donnons un algorithme trÃ¨s simple qui approche l'optimum Ã 2 prÃ¨s,
puis nous prÃ©sentons un algorithme plus Ã©voluÃ© qui est une +1
approximation. Nos rÃ©sultats sont valides lorsque les appareils ne
disposent d'aucune mÃ©moire tampon et doivent retransmettre un
message Ã l'Ã©tape suivant sa rÃ©ception.}
}
@INPROCEEDINGS{BNRR09c,
AUTHOR = {J. C. Bermond and N. Nisse and P. Reyes and H. Rivano},
BOOKTITLE = {Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now)},
TITLE = {Minimum delay Data Gathering in Radio Networks},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {69-82},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5793},
URL = {http://hal.inria.fr/inria-00363908/fr/},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/adHocNow09.pdf},
ABSTRACT = {The aim of this paper is to design efficient gathering
algorithms (data collection) in a Base Station of a wireless multi
hop grid network when interferences constraints are present. We
suppose the time is slotted and that during one time slot (step) each
node can transmit to one of its neighbours at most one data item.
Each device is equipped with a half duplex interface; so a node
cannot both receive and transmit simultaneously. During a step only
non interfering transmissions can be done. In other words, the non
interfering calls done during a step will form a matching. The aim is
to minimize the number of steps needed to send to the base station a
set of messages generated by the nodes, this completion time is also
denoted makespan of the call scheduling. The best known algorithm for
open-grids was a multiplicative 1.5-approximation algorithm [Revah,
Segal 07]. In such topologies, we give a very simple +2 approximation
algorithm and then a more involved +1 approximation algorithm.
Moreover, our algorithms work when no buffering is allowed in
intermediary nodes, i.e., when a node receives a message at some
step, it must transmit it during the next step.}
}
@INPROCEEDINGS{BFM+09,
AUTHOR = {V. Bilò and M. Flammini and G. Monaco and L. Moscardelli},
BOOKTITLE = {Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009)},
TITLE = {On the performances of Nash Equilibria in Isolation
Games},
YEAR = {2009},
ADDRESS = {Niagara Falls, New York, U.S.A.},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {17-26},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5609},
URL = {http://www.springerlink.com/content/t02154u9h640t1xx/},
PDF = {http://www.springerlink.com/content/t02154u9h640t1xx/},
ABSTRACT = {We study the performances of Nash equilibria in
isolation games, a class of competitive location games recently
introduced by Zhao et all. For all the cases in which the existence
of Nash equilibria has been shown, we give tight or asymptotically
tight bounds on the prices of anarchy and stability under the two
classical social functions mostly investigated in the scientiÂ¯c
literature, namely, the minimum utility per player and the sum of the
players' utilities. Moreover, we prove that the convergence to Nash
equilibria is not guaranteed in some of the not yet analyzed cases.}
}
@INPROCEEDINGS{CCF09,
AUTHOR = {A. Casteigts and S. Chaumette and A. Ferreira},
BOOKTITLE = {Proc. of 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO'09)},
TITLE = {Characterizing Topological Assumptions of Distributed
Algorithms in Dynamic Networks},
YEAR = {2009},
ADDRESS = {Piran, Slovenia},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {126-140},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5869},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CCF09.pdf},
ABSTRACT = {Besides the complexity in time or in number of messages,
a common approach for analyzing distributed algorithms is to look at
their assumptions on the underlying network. This paper focuses on
the study of such assumptions in dynamic networks, where the
connectivity is expected to change, predictably or not, during the
execution. Our main contribution is a theoretical framework dedicated
to such analysis. By combining several existing components (local
computations, graph relabellings, and evolving graphs), this
framework allows to express detailed properties on the network
dynamics and to prove that a given property is necessary, or
sufficient, for the success of an algorithm. Consequences of this
work include (i)~the possibility to compare distributed algorithms on
the basis of their topological requirements, (ii)~the elaboration of
a formal classification of dynamic networks with respect to these
properties, and (iii)~the possibility to check automatically whether
a network trace belongs to one of the classes, and consequently to
know which algorithm should run on it.}
}
@INPROCEEDINGS{CF+09,
AUTHOR = {N. Cohen and F. V. Fomin and G. Gutin and E. J. Kim and
S. Saurabh and A. Yeo},
BOOKTITLE = {15th Annual International Conference on Computing and Combinatorics (COCOON)},
TITLE = {Algorithm for Finding -Vertex Out-trees and Its
Application to -Internal Out-branching Problem},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {37-46},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5609},
URL = {http://dx.doi.org/10.1007/978-3-642-02882-3_5},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CF+09.pdf},
ABSTRACT = {An out-tree T is an oriented tree with exactly one
vertex of in-degree zero and a vertex x of T is called internal if
its out-degree is positive. We design randomized and deterministic
algorithms for deciding whether an input digraph contains a subgraph
isomorphic to a given out-tree with k vertices. Both algorithms run
in Oâˆ—(5.704^k) time. We apply the deterministic algorithm to obtain
an algorithm of runtime Oâˆ—(c^k), where c is a constant, for
deciding whether an input digraph contains a spanning out-tree with
at least k internal vertices. This answers in affirmative a question
of Gutin, Razgon and Kim (Proc. AAIM'08).}
}
@INPROCEEDINGS{CHM09b,
AUTHOR = {N. Cohen and F. Havet and T. Müller},
BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)},
TITLE = {Acyclic edge-colouring of planar graphs},
YEAR = {2009},
ADDRESS = {Bordeaux, France},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {417-421},
OPTPUBLISHER = {},
SERIES = {Electronic Notes on Discrete Mathematics},
VOLUME = {34},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHM09b.pdf},
ABSTRACT = {A proper edge-colouring with the property that every
cycle contains edges of at least three distinct colours is called an
{\it acyclic edge-colouring}. The {\it acyclic chromatic index} of a
graph $G$, denoted $\chi'_a(G)$ is the minimum $k$ such that $G$
admits an {\it acyclic edge-colouring} with $k$ colours. We
conjecture that if $G$ is planar and $\Delta(G)$ is large enough then
$\chi'_a(G)=\Delta(G)$. We settle this conjecture for planar graphs
with girth at least $5$ and outerplanar graphs. We also show that if
$G$ is planar then $\chi'_a(G)\leq \Delta(G) + 25$.}
}
@INPROCEEDINGS{CGS09b,
AUTHOR = {D. Coudert and F. Giroire and I. Sau},
BOOKTITLE = {20th International Workshop on Combinatorial Algorithms -- IWOCA},
TITLE = {Edge-Simple Circuits Through 10 Ordered Vertices in
Square Grids},
YEAR = {2009},
ADDRESS = {Hradec nad Moravicì, Czech Republic},
EDITOR = {J. Kratochvìl and M. Miller},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {134-145},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5874},
URL = {http://hal.inria.fr/inria-00429146},
PDF = {http://hal.inria.fr/docs/00/42/91/46/PDF/CGS09_IWOCA_nostyle.pdf},
ABSTRACT = {A \emph{circuit} in a simple undirected graph $G=(V,E)$
is a sequence of vertices $\{v_1,v_2,\ldots,v_{k+1}\}$ such that
$v_1=v_{k+1}$ and $\{v_i,v_{i+i}\} \in E$ for $i=1,\ldots,k$. A
circuit $C$ is said to be \emph{edge-simple} if no edge of $G$ is
used twice in $C$. In this article we study the following problem:
which is the largest integer $k$ such that, given any subset of $k$
ordered vertices of an infinite square grid, there exists an
edge-simple circuit visiting the $k$ vertices in the prescribed
order? We prove that $k=10$. To this end, we first provide a
counterexample implying that $k<11$. To show that $k\geq 10$, we
introduce a methodology, based on the notion of core graph, to reduce
drastically the number of possible vertex configurations, and then we
test each one of the resulting configurations with an \textsc{ILP}
solver.}
}
@INPROCEEDINGS{CHM+09b,
AUTHOR = {D. Coudert and F. Huc and D. Mazauric and N. Nisse and
J-S. Sereni},
BOOKTITLE = {11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09)},
TITLE = {Reconfiguration dans les réseaux optiques},
YEAR = {2009},
ADDRESS = {Carry le Rouet},
EDITOR = {A. Chaintreau and C. Magnien},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00331807},
PDF = {http://hal.inria.fr/docs/00/38/32/06/PDF/CHMNS09b.pdf},
ABSTRACT = {L'\'evolution permanente du trafic, les op\'erations de
maintenance et l'existence de pannes dans les r\'eseaux WDM, obligent
\`a rerouter r\'eguli\`erement des connexions. Les nouvelles demandes
de connexions sont rout\'ees en utilisant les ressources disponibles
et, si possible, sans modifier le routage des connexions existantes.
Ceci peut engendrer une mauvaise utilisation des ressources
disponibles. Il est donc pr\'ef\'erable de reconfigurer
r\'eguli\`erement l'ensemble des routes des diff\'erentes connexions.
Un objectif particuli\`erement important est alors de minimiser le
nombre de requ\^etes simultan\'ement interrompues lors de la
reconfiguration. Nous proposons une heuristique pour r\'esoudre ce
probl\`eme dans les r\'eseaux WDM. Les simulations montrent que cette
heuristique r\'ealise de meilleures performances que celle propos\'ee
par Jose et Somani (2003). Nous proposons \'egalement un mod\`ele
permettant de prendre en compte diff\'erentes classes de clients,
avec notamment la contrainte que des requ\^etes, dites prioritaires,
ne peuvent pas \^etre interrompues. Une simple transformation permet
de r\'eduire le probl\`eme avec requ\^etes prioritaires au probl\`eme
initial. De ce fait, notre heuristique s'applique \'egalement au cas
autorisant des requ\^etes prioritaires.}
}
@INPROCEEDINGS{CHM+09,
AUTHOR = {D. Coudert and F. Huc and D. Mazauric and N. Nisse and
J-S. Sereni},
BOOKTITLE = {13th Conference on Optical Network Design and Modeling (ONDM)},
TITLE = {Reconfiguration of the Routing in WDM Networks with Two
Classes of Services},
YEAR = {2009},
ADDRESS = {Braunschweig, Germany},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00331807},
ABSTRACT = {In WDM backbone networks, the traffic pattern evolves
constantly due to the nature of the demand itself or because of
equipment failures leading to reroute affected connections. In this
context, requests are routed greedily using available resources
without changing the routing of pre-established connections. However,
such a policy leads to a poor usage of resources and so higher
blocking probability: new connection requests might be rejected while
network resources are sufficient to serve all the traffic. Therefore,
it is important to regularly reconfigure the network by rerouting
established connections in order to optimize the usage of network
resources. In this paper, we consider the network reconfiguration
problem that consists in switching existing connections one after the
other from the current routing to a new pre-computed routing. Due to
cyclic dependencies between connections, some requests may have to be
temporarily interrupted during this process. Clearly, the number of
requests simultaneously interrupted has to be minimized. Furthermore,
it might be impossible for the network operator to interrupt some
connections because of the contract signed with the corresponding
clients. In this setting, the network reconfiguration problem
consists in going from a routing to another one given that some
priority connections cannot be interrupted. The network
reconfiguration problem without priority connections has previously
been modeled as a cops-and-robber game in [CPPS05,CoSe07]. Here, we
first extend this model to handle priority connections. Then we
identify cases where no solution exists. Using a simple
transformation, we prove that the reconfiguration problem with
priority connections can be reduced to the problem without this
constraint. Finally, we propose a new heuristic algorithm that
improves upon previous proposals. }
}
@INPROCEEDINGS{CMN09b,
AUTHOR = {D. Coudert and D. Mazauric and N. Nisse},
BOOKTITLE = {DIMAP workshop on Algorithmic Graph Theory (AGT09)},
TITLE = {On Rerouting Connection Requests in Networks with Shared
Bandwidth},
YEAR = {2009},
ADDRESS = {Warwick, UK},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {109-116},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {32},
URL = {http://dx.doi.org/10.1016/j.endm.2009.02.015},
PDF = {http://hal.inria.fr/docs/00/35/00/25/PDF/RR-6790.pdf},
ABSTRACT = {In this paper, we address the problem of scheduling the
switching of a set of connection requests one after the other from
current routing to another pre-determined routing. We propose a model
that handles requests using only a constant fraction of the bandwidth
of a link, thus generalizing the model proposed in [CoSe07,JoSo03]
for WDM networks. Our main result is the proof that the problem of
deciding whether it exists a scheduling of the rerouting of
connection requests without traffic interruption is NP-complete even
if requests use the third of the bandwidth of a link. Note that the
problem is polynomial when the bandwidth of a link cannot be shared
[CoSe07]. }
}
@INPROCEEDINGS{CNR09b,
AUTHOR = {D. Coudert and N. Nepomuceno and H. Rivano},
BOOKTITLE = {11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09)},
TITLE = {Joint Optimization of Routing and Radio Configuration in
Fixed Wireless Networks},
YEAR = {2009},
ADDRESS = {Carry le Rouet},
EDITOR = {A. Chaintreau and C. Magnien},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00384968/fr/},
PDF = {http://hal.inria.fr/docs/00/38/49/68/PDF/AlgoTel.pdf},
ABSTRACT = {Nous Ã©tudions la minimisation de la consommation
d'Ã©nergie des rÃ©seaux sans-fil fixes Ã transmission par liens
micro-ondes, par l'optimisation jointe du routage des flux de
donnÃ©es et la sÃ©lection de la configuration des liens. Nous
prÃ©sentons une formulation mathÃ©matique exacte basÃ©e sur un
multiflot entier de coÃ»t minimum avec des fonctions de coÃ»t en
escalier, rendant le problÃ¨me trÃ¨s difficile Ã rÃ©soudre. Nous
proposons ensuite une fonction linÃ©aire par morceaux convexe,
obtenue par interpolation linÃ©aire des points de configuration
efficaces en Ã©nergie, qui fournit une bonne approximation de la
consommation d'Ã©nergie sur les liens, et prÃ©sentons une relaxation
qui exploite la convexitÃ© des fonctions de coÃ»t. Ceci rapporte des
limites infÃ©rieures sur la consommation d'Ã©nergie, et finalement un
algorithme heuristique basÃ© sur l'optimum fractionnaire est utilisÃ©
pour produire des solutions rÃ©alisables. Les rÃ©sultats attestent du
potentiel de notre nouvelle approche.}
}
@INPROCEEDINGS{CNR09,
AUTHOR = {D. Coudert and N. Nepomuceno and H. Rivano},
BOOKTITLE = {First IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH)},
TITLE = {Minimizing Energy Consumption by Power-Efficient Radio
Configuration in Fixed Broadband Wireless Networks},
YEAR = {2009},
ADDRESS = {Kos, Greece},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dx.doi.org/10.1109/WOWMOM.2009.5282434},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CNR09.pdf},
ABSTRACT = {"In this paper, we investigate on minimizing the energy
consumption of a fixed broadband wireless network through a joint
optimization of data routing and radio configuration. The network is
modeled by a digraph in which the nodes represent radio base stations
and the arcs denote radio links. Under this scenario, a
power-efficient configuration can be characterized by a modulation
constellation size and a transmission power level. Every link holds a
set of power-efficient configurations, each of them associating a
capacity with its energy cost. The optimization problem involves
deciding the network's configuration and flows that minimize the
total energy consumption, while handling all the traffic requirements
simultaneously. An exact mathematical formulation of the problem is
presented. It relies on a minimum cost multicommodity flow with step
increasing cost functions, which is very hard to optimize. We then
propose a piecewise linear convex function, obtained by linear
interpolation of powerefficient configuration points, that provides a
good approximation of the energy consumption on the links, and
present a relaxation of the previous formulation that exploits the
convexity of the energy cost functions. This yields lower bounds on
the energy consumption, and finally a heuristic algorithm based on
the fractional optimum is employed to produce feasible solutions. Our
models are validated through extensive experiments that are reported
and discussed. The results verify the potentialities behind this
novel approach. In particular, our algorithm induces a satisfactory
integrality gap in practice."}
}
@INPROCEEDINGS{DGMP09a,
AUTHOR = {O. Dalle and F. Giroire and J. Monteiro and S. Pérennes},
BOOKTITLE = {11ème rencontres francophones sur les Aspects Algorithmiques des Télécommunications (Algotel'2009)},
TITLE = {Analyse des Corrélations entre Pannes dans les Systèmes
de Stockage Pair-à-Pair},
YEAR = {2009},
ADDRESS = {Carry-Le-Rouet France},
EDITOR = {Augustin Chaintreau and Clemence Magnien},
OPTMONTH = {},
NOTE = {Best Student Paper Award},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00485847/en/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DGMP09a.pdf},
ABSTRACT = {{D}ans cet article, nous pr{\'e}sentons et {\'e}tudions
des mod{\`e}les analytiques de syst{\`e}mes de stockage
pair-{\`a}-pair fiables {\`a} long terme. {L}es pairs sont sujets
{\`a} des pannes d{\'e}finitives (d{\'e}faillance du disque,
d{\'e}part du pair) induisant la perte de toutes les donn{\'e}es
stock{\'e}es par le pair. {C}es pannes ont lieu en continu. {A}fin de
p{\'e}renniser les donn{\'e}es il est indispensable d'user de
redondance et de maintenir celle-ci au moyen d'un processus permanent
de reconstruction. {D}ans un premier temps nous consid{\'e}rons une
approche classiquement utilis{\'e}e dans la litt{\'e}rature,
consistant {\`a} mod{\'e}liser chaque bloc par une cha{\^i}ne de
{M}arkov et {\`a} n{\'e}gliger les interd{\'e}pendances entre blocs.
{S}i celle-ci permet le calcul du comportement moyen du syst{\`e}me
(par exemple la demande moyenne en bande passante), elle est
insuffisante pour en {\'e}valuer les fluctuations. {N}os simulations
d{\'e}montrent que ces fluctuations sont tr{\`e}s importantes
m{\^e}me pour des grands syst{\`e}mes comportant des milliers de
pairs. {N}ous proposons alors un nouveau mod{\`e}le stochastique
prenant en compte l'interd{\'e}pendance des pannes de blocs, et nous
en donnons une approximation fluide. {C}eci nous permet de
caract{\'e}riser le comportement du syst{\`e}me (calcul de tous les
moments) mais aussi de le simuler efficacement, car il est
ind{\'e}pendant de la taille du syst{\`e}me. {L}a pertinence de notre
mod{\`e}le est valid{\'e}e en comparant les r{\'e}sultats obtenus par
des simulations utilisant d'un c{\^o}t{\'e} notre mod{\`e}le fluide
et de l'autre un mod{\`e}le {\`a} {\'e}v{\'e}nements discrets
reproduisant fid{\`e}lement le comportement du syst{\`e}me.}
}
@INPROCEEDINGS{DGMP09b,
AUTHOR = {O. Dalle and F. Giroire and J. Monteiro and S. Pérennes},
BOOKTITLE = {Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P)},
TITLE = {Analysis of Failure Correlation Impact on Peer-to-Peer
Storage Systems},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {184--193},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dx.doi.org/10.1109/P2P.2009.5284518},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DGMP09b.pdf},
ABSTRACT = {Peer-to-peer storage systems aim to provide a reliable
long-term storage at low cost. In such systems, peers fail
continuously, hence, the necessity of self-repairing mechanisms to
achieve high durability. In this paper, we propose and study
analytical models that assess the bandwidth consumption and the
probability to lose data of storage systems that use erasure coded
redundancy. We show by simulations that the classical stochastic
approach found in the literature, that models each block
independently, gives a correct approximation of the system average
behavior, but fails to capture its variations over time. These
variations are caused by the simultaneous loss of multiple data
blocks that results from a peer failing (or leaving the system). We
then propose a new stochastic model based on a fluid approximation
that better captures the system behavior. In addition to its
expectation, it gives a correct estimation of its standard deviation.
This new model is validated by simulations.}
}
@INPROCEEDINGS{Fer09,
AUTHOR = {A. Ferreira},
BOOKTITLE = {Proceedings of IEEE Wireless VITAE'09},
TITLE = {Road-mapping the Digital Revolution: Visions from COST
Foresight 2030 (An exercise in multi-disciplinarity)},
YEAR = {2009},
ADDRESS = {Aalborg, Denmark},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {5p},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Fer09.pdf},
ABSTRACT = {From innovation triggered by user virtual communities to
remote surgery and new financial instruments, the creative power of
individuals is being fostered at proportions previously unseen. The
main driver enabling such a pace of innovation, scientific progress,
and user adoption is the Digital Revolution. One consequence is that
interrelationships between science, technology and society are
increasing in complexity and harder to understand. COST Foresight
2030 is an initiative encompassing a set of events designed to
explore a multi-disciplinary vision for a future permeated and shaped
by the digital revolution. This paper describes the vision behind
COST Foresight 2030 and highlights several issues that are likely to
become central in the next decades.}
}
@INPROCEEDINGS{FMM+09b,
AUTHOR = {M. Flammini and A. Marchetti-Spaccamela and G. Monaco and
L. Moscardelli and S. Zaks},
BOOKTITLE = {Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009)},
TITLE = {On the complexity of the regenerator placement problem
in optical networks},
YEAR = {2009},
ADDRESS = {Calgary, Canada},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {154-162},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://portal.acm.org/citation.cfm?doid=1583991.1584035},
PDF = {http://portal.acm.org/citation.cfm?doid=1583991.1584035},
ABSTRACT = {Placement of regenerators in optical networks has
attracted the attention of recent research works in optical networks.
In this problem we are given a network, with an underlying topology
of a graph G, and with a set of requests that correspond to paths in
G. There is a need to put a regenerator every certain distance,
because of a decrease in the power of the signal. In this work we
investigate the problem of minimizing the number of locations to
place the regenerators. We present analytical results regarding the
complexity of this problem, in four cases, depending on whether or
not there is a bound on the number of regenerators at each node, and
depending on whether or not the routing is given or only the requests
are given (and part of the solution is also to determine the actual
routing). These results include polynomial time algorithms,
NP-complete results, approximation algorithms, and inapproximability
results.}
}
@INPROCEEDINGS{FMM+09a,
AUTHOR = {M. Flammini and G. Monaco and L. Moscardelli and
H. Shachnai and M. Shalom and T. Tamir and S. Zaks},
BOOKTITLE = {Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2009)},
TITLE = {Minimizing total busy time in parallel scheduling with
application to optical networks},
YEAR = {2009},
ADDRESS = {Rome, Italy},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-12},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5161017},
PDF = {http://ieeexplore.ieee.org/search/wrapper.jsp?arnumber=5161017},
ABSTRACT = {We consider a scheduling problem in which a bounded
number of jobs can be processed simultaneously by a single machine.
The input is a set of n jobs J = {J1,..., Jn}. Each job, Jj, is
associated with an interval [sj, cj] along which it should be
processed. Also given is the parallelism parameter g ges 1, which is
the maximal number of jobs that can be processed simultaneously by a
single machine. Each machine operates along a contiguous time
interval, called its busy interval, which contains all the intervals
corresponding to the jobs it processes. The goal is to assign the
jobs to machines such that the total busy time of the machines is
minimized. The problem is known to be NP-hard already for g = 2. We
present a 4-approximation algorithm for general instances, and
approximation algorithms with improved ratios for instances with
bounded lengths, for instances where any two intervals intersect, and
for instances where no interval is properly contained in another. Our
study has important application in optimizing the switching costs of
optical networks.}
}
@INPROCEEDINGS{FoRe09,
AUTHOR = {N. Fountoulakis and B. Reed},
BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)},
TITLE = {A general critical condition for the emergence of a
giant component in random graphs with given degrees},
YEAR = {2009},
ADDRESS = {Bordeaux, France},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {639--645},
OPTPUBLISHER = {},
SERIES = {Electronic Notes on Discrete Mathematics},
VOLUME = {34}
}
@INPROCEEDINGS{Gia10a,
AUTHOR = {P. Giabbanelli},
BOOKTITLE = {Proceedings of the 14th Western Canadian Conference on Computing Education (ACM SIGCSE)},
TITLE = {Why having in-person lectures when e-learning and
podcasts are available?},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {42-44},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GCT+09,
AUTHOR = {F. Giroire and J. Chandrashekar and N. Taft and
E. Schooler and K. Papagiannaki},
BOOKTITLE = {12th International Symposium on Recent Advances in Intrusion Detection (RAID'09)},
TITLE = {Exploiting Temporal Persistence to Detect Covert Botnet
Channels},
YEAR = {2009},
ADDRESS = {Saint Malo, France},
EDITOR = { Springer},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {326--345},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5758},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GCT09.pdf},
ABSTRACT = {We describe a method to detect botnet command and
control traffic and individual end-hosts. We introduce the notion of
Ã¢â‚¬ destination traffic atomsÃ¢â‚¬ which aggregate the destinations
and services that are communicated with. We then compute the Ã¢â‚¬
persistenceÃ¢â‚¬ , which is a measure of temporal regularity and that
we propose in this paper, for individual destination atoms. Very
persistent destination atoms are added to a host's whitelist during a
training period. Subsequently, we track the persistence of new
destination atoms not already whitelisted, to identify suspicious C&C
destinations. A particularly novel aspect is that we track
persistence at multiple timescales concurrently. Importantly, our
method does not require any a-priori information about destinations,
ports, or protocols used in the C&C, nor do we require payload
inspection. We evaluate our system using extensive user traffic
traces collected from an enterprise network, along with collected
botnet traces. We demonstrate that our method correctly identifies a
botnet's C&C traffic, even when it is very stealthy. We also show
that filtering outgoing traffic with the constructed whitelists
dramatically improves the performance of traditional anomaly
detectors. Finally, we show that the C&C detection can be achieved
with a very low false positive rate.}
}
@INPROCEEDINGS{GMP09b,
AUTHOR = {F. Giroire and J. Monteiro and S. Pérennes},
BOOKTITLE = {Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN)},
TITLE = {P2P Storage Systems: How Much Locality Can They
Tolerate?},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {320--323},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {P2P storage system, data placement,
performance evaluation, data durability},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMP09.pdf},
ABSTRACT = {Large scale peer-to-peer systems are foreseen as a way
to provide highly reliable data storage at low cost. To achieve high
durability, such P2P systems encode the user data in a set of
redundant fragments and distribute them among the peers. In this
paper, we study the impact of different data placement strategies on
the system performance when using erasure codes redundancy schemes.
We compare three policies: two of them local, in which the data are
stored in logical neighbors, and the other one global, in which the
data are spread randomly in the whole system. We focus on the study
of the probability to lose a data block and the bandwidth consumption
to maintain enough redundancy. We use simulations to show that,
without resource constraints, the average values are the same no
matter which placement policy is used. However, the variations in the
use of bandwidth are much more bursty under the local policies. When
the bandwidth is limited, these bursty variations induce longer
maintenance time and henceforth a higher risk of data loss. Finally,
we propose a new external reconstruction strategy and a suitable
degree of locality that could be introduced in order to combine the
efficiency of the global policy with the practical advantages of a
local placement.}
}
@INPROCEEDINGS{GG09,
AUTHOR = {C. Gomes and J. Galtier},
BOOKTITLE = {8th International Conference on AD-HOC Networks & Wireless (ADHOC NOW)},
TITLE = {Optimal and Fair Transmission Rate Allocation Problem in
Multi-hop Cellular Networks},
YEAR = {2009},
ADDRESS = {Murcia, Spain},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {327-340},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5793},
PDF = {sftp://cgomes@mascotte.inria.fr/net/serveurs/www-sop/members/Cristiana.Gomes/id085_GomesGaltier.pdf},
ABSTRACT = {We deal with the rate allocation problem for downlink in
a Multi-hop Cellular Network. A mathematical model is provided to
assign transmission rates in order to reach an optimal and fair
solution. We prove that under some conditions that are often met, the
problem can be reduced to a single-hop cellular network problem. The
validity of our proof is confirmed experimentally.}
}
@INPROCEEDINGS{GHPT09,
AUTHOR = {D. Gonçalves and F. Havet and A. Pinlou and S. Thomassé},
BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)},
TITLE = {Spanning galaxies in digraphs},
YEAR = {2009},
ADDRESS = {Bordeaux, France},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {139--143},
OPTPUBLISHER = {},
SERIES = {Electronic Notes on Discrete Mathematics},
VOLUME = {34},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GHPT09.pdf},
ABSTRACT = {A \emph{star} is an arborescence in which the root
dominates all the other vertices. A \emph{galaxy} is a
vertex-disjoint union of stars. The \emph{directed star arboricity}
of a digraph $D$,denoted by $dst(D)$, is the minimum number of
galaxies needed to cover $A(D)$. In this paper, we show that
$dst(D)\leq \Delta(D)+1$ and that if $D$ is ascyclic then $dst(D)\leq
\Delta(D)$. These results are proving by considering the existence of
spanning galaxy in digraphs. Thus, we study the problem of deciding
whether a digraph $D$ has a spanning galaxy or not. We show that it
is NP-complete (even when restricted to acyclic digraphs) but that it
becomes polynomial-time solvable when restricted to strongly
connected digraphs. }
}
@INPROCEEDINGS{GuOn09a,
AUTHOR = {F. Guinand and B. Onfroy},
BOOKTITLE = {11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09)},
TITLE = {MANET : étude de l'impact de la mobilité sur la
connexité du réseau},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
NOTE = {Poster},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {2p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {réseau mobile ad-hoc, graphe dynamique, MANET,
connexité, algorithme},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Brice.Onfroy/publi/2009/pdf/2009_algotel_[guinand-onfroy]_mobility_impact_on_connectivity__poster.pdf},
ABSTRACT = {Avec la multiplication des terminaux communiquant, les
r\'eseaux ad-hoc dynamiques ont maintenant la capacit\'e de se
d\'evelopper. Ces r\'eseaux ne poss\`edent pas d'infrastructure fixe,
et les d\'eplacements rapides des terminaux rendent instables les
voisins de ces noeuds mobiles. Dans l'objectif de concevoir des
m\'ethodes d\'ecentralis\'ees efficaces, nos travaux actuels tentent
d'\'evaluer l'impact des diff\'erents param\`etres de mobilit\'e sur
la connexit\'e du graphe repr\'esentatif du r\'eseau form\'e par ces
terminaux mobiles. Le mod\`ele de mobilit\'e \'etudi\'e est le Random
Waypoint. L'objectif est donc de d\'eterminer quels param\`etres de
mobilit\'e (vitesse de d\'eplacement, temps de pause, ...) ont un
impact significatif sur la connexit\'e du r\'eseau.}
}
@INPROCEEDINGS{HaLi09,
AUTHOR = {F. Havet and Linhares Sales, C.},
BOOKTITLE = {Colloque d'Informatique: Brésil / INRIA, Coopérations, Avancées et Défis},
TITLE = {Combinatória e Problemas em Redes de Telecomunicações},
YEAR = {2009},
ADDRESS = {Bento Gonçalves, Brazil},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HaLi09.pdf},
ABSTRACT = {In this paper, we summarize some problems arising in
telecommunication networks which have been studied in the scope of
the cooperation between our teams ParGO (UFC) and Mascotte (INRIA).
We also present their modeling by graph coloring problems and some
partial results we have ob- tained.}
}
@INPROCEEDINGS{HDR09,
AUTHOR = {J. Himmelspach and O. Dalle and J. Ribault},
BOOKTITLE = {Proceedings of the Winter Simulation Conference (WSC'09)},
TITLE = {Design considerations for M&S software},
YEAR = {2009},
ADDRESS = {Austin, TX},
EDITOR = {D. Rossetti and R. R. Hill and B. Johansson and
A. Dunkin and R. G. Ingalls},
MONTH = {December},
NOTE = {Invited Paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {12p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://wwwmosi.informatik.uni-rostock.de/mosi/veroeffentlichungen/inproceedingsreference.2009-06-01.2218174380},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HiDaRi09.pdf},
ABSTRACT = {The development of M&S products often seems to be driven
by need: people start coding because they are interested in either a
concrete simulation study, or they are interested in a (single)
research subject of M&S methodology. We claim that discussing,
designing, developing, and comparing M&S products should be based on
software engineering concepts. We shortly introduce some of these
engineering concepts and discuss how these relate to the M&S domain.
By describing two examples, OSA and JAMES II, we illustrate that
reuse might play an important role in the development of high quality
M&S products as the examples allow reuse on the level of models and
scenarios, on the level of "simulation studies", of algorithms (e.g.,
reuse of event queues, random number generators), across hardware
architectures / operating systems, and of analysis tools.}
}
@INPROCEEDINGS{KaRe09b,
AUTHOR = {K. Kawarabayashi and B. Reed},
BOOKTITLE = {Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2009)},
TITLE = {A nearly linear time algorithm for the half integral
parity disjoint paths packing problem},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {January},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1183--1192},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://portal.acm.org/citation.cfm?id=1496770.1496898},
PDF = {http://www.siam.org/proceedings/soda/2009/SODA09_128_kawarabayashik.pdf},
ABSTRACT = {We consider the following problem, which is called the
half integral parity disjoint paths packing problem. Input: A graph
G, k pair of vertices (s1, t1), (s2, t2), ...,(sk, tk) in G (which
are sometimes called terminals), and a parity li for each i with $1
\leq i \leq k$, where li = 0 or 1. Output: Paths P1, ..., Pk in G
such that Pi joins si and ti for i = 1, 2, ..., k and parity of
length of the path Pi is li, i.e, if li = 0, then length of Pi is
even, and if li = 1, then length of Pi is odd for i = 1, 2, ..., k.
In addition, each vertex is on at most two of these paths. We present
an O(m \alpha(m, n) log n) algorithm for fixed k, where n, m are the
number of vertices and the number of edges, respectively, and the
function \alpha(m, n) is the inverse of the Ackermann function (see
by Tarjan [43]). This is the first polynomial time algorithm for this
problem, and generalizes polynomial time algorithms by Kleinberg [23]
and Kawarabayashi and Reed [20], respectively, for the half integral
disjoint paths packing problem, i.e., without the parity requirement.
As with the Robertson-Seymour algorithm to solve the k disjoint paths
problem, in each iteration, we would like to either use a huge clique
minor as a "crossbar", or exploit the structure of graphs in which we
cannot find such a minor. Here, however, we must maintain the parity
of the paths and can only use an "odd clique minor". We must also
describe the structure of those graphs in which we cannot find such a
minor and discuss how to exploit it. We also have algorithms running
in O(m(1 + \epsilon)) time for any \epsilon > 0 for this problem, if
k is up to o(log log log n) for general graphs, up to o(log log n)
for planar graphs, and up to o(log log n/g) for graphs on the
surface, where g is Euler genus. Furthermore, if k is fixed, then we
have linear time algorithms for the planar case and for the bounded
genus case.}
}
@INPROCEEDINGS{KaRe09c,
AUTHOR = {K. Kawarabayashi and B. Reed},
BOOKTITLE = {41th ACM Symposium on Theory of Computing (STOC 2009)},
TITLE = {Hadwiger's Conjecture is decidable},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {445--454},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://portal.acm.org/citation.cfm?id=1536414.1536476},
PDF = {http://portal.acm.org/ft_gateway.cfm?id=1536476&type=pdf&coll=GUIDE&dl=GUIDE&CFID=60373272&CFTOKEN=66048899},
ABSTRACT = {The famous Hadwiger's conjecture asserts that every
graph with no Kt-minor is (t-1)-colorable. The case t=5 is known to
be equivalent to the Four Color Theorem by Wagner, and the case t=6
is settled by Robertson, Seymour and Thomas. So far the cases t \geq
7 are wide open. In this paper, we prove the following two theorems:
There is an O(n2) algorithm to decide whether or not a given graph G
satisfies Hadwiger's conjecture for the case t. Every minimal
counterexample to Hadwiger's conjecture for the case t has at most
f(t) vertices for some explicit bound f(t). The bound f(t) is at most
pppt, where p=101010t. Our proofs for both results use the well-known
result by Thomassen [46] for 5-list-coloring planar graphs, together
with some results (but not the decomposition theorem) of Graph Minors
in [36]. Concerning the first result, we prove the following stronger
theorem: For a given graph G and any fixed t, there is an O(n2)
algorithm to output one of the following: a (t-1)-coloring of G, or a
Kt- minor of G, or a minor H of G of order at most f(t) such that H
does not have a Kt-minor nor is (t-1)-colorable. The last conclusion
implies that H is a counterexample to Hadwiger's conjecture with at
most f(t) vertices for the case t. The time complexity of the
algorithm matches the best known algorithms for 4-coloring planar
graphs (the Four Color Theorem), due to Appel and Hakken, and
Robertson, Sanders, Seymour and Thomas, respectively. Let us observe
that when t=5, the algorithm gives rise to an algorithm for the Four
Color Theorem. The second theorem follows from our structure theorem,
which has the following corollary: Every minimal counterexample G to
Hadwiger's conjecture for the case t either has at most f(t)
vertices, or has a vertex set Z of order at most t-5 such that G-Z is
planar. It follows from the Four Color Theorem that the second
assertion does not happen to any minimal counterexample to Hadwiger's
conjecture for the case t. Thus in constant time, we can decide
Hadwiger's conjecture for the case t.}
}
@INPROCEEDINGS{KMR09,
AUTHOR = {S. Kennedy and C. Meagher and B. Reed},
BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009)},
TITLE = {Fractionally Edge Colouring Graphs with Large Maximum
Degree in Linear Time},
YEAR = {2009},
ADDRESS = {Bordeaux, France},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {47--51},
OPTPUBLISHER = {},
SERIES = {Electronic Notes on Discrete Mathematics},
VOLUME = {34},
ABSTRACT = {For any c>1, we describe a linear time algorithm for
fractionally edge colouring simple graphs with maximum degree at
least |V|/c.}
}
@INPROCEEDINGS{LiSa09a,
AUTHOR = {Z. Li and I. Sau},
BOOKTITLE = {35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)},
TITLE = {Graph Partitioning and Traffic Grooming with Bounded
Degree Request Graph},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
NOTE = {Best student paper award},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {250-261,},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5911},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/LiSa09.pdf},
ABSTRACT = {We study a graph partitioning problem which arises from
traffic grooming in optical networks. We wish to minimize the
equipment cost in a SONET WDM ring network by minimizing the number
of Add-Drop Multiplexers (ADMs) used. We consider the version
introduced by Mu{\~n}oz and Sau~[Mu{\~n}oz and Sau, WG 08] where the
ring is unidirectional with a grooming factor $C$, and we must design
the network (namely, place the ADMs at the nodes) so that it can
support \emph{any} request graph with maximum degree at most
$\Delta$. This problem is essentially equivalent to finding the least
integer $M(C,\Delta)$ such that the edges of any graph with maximum
degree at most $\Delta$ can be partitioned into subgraphs with at
most $C$ edges and each vertex appears in at most $M(C,\Delta)$
subgraphs~[Mu{\~n}oz and Sau, WG 08] . The cases where $\Delta=2$ and
$\Delta=3,C\neq 4$ were solved by Mu{\~n}oz and Sau~[Mu{\~n}oz and
Sau, WG 08] . In this article we establish the value of $M(C,\Delta)$
for many more cases, leaving open only the case where $\Delta \geq 5$
is odd, $\Delta \pmod{2C}$ is between $3$ and $C-1$, $C\geq 4$, and
the request graph does not contain a perfect matching. In particular,
we answer a conjecture of~[Mu{\~n}oz and Sau, WG 08] .}
}
@INPROCEEDINGS{LiSa09b,
AUTHOR = {Linhares Sales, C. and L. Sampaio},
BOOKTITLE = {LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium},
TITLE = {b-coloring of m-tight graphs},
YEAR = {2009},
ADDRESS = {Gramado, Brazil},
EDITOR = {T. Liebling and J. Szwarcfiter},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {209 - 214},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {35},
URL = {http://dx.doi.org/10.1016/j.endm.2009.11.035},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/LiSab.pdf}
}
@INPROCEEDINGS{DDM09,
AUTHOR = {Maureira Bravo, J-C. and D. Dujovne and O. Dalle},
BOOKTITLE = {Second International Workshop on OMNeT++},
TITLE = {Generation of Realistic 802.11 Interferences in the
OMNeT++ INET Framework Based on Real Traffic Measurements},
YEAR = {2009},
ADDRESS = {Rome, Italy},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DDM09.pdf},
ABSTRACT = {Realistic simulation of 802.11 traffic subject to high
interference, for example in dense urban areas, is still an open
issue. Many studies do not address the interference problem properly.
In this paper, we present our preliminary work on a method to
recreate interference traffic from real measurements. The method
consists in capturing real traffic traces and generating interference
patterns based on the recorded information. Furthermore, we assume
that the coordinates of the sources of interference in the real scene
are not known a priori. We introduce an extension to Omnet++
INET-Framework to replay the recreated interference in a transparent
way into a simulation. We validate our proposed method by comparing
it against the real measurements taken from the scene. Furthermore we
present an evaluation of how the injected interference affects the
simulated results on three arbitrary simulated scenarios.}
}
@INPROCEEDINGS{AA+09,
AUTHOR = {Maureira Bravo, J-C. and P. Uribe and O. Dalle and
T. Asahi and J. Amaya},
BOOKTITLE = {Proceedings of 9th International Conference on ITS Telecommunication},
TITLE = {Component based approach using OMNeT++ for Train
Communication Modeling},
YEAR = {2009},
ADDRESS = {Lille, France},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AADMU09.pdf},
ABSTRACT = {This paper reports on our experience in using OMNeT++ to
develop a network simulator focused on railway environments. Common
design problems are analyzed, making emphasis on radio communication
models. Scalability issues are raised when modeling the large
topologies that are associated with railway communications. Our
conclusions point out that model reusability must be reinforced and
that a component-based design must be adopted in order to build a
tool for generating valuable performance results.}
}
@INPROCEEDINGS{MSZ09a,
AUTHOR = {G. Mertzios and I. Sau and S. Zaks},
BOOKTITLE = {35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009)},
TITLE = {A New Intersection Model and Improved Algorithms for
Tolerance Graphs},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {06},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {285-295},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5911},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MSZ09.pdf},
ABSTRACT = {Tolerance graphs model interval relations in such a way
that intervals can tolerate a certain degree of overlap without being
in con ict. This class of graphs, which generalizes in a natural way
both interval and permutation graphs, has attracted many research
efforts since their introduction in [10], as it finds many important
applications in constraint-based temporal reasoning, resource
allocation and scheduling problems, among others. In this article we
propose the first non-trivial intersection model for general
tolerance graphs, given by three-dimensional parallelepipeds, which
extends the widely known intersection model of parallelograms in the
plane that characterizes the class of bounded tolerance graphs. Apart
from being important on its own, this new representation also enables
us to improve the time complexity of three problems on tolerance
graphs. Namely, we present optimal ${\cal O}(n \log n)$ algorithms
for computing a minimum coloring and a maximum clique, and an ${\cal
O}(n2)$ algorithm for computing a maximum weight independent set in a
tolerance graph with n vertices, thus improving the best known
running times ${\cal O}(n2)$ and ${\cal O}(n3)$ for these problems,
respectively.}
}
@INPROCEEDINGS{MoVo09,
AUTHOR = {C. Molle and M-E. Voge},
BOOKTITLE = {69th IEEE Vehicular Technology Conference (VTC2009-Spring)},
TITLE = {Effects of the Acknowledgment Traffic on the Capacity of
Wireless Mesh Networks},
YEAR = {2009},
ADDRESS = {Barcelona, Spain},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {5p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MoVo09.pdf},
ABSTRACT = {Since the emergence of ubiquitous computing, evaluating
wireless network performances has become one of the major economic
issues. Among the existing performance indicators, the network {\em
capacity}, defined as the maximal amount of flow carried by a
topology during a fixed time period, is essential. Some cross-layer
characteristics have to be taken into account in order to optimally
allocate the common resources. In this article, a comparative study
is done between interference consequences in the two following
models: (i) usual IEEE 802.11 MAC layer with acknowledgments at each
hop, and (ii) block acknowledgments reported at the transport layer
that can be included in the IEEE 802.16 standard. Cross-layer
properties are modeled in a linear programming formulation that is
solved using the column generation process. We quantify the gain in
capacity induced by the move of the MAC acknowledgments into the
transport layer, and show the better load distribution obtained in
the network with the second model.}
}
@INPROCEEDINGS{MoRe09,
AUTHOR = {M. Molloy and B. A. Reed},
BOOKTITLE = {Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)},
TITLE = {Asymptotically optimal frugal colouring},
YEAR = {2009},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {106-114},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://portal.acm.org/citation.cfm?id=1496782},
PDF = {http://www.siam.org/proceedings/soda/2009/SODA09_012_molloym.pdf},
ABSTRACT = {We prove that every graph with maximum degree \Delta can
be properly (\Delta + 1)-coloured so that no colour appears more than
O(log \Delta / log log \Delta) times in the neighbourhood of any
vertex. This is best possible up to the constant factor in the O(âˆ’)
term. We also provide an efficient algorithm to produce such a
colouring.}
}
@INPROCEEDINGS{NRS09,
AUTHOR = {N. Nisse and I. Rapaport and K. Suchan},
BOOKTITLE = {Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
TITLE = {Distributed computing of efficient routing schemes in
generalized chordal graphs},
YEAR = {2009},
ADDRESS = {Piran, Slovenia},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {252-265},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5869},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/distribRouting.pdf},
ABSTRACT = {Efficient algorithms for computing routing tables should
take advantage of the particular properties arising in large scale
networks. There are in fact at least two properties that any routing
scheme must consider: low (logarithmic) diameter and high clustering
coefficient. High clustering coefficient implies the existence of few
large induced cycles. Therefore, we propose a routing scheme that
computes short routes in the class of k-chordal graphs, i.e., graphs
with no chordless cycles of length more than k. We study the tradeoff
between the length of routes and the time complexity for computing
them. In the class of k-chordal graphs, our routing scheme achieves
an additive stretch of at most k Ã¢ÂˆÂ’ 1, i.e., for all pairs of
nodes, the length of the route never exceeds their distance plus k
Ã¢ÂˆÂ’ 1. In order to compute the routing tables of any n-node graph
with diameter D we propose a distributed algorithm which uses O(log
n)-bit messages and takes O(D) time. We then propose a slightly
modified version of the algorithm for computing routing tables in
time O(min{Ã¢ÂˆÂ†D, n}), where Ã¢ÂˆÂ† is the the maximum degree of
the graph. Using these tables, our routing scheme achieves a better
additive stretch of 1 in chordal graphs (notice that chordal graphs
are 3-chordal graphs). The routing scheme uses addresses of size log
n bits and local memory of size 2(d Ã¢ÂˆÂ’ 1) log n bits in a node of
degree d.}
}
@INPROCEEDINGS{RiDa09,
AUTHOR = {J. Ribault and O. Dalle},
BOOKTITLE = {Proceedings of the Winter Simulation Conference (WSC'09)},
TITLE = {OSA : A Federative Simulation Platform},
YEAR = {2009},
ADDRESS = {Austin, TX, USA},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {Ph.D. Colloquium},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00449642/en/},
ABSTRACT = {{OSA} ({O}pen {S}imulation {A}rchitecture) is a
collaborative platform for component-based discrete-event simulation.
{I}t has been created to support both {M}\&{S} studies and research
on {M}\&{S} techniques and methodology. {T}he {OSA} project started
from the observation that despite no single simulation software seems
to be perfect, most of the elements required to make a perfect
simulator already exist as part of existing simulators. {H}ence, the
particular area of research that motivated the {OSA} project is to
investigate practical means of reusing and combining any valuable
piece of {M}\&{S} software at large, including models, simulation
engines and algorithms, and supporting tools for the {M}\&{S}
methodology. {T}o achieve this goal, the {OSA} project investigates
in advanced software engineering techniques such as component-based
framework, layered patterns and aspect-oriented programming. {I}n
cases studies, the {OSA} project is among others involved in a
large-scale simulation, and a distributed simulation over the
{REST}ful protocol.}
}
@INPROCEEDINGS{SaTh09b,
AUTHOR = {I. Sau and D. M. Thilikos},
BOOKTITLE = {8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW)},
TITLE = {On Self-Duality of Branchwidth in Graphs of Bounded
Genus},
YEAR = {2009},
ADDRESS = {Paris, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {19-22},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/SaTh09b.pdf},
ABSTRACT = {A graph parameter is self-dual in some class of graphs
embeddable in some surface if its value does not change in the dual
graph more than a constant factor. Self-duality has been examined for
several width-parameters, such as branchwidth in graphs in some
surface. In this direction, we prove that ${\mathbf bw}(G^*) \leq
6\times {\mathbf bw}(G) +2g-4$ for any graph $G$ embedded in a
surface of Euler genus $g$.}
}
@INPROCEEDINGS{SaTh09,
AUTHOR = {I. Sau and D. M. Thilikos},
BOOKTITLE = {DIMAP workshop on Algorithmic Graph Theory (AGT09)},
TITLE = {Subexponential Parameterized Algorithms for
Bounded-Degree Connected Subgraph Problems on Planar Graphs},
YEAR = {2009},
ADDRESS = {Warwick, UK},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {59-66},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {32},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/SaTh09.pdf},
ABSTRACT = {We present subexponential parameterized algorithms on
planar graphs for a family of problems that consist in, given a graph
$G$, finding a connected subgraph $H$ with bounded maximum degree,
while maximising the number of edges (or vertices) of $H$. These
problems are natural generalisations of the \textsc{Longest Path}
problem. Our approach uses bidimensionality theory to obtain
combinatorial bounds, combined with dynamic programming techniques
over a branch decomposition of the input graph. These techniques need
to be able to keep track of the connected components of the partial
solutions over the branch decomposition, and can be seen as an
\emph{algorithmic tensor} that can be applied to a wide family of
problems that deal with finding connected subgraphs under certain
constraints.}
}
@INPROCEEDINGS{SRD09b,
AUTHOR = {A. Silva and P. Reyes and M. Debbah},
BOOKTITLE = {International Conference on Ultra Modern Telecommunications},
TITLE = {Congestion in Randomly Deployed Wireless Ad-Hoc and
Sensor Networks},
YEAR = {2009},
ADDRESS = {St. Petersburg, Russia},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {10p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEYWORDS = {Random Matrix Theory, Random Graph Theory,
Wireless Ad-Hoc Networks, Wireless Sensor Networks},
URL = {http://hal.inria.fr/inria-00417774/en},
PDF = {http://hal.inria.fr/docs/00/36/43/70/PDF/RR-6854.pdf},
ABSTRACT = {Congestion in wireless ad-hoc sensor networks not only
causes packet loss and increases queueing delay, but also leads to
unnecessary energy consumption. In these networks, two types of
congestion can occur: node-level congestion, which is caused by
buffer overflow in the node, or link-level congestion, when wireless
channels are shared by several nodes arising in collisions. We study
a measure of link-level congestion in static wireless ad-hoc and
sensor networks randomly deployed over an area. The measure of
congestion considered is the inverse of the greatest eigenvalue of
the adjacency matrix of the random graph. This measure gives an
approximation of the average quantity of wireless links of a certain
length on the network. We review the results to find this measure in
Bernoulli random graphs. We use tools from random graph and random
matrix theory to extend this measure on Geometric random graphs.}
}
@INPROCEEDINGS{SoMo09,
AUTHOR = {Solano Donado, F. and J. Moulierac},
BOOKTITLE = {13th Conference on Optical Network Design and Modeling (ONDM)},
TITLE = {Routing in All-Optical Label Switched-based Networks
with Small Label Spaces},
YEAR = {2009},
ADDRESS = {Braunschweig, Germany},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
PUBLISHER = {IFIP/IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/solano09routing.pdf},
ABSTRACT = {With the development of All-Optical Label Switching
(AOLS) network, nodes are capable of forwarding labeled packets
without performing Optical-Electrical-Optical (OEO) conversions,
speeding up the forwarding. However, this new technology also brings
new constraints and, consequently, new problems have to be adressed.
We study in this paper the problem of routing a set of demands in
such a network, considering that routers have limited label space,
preventing from the usage of label swapping techniques. Label
stripping is a solution that ensures forwarding, concerning these
constraints, of all the paths at expenses of increasing the stack
size and wasting bandwith. We propose an intermediate feasible
solution that keeps the GMPLS stack size smaller than label
stripping, in order to gain bandwidth resources. After proposing an
heuristic for this problem, we present simulations that show the
performance of our solution.}
}
@INPROCEEDINGS{AAST08,
AUTHOR = {L. Addario-Berry and O. Amini and J.-S. Sereni and
S. Thomassé},
BOOKTITLE = {Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 2008)},
TITLE = {Guarding art galleries: the extra cost for sculptures is
linear},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {41-52},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5124}
}
@INPROCEEDINGS{APC+08,
AUTHOR = {A. Aguiar and P.R. Pinheiro and A.L.V Coelho and
N. Nepomuceno and A. Neto and R. Cunha},
BOOKTITLE = {Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO'08)},
TITLE = {Scalability Analysis of a Novel Integer Programming
Model to Deal with Energy Consumption in Heterogeneous Wireless
Sensor Networks},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {11-20},
PUBLISHER = {Springer},
SERIES = {Communications in Computer and Information Science},
VOLUME = {14},
URL = {http://dx.doi.org/10.1007/978-3-540-87477-5_2},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/APCNNC08.pdf},
ABSTRACT = {This paper presents a scalability analysis over a novel
integer programming model devoted to optimize power consumption
efficiency in heterogeneous wireless sensor networks. This model is
based upon a schedule of sensor allocation plans in multiple time
intervals subject to coverage and connectivity constraints. By
turning off a specific set of redundant sensors in each time
interval, it is possible to reduce the total energy consumption in
the network and, at the same time, avoid partitioning the whole
network by losing some strategic sensors too prematurely. Since the
network is heterogeneous, sensors can sense different phenomena from
different demand points, with different sample rates. As the problem
instances grows the time spent to the execution turns impracticable.}
}
@INPROCEEDINGS{AGH08,
AUTHOR = {O. Amini and S. Griffiths and F. Huc},
BOOKTITLE = {Electronic Notes in Discrete MathematicsVolume 30, The IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07)},
TITLE = {4-cycles in mixing digraphs},
YEAR = {2008},
ADDRESS = {Puerto Varas, Chile},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {63--68},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {30},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGH07.pdf},
ABSTRACT = {It is known that every simple graph with $n^{3/2}$ edges
contains a 4-cycle. A similar statement for digraphs is not possible
since no condition on the number of edges can guarantee an (oriented)
4-cycle. We find a condition which does guarantee the presence of a
4-cycle and our result is tight. Our condition, which we call
$f$-mixing, can be seen as a quasirandomness condition on the
orientation of the graph. We also investigate the notion of mixing in
the case of regular and almost regular digraphs. In particular we
determine how mixing a random orientation of a random graph is.}
}
@INPROCEEDINGS{APP+08a,
AUTHOR = {O. Amini and D. Peleg and S. Pérennes and I. Sau and
S. Saurabh},
BOOKTITLE = {6th International Workshop on Approximation and Online Algorithms (ALGO-WAOA 2008)},
TITLE = {Degree-Constrained Subgraph Problems : Hardness and
Approximation Results},
YEAR = {2008},
ADDRESS = {Karlsruhe, Germany},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {29-42},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5426},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/APP+08.pdf},
ABSTRACT = {A general instance of a \sc Degree-Constrained Subgraph
problem consists of an edge-weighted or vertex-weighted graph $G$ and
the objective is to find an optimal weighted subgraph, subject to
certain degree constraints on the vertices of the subgraph. This
class of combinatorial problems has been extensively studied due to
its numerous applications in network design. If the input graph is
bipartite, these problems are equivalent to classical transportation
and assignment problems in operations research. This paper considers
three natural \sc Degree-Constrained Subgraph problems and studies
their behavior in terms of approximation algorithms. These problems
take as input an undirected graph $G=(V,E)$, with $|V|=n$ and
$|E|=m$. Our results, together with the definition of the three
problems, are listed below. The Maximum Degree-Bounded Connected
Subgraph (MDBCS$_d$) problem takes as input a weight function $\omega
: E \rightarrow \mathbb R^+$ and an integer $d \geq 2$, and asks for
a subset $E' \subseteq E$ such that the subgraph $G'=(V,E')$ is
connected, has maximum degree at most $d$, and $\sum_e\in E'
\omega(e)$ is maximized. This problem is one of the classical NP-hard
problems listed by Garey and Johnson in (Computers and
Intractability, W.H. Freeman, 1979), but there were no results in the
literature except for $d=2$. We prove that MDBCS$_d$ is not in Apx
for any $d\geq 2$ (this was known only for $d=2$) and we provide a
$(\min m/ \log n,\ nd/(2 \log n))$-approximation algorithm for
unweighted graphs, and a $(\min n/2,\ m/d)$-approximation algorithm
for weighted graphs. We also prove that when $G$ accepts a low-degree
spanning tree, in terms of $d$, then MDBCS$_d$ can be approximated
within a small constant factor in unweighted graphs. The \sc Minimum
Subgraph of Minimum Degree$_\geq d$ (MSMD$_d$) problem consists in
finding a smallest subgraph of $G$ (in terms of number of vertices)
with minimum degree at least $d$. We prove that MSMD$_d$ is not in
Apx for any $d\geq 3$ and we provide an $\mathcal O(n/\log
n)$-approximation algorithm for the classes of graphs excluding a
fixed graph as a minor, using dynamic programming techniques and a
known structural result on graph minors. In particular, this
approximation algorithm applies to planar graphs and graphs of
bounded genus. The \sc Dual Degree-Dense $k$-Subgraph (DDD$k$S)
problem consists in finding a subgraph $H$ of $G$ such that $|V(H)|
\leq k$ and $\delta_H$ is maximized, where $\delta_H$ is the minimum
degree in $H$. We present a deterministic $\mathcal
O(n^\delta)$-approximation algorithm in general graphs, for some
universal constant $\delta < 1/3$.}
}
@INPROCEEDINGS{ASS08,
AUTHOR = {O. Amini and I. Sau and S. Saurabh},
BOOKTITLE = {The International Workshop on Parameterized and Exact Computation (IWPEC 2008)},
TITLE = {Parameterized Complexity of the Smallest
Degree-Constrained Subgraph Problem},
YEAR = {2008},
ADDRESS = {Victoria, Canada},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {13-29},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5008},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ASS08.pdf},
ABSTRACT = {{In this paper we study the problem of finding an
induced subgraph of size at most $k$ with minimum degree at least $d$
for a given graph $G$, from the parameterized complexity perspective.
We call this problem {\sc Minimum Subgraph of Minimum Degree $_{\geq
d}$ ({\sc MSMD}$_d$)}. For $d=2$ it corresponds to finding a shortest
cycle of the graph. Our main motivation to study this problem is its
strong relation to \textsc{Dense $k$-Subgraph} and \textsc{Traffic
Grooming} problems. First, we show that {\sc MSMS}$_d$ is
fixed-parameter intractable (provided $FPT\neq W[1]$) for $d\geq 3$
in general graphs, by showing it to be $W[1]$-hard using a reduction
from {\sc Multi-Color Clique}. In the second part of the paper we
provide {\em explicit} fixed-parameter tractable (FPT) algorithms for
the problem in graphs with bounded local tree-width and graphs with
excluded minors, {\em faster} than those coming from the meta-theorem
of Frick and Grohe [FrickG01] about problems definable in first order
logic over ``locally tree-decomposable structures". In particular,
this implies faster fixed-parameter tractable algorithms in planar
graphs, graphs of bounded genus, and graphs with bounded maximum
degree.}, OPTx-editorial-board={yes}, OPTx-proceedings={yes},
OPTx-international-audience={yes}, sorte = "conf-int", }
}
@INPROCEEDINGS{AHL08a,
AUTHOR = {M. Asté and F. Havet and C. Linhares-Sales},
BOOKTITLE = {Proceedings of International Conference on Relations, Orders and Graphs and their Interaction with Computer Science (ROGICS 2008)},
TITLE = {Grundy number and lexicographic product of graphs},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {9p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.rogics.com/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AHL08.pdf},
ABSTRACT = {The {\em Grundy number} of a graph $G$, denoted by
$\Gamma (G)$, is the largest $k$ such that $G$ has a {\em greedy}
$k$-colouring, that is a colouring with $k$ colours obtained by
applying the greedy algorithm according to some ordering of the
vertices of $G$. In this paper, we study the Grundy number of the
lexicographic product of two graphs in terms of the Grundy numbers of
these graphs. We show that $\Gamma(G)\times\Gamma(H)\leq
\Gamma(G[H])\leq 2^{\Gamma(G)-1}(\Gamma(H)-1)+\Gamma(G)-1$. In
addition, we show that if $G$ is a tree or $\Gamma(G)=\Delta(G)+1$,
then $\Gamma(G[H])=\Gamma(G)\times\Gamma(H)$. We then deduce that for
every fixed $c\leq 1$, given a graph $G$, it is CoNP-Complete to
decide if $\Gamma(G)\leq c\times \chi(G)$ and it is CoNP-Complete to
decide if $\Gamma(G)\leq c\times \omega(G)$.}
}
@INPROCEEDINGS{BGR08,
AUTHOR = {J-C. Bermond and L. Gargano and A.A. Rescigno},
BOOKTITLE = {SIROCCO 2008},
TITLE = {Gathering with minimum delay in tree sensor networks},
YEAR = {2008},
ADDRESS = {Villars-sur-Ollon, Switzerland},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {262-276},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5058},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGR08.pdf},
ABSTRACT = {Data gathering is a fundamental operation in wireless
sensor networks in which data packets generated at sensor nodes are
to be collected at a base station. In this paper we suppose that each
sensor is equipped with an half--duplex interface; hence, a node
cannot receive and transmit at the same time. Moreover, each node is
equipped with omnidirectional antennas allowing the transmission over
distance R. The network is a multi-hop wireless network and the time
is slotted so that one--hop transmission of one data item consumes
one time slot. We model the network with a graph where the vertices
represent the nodes and two nodes are connected if they are in the
transmission/interference range of each other. Due to interferences a
collision happens at a node if two or more of its neighbors try to
transmit at the same time. Furthermore we suppose that an
intermediate node should forward a message as soon as it receives it.
We give an optimal collision free gathering schedule for tree
networks whenever each node has at least one data packet to send.}
}
@INPROCEEDINGS{BeYu08,
AUTHOR = {J-C. Bermond and M-L. Yu},
BOOKTITLE = {Proceedings of the 7th international conference on Ad Hoc Networks and Wireless (AdHoc-Now)},
TITLE = {Optimal gathering algorithms in multi-hop radio tree
networks with interferences},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {204-217},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5198},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BeYu08.pdf},
ABSTRACT = {We study the problem of gathering information from the
nodes of a multi-hop radio network into a pre-defined destination
node under the interference constraints. In such a network, a message
can only be properly received if there is no interference from
another message being simultaneously transmitted. The network is
modeled as a graph, where the vertices represent the nodes and the
edges, the possible communications. The interference constraint is
modeled by a fixed integer $d_I \geq 1$, which implies that nodes
within distance $d_I$ in the graph from one sender cannot receive
messages from another node. In this paper, we suppose that it takes
one unit of time (slot) to transmit a unit-length message. A step (or
round) consists of a set of non interfering (compatible) calls and
uses one slot. We present optimal algorithms that give minimum number
of steps (delay) for the gathering problem with buffering
possibility, when the network is a tree, the root is the destination
and $d_I =1$. In fact we study the equivalent personalized
broadcasting problem instead.}
}
@INPROCEEDINGS{CHM08c,
AUTHOR = {D. Coudert and F. Huc and D. Mazauric},
BOOKTITLE = {22nd International Symposium on Distributed Computing (DISC)},
TITLE = {A distributed algorithm for computing and updating the
process number of a forest (brief announcement)},
YEAR = {2008},
ADDRESS = {Arcachon, France},
EDITOR = {G. Taubenfeld},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {500-501},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5218},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHM-DISC08.pdf},
ABSTRACT = {In this paper, we present a distributed algorithm to
compute various parameters of a tree such as the process number, the
edge search number or the node search number and so the pathwidth.
This algorithm requires n steps, an overall computation time of O(n
log(n)), and n messages of size log_3(n)+3. We then propose a
distributed algorithm to update the process number (or the node
search number, or the edge search number) of each component of a
forest after adding or deleting an edge. This second algorithm
requires O(D) steps, an overall computation time of O(D log(n)), and
O(D) messages of size log_3(n)+3, where D is the diameter of the
modified connected component. Finally, we show how to extend our
algorithms to trees and forests of unknown size using messages of
less than 2a+4+e bits, where a is the parameter to be determined and
e=1 for updates algorithms.}
}
@INPROCEEDINGS{CHM08a,
AUTHOR = {D. Coudert and F. Huc and D. Mazauric},
BOOKTITLE = {10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08)},
TITLE = {Algorithme générique pour les jeux de capture dans les
arbres},
YEAR = {2008},
ADDRESS = {Saint-Malo},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {37--40},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHM-AlgoTel08.pdf},
ABSTRACT = {Nous pr\'esentons un algorithme distribu\'e simple
calculant le process number des arbres en O(n.log(n)) \'etapes. De
plus cet algorithme est facilement adaptable pour calculer d'autre
param\`etres sur l'arbre, dont la pathwidth. Nous pr\'esentons
\'egalement une condition n\'ecessaire et suffisante pour que la
pathwidth d'un arbre soit \'egale \`a son process number.}
}
@INPROCEEDINGS{CHM08d,
AUTHOR = {D. Coudert and F. Huc and D. Mazauric},
BOOKTITLE = {12th International Conference On Principles Of DIstributed Systems (OPODIS)},
TITLE = {Computing and updating the process number in trees
(short paper)},
YEAR = {2008},
ADDRESS = {Luxor, Egypt},
EDITOR = {T. Baker and S. Tixeuil},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {546-550},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5401},
URL = {https://hal.inria.fr/inria-00288304},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHM08d.pdf},
ABSTRACT = {The process number is the number of requests that have
to be simultaneously disturbed during a routing reconfiguration phase
of a connection oriented network. From a graph theory point of view,
it is similar to the node search number, and thus to the pathwidth.
However they are not always equal in general graphs. Determining
these parameters is in general NP-complete. In this paper, we
characterize the cases in which the process number and the node
search number are equal in trees. We also present a distributed
algorithm to compute these parameters as well as the edge search
number. This algorithm can be executed in an asynchronous
environment, requires $n$ steps, an overall computation time of
$O(n\log{n})$, and $n$ messages of size $\log_3{n}+2$. We then
propose a distributed algorithm to update the process number (or the
node search number, or the edge search number) of each component of a
forest after addition or deletion of any edge. This second algorithm
requires $O(D)$ steps, an overall computation time of $O(D\log{n})$,
and $O(D)$ messages of size $\log_3{n}+3$, where $D$ is the diameter
of the modified connected component. Finally, we show how to extend
our algorithms to trees and forests of unknown size using messages of
less than $2\alpha+5$ bits, where $\alpha\leq\log_3{n}$ is the
parameter to be determined.}
}
@INPROCEEDINGS{CHPV08,
AUTHOR = {D. Coudert and F. Huc and F. Peix and M.-E. Voge},
BOOKTITLE = {IEEE ICC},
TITLE = {Reliability of Connections in Multilayer Networks under
Shared Risk Groups and Costs Constraints},
YEAR = {2008},
ADDRESS = {Beijing, China},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
NUMBER = {ON01-6},
OPTORGANIZATION = {},
PAGES = {5170 - 5174},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00175813/en/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CHPV07-inria-00175813.pdf},
ABSTRACT = {The notion of Shared Risk Resource Groups (SRRG) has
been introduced to capture survivability issues when a set of
resources may fail simultaneously. Applied to Wavelength Division
Multiplexing Network (WDM), it expresses that some links and nodes
may fail simultaneously. The reliability of a connection therefore
depends on the number of SRRGs through which it is routed.
Consequently, this number has to be minimized. This problem has been
proved NP-complete and hard to approximate in general, even when
routing a single request. Some heuristics using shortest paths have
already been designed, however the cost (the usual routing cost, not
in term of SRRG) was not part of the objective. In this paper we
study the problem of minimizing a linear combination of the average
number of SRRG per paths and the cost of the routing. The main result
of our work is a column generation formulation that allows to solve
efficiently the problem of maximizing the reliability of a set of
connection requests in MPLS/WDM mesh networks with SRRGs while
keeping the cost of the routing low. }
}
@INPROCEEDINGS{DZW08,
AUTHOR = {O. Dalle and B.P. Zeigler and G.A. Wainer},
BOOKTITLE = {Proceedings of the 2008 Winter Simulation Conference},
TITLE = {Extending DEVS to support multiple occurrence in
component-based simulation},
YEAR = {2008},
OPTADDRESS = {},
EDITOR = {S. J. Mason and R. R. Hill and L. Moench and O. Rose},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {10p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DZW08.pdf},
ABSTRACT = {This paper presents a new extension of the DEVS
formalism that allowsmultiple occurrences of a given instance of a
DEV Scomponent?. This paper is a follow-up to a previous short paper
in which the issue of supporting a new construction called ashared
component was raised, in the case of a DEVS model. In thispaper, we
first demonstrate, formally, that the multi-occurrence extended
definition,that includes the case of shared components, is valid
because anymodel that is built using this extended definition accepts
an equivalent modelbuilt using standard DEVS. Then we recall the
benefits of sharingcomponents for modeling, and further extend this
analysis to the simulation area, byinvestigating how shared
components can help to design bettersimulation engines. Finally, we
describe an existing implementation ofa simulation software that
fully supports this shared componentfeature, both at the modeling and
simulation levels. }
}
@INPROCEEDINGS{GCI+08,
AUTHOR = {F. Giroire and J. Chandrashekar and G. Iannaccone and
D. Papagiannaki and E. Schooler and N. Taft},
BOOKTITLE = {Proceeding of the Passive and Active Monitoring conference (PAM08)},
TITLE = {The Cubicle vs. The Coffee Shop: Behavioral Modes in
Enterprise End-Users},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {202-211},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4979},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GCI08.pdf},
ABSTRACT = {Traditionally, user traffic profiling is performed by
analyzing traffic traces collected on behalf of the user at
aggregation points located in the middle of the network. However, the
modern enterprise network has a highly mobile population that
frequently moves in and out of its physical perimeter. Thus an
in-the-network monitor is unlikely to capture full user activity
traces when users move outside the enterprise perimeter. The distinct
environments, such as the cubicle and the coffee shop (among others),
that users visit, may each pose different constraints and lead to
varied behavioral modes. It is thus important to ask: is the profile
of a user constructed in one environment representative of the same
user in another environment? In this paper, we answer in the negative
for the mobile population of an enterprise. Using real corporate
traces collected at nearly 400 end-hosts for approximately 5 weeks,
we study how end-host usage differs across three environments: inside
the enterprise, outside the enterprise but using a VPN, and entirely
outside the enterprise network. Within these environments, we examine
three types of features: (i) environment lifetimes, (ii) relative
usage statistics of network services, and (iii) outlier detection
thresholds as used for anomaly detection. We find significant
diversity in end-host behavior across environments for many features,
thus indicating that profiles computed for a user in one environment
yield inaccurate representations of the same user in a different
environment.}
}
@INPROCEEDINGS{GHR08,
AUTHOR = {C. Gomes and G. Huiban and H. Rivano},
BOOKTITLE = {International Symposium on Combinatorial Optimization (CO)},
TITLE = {A Branch-and-Price Approach to the Bandwidth Allocation
Problem in Wireless Networks},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {March},
NOTE = {Abstract},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
SCHOOL = {University of Warwick, Coventry, UK},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GHR08.pdf}
}
@INPROCEEDINGS{GMR08,
AUTHOR = {C. Gomes and C. Molle and P. Reyes},
BOOKTITLE = {9èmes Journées Doctorales en Informatique et Réseaux (JDIR 2008)},
TITLE = {Optimal Design of Wireless Mesh Networks},
YEAR = {2008},
ADDRESS = {Villeneuve d'Ascq, France},
OPTEDITOR = {},
MONTH = {January},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {10p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www2.lifl.fr/JDIR2008/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMR08.pdf},
ABSTRACT = {Wireless Mesh Networks (WMNs) are cost-effective and
provide an appealing answer to connectivity issues of ubiquitous
computing. Unfortunately, wireless networks are known for strong
waste of capacity when their size in- creases. Thus, a key challenge
for network operators is to provide guaranteed quality of service.
Maximizing network capacity requires to optimize jointly the gateways
placement, the routing and the link scheduling taking interferences
into account. We present MILP models for computing an optimal 802.11a
or 802.16 WMN design providing max-min bandwidth guarantee.}
}
@INPROCEEDINGS{GPRR08,
AUTHOR = {C. Gomes and S. Pérennes and P. Reyes and H. Rivano},
BOOKTITLE = {10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08)},
TITLE = {Bandwidth Allocation in Radio Grid Networks},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2008.irisa.fr/index.php},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GPRR08.pdf},
ABSTRACT = {In this paper we give exact or almost exact bounds for
the continuous gathering problem on grids. Under very general
hypothesis on the traffic demand, we mainly prove that the throughput
is determined by the bottleneck around the base station. We deal with
two cases: the base station located in the center and in the corner.
We use dual lower bounds and describe a protocol which is optimal
when the traffic is uniform.}
}
@INPROCEEDINGS{GPR08b,
AUTHOR = {C. Gomes and S. Pérennes and H. Rivano},
BOOKTITLE = {4th IEEE Workshop on Broadband Wireless Access (BWA)},
TITLE = {Bottleneck Analysis for Routing and Call Scheduling in
Multi-hop Wireless Networks},
YEAR = {2008},
ADDRESS = {New-Orleans, US},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GPR08b.pdf},
ABSTRACT = {In this paper, we address the routing and call
scheduling problem in which one has to find a minimum-length schedule
of selected links in a TDMA (Time Division Multiple Access) based
wireless network. As we deal with multi-hop networks, these selected
links represent a routing solution (paths) providing enough capacity
to achieve the routers requirements of bandwidth. We present a
cross-layer formulation of the problem that computes joint routing
and scheduling. We use a branch-and-price algorithm to solve
optimally the problem. A column generation algorithm is used to cope
with the exponential set of rounds. The branch-and-bound algorithm
provides mono-routing. We run experiments on networks from the
literature, with different number of gateways. Experimental results
as well as theoretical insights let us conjecture that the bottleneck
region analysis is enough to find the optimal solution. The Integer
Round-Up Property (IRUP) seems to hold for our problem.}
}
@INPROCEEDINGS{HRS08a,
AUTHOR = {F. Havet and B. Reed and J.-S. Sereni},
BOOKTITLE = {Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008)},
TITLE = {L(2,1)-labelling of graphs},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {January},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {621-630},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.siam.org/meetings/da08/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HRS08.pdf},
ABSTRACT = {An $L(2,1)$-labelling of a graph is a function $f$ from
the vertex set to the positive integers such that $|f(x)-f(y)|\geq 2$
if $\dist(x,y)=1$ and $|f(x)-f(y)|\geq 1$ if $\dist(x,y)=2$, where
$\dist(u,v)$ is the distance between the two vertices~$u$ and~$v$ in
the graph $G$. The \emph{span} of an $L(2,1)$-labelling $f$ is the
difference between the largest and the smallest labels used by $f$
plus $1$. In 1992, Griggs and Yeh conjectured that every graph with
maximum degree $\Delta\geq 2$ has an $L(2,1)$-labelling with span at
most $\D2+1$. We settle this conjecture for $\D$ sufficiently large.}
}
@INPROCEEDINGS{HDBG08,
AUTHOR = {L. Hogie and G. Danoy and P. Bouvry and F. Guinand},
BOOKTITLE = {Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO'08)},
TITLE = {A Context-Aware Broadcast Protocol for DTNs},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {507-519},
PUBLISHER = {Springer},
SERIES = {Communications in Computer and Information Science},
VOLUME = {14},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HDBG08.pdf},
ABSTRACT = {Delay Tolerant Networks (DTNs) are a sub-class of mobile
ad hoc networks (MANETs). They are mobile wireless networks that
feature inherent connection disruption. In particular such net- works
are generally non-connected. In this paper we focus on defining a
broadcast service which operate on DTNs. A number of protocols
solving the problem of broadcasting across DTNs have been proposed in
the past, but all of them exhibit a static behavior, i.e. they
provide no control parameter. However, at the application level,
flexible broadcasting schemes are desirable. In particular, it is
important that the user (the source of the broadcast message) can
control the way the message gets spread across the network. This
paper introduces a new broadcasting protocol dedicated to DTNs,
called Context-Aware Broadcasting Protocol (CABP), which adapts its
greediness according to the "urgency" (priority) of the broadcast
message. A formal presentation of its strategy is proposed and
through preliminary experi- ments, the cost-effectiveness of CABP is
enlightened.}
}
@INPROCEEDINGS{HKMN08,
AUTHOR = {C.-C. Huang and T. Kavitha and D. Michail and M. Nasre},
BOOKTITLE = {11th Scandinavian Workshop on Algorithm Theory (SWAT).},
TITLE = {Bounded Unpopularity Matchings},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {127-137},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5124},
ABSTRACT = {We investigate the following problem: given a set of
jobs and a set of people with preferences over the jobs, what is the
optimal way of matching people to jobs? Here we consider the notion
of popularity. A matching M is popular if there is no matching M'
such that more people prefer M' to M than the other way around.
Determining whether a given instance admits a popular matching and,
if so, finding one, was studied in Abraham et al. . If there is no
popular matching, a reasonable substitute is a matching whose
unpopularity is bounded. We consider two measures of unpopularity -
unpopularity factor denoted by u(M) and unpopularity margin denoted
by g(M). McCutchen recently showed that computing a matching M with
the minimum value of u(M) or g(M) is NP-hard, and that if G does not
admit a popular matching, then we have Your browser may not support
display of this image. for all matchings M in G. Here we show that a
matching M that achieves u(M) = 2 can be computed in Your browser may
not support display of this image.time (where m is the number of
edges in G and n is the number of nodes) provided a certain graph H
admits a matching that matches all people. We also describe a
sequence of graphs: H = H2, H3,...,Hk such that if Hk admits a
matching that matches all people, then we can compute in Your browser
may not support display of this image.time a matching M such that
Your browser may not support display of this image.and Your browser
may not support display of this image.. Simulation results suggest
that our algorithm finds a matching with low unpopularity. }
}
@INPROCEEDINGS{HLR08,
AUTHOR = {F. Huc and C. Linhares-Sales and H. Rivano},
BOOKTITLE = {IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07)},
TITLE = {The Proportional Colouring Problem: Optimizing Buffers
in Radio Mesh Networks},
YEAR = {2008},
ADDRESS = {Puerto Varas, Chile},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {141--146},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {30},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HLR07.pdf},
ABSTRACT = {In this paper, we consider a new edge colouring problem:
the proportional edge-colouring. Given a graph $G$ with positive
weights associated to its edges, we want to find a colouring which
preserves the proportion given by the weights associated to each
edge. If such colouring exists, we want to find one using a minimum
number of colours. We proved that deciding if a weighted graph admits
a proportional colouring is polynomial while determining its
proportional chromatic index is NP-hard. In addition, we give a lower
bound and an upper bound for this parameter that can be computed in
polynomial time. We finally show a class of graphs and a class of
weighted graphs for which we can exactly determine the proportional
chromatic index.}
}
@INPROCEEDINGS{INS08,
AUTHOR = {D. Ilcinkas and N. Nisse and D. Soguet},
BOOKTITLE = {10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08)},
TITLE = {Le cout de la monotonie dans les stratégies
d'encerclement réparti},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2008.irisa.fr/index.php},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel08.pdf},
ABSTRACT = {L'encerclement dans les r\'eseaux vise \`a r\'ealiser le
nettoyage, par une \'equipe d'agents mobiles, d'un r\'eseau
contamin\'e. La strat\'egie d'encerclement est calcul\'ee en temps
r\'eel, par les agents eux mÃªmes, et doit v\'erifier les trois
propri\'et\'es suivantes: (1)~{\it connexit\'e} : la zone nettoy\'ee
doit toujours Ãªtre connexe de fa\c{c}on \`a assurer des
communications s\'ecuris\'ees entre les agents, (2)~{\it monotonie} :
la zone nettoy\'ee ne doit jamais Ãªtre recontamin\'ee, ce qui permet
un temps de nettoyage polynomial en la taille du r\'eseau, et
(3)~{\it optimalit\'e} : le nombre d'agents utilis\'es doit Ãªtre le
plus petit possible afin de minimiser la taille des ressources
utilis\'ees. Etant donn\'e un graphe $G$, le plus petit nombre
d'agents n\'ecessaire pour nettoyer $G$ de faÃ§on monotone connexe
dans un contexte centralis\'e est not\'e $\mcs(G)$. Plusieurs
protocoles r\'epartis ont \'et\'e propos\'e pour r\'esoudre le
probl\`eme de l'encerclement dans les r\'eseaux. Blin {\it et al.}
ont propos\'e un algorithme distribu\'e permettant \`a $\mcs(G)$
agents de d\'eterminer et de r\'ealiser une strat\'egie
d'encerclement dans tout graphe inconnu $G$ (inconnu signifie que les
agents n'ont aucune connaissance {\it a priori} concernant le graphe)
[AlgoTel'06]. Cependant, la strat\'egie r\'ealis\'ee n'est pas
monotone et peut prendre un temps exponentiel. Nisse et Soguet ont
prouv\'e que, pour r\'esoudre le probl\`eme de l'encerclement dans
les r\'eseaux, il est n\'ecessaire et suffisant de fournir $\Theta(n
\log n)$ bits d'information aux agents par le biais d'un \'etiquetage
des sommets du graphe [AlgoTel'07]. Ainsi, pour nettoyer un graphe
inconnu de fa\c{c}on monotone et connexe, il est necessaire
d'utiliser plus d'agents que l'optimal. Dans cet article, nous
\'etudions la proportion d'agents suppl\'ementaires qui sont
n\'ecessaires et suffisants pour nettoyer de faÃ§on monotone connexe
r\'eparti tout graphe inconnu. Nous montrons que la contrainte de
monotonie implique une augmentation drastique de ce nombre d'agents.
Nous prouvons que tout protocole distribu\'e ayant pour but de
nettoyer tout graphe inconnu de $n$ sommets de faÃ§on monotone
connexe r\'eparti a un ratio comp\'etitif de $\Theta(\frac{n}{\log
n})$. Plus pr\'ecis\'ement, nous prouvons que pour tout protocole
distribu\'e $\cal P$, il existe une constante $c$ tel que pour tout
$n$ suffisamment grand, il existe un graphe $G$ de $n$ sommets tel
que $\cal P$ requiert au moins $c\frac{n}{\log n}\, \mcs(G)$ agents
pour nettoyer $G$. De plus, nous proposons un protocole distribu\'e
qui permet \`a $O(\frac{n}{\log n})\, \mcs(G)$ agents de nettoyer
tout graphe inconnu $G$ de $n$ sommets, de faÃ§on monotone connexe
r\'eparti.}
}
@INPROCEEDINGS{KaRe08b,
AUTHOR = {K. Kawarabayashi and B. Reed},
BOOKTITLE = {Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008)},
TITLE = {A nearly linear time algorithm for the half integral
disjoint paths packing},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {446-454},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/KaRe08b.pdf},
ABSTRACT = {We consider the following problem, which is called the
half integral k disjoint paths packing. Input: A graph G, k pair of
vertices (s1, t1), (s2, t2),\cdots, (sk, tk) in G (which are
sometimes called terminals). Output: Paths P1, \cdots, Pk in G such
that Pi joins si and ti for i = 1,2,\cdots, k, and in addition, each
vertex is on at most two of these paths. We present an O(n log n)
time algorithm for this problem for fixed k. This improves a result
by Kleinberg who gave an O(n3) algorithm for this problem. In fact,
we also have algorithms running in O(n(1+\varepsilon)) time for any
\varepsilon > 0 for these problems, if k is up to o((log log n)2/5)
for general graphs, up to o((log n/(log log n))1/4) for planar
graphs, and up to o((log n/g/(log log n/g))1/4) for graphs on the
surface, where g is the Euler genus. Furthermore, if k is fixed, then
we have linear time algorithms for the planar case and for the
bounded genus case. We also obtain O(n log n) algorithms for several
optimization problems related to the bounded unsplittable flow
problem when the number of terminal pairs is bounded. These results
can all carry over to problems involving edge capacities.}
}
@INPROCEEDINGS{LiRe08,
AUTHOR = {Z. Li and B. Reed},
BOOKTITLE = {Proceedings of LATIN},
TITLE = {Optimization and Recognition for ${K}_5$-minor Free
Graphs in Linear Time},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {206-215},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MPPR08a,
AUTHOR = {C. Molle and F. Peix and S. Pérennes and H. Rivano},
BOOKTITLE = {10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08)},
TITLE = {Formulation en Coupe/Rounds pour le Routage dans les
réseaux radio maillés},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2008.irisa.fr/index.php},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPPR08.pdf},
ABSTRACT = {Un des probl\`emes au c\oe ur de l'optimisation des
r\'eseaux radio maill\'es est le routage et l'ordonnancement
d'appels. Dans cet article, nous \'etudions une relaxation classique
de ce probl\`eme qui consiste \`a r\'epartir la capacit\'e entre les
ensembles d'appels simultan\'es de mani\`ere \`a garantir un d\'ebit
suffisant \`a chaque routeur du r\'eseau. Nous introduisons une
nouvelle formulation s'affranchissant du routage pour se concentrer
sur la capacit\'e de transport disponible sur les coupes du r\'eseau.
Nous prouvons son \'equivalence avec les formulations existantes et
pr\'esentons un processus efficace de r\'esolution par g\'en\'eration
crois\'ee de lignes et de colonnes.}
}
@INPROCEEDINGS{MPPR08b,
AUTHOR = {C. Molle and F. Peix and S. Pérennes and H. Rivano},
BOOKTITLE = {the fourth Symposium on Trustworthy Global Computing (TGC 2008)},
TITLE = {Optimal Routing and Call Scheduling in Wireless Mesh
Networks with Localized Information},
YEAR = {2008},
ADDRESS = {Barcelona, Spain},
EDITOR = {C. Kaklamanis and F. Nielson},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {171-185},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5474},
URL = {http://albcom.lsi.upc.edu/tgc2008/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPPR08b.pdf},
ABSTRACT = {Wireless mesh network performance issues have been
modeled by the Joint Routing and Scheduling Problem (JRSP) in which a
maximum per-flow throughput is computed. A classical relaxation of
JRSP, denoted as the Round Weighting Problem (RWP), consists in
assigning enough weight to sets of compatible simultaneous
transmissions (rounds), while minimizing the sum of them, thus
maximizing the relative weight of each round, which model the
throughput. In this work, we present a new linear formulation of RWP
focused on the transport capacity over the network cuts, thus
eliminating the routing. We prove its equivalence with existing
formulations with flows and formalize a primal-dual algorithm that
quickly solves this problem using a cross line and column generations
process. An asset of this formulation is to point out a bounded
region, a "bottleneck" of the network, that is enough to optimize in
order to get the optimal RWP of the whole network. The size and
location of this area is experimentally made through simulations,
highlighting a few hop distant neighborhood of the mesh gateways. One
would then apply approximated methods outside this zone to route the
traffic without degrading the achieved capacity.}
}
@INPROCEEDINGS{MPR08b,
AUTHOR = {C. Molle and F. Peix and H. Rivano},
BOOKTITLE = {Proc. 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'08)},
TITLE = {An optimization framework for the joint routing and
scheduling in wireless mesh networks},
YEAR = {2008},
ADDRESS = {Cannes, France},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.pimrc2008.org},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPR08b.pdf},
ABSTRACT = {In this paper, we address the problem of computing the
transport capacity of Wireless Mesh Networks dedicated to Internet
access. Routing and transmission scheduling have a major impact on
the capacity provided to the clients. A cross- layer optimization of
these problems allows the routing to take into account contentions
due to radio interferences. We develop exact linear programs and
provide an efficient column generation process computing a relaxation
of the problem. It allows to work around the combinatoric of
simultaneously achievable transmissions, hence computing solutions on
large networks. Our approach is validated through extensive
simulations. Evolution of the capacity of a mesh network with its
parameters, as well as the algorithmic complexity are then discussed.
We conjecture that the problem can be solved in polynomial time and
that the gateway placement problem is only subject to localized
constraints.}
}
@INPROCEEDINGS{MPR08a,
AUTHOR = {C. Molle and F. Peix and H. Rivano},
BOOKTITLE = {Colloque francophone sur l'ingénierie des protocoles (CFIP 2008)},
TITLE = {Génération de colonnes pour le routage et
l'ordonnancement dans les réseaux radio maillés},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {March},
NOTE = {Best student paper award},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {12p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://cfip2008.imag.fr/wp/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MPR08.pdf},
ABSTRACT = {Dans cet article, nous \'etudions la capacit\'e des
r\'eseaux radio maill\'es d\'edi\'es Ã l'acc\`es Ã Internet. Nous
nous pla\c ons dans l'hypoth\`ese d'un r\'eseau synchrone
fonctionnant en r\'egime permanent o\`u les transmissions partagent
un m\^eme canal radio. Le routage et l'ordonnancement des
transmissions ont un impact majeur sur la capacit\'e fournie aux
clients. Une optimisation jointe de ces deux probl\`emes permet de
prendre en compte dans le routage les contentions dues aux
interf\'erences radio. Nous en d\'eveloppons des formulations exactes
en programmation lin\'eaire. Nous pr\'esentons ensuite un processus
de g\'en\'eration de colonnes r\'esolvant une relaxation du
probl\`eme. Ainsi, nous contournons l'\'ecueil de la combinatoire des
transmissions r\'ealisables simultan\'ement pour permettre de
calculer des solutions sur des r\'eseaux de grande taille. Des
simulations sont effectu\'ees sur des topologies al\'eatoires.
L'\'evolution de la capacit\'e d'un r\'eseau maill\'e avec ses
param\`etres, ainsi que la complexit\'e algorithmique du probl\`eme
sont discut\'ees.}
}
@INPROCEEDINGS{MoVo08,
AUTHOR = {C. Molle and M.-E. Voge},
BOOKTITLE = {10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08)},
TITLE = {Influence des acquittements sur la capacité des réseaux
radio maillés},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2008.irisa.fr/index.php},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/MoVo08.pdf},
ABSTRACT = {A la veille du d\'eploiement de l'informatique
ubiquitaire, la performance des r\'eseaux radio est un enjeu
\'economique majeur. Parmi les indicateurs de performance, la {\it
capacit\'e}, ou volume maximal de trafic que peut \'ecouler le
r\'eseau en un temps fix\'e, est essentielle. Dans cet article nous
\'evaluons le gain en capacit\'e induit par la suppression des
acquittements au niveau MAC en r\'esolvant un mod\`ele lin\'eaire par
g\'en\'eration de colonnes.}
}
@INPROCEEDINGS{Mon08,
AUTHOR = {J. Monteiro},
BOOKTITLE = {Proceedings of the XV Concurso Latinoamericano de Tesis de Maestrìa (CLEI'08)},
TITLE = {The use of Evolving Graph Combinatorial Model in Routing
Protocols for Dynamic Networks},
YEAR = {2008},
ADDRESS = {Santa Fe, Argentina},
OPTEDITOR = {},
MONTH = {September},
NOTE = {Third prize in the CLEI'08 Master's Thesis Contests},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {41--57},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Mon08.pdf},
ABSTRACT = {The assessment of routing protocols for ad hoc networks
is a difficult task, due to the networksâ€™ highly dynamic behavior
and the absence of benchmarks. Recently, a graph theoretic model â€“
the evolving graphs â€“ was proposed to help capture the network
topology changes during time, with predictable dynamics at least. The
algorithms and insights obtained through this model are theoretically
very effcient and intriguing. However, there is no study about the
use of such theoretical results into practical situations. We used
the NS2 network simulator to first implement an evolving graph based
routing protocol, and then used it as a benchmark when comparing four
ma jor ad-hoc routing pro- tocols. Interestingly, our experiments
showed that evolving graphs have the potential to be an effective and
powerful tool. In order to make this model widely applicable,
however, some practical issues still have to be addressed and
incorporated into the model.}
}
@INPROCEEDINGS{MuSa08b,
AUTHOR = {X. Muñoz and I. Sau},
BOOKTITLE = {34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008)},
TITLE = {Traffic Grooming in Unidirectional WDM Rings with
Bounded-Degree Request Graph},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {300-311},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5344},
PDF = {http://www-sop.inria.fr/members/Ignasi.Sauvalls/Pubs/MuSa08.pdf},
ABSTRACT = {Traffic grooming is a major issue in optical networks.
It refers to grouping low rate signals into higher speed streams, in
order to reduce the equipment cost. In SONET WDM networks, this cost
is mostly given by the number of electronic terminations, namely
ADMs. We consider the case when the topology is a unidirectional
ring. In graph-theoretical terms, the traffic grooming problem in
this case consists in partitioning the edges of a request graph into
subgraphs with a maximum number of edges, while minimizing the total
number of vertices of the decomposition. We consider the case when
the request graph has bounded maximum degree $\Delta$, and our aim is
to design a network being able to support any request graph
satisfying the degree constraints. The existing theoretical models in
the literature are much more rigid, and do not allow such
adaptability. We formalize the problem, and solve the cases
$\Delta=2$ (for all values of $C$) and $\Delta = 3$ (except the case
$C=4$). We also provide lower and upper bounds for the general case.}
}
@INPROCEEDINGS{NiSu08a,
AUTHOR = {N. Nisse and K. Suchan},
BOOKTITLE = {Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
TITLE = {Fast Robber in Planar Graphs},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {33-44},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5344},
URL = {http://www.dur.ac.uk/wg.2008/},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/wg08.pdf},
ABSTRACT = {In the {\it cops and robber game}, two players play
alternately by moving their tokens along the edges of a graph. The
first one plays with the {\it cops} and the second one with one {\it
robber}. The cops aim at capturing the robber, while the robber tries
to infinitely evade the cops. The main problem consists in minimizing
the number of cops used to capture the robber in a graph. This
minimum number is called the {\it cop-number} of the graph. If the
cops and the robber have the same velocity, $3+\frac{3}{2}g$ cops are
sufficient to capture one robber in any graph with genus $g$
(Schr\"oder, 2001). In the particular case of a grid, $2$ cops are
sufficient. We investigate the game in which the robber is slightly
faster than the cops. In this setting, we prove that the cop-number
of planar graphs becomes unbounded. More precisely, we prove that
$\Omega(\sqrt{\log n})$ cops are necessary to capture a fast robber
in the $n \times n$ square-grid. This proof consists in designing an
elegant evasion-strategy for the robber. Then, it is interesting to
ask whether a high value of the cop-number of a planar graph $H$ is
related to a large grid $G$ somehow contained in $H$. We prove that
it is not the case when the notion of containment is related to the
classical transformations of edge removal, vertex removal, and edge
contraction. For instance, we prove that there are graphs with
cop-number at most $2$ and that are subdivisions of arbitrary large
grid. On the positive side, we prove that, if $H$ planar contains a
large grid as an induced subgraph, then $H$ has large cop-number.
Note that, generally, the cop-number of a graph $H$ is not closed by
taking induced subgraphs $G$, even if $H$ is planar and $G$ is an
distance-hereditary induced-subgraph.}
}
@INPROCEEDINGS{NiSu08b,
AUTHOR = {N. Nisse and K. Suchan},
BOOKTITLE = {10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08)},
TITLE = {Voleur véloce dans un réseau planaire},
YEAR = {2008},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2008.irisa.fr/index.php},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel08a.pdf},
ABSTRACT = {D\'efini par Nowakowski et Winkler et, ind\'ependament,
par Quilliot (1983), le jeu des gendarmes et du voleur impliquent
deux joueurs qui jouent \`a tour de r\^ole dans un graphe. Le premier
d\'eplace les gendarmes le long des ar\^etes du graphe, puis c'est au
tour du second qui d\'eplace le voleur. Le but des gendarmes est
d'attraper le voleur, tandis que ce dernier essaie d'\'eviter la
capture ind\'efiniment. Le probl\`eme dans ce contexte est de
minimiser le nombre de gendarmes n\'ecessaires pour capturer le
voleur. Ce nombre s'appelle {\it l'indice d'\'evasion} du graphe
({\it cop-number} en anglais). Si les gendarmes et le voleur ont la
m\^eme vitesse, Schr\"oder (2001) a prouv\'e que $3+\frac{3}{2}g$
gendarmes suffisent \`a capturer tout voleur dans un graphe de {\it
genre} born\'e $g$. En particulier, cela signifie que la capture d'un
voleur dans un graphe {\it planaire} est facile puisque $3$ gendarmes
suffisent (en fait deux gendarmes sont suffisants dans toute grille).
Dans ce travail, nous aidons le voleur en lui permettant de ce
d\'eplacer plus vite que les gendarmes. Nous montrons que cela
conduit \`a une augmentation drastique du nombre de gendarmes. Plus
pr\'ecisement, nous prouvons que $\Omega(\sqrt{\log n})$ gendarmes
sont n\'ecessaires pour capturer un voleur v\'eloce dans une grille
carr\'ee de c\^ot\'e $n$. La preuve que nous proposons consiste en
une \'el\'egante et simple strat\'egie d'\'evasion pour le voleur. Il
est alors int\'eressant de savoir si le fait qu'un graphe planaire
$H$ ait un indice d'\'evasion \'elev\'e est li\'e au fait que $H$
``contient'' une large grille $G$. Nous montrons que ce n'est pas la
cas lorsque la notion de contenance correspond \`a la notion de
minoration topologique (c'est \`a dire si $G$ peut \^etre obtenu de
$H$ en rempla\c{c}ant des chemins dont les sommets internes sont de
degr\'e deux, par des ar\^etes). Cependant, nous prouvons que si $H$
planaire contient une large grille comme sous-graphe induit, alors
son indice d'\'evasion est \'elev\'e. Notons que ce dernier
r\'esultat n'est pas vrai dans le cas d'un graphe $H$ non planaire.}
}
@INPROCEEDINGS{RiDa08,
AUTHOR = {J. Ribault and O. Dalle},
BOOKTITLE = {20th European Modeling and Simulation Symposium (EMSS 2008)},
TITLE = {Enabling advanced simulation scenarios with new software
engineering techniques},
YEAR = {2008},
ADDRESS = {Briatico, Italy},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/RiDa08.pdf},
ABSTRACT = {In this paper, we introduce new techniques in the field
of simulationto help in the process of building advanced simulation
scenarios usingpreexisting simulation components. The first technique
consists in using the Aspect Oriented Programming? paradigm to
capture some of the private data of anexisting model component. The
second one is an Architecture Description Language (ADL) designed for
the Fractal component model, that offers definition overloading and
extension mechanisms similar to those found in traditional Object
Oriented languages.The benefits of using both techniques are
illustrated by simple usecases of network security studies. }
}
@INPROCEEDINGS{APS07c,
AUTHOR = {O. Amini and S. Pérennes and I. Sau},
BOOKTITLE = {The 18th International Symposium on Algorithms and Computation (ISAAC 2007)},
TITLE = {Hardness and Approximation of Traffic Grooming},
YEAR = {2007},
ADDRESS = {Sendai, Japan},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {561-573},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4835},
URL = {http://www.nishizeki.ecei.tohoku.ac.jp/isaac07/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/APS07b.pdf},
ABSTRACT = {Traffic grooming is a central problem in optical
networks. It refers to pack low rate signals into higher speed
streams, in order to improve bandwidth utilization and reduce network
cost. In WDM networks, the most accepted criterion is to minimize the
number of electronic terminations, namely the number of SONET
Add-Drop Multiplexers (ADMs). In this article we focus on ring and
path topologies. On the one hand, we provide the first
inapproximability result for \textsc{Traffic Grooming} for fixed
values of the grooming factor $g$, answering affirmatively the
conjecture of Chow and Lin (\emph{Networks, 44:194-202, 2004}). More
precisely, we prove that \textsc{Ring Traffic Grooming} for fixed
$g\geq 1$ and \textsc{Path Traffic Grooming} for fixed $g\geq 2$ are
\textsc{APX}-complete. That is, they do not accept a PTAS unless
$\textsc{P}=\textsc{NP}$. Both results rely on the fact that finding
the maximum number of edge-disjoint triangles in a graph (and more
generally cycles of length $2g+1$ in a graph of girth $2g+1$) is
\textsc{APX}-complete. On the other hand, we provide a
polynomial-time approximation algorithm for \textsc{Ring} and
\textsc{Path Traffic Grooming}, based on a greedy cover algorithm,
with an approximation ratio independent of $g$. Namely, the
approximation guarantee is $\mathcal{O}(n^{1/3} \log2 n)$ for any $g
\geq 1$, $n$ being the size of the network. This is useful in
practical applications, since in backbone networks the grooming
factor is usually greater than the network size. As far as we know,
this is the first approximation algorithm with this property.
Finally, we improve this approximation ratio under some extra
assumptions about the request graph.}
}
@INPROCEEDINGS{APS07a,
AUTHOR = {O. Amini and S. Pérennes and I. Sau},
BOOKTITLE = {Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07)},
TITLE = {Hardness of Approximating the Traffic Grooming},
YEAR = {2007},
ADDRESS = {Ile d'Oléron, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {45-48},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2007.labri.fr/},
PDF = {http://hal.inria.fr/action/open_file.php?url=http://hal.inria.fr/docs/00/17/69/60/PDF/59-APS-Algotel.pdf&docid=176960},
ABSTRACT = {Le groupage est un problÃ¨me central dans l'Ã©tude des
rÃ©seaux optiques. Dans cet article, on propose le premier rÃ©sultat
d'inapproximabilitÃ© pour le problÃ¨me du groupage, en affirmant la
conjecture de Chow et Lin (2004, Networks, 44, 194-202), selon
laquelle le groupage est APX-complet. On Ã©tudie aussi une version
amortie du problÃ¨me de sous-graphe le plus dense dans un graphe
donnÃ©: trouver le sous-graphe de taille minimum ayant le degrÃ©
minimum au moins d, d>=3. On dÃ©montre que ce dernier n'a pas
d'approximation Ã un facteur constant.}
}
@INPROCEEDINGS{AmRe07,
AUTHOR = {O. Amini and B. Reed},
BOOKTITLE = {IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07)},
TITLE = {List Colouring Constants of Triangle Free Graphs},
YEAR = {2007},
ADDRESS = {Puerto Varas, Chile},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.dii.uchile.cl/~lagos07/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AmRe07.pdf},
ABSTRACT = {In this paper we prove a result about vertex list
colourings which in particular shows that a conjecture of the second
author (1999, Journal of Graph Theory 31, 149-153) is true for
triangle free graphs of large maximum degree. There exists a constant
K such that the following holds: Given a graph G and a list
assignment L to vertices of G, assigning a list of available colours
L(v) to each vertex $v\in V(G)$, such that $|L(v)| =
K\Delta/\log(\Delta)$ , then there exists a proper list colouring of
vertices of G provided that for each colour c, the graph induced by
all vertices v with c âˆˆ L(v) is triangle free and has maximum
degree at most \Delta.}
}
@INPROCEEDINGS{ArLi07,
AUTHOR = {J. Araujo and Linhares Sales, C.},
BOOKTITLE = {XXXIX Simpósio Brasileiro de Pesquisa Operacional},
TITLE = {Teorema de Hajós para Coloração Ponderada},
YEAR = {2007},
ADDRESS = {Fortaleza, Brazil},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {5p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AL07.pdf},
ABSTRACT = {The vertex coloring problem is one of the most
investigated problems in graph theory because of it models several
important practical problems and because of its inherent difficulty:
it is NP-hard to determine the chromatic number of a graph. The
Theorem of HajÂ´os [HajÂ´os, 1961] shows a necessary and sufficient
condition to a graph have chromatic number at least k: the graph must
contain a k-constructible subgraph. A graph is k-constructible if it
can be obtained from a complete graph by successively applying a set
of well-defined operations. In this article, we prove that the
weighted coloring problem [Guan and Zhu, 1997] admits a version of
the HajÂ´osâ€™ Theorem and so we show a necessary and sufficient
condition to a weighted graph G have weighted chromatic number at
least k, for any integer k. }
}
@INPROCEEDINGS{BMBM07,
AUTHOR = {Ben Ali, N. and J. Moulierac and B. Belghith and
M. Molnár},
BOOKTITLE = {IEEE Global Telecommunications Conference (IEEE GLOBECOM 2007)},
TITLE = {mQMA: multi-constrained QoS Multicast Aggregation},
YEAR = {2007},
ADDRESS = {Washington DC, USA},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {5p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/benali07mqma.pdf},
ABSTRACT = {Traditional IP Multicast has been proposed in order to
manage group communications over the Internet in a bandwidth
efficient manner. Although this proposition has been well studied,
there are still some problems for its deployment. In this paper, we
propose a new algorithm mQMA that deals with two important problems
of traditional IP multicast, i.e., multicast forwarding state
scalability and multi-constrained QoS routing. The algorithm mQMA
builds few trees and maintains few forwarding states for the groups
thanks to the technique of multicast tree aggregation, which allows
several groups to share the same delivery tree. Moreover, the
algorithm mQMA builds trees satisfying multiple QoS constraints. We
show, trough extensive simulations, that mQMA leverages the same QoS
performances as Mamcra which is the main multi-constrained multicast
routing algorithm. Moreover, mQMA reduces dramatically the number of
trees to be maintained.}
}
@INPROCEEDINGS{BeCo07,
AUTHOR = {J-C. Bermond and M. Cosnard},
BOOKTITLE = {Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International},
TITLE = {Minimum number of wavelengths equals load in a DAG
without internal cycle},
YEAR = {2007},
ADDRESS = {Long Beach, CA, U.S.A.},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1-10},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BC07.pdf}
}
@INPROCEEDINGS{BGP07,
AUTHOR = {J-C. Bermond and F. Giroire and S. Pérennes},
BOOKTITLE = {14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07)},
TITLE = {Design of Minimal Fault Tolerant On-Board Networks :
Practical constructions},
YEAR = {2007},
ADDRESS = {Castiglioncello, Italy},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {261-273},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Sciences},
VOLUME = {4474},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGP07.pdf}
}
@INPROCEEDINGS{BHHL07,
AUTHOR = {J-C. Bermond and F. Havet and F. Huc and
C. Linhares-Sales},
BOOKTITLE = {Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07)},
TITLE = {Allocation de fréquences et coloration impropre des
graphes hexagonaux pondérés},
YEAR = {2007},
ADDRESS = {Ile d'Oléron, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {53-56},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2007.labri.fr/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BHH+07.pdf},
ABSTRACT = {Motiv\'es par un probl\`eme d'allocation de
fr\'equences, nous \'etudions la coloration impropre des graphes
pond\'er\'es et plus particuli\`erement des graphes hexagonaux
pond\'er\'es. Nous donnons des algorithmes d'approximation pour
trouver de telles colorations.}
}
@INPROCEEDINGS{BLS07b,
AUTHOR = {S. Bessy and N. Lichiardopol and J.-S. Sereni},
BOOKTITLE = {Proceedings of the sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications},
TITLE = {Two proofs of Bermond-Thomassen conjecture for regular
tournaments},
YEAR = {2007},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {47--53},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {28},
URL = {http://kam.mff.cuni.cz/~cs06/},
PDF = {http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75GV-4N5M9FJ-8-1&_cdi=13104&_user=4895301&_orig=browse&_coverDate=030.000000010.0000002007&_sk=999719999&view=c&wchp=dGLbVtz-zSkzk&md5=e44f5e8def6ba8f2a790b29f6bb262e6&ie=/sdarticle.pdf}
}
@INPROCEEDINGS{BBR07a,
AUTHOR = {E. Birmele and J. A. Bondy and B. Reed},
BOOKTITLE = {Proceedings of a Conference in Memory of Claude Berge, Graph Theory in Paris},
TITLE = {Brambles, Prisms and Grids},
YEAR = {2007},
ADDRESS = {Basel},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {37-44},
PUBLISHER = {Birkhauser},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{CLC07,
AUTHOR = {R. Chand and L. Liquori and M. Cosnard},
BOOKTITLE = {20th International Conference on Architecture of Computing Systems (ARCS 2007)},
TITLE = {Improving Resource Discovery in the Arigatoni Overlay
Network},
YEAR = {2007},
ADDRESS = {Zurich, Switzerland},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {98--111},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4415},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/arcs-07.pdf}
}
@INPROCEEDINGS{ChRe07,
AUTHOR = {A. Chattopadhyay and B. Reed},
BOOKTITLE = {11th Intl. Workshop on Randomization and Computation (RANDOM 2007)},
TITLE = {Properly 2-Colouring Linear Hypergraphs},
YEAR = {2007},
ADDRESS = {Princeton University, NJ, USA},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {395-408},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4627},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ChRe07.pdf}
}
@INPROCEEDINGS{CLC07b,
AUTHOR = {M. Cosnard and L. Liquori and R. Chand},
BOOKTITLE = {DCM, International Workshop on Developpment in Computational Models},
TITLE = {Virtual Organizations in Arigatoni},
YEAR = {2007},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {55--75},
OPTPUBLISHER = {},
SERIES = {Electronique Notes in Theoretical Computer Science},
VOLUME = {171},
URL = {http://dx.doi.org/10.1016/j.entcs.2006.11.035},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/dcm-06.pdf}
}
@INPROCEEDINGS{Dal07a,
AUTHOR = {O. Dalle},
BOOKTITLE = {AI, Simulation and Planning in High Autonomy Systems (AIS)-Conceptual Modeling and Simulation (CMS) Joint Conference},
TITLE = {Component-based Discrete Event Simulation Using the
Fractal Component Model},
YEAR = {2007},
ADDRESS = {Buenos Aires, AR},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {213--218},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal07a.pdf}
}
@INPROCEEDINGS{Dal07b,
AUTHOR = {O. Dalle},
BOOKTITLE = {Proc. of the Summer Computer Simulation Conference (SCSC'07)},
TITLE = {The OSA Project: an Example of Component Based Software
Engineering Techniques Applied to Simulation},
YEAR = {2007},
ADDRESS = {San Diego, CA, USA},
OPTEDITOR = {},
MONTH = {July},
NOTE = {Invited paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1155--1162},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal07b.pdf}
}
@INPROCEEDINGS{DaMr07,
AUTHOR = {O. Dalle and C. Mrabet},
BOOKTITLE = {Proc. of 6th EUROSIM Congress (EUROSIM'2007)},
TITLE = {An Instrumentation Framework for component-based
simulations based on the Separation of Concerns paradigm},
YEAR = {2007},
ADDRESS = {Ljubljana, Slovenia},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {10p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DaMr07.pdf}
}
@INPROCEEDINGS{DaWa07,
AUTHOR = {O. Dalle and G. Wainer},
BOOKTITLE = {Proc. of the DEVS Workshop of the Summer Computer Simulation Conference (SCSC'07)},
TITLE = {An Open Issue on Applying Sharing Modeling Patterns in
DEVS},
YEAR = {2007},
ADDRESS = {San Diego, CA},
OPTEDITOR = {},
MONTH = {July},
NOTE = {Short paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DaWa07.pdf}
}
@INPROCEEDINGS{DBH07,
AUTHOR = {G. Danoy and P. Bouvry and L. Hogie},
BOOKTITLE = {Proceedings of the IEEE Congress on Evolutionary Computation - CEC},
TITLE = {Coevolutionary Genetic Algorithms for Ad Hoc Injection
Networks Design Optimization},
YEAR = {2007},
ADDRESS = {Singapore},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.google.fr/url?sa=t&source=web&ct=res&cd=1&ved=0CBcQFjAA&url=ftp%3A%2F%2Fftp-sop.inria.fr%2Fmascotte%2FPublications%2FDBH07.pdf&ei=kR3oS56bE9D8_AaxkqDNBA&usg=AFQjCNEbq-NiZZVsEBA_5YSlnrlB_RbRAg},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/DBH07.pdf},
ABSTRACT = {When considering realistic mobility patterns, nodes in
mobile ad hoc networks move in such a way that the networks most
often get divided in a set of disjoint partitions. This presence of
partitions is an obstacle to communication within these networks. Ad
hoc networks are generally based on technologies allowing nodes in a
geographical neighborhood to communicate for free, in a P2P manner.
These technologies include IEEE802.11 (Wi-Fi), Bluetooth, etc. In
most cases a communication infrastructure is available. It can be a
set of access point as well as GMS/UMTS network. The use of such an
infrastructure is billed, but it permits distant nodes to get in
communication, through what we call "bypass links". The objective of
our work is to improve the network connectivity by defining a set of
long distance connections. To do this we consider the number of
bypass links, as well as the two properties that build on the
"small-world" graph theory: the clustering coefficient, and the
characteristic path length. A fitness function, used for genetic
optimization, is processed out of these three metrics. In this paper
we investigate the use of two Coevolutionary Genetic Algorithms (LCGA
and CCGA) and compare their performance to a generational and a
steadystate genetic algorithm (genGA and ssGA) for optimizing one
instance of this topology control problem and present evidence of
their capacity to solve it.}
}
@INPROCEEDINGS{AGM07a,
AUTHOR = {A. Ferreira and A. Goldman and J. Monteiro},
BOOKTITLE = {Proceedings of the 6th IEEE International Symposium on Network Computing and Applications},
TITLE = {On the evaluation of shortest journeys in dynamic
networks},
YEAR = {2007},
ADDRESS = {Cambridge, MA, USA},
OPTEDITOR = {},
MONTH = {July},
NOTE = {Invited Paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {3--10},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGM07a.pdf},
ABSTRACT = {The assessment of routing protocols for wireless
networks is a difficult task, because of the networksâ€™ highly
dynamic behavior and the absence of benchmarks. However, some of
these networks, such as intermittent wireless sensors networks,
periodic or cyclic networks, and low earth orbit (LEO) satellites
systems, have more predictable dynamics, as the temporal variations
in the network topology are somehow deterministic, which may make
them easier to study. The graph theoretic model â€“ the evolving
graphs â€“ was proposed to help capture the dynamic behavior of these
networks, in view of the construction of least cost routing and other
algorithms. Our recent experiments showed that evolving graphs have
all the potentials to be an effective and powerful tool in the
development of routing protocols for dynamic networks. In this paper,
we evaluated the shortest journey evolving graph algorithm when used
in a routing protocol for MANETs. We use the NS2 network simulator to
compare this first implementation to the four well known protocols,
namely AODV, DSR, DSDV, and OLSR. In this paper we present simulation
results on the energy consumption of the nodes. We also included
other EG protocol, namely EGForemost , in the experiments.}
}
@INPROCEEDINGS{AGM07b,
AUTHOR = {A. Ferreira and A. Goldman and J. Monteiro},
BOOKTITLE = {Proceedings of 25th Brazilian Symposium on Computer Networks (SBRC'07)},
TITLE = {Using Evolving Graphs Foremost Journey to Evaluate
Ad-Hoc Routing Protocols},
YEAR = {2007},
ADDRESS = {Belem, Brazil},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {17--30},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGM07b.pdf},
ABSTRACT = {The performance evaluation of routing protocols for ad
hoc networks is a difficult task. However, a graph theoretic model
â€“ the evolving graphs â€“ was recently proposed to help capture the
behavior of dynamic networks with fixed-schedule behavior. Our recent
experiments showed that evolving graphs have all the potentials to be
an effective and powerful tool in the development of routing
protocols for dynamic networks. In this paper, we design a new con-
gestion avoidance mechanism and a modified end-to-end delay metric in
order to improve the evolving graph based routing protocol proposed
previously. We use the NS2 network simulator to compare this new
version to the three proto- cols provided by NS2, namely AODV, DSR
and DSDV, and to OLSR, which is included in the experiments for the
first time.}
}
@INPROCEEDINGS{FuGi07,
AUTHOR = {E. Fusy and F. Giroire},
BOOKTITLE = {Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics},
TITLE = {Estimating the number of active flows in a data stream
over a sliding window},
YEAR = {2007},
OPTADDRESS = {},
EDITOR = {David Appelgate},
OPTMONTH = {},
NOTE = {Proceedings of the New Orleans Conference},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {223-231},
PUBLISHER = {SIAM Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/FuGi07.pdf},
ABSTRACT = {A new algorithm is introduced to estimate the number of
distinct flows (or connections) in a data stream. The algorithm
maintains an accurate estimate of the number of distinct flows over a
sliding window. It is simple to implement, parallelizes optimally,
and has a very good trade-off between auxiliary memory and accuracy
of the estimate: a relative accuracy of order $1/\sqrt{m}$ requires
essentially a memory of order $m\ln(n/m)$ words, where $n$ is an
upper bound on the number of flows to be seen over the sliding
window. For instance, a memory of only $64 kB$ is sufficient to
maintain an estimate with accuracy of order $4$ percents for a stream
with several million flows. The algorithm has been validated both by
simulations and experimentations on real traffic. It proves very
efficient to monitor traffic and detect attacks.}
}
@INPROCEEDINGS{Gal07a,
AUTHOR = {J. Galtier},
BOOKTITLE = {The Second International Conference on Systems and Networks Communications (ICSNC'07)},
TITLE = {Analysis and optimization of MAC with constant size
congestion window for WLAN},
YEAR = {2007},
ADDRESS = {Cap Esterel, French Riviera, France},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal07.pdf}
}
@INPROCEEDINGS{GoHu07a,
AUTHOR = {C. Gomes and G. Huiban},
BOOKTITLE = {International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS)},
TITLE = {Multiobjective Analysis in Wireless Mesh Networks},
YEAR = {2007},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {Bogazici University, Istanbul, Turkey},
PAGES = {103--108},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.cmpe.boun.edu.tr/mascots07/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GoHu07a.pdf},
ABSTRACT = {Wireless Mesh Networks is a scalable and cost-effective
solution for next-generation wireless networking. In the present
work, we consider the Round Weighting Problem (RWP). It solves a
joint routing and scheduling problem to attend a given demand
subjected to the multiaccess interferences. We proposed a
multiobjective approach that deal with two objective functions. The
first one is to minimize the load over the routers, it increases the
security in case of failure and minimizes the cost with memory in
each node. The second objective is to minimize the time of the
communication. We aim to identify the Pareto frontier of the problem.
The Column generation method was used to solve efficiently the test
instances. We make experiments with some networks with different
number of sinks. Our approach captures the trade-off generated by
using these two conflicting objective functions. This relationship
corresponds to a convex piecewise linear function.}
}
@INPROCEEDINGS{GMRR07b,
AUTHOR = {C. Gomes and C. Molle and P. Reyes and H. Rivano},
BOOKTITLE = {The 22nd European Conference on Operational Research (EURO XXII)},
TITLE = {Models for Optimal Wireless Mesh Network Design},
YEAR = {2007},
ADDRESS = {Prague},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
ABSTRACT = {Wireless Mesh Networks (WMNs) are cost-effective and
provide an appealing answer to connectivity issues of ubiquituous
computing. Unfortunately, wireless networks are known for strong
waste of capacity when their size increase. Thus, a key challenges
for network operators is to provide guaranteed quality of service.
Maximizing network capacity requires to optimize jointly the Access
Points (AP) placement, the routing and the link scheduling taking
interferences into account. We present MILP models for computing an
optimal 802.11a or 802.16 WMN design providing max-min bandwidth
guaranty.}
}
@INPROCEEDINGS{GMRR07a,
AUTHOR = {C. Gomes and C. Molle and P. Reyes and H. Rivano},
BOOKTITLE = {Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07)},
TITLE = {Placement Optimal de points d'accès dans les réseaux
radio maillés},
YEAR = {2007},
ADDRESS = {Ile d'Oléron, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {117-120},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2007.labri.fr/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GMRR07.pdf},
ABSTRACT = {Cet article pr\'esente un mod\`ele lin\'eaire permettant
de placer un nombre minimum de points d'acc\`es dans un r\'eseau
radio maill\'e ({\em Wireless Mesh Network}). Connaissant la
topologie du r\'eseau, le probl\`eme est de d\'eterminer le nombre
minimum de points d'acc\`es reli\'es \`a Internet n\'ecessaires pour
que la demande de chaque routeur soit satisfaite. Afin de prendre en
compte les interf\'erences spatiales d\^ues \`a la technologie radio,
le temps est d\'ecoup\'e en intervalles r\'eguliers au cours desquels
un ensemble de liens n'interf\'erant pas deux \`a deux est
d\'etermin\'e, ce qui engendre une limitation de la capacit\'e des
liens en fonction de leur activation dans le temps. Le placement se
fait ensuite de mani\`ere \`a assurer \`a chaque n\oe{}ud le d\'ebit
d\'esir\'e en r\'egime permanent.}
}
@INPROCEEDINGS{HHMR07,
AUTHOR = {F. Havet and van den Heuvel, J. and C. McDiarmid and
B. Reed},
BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007)},
TITLE = {List colouring squares of planar graphs},
YEAR = {2007},
ADDRESS = {Sevilla, Spain},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {515-519},
OPTPUBLISHER = {},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {29},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HH+07.pdf}
}
@INPROCEEDINGS{HuDa07,
AUTHOR = {G. Huiban and P. Datta},
BOOKTITLE = {International Workshop on the Design of Reliable Communication Networks (DRCN)},
TITLE = {Multi-Metrics Reconfiguration in Core WDM Networks},
YEAR = {2007},
ADDRESS = {La Rochelle, France},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
PUBLISHER = {SEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.drcn.org/drcn07/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HuDa07.pdf},
ABSTRACT = {We consider the reconfiguration problem in multifiber
WDM optical networks. In a network with evolving traffic, the virtual
topology may not remain optimal, leading to degradation of network
performance. However, adapting the virtual topology to the changing
traffic may lead to service disruption. This optimization problem
hence captures the trade-off between network performance and number
of reconfigurations applied to the virtual topology. This trade-off
is considered via a multi-metrics approach. The above problem is
solved through a Mixed Integer Linear Programming (MILP) formulation
with a multivariate objective function. However the problem is
NP-hard and such an approach is unable to solve large problem
instances in a reasonable time. Therefore we propose a simulated
annealing (SA) based heuristic approach for solving problems of
higher complexity. We compare the performance and the computation
time of solving the MILP model and the heuristic approach considering
different test instances. We can find near optimal solutions for
instances of medium complexity using the MILP model. The SA scheme
can be used as a heuristic to arrive at near optimal solutions when
the run-time of the MILP becomes practically infeasible. It also
appears that the trade-off's involved in the reconfiguration problem
cannot be left aside, as a little flexibility with respect to one
metric allows to drastically improve the quality of the solution with
respect to other metrics.}
}
@INPROCEEDINGS{INS07,
AUTHOR = {D. Ilcinkas and N. Nisse and D. Soguet},
BOOKTITLE = {OPODIS},
TITLE = {The Cost of Monotonicity in Distributed Graph Searching},
YEAR = {2007},
ADDRESS = {Guadeloupe, France},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {415-428},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4878},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/opodis/opodis2007.html},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Opodis07.ps},
ABSTRACT = {Blin {\it et al.} (2006) proposed a distributed protocol
that ena\-bles the smallest number of searchers to clear any unknown
asynchronous graph in a decentralized manner. {\it Unknown} means
that the searchers are provided no {\it a priori} information about
the graph. However, the strategy that is actually performed lacks of
an important property, namely the monotonicity. That is, the clear
part of the graph can decrease at some steps of the execution of the
protocol. As a consequence, the protocol of Blin {\it et al.} is
executed in exponential time. Nisse and Soguet (2007) proved that, in
order to ensure the smallest number of searchers to clear any
$n$-node graph in a monotone way, it is necessary and sufficient to
provide $\Theta(n \log n)$ bits of information to the searchers. This
paper deals with the smallest number of searchers that are necessary
and sufficient to monotoneously clear any unknown graph in a
decentralized manner. The distributed graph searching problem
considers a team of searchers that is aiming at clearing any
connected contaminated graph. The clearing of the graph is required
to be {\it connected}, i.e., the clear part of the graph must remain
permanently connected, and {\it monotone}, i.e., the clear part of
the graph only grows. The {\it search number} $\mcs(G)$ of a graph
$G$ is the smallest number of searchers necessary to clear $G$ in a
monotone connected way in centralized settings. We prove that
$\Theta(\frac{n}{\log n}\, \mcs(G))$ searchers are necessary and
sufficient to clear any unknown $n$-node graph $G$ in a monotone
connected way, in decentralized settings. More precisely, we prove
that, no distributed protocol using less than $\Omega(\frac{n}{\log
n}\, \mcs(G))$ searchers can clear any unknown synchronous $n$-node
graph $G$ in a monotone connected way. Moreover, we propose a
distributed protocol that allows $O(\frac{n}{\log n}\, \mcs(G))$
searchers to clear any unknown asynchronous $n$-node graph $G$ in a
monotone connected way.}
}
@INPROCEEDINGS{KaRe07,
AUTHOR = {K. Kawarabayashi and B. Reed},
BOOKTITLE = {39th ACM Symposium on Theory of Computing (STOC 2007)},
TITLE = {Computing crossing number in linear time.},
YEAR = {2007},
ADDRESS = {San Diego, CA, USA},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {382-390},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{KiRe07,
AUTHOR = {A. King and B. Reed},
BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007)},
TITLE = {Asymptotics of the chromatic number for quasi-line
graphs},
YEAR = {2007},
ADDRESS = {Sevilla, Spain},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {327-331},
OPTPUBLISHER = {},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {29}
}
@INPROCEEDINGS{LiCo07b,
AUTHOR = {L. Liquori and M. Cosnard},
BOOKTITLE = {3rd Symposium on Trustworthy Global Computing (TGC 2007)},
TITLE = {Logical Networks: Towards Foundations for Programmable
Overlay Networks and Overlay Computing Systems},
YEAR = {2007},
ADDRESS = {Sophia Antipolis, France},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {90-107},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4912},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/tgc-07.pdf}
}
@INPROCEEDINGS{LiCo07a,
AUTHOR = {L. Liquori and M. Cosnard},
BOOKTITLE = {International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2007)},
TITLE = {Weaving Arigatoni with a Graph Topology},
YEAR = {2007},
ADDRESS = {Papeete, French Polynesia},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8p},
PUBLISHER = {IEEE Computer Society Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/advcomp-07.pdf}
}
@INPROCEEDINGS{MaNi07,
AUTHOR = {F. Mazoit and N. Nisse},
BOOKTITLE = {Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
TITLE = {Monotonicity of Non-deterministic Graph Searching},
YEAR = {2007},
ADDRESS = {Dornburg, Germany},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {33-44},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4769},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2007.html},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/WG07.ps},
ABSTRACT = {In graph searching, a team of searchers is aiming at
capturing a fugitive moving in a graph. In the initial variant,
called \emph{invisible graph searching}, the searchers do not know
the position of the fugitive until they catch it. In another variant,
the searchers permanently know the position of the fugitive, i.e. the
fugitive is visible. This latter variant is called \emph{visible
graph searching}. A search strategy that catches any fugitive in such
a way that, the part of the graph reachable by the fugitive never
grows is called \emph{monotone}. {\it A priori}, monotone strategies
may require more searchers than general strategies to catch any
fugitive. This is however not the case for visible and invisible
graph searching. Two important consequences of the monotonicity of
visible and invisible graph searching are: (1) the decision problem
corresponding to the computation of the smallest number of searchers
required to clear a graph is in NP, and (2) computing optimal search
strategies is simplified by taking into account that there exist some
that never backtrack. Fomin \emph{et al.} (2005) introduced an
important graph searching variant, called \emph{non-determi\-nistic
graph searching}, that unifies visible and invisible graph searching.
In this variant, the fugitive is invisible, and the searchers can
query an oracle that permanently knows the current position of the
fugitive. The question of the monotonicity of non-deterministic graph
searching is however left open. In this paper, we prove that
non-deterministic graph searching is monotone. In particular, this
result is a unified proof of monotonicity for visible and invisible
graph searching. As a consequence, the decision problem corresponding
to non-determinisitic graph searching belongs to NP. Moreover, the
exact algorithms designed by Fomin \emph{et al.} do compute optimal
non-deterministic search strategies.}
}
@INPROCEEDINGS{NPC07b,
AUTHOR = {N. Nepomuceno and P. R. Pinheiro and A. L. V. Coelho},
BOOKTITLE = {XX Concurso de Teses e Dissertações (CTD)},
TITLE = {Combining Metaheuristics and Integer Linear Programming:
A Hybrid Methodology Applied to the Container Loading Problem},
YEAR = {2007},
ADDRESS = {Rio de Janeiro, Brazil},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {2028-2032},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC07b.pdf}
}
@INPROCEEDINGS{NPC07a,
AUTHOR = {N. Nepomuceno and P. R. Pinheiro and A. L. V. Coelho},
BOOKTITLE = {7th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP)},
TITLE = {Tackling the Container Loading Problem: A Hybrid
Approach Based on Integer Linear Programming and Genetic Algorithms},
YEAR = {2007},
ADDRESS = {Valencia, Spain},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {154-165},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dx.doi.org/10.1007/978-3-540-71615-0_14},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC07.pdf}
}
@INPROCEEDINGS{NiSo07,
AUTHOR = {N. Nisse and D. Soguet},
BOOKTITLE = {Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
TITLE = {Graph Searching with Advice},
YEAR = {2007},
ADDRESS = {Castiglioncello, Italy},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {51-65},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4474},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/sirocco2007.html},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Sirocco07.ps},
ABSTRACT = {Fraigniaud {\it et al.} (2006) introduced a new measure
of difficulty for a distributed task in a network. The smallest {\it
number of bits of advice} of a distributed problem is the smallest
number of bits of information that has to be available to nodes in
order to accomplish the task efficiently. Our paper deals with the
number of bits of advice required to perform efficiently the graph
searching problem in a distributed setting. In this variant of the
problem, all searchers are initially placed at a particular node of
the network. The aim of the team of searchers is to capture an
invisible and arbitrarily fast fugitive in a monotone connected way,
i.e., the cleared part of the graph is permanently connected, and
never decreases while the search strategy is executed. We show that
the minimum number of bits of advice permitting the monotone
connected clearing of a network in a distributed setting is $O (n
\log n)$, where $n$ is the number of nodes of the network, and this
bound is tight. More precisely, we first provide a labelling of the
vertices of any graph $G$, using a total of $O(n \log n)$ bits, and a
protocol using this labelling that enables clearing $G$ in a monotone
connected distributed way. Then, we show that this number of bits of
advice is almost optimal: no protocol using an oracle providing $o(n
\log n)$ bits of advice permits the monotone connected clearing of a
network using the smallest number of searchers.}
}
@INPROCEEDINGS{NiSo07,
AUTHOR = {N. Nisse and D. Soguet},
BOOKTITLE = {9èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Stratégies d'encerclement avec information},
YEAR = {2007},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {49-52},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2007.labri.fr/},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel07.pdf},
ABSTRACT = {Dans le cadre de l'algorithmique r\'eparti dans les
r\'eseaux, l'efficacit\'e d'un algorithme d\'epend tr\`es fortement
de la connaissance du r\'eseau, disponible {\it a priori}. Tr\`es
souvent, cette connaissance {\it a priori} est de nature qualitative
(taille du r\'eseau, son diam\`etre, etc.). Fraigniaud {\it et al.}
(2006) ont introduit une mesure quantitative de la complexit\'e d'une
tâche r\'epartie dans un r\'eseau. Etant donn\'e un probl\`eme
r\'eparti, cette mesure, {\it la taille d'oracle}, consiste en le
plus petit nombre de bits d'information dont doit disposer
l'algorithme pour r\'esoudre le probl\`eme efficacement. Nous nous
int\'eressons \`a la taille d'oracle permettant de r\'esoudre
efficacement {\it l'encerclement} dans les graphes. L'encerclement
dans les r\'eseaux vise \`a r\'ealiser la capture d'un fugitif
invisible, arbitrairement rapide et omniscient, par une \'equipe
d'agents mobiles, dans un r\'eseau. La strat\'egie d'encerclement est
calcul\'ee en temps r\'eel, par les agents eux mêmes, et doit
v\'erifier les trois propri\'et\'es suivantes: (1)~{\it connexit\'e}
: la zone nettoy\'ee doit toujours être connexe, (2)~{\it monotonie}
: la zone nettoy\'ee ne doit jamais être recontamin\'ee, et (3)~{\it
optimalit\'e} : le nombre d'agents utilis\'es doit être le plus petit
possible. Les deux premi\`eres contraintes assurent des
communications s\'ecuris\'ees entre les agents, ainsi qu'un temps de
nettoyage polynomial en la taille du r\'eseau. La troisi\`eme
propri\'et\'e assure une taille minimum des ressources utilis\'ees.
La seule connaissance, concernant le r\'eseau, dont les agents
disposent {\it a priori}, est mod\'elis\'ee par un {\it oracle} qui
r\'epartit sur les n{\oe}uds du r\'eseau une chaîne de bits
d'information. Nous prouvons que la taille d'oracle pour r\'esoudre
l'encerclement est $O(n \log n)$ bits, avec $n$ la taille du
r\'eseau, et que cette borne est optimale. Plus pr\'ecis\'ement, nous
proposons un \'etiquetage des sommets, de taille $O(n \log n)$ bits,
et un protocole r\'eparti utilisant cet \'etiquetage. Ce protocole
permet \`a une \'equipe d'agents, dont la m\'emoire est de taille
$O(\log n)$ bits, de nettoyer le r\'eseau de façon optimale monotone
et connexe. Ce protocole am\'eliore le protocole propos\'e par Blin
{\it et al.} (2006) qui ne dispose d'aucune information {\it a
priori} et, de ce fait, n\'ecessite un temps de nettoyage
exponentiel. De plus, nous prouvons qu'il n'existe pas de protocole
r\'eparti utilisant un oracle de taille $o(n \log n)$ bits qui
permette de nettoyer tous les r\'eseaux de façon optimale monotone et
connexe.}
}
@INPROCEEDINGS{SaZe07,
AUTHOR = {I. Sau and J. Zerovnik},
BOOKTITLE = {Proc. of International Network Optimization Conference (INOC 2007)},
TITLE = {Optimal Permutation Routing on Mesh Networks},
YEAR = {2007},
ADDRESS = {Spa, Belgium},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/SZ07.pdf},
ABSTRACT = {Permutation routing is used as one of the standard tests
of routing algorithms. In the permutation routing problem, each
processor is the origin of at most one packet and the destination of
no more than one packet. The goal is to minimize the number of time
steps required to route all packets to their respective destinations.
Wireless mesh networks are based on plane tessellations that divide
the area into cells and give rise to triangular, square, and
hexagonal grids. In this paper we study permutation routing
algorithms that work on finite convex subgraphs of basic grids, under
the store-and-forward $\Delta$-port model. We consider algorithms
implemented independently at each node, without assuming any global
knowledge about the network. I.e., distributed algorithms. We
describe optimal distributed permutation routing algorithms for
subgraphs of triangular and square grids that need $\ell_{max}$ (the
maximum over the length of the shortest path of all packets) routing
steps, and show that there is no such algorithm on the hexagonal
grids. Furthermore, we show that these algorithms are oblivious and
translation invariant.}
}
@INPROCEEDINGS{SSL07,
AUTHOR = {da Silva, A. and da Silva, A. and C. Linhares-Sales},
BOOKTITLE = {XXXIX Congresso da Sociedade Brasileira de Pesquisa Operacional (SBPO 2007)},
TITLE = {Largura em Árvore de Grafos Planares Livres de Ciclos
Pares Induzidos},
YEAR = {2007},
ADDRESS = {Fortaleza, Brazil},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.sobrapo.org.br/simposios/XXXIX/indexxxxix.htm}
}
@INPROCEEDINGS{AGT06,
AUTHOR = {E. Altman and J. Galtier and C. Touati},
BOOKTITLE = {The Third Annual Conference on Wireless On demand Network Systems and Services},
TITLE = {Fair power and transmission rate control in wireless
networks},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {134--143},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGT06.pdf}
}
@INPROCEEDINGS{ABG+06,
AUTHOR = {O. Amini and J-C. Bermond and F. Giroire and F. Huc and
S. Pérennes},
BOOKTITLE = {Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06)},
TITLE = {Design of Minimal Fault Tolerant Networks: Asymptotic
Bounds},
YEAR = {2006},
ADDRESS = {Trégastel, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {37--40},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2006.lip6.fr/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/ABG+06.pdf},
ABSTRACT = {This paper deals with the design of on board networks in
satellites (also called Traveling wave tube Amplifiers (TWTA)). These
networks should connect signals arriving on some ports of the
satellite to amplifiers, even in case of failures of some amplifiers.
They are made of links and expensive switches each with 4 links. So,
the aim is to design networks having as few switches as possible and
satisfying the following property: \emph{there exist $p$
edge-disjoint paths from the $p$ signals arriving on $p + \lambda$
ports (inputs) to any set of $p$ amplifiers (outputs) chosen from the
$p+k$ total number of outputs}. We call such networks \emph{valid
$(p,\lambda,k)$-networks} and want to determine the minimum number of
switches $\mathcal{N}(p, \lambda,k)$ of such networks. By symmetry we
suppose $\lambda \leq k$. We give tight results for small values of
$k$ and asymptotic results when $k = O(\log p)$ which are tight when
$k=\Theta(\lambda)$ and when $\lambda=0$.}
}
@INPROCEEDINGS{ACD+06,
AUTHOR = {M. Ancona and W. Cazzola and S. Drago and G. Quercini},
BOOKTITLE = {ISCC '06: Proceedings of the 11th IEEE Symposium on Computers and Communications},
TITLE = {Visualizing and Managing Network Topologies via
Rectangular Dualization},
YEAR = {2006},
ADDRESS = {Washington, DC, USA},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1000-1005},
PUBLISHER = {IEEE Computer Society},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ACD+06.pdf},
ABSTRACT = {Rectangular dualization is an effective, hierarchically
oriented visualization method for network topologies and can be used
in many other problems having in common with networks the condition
that objects and their interoccurring relations are represented by
means of a planar graph. However, only 4-connected triangulated
planar graphs admit a rectangular dual. In this paper we present a
linear time algorithm to optimally construct a rectangular layout for
a general class of graphs and we discuss a variety of application
fields where this approach represents an helpful support for
visualization tools.}
}
@INPROCEEDINGS{BLS06b,
AUTHOR = {R. Bayon and N. Lygeros and J.-S. Sereni},
BOOKTITLE = {Book of abstracts of the nineteenth Panhellenic Conference/Summer School on nonlinear science and complexity},
TITLE = {Orders with ten elements are circle orders},
YEAR = {2006},
ADDRESS = {Thessaloniki},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://web.auth.gr/nonlinear/home_page_en.php},
PDF = {http://www.math.upatras.gr/~crans/Book of Abstracts-4.pdf}
}
@INPROCEEDINGS{BCLV06,
AUTHOR = {D. Benza and M. Cosnard and L. Liquori and M. Vesin},
BOOKTITLE = {JVA: John Vincent Atanasoff International Symposium on Modern Computing},
TITLE = {Arigatoni: Overlaying Internet via Low Level Network
Protocols},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {82--91},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jva-06.pdf}
}
@INPROCEEDINGS{BCY06,
AUTHOR = {J-C. Bermond and R. Corrêa and J. Yu},
BOOKTITLE = {6th Conference on Algorithms and Complexity},
TITLE = {Gathering algorithms on paths under interference
constraints},
YEAR = {2006},
ADDRESS = {Roma, Italy},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {115--126},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3998},
URL = {http://www.dsi.uniroma1.it/~ciac/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/BCY06.pdf}
}
@INPROCEEDINGS{BCCP06,
AUTHOR = {J-C. Bermond and M. Cosnard and D. Coudert and
S. Pérennes},
BOOKTITLE = {Advanced International Conference on Telecommunications (AICT)},
TITLE = {Optimal Solution of the Maximum All Request Path
Grooming Problem},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCP-AICT06.pdf},
ABSTRACT = {We give an optimal solution to the Maximum All Request
Path Grooming (MARPG) problem motivated by a traffic grooming
application. The MARPG problem consists in finding the maximum number
of connections which can be established in a path of size $N$, where
each arc has a capacity or bandwidth $C$ (grooming factor). We
present a greedy algorithm to solve the problem and an explicit
formula for the maximum number of requests that can be groomed. In
particular, if $C = s(s 1)/2$ and $N > s(s-1)$, an optimal solution
is obtained by taking all the requests of smallest length, that is of
length 1 to $s$. However this is not true in general since anomalies
can exist. We give a complete analysis and the exact number of such
anomalies.}
}
@INPROCEEDINGS{BCMS06,
AUTHOR = {J-C. Bermond and D. Coudert and X. Muñoz and I. Sau},
BOOKTITLE = {IEEE-LEOS ICTON / COST 293 GRAAL},
TITLE = {Traffic Grooming in Bidirectional WDM ring networks},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {19-22},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCMS-ICTON-GRAAL06.pdf},
ABSTRACT = {We study the minimization of ADMs (Add-Drop
Multiplexers) in Optical WDM Networks with Bidirectional Ring
topology considering symmetric shortest path routing and all-to-all
unitary requests. We insist on the statement of the problem, which
had not been clearly stated before in the bidirectional case. Optimal
solutions had not been found up to date. In particular, we study the
case $C = 2$ and $C = 3$ (giving either optimal constructions or
near-optimal solutions) and the case $C = k(k 1)/2$ (giving optimal
decompositions for specific congruence classes of $N$). We state a
general Lower Bound for all the values of $C$ and $N$, and we improve
this Lower Bound for $C=2$ and $C=3$ (when $N=4t 3)$. We also include
some comments about the simulation of the problem using Linear
Programming.}
}
@INPROCEEDINGS{BGK+06b,
AUTHOR = {J-C. Bermond and J. Galtier and R. Klasing and
N. Morales and S. Pérennes},
BOOKTITLE = {Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06)},
TITLE = {Gathering in specific radio networks},
YEAR = {2006},
ADDRESS = {Trégastel, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {85--88},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2006.lip6.fr/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/BGK+06b.pdf}
}
@INPROCEEDINGS{BGK+06a,
AUTHOR = {J-C. Bermond and J. Galtier and R. Klasing and
N. Morales and S. Pérennes},
BOOKTITLE = {FAWN06},
TITLE = {Hardness and approximation of Gathering in static radio
networks},
YEAR = {2006},
ADDRESS = {Pisa, Italy},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {75--79},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://ares.insa-lyon.fr/fawn2006/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond//PUBLIS/BGK+06.pdf}
}
@INPROCEEDINGS{BFNV06b,
AUTHOR = {L. Blin and P. Fraigniaud and N. Nisse and S. Vial},
BOOKTITLE = {Proceeding of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO)},
TITLE = {Distributed Chasing of Network Intruders},
YEAR = {2006},
ADDRESS = {Chester, UK},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {70-84},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4056},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/sirocco/sirocco2006.html},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/sirocco06.pdf},
ABSTRACT = {This paper addresses the graph searching problem in a
distributed setting. We describe a distributed protocol that enables
searchers with logarithmic size memory to clear any network, in a
fully decentralized manner. The search strategy for the network in
which the searchers are launched is computed online by the searchers
themselves \emph{without knowing the topology of the network in
advance}. It performs in an asynchronous environment, i.e., it
implements the necessary synchronization mechanism in a decentralized
manner. In every network, our protocol performs a connected strategy
using at most $k+1$ searchers, where $k$ is the minimum number of
searchers required to clear the network in a monotone connected way,
computed in the centralized and synchronous setting.}
}
@INPROCEEDINGS{BFNV06a,
AUTHOR = {L. Blin and P. Fraigniaud and N. Nisse and S. Vial},
BOOKTITLE = {8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Encerclement réparti d'un fugitif dans un réseau par des
agents mobiles.},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {89-92},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2006.lip6.fr/},
ABSTRACT = {\emph{L'encerclement} dans les graphes est l'un des
outils les plus populaires pour analyser la recherche, par une
\'equipe d'agents, d'un fugitif omniscient, arbitrairement rapide et
invisible dans un r\'eseau. Les solutions existantes au probl\`eme de
l'encerclement dans les graphes souffrent cependant d'un s\'erieux
inconv\'enient : elles sont toutes centralis\'ees et supposent que
les agents \'evoluent dans un environnement synchrone. En particulier
: (1) la strat\'egie d'encerclement dans un r\'eseau est calcul\'ee
partant d'une connaissance compl\`ete du r\'eseau, et (2) les
mouvements des agents sont control\'es par un m\'ecanisme
centralis\'e qui d\'ecide \`a chaque \'etape quel agent doit se
d\'eplacer et quel mouvement il doit r\'ealiser. Cet article traite
de l'encerclement dans les graphes r\'ealis\'e de mani\`ere
r\'epartie. Nous pr\'esentons un protocole r\'eparti qui permet \`a
des agents, dont la m\'emoire est de taille logarithmique en la
taille du r\'eseau, de nettoyer le r\'eseau de facon
d\'ecentralis\'ee. La mani\`ere dont les agents se d\'eplacent pour
r\'ealiser la strat\'egie d'encerclement est calcul\'ee en temps
r\'eel par les agents eux-m\^eme, {\emph sans qu'ils ne connaissent
la topologie du r\'eseau \`a l'avance}. Tout cela est r\'ealis\'e
dans un environnement asynchrone, c'est-\`a-dire que notre protocole
impl\'emente le m\'ecanisme de synchronisation n\'ecessaire de
mani\`ere d\'ecentralis\'ee. La performance de la strat\'egie
d'encerclement est mesur\'ee par le nombre d'agents utilis\'es pour
capturer l'intrus. Selon cette mesure, nous prouvons que notre
protocole a un rapport de comp\'etitivit\'e de $3/2$ et que c'est le
meilleur ratio atteignable par n'importe quel protocole r\'eparti. En
fait, pour tout r\'eseau, notre protocole calcule une strat\'egie
dont nous prouvons qu'elle utilise au plus $OPT+1$ agents, o\`u $OPT$
est le nombre minimum d'agents n\'ecessaire pour nettoyer un r\'eseau
de facon centralis\'ee et synchrone.}
}
@INPROCEEDINGS{CCL06,
AUTHOR = {R. Chand and M. Cosnard and L. Liquori},
BOOKTITLE = {Proceedings of the International Workshop on Innovative Internet Community Systems (I2CS)},
TITLE = {Resource Discovery in the Arigatoni Overlay Network},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {13p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/i2cs-06.pdf}
}
@INPROCEEDINGS{CLN+06,
AUTHOR = {R. Cilibrasi and Z. Lotker and A. Navarra and
S. Pérennes and P. Vitanyi},
BOOKTITLE = {Proceedings of the 10th International Conference On Principles Of Distributed Systems (OPODIS)},
TITLE = {About the Lifespan of Peer to Peer Networks},
YEAR = {2006},
ADDRESS = {Bordeaux},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {290--304},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {4305},
URL = {http://www.opodis.net/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CLN+06.pdf}
}
@INPROCEEDINGS{CLKW06,
AUTHOR = {H. Cirstea and K. Claude and L. Liquori and B. Wack},
BOOKTITLE = {JFLA: Journées Francophones des Langages Applicatifs},
TITLE = {Polymorphic Type Inference for the Rewriting Calculus},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {57--69},
PUBLISHER = {INRIA},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{CPRV06,
AUTHOR = {D. Coudert and S. Pérennes and H. Rivano and M-E. Voge},
BOOKTITLE = {IEEE-LEOS ICTON / COST 293 GRAAL},
TITLE = {Shared Risk Resource Groups and Survivability in
Multilayer Networks},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
NOTE = {Invited Paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {235-238},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CPRV-ICTON-GRAAL06.pdf},
ABSTRACT = {We study the minimization of ADMs (Add-Drop
Multiplexers) in Optical WDM Networks with Bidirectional Ring
topology considering symmetric shortest path routing and all-to-all
unitary requests. We insist on the statement of the problem, which
had not been clearly stated before in the bidirectional case. Optimal
solutions had not been found up to date. In particular, we study the
case C = 2 and C = 3 (giving either optimal constructions or
near-optimal solutions) and the case C = k(k 1)/2 (giving optimal
decompositions for specific congruence classes of N). We state a
general Lower Bound for all the values of C and N, and we improve
this Lower Bound for C=2 and C=3 (when N=4t 3). We also include some
comments about the simulation of the problem using Linear
Programming.}
}
@INPROCEEDINGS{Dal06b,
AUTHOR = {O. Dalle},
BOOKTITLE = {20th European Conference on Modeling and Simulation (ECMS)},
TITLE = {OSA: an Open Component-based Architecture for
Discrete-Event Simulation},
YEAR = {2006},
ADDRESS = {Bonn, Germany},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {253--259},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Dal06b.pdf}
}
@INPROCEEDINGS{FGM06,
AUTHOR = {A. Ferreira and A. Goldman and J. Monteiro},
BOOKTITLE = {Proceedings of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2006)},
TITLE = {Performance Evaluation of Dynamic Networks using an
Evolving Graph Combinatorial Model},
YEAR = {2006},
ADDRESS = {Montreal, CA},
OPTEDITOR = {},
MONTH = {June},
NOTE = {Best Student Paper Award},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {173--180},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.congresbcu.com/wimob2006/}
}
@INPROCEEDINGS{FFN06,
AUTHOR = {F. V. Fomin and P. Fraigniaud and N. Nisse},
BOOKTITLE = {8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Strategies d'encerclement non deterministes},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {81-84},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2006.lip6.fr/},
ABSTRACT = {Nous d\'efinissons l'encerclement non-d\'eterministe
dans les graphes. Nous montrons comment ce nouvel outil peut \^etre
utilis\'e pour la conception d'algorithmes et pour l'analyse
combinatoire de la largeur lin\'eaire (pathwidth) comme de la largeur
arborescente (treewidth) des graphes. Nous prouvons l'\'equivalence
entre cette approche sous forme de ``jeu'' (graph searching) et la
d\'ecomposition arborescente $q$-branch\'ee d'un graphe. Cette
d\'ecomposition peut \^etre interpr\'et\'ee comme une version
param\'etr\'ee des d\'ecompositions arborescente et lin\'eaire qui
sont deux cas extr\^emes de la d\'ecomposition arborescente
$q$-branch\'ee. L'\'equivalence entre l'encerclement
non-d\'eterministe et la d\'ecomposition arborescente $q$-branch\'ee
nous permet de proposer un algorithme exact (en temps exponentiel)
pour calculer la largeur arborescente $q$-branch\'ee pour tout $q
\geq 0$. Cet algorithme est donc valide \`a la fois pour la largeur
lin\'eaire et po ur la largeur arborescente. Notre algorithme est
aussi rapide que le meilleur algorithme connu pour la largeur
lin\'eaire.}
}
@INPROCEEDINGS{FrNi06b,
AUTHOR = {P. Fraigniaud and N. Nisse},
BOOKTITLE = {Proceeding of the 7th Latin American Symposium on Theoretical Informatics (LATIN)},
TITLE = {Connected Treewidth and Connected Graph Searching},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {479-490},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/latin/latin2006.html},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Latin06.ps},
ABSTRACT = {We give a constructive proof of the equality between
\emph{treewidth} and \emph{connected treewidth}. More precisely, we
describe an $O(nk^3)$-time algorithm that, given any $n$-node
width-$k$ tree-decomposition of a connected graph $G$, returns a
connected tree-decomposition of $G$ of width $\leq k$. The equality
between treewidth and connected treewidth finds applications in
\emph{graph searching} problems. First, using equality between
treewidth and connected treewidth, we prove that the \emph{connected}
search number $\cs(G)$ of a connected graph $G$ is at most
$\log{n}+1$ times larger than its search number. Second, using our
constructive proof of equality between treewidth and connected
treewidth, we design an \\$O(\log n\sqrt{\log OPT})$-approximation
algorithm for connected search, running in time
$O(t(n)+nk^3\log^{3/2}k+m\log n)$ for $n$-node $m$-edge connected
graphs of treewidth at most $k$, where $t(n)$ is the time-complexity
of the fastest algorith m for approximating the treewidth, up to a
factor $O(\sqrt{\log OPT})$. }
}
@INPROCEEDINGS{FrNi06a,
AUTHOR = {P. Fraigniaud and N. Nisse},
BOOKTITLE = {Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG)},
TITLE = {Monotony Properties of Connected Visible Graph Searching},
YEAR = {2006},
ADDRESS = {Montpellier, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {229-240},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {5911},
ABSTRACT = {{Search games are attractive for their correspondence
with classical width parameters. For instance, the \emph{invisible}
search number (a.k.a. \emph{node} search number) of a graph is equal
to its pathwidth plus~1, and the \emph{visible} search number of a
graph is equal to its treewidth plus~1. The \emph{connected} variants
of these games ask for search strategies that are connected, i.e., at
every step of the strategy, the searched part of the graph induces a
connected subgraph. We focus on \emph{monotone} search strategies,
i.e., strategies for which every node is searched exactly once. The
monotone connected visible search number of an $n$-node graph is at
most $O(\log n)$ times its visible search number. First, we prove
that this logarithmic bound is tight. Precisely, we prove that there
is an infinite family of graphs for which the ratio monotone
connected visible search number over visible search number is
$\Omega(\log n)$. Second, we prove that, as opposed to the
non-connected variant of visible graph searching, ``recontamination
helps" for connected visible search. Precisely, we prove that, for
any $k \geq 4$, there exists a graph with connected visible search
number at most $k$, and monotone connected visible search number
$>k$.}, url =
{http://www.informatik.uni-trier.de/~ley/db/conf/wg/wg2006.html}, pdf
=
{http://www-sop.inria.fr/members/Nicolas.Nisse/publications/WG06_nisse.ps} }
}
@INPROCEEDINGS{Gal06b,
AUTHOR = {J. Galtier},
BOOKTITLE = {IEEE GLOBECOM},
TITLE = {Adaptive power and transmission rate control in cellular
CDMA networks},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal06b.pdf}
}
@INPROCEEDINGS{Gal06a,
AUTHOR = {J. Galtier},
BOOKTITLE = {8th International Conference on Transparent Optical Networks},
TITLE = {Analysis of the slotted non-persistent CSMA protocol
with poissonian packet size using a semi-Markov graph representation},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {IEEE},
PAGES = {258--262},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal06a.pdf}
}
@INPROCEEDINGS{Gir06a,
AUTHOR = {F. Giroire},
BOOKTITLE = {Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2006)},
TITLE = {Directions to use Probabilistic Algorithms for
Cardinality for DNA Analysis},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {3-5},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir06.pdf},
ABSTRACT = {Probabilistic algorithms for cardinality allow to
estimate the number of distinct words of very large multisets. Best
of them are very fast (only few tens of CPU operations per element)
and use constant memory (standard error of $c \sqrt M$ attained using
$M$ units of memory) to be compared with the linear memory used by
exact algorithms. Hence they allow to do multiple experiments in few
minutes with few KiloBytes on files of several GigaBytes that would
be unfeasible with exact counting algorithms. Such algorithms are
used here to analyze base correlation in human genome.}
}
@INPROCEEDINGS{HBG05,
AUTHOR = {L. Hogie and Pascal Bouvry and Frédéric Guinand},
BOOKTITLE = {Electronic Notes in Theoretical Computer Science, in the proceedings of MTCoord'05},
TITLE = {An Overview of MANETs Simulation},
YEAR = {2006},
ADDRESS = {Namur, Belgium},
EDITOR = {L. Brim and I. Linden},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {81--101},
PUBLISHER = {Elsevier},
SERIES = {LNCS},
VOLUME = {150},
URL = {http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B75H1-4JCCCYV-7-1&_cdi=13109&_user=6068170&_pii=S1571066106001010&_orig=search&_coverDate=03%2F09%2F2006&_sk=998499998&view=c&wchp=dGLzVlb-zSkzk&md5=e28496e51e1f2587eb45bf5557c533fd&ie=/sdarticle.pdf},
ABSTRACT = {Mobile Ad hoc NETworks (MANETs) are dynamic networks
populated by mobile stations. Stations in MANETs are usually laptops,
PDAs or mobile phones. These devices feature Bluetooth and/or IEEE
802.11 (WiFi) network interfaces and communicate in a decentralized
manner. Mobility is a key feature of MANETs. Because of their high
cost and their lack of flexibility of such networks, experimentation
is mostly achievable through simulation. Numerous tools exist for
MANETs simulation, including ns-2 and GloMoSim which are the two most
popular ones. This paper provides a State of the Art of MANETs
simulators and associated simulation techniques. First it gives an
overview of the domain. Then it provides a map of the main
characteristics that MANETs simulation tools should feature and the
current support of these. Finally, a description for each simulator
is provided, including an explanation of what make them appealing
solutions.}
}
@INPROCEEDINGS{HBG+b,
AUTHOR = {L. Hogie and P. Bouvry and F. Guinand and G. Danoy and
E. Alba},
BOOKTITLE = {ICN/ICONS/MCL '06: Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies},
TITLE = {A Bandwidth-Efficient Broadcasting Protocol for Mobile
Multi-hop Ad hoc Networks},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {71-71},
PUBLISHER = {IEEE Computer Society},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://pascal.bouvry.org/ftp/icn2006.pdf},
ABSTRACT = {This paper presents a new broadcasting protocol called
Delayed Flooding with Cumulative Neighborhood (DFCN) designed for
wireless ad hoc networks. DFCN enables bandwidth-efficient
broadcasting in wide area network composed of large number of mobile
devices. The protocol was validated trough simulation which proved
its efficiency and cost-effectiveness. Comparison with other well
known protocols has shown that the proposed protocol outperforms them
in such terms as a number of emissions and redundant receptions.}
}
@INPROCEEDINGS{HBG+06a,
AUTHOR = {L. Hogie and P. Bouvry and F. Guinand and G. Danoy and
E. Alba},
BOOKTITLE = {Demo proceeding of the 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06)},
TITLE = {Simulating Realistic Mobility Models for Large
Heterogeneous MANETs},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1p},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.google.fr/url?sa=t&source=web&ct=res&cd=1&ved=0CBoQFjAA&url=http%3A%2F%2Fwww-valoria.univ-ubs.fr%2FSARAH%2Fpdf%2FHogie_mswim06.pdf&ei=MRjoS-GFN4-C_QbZ9MW7BA&usg=AFQjCNG_0DVrdUMl_h00MOvH2fgUX6osDQ},
ABSTRACT = {Mobile ad hoc networks (MANETs) are composed of
communicat- ing mobile devices capable of spontaneously
interconnecting without any pre-existing infrastructure. The wide
spread of mobile devices(i.e. phones, PDAs, laptops) enables the
deployment of metropolitan ad hoc networks, referred to as
MobileMANs. Until recently, MobileMAN simu- lation suffered from a
lack of appropriate tools. Therefore a new class of simulators
dedicated to MobileMANs is appearing. This paper presents Mad hoc, a
MANETs simulator which belongs to this class. In addi- tion to
providing particular models for the simulation of numerous nodes
evolving in a metropolitan environment, Mad hoc comes with appropri-
ate tools for the development and the monitoring of ad hoc
applications. Mad hocÃ•s applications are presented.}
}
@INPROCEEDINGS{Liq06,
AUTHOR = {L. Liquori},
BOOKTITLE = {Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005)},
TITLE = {iRho: the Software: [System Description]},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3},
OPTORGANIZATION = {},
PAGES = {85--94},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Theoretical Computer Science},
VOLUME = {135},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/dcm-06.pdf}
}
@INPROCEEDINGS{LHR06,
AUTHOR = {L. Liquori and F. Honsell and R. Redamalla},
BOOKTITLE = {Proceedings of the International Workshop on Automated Specification and Verification of Web Sites (WWV 2005)},
TITLE = {A Language for Verification and Manipulation of Web
Documents},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2},
OPTORGANIZATION = {},
PAGES = {67--78},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Theoretical Computer Science},
VOLUME = {157}
}
@INPROCEEDINGS{LND+06,
AUTHOR = {F. Luna and A. J. Nebro and B. Dorronsoro and E. Alba and
P. Bouvry and L. Hogie},
BOOKTITLE = {Applications of Evolutionary Computing},
TITLE = {Optimal Broadcasting in Metropolitan MANETs Using
Multiobjective Scatter Search},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {255-266},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3907},
URL = {http://www.springerlink.com/content/qk6747wq32478r42/fulltext.pdf},
ABSTRACT = {Mobile Ad-hoc Networks (MANETs) are composed of a set of
communicating devices which are able to spontaneously interconnect
without any pre-existing infrastructure. In such scenario,
broadcasting becomes an operation of capital importance for the own
existence and operation of the network. Optimizing a broadcasting
strategy in MANETs is a multiobjective problem accounting for three
goals: reaching as many stations as possible, minimizing the network
utilization, and reducing the makespan. In this paper, we face this
multiobjective problem with a state-of-the-art multiobjective scatter
search algorithm called AbSS (Archive-based Scatter Search) that
computes a Pareto front of solutions to empower a human designer with
the ability of choosing the preferred configuration for the network.
Results are compared against those obtained with the previous
proposal used for solving the problem, a cellular multiobjective
genetic algorithm (cMOGA). We conclude that AbSS outperforms cMOGA
with respect to three different metrics.}
}
@INPROCEEDINGS{Mou06,
AUTHOR = {J. Moulierac},
BOOKTITLE = {2nd Student Workshop of IEEE Infocom},
TITLE = {On the number of multicast aggregated trees in a domain},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {2p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06number.pdf},
ABSTRACT = {Multicast tree aggregation is an efficient proposition
that can solve the multicast forwarding state scalability problem.
Existing works on tree aggregation have focused on developing and
simulating protocols that build trees dynamically. However, the
underlying problem of the impact of the tree construction algorithm
on the performance of the protocols remains untouched. In this paper,
we propose a study on the number of trees that need to be configured
in a domain depending on the tree construction algorithm. We ran
extensive simulations on several real domains and with different tree
construction algorithms. Our results show that for a given set of
multicast groups, even when this set includes all the possible
groups, the number of trees that need to be configured is small. This
allows a network administrator to configure off-line all these trees
in order to maintain a stable set of trees and to have knowledge of
the routes used by the multicast packets. Knowing the set of all the
possible trees is also useful to determine the best subset to
configure and to give an upper bound of the number of different
trees.}
}
@INPROCEEDINGS{MGM06c,
AUTHOR = {J. Moulierac and A. Guitton and M. Molnár},
BOOKTITLE = {IFIP Networking},
TITLE = {Multicast Tree Aggregation in Large Domains},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3976},
OPTORGANIZATION = {},
PAGES = {691--702},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06tree.pdf},
ABSTRACT = {Tree aggregation is an ecient proposition that can solve
the problem of multicast forwarding state scalability. The main idea
of tree aggregation is to force several groups to share the same
delivery tree: in this way, the number of multicast forwarding states
per router is reduced. Unfortunately, when achieving tree aggregation
in large do- mains, few groups share the same tree and the
aggregation ratio is small. In this paper, we propose a new algorithm
called TALD (Tree Aggrega- tion in Large Domains) that achieves tree
aggregation in domains with a large number of nodes. The principle of
TALD is to divide the domain into several sub-domains and to achieve
the aggregation in each of the sub-domain separately. In this way,
there is possible aggregation in each of the sub-domain and the
number of forwarding states is signicantly reduced. We show the
performance of our algorithm by simulations on a Rocketfuel network
of 200 routers.}
}
@INPROCEEDINGS{MGM06b,
AUTHOR = {J. Moulierac and A. Guitton and M. Molnár},
BOOKTITLE = {IEEE Globecom},
TITLE = {On the number of MPLS LSP using Multicast Tree
Aggregation},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {5p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06number.pdf},
ABSTRACT = {Multicast tree aggregation is an efficient proposition
that can solve the multicast forwarding state scalability problem.
Existing works on tree aggregation have focused on developing and
simulating protocols that build trees dynamically. However, the
underlying problem of the impact of the tree construction algorithm
on the performance of the protocols remains untouched. In this paper,
we propose a study on the number of trees that need to be configured
in a domain depending on the tree construction algorithm. We ran
extensive simulations on several real domains and with different tree
construction algorithms. Our results show that for a given set of
multicast groups, even when this set includes all the possible
groups, the number of trees that need to be configured is small. This
allows a network administrator to configure off-line all these trees
in order to maintain a stable set of trees and to have knowledge of
the routes used by the multicast packets. Knowing the set of all the
possible trees is also useful to determine the best subset to
configure and to give an upper bound of the number of different
trees.}
}
@INPROCEEDINGS{MM06,
AUTHOR = {J. Moulierac and M. Molnàr},
BOOKTITLE = {IEEE International Conference on Networking (ICN)},
TITLE = {Active Monitoring of Link Delays in Case of Asymmetric
Routes},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac06active.pdf},
ABSTRACT = {Network monitoring receives signicant interest recently.
Indeed, knowledge of link availability and link characteristics is of
signicant importance in order to provide efcient routing. In this
paper, we consider active network monitoring of link delays in a
Service Provider or Enterprise IP network using round trip delays.
Our proposition guarantees that all links are monitored contrary to
previous propositions. Indeed, previous propositions assume symmetric
routing in networks when placing the monitoring stations. With this
assumption, round trips may be different when routes are asymmetric
and link delays are not signi cant. We say that links are not
monitored in this case. Previous propositions do not monitor 5.76\%
of links in average and 10\% in worst cases during our simulations
while we monitor always 100\% of links. Moreover, in our proposition,
the amount of trafc is reduced and the measures are more precise
since the distance from a monitoring station (beacon) to the edges is
limited by a given bound. Finally, we show during the simulations
that the set of beacons is rather stable in case of link failures.}
}
@INPROCEEDINGS{NPC06b,
AUTHOR = {N. Nepomuceno and Rogério Pinheiro, P. and
A. L. V. Coelho},
BOOKTITLE = {XXXVIII Simpósio Brasileiro de Pesquisa Operacional (SBPO)},
TITLE = {Aplicação de uma Metodologia Hìbrida ao Problema de
Carregamento de Contêineres},
YEAR = {2006},
ADDRESS = {Goiania, Brazil},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1596-1603},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC06b.pdf}
}
@INPROCEEDINGS{NPC06a,
AUTHOR = {N. Nepomuceno and Rogério Pinheiro, P. and
A. L. V. Coelho},
BOOKTITLE = {XIII Congreso Latino-Iberoamericano de Investigación Operativa (CLAIO)},
TITLE = {Metaheurìstica e Programação Linear Inteira: Um
Algoritmo Hìbrido para o Problema de Carregamento de Contêineres},
YEAR = {2006},
ADDRESS = {Montevideo, Uruguay},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {6p},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/NPC06.pdf}
}
@INPROCEEDINGS{RTV06a,
AUTHOR = {H. Rivano and F. Theoleyre and F. Valois},
BOOKTITLE = {Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN 2006)},
TITLE = {Capacity Evaluation Framework and Validation of
Self-Organized Routing Schemes},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {28-28 Sept.},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {779--785},
PUBLISHER = {IEEE},
OPTSERIES = {},
VOLUME = {3},
URL = {http://www.ctr.kcl.ac.uk/IWWAN2006/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/rtv06.pdf},
ABSTRACT = {Assuming a given network topology and a routing
protocol, this work is focused on the capacity evaluation of routing
protocols based on either a self-organization scheme or a flat
approach. To reach this goal, we propose to use linear-programming
formulation to model radio resource sharing as linear constraints.
Four models are detailed to evaluate the capacity of any routing
scheme in wireless multihops networks. First, two models of fairness
are proposed: either each node has a fair access to the channel, or
the fairness is among the radio links. Besides, a pessimistic and an
optimistic scenarios of spatial re-utilization of the medium are
proposed, yielding a lower bound and an upper bound on the network
capacity for each fairness case. Finally, using this model, we
provide a comparative analysis of some flat and self-organized
routing protocols}
}
@INPROCEEDINGS{Vog06a,
AUTHOR = {M.-E. Voge},
BOOKTITLE = {Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06)},
TITLE = {Graphes Colorés - Arbre Couvrant Coloré},
YEAR = {2006},
ADDRESS = {Trégastel},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {41--44},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://algotel2006.lip6.fr/}
}
@INPROCEEDINGS{Vog06b,
AUTHOR = {M.-E. Voge},
BOOKTITLE = {IEEE-LEOS ICTON/COST 293 GRAAL},
TITLE = {How to transform a multilayer network into a colored
graph},
YEAR = {2006},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {116--119},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {3}
}
@INPROCEEDINGS{MR2173795,
AUTHOR = {L. Addario-Berry and K. Dalal and B. Reed},
BOOKTITLE = {Proceedings of GRACO2005},
TITLE = {Degree constrained subgraphs},
YEAR = {2005},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {257--263 (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {19}
}
@INPROCEEDINGS{AAG+05,
AUTHOR = {S. Alouf and E. Altman and J. Galtier and J.-F. Lalande and
C. Touati},
BOOKTITLE = {IEEE INFOCOM 2005},
TITLE = {Quasi-optimal bandwidth allocation for multi-spot MFTDMA
satellites},
YEAR = {2005},
ADDRESS = {Miami, FL},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {71--94},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.ieee-infocom.org/2005/index.htm},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/quasi-optimal_bandwidth_allocation_for_multi-spot_mftdma_satellites.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Francois.Lalande/articles/quasi-optimal_bandwidth_allocation_for_multi-spot_mftdma_satellites.ps.gz}
}
@INPROCEEDINGS{BBC05,
AUTHOR = {J-C. Bermond and L. Braud and D. Coudert},
BOOKTITLE = {12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO},
TITLE = {Traffic Grooming on the Path},
YEAR = {2005},
ADDRESS = {Le Mont Saint-Michel, France},
OPTEDITOR = {},
MONTH = {May 24-26},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {34-48},
PUBLISHER = {LNCS 3499},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BBC-Sirocco05.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BBC-Sirocco05.ps.gz},
ABSTRACT = {In a WDM network, routing a request consists in
assigning it a route in the physical network and a wavelength. If
each request uses at most $1/C$ of the bandwidth of the wavelength,
we will say that the grooming factor is $C$. That means that on a
given edge of the network we can groom (group) at most $C$ requests
on the same wavelength. With this constraint the objective can be
either to minimize the number of wavelengths (related to the
transmission cost) or minimize the number of Add Drop Multiplexer
(shortly ADM) used in the network (related to the cost of the
nodes).Here we consider the case where the network is a path on $N$
nodes, $P_N$. Thus the routing is unique. For a given grooming factor
$C$ minimizing the number of wavelengths is an easy problem, well
known and related to the load problem.But minimizing the number of
ADM's is NP-complete for a general set of requests and no results are
known. Here we show how to model the problem as a graph partition
problem and using tools of design theory we completely solve the case
where $C=2$ and where we have a static uniform all-to-all traffic
(requests being all pairs of vertices).}
}
@INPROCEEDINGS{BePe05,
AUTHOR = {J.-C. Bermond and J. Peters},
BOOKTITLE = {Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05)},
TITLE = {Efficient Gathering in Radio Grids with Interference},
YEAR = {2005},
ADDRESS = {Presqu'île de Giens},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {103--106},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BePe05.pdf}
}
@INPROCEEDINGS{CFGR+05b,
AUTHOR = {C. Chaudet and E. Fleury and I. Guérin-Lassous and
H. Rivano and M.-E. Voge},
BOOKTITLE = {CoNEXT 2005},
TITLE = {Optimal positioning of active and passive monitoring
devices},
YEAR = {2005},
ADDRESS = {Toulouse, France},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://dmi.ensica.fr/conext/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/cfgr05b.pdf},
ABSTRACT = {Network measurement is essential for assessing
performance issues, identifying and locating problems. Two common
strategies are the passive approach that attaches specific devices to
links in order to monitor the traffic that passes through the network
and the active approach that generates explicit control packets in
the network for measurements. One of the key issues in this domain is
to minimize the overhead in terms of hardware, software, maintenance
cost and additional traffic. In this paper, we study the problem of
assigning tap devices for passive monitoring and beacons for active
monitoring. Minimizing the number of devices and finding optimal
strategic locations is a key issue, mandatory for deploying scalable
monitoring platforms. In this article, we present a combinatorial
view of the problem from which we derive complexity and
approximability results, as well as efficient and versatile Mixed
Integer Programming (MIP) formulations.}
}
@INPROCEEDINGS{CFGR+05,
AUTHOR = {C. Chaudet and E. Fleury and I. Guérin-Lassous and
H. Rivano and M.-E. Voge},
BOOKTITLE = {Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05)},
TITLE = {Surveillance passive dans l'Internet},
YEAR = {2005},
ADDRESS = {Presqu'île de Giens},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {121--124},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www-sop.inria.fr/mascotte/Algotel2005/},
PDF = {http://www-sop.inria.fr/mascotte/Algotel2005/Actes/26.pdf},
ABSTRACT = {Afin d'obtenir les informations nécessaires à une bonne
gestion des ressources de leur réseau, les opérateurs placent des
sondes passives sur les liens de leurs points de présence. Dans cet
article, nous donnons des écritures en programmes linéaires mixtes
des problèmes de placement de sondes simples ou avec échantillonnage,
et donnons une stratégie pour la maintenance de la surveillance
partielle de trafics dynamiques dans un point de présence. Ces
formulations améliorent les résultats de deux articles récents de la
littérature.}
}
@INPROCEEDINGS{CPPS05,
AUTHOR = {D. Coudert and S. Perennes and Q-C. Pham and J-S. Sereni},
BOOKTITLE = {AlgoTel'05},
TITLE = {Rerouting requests in WDM networks},
YEAR = {2005},
ADDRESS = {Presqu'île de Giens, France},
OPTEDITOR = {},
MONTH = {mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {17-20},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CPPS-AlgoTel05.pdf},
ABSTRACT = {We model a problem related to routing reconfiguration in
WDM networks. We establish some similarities and differences with two
other known problems: the pathwidth and the pursuit problem. We then
present a distributed linear-time algorithm to solve the problem on
trees. Last we give the solutions for some classes of graphs, in
particular complete $d$-ary trees and grids.}
}
@INPROCEEDINGS{MR2210011,
AUTHOR = {S. Fiorini and N. Hardy and B. Reed and A. Vetta},
BOOKTITLE = {Integer programming and combinatorial optimization},
TITLE = {Approximate min-max relations for odd cycles in planar
graphs},
YEAR = {2005},
ADDRESS = {Berlin},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {35--50},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3509}
}
@INPROCEEDINGS{MR2173796,
AUTHOR = {S. Fiorini and N. Hardy and B. Reed and A. Vetta},
BOOKTITLE = {Proceedings of GRACO2005},
TITLE = {Planar graph bipartization in linear time},
YEAR = {2005},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {265--271 (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {19}
}
@INPROCEEDINGS{FMNP05,
AUTHOR = {M. Flammini and L. Moscardelli and A. Navarra and
S. Pérennes},
BOOKTITLE = {Proceedings of the 19th International Symposium on Distributed Computing, (DISC 2005)},
TITLE = {Asymptotically Optimal Solutions for Small World Graphs},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {414--428},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3724},
URL = {http://www.mimuw.edu.pl/~disc2005/}
}
@INPROCEEDINGS{FNP05,
AUTHOR = {M. Flammini and A. Navarra and S. Pérennes},
BOOKTITLE = {Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, (WEA 2005)},
TITLE = {The Real approximation factor of the MST heuristic for
the Minimum Energy Broadcasting},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {22--31},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3503},
URL = {http://ru1.cti.gr/wea05/}
}
@INPROCEEDINGS{FFN05,
AUTHOR = {F. V. Fomin and P. Fraigniaud and N. Nisse},
BOOKTITLE = {Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS)},
TITLE = {Nondeterministic Graph Searching: From Pathwidth to
Treewidth},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {364-375},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.informatik.uni-trier.de/~ley/db/conf/mfcs/mfcs2005.html},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/MFCS2005.ps},
ABSTRACT = {We introduce nondeterministic graph searching with a
controlled amount of nondeterminism and show how this new tool can be
used in algorithm design and combinatorial analysis applying to both
pathwidth and treewidth. We prove equivalence between this
game-theoretic approach and graph decompositions called q -branched
tree decompositions, which can be interpreted as a parameterized
version of tree decompositions. Path decomposition and (standard)
tree decomposition are two extreme cases of q-branched tree
decompositions. The equivalence between nondeterministic graph
searching and q-branched tree decomposition enables us to design an
exact (exponential time) algorithm computing q-branched treewidth for
all q, which is thus valid for both treewidth and pathwidth. This
algorithm performs as fast as the best known exact algorithm for
pathwidth. Conversely, this equivalence also enables us to design a
lower bound on the amount of nondeterminism required to search a
graph with the minimum number of searchers.}
}
@INPROCEEDINGS{FrNi05,
AUTHOR = {P. Fraigniaud and N. Nisse},
BOOKTITLE = {7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)},
TITLE = {Stratégies d'encerclement connexes dans un réseau},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {13-16},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www-sop.inria.fr/mascotte/Algotel2005/},
PDF = {http://www-sop.inria.fr/members/Nicolas.Nisse/publications/Algotel2005.ps},
ABSTRACT = {Le probl\`eme de l'encerclement dans les r\'eseaux a
\'et\'e introduit par Parson (1976)~: \'etant donn\'e un r\'eseau
"contamin\'e" (par exemple dans lequel un intrus s'est introduit),
l'\emph{encerclement} du r\'eseau est le nombre minimum d'agents
n\'ecessaires pour "nettoyer" le r\'eseau (c'est-\`a-dire capturer
l'intrus). Une strat\'egie d'encerclement est dite connexe si \`a
chaque \'etape de la strat\'egie, l'ensemble des liens nettoy\'es
induit un sous-r\'eseau connexe. Les strat\'egies d'encerclement
connexes sont essentielles si l'on souhaite assurer des
communications s\^ures entre les agents. Dans le cas des r\'eseaux en
arbres, Barri\`ere {\sl et al.} (2002, 2003) ont prouv\'e que le
rapport entre l'encerclement connexe et l'encerclement est major\'e
par 2, et que cette borne est optimale. Dans cet article, nous
donnons une borne pour ce rapport dans le cas des r\'eseaux
arbitraires. Pour cela nous utilisons une notion cruciale de
th\'eorie des graphes~: la largeur arborescente. L'\'egalit\'e entre
la largeur arborescente connexe d'un graphe et sa largeur
arborescente d\'ecoule du th\'eor\`eme de Parra et Scheffler (1995).
Nous donnons ici une preuve constructive de cette \'egalit\'e. Plus
pr\'ecisemment, nous proposons un algorithme qui \'etant donn\'es un
graphe $G$ de $n$ sommets et une d\'ecomposition arborescente de
largeur $k$ de $G$, calcule en temps $O(n~k^3)$ une d\'ecomposition
arborescente connexe de largeur $\leq k$ de $G$. Une cons\'equence
importante de notre r\'esultat est qu'il permet de borner par
$\lceil\log{n}\rceil+1$ le rapport entre encerclement connexe et
encerclement d'un r\'eseau de $n$ n{\oe}uds.}
}
@INPROCEEDINGS{GLP05,
AUTHOR = {J. Galtier and A. Laugier and P. Pons},
BOOKTITLE = {The 5th International Workshop on Design of Reliable Communication Networks},
TITLE = {Algorithms to evaluate the reliability of a network},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {93--100},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://drcn2005.telecomitalialab.com/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/GLP05.pdf}
}
@INPROCEEDINGS{Gir05,
AUTHOR = {F. Giroire},
BOOKTITLE = {2005 International Conference on Analysis of Algorithms},
TITLE = {Order statistics and estimating cardinalities of massive
data sets},
YEAR = {2005},
OPTADDRESS = {},
EDITOR = {Conrado MartÃnez},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {157-166},
PUBLISHER = {Discrete Mathematics and Theoretical Computer Science},
SERIES = {DMTCS Proceedings},
VOLUME = {AD},
URL = {http://www.dmtcs.org/proceedings/html/dmAD0115.abs.html},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/Gir05.pdf},
ABSTRACT = {We introduce a new class of algorithms to estimate the
cardinality of very large multisets using constant memory and doi ng
only one pass on the data. It is based on order statistics rather
that on bit patterns in binary representations of numbers. We analyse
three families of estimators. They attain a standard error of $\frac
1{\sqrt M}$ using $M$ unit s of storage, which places them in the
same class as the best known algorithms so far. They have a very
simple internal loop, which g ives them an advantage in term of
processing speed. The algorithms are validated on internet traffic
traces.}
}
@INPROCEEDINGS{GM05,
AUTHOR = {C. Gomes and Robson Mateus, G.},
BOOKTITLE = {4th International Conference on Networking (ICN)},
TITLE = {Low-Cost Design Approach to WDM Mesh Networks},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {60-67},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
SCHOOL = {Reunion Island}
}
@INPROCEEDINGS{GM05,
AUTHOR = {A. Guitton and J. Moulierac},
BOOKTITLE = {8th International Conference on Telecommunications (ConTEL)},
TITLE = {Scalable Tree Aggregation for Multicast},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
NOTE = {Best Student Paper Award},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {129--134},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/guitton05scalable.pdf},
ABSTRACT = {IP multicast is not widely deployed yet over Internet.
This is mainly due to the forwarding entries scalability and control
explosion problems. In this paper, we propose an algorithm called STA
(Scalable Tree Aggregation) which reduces the number of trees by
allowing several groups to be aggregated to the same tree: the less
trees, the less forwarding entries and the less control messages to
maintain trees. STA performs faster aggregations than previous
aggregation algorithms by evaluating fewer trees for each group,
while keeping the same performance. We show the scalability and the
fastness of STA by extensive simulations and we compare its
performance to the previous algorithm.}
}
@INPROCEEDINGS{HKS05,
AUTHOR = {F. Havet and R. J. Kang and J.-S. Sereni},
BOOKTITLE = {Proceedings of the 7th International Conference on Graph Theory (ICGT'05)},
TITLE = {Improper colouring of unit disk graphs},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {123--128},
PUBLISHER = {Elsevier},
SERIES = {Electronic Notes in Discrete Mathematics},
VOLUME = {22},
URL = {http://www-sop.inria.fr/mascotte/ICGT05/},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/HKS05.pdf}
}
@INPROCEEDINGS{HaSe05,
AUTHOR = {F. Havet and J.-S. Sereni},
BOOKTITLE = {Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG'05)},
TITLE = {Channel assignment and improper choosability of graphs},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {81--90},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3787},
URL = {http://lita.sciences.univ-metz.fr/~wg2005/},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/HaSe05.pdf}
}
@INPROCEEDINGS{HuRo05b,
AUTHOR = {G. Huiban and Robson Mateus, G.},
BOOKTITLE = {SBRC Simpósio Brasileiro de Redes de Computadores},
TITLE = {A MILP model for the reconfiguration problem in
multi-fiber WDM networks},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.sbrc2005.ufc.br/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HuRo05b.pdf},
ABSTRACT = {We address the reconfiguration problem in multi-fiber
WDM networks. It consists of finding out which adaptations should be
made to the virtual topology and the routing when the traffic
evolves. We propose a Mixed Integer Linear Programming (MILP) model
solving the problem for different objective functions. We tried to
make a concise model in relations with the number of variables and
restrictions, to reduce the memory occupation during the optimization
process. We also add some cuts to the model. We make some experiments
with this model and compare the results obtained with a simple greedy
algorithm and with an algorithm from the literature}
}
@INPROCEEDINGS{HuRo05a,
AUTHOR = {G. Huiban and Robson Mateus, G.},
BOOKTITLE = {ICT International Conference on Telecommunications},
TITLE = {A multiobjective approach of the virtual topology design
and routing problem in WDM networks},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {IEEE Computer Society Press},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.ee.up.ac.za/~ieee/ict2005/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/HuRo05a.pdf},
ABSTRACT = {We deal with the classical virtual topology design and
routing problems in optical WDM (Wavelength Division Multiplexing)
networks. We propose a multiobjective based algorithm to compute the
Pareto set of solutions of the problem. Although the computational
cost may be high, such approach permits the decision maker to have a
better perception of the gain and the loss of choosing any given
solution. We describe briefly the treated problem, and the MILP
(Mixed Integer Linear Programing) model used. We present the method
applied to obtain the Pareto set. We report some computational
results and they fully justify the interest of carrying out a
multiobjective study.}
}
@INPROCEEDINGS{KMS05a,
AUTHOR = {R. J. Kang and T. Müller and J.-S. Sereni},
BOOKTITLE = {Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005)},
TITLE = {Improper colouring of (random) unit disk graphs},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {193--198},
OPTPUBLISHER = {},
SERIES = {Discrete Mathematics and Theoretical Computer Science},
OPTVOLUME = {},
URL = {http://www.math.tu-berlin.de/EuroComb05/},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/KMS05a.pdf}
}
@INPROCEEDINGS{KLNP05,
AUTHOR = {R. Klasing and Z. Lotker and A. Navarra and S. Pérennes},
BOOKTITLE = {Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005)},
TITLE = {From Balls and Bins to Points and Vertices},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {757--766},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3827},
URL = {http://www.cs.cityu.edu.hk/~isaac2005/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/KLNP05.pdf}
}
@INPROCEEDINGS{KMRS05b,
AUTHOR = {R. Klasing and E. Markou and T. Radzik and F. Sarracco},
BOOKTITLE = {Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005)},
TITLE = {Approximation bounds for Black Hole Search problems},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3974},
URL = {http://www.di.unipi.it/OPODIS2005/}
}
@INPROCEEDINGS{KMRS05a,
AUTHOR = {R. Klasing and E. Markou and T. Radzik and F. Sarracco},
BOOKTITLE = {Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005)},
TITLE = {Hardness and approximation results for black hole search
in arbitrary graphs},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {200--215},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3499},
URL = {http://sirocco.informatika.sk/}
}
@INPROCEEDINGS{LSV05,
AUTHOR = {J.-F. Lalande and M. Syska and Y. Verhoeven},
BOOKTITLE = {ROADEF},
TITLE = {Arrondi aléatoire et protection des réseaux WDM},
YEAR = {2005},
ADDRESS = {Tours, France},
EDITOR = {de l'Université de Tours, Ecole Polytechnique},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {6},
OPTORGANIZATION = {},
PAGES = {241--242},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.ocea.li.univ-tours.fr/roadef05/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Jean-Francois.Lalande/articles/arrondi_aleatoire_et_protection_des_reseaux_wdm.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Jean-Francois.Lalande/articles/arrondi_aleatoire_et_protection_des_reseaux_wdm.ps.gz}
}
@INPROCEEDINGS{LaRa05,
AUTHOR = {A. Laugier and S. Raymond},
BOOKTITLE = {Roadef},
TITLE = {Recherche de graphes expansifs dans le graphe du Web},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.ocea.li.univ-tours.fr/roadef05/}
}
@INPROCEEDINGS{MR2200308,
AUTHOR = {Z. Li and B. Reed},
BOOKTITLE = {Algorithms and data structures},
TITLE = {Heap building bounds},
YEAR = {2005},
ADDRESS = {Berlin},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {14--23},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {3608}
}
@INPROCEEDINGS{MR2173800,
AUTHOR = {C. Meagher and B. Reed},
BOOKTITLE = {Proceedings of GRACO2005},
TITLE = {Fractionally total colouring $G\sb {n,p}$},
YEAR = {2005},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {297--303 (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {19}
}
@INPROCEEDINGS{MG05b,
AUTHOR = {J. Moulierac and A. Guitton},
BOOKTITLE = {IFIP Networking},
TITLE = {QoS Scalable Tree Aggregation},
YEAR = {2005},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
NUMBER = {3462},
OPTORGANIZATION = {},
PAGES = {1405--1408},
OPTPUBLISHER = {},
SERIES = {LNCS},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac05qos.pdf},
ABSTRACT = {{Some of the main reasons which prevents the deployment
of IP multicast are forwarding state scalability and control
explosion prob- lems. In this paper, we propose an algorithm called
Q-STA (QoS Scalable Tree Aggregation) which reduces the number of
forwarding states by al- lowing several groups to share the same
tree. Q-STA accepts groups only if there is enough available
bandwidth. Q-STA accepts much more groups and performs faster
aggregations than previous algorithms.} }
}
@INPROCEEDINGS{PeVo05,
AUTHOR = {S. Petat and M.-E. Voge},
BOOKTITLE = {Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05)},
TITLE = {Groupage sur un chemin orienté},
YEAR = {2005},
ADDRESS = {Presqu'île de Giens},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {21--24},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/PeVo05.pdf}
}
@INPROCEEDINGS{RTV05,
AUTHOR = {H. Rivano and F. Théoleyre and F. Valois},
BOOKTITLE = {Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05)},
TITLE = {Influence de l'auto-organisation sur la capacité des
réseaux ad hoc},
YEAR = {2005},
ADDRESS = {Presqu'île de Giens},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {53--56},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www-sop.inria.fr/mascotte/Algotel2005/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/rtv05.pdf},
ABSTRACT = {Les réseaux ad hoc tirent parti de la collaboration des
noeuds pour acheminer des informations. Si de nombreuses approches
ont vu le jour, la problématique du routage demeure un point crucial.
Deux approches se détachent : une première résidant dans une vision à
plat du réseau et une seconde, plus récente, où le routage repose sur
une auto-organisation du réseau. Il s'agit de fournir une solution
d'organisation afin de tirer parti des propriétés structurelles et
d'améliorer des services tels que le routage. Les performances
obtenues sont intéressantes bien que les auto-organisations réduisent
le nombre de liens radio effectivement utilisés. Nous proposons donc
ici de quantifier les changements, en terme de bande passante
disponible, entre un réseau à plat et un réseau structuré.}
}
@INPROCEEDINGS{Bes04,
AUTHOR = {S. Bessy},
BOOKTITLE = {Sixièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'04)},
TITLE = {Un algorithme d'approximation pour le sous-digraphe
fortement connexe minimal},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {57--61},
PUBLISHER = {INRIA},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://ares.insa-lyon.fr/algotel2004/program.html}
}
@INPROCEEDINGS{BeTh04,
AUTHOR = {S. Bessy and S. Thomassé},
BOOKTITLE = {Acts of IPCO X 2004},
TITLE = {Three min-max theorems concerning cyclic orders of
strong digraphs},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {132--138},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Sciences},
VOLUME = {3064},
URL = {http://lapcs.univ-lyon1.fr/~bessy/}
}
@INPROCEEDINGS{CKZ04,
AUTHOR = {C. Cooper and R. Klasing and M. Zito},
BOOKTITLE = {Proceedings of the Third Workshop on Algorithms and Models for the Web-Graph (WAW 2004)},
TITLE = {Dominating Sets in Web Graphs},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {31--43},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3243}
}
@INPROCEEDINGS{FeJa04,
AUTHOR = {A. Ferreira and A. Jarry},
BOOKTITLE = {Proceedings of WiOpt'04 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks},
TITLE = {Complexity of Minimum Spanning Tree in Evolving Graphs
and the Minimum-Energy Broadcast Routing Problem},
YEAR = {2004},
ADDRESS = {Cambridge, United Kingdom},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{FKNP04,
AUTHOR = {M. Flammini and R. Klasing and A. Navarra and
S. Pérennes},
BOOKTITLE = {2nd ACM/SIGMOBILE Annual International Joint Workshop on Foundation of Mobile Computing (DIALM-POMC 2004)},
TITLE = {Improved approximation results for the Minimum Energy
Broadcasting Problem},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {85--91},
PUBLISHER = {ACM Press},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://doi.acm.org/10.1145/1022630.1022644},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/FKNP04.ps}
}
@INPROCEEDINGS{FKLS04,
AUTHOR = {S. Funke and A. Kesselman and Z. Lotker and M. Segal},
BOOKTITLE = {ADHOC-NOW 04},
TITLE = {Improved Algorithms for the Connected Sensor Cover
Problem},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {56--59},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Gal04a,
AUTHOR = {J. Galtier},
BOOKTITLE = {Proccedings of the 16th ITC Specialist Seminar on performance evaluation of wireless and mobile systems},
TITLE = {Optimizing the IEEE 802.11b Performance using Slow
Congestion Window Decrease},
YEAR = {2004},
ADDRESS = {Antwerpen, Belgium},
OPTEDITOR = {},
MONTH = {August/September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {165--176},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/Gal04a.pdf}
}
@INPROCEEDINGS{GM04,
AUTHOR = {C. Gomes and Robson Mateus, G.},
BOOKTITLE = {3rd International Information and Telecommunication Technologies Symposium (I2TS)},
TITLE = {Routing and Wavelength Assignment in a Mesh Network},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
SCHOOL = {São Carlos Federal University (UFSCar), SP}
}
@INPROCEEDINGS{Jar04,
AUTHOR = {A. Jarry},
BOOKTITLE = {Proceedings of STACS'04},
TITLE = {Integral Symmetric 2-Commodity Flows},
YEAR = {2004},
ADDRESS = {Montpellier},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{JaLa04,
AUTHOR = {A. Jarry and A. Laugier},
BOOKTITLE = {GT04},
TITLE = {On the minimum number edges of two-connected graphs with
given diameter},
YEAR = {2004},
ADDRESS = {Paris, France},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{JaLo04,
AUTHOR = {A. Jarry and Z. Lotker},
BOOKTITLE = {Dial MPOMC 2004 The Second ACM/SIGMOBILE Annual International Joint Workshop on Foundations of Mobile Computing},
TITLE = {Connectivity in Evolving Graph with Geometric Properties},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{KNPP04,
AUTHOR = {R. Klasing and A. Navarra and A. Papadopoulos and
S. Pérennes},
BOOKTITLE = {Proc. 3rd FIP-TC6 Networking Conference ( Networking 2004)},
TITLE = {Adaptive Broadcast Consumption (ABC), a new heuristic
and new bounds for the Minimum Energy Broadcast Routing Problem},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {866--877},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3042},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/KNPP04.ps}
}
@INPROCEEDINGS{KLSS04,
AUTHOR = {G. Kozma and Z. Lotker and M. Sharir and G. Stupp},
BOOKTITLE = {24th ACM Symp. on Principles of Distributed Computing},
TITLE = {Geometrically Aware Communication in Random Wireless
Networks},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {310--319},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{LiSe04,
AUTHOR = {L. Liquori and B. P. Serpette},
BOOKTITLE = {Proc. of ACM-PPDP: International Conference on Principles and Practice of Declarative Programming},
TITLE = {iRho: an imperative rewriting calculus},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {167--178},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ppdp-04.ps.gz}
}
@INPROCEEDINGS{LMP04,
AUTHOR = {Z. Lotker and Martinez de Albeniz, M. and S. Pérennes},
BOOKTITLE = {ADHOC-NOW 2004},
TITLE = {Range-Free Ranking in Sensors Networks and Its
Applications to Localization},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {158--171},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/Stephane.Perennes/ALP04.ps}
}
@INPROCEEDINGS{MKM04,
AUTHOR = {J. Moulierac and J.-C. König and M. Molnár},
BOOKTITLE = {ALGOTEL - Rencontre francophone sur les aspects Algorithmiques des Télécommunications},
TITLE = {Diffusion contrainte dans un groupe},
YEAR = {2004},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Joanna.Moulierac/pdf/moulierac04diffusion.pdf},
ABSTRACT = {{Dans ce papier nous traitons de problemes particuliers
de communications de groupe dans les reseaux. Le probleme de
diffusion contrainte dans un groupe consiste \`a envoyer un message
d'un \'emetteur \`a un ensemble de destinataires en imposant son
passage par des noeuds sp\'ecifiques appel\'es les traducteurs. Dans
un premier temps, nous prouvons que ce probleme est NP-difficile et
nous proposons une heuristique r-approchee pour le resoudre, ou r est
le facteur d'approximation de l'heuristique pour le probleme de
Steiner. Dans un deuxieme temps, nous presentons une heuristique
permettant de resoudre le probeme de diffusion contrainte dans un
groupe auquel on a rajoute une contrainte d'equilibrage.} }
}
@INPROCEEDINGS{ABF+03,
AUTHOR = {E. Altman and I. Buret and B. Fabre and J. Galtier and
C. Guiraud and T. Tocker and C. Touati},
BOOKTITLE = {Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit},
TITLE = {Slot allocation in a TDMA satellite system: simulated
annealing approach},
YEAR = {2003},
ADDRESS = {Yokohama, Japan},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/ABF+03.pdf}
}
@INPROCEEDINGS{AGT03b,
AUTHOR = {E. Altman and J. Galtier and C. Touati},
BOOKTITLE = {Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit},
TITLE = {Radio Planning in Multibeam Geostationary Satellite
Networks},
YEAR = {2003},
ADDRESS = {Yokohama, Japan},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGT03b.pdf}
}
@INPROCEEDINGS{AGT03a,
AUTHOR = {E. Altman and J. Galtier and C. Touati},
BOOKTITLE = {Proceedings of ITC 18},
TITLE = {Semi-definite programming approach for bandwidth
allocation and routing in networks},
YEAR = {2003},
ADDRESS = {Berlin, Germany},
OPTEDITOR = {},
MONTH = {August/September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1091--1100},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/AGT03a.pdf}
}
@INPROCEEDINGS{BCKL03,
AUTHOR = {G. Barthe and H. Cirstea and C. Kirchner and L. Liquori},
BOOKTITLE = {POPL, Symposium on Principles of Programming Languages},
TITLE = {Pure Patterns Type Systems},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {250--261},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/popl-03.ps.gz}
}
@INPROCEEDINGS{BLS03,
AUTHOR = {R. Bayon and N. Lygeros and J.-S. Sereni},
BOOKTITLE = {Knowledge discovery and discrete mathematics : JIM'2003},
TITLE = {Nouveaux progrès dans l'énumération des modèles mixtes},
YEAR = {2003},
ADDRESS = {Université de Metz, France},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {243--246},
PUBLISHER = {INRIA},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.iut.univ-metz.fr/~esanjuan/JIM03/},
PDF = {http://kam.mff.cuni.cz/~sereni/Articles/BLS03.pdf}
}
@INPROCEEDINGS{BeCo03,
AUTHOR = {J.-C. Bermond and D. Coudert},
BOOKTITLE = {IEEE ICC},
TITLE = {Traffic Grooming in Unidirectional WDM Ring Networks
using Design Theory},
YEAR = {2003},
ADDRESS = {Anchorage, Alaska},
OPTEDITOR = {},
MONTH = {May},
NOTE = {ON07-3},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1402-1406},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {2},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BC-ICC03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BC-ICC03.ps.gz},
ABSTRACT = {We address the problem of traffic grooming in WDM rings
with all-to-all uniform unitary traffic. We want to minimize the
total number of SONET add-drop multiplexers (ADMs) required. We show
that this problem corresponds to a partition of the edges of the
complete graph into subgraphs, where each subgraph has at most $C$
edges (where $C$ is the grooming ratio) and where the total number of
vertices has to be minimized. Using tools of graph and design theory,
we optimally solve the problem for practical values and infinite
congruence classes of values for a given $C$, and thus improve and
unify all the preceding results. We disprove a conjecture of Chiu and
Modiano (IEEE/OSA JLT 2000) saying that the minimum number of ADMs
cannot be achieved with the minimum number of wavelengths, and also
another conjecture of Hu (OSA JON 2002).}
}
@INPROCEEDINGS{BCM03,
AUTHOR = {J.-C. Bermond and D. Coudert and X. Muñoz},
BOOKTITLE = {The 7th IFIP Working Conference on Optical Network Design & Modelling -- ONDM},
TITLE = {Traffic Grooming in Unidirectional WDM Ring Networks:
The All-to-all Unitary Case},
YEAR = {2003},
ADDRESS = {Budapest, Hongrie},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1135-1153},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCM-ONDM03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCM-ONDM03.ps.gz},
ABSTRACT = {We address the problem of traffic grooming in WDM rings
with all-to-all uniform unitary traffic. We want to minimize the
total number of SONET add-drop multiplexers (ADMs) required. This
problem corresponds to a partition of the edges of the complete graph
into subgraphs, where each subgraph has at most $C$ edges (where $C$
is the grooming ratio) and where the total number of vertices has to
be minimized. Using tools of graph and design theory, we optimally
solve the problem for practical values and infinite congruence
classes of values for a given $C$. Among others, we give optimal
constructions when $C\geq N(N-1)/6$ and results when $C=12$. We also
show how to improve lower bounds by using refined counting
techniques, and how to use efficiently an ILP program by restricting
the search space.}
}
@INPROCEEDINGS{BDPS03,
AUTHOR = {J.-C. Bermond and O. DeRivoyre and S. Pérennes and
M. Syska},
BOOKTITLE = {Conference ALGOTEL2003, Banyuls, May 2003},
TITLE = {Groupage par tubes},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {169--174},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDPS03.pdf}
}
@INPROCEEDINGS{BDH+03,
AUTHOR = {J.-C. Bermond and O. Delmas and F. Havet and
M. Montassier and S. Pérennes},
BOOKTITLE = {Conference ALGOTEL2003, Banyuls, May 2003},
TITLE = {Réseaux de télécommunications minimaux embarqués
tolérants},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {27--32},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDH+03.pdf}
}
@INPROCEEDINGS{BDF03,
AUTHOR = {P. Berthomé and M. Diallo and A. Ferreira},
BOOKTITLE = {Proceedings of WG'03},
TITLE = {Generalized Parametric Multi-Terminal Flows Problem},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {71--80},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2880}
}
@INPROCEEDINGS{BhFe03,
AUTHOR = {S. Bhadra and A. Ferreira},
BOOKTITLE = {Proceedings of Adhoc-Now'03},
TITLE = {Complexity of Connected Components in Evolving Graphs
and the Computation of Multicast Trees in Dynamic Networks},
YEAR = {2003},
ADDRESS = {Montreal},
EDITOR = {S. Pierre and M. Barbeau and E. Kranakis},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {259--270},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2865}
}
@INPROCEEDINGS{BCL+03,
AUTHOR = {M. Bouklit and D. Coudert and J-F. Lalande and C. Paul and
H. Rivano},
BOOKTITLE = {SIROCCO 10},
TITLE = {Approximate multicommodity flow for WDM networks design},
YEAR = {2003},
ADDRESS = {Umea, Sweden},
EDITOR = {J. Sibeyn},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {17},
OPTORGANIZATION = {},
PAGES = {43--56},
PUBLISHER = {Carleton Scientific},
SERIES = {Proceedings in Informatics},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLPR-SIROCCO03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLPR-SIROCCO03.ps.gz},
ABSTRACT = {The design of WDM optical networks is an issue for
telecom operators since the spreading of this technology will not
occur unless enough performance guarantees are provided. Motivated by
the quest for efficient algorithms for the Routing and Wavelength
Assignment problem (RWA), we address approximations of the fractional
multicommodity flow problem which is the central part of a complex
randomized rounding algorithm for the integral problem. Through the
use of dynamic shortest path computations and other combinatorial
approaches, we improve on the best known algorithm. We also provide
directions for further improvements.}
}
@INPROCEEDINGS{BCLR03,
AUTHOR = {M. Bouklit and D. Coudert and J-F. Lalande and H. Rivano},
BOOKTITLE = {AlgoTel'03},
TITLE = {Approximation combinatoire de multiflot fractionnaire :
améliorations},
YEAR = {2003},
ADDRESS = {Banyuls-sur-mer, France},
OPTEDITOR = {},
MONTH = {mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLR-AlgoTel03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCLR-AlgoTel03.ps.gz},
ABSTRACT = {Motiv\'e par la recherche d'algorithmes performants de
dimensionnement de r\'eseaux optiques WDM, nous consid\'erons les
$(1+\epsilon)$-approximations du calcul de multiflot fractionnaire.
Nous proposons des am\'eliorations d'un algorithme de la
litt\'erature en utilisant des calculs de plus courts chemins
dynamiques, \'eventuellement sp\'ecialis\'e au cas du routage optique
dans les r\'eseaux WDM multifibres sans conversion.}
}
@INPROCEEDINGS{BFJ03b,
AUTHOR = {B. Bui-Xuan and A. Ferreira and A. Jarry},
BOOKTITLE = {Proceedings of WiOpt'03 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks},
TITLE = {Evolving graphs and least cost journeys in dynamic
networks},
YEAR = {2003},
ADDRESS = {Sophia Antipolis},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {141--150},
PUBLISHER = {INRIA Press},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BBH+03,
AUTHOR = {H.-J. Böckenhauer and D. Bongartz and J. Hromkovic and
R. Klasing and G. Proietti and S. Seibert and W. Unger},
BOOKTITLE = {Proc. 5th Italian Conference on Algorithms and Complexity ( CIAC 2003)},
TITLE = {On $k$-Edge-Connectivity Problems with Sharpened
Triangle Inequality (Extended Abstract)},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {189--200},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2653}
}
@INPROCEEDINGS{CLM03a,
AUTHOR = {A. Ciaffaglione and L. Liquori and M. Miculan},
BOOKTITLE = {LPAR, International Conference on Logic for Programming Artificial Intelligence and Reasoning},
TITLE = {Imperative Object-Based Calculi in Co-inductive Type
Theories},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {59--77},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2850},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/lpar-03.pdf}
}
@INPROCEEDINGS{CLM03b,
AUTHOR = {A. Ciaffaglione and L. Liquori and M. Miculan},
BOOKTITLE = {MERLIN, International Workshop on Mechanized Reasoning about Languages with Variable Binding},
TITLE = {Reasoning on an imperative object-based calculus in
Higher Order Abstract Syntax},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/merlin-03.pdf}
}
@INPROCEEDINGS{CLW03,
AUTHOR = {H. Cirstea and L. Liquori and B. Wack},
BOOKTITLE = {TYPES, International Workshop on Types for Proof and Programs},
TITLE = {Rewriting Calculus with Fixpoints: Untyped and
First-order Systems},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {147--161},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {3085},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/types-03.ps.gz}
}
@INPROCEEDINGS{CHRV03,
AUTHOR = {A. Clementi and G. Huiban and G. Rossi and Y. Verhoeven},
BOOKTITLE = {Parallel and Distributed Processing Symposium (IPDPS)},
TITLE = {On the approximation ratio of the MST based heuristic
for the energy-efficient broadcast problem in static ad-hoc radio
networks},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8},
PUBLISHER = {IEEE Computer Society Press},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.ipdps.org/ipdps2003/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/CHRV03.pdf},
ABSTRACT = {We present a technique to evaluate the approximation
ratio on random instances of the Minimum Energy Broadcast Problem in
Ad-Hoc Radio Networks which is known to be NP-hard and approximable
within 12. Our technique relies on polynomial-time computable lower
bound on the optimal cost of any instance. The main result of this
paper is that the approximation ratio has never achieved a value
greater than 6.4. Furthermore, the worst values of this ratio are
achieved for small network sizes. We also provide a clear geometrical
motivation of such good approximation results.}
}
@INPROCEEDINGS{CRR03,
AUTHOR = {D. Coudert and H. Rivano and X. Roche},
BOOKTITLE = {WAOA 03},
TITLE = {A combinatorial approximation algorithm for the
multicommodity flow problem},
YEAR = {2003},
ADDRESS = {Budapest, Hungary},
EDITOR = {K. Jansen and R. Solis-Oba},
MONTH = {September},
OPTNOTE = {},
NUMBER = {2909},
OPTORGANIZATION = {},
PAGES = {256--259},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CRR-WAOA03.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CRR-WAOA03.ps.gz},
ABSTRACT = {This work is motivated by the need for approximation
algorithms for the integral multicommodity flow problem which arise
in numerous optimization scenarios, including the design of
telecommunication networks. We improve on one of the most efficient
known combinatorial approximation algorithm for fractional
multicommodity flow by using an incremental approach. This approach
is validated by experimental results, which show a significant
speed-up.}
}
@INPROCEEDINGS{DaMu03,
AUTHOR = {O. Dalle and P. Mussi},
BOOKTITLE = {NMSC System Simulation Workshop},
TITLE = {Cooperative Software Development and Computational
Resource Sharing},
YEAR = {2003},
ADDRESS = {ESTEC, Noordwijk, The Netherlands},
OPTEDITOR = {},
MONTH = {March},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {European Space Agency},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{FPR+03b,
AUTHOR = {A. Ferreira and S. Perennes and A.W. Richa and H. Rivano and
Stier Moses, N.},
BOOKTITLE = {Telecommunications, 2003. ICT 2003. 10th International Conference on},
TITLE = {Models, complexity and algorithms for the design of
multifiber WDM networks},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {23 Feb.-1 March},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {12--18},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {1},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs03.pdf},
ABSTRACT = {We study multifiber optical networks with wavelength
division multiplexing (WDM). Assuming that the lightpaths use the
same wavelength from source to destination, we extend the definition
of the well-known wavelength assignment problem (WAP), to the case
where there are k fibers per link, and w wavelengths per fiber are
available: This generalization is called the (k,w)-WAP. We develop a
new model for the (k,w)-WAP, based on conflict hypergraphs: conflict
hypergraphs more accurately capture the lightpath interdependencies,
generalizing the conflict graphs used for single-fiber networks. By
relating the (k,w)-WAP with the hypergraph coloring problem, we prove
that the former is NP-complete, and present further results with
respect to the complexity of that problem. We consider the two
natural optimization problems that arise from the (k,w)-WAP: the
problem of minimizing k given w, and that of minimizing w given k. We
develop and analyze the practical performances of two methodologies
based on hypergraph coloring, one for each of the two optimization
problems, on existing backbone networks in Europe and in the USA. The
first methodology relies on two heuristics based on a randomized
approximation algorithm and the second consists on an integer
programming formulation.}
}
@INPROCEEDINGS{GNTD03,
AUTHOR = {F. Giroire and A. Nucci and N. Taft and C. Diot},
BOOKTITLE = {Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM)},
TITLE = {Increasing the Robustness of IP Backbones in the Absence
of Optical Level Protection},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.sprintlabs.com/People/anucci/Papers/Infocom03.pdf},
PDF = {http://www-sop.inria.fr/members/Frederic.Giroire/publis/GNTD03.pdf},
ABSTRACT = {There are two fundamental technology issues that
challenge the robustness of IP backbones. First, SONET protection is
gradually being removed because of its high cost (while SONET framing
is kept for failure detection purposes). Protection and restoration
are provided by the IP layer that operates directly over a DWDM
infrastructure. Second, ISPs are systematically forced to use the
shortest distance path between two Points of Presence in order to
meet their promised SLAs. In this context, IP backbones are extremely
vulnerable to fiber cuts that can bring down a significant fraction
of the IP routes. We propose two solutions (an ILP model and a
heuristic algorithm) to optimally map a given IP topology onto a
fiber infrastructure. The version of the mapping problem that we
address incorporates a number of real constraints and requirements
faced by carriers today. The optimal mapping maximizes the robustness
of the network while maintaining the ISP's SLA delay requirements. In
addition, our heuristic takes into consideration constraints such as
a shortage of wavelengths and priorities among POPs and routes. The
heuristic is evaluated on the Sprint backbone network. We illustrate
the tradeoffs between the many requirements.}
}
@INPROCEEDINGS{GM03,
AUTHOR = {C. Gomes and Robson Mateus, G.},
BOOKTITLE = {SPG},
TITLE = {Alocação de Caminhos Comutatos por Rótulo em Redes
Multiplexadas por Comprimento de Onda},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
SCHOOL = {Minas Gerais Federal University, MG}
}
@INPROCEEDINGS{JaLa03,
AUTHOR = {A. Jarry and A. Laugier},
BOOKTITLE = {ROADEF 2003},
TITLE = {Graphes 2-connexes à diamètre donné},
YEAR = {2003},
ADDRESS = {Avignon, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
NUMBER = {5},
OPTORGANIZATION = {},
PAGES = {102--104},
PUBLISHER = {Université d'Avignon et des Pays de Vaucluse},
SERIES = {Proceedings in Informatics},
OPTVOLUME = {}
}
@INPROCEEDINGS{LPS03,
AUTHOR = {J.-F. Lalande and S. Pérennes and M. Syska},
BOOKTITLE = {ROADEF 2003},
TITLE = {Groupage dans les réseaux dorsaux WDM},
YEAR = {2003},
ADDRESS = {Avignon, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
NUMBER = {5},
OPTORGANIZATION = {},
PAGES = {254--255},
PUBLISHER = {Université d'Avignon et des Pays de Vaucluse},
SERIES = {Proceedings in Informatics},
OPTVOLUME = {}
}
@INPROCEEDINGS{LaPe03,
AUTHOR = {A. Laugier and S. Petat},
BOOKTITLE = {Proc. of International Network Optimization Conference},
TITLE = {Network Design and b-matching},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {374--379},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Publications/LaPe03.ps}
}
@INPROCEEDINGS{TGCG+03,
AUTHOR = {E. Trajano and D. Guigue and E. Costa and C. Gomes and
H. Almeida and K. Silva and N. Cavalcanti},
BOOKTITLE = {IX SBCM},
TITLE = {SOS - A Tool for the Automatic Segmentation of Musical
Flows},
YEAR = {2003},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
SCHOOL = {Campinas, SP}
}
@INPROCEEDINGS{AGT02b,
AUTHOR = {E. Altman and J. Galtier and C. Touati},
BOOKTITLE = {Proc. of IEEE GlobeCom'02},
TITLE = {Fair power and transmission rate control in wireless
networks},
YEAR = {2002},
ADDRESS = {Taipei, Taiwan},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{AGT02c,
AUTHOR = {E. Altman and J. Galtier and C. Touati},
BOOKTITLE = {Proc. of 10th Int. Symp. on Dynamic Games and Application -- Networking Games & Resource Allocation Workshop (NGRA-2002)},
TITLE = {Semi-Definite Programming Approach for Bandwidth
Allocation and Routing in Networks},
YEAR = {2002},
ADDRESS = {Petrozavodsk, Russia},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {Altman and Mazaloz},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{AGT02a,
AUTHOR = {E. Altman and J. Galtier and C. Touati},
BOOKTITLE = {IASTED International Conference on Networks, Parallel and Distributed Processing, and Applications (NPDPA 2002)},
TITLE = {Utility Based Fair Bandwidth Allocation},
YEAR = {2002},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BCP02,
AUTHOR = {J.-C. Bermond and S. Choplin and S. Pérennes},
BOOKTITLE = {9th International Colloquium on Structural Information and Communication Complexity (SIROCCO'02)},
TITLE = {Hierarchical Ring Network Design},
YEAR = {2002},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1--16},
PUBLISHER = {Carleton Scientific},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BBH+02,
AUTHOR = {H.-J. Böckenhauer and D. Bongartz and J. Hromkovic and
R. Klasing and G. Proietti and S. Seibert and W. Unger},
BOOKTITLE = {Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002)},
TITLE = {On the hardness of constructing minimal 2-connected
spanning subgraphs in complete graphs with sharpened triangle
inequality},
YEAR = {2002},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {59--70},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2556}
}
@INPROCEEDINGS{CoRi02b,
AUTHOR = {D. Coudert and H. Rivano},
BOOKTITLE = {Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE},
TITLE = {Lightpath assignment for multifibers WDM networks with
wavelength translators},
YEAR = {2002},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {17-21 Nov.},
NOTE = {OPNT-01-5},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {2686--2690vol.3},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {3},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CR-Globecom02.pdf},
ABSTRACT = {We consider the problem of finding a lightpath
assignment for a given set of communication requests on a multifiber
WDM optical network with wavelength translators. Given such a network
and w, the number of wavelengths available on each fiber, k, the
number of fibers per link, and c, the number of partial wavelength
translations available on each node, our problem stands for deciding
whether it is possible to find a w-lightpath for each request in the
set such that there is no link carrying more that k lightpaths using
the same wavelength nor node where more than c wavelength
translations take place. Our main theoretical result is the writing
of this problem as a particular instance of integral multicommodity
flow, hence integrating routing and wavelength assignment in the same
model. We then provide three heuristics mainly based upon randomized
rounding of fractional multicommodity flow and enhancements that are
three different answers to the trade-off between efficiency and
tightness of approximation, and discuss their practical performances
on both theoretical and real-world instances.}
}
@INPROCEEDINGS{CoRi02,
AUTHOR = {D. Coudert and H. Rivano},
BOOKTITLE = {AlgoTel'02},
TITLE = {Routage optique dans les réseaux WDM multifibres avec
conversion partielle.},
YEAR = {2002},
ADDRESS = {Mèze, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {17-24},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hipercom.inria.fr/algotel2002/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CR-AlgoTel02.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CR-AlgoTel02.ps.gz},
ABSTRACT = {Nous consid\'erons le probl\`eme du routage optique d'un
ensemble donn\'e de requ\^etes de communications dans un r\'eseau
\wdm multifibres avec conversion partielle. \'Etant donn\'e un tel
r\'eseau disposant de $w$ longueurs d'onde par fibre, $k$ fibres par
lien et $c$ conversions possibles par \noeud du r\'eseau, le
probl\`eme revient \`a d\'ecider s'il est possible de trouver un
chemin $w$-color\'e pour chaque requ\^ete, de sorte qu'au plus $k$
chemins utilisent une m\^eme longueur d'onde sur un m\^eme lien du
r\'eseau et qu'aucun \noeud n'op\`ere plus de $c$ conversions. Notre
r\'esultat principal r\'eside dans l'\'ecriture de ce probl\`eme sous
la forme d'une instance particuli\`ere de multiflot entier,
int\'egrant dans un m\^eme mod\`ele le routage et l'affectation de
longueurs d'onde. Nous fournissons ensuite trois heuristiques
bas\'ees sur l'arrondi al\'eatoire de multiflots fractionnaires, qui
sont trois r\'eponses diff\'erentes au compromis
efficacit\'e/pr\'ecision des approximations. Nous les validons en
comparant leur performances sur des instances th\'eoriques ou issue
du monde r\'eel.}
}
@INPROCEEDINGS{Fer02b,
AUTHOR = {A. Ferreira},
BOOKTITLE = {4$^{\rm e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2002)},
TITLE = {On models and algorithms for dynamic communication
networks: The case for evolving graphs},
YEAR = {2002},
ADDRESS = {Mèze, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{FPR+02,
AUTHOR = {A. Ferreira and S. Pérennes and A. Richa and H. Rivano and
N. Stier},
BOOKTITLE = {AlgoTel'02},
TITLE = {On the design of multifiber WDM networks},
YEAR = {2002},
ADDRESS = {Mèze, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {25--32},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hipercom.inria.fr/algotel2002/},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs02.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fprrs02.ps.gz},
ABSTRACT = {In this paper, we address multifiber optical networks
with Wavelength Division Multiplexing (\wdm). Assuming that the
lightpaths use the same wavelength from source to destination, we
extend the definition of the well-known Wavelength Assignment Problem
(\wap) to the case where there are $k$ fibers per link, and $w$
wavelengths per fiber are available. This generalization is called
the $(k,w)$-\wap. We develop a new model for the $(k,w)$-\wap based
on \emph{ conflict hypergraphs}. Conflict hypergraphs accurately
capture the lightpath interdependencies, generalizing the conflict
graphs used for single-fiber networks. By relating the $(k,w)$-\wap
with the hypergraph coloring problem, we prove that the former is
\npc, and present further results with respect to the complexity of
that problem. We consider the two natural optimization problems that
arise from the $(k,w)$-\wap : the problem of minimizing $k$ given
$w$, and that of minimizing $w$ given $k$. We develop and analyze the
practical performances of two methodologies based on hypergraph
coloring, one for each of the two optimization problems, on existing
backbone networks in Europe and in the USA. The first methodology
relies on an integer programming formulation, and the second consists
of a heuristic based on a randomized algorithm.}
}
@INPROCEEDINGS{Hav02b,
AUTHOR = {F. Havet},
BOOKTITLE = {Proc. of SIROCCO'02},
TITLE = {Design of Fault Tolerant Satellite Networks with
Priorities via Selectors},
YEAR = {2002},
ADDRESS = {Andros, Greece},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {165--180},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Hav02c,
AUTHOR = {F. Havet},
BOOKTITLE = {$4^{e}$ rencontres francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'02)},
TITLE = {Robustness of a Routing Tree for the Push Tree Problem},
YEAR = {2002},
ADDRESS = {Mèze, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {81--86},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{HuPeSy02,
AUTHOR = {G. Huiban and S. Pérennes and M. Syska},
BOOKTITLE = {IEEE ICC},
TITLE = {Traffic Grooming in WDM Networks with Multi-Layer
Switches},
YEAR = {2002},
ADDRESS = {New-York},
OPTEDITOR = {},
MONTH = {April},
NOTE = {CD-Rom},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Jar02a,
AUTHOR = {A. Jarry},
BOOKTITLE = {International Colloquium on Structural Information and Communi cation Complexity -- SIROCCO},
TITLE = {Disjoint Paths in Symmetric Digraphs},
YEAR = {2002},
ADDRESS = {Andros, Greece},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {211--222},
PUBLISHER = {Carleton},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Mus02,
AUTHOR = {P. Mussi},
BOOKTITLE = {AI, Simulation & Planning in High Autonomy Systems},
TITLE = {Tuning Car Following Algorithms for Realistic Behaviour},
YEAR = {2002},
ADDRESS = {Lisbon, Portugal},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {281--284},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR1957563,
AUTHOR = {B. Reed and B. Sudakov},
BOOKTITLE = {Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002)},
TITLE = {List colouring of graphs with at most $(2-o(1))\chi$
vertices},
YEAR = {2002},
ADDRESS = {Beijing},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {587--603},
PUBLISHER = {Higher Ed. Press},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BC+01a,
AUTHOR = {J.-C. Bermond and L. Chacon and D. Coudert and
F. Tillerot},
BOOKTITLE = {ACM Symposium on Parallel Algorithms and Architectures -- SPAA},
TITLE = {A Note on Cycle Covering},
YEAR = {2001},
ADDRESS = {Crete island, Greece},
OPTEDITOR = {},
MONTH = {4-6 July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {310-311},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCT-SPAA01.ps.gz},
ABSTRACT = {This study considers the design of a survivable WDM
network based on covering the initial network with sub-networks,
which are protected independently from each other.}
}
@INPROCEEDINGS{BC+01b,
AUTHOR = {J.-C. Bermond and L. Chacon and D. Coudert and
F. Tillerot},
BOOKTITLE = {International Colloquium on Structural Information and Communication Complexity -- SIROCCO},
TITLE = {Cycle Covering},
YEAR = {2001},
ADDRESS = {Vall de Nuria, Spain},
OPTEDITOR = {},
MONTH = {27-29 June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {21-34},
PUBLISHER = {Carleton Scientific},
SERIES = {Proceedings in Informatics 11},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCT-SIROCCO01.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/BCCT-SIROCCO01.ps.gz},
ABSTRACT = {This paper considers the design of a survivable WDM
network based on covering the initial network with sub-networks,
which are protected independently from each other. We focus on the
case where the optical WDM network is a ring, there are requests
between any pair of vertices and the covering is done with small
cycles. This problem can be modelled as follows: Find a covering of
the edges of a logical graph $I$ (here the complete graph $K_n$) by
subgraphs $I_k$ of a certain kind (here cycles $C_k$ of length $k$),
such that, for each $I_k$, there exists in the physical graph $G$
(here $C_n$) a disjoint routing of the edges of $I_k$. The aim is to
minimize the number of subgraphs $I_k$ in the covering. We give
optimal solutions for that problem.}
}
@INPROCEEDINGS{BHT01,
AUTHOR = {J.-C. Bermond and F. Havet and D. Tóth},
BOOKTITLE = {$3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001)},
TITLE = {Design of fault tolerant on board networks with
priorities},
YEAR = {2001},
ADDRESS = {Saint-Jean-de-Luz , France},
OPTEDITOR = {},
MONTH = {Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {95--98},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BLM01,
AUTHOR = {S. Bertrand and A. Laugier and P. Mahey},
BOOKTITLE = {$3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001)},
TITLE = {Routing flows in networks with heterogenous protocols
and path-dependent edge costs},
YEAR = {2001},
ADDRESS = {Saint-Jean-de-Luz , France},
OPTEDITOR = {},
MONTH = {Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {55--60},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{CFF01,
AUTHOR = {A. Caminada and A. Ferreira and L. Floriani},
BOOKTITLE = {Proceedings of GECCO 2001 Workshop on Real-life Evolutionary Design Optimisation},
TITLE = {Principal Component Analysis for data volume reduction
in experimental analysis of heuristics},
YEAR = {2001},
ADDRESS = {San Francisco (USA)},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{CFKPR01,
AUTHOR = {I. Caragianis and A. Ferreira and C. Kaklamanis and
S. Pérennes and H. Rivano},
BOOKTITLE = {Proceedings of the 28th ICALP},
TITLE = {Fractional path coloring on bounded degree trees},
YEAR = {2001},
ADDRESS = {Crete, Greece},
EDITOR = {F. Orejas and P. G. Spirakis and van Leeuwen, J.},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {732--743},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2076},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/cfk01.pdf},
ABSTRACT = {This paper addresses the natural relaxation of the path
coloring problem, in which one needs to color directed paths on a
symmetric directed graph with a minimum number of colors, in such a
way that paths using the same arc of the graph have different colors.
This classic combinatorial problem finds applications in the
minimization of the number of wavelengths in wavelength division
multiplexing (wdm) all-optical networks.}
}
@INPROCEEDINGS{CFK+01b,
AUTHOR = {I. Caragiannis and A. Ferreira and C. Kaklamanis and
S. Pérennes and P. Persiano and H. Rivano},
BOOKTITLE = {27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01)},
TITLE = {Approximate Constrained Bipartite Edge Coloring},
YEAR = {2001},
ADDRESS = {Boltenhagen, Germany},
EDITOR = {A. Branstädt, V.B. Le},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {21--31},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2204},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/cfk01b.pdf},
ABSTRACT = {We study the following Constrained Bipartite Edge
Coloring (CBEC) problem: We are given a bipartite graph G(U,V,E) of
maximum degree l with n vertices, in which some of the edges have
been legally colored with c colors. We wish to complete the coloring
of the edges of G minimizing the total number of colors used. The
problem has been proved to be NP-hard event for bipartite graphs of
maximum degree three [5].}
}
@INPROCEEDINGS{Cho01,
AUTHOR = {S. Choplin},
BOOKTITLE = {International Conference on Networking, ICN01},
TITLE = {Virtual Path Layout in ATM Path with given hop count},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {527--537},
PUBLISHER = {Springer},
SERIES = {LNCS},
VOLUME = {2094, Part II}
}
@INPROCEEDINGS{CKL01a,
AUTHOR = {H. Cirstea and C. Kirchner and L. Liquori},
BOOKTITLE = {RTA, International Conference on Rewriting Techniques and Applications},
TITLE = {Matching Power},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {77--92},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2051},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/rta-01.ps.gz}
}
@INPROCEEDINGS{CKL01b,
AUTHOR = {H. Cirstea and C. Kirchner and L. Liquori},
BOOKTITLE = {FoSSaCS, International Conference on Foundations of Software Science and Computation Structures},
TITLE = {The Rho Cube},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {168--183},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {2030},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fossacs-01.ps.gz}
}
@INPROCEEDINGS{CoGr01,
AUTHOR = {M. Cosnard and L. Grigori},
BOOKTITLE = {15th ACM International Conference on Supercomputing (ICS'01)},
TITLE = {A Parallel Algorithm for Sparse Symbolic LU
Factorization without Pivoting on Out of Core Matrices},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Cou01,
AUTHOR = {D. Coudert},
BOOKTITLE = {Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications -- AlgoTel},
TITLE = {Chemins disjoints de poids minimum pour la sécurisation
de réseaux de télécommunications},
YEAR = {2001},
ADDRESS = {St-Jean de Luz, France},
OPTEDITOR = {},
MONTH = {28-30 Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {47-53},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/Cou-AlgoTel01.ps.gz},
ABSTRACT = {Cette \'etude s'int\'eresse \`a la planification de
r\'eseaux WDM tol\'erants aux pannes. Nous cherchons \`a \'etablir,
pour chaque couple de n{\oe}uds du r\'eseau, deux chemins de
communication disjoints, l'un \'etant r\'eserv\'e \`a la protection
de l'autre. Pour un r\'eseau \`a $n$ n{\oe}uds et $m$ liens de
communications, nous donnons un algorithme en $O(n(m+n\log n))$,
permettant de calculer depuis un n{\oe}ud donn\'e et vers chacun des
autres n{\oe}uds deux chemins arc-disjoints dont la somme des poids
est minimale. Ceci am\'eliore la complexit\'e des solutions bas\'ees
sur les algorithmes de flot de poids minimum, qui est en temps
$O(m(m+n\log n)\log n)$ pour un seul couple de sommets.}
}
@INPROCEEDINGS{CM01,
AUTHOR = {D. Coudert and X. Muñoz},
BOOKTITLE = {Broad band optical fiber communications technology -- BBOFCT},
TITLE = {How Graph Theory can help Communications Engineering},
YEAR = {2001},
ADDRESS = {Jalgaon, India},
EDITOR = { D.K.Gautam},
MONTH = {December},
NOTE = {Invited paper},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {47-61},
PUBLISHER = {Nirtali Prakashan},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CM-BBOFCT01.ps.gz},
ABSTRACT = {We give an overview of different aspects of graph theory
which can be applied in communication engineering, not trying to
present immediate results to be applied neither a complete survey of
results, but to give a flavor of how graph theory can help this
field. We deal in this paper with network topologies, resource
competition, state transition diagrams and specific models for
optical networks.}
}
@INPROCEEDINGS{CeHa01,
AUTHOR = {S. Céroi and F. Havet},
BOOKTITLE = {Electronic Notes in Discrete Mathematics},
TITLE = {Trees with three leaves are (n + 1)-unavoidable},
YEAR = {2001},
OPTADDRESS = {},
EDITOR = {Jayme Szwarcfiter and Siang Song},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {Elsevier Science Publishers},
OPTSERIES = {},
VOLUME = {7}
}
@INPROCEEDINGS{DRR+01,
AUTHOR = {O. Dalle and J. Radzik and C. Rigal and F. Rodière and
C. Saroléa},
BOOKTITLE = {19th International Communications Satellite Systems Conference (ICSSC)},
TITLE = {ASIMUT: An Environment for the Simulation of Multi-Media
Satellite Telecommunication Networks},
YEAR = {2001},
ADDRESS = {Toulouse, France},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {AIAA},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR2154484,
AUTHOR = {H. Everett and de Figueiredo, C. M. H. and S. Klein and
B. Reed},
BOOKTITLE = {Comb01---Euroconference on Combinatorics, Graph Theory and Applications},
TITLE = {Bull-reducible Berge graphs are perfect},
YEAR = {2001},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {3 pp. (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {10}
}
@INPROCEEDINGS{MR1905628,
AUTHOR = {G. Fertin and A. Raspaud and B. Reed},
BOOKTITLE = {Graph-theoretic concepts in computer science (Boltenhagen, 2001)},
TITLE = {On star coloring of graphs},
YEAR = {2001},
ADDRESS = {Berlin},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {140--153},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {2204}
}
@INPROCEEDINGS{Gal01b,
AUTHOR = {J. Galtier},
BOOKTITLE = {$3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001)},
TITLE = {Semi-Definite Programming as a Simple Extension to
Linear Programming: Convex Optimization with Queueing, Equity and
Other Telecom Functionals},
YEAR = {2001},
ADDRESS = {Saint-Jean-de-Luz},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {21--28},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GaOl01,
AUTHOR = {J. Galtier and A. Oliveira},
BOOKTITLE = {43rd conference of the Canadian Operations Research Society},
TITLE = {A proposal to study satellite constellation routing via
classical linear programming methods},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GPPR01,
AUTHOR = {C. Gavoille and D. Peleg and S. Pérennes and R. Raz},
BOOKTITLE = {SODA'01},
TITLE = {Distance Labeling in Graphs},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {210--219},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GD01,
AUTHOR = {C. Gomes and A. H. Dominguez},
BOOKTITLE = {Anais XI Encontro de Iniciação Cientìfica da Universidade Federal de Alagoas},
TITLE = {Modelagem e Implementação do módulo tutor do ambiente
AVA-TA@ead},
YEAR = {2001},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
SCHOOL = {Alagoas Federal University, AL}
}
@INPROCEEDINGS{HaWe01,
AUTHOR = {F. Havet and M. Wennink},
BOOKTITLE = {SPAA'01: 13th ACM Symposium on Parallel Algorithms and Architectures},
TITLE = {The Push Tree Problem},
YEAR = {2001},
ADDRESS = {Crète , Grèce},
OPTEDITOR = {},
MONTH = {Juillet},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {318--319},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR2154509,
AUTHOR = {C. McDiarmid and B. Reed},
BOOKTITLE = {Comb01---Euroconference on Combinatorics, Graph Theory and Applications},
TITLE = {Channel assignment on nearly bipartite and bounded
treewidth graphs},
YEAR = {2001},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4 pp. (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {10}
}
@INPROCEEDINGS{MR2120347,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing},
TITLE = {Colouring graphs when the number of colours is nearly
the maximum degree},
YEAR = {2001},
ADDRESS = {New York},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {462--470 (electronic)},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR1958432,
AUTHOR = {D. Rautenbach and B. Reed},
BOOKTITLE = {Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001)},
TITLE = {Approximately covering by cycles in planar graphs},
YEAR = {2001},
ADDRESS = {Philadelphia, PA},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {402--406},
PUBLISHER = {SIAM},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Riv01,
AUTHOR = {H. Rivano},
BOOKTITLE = {AlgoTel'01 - $3^{e}$ Rencontres Françaises sur les Aspects Algorithmiques des Télécommunications},
TITLE = {Planification de réseaux optiques WDM k-fibres},
YEAR = {2001},
ADDRESS = {Saint-Jean-de-Luz, France},
OPTEDITOR = {},
MONTH = {mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {41--46},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://ares.insa-lyon.fr/tarot/jsp/site/Portal.jsp?page_id=14},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/riv01.pdf},
ABSTRACT = {Cet article propose une modélisation en termes
d'hypergraphe du problème d'affectation de longueurs d'onde à des
chemins dans un réseau \wdm $k$-fibres. La contrainte classique
rencontrée dans les réseaux \wdm change de nature lorsque plusieurs
fibres connectent physiquement deux noeuds du réseau. Nous montrons
l'équivalence entre ce problème et la coloration $k${\em -tolérante}
de {\em l'hypergraphe des conflits} des chemins. Nous exploitons
ensuite deux résultats d'algorithmique aléatoire de la littérature
pour donner une première approximation du dimensionnement des réseaux
$k$-fibres.}
}
@INPROCEEDINGS{ABJ+00a,
AUTHOR = {E. Altman and E. Baçsar and T. Jiménez and N. Shimkin},
BOOKTITLE = {IEEE Infocom 2000},
TITLE = {Competitive Routing in Networks with Polynomial Cost},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {mars},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1586--1593},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{ACPR00,
AUTHOR = {A. Andreev and A. Clementi and P. Penna and J. Rolim},
BOOKTITLE = {Electronic Colloquium on Computational Complexity},
TITLE = {Parallel Read Operations Without Memory Contention},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {TR00-53}
}
@INPROCEEDINGS{BCF+00,
AUTHOR = {B. Beauquier and K.S. Candan and A. Ferreira and
S. Pérennes and A. Sen},
BOOKTITLE = {Proc. of IFIP/TC6 Networking 2000 Conference},
TITLE = {On shortest path problems with ``non-Markovian'' link
contribution to path lengths},
YEAR = {2000},
ADDRESS = {Paris, France},
OPTEDITOR = {},
MONTH = {mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BeDa00,
AUTHOR = {B. Beauquier and E. Darrot},
BOOKTITLE = {Actes des $1^{res}$ Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
TITLE = {Arbitrary size Waksman networks and their vulnerability},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {World Scientific},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BFGP00a,
AUTHOR = {P. Bergé and A. Ferreira and J. Galtier and S. Petit},
BOOKTITLE = {$2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000)},
TITLE = {A probabilistic study of inter-satellite links load in
polar orbit satellite constellations},
YEAR = {2000},
ADDRESS = {La Rochelle, France},
OPTEDITOR = {},
MONTH = {Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {137--142},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BBK+00,
AUTHOR = {J.-C. Bermond and A. Bonnecaze and T. Kodate and
S. Perennes and P. Sole},
BOOKTITLE = {Proc. Conference IPDPS 2000, Cancun, Mexico,, May 2000},
TITLE = {Broadcasting in hypercubes in the circuit switched model},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {21-26},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBK+00.pdf}
}
@INPROCEEDINGS{BC+00,
AUTHOR = {J-C. Bermond and L. Chacon and D. Coudert and
F. Tillerot},
BOOKTITLE = {2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00)},
TITLE = {Conception d'un réseau WDM protégé par sous-réseaux},
YEAR = {2000},
ADDRESS = {La Rochelle, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {83-88},
PUBLISHER = {INRIA},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://hal.inria.fr/inria-00429292},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Publications/BC+00.pdf},
ABSTRACT = {Nous proposons une modélisation de la construction d'un
réseau WDM protégé comme l'extension du problème classique de
couverture des arêtes d'un graphe. Un ensemble de résultats est donné
pour la réalisation de l'instance All-to-All sur un réseau en anneau.}
}
@INPROCEEDINGS{BCP00,
AUTHOR = {G. Bongiovanni and A. Clementi and P. Penna},
BOOKTITLE = {Proc. of ARACNE-00, International Workshop on Approximation and Randomized Algorithms in Communication Networks},
TITLE = {A Note on Parallel Read Operations on Large Public
Databases},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {123--133},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {Carleton Scientific Press}
}
@INPROCEEDINGS{CFP+00,
AUTHOR = {A. Clementi and A. Ferreira and P. Penna and S. Pérennes and
R. Silvestri},
BOOKTITLE = {Proc. of ESA-00, 8th Annual European Symposium on Algorithms},
TITLE = {The Minimum Range Assignment Problem on Linear Radio
Networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1879},
OPTORGANIZATION = {},
PAGES = {143--154},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {LNCS}
}
@INPROCEEDINGS{CPS00b,
AUTHOR = {A. Clementi and P. Penna and R. Silvestri},
BOOKTITLE = {Electronic Colloquium on Computational Complexity},
TITLE = {On The Power Assignment Problem in Radio Networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {TR00-54}
}
@INPROCEEDINGS{CPS00a,
AUTHOR = {A. Clementi and P. Penna and R. Silvestri},
BOOKTITLE = {Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science},
TITLE = {The Power Range Assignment Problem in Radio Networks on
the Plane},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1770},
OPTORGANIZATION = {},
PAGES = {651--660},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {LNCS}
}
@INPROCEEDINGS{CoLi00b,
AUTHOR = {D. Colnet and L. Liquori},
BOOKTITLE = {TOOLS, International Conference on Technology of Object-Oriented Languages and Systems},
TITLE = {Match-O, a Statically Safe (?) Dialect of Eiffel},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {190--201},
PUBLISHER = {IEEE Computer Society},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/tools-00.ps.gz}
}
@INPROCEEDINGS{CFP00,
AUTHOR = {D. Coudert and A. Ferreira and S. Perennes},
BOOKTITLE = {IEEE International Parallel and Distributed Processing Symposium},
TITLE = {De Bruijn Isomorphisms and Free Space Optical Networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {769-774},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-IPDPS00.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-IPDPS00.ps.gz},
ABSTRACT = {The de Bruijn digraph $B(d,D)$ has degree $d$, diameter
$D$, $d^D$ vertices and $d^{D+1}$ arcs. It is usually defined by
words of size $D$ on an alphabet of cardinality $d$, through a cyclic
left shift permutation on the words, after which the rightmost symbol
is changed. In this paper, we show that any digraph defined on words
of a given size, through an {\em arbitrary} permutation on the
alphabet {\bf and} an {\em arbitrary} permutation on the word
indices, is isomorphic to the de Bruijn digraph, provided that this
latter permutation is {\em cyclic}. We use this result to improve
from $O\left(d^{D+1}\right)$ to $\Theta\left(\sqrt{d^{D+1}}\right)$
the number of lenses required for the implementation of $B(d,D)$ by
the Optical Transpose Interconnection System proposed by Marsden {\em
et al.} (Optics Letters 18(13):1083-1085, July 1993).}
}
@INPROCEEDINGS{CGP00,
AUTHOR = {P. Crescenzi and G. Gambosi and P. Penna},
BOOKTITLE = {Proc. of ACM DIALM-2000, 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications},
TITLE = {On-Line Algorithms for the Channel Assignment Problem in
Cellular Networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {1--7},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{DMRS00,
AUTHOR = {O. Dalle and P. Mussi and and C. Rigal and V. Sutter},
BOOKTITLE = {Proc. 6th ESA Workshop on Simulation in European Space Pragrams},
TITLE = {ASIMUT: An Environment for the Simulation of Multi-Media
Satellite Telecommunication Networks},
YEAR = {2000},
ADDRESS = {ESTEC, Noordwijk, The Netherlands},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {European Space Agency},
PAGES = {285--288},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://www.inria.fr/mascotte/Olivier.Dalle/Postscript/ESA-SESP2000.ps.gz}
}
@INPROCEEDINGS{FGM+00,
AUTHOR = {A. Ferreira and J. Galtier and P. Mahey and G. Mateus and
A. Oliveira},
BOOKTITLE = {Proceedings of ISPAN},
TITLE = {An Optimization Model for Routing in Low Earth Orbit
Satellite Constellations},
YEAR = {2000},
ADDRESS = {Dallas, USA},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{FGP00,
AUTHOR = {A. Ferreira and J. Galtier and S. Pérennes},
BOOKTITLE = {$2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000)},
TITLE = {Approximation of a straight line in a bounded lattice},
YEAR = {2000},
ADDRESS = {La Rochelle, France},
OPTEDITOR = {},
MONTH = {Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {53--58},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{FPPP00,
AUTHOR = {P. Fraigniaud and A. Pelc and D. Peleg and S. Pérennes},
BOOKTITLE = {Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING)},
TITLE = {Assigning labels in unknown anonymous networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {101--112},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Gal00,
AUTHOR = {J. Galtier},
BOOKTITLE = {International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet (SSGRR 2000)},
TITLE = {Routing issues for LEO satellite constellations},
YEAR = {2000},
ADDRESS = {L'Aquila, Italie},
OPTEDITOR = {},
MONTH = {juillet},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GaLa00,
AUTHOR = {J. Galtier and S. Lanteri},
BOOKTITLE = {Proceedings of the 2000 International Conference on Parallel Processing},
TITLE = {On overlapping partitions},
YEAR = {2000},
ADDRESS = {Toronto, Canada},
EDITOR = {David J. Lilja},
MONTH = {août},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {461--468},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GPPV00,
AUTHOR = {L. Gargano and A. Pelc and S. Pérennes and U. Vaccaro},
BOOKTITLE = {Proc. of WG'2000 - 26th International Workshop on Graph-Theoretic Concepts in Computer Science},
TITLE = {Efficient communication in unknown networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {A paraître},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{HLM00a,
AUTHOR = {S. Haddad and A. Laugier and Jean-Francois Maurras},
BOOKTITLE = {ECCO XIII},
TITLE = {Designing telecommunication networks with global
capacities under survivability constraints},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{HLM00b,
AUTHOR = {S. Haddad and A. Laugier and Jean-Francois Maurras},
BOOKTITLE = {CO 2000},
TITLE = {Global designing of telecommunication networks},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{HMP00b,
AUTHOR = {M.-C. Heydemann and N. Marlin and S. Pérennes},
BOOKTITLE = {6ème Colloque International de Théorie des Graphes},
TITLE = {Rotational Cayley Graphs on Transposition Generated
Groups (Extended Abstract)},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {187--190},
PUBLISHER = {Elsevier Science},
SERIES = {Electronical Notes in Discrete Mathematics},
OPTVOLUME = {}
}
@INPROCEEDINGS{Jim00a,
AUTHOR = {T. Jiménez},
BOOKTITLE = {IEEE Conference on Decision and Control},
TITLE = {Optimal Admission Control for High Speed Networks: A
Dynamic Programming Approach},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {decembre},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{JMS00a,
AUTHOR = {T. Jiménez and P. Mussi and G. Siegel},
BOOKTITLE = {European Simulation Multiconference 2000},
TITLE = {A road traffic simulator : car-following and
lane-changing},
YEAR = {2000},
ADDRESS = {Gent, Belgium},
OPTEDITOR = {},
MONTH = {Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {241--245},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{JMS00b,
AUTHOR = {T. Jiménez and P. Mussi and G. Siegel},
BOOKTITLE = {European Simulation Symposium 2000},
TITLE = {The distribution and partitioning scheme of the
HIPERTRANS traffic simulator},
YEAR = {2000},
ADDRESS = {Hamburg, Allemagne},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {462--466},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{LaMa00,
AUTHOR = {A. Laugier and P. Mahey},
BOOKTITLE = {$2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000)},
TITLE = {Design of multi-level-protocol data networks},
YEAR = {2000},
ADDRESS = {La Rochelle, France},
OPTEDITOR = {},
MONTH = {Mai
},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {107--111},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR1969967,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {6th International Conference on Graph Theory (Marseille, 2000)},
TITLE = {$k$-colouring when $k$ is close to $\Delta$},
YEAR = {2000},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {4 pp. (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {5}
}
@INPROCEEDINGS{MR1801140,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {Proceedings of the Ninth International Conference ``Random Structures and Algorithms'' (Poznan, 1999)},
TITLE = {Near-optimal list colorings},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {3-4},
OPTORGANIZATION = {},
PAGES = {376--402},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {17},
JOURNAL = {Random Structures Algorithms}
}
@INPROCEEDINGS{Pen00,
AUTHOR = {P. Penna},
BOOKTITLE = {Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science},
TITLE = {Succinct Representations of Model Based Belief Revision},
YEAR = {2000},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {1770},
OPTORGANIZATION = {},
PAGES = {205--216},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {LNCS}
}
@INPROCEEDINGS{MR2115284,
AUTHOR = {B. Reed},
BOOKTITLE = {Proceedings of the Thiry-Second Annual ACM Symposium on Theory of Computing},
TITLE = {How tall is a tree?},
YEAR = {2000},
ADDRESS = {New York},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {479--483 (electronic)},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{AKJ99,
AUTHOR = {E. Altman and G. Koole and T. Jiménez},
BOOKTITLE = {37th Annual Allerton Conference on Communication, Control, and Computing},
TITLE = {Comparing tandem queueing systems and their fluid limits},
YEAR = {1999},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BCFS99,
AUTHOR = {F. Baude and D. Caromel and N. Furmento and D. Sagnol},
BOOKTITLE = {Proceedings of the 7th International Conference - High Performance Computing Networking'99 (HPCN Europe 1999)},
TITLE = {Overlapping Communication with Computation in
Distributed Object Systems},
YEAR = {1999},
ADDRESS = {Amsterdam, The Netherlands},
EDITOR = {Peter Sloot and Marian Bubak and Alfons Hoekstra and
Bob Hertzberger},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {744-753},
OPTPUBLISHER = {},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1593}
}
@INPROCEEDINGS{BeDa99,
AUTHOR = {B. Beauquier and E. Darrot},
BOOKTITLE = {Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
TITLE = {Arbitrary size Waksman networks},
YEAR = {1999},
ADDRESS = {Roscoff, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {95-100},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BPT99,
AUTHOR = {B. Beauquier and S. Pérennes and D. Tóth},
BOOKTITLE = {Proc. of 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA)},
TITLE = {All-to-All Routing and Coloring in Weighted Trees of
Rings},
YEAR = {1999},
ADDRESS = {Saint-Malo, France},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {185-190},
PUBLISHER = {ACM Press},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BFGP99,
AUTHOR = {P. Bergé and A. Ferreira and J. Galtier and J.-N. Petit},
BOOKTITLE = {ECSC 5 - Fifth European Conference on Satellite Communications},
TITLE = {A load study for intersatellite links in satellite
constellations},
YEAR = {1999},
ADDRESS = {Toulouse, France,CDRom},
OPTEDITOR = {},
MONTH = {November},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BMPP99,
AUTHOR = {J.-C. Bermond and N. Marlin and D. Peleg and S. Pérennes},
BOOKTITLE = {Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
TITLE = {Virtual path layouts with low congestion or low diameter
in ATM networks},
YEAR = {1999},
ADDRESS = {Roscoff, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {77-82},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{CoFe99,
AUTHOR = {R. Corrêa and A. Ferreira},
BOOKTITLE = {Proceedings of Europar'99},
TITLE = {A polynomial-time branching procedure for the
multiprocessor scheduling problem},
YEAR = {1999},
ADDRESS = {Toulouse (F)},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {272-279},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1685}
}
@INPROCEEDINGS{CFM99,
AUTHOR = {D. Coudert and A. Ferreira and X. Muñoz},
BOOKTITLE = {Proceedings of the Workshop on Optics and Computer Science 1999},
TITLE = {OTIS-Based Multi-Hop Multi-OPS Lightwave Networks},
YEAR = {1999},
OPTADDRESS = {},
EDITOR = {et al., J. Rolim},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {897-910},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1586},
JOURNAL = {IEEE International Parallel Processing Symposium -- IPPS'99},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-WOCS99.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-WOCS99.ps.gz},
ABSTRACT = {Many results exist in the literature describing
technological and theoretical advances in optical network topologies
and design. However, an essential effort has yet to be done in
linking those results together. In this paper, we propose a step in
this direction, by giving optical layouts for several
graph-theoretical topologies studied in the literature, using the
Optical Transpose Interconnection System (OTIS) architecture. These
topologies include the family of Partitioned Optical Passive Star
(POPS) and stack-Kautz networks as well as a generalization of the
Kautz and de Bruijn digraphs.}
}
@INPROCEEDINGS{CFP99,
AUTHOR = {D. Coudert and A. Ferreira and S. Perennes},
BOOKTITLE = {Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel},
TITLE = {Theoretical Aspects of the Optical Transpose
Interconnecting System Architecture},
YEAR = {1999},
ADDRESS = {Roscoff, France},
OPTEDITOR = {},
MONTH = {5-7 Mai},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {101-106},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-AlgoTel99.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFP-AlgoTel99.ps.gz}
}
@INPROCEEDINGS{FGPR99,
AUTHOR = {A. Ferreira and J. Galtier and J.-N. Petit and H. Rivano},
BOOKTITLE = {Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99)},
TITLE = {Algorithmes de reroutage dans une constellation de
satellites},
YEAR = {1999},
ADDRESS = {Roscoff, France},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {107-112},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
URL = {http://ares.insa-lyon.fr/tarot/jsp/site/Portal.jsp?page_id=7},
PDF = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fgpr99.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/Herve.Rivano/Biblio/fgpr99.ps.gz}
}
@INPROCEEDINGS{FeSc99,
AUTHOR = {A. Ferreira and N. Schabanel},
BOOKTITLE = {Proceedings of ISPAN'99},
TITLE = {A randomized BSP/CGM algorithm for the maximal
independent set problem},
YEAR = {1999},
ADDRESS = {Fremantle, Australia},
OPTEDITOR = {},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {284-289},
PUBLISHER = {IEEE},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Gal99,
AUTHOR = {J. Galtier},
BOOKTITLE = {I Workshop de Comunicacao Sem Fio},
TITLE = {Geographical reservation for guaranteed handover and
routing in low earth orbit constellations},
YEAR = {1999},
ADDRESS = {Belo Horizonte, Minas Gerais, Brazil},
EDITOR = {Geraldo Robson Mateus},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {77-86},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GaPe99b,
AUTHOR = {J. Galtier and S. Pérennes},
BOOKTITLE = {15th European Workshop on Computational Geometry, Antibes Juan-Les-Pins},
TITLE = {Parallel flips on planar triangulations},
YEAR = {1999},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {80-86},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{JFMS99c,
AUTHOR = {T. Jiménez and N. Furmento and P. Mussi and G. Siegel},
BOOKTITLE = {AFRICON'99},
TITLE = {A Traffic Simulator for Advanced Transport Telematics
(ATT) Strategies},
YEAR = {1999},
ADDRESS = {Cape Town, South Africa},
OPTEDITOR = {},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {33--36},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {1}
}
@INPROCEEDINGS{JFMS99,
AUTHOR = {T. Jiménez and N. Furmento and P. Mussi and G. Siegel},
BOOKTITLE = {Modélisation et Simulation des Flux Physiques et Informationnels (MOSIM)},
TITLE = {Un framework à objets pour la simulation de trafic
routier},
YEAR = {1999},
ADDRESS = {Annecy, France},
EDITOR = {et Alain Haurat, Georges Habchi},
MONTH = {Octobre},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {257--262},
PUBLISHER = {SCS International},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{LLL99,
AUTHOR = {F. Lang and P. Lescanne and L. Liquori},
BOOKTITLE = {FM, World Congress on Formal Methods in the Development of Computing Systems},
TITLE = {A Framework for Defining Object-Calculi (extended
abstract)},
YEAR = {1999},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {963--982},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1709},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/fm-99.ps.gz}
}
@INPROCEEDINGS{MR1715600,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {STOC '98 (Dallas, TX)},
TITLE = {Further algorithmic aspects of the local lemma},
YEAR = {1999},
ADDRESS = {New York},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {524--529},
PUBLISHER = {ACM},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR1852482,
AUTHOR = {L. Perkovic and B. Reed},
BOOKTITLE = {Graph-theoretic concepts in computer science (Ascona, 1999)},
TITLE = {An improved algorithm for finding tree decompositions of
small width},
YEAR = {1999},
ADDRESS = {Berlin},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {148--154},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1665}
}
@INPROCEEDINGS{MR1966425,
AUTHOR = {B. Reed},
BOOKTITLE = {6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999)},
TITLE = {Introducing directed tree width},
YEAR = {1999},
ADDRESS = {Amsterdam},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {8 pp. (electronic)},
PUBLISHER = {Elsevier},
SERIES = {Electron. Notes Discrete Math.},
VOLUME = {3}
}
@INPROCEEDINGS{BMPP98a,
AUTHOR = {J.-C. Bermond and N. Marlin and D. Peleg and S. Pérennes},
BOOKTITLE = {Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499},
TITLE = {Directed virtual path layouts in ATM networks},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {75-i88. (Full version appeared in TCS)},
PUBLISHER = {Springer Verlag},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BMPP98b,
AUTHOR = {J.-C. Bermond and N. Marlin and D. Peleg and S. Pérennes},
BOOKTITLE = {Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998},
TITLE = {Virtual path layouts in simple ATM networks},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR1726341,
AUTHOR = {Gruia Calinescu and Cristina G. Fernandes and B. Reed},
BOOKTITLE = {Integer programming and combinatorial optimization (Houston, TX, 1998)},
TITLE = {Multicuts in unweighted graphs with bounded degree and
bounded tree-width},
YEAR = {1998},
ADDRESS = {Berlin},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {137--152},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1412}
}
@INPROCEEDINGS{CFM98,
AUTHOR = {D. Coudert and A. Ferreira and X. Muñoz},
BOOKTITLE = {IEEE International Parallel Processing Symposium},
TITLE = {Multiprocessor Architectures Using Multi-hops Multi-OPS
Lightwave Networks and Distributed Control},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {151-155},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-IPPS98.pdf},
POSTSCRIPT = {ftp://ftp-sop.inria.fr/mascotte/personnel/David.Coudert/Publication/CFM-IPPS98.ps.gz},
ABSTRACT = {In this paper we study the design of regular multicast
networks implemented with Optical Passive Star (OPS) couplers. We
focus on an architecture based on both Kautz graphs and stack-graphs,
and show that it is very cost-effective with respect to its resources
requirements, namely the number of OPS couplers, power budget,
scalability and number of transceivers, and presents a large ratio
number-of-nodes/diameter. The important issue of medium access
control is also addressed and control protocols for accessing the
optical couplers are given and analyzed. Finally, we show through
simulation that these control protocols efficiently implement
shortest path routing on these networks.}
}
@INPROCEEDINGS{Dal98b,
AUTHOR = {O. Dalle},
BOOKTITLE = {10$^e$ Rencontres Francophones du Parallélisme (RENPAR'10)},
TITLE = {MPCFS : un exemple d'intégration transparente de
mécanismes de communication multipoints dans les systèmes UNIX},
YEAR = {1998},
ADDRESS = {Strasbourg},
EDITOR = {Dominique Méry and Guy-René Perrin},
MONTH = {Juin},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{Dal98a,
AUTHOR = {O. Dalle},
BOOKTITLE = {Deuxièmes Journées Doctorales Informatique et Réseaux (JDIR'98)},
TITLE = {MPCFS : un système de fichiers virtuel pour
communications multipoints fiables entre systèmes UNIX},
YEAR = {1998},
ADDRESS = {Paris},
OPTEDITOR = {},
MONTH = {Avril},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{DHL98,
AUTHOR = {Di Gianantonio, P. and F. Honsell and L. Liquori},
BOOKTITLE = {Proc. of ACM-SIGPLAN OOPSLA, International Symposium on Object Oriented, Programming, System, Languages and Applications},
TITLE = {A Lambda Calculus of Objects with Self-inflicted
Extension},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {166--178},
PUBLISHER = {The ACM Press},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/oopsla-98.ps.gz}
}
@INPROCEEDINGS{DFR98,
AUTHOR = {M. Diallo and A. Ferreira and A. Rau-Chaplin},
BOOKTITLE = {Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science -- STACS'98},
TITLE = {Communication-efficient deterministic parallel
algorithms for planar point location and 2d Voronoi diagram},
YEAR = {1998},
ADDRESS = {Paris, France},
OPTEDITOR = {},
MONTH = {February},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {399--409},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1373},
KEY = {p-congint}
}
@INPROCEEDINGS{MR1676561,
AUTHOR = {Hazel Everett and Sulamita Klein and B. Reed},
BOOKTITLE = {Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998)},
TITLE = {An optimal algorithm for finding clique-cross partitions},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {171--177},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {135},
JOURNAL = {Congr. Numer.}
}
@INPROCEEDINGS{FGMR98,
AUTHOR = {A. Ferreira and I. Guérin-Lassous and K. Marcus and
A. Rau-Chaplin},
BOOKTITLE = {Proceedings of Europar'98 (Distinguished Paper)},
TITLE = {Parallel Computation on Interval Graphs using PC
clusters: Algorithms and Experiments},
YEAR = {1998},
ADDRESS = {Southampton, UK},
EDITOR = {D. Pritchard and J. Reeves},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {875-886},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1470},
KEY = {p-congint}
}
@INPROCEEDINGS{Liq98b,
AUTHOR = {L. Liquori},
BOOKTITLE = {Types, International Workshop on Types for Proof and Programs},
TITLE = {Bounded Polymorphism for Extensible Objects},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {149--163},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1657},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/types-98.ps.gz}
}
@INPROCEEDINGS{Liq98a,
AUTHOR = {L. Liquori},
BOOKTITLE = {ECOOP, European Conference on Object Oriented Programming},
TITLE = {On Object Extension},
YEAR = {1998},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {498--552},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1445},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ecoop-98.ps.gz}
}
@INPROCEEDINGS{MR1635533,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {LATIN'98: theoretical informatics (Campinas, 1998)},
TITLE = {Colouring graphs where chromatic number is almost their
maximum degree},
YEAR = {1998},
ADDRESS = {Berlin},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {216--225},
PUBLISHER = {Springer},
SERIES = {Lecture Notes in Comput. Sci.},
VOLUME = {1380}
}
@INPROCEEDINGS{BBG+97,
AUTHOR = {B. Beauquier and J.-C. Bermond and L. Gargano and
P. Hell and S. Perennes and U. Vaccaro},
BOOKTITLE = {Proc. Conference WOCS97, Geneva,April 1997},
TITLE = {Graph problems arising from Wavelength--Routing in
All--Optical Networks},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBG+97.pdf}
}
@INPROCEEDINGS{BBPP96,
AUTHOR = {J.-C. Bermond and J. Bond and D. Peleg and S. Pérennes},
BOOKTITLE = {Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6},
TITLE = {Tight bounds on the size of 2-monopolies},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {170--179},
PUBLISHER = {Carleton U. Press},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BDFP97,
AUTHOR = {J.-C. Bermond and M. Di Ianni and M. Flammini and
S. Pérennes},
BOOKTITLE = {Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science},
TITLE = {Systolic orientations for deadlock prevention in usual
networks},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {52--64},
PUBLISHER = {Springer verlag},
OPTSERIES = {},
VOLUME = {1335}
}
@INPROCEEDINGS{BCF97,
AUTHOR = {P. Berthomé and J. Cohen and A. Ferreira},
BOOKTITLE = {Proceedings of 4th International Colloquium on Structural Information and Communication Complexity - Sirocco'97},
TITLE = {Embedding tori in Partitioned Optical Passive Star
networks},
YEAR = {1997},
OPTADDRESS = {},
EDITOR = {D. Krizanc and P. Widmayer},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {40-52},
PUBLISHER = {Carleton Scientific},
SERIES = {Proceedings in Informatics},
VOLUME = {1},
KEY = {p-congint}
}
@INPROCEEDINGS{BBDL97,
AUTHOR = {V. Bono and M. Bugliesi and M. Dezani-Ciancaglini and
L. Liquori},
BOOKTITLE = {TAPSOFT/CAAP, International Conference of Theory and Practice of Software Development},
TITLE = {Subtyping Constraint for Incomplete Objects},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {465--477},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1214},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/tapsoftcaap-97.ps.gz}
}
@INPROCEEDINGS{CDF+97,
AUTHOR = {E. Caceres and F. Dehne and A. Ferreira and P. Flocchini and
I. Rieping and A. Roncato and N. Santoro and S. Song},
BOOKTITLE = {Proceedings of ICALP'97},
TITLE = {Efficient Parallel Graph Algorithms For Coarse Grained
Multicomputers and BSP},
YEAR = {1997},
OPTADDRESS = {},
EDITOR = {P. Degano and R. Gorrieri and A. Marchetti-Spaccamela},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {390--400},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1256},
KEY = {p-congint}
}
@INPROCEEDINGS{CoJe97,
AUTHOR = {M. Cosnard and E. Jeannot},
BOOKTITLE = {NATO workshop on Advances in High Performance Computing},
TITLE = {Automatic Coarse-Grained Parallelization Techniques},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {Kluwer Academic Publishers},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{FFG97,
AUTHOR = {A. Ferreira and E. Fleury and M. Grammatikakis},
BOOKTITLE = {Proceedings of the 4th IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'97},
TITLE = {Multicasting Control and Communications on Multihop
Stack-Ring OPS Networks},
YEAR = {1997},
ADDRESS = {Montreal (Ca)},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {39--44},
PUBLISHER = {IEEE CS Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{FKRU97,
AUTHOR = {A. Ferreira and C. Kenyon and A. Rau-Chaplin and
S. Ubéda},
BOOKTITLE = {Proceedings of the 11th IEEE International Parallel Processing Symposium},
TITLE = {d-Dimensional Range Search on Multicomputers},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {616--620},
PUBLISHER = {IEEE CS Press},
OPTSERIES = {},
OPTVOLUME = {},
JOURNAL = {IEEE International Parallel Processing Symposium -- IPPS'97},
KEY = {p-congint}
}
@INPROCEEDINGS{GHP97,
AUTHOR = {L. Gargano and P. Hell and S. Pérennes},
BOOKTITLE = {ICALP'97},
TITLE = {Colouring paths in directed symmetric trees with
applications to WDM routing},
YEAR = {1997},
ADDRESS = {Bologna, Italy},
OPTEDITOR = {},
MONTH = {July},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {505--515},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1256}
}
@INPROCEEDINGS{Liq97,
AUTHOR = {L. Liquori},
BOOKTITLE = {ECOOP, European Conference on Object Oriented Programming},
TITLE = {An Extended Theory of Primitive Objects: First Order
System},
YEAR = {1997},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {146--169},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1241},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/ecoop-97.ps.gz}
}
@INPROCEEDINGS{BDMS96a,
AUTHOR = {M. Badel and de Pretto, T. and P. Mussi and G. Siegel},
BOOKTITLE = {Object Oriented Simulation Conference},
TITLE = {Stat-Tool: An extensible and Distributed Object Oriented
Statistic Tool for Discrete Event Simulation},
YEAR = {1996},
ADDRESS = {La Jolla -- USA},
OPTEDITOR = {},
MONTH = {January},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BBB+96,
AUTHOR = {F. Baude and F. Belloncle and J.-C. Bermond and
D. Caromel and O. Dalle and E. Darrot and O. Delmas and N. Furmento and
B. Gaujal and P. Mussi and S. Pérennes and Y. Roudier and G. Siegel and
M. Syska},
BOOKTITLE = {2nd European School of Computer Science, Parallel Programming Environments for High Performance Computing ESPPE'96},
TITLE = {The SLOOP project: Simulations, Parallel Object-Oriented
Languages, Interconnection Networks},
YEAR = {1996},
ADDRESS = {Alpe d'Huez},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {85--88},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BBB+96.pdf}
}
@INPROCEEDINGS{BGPRV96,
AUTHOR = {J.-C. Bermond and L. Gargano and S. Pérennes and
A.A. Rescigno and U. Vaccaro},
BOOKTITLE = {Proc.23nd ICALP96, Paderborn, Germany Lecture Notes in Computer Science, 1099},
TITLE = {Efficient Collective Communications in Optical Networks},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {574--585},
PUBLISHER = {Springer verlag},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/SOURCEPS/BGPRV96.ps}
}
@INPROCEEDINGS{BKP96,
AUTHOR = {J.-C. Bermond and T. Kodate and S. Perennes},
BOOKTITLE = {Proceedings of the Franco-Japanese conference Brest July 95},
TITLE = {Gossiping in Cayley graphs by packets},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {301-315},
PUBLISHER = {Springer verlag},
OPTSERIES = {},
VOLUME = {Lecture Notes in Computer Science, 1120},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BKP96.pdf}
}
@INPROCEEDINGS{BMM96,
AUTHOR = {J.-C. Bermond and A. Marchetti and X. Munoz},
BOOKTITLE = {Proc. Conference EUROPAR96, Lyon, August 96, Lecture Notes in Computer Science, 1123},
TITLE = {Induced broadcasting algorithms in iterated line
digraphs},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {313--324},
PUBLISHER = {Springer Verlag},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BeFe96,
AUTHOR = {P. Berthomé and A. Ferreira},
BOOKTITLE = {Proceedings of the 3rd IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'96},
TITLE = {Improved embeddings in POPS networks through stack-graph
models},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {130--136},
PUBLISHER = {IEEE CS Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{BBL96,
AUTHOR = {V. Bono and M. Bugliesi and L. Liquori},
BOOKTITLE = {MFCS, International Symposium of Mathematical Foundation of Computer Science},
TITLE = {A Lambda Calculus of Incomplete Objects},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {218--229},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1113},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/asian-96.ps.gz}
}
@INPROCEEDINGS{BFM96,
AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
BOOKTITLE = {Proceedings of EuroPar'96},
TITLE = {On stack-graph OPS-based lightwave networks},
YEAR = {1996},
ADDRESS = {Lyon (F)},
EDITOR = {L. Bougé and P. Fraigniaud and A. Mignotte and Y. Robert},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {218--221},
PUBLISHER = {Springer-Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1123},
KEY = {p-congint}
}
@INPROCEEDINGS{BDLM96,
AUTHOR = {M. Bugliesi and G. Delzanno and L. Liquori and
M. Martelli},
BOOKTITLE = {JICSLP, Joint International Conference and Symposium on Logic Programming},
TITLE = {A Linear Logic Calculus of Objects},
YEAR = {1996},
OPTADDRESS = {},
EDITOR = {The MIT Press},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {67--81},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/jicslp-96.ps.gz}
}
@INPROCEEDINGS{HPCN-caro,
AUTHOR = {D. Caromel and P. Dzwig and R. Kauffman and H. Liddell and
A. McEwan and P. Mussi and Johnathan Poole and M. Rigg and R. Winder},
BOOKTITLE = {Proceedings of High-Performance Computing and Networking (HPCN'96)},
TITLE = {EC++ -- EUROPA Parallel C++ : A Draft Definition},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {April},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {848--857},
PUBLISHER = {Springer, Lectures Notes in Computer Science (LNCS)},
OPTSERIES = {},
VOLUME = {1067}
}
@INPROCEEDINGS{sched.renpar:cn,
AUTHOR = {R. Corrêa and A. Ferreira and P. Rebreyend},
BOOKTITLE = {Proceedings of the 8ème Rencontres du Parallélisme},
TITLE = {Algorithmes génétiques ``intelligents'' pour
l'ordonnancement de tâches},
YEAR = {1996},
ADDRESS = {Bordeaux},
OPTEDITOR = {},
MONTH = {May},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {qf-congnat}
}
@INPROCEEDINGS{CFR96,
AUTHOR = {R. Corrêa and A. Ferreira and P. Rebreyend},
BOOKTITLE = {Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing -- SPDP'96},
TITLE = {Integrating list heuristics in genetic algorithms for
multiprocessor scheduling},
YEAR = {1996},
ADDRESS = {New Orleans (USA)},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {462--469},
PUBLISHER = {IEEE CS Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{Dal96a,
AUTHOR = {O. Dalle},
BOOKTITLE = {Proceedings of Parallel and Distributed Computing Systems (PDCS'96)},
TITLE = {LoadBuilder: A tool for generating and modeling
workloads in distributed workstations environments},
YEAR = {1996},
ADDRESS = {Dijon (France)},
EDITOR = {K. Yetongnon and S. Hariri},
MONTH = {September},
OPTNOTE = {},
OPTNUMBER = {},
ORGANIZATION = {International Society for Computers and their Applications (ISCA)},
PAGES = {248--253},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {1}
}
@INPROCEEDINGS{DuFe96,
AUTHOR = {T. Duboux and A. Ferreira},
BOOKTITLE = {Proceedings of Euromicro's 4th Workshop on Parallel and Distributed Processing},
TITLE = {Achieving Good Performance for Dictionary Machines: A
Scalable Distributed Data Balancing Technique},
YEAR = {1996},
ADDRESS = {Braga, Portugal},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{FeMa96,
AUTHOR = {A. Ferreira and K. Marcus},
BOOKTITLE = {Proceedings of The 10th IEEE Annual International Symposium on High Performance Computers -- HPCS'96},
TITLE = {A theoretical framework for the design of lightwave
networks},
YEAR = {1996},
ADDRESS = {Ottawa},
EDITOR = {F. Dehne and B. Hodson},
MONTH = {June},
NOTE = {CD-ROM},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{GJMS96a,
AUTHOR = {B. Gaujal and A. Jean-Marie and P. Mussi and G.Siegel},
BOOKTITLE = {Environments and Tools for Parallel Scientific Computing},
TITLE = {High Speed Simulation of Discrete Event Systems by
Mixing Process Oriented and Equational Approaches},
YEAR = {1996},
ADDRESS = {Faverges de la Tour -- France},
OPTEDITOR = {},
MONTH = {August},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GaPe96b,
AUTHOR = {C. Gavoille and S. Pérennes},
BOOKTITLE = {SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity},
TITLE = {Lower Bounds for Shortest Path Interval Routing},
YEAR = {1996},
ADDRESS = {Siena, Italy},
EDITOR = {N. Santoro and P. G. Spirakis},
MONTH = {June},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {88-103},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{GaPe96a,
AUTHOR = {C. Gavoille and S. Pérennes},
BOOKTITLE = {PODC},
TITLE = {Memory Requirements for Routing in Distributed Networks
(Extended Abstract)},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
NOTE = {Best student paper award},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {125-133},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{LiCa96,
AUTHOR = {L. Liquori and G. Castagna},
BOOKTITLE = {Asian, International Conference on Concurrency and Parallelism, Programming, Networking, and Security},
TITLE = {A Typed Lambda Calculus of Objects},
YEAR = {1996},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {129--141},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {1179},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/asian-96.ps.gz}
}
@INPROCEEDINGS{MS96a,
AUTHOR = {P. Mussi and G.Siegel},
BOOKTITLE = {European Simulation Symposium},
TITLE = {Extending the Prosit System to Support Distributed
Simulation},
YEAR = {1996},
ADDRESS = {Genoa--Italy},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BBD95,
AUTHOR = {J.-C. Bermond and J. Bond and S. Djelloul},
BOOKTITLE = {Proc. Workshop on interconnection Networks, DIMACS, Feb. 1994, DIMACS Ser.},
TITLE = {Dense bus networks of diameter 2},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {9--18},
PUBLISHER = {Annals New York Academy of Sciences},
OPTSERIES = {},
VOLUME = {21},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BDD95.pdf}
}
@INPROCEEDINGS{P2,
AUTHOR = {J.-C. Bermond and D. Caromel and P. Mussi},
BOOKTITLE = {proceedings Joint Conference on Information Sciences (JCIS)},
TITLE = {Simulation within a Parallel Object-Oriented Language:
The SLOOP System},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
MONTH = {October},
NOTE = {invited session on Object-Oriented Programming},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {218--221},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BCM95,
AUTHOR = {J.-C. Bermond and D. Caromel and P. Mussi},
BOOKTITLE = {Proceedings Joint Conference on Information Sciences (JCIS'95), North Carolina , Sept. 1995},
TITLE = {Simulation within a parallel object oriented language :
The SLOOP System},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{BGRV95,
AUTHOR = {J.-C. Bermond and L. Gargano and A.A. Rescigno and
U. Vaccaro},
BOOKTITLE = {Proc.22nd ICALP95, Szeged, Hungary},
TITLE = {Fast gossiping by short messages},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {135--146},
PUBLISHER = {Lecture Notes in Computer Science, Springer Verlag},
OPTSERIES = {},
VOLUME = {944},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BGRV95.pdf}
}
@INPROCEEDINGS{BePe95b,
AUTHOR = {J.-C. Bermond and D. Peleg},
BOOKTITLE = {Proc. Conference SIROCCO95 Olympie June 95, International Informatics Series 2},
TITLE = {The power of small coalitions in graphs},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {173--184},
PUBLISHER = {Carleton U. Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BePe95b.pdf}
}
@INPROCEEDINGS{BePe95a,
AUTHOR = {J.-C. Bermond and S. Pérennes},
BOOKTITLE = {Proc. Conference SIROCCO95, Olympie June 95, International Informatics Series 2},
TITLE = {Efficient broadcasting protocols on de Bruijn and
similar networks},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {199--209},
PUBLISHER = {Carleton U. Press},
OPTSERIES = {},
OPTVOLUME = {},
PDF = {ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/BePe95a.pdf}
}
@INPROCEEDINGS{BeFe95b,
AUTHOR = {P. Berthomé and A. Ferreira},
BOOKTITLE = {Broadband Networks: Strategies and Technologies},
TITLE = {Communication Issues in Parallel Systems with Optical
Interconnections},
YEAR = {1995},
OPTADDRESS = {},
EDITOR = {R. A. Cryan and P. N. Fernando and P. Ghiggino and
J. M. Senior},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {464--473},
PUBLISHER = {SPIE -- The International Society for Optical Engineering},
SERIES = {Proceedings of SPIE},
VOLUME = {2450},
KEY = {p-congint}
}
@INPROCEEDINGS{BoLi95,
AUTHOR = {V. Bono and L. Liquori},
BOOKTITLE = {CSL, International Conference of Computer Science Logic},
TITLE = {A Subtyping for the Fisher-Honsell-Mitchell Lambda
Calculus of Objects},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {16--30},
PUBLISHER = {Springer Verlag},
SERIES = {Lecture Notes in Computer Science},
VOLUME = {933},
POSTSCRIPT = {http://www-sop.inria.fr/mascotte/Luigi.Liquori/PAPERS/csl-95.ps.gz}
}
@INPROCEEDINGS{BFM95,
AUTHOR = {H. Bourdin and A. Ferreira and K. Marcus},
BOOKTITLE = {Proceedings of the 2nd IEEE International Workshop on Massively Parallel Processing using Optical Interconnections -- MPPOI'95},
TITLE = {A comparative study of one-to-many WDM lightwave
interconnection networks for multiprocessors},
YEAR = {1995},
ADDRESS = {San Antonio (USA)},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {257--264},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{DFG95b,
AUTHOR = {T. Duboux and A. Ferreira and M. Gastaldo},
BOOKTITLE = {Algorithms and Parallel VLSI Architectures III},
TITLE = {A scalable design for Dictionary Machines},
YEAR = {1995},
OPTADDRESS = {},
EDITOR = { Moonen and Cathoor},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {143--154},
PUBLISHER = {Elsevier},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{FeMa95,
AUTHOR = {A. Ferreira and K. Marcus},
BOOKTITLE = {Fiber Optic Network Components},
TITLE = {Modular multihop WDM--based lightwave networks, and
routing},
YEAR = {1995},
OPTADDRESS = {},
EDITOR = {S. I Najafi and H. Porte},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {78--86},
PUBLISHER = {SPIE -- The International Society for Optical Engineering},
SERIES = {Proceedings of SPIE},
VOLUME = {2449},
KEY = {p-congint}
}
@INPROCEEDINGS{FeQa95,
AUTHOR = {A. Ferreira and N. Qadri},
BOOKTITLE = {IEEE International Conference on High Performance Computing -- HiPC'95},
TITLE = {Performance of WDM systems},
YEAR = {1995},
ADDRESS = {New Delhi},
OPTEDITOR = {},
MONTH = {December},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{FRU95,
AUTHOR = {A. Ferreira and A. Rau-Chaplin and S. Ubeda},
BOOKTITLE = {Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing -- SPDP'95},
TITLE = {Scalable 2d convex hull and triangulation algorithms for
coarse-grained multicomputers},
YEAR = {1995},
ADDRESS = {San Antonio (USA)},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {561--569},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{FeUb95,
AUTHOR = {A. Ferreira and S. Ubéda},
BOOKTITLE = {Proceedings of the IEEE International Conference on Image Processing -- ICIP'95},
TITLE = {Parallel complexity of the medial axis transform},
YEAR = {1995},
ADDRESS = {Washington DC},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {105--107},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
VOLUME = {II},
KEY = {p-congint}
}
@INPROCEEDINGS{Liq95,
AUTHOR = {L. Liquori},
BOOKTITLE = {ATSC, International Workshop on Advances in Type Systems for Computing},
TITLE = {A Typed Axiomatic Object Calculus with Subtyping},
YEAR = {1995},
ADDRESS = {Newton Institute, Cambridge},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
OPTPAGES = {},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{MR1370952,
AUTHOR = {M. Molloy and B. Reed},
BOOKTITLE = {Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, ``Random Graphs '93'' (Poznan, 1993)},
TITLE = {A critical point for random graphs with a given degree
sequence},
YEAR = {1995},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
NUMBER = {2-3},
OPTORGANIZATION = {},
PAGES = {161--179},
OPTPUBLISHER = {},
OPTSERIES = {},
VOLUME = {6},
JOURNAL = {Random Structures Algorithms}
}
@INPROCEEDINGS{MS95a,
AUTHOR = {P. Mussi and G. Siegel},
BOOKTITLE = {European Simulation Symposium},
TITLE = {The PROSIT Sequential Simulator: A Test-bed for Object
Oriented Discrete Event Simulation},
YEAR = {1995},
ADDRESS = {Erlangen, Germany},
OPTEDITOR = {},
MONTH = {October},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {297--301},
OPTPUBLISHER = {},
OPTSERIES = {},
OPTVOLUME = {}
}
@INPROCEEDINGS{ADF94,
AUTHOR = {S. Akl and J. Duprat and A. Ferreira},
BOOKTITLE = {Advances in Parallel Algorithms -- Proceedings of the Workshop on Parallel Algorithms '92},
TITLE = {Building hamiltonian circuits and paths on star graphs},
YEAR = {1994},
ADDRESS = {Sophia (Bul)},
EDITOR = {I. Dimov and O. Tonev},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {131--143},
PUBLISHER = {IOS Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{DFT94,
AUTHOR = {F. Desprez and A. Ferreira and B. Tourancheau},
BOOKTITLE = {Proceedings of the First IEEE International Workshop on Massively Parallel Processing Using Optical Interconnections -- MPPOI'94},
TITLE = {Efficient communication operations on passive optical
star networks},
YEAR = {1994},
OPTADDRESS = {},
OPTEDITOR = {},
OPTMONTH = {},
OPTNOTE = {},
OPTNUMBER = {},
OPTORGANIZATION = {},
PAGES = {52--58},
PUBLISHER = {IEEE Press},
OPTSERIES = {},
OPTVOLUME = {},
KEY = {p-congint}
}
@INPROCEEDINGS{FMSM93,
AUTHOR = {P. Ferrante and P. Mussi and G. Siegel and L. Mallet},
BO