BACK TO COATI PUBLICATION INDEX
Publications of year 2011
-
N. Cohen.
Some results in graph theory and its applications.
PhD thesis,
Ecole doctorale STIC, Université de Nice-Sophia Antipolis,
October 2011.
[WWW
] [Abstract] [bibtex-entry]
-
J-C Maureira Bravo.
Internet on Rails.
THESE,
Ecole doctorale STIC, Université de Nice Sophia-Antipolis,
January 2011.
[WWW
] [PDF
]
Keywords:
Train communications,
WiFi,
horizontal handover,
layer 2 routes update,
infrastructure network,
combined chordal topologies,
simulations..
[Abstract] [bibtex-entry]
-
D. Mazauric.
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.
PhD thesis,
Ecole doctorale STIC, Université de Nice Sophia-Antipolis,
November 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Ribault.
Reuse and Scalability in Modeling and Simulation Software Engineering.
THESE,
Ecole doctorale STIC, Université de Nice Sophia-Antipolis,
January 2011.
[WWW
] [PDF
]
Keywords:
simulation,
évènements discrets,
aspects,
séparation des préoccupations,
instrumentation,
modélisation,
composant,
simulation distribuée,
réutilisation.
[Abstract] [bibtex-entry]
-
J-C. Bermond,
F. Ergincan,
and M. Syska.
Quisquater Festschrift,
volume 6805 of Lecture Notes in Computer Science,
chapter Line Directed Hypergraphs,
pages 25-34.
Springer-Verlag,
Berlin Heidelberg,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
G . Wainer,
K. Al-Zoubi,
O. Dalle,
R. C. Hill,
S. Mittal,
J. L. R. Martin,
H. Sarjoughian,
L. Touraille,
M. K. Traoré,
and B. P. Zeigler.
Discrete-Event Modeling and Simulation: Theory and Applications,
chapter 17 - Standardizing DEVS model representation,
pages 427-458.
Taylor and Francis,
2011.
[WWW
] [bibtex-entry]
-
G. A. Wainer,
K. Al-Zoubi,
O. Dalle,
R.C. Hill,
S. Mittal,
J. L. R. Martin,
H. Sarjoughian,
L. Touraille,
M. K. Traoré,
and B. P. Zeigler.
Discrete-Event Modeling and Simulation: Theory and Applications,
chapter 18 - Standardizing DEVS Simulation Middleware,
pages 459-494.
Taylor and Francis,
2011.
[WWW
] [bibtex-entry]
-
V. Andova,
N. Cohen,
and R. Skrekovski.
Graph Classes (Dis)satisfying the Zagreb Indices Inequality.
MATCH Commun. Math. Comput. Chem.,
65(3):647-658,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
M. Basavaraju,
L. S. Chandran,
N. Cohen,
F. Havet,
and T. Müller.
Acyclic edge-coloring of planar graphs.
SIAM Journal of Discrete Mathematics,
25(2):463--478,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
J. Beauquier,
J. Burman,
and S. Kutten.
A self-stabilizing Transformer for Population Protocols with Covering.
Theoretical Computer Science,
412(33):4247-4259,
2011.
[WWW
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
Y. M. Chee,
N. Cohen,
and X. Zhang.
The $\alpha$-Arboricity of Complete Uniform Hypergraphs.
SIAM Journal on Discrete Mathematics,
25(2):600-610,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
X. Muñoz,
and I. Sau.
Traffic Grooming in Bidirectional WDM Ring Networks.
Networks,
58(1):20-35,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Bilo,
M. Flammini,
G. Monaco,
and L. Moscardelli.
On the performances of Nash equilibria in isolation games.
Journal of Combinatorial Optimization,
22:378-391,
2011.
Note: Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference.
[WWW
] [Abstract] [bibtex-entry]
-
B. Bresar,
F. Kardos,
J. Katrenic,
and G. Semanisin.
Minimum $k$-path vertex cover.
Discrete Applied Mathematics,
159(12):1189-1195,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
S. Pérennes,
and H. Rivano.
Framework for Optimizing the Capacity of Wireless Mesh Networks.
Computer Communications,
34(13):1645-1659,
2011.
[WWW
]
Keywords:
Wireless mesh networks,
capacity,
routing,
scheduling,
linear programming,
column and cut generation..
[Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxès.
Cop and robber games when the robber can hide and ride.
SIAM Journal of Discrete Maths.,
25(1):333-359,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in process strategy games with application in the WDM reconfiguration problem.
Theoretical Computer Science (TCS),
412(35):4675-4687,
August 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen and F. Havet.
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree.
Graphs and Combinatorics,
27(6):831-849,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Giroire,
and I. Sau.
Circuits in graphs through a prescribed set of ordered vertices.
Journal of Interconnection Networks (JOIN),
11(3-4):121-141,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert and J-S. Sereni.
Characterization of graphs and digraphs with small process number.
Discrete Applied Mathematics (DAM),
159(11):1094-1109,
July 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Czap,
S. Jendrol',
and F. Kardos.
Facial parity edge colouring.
Ars Mathematica Contemporanea,
4(2):255-269,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
J. Czap,
S. Jendrol',
F. Kardos,
and J. Miskuf.
Looseness of Plane Graphs.
Graphs and Combinatorics,
27(1):73-85,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
J. Czap,
S. Jendrol',
and F. Kardos.
On the strong parity chromatic number.
Discussiones Mathematicae Graph Theory,
31:587-600,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Gabriele Di Stefano,
Alfredo Navarra,
and Cristina Pinotti.
Recoverable Robust Timetables: An Algorithmic Approach on Trees.
IEEE Transactions on Computers,
60(3):433 - 446,
March 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle.
Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? -- Part 1.
Modeling & Simulation Magazine,
11(3),
07 2011.
Note: Online publication.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle.
Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? -- Part 2.
Modeling & Simulation Magazine,
11(4),
10 2011.
Note: Online publication.
[WWW
] [Abstract] [bibtex-entry]
-
R. Erman,
F. Havet,
B. Lidicky,
and O. Pangrác.
5-colouring graphs with 4 crossings.
SIAM Journal on Discrete Mathematics,
25(1):401-422,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
L. Esperet,
F. Kardos,
A. D. King,
D. Král',
and S. Norine.
Exponentially many perfect matchings in cubic graphs.
Advances in Mathematics,
227(4):1646-1664,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli and J. G. Peters.
Complex networks and epidemics.
Technique et Science Informatiques,
20(2):181-212,
2011.
[Abstract] [bibtex-entry]
-
F. Havet,
S. Jendrol',
R. Soták,
and E. Skrabul'áková.
Facial non-repetitive edge-colouring of plane graphs.
Journal of Graph Theory,
66(1):38--48,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
M. Klazar,
J. Kratochvìl,
D. Kratsch,
and M. Liedloff.
Exact algorithms for L(2,1)-labelling.
Algorithmica,
59(2):169--194,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
F. Kardos,
J. Katrenic,
and I. Schiermeyer.
On computing the minimum 3-path vertex cover and dissociation number of graphs.
Theoretical Computer Science,
412(50):7009-7017,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
F. Kardos,
D. Král',
and J. Volec.
Fractional colorings of cubic graphs with large girth.
SIAM Journal on Discrete Mathematics,
25(3):1454-1476,
2011.
[PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted Improper Colouring.
In C. S. Iliopoulos and W. F. Smyth, editors,
Combinatorial Algorithms,
volume 7056 of Lecture Notes in Computer Science,
Victoria, Canada,
pages 1-18,
June 2011.
Springer Berlin Heidelberg.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
V. Campos,
F. Giroire,
L. Sampaio,
and R. Soares.
On the hull number of some graph classes.
In Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb'11),
volume 38 of Electronic Notes in Discrete Mathematics,
Budapest, Hungary,
pages 49-55,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
F. Giroire,
and J. Monteiro.
Hybrid Approaches for Distributed Storage Systems.
In Proceedings of Fourth International Conference on Data Management in Grid and P2P Systems (Globe'11),
Toulouse, France,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
In VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 2011),
volume 37,
Bariloche, Argentina,
pages 09-14,
04 2011.
[Abstract] [bibtex-entry]
-
S. K. Baruah,
V. Bonifaci,
G. D'Angelo,
A. Marchetti-Spaccamela,
S. Van Der Ster,
and L. Stougie.
Mixed-Criticality Scheduling of Sporadic Task Systems.
In Camil Demetrescu and Magnús M. Halldórsson, editors,
19th Annual European Symposium on Algorithms (ESA 2011),
volume 6942 of Lecture Notes in Computer Science,
Saarbruecken, Germany,
pages 555-566,
August 2011.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Beauquier,
P. Blanchard,
J. Burman,
and S. Delaet.
Computing Time Complexity of Population Protocols with Cover Times - the ZebraNet Example.
In 13th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2011,
Lecture Notes in Computer Science,
pages 47-61,
2011.
Springer.
[WWW
] [Abstract] [bibtex-entry]
-
J. Beauquier,
J. Burman,
and V. Malykh.
ZebraNet Analysé dans le Modéle des Protocoles de Population.
In Ducourthial et Bertrand et Felber et Pascal, editor,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [Abstract] [bibtex-entry]
-
J. Beauquier and J. Burman.
Self-stabilizing Mutual Exclusion and Group Mutual Exclusion for Population Protocols with Covering.
In 15th International Conference On Principles Of Distributed Systems, OPODIS 2011,
Lecture Notes in Computer Science,
2011.
Springer.
[WWW
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Reconstruire un graphe en une ronde.
In Ducourthial,
Bertrand et Felber,
and Pascal, editors,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [Abstract] [bibtex-entry]
-
F. Becker,
M. Matamala,
N. Nisse,
I. Rapaport,
K. Suchan,
and I. Todinca.
Adding a referee to an interconnection network: What can(not) be computed in one round.
In 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS),
pages 508-514,
2011.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration avec contraintes physiques dans les réseaux WDM.
In Ducourthial et Bertrand et Felber et Pascal, editor,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A.A. Rescigno,
and U. Vaccaro.
Optimal Time Data Gathering in Wireless Networks
with Omni-Directional Antennas.
In SIROCCO 2011,
volume 6796 of Lecture Notes in Computer Science,
Gdansk, Poland,
pages 306-317,
June 2011.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet and A. Koster.
Routage et Ordonnancement Robustes dans les Réseaux Radio Maillés.
In Ducourthial,
Bertrand et Felber,
and Pascal, editors,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [bibtex-entry]
-
C. Caillouet,
X. Li,
and T. Razafindralambo.
A Multi-objective Approach for Data Collection in Wireless Sensor Networks.
In 10th International Conference on Ad Hoc Networks and Wireless (AdHocNow),
Padderborn, Germany,
July 2011.
[WWW
] [bibtex-entry]
-
C. Caillouet and T. Razafindralambo.
Compromis énergie-délai pour la collecte de données dans les réseaux de capteurs.
In Ducourthial,
Bertrand et Felber,
and Pascal, editors,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [bibtex-entry]
-
V. Campos,
C. Linhares Sales,
A. K. Maia,
N. Martins,
and R. Sampaio.
Restricted coloring problems on graphs with few $P_4$'s.
In VI Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'11),
volume 37 of Electronic Notes in Discrete Mathematics,
pages 57-62,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Classen,
D. Coudert,
A. Koster,
and N. Nepomuceno.
Bandwidth assignment for reliable fixed broadband wireless networks.
In 12th IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM),
Lucca, Italy,
pages 1-6,
June 2011.
IEEE.
[PDF
] [Abstract] [bibtex-entry]
-
G. Classen,
D. Coudert,
A. Koster,
and N. Nepomuceno.
A Chance-Constrained Model & Cutting Planes for Fixed Broadband Wireless Networks.
In International Network Optimization Conference (INOC),
volume 6701 of Lecture Notes in Computer Science,
Hamburg, Germany,
pages 37-42,
June 2011.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
N. Nepomuceno,
and I. Tahiri.
Optimisation de la consommation énergétique dans les réseaux sans fil fixes.
In Pascal Ducourthial, Bertrand et Felber, editor,
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel France,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
N. Nepomuceno,
and I. Tahiri.
Energy saving in fixed wireless broadband networks.
In International Network Optimization Conference (INOC),
volume 6701 of Lecture Notes in Computer Science,
Hamburg, Germany,
pages 484-489,
June 2011.
[PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Mattia D'Emidio,
Daniele Frigioni,
and Vinicio Maurizio.
A Speed-Up Technique for Distributed Shortest Paths Computation.
In Beniamino Murgante,
Osvaldo Gervasi,
Andrés Iglesias,
David Taniar,
and Bernady O. Apduhan, editors,
11th International Conference on Computational Science and Its Applications (ICCSA 2011),
volume 6783 of Lecture Notes in Computer Science,
Santander, Spain,
pages 578-593,
June 2011.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Gabriele Di Stefano,
and Alfredo Navarra.
Maximum Flow and Minimum-Cost Flow in Multi-Interface Networks.
In 5th International Conference on Ubiquitous Information Management and Communication,
Seoul, Korea, Republic Of,
pages 19,
February 2011.
ACM.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Gabriele Di Stefano,
and Alfredo Navarra.
Bandwidth Constrained Multi-interface Networks.
In Ivana Cerná,
Tibor Gyimóthy,
Juraj Hromkovic,
Keith Jefferey,
Rastislav Královic,
Marko Vukolic,
and Stefan Wolf, editors,
37th Conference on Current Trends in Theory and Practice of Computer Science,
volume 6543 of Lecture Notes in Computer Science,
Novy Smokovec, Slovakia,
pages 202-213,
January 2011.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Gabriele Di Stefano,
and Alfredo Navarra.
Gathering of Six Robots on Anonymous Symmetric Rings.
In Adrian Kosowski and Masafumi Yamashita, editors,
Structural Information and Communication Complexity,
volume 6796 of Lecture Notes in Computer Science,
Gdansk, Poland,
pages 174-185,
July 2011.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Gabriele Di Stefano,
and Alfredo Navarra.
Min-Max Coverage in Multi-interface Networks.
In Ivana Cerná,
Tibor Gyimóthy,
Juraj Hromkovic,
Keith Jefferey,
Rastislav Královic,
Marko Vukolic,
and Stefan Wolf, editors,
37th Conference on Current Trends in Theory and Practice of Computer Science,
volume 6543 of Lecture Notes in Computer Science,
Novy Smokovec, Slovakia,
pages 190-201,
January 2011.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
Daniele Frigioni,
and Camillo Vitale.
Dynamic Arc-Flags in Road Networks.
In Panos M. Pardalos and Steffen Rebennack, editors,
10th International Symposium, SEA 2011,
volume 6630 of Lecture Notes in Computer Science,
Kolimpari, Chania, Crete, Greece,
pages 88-99,
April 2011.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle and E. Mancini.
Traces Generation To Simulate Large-Scale Distributed Applications.
In S. Jain,
R. R. Creasey,
J. Himmelspach,
K. P. White,
and M. Fu, editors,
Winter Simulation Conference,
Phoenix, AZ, États-Unis,
pages 10p.,
December 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle and J. Ribault.
Some Desired Features for the DEVS Architecture Description Language.
In Proceedings of the Symposium On Theory of Modeling and Simulation -- DEVS Integrative M&S Symposium (TMS/DEVS 2011),
volume Book 4 -- Symposium on Theory of Modeling & Simulation - DEVS Integrative M&S Symposium (TMS/DEVS),
Boston, MA, États-Unis,
pages 258-263,
04 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Felix and J. Galtier.
Shortest Paths and Probabilities on Time-Dependent Graphs - Applications to Transport Networks.
In Proceedings of the 11th International Conference on ITS Telecommunications,
Saint Petersburg, Russia,
pages 56--62,
August 2011.
[WWW
] [Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
and J. Moulierac.
Routage efficace en énergie.
In Ducourthial et Bertrand et Felber et Pascal, editor,
13es Rencontres Francophones sur les Aspects
Algorithmiques de Télécommunications (AlgoTel),
Cap Estérel, France,
2011.
[WWW
] [Abstract] [bibtex-entry]
-
Y. Liu and G. Simon.
Peer-Assisted Time-shifted Streaming Systems: Design and Promises.
In IEEE International Conference on Communications (ICC'2011),
Kyoto, Japan,
06 2011.
IEEE.
[PDF
] [Abstract] [bibtex-entry]
-
F. Maffray and G. Morel.
Algorithmes linéaires pour les graphes sans $P_5$ 3-colorables.
In 12e congrès annuel de la ROADEF,
2011.
[bibtex-entry]
-
P. Aboulker,
F. Havet,
and N. Trotignon.
On wheel-free graphs.
Research Report RR-7651,
INRIA,
June 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
F. Havet,
C. Linhares Sales,
B. Reed,
and S. Thomassé.
Oriented trees in digraphs.
Research Report 7502,
INRIA,
01 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted Improper Colouring.
Research Report RR-7590,
INRIA,
04 2011.
[WWW
] [PDF
]
Keywords:
graph colouring,
improper colouring,
grids,
integer programming,
algorithms.
[Abstract] [bibtex-entry]
-
J. Araujo,
V. Campos,
F. Giroire,
N. Nisse,
L. Sampaio,
and R. Soares.
On the hull number of some graph classes.
Technical report RR-7567,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Becker,
A. Kosowski,
N. Nisse,
I. Rapaport,
and K. Suchan.
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power.
Technical report RR-7746,
INRIA,
2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration with physical constraints in WDM networks.
Research Report RR-7850,
INRIA,
2011.
[WWW
] [PDF
]
Keywords:
Reconfiguration,
WDM,
NP-complete,
Physical Layer Impaiments..
[Abstract] [bibtex-entry]
-
J-C. Bermond,
A. Jean-Marie,
D. Mazauric,
and M-L. Yu.
Well Balanced Designs for Data Placement.
Research Report 7725,
INRIA,
09 2011.
[WWW
] [Abstract] [bibtex-entry]
-
S. Bessy and F. Havet.
Enumerating the edge-colourings and total colourings of a regular graph.
Research Report RR-7652,
INRIA,
June 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Campos and F. Havet.
5-choosability of graphs with 2 crossings.
Research Report RR-7618,
INRIA,
05 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. G. Chang,
F. Havet,
M. Montassier,
and A. Raspaud.
Steinberg's Conjecture and near-colorings.
Rapport de recherche RR-7669,
INRIA,
7 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
Technical report RR-7740,
INRIA,
September 2011.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
S. K. Gupta,
R. Modrzejewski,
J. Monteiro,
and S. Pérennes.
Analysis of the Repair Time in Distributed Storage Systems.
Research Report RR-7538,
INRIA,
02 2011.
[WWW
] [PDF
]
Keywords:
P2P storage systems,
data lifetime,
queuing model,
regenerating codes per- formance evaluation.
[Abstract] [bibtex-entry]
-
F. Havet and X. Zhu.
The game Grundy number of graphs.
Rapport de recherche RR-7646,
INRIA,
June 2011.
[WWW
] [PDF
]
Keywords:
colouring game,
game Grundy number,
trees,
partial 2-trees.
[Abstract] [bibtex-entry]
-
F. Maffray and G. Morel.
On 3-colorable $P_5$-free graphs.
Technical report 191,
Les Cahiers Leibniz, Laboratoire G-SCOP,
2011.
[PDF
] [bibtex-entry]
-
J. Moulierac,
T. K. Phan,
N. Thoai,
and C. Tran.
Xcast6 Treemap Islands - A Mixed Model of Application and Network Layer Multicast.
Rapport de recherche RR-7784,
INRIA,
December 2011.
[WWW
] [PDF
]
Keywords:
IP multicast,
Application Layer Multicast,
Xcast,
media streaming,
linear program,
algorithms.
[Abstract] [bibtex-entry]
BACK TO COATI PUBLICATION INDEX
Last modified: Sat Jan 29 19:00:41 2022
