|
MASCOTTE no longer exists => visit the new project-team
Conference articles
BACK TO MASCOTTE PUBLICATION INDEX
Conference articles
-
M. Ajmone-Marsan,
S. Buzzi,
L. Chiaraviglio,
M. Meo,
C. Guerrero,
F. Idzikowski,
Y. Ye,
and J. Lopez Vizcaino.
TREND: Toward Real Energy-efficient Network Design.
In SustainIT 2012 - The Second IFIP Conference on Sustainable Internet and ICT for Sustainability,
Pisa, Italy,
pages 1-6,
October 2012.
[PDF
] [Abstract] [bibtex-entry]
-
S. Baruah,
V. Bonifaci,
G. D'Angelo,
H. Li,
A. Marchetti-Spaccamela,
S. Van Der Ster,
and L. Stougie.
The preemptive uniprocessor scheduling of mixed-criticality implicit-deadline sporadic task systems.
In 24th Euromicro Conference on Real-Time Systems (ECRTS12),
Pisa, Italy,
pages 145-154,
July 2012.
IEEE.
[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.
In 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
pages 11-17,
2012.
ACM.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Belhareth,
D. Coudert,
D. Mazauric,
N. Nisse,
and I. Tahiri.
Reconfiguration with physical constraints in WDM networks.
In IEEE ICC Workshop on New Trends in Optical Networks Survivability,
Ottawa, Canada,
pages 6346-6350,
June 2012.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
G. D'Angelo,
and F. Z. Moataz.
Diverse Routing in networks with star SRLGs.
In ACM International Conference on emerging Networking EXperiments and Technologies (CoNEXT) Student Workshop,
Nice, France,
pages 1-2,
December 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Brief Announcement: Distributed Exclusive and Perpetual Tree Searching.
In 26th International Symposium on Distributed Computing (DISC),
volume 7611,
pages 403-404,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Nettoyage perpétuel de réseaux.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 31-34,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Chiaraviglio and A. Cianfrani.
On the Effectiveness of Sleep Modes in Backbone Networks with Limited Configurations.
In 20th International Conference on Software, Telecommunications and Computer Networks (SoftCOM 2012),
Split, Croatia,
pages 1-6,
September 2012.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
L. Hogie,
A. Lancin,
D. Papadimitriou,
S. Pérennes,
and I. Tahiri.
Feasibility study on distributed simulations of BGP.
In PADS - 26th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation - 2012,
Zhangjiajie, Chine,
April 2012.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
M. D'Emidio,
D. Frigioni,
and V. Maurizio.
Engineering a new loop-free shortest paths routing algorithm.
In 11th International Symposium on Experimental Algorithms (SEA2012),
volume 7276 of Lecture Notes in Computer Science,
Bordeaux, France,
pages 123-134,
June 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
M. D'Emidio,
D. Frigioni,
and D. Romano.
Enhancing the computation of distributed shortest paths on real dynamic networks.
In 1st Mediterranean Conference on Algorithms,
volume 7659 of Lecture Notes in Computer Science,
Ein-Gedi, Israel,
pages 148-158,
December 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
M. D'Emidio,
D. Frigioni,
and C. Vitale.
Fully Dynamic Maintenance of Arc-Flags in Road Networks.
In 11th International Symposium on Experimental Algorithms (SEA2012),
volume 7276 of Lecture Notes in Computer Science,
Bordeaux, France,
pages 135-147,
June 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
R. Klasing,
and A. Navarra.
Gathering of Robots on Anonymous Grids without multiplicity detection.
In 19th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2012),
volume 7355 of Lecture Notes in Computer Science,
Reykjavìk, Iceland,
pages 327-338,
June 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
and A. Navarra.
How to gather asynchronous oblivious robots on anonymous rings.
In 26th International Symposium on Distributed Computing (DISC 2012),
volume 7611 of Lecture Notes in Computer Science,
Salvador, Brazil,
pages 330-344,
October 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle and E. Mancini.
Integrated tools for the simulation analysis of peer-to-peer backup systems.
In Proceedings of the 5th International ICST Conference on Simulation Tools and Techniques,
SIMUTOOLS '12,
pages 178-183,
March 2012.
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
Satisfaire un internaute impatient est difficile.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 79-82,
2012.
Note: Best paper.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. V. Fomin,
F. Giroire,
A. Jean-Marie,
D. Mazauric,
and N. Nisse.
To Satisfy Impatient Web surfers is Hard.
In 6th International Conference on FUN with Algorithms (FUN),
volume 7288,
pages 166-176,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Moulierac,
T.K. Phan,
and F. Roudaut.
Minimization of Network Power Consumption with Redundancy Elimination.
In IFIP Networking,
Prague, Czech Republic,
pages 247-258,
May 2012.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Goldman,
P. Floriano,
and A. Ferreira.
A tool for obtaining information on DTN traces.
In Proceedings of the 4th Extreme Conference on Communication,
Zurique, CH,
2012.
[PDF
] [Abstract] [bibtex-entry]
-
F. Idzikowski,
R. Duque,
F. Jimenez,
E. Le Rouzic,
L. Chiaraviglio,
and M. Ajmone-Marsan.
Energy Saving in Optical Operator Networks: the Challenges, the TREND Vision, and Some Results.
In ECOC 2012 - European Conference and Exhibition on Optical Communication,
Amsterdam, Netherlands,
pages 1-3,
September 2012.
[PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 14es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 83-86,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Kosowski,
B. Li,
N. Nisse,
and K. Suchan.
k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth.
In 39th International Colloquium on Automata, Languages and Programming (ICALP, track C),
volume 7392,
pages 610-622,
2012.
Springer, LNCS.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Moulierac,
T.K. Phan,
N. Thoai,
and N.C. Tran.
Xcast6 Treemap Islands - Revisiting Multicast Model.
In ACM CoNEXT Student Workshop,
Nice, France,
December 2012.
ACM.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D.D. Nguyen,
T.K. Phan,
N. Thoai,
and T.T. Tran.
MaxNet and TCP Reno/RED on Mice Traffic.
In Modeling, Simulation and Optimization of Complex Processes,
pages 247-255,
2012.
Springer Berlin Heidelberg.
[WWW
] [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]
-
Sanjoy Baruah, K.,
Vincenzo Bonifaci,
G. D'Angelo,
Alberto Marchetti-Spaccamela,
Suzanne Ster, Van Der,
and Leen 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 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]
-
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]
-
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]
-
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]
-
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 and
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.
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]
-
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]
-
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]
-
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]
-
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.
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.
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.
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]
-
E. Alvarez-Miranda,
A. Candia,
X. Chen,
X. Hu,
and B. Li.
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data.
In Proceedings of the 6th International Conference on Algorithmic Aspects in Information and Management (AAIM),
volume 6124 of Lecture Notes in Computer Science,
Weihai, China,
pages 13-24,
July 2010.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
C. Linhares Sales,
and I. Sau.
Weighted Coloring on $P_4$-sparse Graphs.
In 11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
Sophia Antipolis, France,
pages 33--38,
March 2010.
[PDF
] [Abstract] [bibtex-entry]
-
J. Beauquier and J. Burman.
Self-stabilizing Synchronization in Mobile Sensor Networks with Covering.
In Distributed Computing in Sensor Systems, 6th IEEE International Conference, DCOSS 2010,
volume 6131 of Lecture Notes in Computer Science,
pages 362-378,
2010.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
J. Beauquier,
J. Burman,
J. Clement,
and S. Kutten.
On Utilizing Speed in Networks of Mobile Agents.
In Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010,
pages 305-314,
2010.
ACM.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
V. Misra,
and P. Nain.
A Distributed Scheduling Algorithm for Wireless Networks with Constant Overhead and Arbitrary Binary Interference.
In SIGMETRICS 2010,
pages 2p,
2010.
ACM.
[PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
F. Huc,
N. Nisse,
S. Pérennes,
and H. Rivano.
Stability of a localized and greedy routing algorithm.
In 12th Workshop on Advances in Parallel and Distributed Computational Models,
pages 8p,
2010.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Caillouet,
S. Perennes,
and H. Rivano.
Cross line and column generation for the cut covering problem in wireless networks.
In International Symposium on Combinatorial Optimization (ISCO),
pages 8p,
March 2010.
Note: To appear.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
Data Life Time for Different Placement Policies in P2P Storage Systems.
In Proceedings of the 3rd Intl. Conference on Data Management in Grid and P2P Systems (Globe),
volume 6265 of Lecture Notes in Computer Science,
Bilbao, Spain,
pages 75--88,
September 2010.
[PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Data Life Time for Different Placement Policies.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
P2P storage system,
data placement,
performance,
data durability,
Markov chain model.
[Abstract] [bibtex-entry]
-
J. Chalopin,
V. Chepoi,
N. Nisse,
and Y. Vaxes.
Cop and robber games when the robber can hide and ride.
In 8th French Combinatorial Conference,
Orsay,
June 2010.
Note: Selection on abstract.
[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.
In P. Boldi and L. Gargano, editors,
Fifth International conference on Fun with Algorithms (FUN 2010),
volume 6099 of Lecture Notes in Computer Science,
Ischia Island, Italy,
pages 121-132,
June 2010.
Springer.
Note: Http://hal.inria.fr/inria-00495443.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
D. Mazauric,
N. Nepomuceno,
and N. Nisse.
Tradeoffs in routing reconfiguration problems.
In Maria Gradinariu Potop-Butucaru et Hervé Rivano, editor,
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert.
Graph searching games for the WDM reconfiguration problem.
In 24th European Conference on Operational Research (EURO),
Lisbon, Portugal,
pages 1p,
July 2010.
Note: Invited talk.
[WWW
] [Abstract] [bibtex-entry]
-
P. Giabbanelli.
Impact of complex network properties on routing in backbone networks.
In Proceedings of the IEEE Globecom 2010 Workshop on Complex and Communication Networks (CCNet 2010),
2010.
[PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli,
A. Alimadad,
V. Dabbaghian,
and D. T. Finegood.
Modeling the influence of social networks and environment on energy balance and obesity.
In XI International Conference on Obesity (ICO),
July 2010.
Note: Acceptance rate 8.6%.
[bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and J-C. Bermond.
Average path length of deterministic and stochastics recursive networks.
In Proceedings of the 2nd Workshop on Complex Networks (CompleNet),
volume 116 of Communications in Computer and Information Science (CCIS),
pages 1--12,
2010.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
P. Giabbanelli,
D. Mazauric,
and S. Pérennes.
Computing the average path length and a label-based routing in a small-world graph.
In 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'10),
Belle Dune France,
pages 4p,
2010.
[WWW
] [PDF
]
Keywords:
Recursive graph,
Labeling scheme,
Decentralized routing.
[Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
J. Moulierac,
and B. Onfroy.
Minimizing Routing Energy Consumption: from Theoretical to Practical Results.
In IEEE/ACM International Conference on Green Computing and Communications (GreenCom'10),
Hangzhou, China,
pages 8,
2010.
[PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
Peer-to-Peer Storage Systems: a Practical Guideline to be Lazy.
In Proceedings of the IEEE Global Communications Conference (GLOBECOM),
Miami, EUA,
pages 1-6,
12 2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
Comment battre la marche aléatoire en comptant ?.
In 12ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'10),
pages 4p,
2010.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Hanusse,
D. Ilcinkas,
A. Kosowski,
and N. Nisse.
Locating a target with an agent guided by unreliable local advice.
In 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC'10),
volume XXXX,
pages 10p,
2010.
ACM.
Note: To appear.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet and L. Sampaio.
On the Grundy number of a graph.
In Proceedings of the International Symposium on Parameterized and Exact Computation(IPEC),
number 6478 of Lecture Notes on Computer science,
pages 170-179,
December 2010.
[PDF
] [Abstract] [bibtex-entry]
-
L. Hogie,
D. Papadimitriou,
I. Tahiri,
and F. Majorczyk.
Simulating routing schemes on large-scale topologies.
In 24th ACM/IEEE/SCS Workshop on Principles of Advanced and Distributed Simulation (PADS),
Atlanta,
pages 8p,
May 2010.
[Abstract] [bibtex-entry]
-
B. Jaumard,
N.N. Bhuiyan,
S. Sebbah,
F. Huc,
and D. Coudert.
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks.
In 10th INFORMS Telecommunications Conference,
Montréal, Canada,
pages 2p,
May 2010.
Informs.
[WWW
] [Abstract] [bibtex-entry]
-
B. Jaumard,
N.N. Bhuiyan,
S. Sebbah,
F. Huc,
and D. Coudert.
A New Framework for Efficient Shared Segment Protection Scheme for WDM Networks.
In IEEE High Performance Switching and Routing (HPSR),
Richardson, TX, USA,
pages 8p,
June 2010.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. B. Mertzios,
I. Sau,
and S. Zaks.
The Recognition of Tolerance and Bounded Tolerance Graphs.
In Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science (STACS),
volume 5 of LIPIcs,
pages 585-596,
2010.
Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Monteiro and S. Pérennes.
Systèmes de stockage P2P : un guide pratique.
In 11es Journées Doctorales en Informatique et Réseaux (JDIR 2010),
Sophia Antipolis France,
pages 15--20,
2010.
[WWW
] [Abstract] [bibtex-entry]
-
N. Nisse.
Graph Searching and Graph Decompositions.
In 24th European Conference on Operational Research (EURO),
Lisbon, Portugal,
pages 1p,
July 2010.
Note: Invited talk.
[WWW
] [Abstract] [bibtex-entry]
-
J. Ribault,
O. Dalle,
D. Conan,
and S. Leriche.
OSIF: A Framework To Instrument, Validate, and Analyze Simulations.
In In Proc. of 3rd Intl. ICST Conference on Simulation Tools and Techniques (SIMUTools'2010),
Torremolinos, Spain,
15-19 March 2010.
[WWW
] [Abstract] [bibtex-entry]
-
P. Uribe,
J-C. Maureira Bravo,
and O. Dalle.
Extending INET Framework for Directional and Asymmetrical Wireless Communications.
In Proc. of the 2010 Intl. ICST Workshop on OMNeT++ (OMNeT++ 2010),
Torremolinos, Spain,
pages 1--8,
15-19 March 2010.
[bibtex-entry]
-
E. Altman,
P. Nain,
and J-C. Bermond.
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks.
In INFOCOM 2009,
Rio De Janeiro, Brazil,
pages 1431 - 1439,
April 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
N. Cohen,
F. Giroire,
and F. Havet.
Good edge-labelling of graphs.
In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09),
volume 35 of Electronic Notes in Discrete Mathematics,
Gramado, Brazil,
pages 275--280,
December 2009.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
J. Araujo and C. Linhares Sales.
Grundy number on $P_4$-classes.
In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'09),
volume 35 of Electronic Notes in Discrete Mathematics,
Gramado, Brazil,
pages 21--27,
December 2009.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
P. Moura,
and M. Campêlo.
Sobre a complexidade de Coloração Mista.
In Encontro Regional de Pesquisa Operacional do Nordeste,
Fortaleza, Brazil,
pages 1--10,
December 2009.
[PDF
] [Abstract] [bibtex-entry]
-
D. Barman,
J. Chandrashekar,
N. Taft,
M. Faloutsos,
L. Huang,
and F. Giroire.
Impact of IT Monoculture on Behavioral End Host Intrusion Detection.
In ACM SIGCOMM Workshop on Research on Enterprise Networking -- WREN,
Barcelona, Spain,
pages 27--36,
August 2009.
ACM.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
H. Rivano,
I. Sau,
and F. Solano Donado.
MPLS label stacking on the line network.
In L. Fratta et al., editor,
IFIP Networking,
volume 5550 of Lecture Notes in Computer Science,
Aachen, Germany,
pages 809-820,
May 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Perennes,
I. Sau,
and F. Solano Donado.
Designing Hypergraph Layouts to GMPLS Routing Strategies.
In 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 5869 of Lecture Notes in Computer Science,
Piran, Slovenia,
pages 57--71,
May 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Mazauric,
and P. Nain.
Algorithmes distribués d'ordonnancement dans les réseaux sans-fil.
In 10èmes Journées Doctorales en Informatique et Réseaux (JDIR),
Belfort, France,
February 2009.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
N. Nisse,
P. Reyes,
and H. Rivano.
Fast Data Gathering in Radio Grid Networks.
In 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09),
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. C. Bermond,
N. Nisse,
P. Reyes,
and H. Rivano.
Minimum delay Data Gathering in Radio Networks.
In Proceedings of the 8th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),
volume 5793 of Lecture Notes in Computer Science,
pages 69-82,
2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Bilò,
M. Flammini,
G. Monaco,
and L. Moscardelli.
On the performances of Nash Equilibria in Isolation Games.
In Proceedings of the 15th International Computing and Combinatorics Conference (COCOON 2009),
volume 5609 of Lecture Notes in Computer Science,
Niagara Falls, New York, U.S.A.,
pages 17-26,
July 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Casteigts,
S. Chaumette,
and A. Ferreira.
Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks.
In Proc. of 16th Intl. Conference on Structural Information and Communication Complexity (SIROCCO'09),
volume 5869 of Lecture Notes in Computer Science,
Piran, Slovenia,
pages 126-140,
May 2009.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
F. V. Fomin,
G. Gutin,
E. J. Kim,
S. Saurabh,
and A. Yeo.
Algorithm for Finding -Vertex Out-trees and Its Application to -Internal Out-branching Problem.
In 15th Annual International Conference on Computing and Combinatorics (COCOON),
volume 5609 of Lecture Notes in Computer Science,
pages 37-46,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
F. Havet,
and T. Müller.
Acyclic edge-colouring of planar graphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009),
volume 34 of Electronic Notes on Discrete Mathematics,
Bordeaux, France,
pages 417-421,
September 2009.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Giroire,
and I. Sau.
Edge-Simple Circuits Through 10 Ordered Vertices in Square Grids.
In J. Kratochvìl and M. Miller, editors,
20th International Workshop on Combinatorial Algorithms -- IWOCA,
volume 5874 of Lecture Notes in Computer Science,
Hradec nad Moravicì, Czech Republic,
pages 134-145,
June 2009.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration dans les réseaux optiques.
In A. Chaintreau and C. Magnien, editors,
11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09),
Carry le Rouet,
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
D. Mazauric,
N. Nisse,
and J-S. Sereni.
Reconfiguration of the Routing in WDM Networks with Two Classes of Services.
In 13th Conference on Optical Network Design and Modeling (ONDM),
Braunschweig, Germany,
pages 6p,
February 2009.
IEEE.
[WWW
] [Abstract] [bibtex-entry]
-
D. Coudert,
D. Mazauric,
and N. Nisse.
On Rerouting Connection Requests in Networks with Shared Bandwidth.
In DIMAP workshop on Algorithmic Graph Theory (AGT09),
volume 32 of Electronic Notes in Discrete Mathematics,
Warwick, UK,
pages 109-116,
March 2009.
Elsevier.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
N. Nepomuceno,
and H. Rivano.
Joint Optimization of Routing and Radio Configuration in Fixed Wireless Networks.
In A. Chaintreau and C. Magnien, editors,
11ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'09),
Carry le Rouet,
pages 4p,
June 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
N. Nepomuceno,
and H. Rivano.
Minimizing Energy Consumption by Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks.
In First IEEE WoWMoM Workshop on Hot Topics in Mesh Networking (HotMESH),
Kos, Greece,
pages 6p,
June 2009.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
F. Giroire,
J. Monteiro,
and S. Pérennes.
Analyse des Corrélations entre Pannes dans les Systèmes de Stockage Pair-à-Pair.
In Augustin Chaintreau and Clemence Magnien, editors,
11ème rencontres francophones sur les Aspects Algorithmiques des Télécommunications (Algotel'2009),
Carry-Le-Rouet France,
pages 4p,
2009.
Note: Best Student Paper Award.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
F. Giroire,
J. Monteiro,
and S. Pérennes.
Analysis of Failure Correlation Impact on Peer-to-Peer Storage Systems.
In Proceedings of the 9th IEEE International Conference on Peer-to-Peer Computing (P2P),
pages 184--193,
September 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira.
Road-mapping the Digital Revolution: Visions from COST Foresight 2030 (An exercise in multi-disciplinarity).
In Proceedings of IEEE Wireless VITAE'09,
Aalborg, Denmark,
pages 5p,
May 2009.
IEEE Press.
[PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
A. Marchetti-Spaccamela,
G. Monaco,
L. Moscardelli,
and S. Zaks.
On the complexity of the regenerator placement problem in optical networks.
In Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2009),
Calgary, Canada,
pages 154-162,
August 2009.
ACM.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Flammini,
G. Monaco,
L. Moscardelli,
H. Shachnai,
M. Shalom,
T. Tamir,
and S. Zaks.
Minimizing total busy time in parallel scheduling with application to optical networks.
In Proceedings of the 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS 2009),
Rome, Italy,
pages 1-12,
May 2009.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Fountoulakis and B. Reed.
A general critical condition for the emergence of a giant component in random graphs with given degrees.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009),
volume 34 of Electronic Notes on Discrete Mathematics,
Bordeaux, France,
pages 639--645,
September 2009.
[bibtex-entry]
-
P. Giabbanelli.
Why having in-person lectures when e-learning and podcasts are available?.
In Proceedings of the 14th Western Canadian Conference on Computing Education (ACM SIGCSE),
pages 42-44,
2009.
[bibtex-entry]
-
F. Giroire,
J. Chandrashekar,
N. Taft,
E. Schooler,
and K. Papagiannaki.
Exploiting Temporal Persistence to Detect Covert Botnet Channels.
In Springer, editor,
12th International Symposium on Recent Advances in Intrusion Detection (RAID'09),
volume 5758 of Lecture Notes in Computer Science,
Saint Malo, France,
pages 326--345,
September 2009.
[PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: How Much Locality Can They Tolerate?.
In Proceedings of the 34th IEEE Conference on Local Computer Networks (LCN),
pages 320--323,
October 2009.
[PDF
]
Keywords:
P2P storage system,
data placement,
performance evaluation,
data durability.
[Abstract] [bibtex-entry]
-
C. Gomes and J. Galtier.
Optimal and Fair Transmission Rate Allocation Problem in Multi-hop Cellular Networks.
In 8th International Conference on AD-HOC Networks & Wireless (ADHOC NOW),
volume 5793 of Lecture Notes in Computer Science,
Murcia, Spain,
pages 327-340,
September 2009.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
D. Gonçalves,
F. Havet,
A. Pinlou,
and S. Thomassé.
Spanning galaxies in digraphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009),
volume 34 of Electronic Notes on Discrete Mathematics,
Bordeaux, France,
pages 139--143,
September 2009.
[PDF
] [Abstract] [bibtex-entry]
-
F. Guinand and B. Onfroy.
MANET : étude de l'impact de la mobilité sur la connexité du réseau.
In 11èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'09),
pages 2p,
June 2009.
Note: Poster.
[PDF
]
Keywords:
réseau mobile ad-hoc,
graphe dynamique,
MANET,
connexité,
algorithme.
[Abstract] [bibtex-entry]
-
F. Havet and C. Linhares Sales.
Combinatória e Problemas em Redes de Telecomunicações.
In Colloque d'Informatique: Brésil / INRIA, Coopérations, Avancées et Défis,
Bento Gonçalves, Brazil,
pages 4p,
July 2009.
[PDF
] [Abstract] [bibtex-entry]
-
J. Himmelspach,
O. Dalle,
and J. Ribault.
Design considerations for M&S software.
In D. Rossetti,
R. R. Hill,
B. Johansson,
A. Dunkin,
and R. G. Ingalls, editors,
Proceedings of the Winter Simulation Conference (WSC'09),
Austin, TX,
pages 12p,
December 2009.
Note: Invited Paper.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
A nearly linear time algorithm for the half integral parity disjoint paths packing problem.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2009),
pages 1183--1192,
January 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
Hadwiger's Conjecture is decidable.
In 41th ACM Symposium on Theory of Computing (STOC 2009),
pages 445--454,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Kennedy,
C. Meagher,
and B. Reed.
Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2009),
volume 34 of Electronic Notes on Discrete Mathematics,
Bordeaux, France,
pages 47--51,
September 2009.
[Abstract] [bibtex-entry]
-
Z. Li and I. Sau.
Graph Partitioning and Traffic Grooming with Bounded Degree Request Graph.
In 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009),
volume 5911 of Lecture Notes in Computer Science,
pages 250-261,,
June 2009.
Note: Best student paper award.
[PDF
] [Abstract] [bibtex-entry]
-
C. Linhares Sales and L. Sampaio.
b-coloring of m-tight graphs.
In T. Liebling and J. Szwarcfiter, editors,
LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium,
volume 35 of Electronic Notes in Discrete Mathematics,
Gramado, Brazil,
pages 209 - 214,
March 2009.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Maureira Bravo,
D. Dujovne,
and O. Dalle.
Generation of Realistic 802.11 Interferences in the OMNeT++ INET Framework Based on Real Traffic Measurements.
In Second International Workshop on OMNeT++,
Rome, Italy,
pages 8p,
March 2009.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Maureira Bravo,
P. Uribe,
O. Dalle,
T. Asahi,
and J. Amaya.
Component based approach using OMNeT++ for Train Communication Modeling.
In Proceedings of 9th International Conference on ITS Telecommunication,
Lille, France,
pages 6p,
October 2009.
[PDF
] [Abstract] [bibtex-entry]
-
G. Mertzios,
I. Sau,
and S. Zaks.
A New Intersection Model and Improved Algorithms for Tolerance Graphs.
In 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009),
volume 5911 of Lecture Notes in Computer Science,
pages 285-295,
06 2009.
[PDF
] [Abstract] [bibtex-entry]
-
C. Molle and M-E. Voge.
Effects of the Acknowledgment Traffic on the Capacity of Wireless Mesh Networks.
In 69th IEEE Vehicular Technology Conference (VTC2009-Spring),
Barcelona, Spain,
pages 5p,
April 2009.
[PDF
] [Abstract] [bibtex-entry]
-
M. Molloy and B. A. Reed.
Asymptotically optimal frugal colouring.
In Proceedings of Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),
pages 106-114,
2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse,
I. Rapaport,
and K. Suchan.
Distributed computing of efficient routing schemes in generalized chordal graphs.
In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 5869 of Lecture Notes in Computer Science,
Piran, Slovenia,
pages 252-265,
2009.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
J. Ribault and O. Dalle.
OSA : A Federative Simulation Platform.
In Proceedings of the Winter Simulation Conference (WSC'09),
Austin, TX, USA,
2009.
Note: Ph.D. Colloquium.
[WWW
] [Abstract] [bibtex-entry]
-
I. Sau and D. M. Thilikos.
On Self-Duality of Branchwidth in Graphs of Bounded Genus.
In 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization (CTW),
Paris, France,
pages 19-22,
June 2009.
[PDF
] [Abstract] [bibtex-entry]
-
I. Sau and D. M. Thilikos.
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs.
In DIMAP workshop on Algorithmic Graph Theory (AGT09),
volume 32 of Electronic Notes in Discrete Mathematics,
Warwick, UK,
pages 59-66,
March 2009.
Elsevier.
[PDF
] [Abstract] [bibtex-entry]
-
A. Silva,
P. Reyes,
and M. Debbah.
Congestion in Randomly Deployed Wireless Ad-Hoc and Sensor Networks.
In International Conference on Ultra Modern Telecommunications,
St. Petersburg, Russia,
pages 10p,
October 2009.
[WWW
] [PDF
]
Keywords:
Random Matrix Theory,
Random Graph Theory,
Wireless Ad-Hoc Networks,
Wireless Sensor Networks.
[Abstract] [bibtex-entry]
-
F. Solano Donado and J. Moulierac.
Routing in All-Optical Label Switched-based Networks with Small Label Spaces.
In 13th Conference on Optical Network Design and Modeling (ONDM),
Braunschweig, Germany,
pages 6p,
February 2009.
IFIP/IEEE.
[WWW
] [Abstract] [bibtex-entry]
-
L. Addario-Berry,
O. Amini,
J.-S. Sereni,
and S. Thomassé.
Guarding art galleries: the extra cost for sculptures is linear.
In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT 2008),
volume 5124 of Lecture Notes in Computer Science,
pages 41-52,
July 2008.
Springer.
[bibtex-entry]
-
A. Aguiar,
P.R. Pinheiro,
A.L.V Coelho,
N. Nepomuceno,
A. Neto,
and R. Cunha.
Scalability Analysis of a Novel Integer Programming Model to Deal with Energy Consumption in Heterogeneous Wireless Sensor Networks.
In Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO'08),
volume 14 of Communications in Computer and Information Science,
pages 11-20,
2008.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Griffiths,
and F. Huc.
4-cycles in mixing digraphs.
In Electronic Notes in Discrete MathematicsVolume 30, The IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07),
volume 30,
Puerto Varas, Chile,
pages 63--68,
February 2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
Degree-Constrained Subgraph Problems : Hardness and Approximation Results.
In 6th International Workshop on Approximation and Online Algorithms (ALGO-WAOA 2008),
volume 5426 of Lecture Notes in Computer Science,
Karlsruhe, Germany,
pages 29-42,
September 2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
I. Sau,
and S. Saurabh.
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.
In The International Workshop on Parameterized and Exact Computation (IWPEC 2008),
volume 5008 of Lecture Notes in Computer Science,
Victoria, Canada,
pages 13-29,
May 2008.
[PDF
] [Abstract] [bibtex-entry]
-
M. Asté,
F. Havet,
and C. Linhares-Sales.
Grundy number and lexicographic product of graphs.
In Proceedings of International Conference on Relations, Orders and Graphs and their Interaction with Computer Science (ROGICS 2008),
pages 9p,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
L. Gargano,
and A.A. Rescigno.
Gathering with minimum delay in tree sensor networks.
In SIROCCO 2008,
volume 5058 of Lecture Notes in Computer Science,
Villars-sur-Ollon, Switzerland,
pages 262-276,
June 2008.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M-L. Yu.
Optimal gathering algorithms in multi-hop radio tree networks with interferences.
In Proceedings of the 7th international conference on Ad Hoc Networks and Wireless (AdHoc-Now),
volume 5198 of Lecture Notes in Computer Science,
pages 204-217,
September 2008.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
A distributed algorithm for computing and updating the process number of a forest (brief announcement).
In G. Taubenfeld, editor,
22nd International Symposium on Distributed Computing (DISC),
volume 5218 of Lecture Notes in Computer Science,
Arcachon, France,
pages 500-501,
September 2008.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
Algorithme générique pour les jeux de capture dans les arbres.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
Saint-Malo,
pages 37--40,
May 2008.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
Computing and updating the process number in trees (short paper).
In T. Baker and S. Tixeuil, editors,
12th International Conference On Principles Of DIstributed Systems (OPODIS),
volume 5401 of Lecture Notes in Computer Science,
Luxor, Egypt,
pages 546-550,
December 2008.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
F. Peix,
and M.-E. Voge.
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints.
In IEEE ICC,
number ON01-6,
Beijing, China,
pages 5170 - 5174,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Dalle,
B.P. Zeigler,
and G.A. Wainer.
Extending DEVS to support multiple occurrence in component-based simulation.
In S. J. Mason,
R. R. Hill,
L. Moench,
and O. Rose, editors,
Proceedings of the 2008 Winter Simulation Conference,
pages 10p,
December 2008.
[PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
J. Chandrashekar,
G. Iannaccone,
D. Papagiannaki,
E. Schooler,
and N. Taft.
The Cubicle vs. The Coffee Shop: Behavioral Modes in Enterprise End-Users.
In Proceeding of the Passive and Active Monitoring conference (PAM08),
volume 4979 of Lecture Notes in Computer Science,
pages 202-211,
2008.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
G. Huiban,
and H. Rivano.
A Branch-and-Price Approach to the Bandwidth Allocation Problem in Wireless Networks.
In International Symposium on Combinatorial Optimization (CO),
pages 1p,
March 2008.
Note: Abstract.
[PDF
] [bibtex-entry]
-
C. Gomes,
C. Molle,
and P. Reyes.
Optimal Design of Wireless Mesh Networks.
In 9èmes Journées Doctorales en Informatique et Réseaux (JDIR 2008),
Villeneuve d'Ascq, France,
pages 10p,
January 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
S. Pérennes,
P. Reyes,
and H. Rivano.
Bandwidth Allocation in Radio Grid Networks.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
S. Pérennes,
and H. Rivano.
Bottleneck Analysis for Routing and Call Scheduling in Multi-hop Wireless Networks.
In 4th IEEE Workshop on Broadband Wireless Access (BWA),
New-Orleans, US,
pages 6p,
December 2008.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
B. Reed,
and J.-S. Sereni.
L(2,1)-labelling of graphs.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008),
pages 621-630,
January 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Hogie,
G. Danoy,
P. Bouvry,
and F. Guinand.
A Context-Aware Broadcast Protocol for DTNs.
In Modelling, Computation and Optimization in Information Systems and Management Sciences (MCO'08),
volume 14 of Communications in Computer and Information Science,
pages 507-519,
September 2008.
Springer.
[PDF
] [Abstract] [bibtex-entry]
-
C.-C. Huang,
T. Kavitha,
D. Michail,
and M. Nasre.
Bounded Unpopularity Matchings.
In 11th Scandinavian Workshop on Algorithm Theory (SWAT).,
volume 5124 of Lecture Notes in Computer Science,
pages 127-137,
July 2008.
[Abstract] [bibtex-entry]
-
F. Huc,
C. Linhares-Sales,
and H. Rivano.
The Proportional Colouring Problem: Optimizing Buffers in Radio Mesh Networks.
In IV Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 07),
volume 30 of Electronic Notes in Discrete Mathematics,
Puerto Varas, Chile,
pages 141--146,
February 2008.
Elsevier.
[PDF
] [Abstract] [bibtex-entry]
-
D. Ilcinkas,
N. Nisse,
and D. Soguet.
Le cout de la monotonie dans les stratégies d'encerclement réparti.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
A nearly linear time algorithm for the half integral disjoint paths packing.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2008),
pages 446-454,
2008.
[PDF
] [Abstract] [bibtex-entry]
-
Z. Li and B. Reed.
Optimization and Recognition for ${K}_5$-minor Free Graphs in Linear Time.
In Proceedings of LATIN,
pages 206-215,
2008.
[bibtex-entry]
-
C. Molle,
F. Peix,
S. Pérennes,
and H. Rivano.
Formulation en Coupe/Rounds pour le Routage dans les réseaux radio maillés.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Molle,
F. Peix,
S. Pérennes,
and H. Rivano.
Optimal Routing and Call Scheduling in Wireless Mesh Networks with Localized Information.
In C. Kaklamanis and F. Nielson, editors,
the fourth Symposium on Trustworthy Global Computing (TGC 2008),
volume 5474 of Lecture Notes in Computer Science,
Barcelona, Spain,
pages 171-185,
November 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Molle,
F. Peix,
and H. Rivano.
An optimization framework for the joint routing and scheduling in wireless mesh networks.
In Proc. 19th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC'08),
Cannes, France,
September 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Molle,
F. Peix,
and H. Rivano.
Génération de colonnes pour le routage et l'ordonnancement dans les réseaux radio maillés.
In Colloque francophone sur l'ingénierie des protocoles (CFIP 2008),
pages 12p,
March 2008.
Note: Best student paper award.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Molle and M.-E. Voge.
Influence des acquittements sur la capacité des réseaux radio maillés.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
May 2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Monteiro.
The use of Evolving Graph Combinatorial Model in Routing Protocols for Dynamic Networks.
In Proceedings of the XV Concurso Latinoamericano de Tesis de Maestrìa (CLEI'08),
Santa Fe, Argentina,
pages 41--57,
September 2008.
Note: Third prize in the CLEI'08 Master's Thesis Contests.
[PDF
] [Abstract] [bibtex-entry]
-
X. Muñoz and I. Sau.
Traffic Grooming in Unidirectional WDM Rings with Bounded-Degree Request Graph.
In 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008),
volume 5344 of Lecture Notes in Computer Science,
pages 300-311,
June 2008.
[PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and K. Suchan.
Fast Robber in Planar Graphs.
In Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 5344 of Lecture Notes in Computer Science,
pages 33-44,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and K. Suchan.
Voleur véloce dans un réseau planaire.
In 10èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel'08),
pages 4p,
2008.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Ribault and O. Dalle.
Enabling advanced simulation scenarios with new software engineering techniques.
In 20th European Modeling and Simulation Symposium (EMSS 2008),
Briatico, Italy,
pages 6p,
2008.
[PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness and Approximation of Traffic Grooming.
In The 18th International Symposium on Algorithms and Computation (ISAAC 2007),
volume 4835 of Lecture Notes in Computer Science,
Sendai, Japan,
pages 561-573,
December 2007.
Springer-Verlag.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
S. Pérennes,
and I. Sau.
Hardness of Approximating the Traffic Grooming.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 45-48,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini and B. Reed.
List Colouring Constants of Triangle Free Graphs.
In IV Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS 07),
Puerto Varas, Chile,
pages 6p,
November 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo and C. Linhares Sales.
Teorema de Hajós para Coloração Ponderada.
In XXXIX Simpósio Brasileiro de Pesquisa Operacional,
Fortaleza, Brazil,
pages 5p,
August 2007.
[PDF
] [Abstract] [bibtex-entry]
-
N. Ben Ali,
J. Moulierac,
B. Belghith,
and M. Molnár.
mQMA: multi-constrained QoS Multicast Aggregation.
In IEEE Global Telecommunications Conference (IEEE GLOBECOM 2007),
Washington DC, USA,
pages 5p,
November 2007.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and M. Cosnard.
Minimum number of wavelengths equals load in a DAG without internal cycle.
In Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International,
Long Beach, CA, U.S.A.,
pages 1-10,
March 2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
F. Giroire,
and S. Pérennes.
Design of Minimal Fault Tolerant On-Board Networks : Practical constructions.
In 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO 07),
volume 4474 of Lecture Notes in Computer Sciences,
Castiglioncello, Italy,
pages 261-273,
June 2007.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
F. Havet,
F. Huc,
and C. Linhares-Sales.
Allocation de fréquences et coloration impropre des graphes hexagonaux pondérés.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 53-56,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Bessy,
N. Lichiardopol,
and J.-S. Sereni.
Two proofs of Bermond-Thomassen conjecture for regular tournaments.
In Proceedings of the sixth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications,
volume 28 of Electronic Notes in Discrete Mathematics,
pages 47--53,
2007.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
E. Birmele,
J. A. Bondy,
and B. Reed.
Brambles, Prisms and Grids.
In Proceedings of a Conference in Memory of Claude Berge, Graph Theory in Paris,
Basel,
pages 37-44,
2007.
Birkhauser.
[bibtex-entry]
-
R. Chand,
L. Liquori,
and M. Cosnard.
Improving Resource Discovery in the Arigatoni Overlay Network.
In 20th International Conference on Architecture of Computing Systems (ARCS 2007),
volume 4415 of Lecture Notes in Computer Science,
Zurich, Switzerland,
pages 98--111,
2007.
Springer.
[PDF
] [bibtex-entry]
-
A. Chattopadhyay and B. Reed.
Properly 2-Colouring Linear Hypergraphs.
In 11th Intl. Workshop on Randomization and Computation (RANDOM 2007),
volume 4627 of Lecture Notes in Computer Science,
Princeton University, NJ, USA,
pages 395-408,
2007.
Springer.
[PDF
] [bibtex-entry]
-
M. Cosnard,
L. Liquori,
and R. Chand.
Virtual Organizations in Arigatoni.
In DCM, International Workshop on Developpment in Computational Models,
volume 171 of Electronique Notes in Theoretical Computer Science,
pages 55--75,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
O. Dalle.
Component-based Discrete Event Simulation Using the Fractal Component Model.
In AI, Simulation and Planning in High Autonomy Systems (AIS)-Conceptual Modeling and Simulation (CMS) Joint Conference,
Buenos Aires, AR,
pages 213--218,
February 2007.
[PDF
] [bibtex-entry]
-
O. Dalle.
The OSA Project: an Example of Component Based Software Engineering Techniques Applied to Simulation.
In Proc. of the Summer Computer Simulation Conference (SCSC'07),
San Diego, CA, USA,
pages 1155--1162,
July 2007.
Note: Invited paper.
[PDF
] [bibtex-entry]
-
O. Dalle and C. Mrabet.
An Instrumentation Framework for component-based simulations based on the Separation of Concerns paradigm.
In Proc. of 6th EUROSIM Congress (EUROSIM'2007),
Ljubljana, Slovenia,
pages 10p,
September 2007.
[PDF
] [bibtex-entry]
-
O. Dalle and G. Wainer.
An Open Issue on Applying Sharing Modeling Patterns in DEVS.
In Proc. of the DEVS Workshop of the Summer Computer Simulation Conference (SCSC'07),
San Diego, CA,
July 2007.
Note: Short paper.
[PDF
] [bibtex-entry]
-
G. Danoy,
P. Bouvry,
and L. Hogie.
Coevolutionary Genetic Algorithms for Ad Hoc Injection Networks Design Optimization.
In Proceedings of the IEEE Congress on Evolutionary Computation - CEC,
Singapore,
pages 8p,
September 2007.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and J. Monteiro.
On the evaluation of shortest journeys in dynamic networks.
In Proceedings of the 6th IEEE International Symposium on Network Computing and Applications,
Cambridge, MA, USA,
pages 3--10,
July 2007.
Note: Invited Paper.
[PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and J. Monteiro.
Using Evolving Graphs Foremost Journey to Evaluate Ad-Hoc Routing Protocols.
In Proceedings of 25th Brazilian Symposium on Computer Networks (SBRC'07),
Belem, Brazil,
pages 17--30,
June 2007.
[PDF
] [Abstract] [bibtex-entry]
-
E. Fusy and F. Giroire.
Estimating the number of active flows in a data stream over a sliding window.
In David Appelgate, editor,
Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics,
pages 223-231,
2007.
SIAM Press.
Note: Proceedings of the New Orleans Conference.
[PDF
] [Abstract] [bibtex-entry]
-
J. Galtier.
Analysis and optimization of MAC with constant size congestion window for WLAN.
In The Second International Conference on Systems and Networks Communications (ICSNC'07),
Cap Esterel, French Riviera, France,
pages 6p,
August 2007.
[PDF
] [bibtex-entry]
-
C. Gomes and G. Huiban.
Multiobjective Analysis in Wireless Mesh Networks.
In International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS),
pages 103--108,
October 2007.
Bogazici University, Istanbul, Turkey,
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes,
C. Molle,
P. Reyes,
and H. Rivano.
Models for Optimal Wireless Mesh Network Design.
In The 22nd European Conference on Operational Research (EURO XXII),
Prague,
pages 1p,
July 2007.
[Abstract] [bibtex-entry]
-
C. Gomes,
C. Molle,
P. Reyes,
and H. Rivano.
Placement Optimal de points d'accès dans les réseaux radio maillés.
In Neuvièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'07),
Ile d'Oléron, France,
pages 117-120,
May 2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
J. van den Heuvel,
C. McDiarmid,
and B. Reed.
List colouring squares of planar graphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007),
volume 29 of Electronic Notes in Discrete Mathematics,
Sevilla, Spain,
pages 515-519,
September 2007.
[PDF
] [bibtex-entry]
-
G. Huiban and P. Datta.
Multi-Metrics Reconfiguration in Core WDM Networks.
In International Workshop on the Design of Reliable Communication Networks (DRCN),
La Rochelle, France,
pages 8p,
October 2007.
SEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Ilcinkas,
N. Nisse,
and D. Soguet.
The Cost of Monotonicity in Distributed Graph Searching.
In OPODIS,
volume 4878 of Lecture Notes in Computer Science,
Guadeloupe, France,
pages 415-428,
December 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
K. Kawarabayashi and B. Reed.
Computing crossing number in linear time..
In 39th ACM Symposium on Theory of Computing (STOC 2007),
San Diego, CA, USA,
pages 382-390,
June 2007.
[bibtex-entry]
-
A. King and B. Reed.
Asymptotics of the chromatic number for quasi-line graphs.
In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2007),
volume 29 of Electronic Notes in Discrete Mathematics,
Sevilla, Spain,
pages 327-331,
September 2007.
[bibtex-entry]
-
L. Liquori and M. Cosnard.
Logical Networks: Towards Foundations for Programmable Overlay Networks and Overlay Computing Systems.
In 3rd Symposium on Trustworthy Global Computing (TGC 2007),
volume 4912 of Lecture Notes in Computer Science,
Sophia Antipolis, France,
pages 90-107,
November 2007.
Springer.
[PDF
] [bibtex-entry]
-
L. Liquori and M. Cosnard.
Weaving Arigatoni with a Graph Topology.
In International Conference on Advanced Engineering Computing and Applications in Sciences (ADVCOMP 2007),
Papeete, French Polynesia,
pages 8p,
November 2007.
IEEE Computer Society Press.
[PDF
] [bibtex-entry]
-
F. Mazoit and N. Nisse.
Monotonicity of Non-deterministic Graph Searching.
In Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 4769 of Lecture Notes in Computer Science,
Dornburg, Germany,
pages 33-44,
June 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nepomuceno,
P. R. Pinheiro,
and A. L. V. Coelho.
Combining Metaheuristics and Integer Linear Programming: A Hybrid Methodology Applied to the Container Loading Problem.
In XX Concurso de Teses e Dissertações (CTD),
Rio de Janeiro, Brazil,
pages 2028-2032,
2007.
[PDF
] [bibtex-entry]
-
N. Nepomuceno,
P. R. Pinheiro,
and A. L. V. Coelho.
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms.
In 7th European Conference on Evolutionary Computation in Combinatorial Optimization (EvoCOP),
Valencia, Spain,
pages 154-165,
2007.
[WWW
] [PDF
] [bibtex-entry]
-
N. Nisse and D. Soguet.
Graph Searching with Advice.
In Proceedings of the 14th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 4474 of Lecture Notes in Computer Science,
Castiglioncello, Italy,
pages 51-65,
June 2007.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and D. Soguet.
Stratégies d'encerclement avec information.
In 9èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 49-52,
2007.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
I. Sau and J. Zerovnik.
Optimal Permutation Routing on Mesh Networks.
In Proc. of International Network Optimization Conference (INOC 2007),
Spa, Belgium,
pages 6p,
April 2007.
[PDF
] [Abstract] [bibtex-entry]
-
A. da Silva,
A. da Silva,
and C. Linhares-Sales.
Largura em Árvore de Grafos Planares Livres de Ciclos Pares Induzidos.
In XXXIX Congresso da Sociedade Brasileira de Pesquisa Operacional (SBPO 2007),
Fortaleza, Brazil,
August 2007.
[WWW
] [bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Fair power and transmission rate control in wireless networks.
In The Third Annual Conference on Wireless On demand Network Systems and Services,
pages 134--143,
2006.
[PDF
] [bibtex-entry]
-
O. Amini,
J-C. Bermond,
F. Giroire,
F. Huc,
and S. Pérennes.
Design of Minimal Fault Tolerant Networks: Asymptotic Bounds.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel, France,
pages 37--40,
May 2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M. Ancona,
W. Cazzola,
S. Drago,
and G. Quercini.
Visualizing and Managing Network Topologies via Rectangular Dualization.
In ISCC '06: Proceedings of the 11th IEEE Symposium on Computers and Communications,
Washington, DC, USA,
pages 1000-1005,
2006.
IEEE Computer Society.
[PDF
] [Abstract] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
Orders with ten elements are circle orders.
In Book of abstracts of the nineteenth Panhellenic Conference/Summer School on nonlinear science and complexity,
Thessaloniki,
pages 1p,
July 2006.
[WWW
] [PDF
] [bibtex-entry]
-
D. Benza,
M. Cosnard,
L. Liquori,
and M. Vesin.
Arigatoni: Overlaying Internet via Low Level Network Protocols.
In JVA: John Vincent Atanasoff International Symposium on Modern Computing,
pages 82--91,
2006.
IEEE.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
R. Corrêa,
and J. Yu.
Gathering algorithms on paths under interference constraints.
In 6th Conference on Algorithms and Complexity,
volume 3998 of Lecture Notes in Computer Science,
Roma, Italy,
pages 115--126,
May 2006.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
M. Cosnard,
D. Coudert,
and S. Pérennes.
Optimal Solution of the Maximum All Request Path Grooming Problem.
In Advanced International Conference on Telecommunications (AICT),
pages 6p,
2006.
IEEE.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
X. Muñoz,
and I. Sau.
Traffic Grooming in Bidirectional WDM ring networks.
In IEEE-LEOS ICTON / COST 293 GRAAL,
volume 3,
pages 19-22,
June 2006.
[PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Gathering in specific radio networks.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel, France,
pages 85--88,
May 2006.
[WWW
] [PDF
] [bibtex-entry]
-
J-C. Bermond,
J. Galtier,
R. Klasing,
N. Morales,
and S. Pérennes.
Hardness and approximation of Gathering in static radio networks.
In FAWN06,
Pisa, Italy,
pages 75--79,
March 2006.
[WWW
] [PDF
] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Distributed Chasing of Network Intruders.
In Proceeding of the 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume 4056 of Lecture Notes in Computer Science,
Chester, UK,
pages 70-84,
July 2006.
Springer.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
P. Fraigniaud,
N. Nisse,
and S. Vial.
Encerclement réparti d'un fugitif dans un réseau par des agents mobiles..
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 89-92,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
R. Chand,
M. Cosnard,
and L. Liquori.
Resource Discovery in the Arigatoni Overlay Network.
In Proceedings of the International Workshop on Innovative Internet Community Systems (I2CS),
pages 13p,
2006.
[PDF
] [bibtex-entry]
-
R. Cilibrasi,
Z. Lotker,
A. Navarra,
S. Pérennes,
and P. Vitanyi.
About the Lifespan of Peer to Peer Networks.
In Proceedings of the 10th International Conference On Principles Of Distributed Systems (OPODIS),
volume 4305 of Lecture Notes in Computer Science,
Bordeaux,
pages 290--304,
December 2006.
Springer-Verlag.
[WWW
] [PDF
] [bibtex-entry]
-
H. Cirstea,
K. Claude,
L. Liquori,
and B. Wack.
Polymorphic Type Inference for the Rewriting Calculus.
In JFLA: Journées Francophones des Langages Applicatifs,
pages 57--69,
2006.
INRIA.
[bibtex-entry]
-
D. Coudert,
S. Pérennes,
H. Rivano,
and M-E. Voge.
Shared Risk Resource Groups and Survivability in Multilayer Networks.
In IEEE-LEOS ICTON / COST 293 GRAAL,
volume 3,
pages 235-238,
June 2006.
Note: Invited Paper.
[PDF
] [Abstract] [bibtex-entry]
-
O. Dalle.
OSA: an Open Component-based Architecture for Discrete-Event Simulation.
In 20th European Conference on Modeling and Simulation (ECMS),
Bonn, Germany,
pages 253--259,
May 2006.
[PDF
] [bibtex-entry]
-
A. Ferreira,
A. Goldman,
and J. Monteiro.
Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model.
In Proceedings of the 2nd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob 2006),
Montreal, CA,
pages 173--180,
June 2006.
Note: Best Student Paper Award.
[WWW
] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Strategies d'encerclement non deterministes.
In 8èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 81-84,
2006.
[WWW
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Connected Treewidth and Connected Graph Searching.
In Proceeding of the 7th Latin American Symposium on Theoretical Informatics (LATIN),
pages 479-490,
2006.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Monotony Properties of Connected Visible Graph Searching.
In Proceedings of 32nd International Workshop on Graph-Theoretic Concepts in Computer Science (WG),
volume 5911 of Lecture Notes in Computer Science,
Montpellier, France,
pages 229-240,
June 2006.
Springer.
[Abstract] [bibtex-entry]
-
J. Galtier.
Adaptive power and transmission rate control in cellular CDMA networks.
In IEEE GLOBECOM,
pages 6p,
2006.
[PDF
] [bibtex-entry]
-
J. Galtier.
Analysis of the slotted non-persistent CSMA protocol with poissonian packet size using a semi-Markov graph representation.
In 8th International Conference on Transparent Optical Networks,
volume 3,
pages 258--262,
June 2006.
IEEE.
[PDF
] [bibtex-entry]
-
F. Giroire.
Directions to use Probabilistic Algorithms for Cardinality for DNA Analysis.
In Journées Ouvertes Biologie Informatique Mathématiques (JOBIM 2006),
pages 3-5,
July 2006.
[PDF
] [Abstract] [bibtex-entry]
-
L. Hogie,
Pascal Bouvry,
and Frédéric Guinand.
An Overview of MANETs Simulation.
In L. Brim and I. Linden, editors,
Electronic Notes in Theoretical Computer Science, in the proceedings of MTCoord'05,
volume 150 of LNCS,
Namur, Belgium,
pages 81--101,
March 2006.
Elsevier.
[WWW
] [Abstract] [bibtex-entry]
-
L. Hogie,
P. Bouvry,
F. Guinand,
G. Danoy,
and E. Alba.
A Bandwidth-Efficient Broadcasting Protocol for Mobile Multi-hop Ad hoc Networks.
In ICN/ICONS/MCL '06: Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies,
pages 71-71,
October 2006.
IEEE Computer Society.
[WWW
] [Abstract] [bibtex-entry]
-
L. Hogie,
P. Bouvry,
F. Guinand,
G. Danoy,
and E. Alba.
Simulating Realistic Mobility Models for Large Heterogeneous MANETs.
In Demo proceeding of the 9th ACM/IEEE International Symposium on Modeling, Analysis and Simulation of Wireless and Mobile Systems (MSWIM'06),
pages 1p,
October 2006.
IEEE.
[WWW
] [Abstract] [bibtex-entry]
-
L. Liquori.
iRho: the Software: [System Description].
In Proceedings of the First International Workshop on Developments in Computational Models (DCM 2005),
volume 135 of Electronic Notes in Theoretical Computer Science,
pages 85--94,
2006.
Elsevier.
[PDF
] [bibtex-entry]
-
L. Liquori,
F. Honsell,
and R. Redamalla.
A Language for Verification and Manipulation of Web Documents.
In Proceedings of the International Workshop on Automated Specification and Verification of Web Sites (WWV 2005),
volume 157 of Electronic Notes in Theoretical Computer Science,
pages 67--78,
2006.
Elsevier.
[bibtex-entry]
-
F. Luna,
A. J. Nebro,
B. Dorronsoro,
E. Alba,
P. Bouvry,
and L. Hogie.
Optimal Broadcasting in Metropolitan MANETs Using Multiobjective Scatter Search.
In Applications of Evolutionary Computing,
volume 3907 of Lecture Notes in Computer Science,
pages 255-266,
March 2006.
Springer.
[WWW
] [Abstract] [bibtex-entry]
-
J. Moulierac.
On the number of multicast aggregated trees in a domain.
In 2nd Student Workshop of IEEE Infocom,
pages 2p,
April 2006.
[PDF
] [Abstract] [bibtex-entry]
-
J. Moulierac,
A. Guitton,
and M. Molnár.
Multicast Tree Aggregation in Large Domains.
In IFIP Networking,
number 3976,
pages 691--702,
2006.
[PDF
] [Abstract] [bibtex-entry]
-
J. Moulierac,
A. Guitton,
and M. Molnár.
On the number of MPLS LSP using Multicast Tree Aggregation.
In IEEE Globecom,
pages 5p,
November 2006.
[PDF
] [Abstract] [bibtex-entry]
-
J. Moulierac and M. Molnàr.
Active Monitoring of Link Delays in Case of Asymmetric Routes.
In IEEE International Conference on Networking (ICN),
pages 6p,
April 2006.
[PDF
] [Abstract] [bibtex-entry]
-
N. Nepomuceno,
P. Rogério Pinheiro,
and A. L. V. Coelho.
Aplicação de uma Metodologia Hìbrida ao Problema de Carregamento de Contêineres.
In XXXVIII Simpósio Brasileiro de Pesquisa Operacional (SBPO),
Goiania, Brazil,
pages 1596-1603,
2006.
[PDF
] [bibtex-entry]
-
N. Nepomuceno,
P. Rogério Pinheiro,
and A. L. V. Coelho.
Metaheurìstica e Programação Linear Inteira: Um Algoritmo Hìbrido para o Problema de Carregamento de Contêineres.
In XIII Congreso Latino-Iberoamericano de Investigación Operativa (CLAIO),
Montevideo, Uruguay,
pages 6p,
2006.
[PDF
] [bibtex-entry]
-
H. Rivano,
F. Theoleyre,
and F. Valois.
Capacity Evaluation Framework and Validation of Self-Organized Routing Schemes.
In Workshop on Wireless Ad-hoc and Sensor Networks (IWWAN 2006),
volume 3,
pages 779--785,
28-28 Sept. 2006.
IEEE.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
M.-E. Voge.
Graphes Colorés - Arbre Couvrant Coloré.
In Huitièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'06),
Trégastel,
pages 41--44,
May 2006.
[WWW
] [bibtex-entry]
-
M.-E. Voge.
How to transform a multilayer network into a colored graph.
In IEEE-LEOS ICTON/COST 293 GRAAL,
volume 3,
pages 116--119,
June 2006.
[bibtex-entry]
-
L. Addario-Berry,
K. Dalal,
and B. Reed.
Degree constrained subgraphs.
In Proceedings of GRACO2005,
volume 19 of Electron. Notes Discrete Math.,
Amsterdam,
pages 257--263 (electronic),
2005.
Elsevier.
[bibtex-entry]
-
S. Alouf,
E. Altman,
J. Galtier,
J.-F. Lalande,
and C. Touati.
Quasi-optimal bandwidth allocation for multi-spot MFTDMA satellites.
In IEEE INFOCOM 2005,
Miami, FL,
pages 71--94,
March 2005.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
J-C. Bermond,
L. Braud,
and D. Coudert.
Traffic Grooming on the Path.
In 12th International Colloquium on Structural Information and Communication Complexity -- SIROCCO,
Le Mont Saint-Michel, France,
pages 34-48,
May 24-26 2005.
LNCS 3499.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J.-C. Bermond and J. Peters.
Efficient Gathering in Radio Grids with Interference.
In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05),
Presqu'île de Giens,
pages 103--106,
May 2005.
[PDF
] [bibtex-entry]
-
C. Chaudet,
E. Fleury,
I. Guérin-Lassous,
H. Rivano,
and M.-E. Voge.
Optimal positioning of active and passive monitoring devices.
In CoNEXT 2005,
Toulouse, France,
October 2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Chaudet,
E. Fleury,
I. Guérin-Lassous,
H. Rivano,
and M.-E. Voge.
Surveillance passive dans l'Internet.
In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05),
Presqu'île de Giens,
pages 121--124,
May 2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
S. Perennes,
Q-C. Pham,
and J-S. Sereni.
Rerouting requests in WDM networks.
In AlgoTel'05,
Presqu'île de Giens, France,
pages 17-20,
mai 2005.
[PDF
] [Abstract] [bibtex-entry]
-
S. Fiorini,
N. Hardy,
B. Reed,
and A. Vetta.
Approximate min-max relations for odd cycles in planar graphs.
In Integer programming and combinatorial optimization,
volume 3509 of Lecture Notes in Comput. Sci.,
Berlin,
pages 35--50,
2005.
Springer.
[bibtex-entry]
-
S. Fiorini,
N. Hardy,
B. Reed,
and A. Vetta.
Planar graph bipartization in linear time.
In Proceedings of GRACO2005,
volume 19 of Electron. Notes Discrete Math.,
Amsterdam,
pages 265--271 (electronic),
2005.
Elsevier.
[bibtex-entry]
-
M. Flammini,
L. Moscardelli,
A. Navarra,
and S. Pérennes.
Asymptotically Optimal Solutions for Small World Graphs.
In Proceedings of the 19th International Symposium on Distributed Computing, (DISC 2005),
volume 3724 of Lecture Notes in Computer Science,
pages 414--428,
September 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
M. Flammini,
A. Navarra,
and S. Pérennes.
The Real approximation factor of the MST heuristic for the Minimum Energy Broadcasting.
In Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, (WEA 2005),
volume 3503 of Lecture Notes in Computer Science,
pages 22--31,
May 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
F. V. Fomin,
P. Fraigniaud,
and N. Nisse.
Nondeterministic Graph Searching: From Pathwidth to Treewidth.
In Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science (MFCS),
pages 364-375,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
P. Fraigniaud and N. Nisse.
Stratégies d'encerclement connexes dans un réseau.
In 7èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel),
pages 13-16,
2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Galtier,
A. Laugier,
and P. Pons.
Algorithms to evaluate the reliability of a network.
In The 5th International Workshop on Design of Reliable Communication Networks,
pages 93--100,
2005.
[WWW
] [PDF
] [bibtex-entry]
-
F. Giroire.
Order statistics and estimating cardinalities of massive data sets.
In Conrado MartÃnez, editor,
2005 International Conference on Analysis of Algorithms,
volume AD of DMTCS Proceedings,
pages 157-166,
2005.
Discrete Mathematics and Theoretical Computer Science.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes and G. Robson Mateus.
Low-Cost Design Approach to WDM Mesh Networks.
In 4th International Conference on Networking (ICN),
pages 60-67,
2005.
[bibtex-entry]
-
A. Guitton and J. Moulierac.
Scalable Tree Aggregation for Multicast.
In 8th International Conference on Telecommunications (ConTEL),
pages 129--134,
June 2005.
Note: Best Student Paper Award.
[PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
R. J. Kang,
and J.-S. Sereni.
Improper colouring of unit disk graphs.
In Proceedings of the 7th International Conference on Graph Theory (ICGT'05),
volume 22 of Electronic Notes in Discrete Mathematics,
pages 123--128,
September 2005.
Elsevier.
[WWW
] [PDF
] [bibtex-entry]
-
F. Havet and J.-S. Sereni.
Channel assignment and improper choosability of graphs.
In Proceedings of the 31st Workshop on Graph-Theoretic Concepts in Computer Science (WG'05),
volume 3787 of Lecture Notes in Computer Science,
pages 81--90,
June 2005.
Springer Verlag.
[WWW
] [PDF
] [bibtex-entry]
-
G. Huiban and G. Robson Mateus.
A MILP model for the reconfiguration problem in multi-fiber WDM networks.
In SBRC Simpósio Brasileiro de Redes de Computadores,
May 2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Huiban and G. Robson Mateus.
A multiobjective approach of the virtual topology design and routing problem in WDM networks.
In ICT International Conference on Telecommunications,
May 2005.
IEEE Computer Society Press.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. J. Kang,
T. Müller,
and J.-S. Sereni.
Improper colouring of (random) unit disk graphs.
In Proceedings of European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2005),
Discrete Mathematics and Theoretical Computer Science,
pages 193--198,
September 2005.
[WWW
] [PDF
] [bibtex-entry]
-
R. Klasing,
Z. Lotker,
A. Navarra,
and S. Pérennes.
From Balls and Bins to Points and Vertices.
In Proceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005),
volume 3827 of Lecture Notes in Computer Science,
pages 757--766,
December 2005.
Springer Verlag.
[WWW
] [PDF
] [bibtex-entry]
-
R. Klasing,
E. Markou,
T. Radzik,
and F. Sarracco.
Approximation bounds for Black Hole Search problems.
In Proceedings of the 9th International Conference on Principles of Distributed Systems (OPODIS 2005),
volume 3974 of Lecture Notes in Computer Science,
December 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
R. Klasing,
E. Markou,
T. Radzik,
and F. Sarracco.
Hardness and approximation results for black hole search in arbitrary graphs.
In Proceedings of the 12th Colloquium on Structural Information and Communication Complexity (SIROCCO 2005),
volume 3499 of Lecture Notes in Computer Science,
pages 200--215,
May 2005.
Springer Verlag.
[WWW
] [bibtex-entry]
-
J.-F. Lalande,
M. Syska,
and Y. Verhoeven.
Arrondi aléatoire et protection des réseaux WDM.
In Ecole Polytechnique de l'Université de Tours, editor,
ROADEF,
number 6,
Tours, France,
pages 241--242,
2005.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
A. Laugier and S. Raymond.
Recherche de graphes expansifs dans le graphe du Web.
In Roadef,
2005.
[WWW
] [bibtex-entry]
-
Z. Li and B. Reed.
Heap building bounds.
In Algorithms and data structures,
volume 3608 of Lecture Notes in Comput. Sci.,
Berlin,
pages 14--23,
2005.
Springer.
[bibtex-entry]
-
C. Meagher and B. Reed.
Fractionally total colouring $G\sb {n,p}$.
In Proceedings of GRACO2005,
volume 19 of Electron. Notes Discrete Math.,
Amsterdam,
pages 297--303 (electronic),
2005.
Elsevier.
[bibtex-entry]
-
J. Moulierac and A. Guitton.
QoS Scalable Tree Aggregation.
In IFIP Networking,
number 3462 of LNCS,
pages 1405--1408,
May 2005.
[PDF
] [Abstract] [bibtex-entry]
-
S. Petat and M.-E. Voge.
Groupage sur un chemin orienté.
In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05),
Presqu'île de Giens,
pages 21--24,
May 2005.
[PDF
] [bibtex-entry]
-
H. Rivano,
F. Théoleyre,
and F. Valois.
Influence de l'auto-organisation sur la capacité des réseaux ad hoc.
In Septièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'05),
Presqu'île de Giens,
pages 53--56,
May 2005.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Bessy.
Un algorithme d'approximation pour le sous-digraphe fortement connexe minimal.
In Sixièmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'04),
pages 57--61,
2004.
INRIA.
[WWW
] [bibtex-entry]
-
S. Bessy and S. Thomassé.
Three min-max theorems concerning cyclic orders of strong digraphs.
In Acts of IPCO X 2004,
volume 3064 of Lecture Notes in Computer Sciences,
pages 132--138,
2004.
Springer-Verlag.
[WWW
] [bibtex-entry]
-
C. Cooper,
R. Klasing,
and M. Zito.
Dominating Sets in Web Graphs.
In Proceedings of the Third Workshop on Algorithms and Models for the Web-Graph (WAW 2004),
volume 3243 of Lecture Notes in Computer Science,
pages 31--43,
October 2004.
Springer-Verlag.
[bibtex-entry]
-
A. Ferreira and A. Jarry.
Complexity of Minimum Spanning Tree in Evolving Graphs and the Minimum-Energy Broadcast Routing Problem.
In Proceedings of WiOpt'04 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks,
Cambridge, United Kingdom,
March 2004.
[bibtex-entry]
-
M. Flammini,
R. Klasing,
A. Navarra,
and S. Pérennes.
Improved approximation results for the Minimum Energy Broadcasting Problem.
In 2nd ACM/SIGMOBILE Annual International Joint Workshop on Foundation of Mobile Computing (DIALM-POMC 2004),
pages 85--91,
2004.
ACM Press.
[WWW
] [POSTSCRIPT
] [bibtex-entry]
-
S. Funke,
A. Kesselman,
Z. Lotker,
and M. Segal.
Improved Algorithms for the Connected Sensor Cover Problem.
In ADHOC-NOW 04,
pages 56--59,
2004.
[bibtex-entry]
-
J. Galtier.
Optimizing the IEEE 802.11b Performance using Slow Congestion Window Decrease.
In Proccedings of the 16th ITC Specialist Seminar on performance evaluation of wireless and mobile systems,
Antwerpen, Belgium,
pages 165--176,
August/September 2004.
[PDF
] [bibtex-entry]
-
C. Gomes and G. Robson Mateus.
Routing and Wavelength Assignment in a Mesh Network.
In 3rd International Information and Telecommunication Technologies Symposium (I2TS),
2004.
[bibtex-entry]
-
A. Jarry.
Integral Symmetric 2-Commodity Flows.
In Proceedings of STACS'04,
Montpellier,
March 2004.
[bibtex-entry]
-
A. Jarry and A. Laugier.
On the minimum number edges of two-connected graphs with given diameter.
In GT04,
Paris, France,
July 2004.
[bibtex-entry]
-
A. Jarry and Z. Lotker.
Connectivity in Evolving Graph with Geometric Properties.
In Dial MPOMC 2004 The Second ACM/SIGMOBILE Annual International Joint Workshop on Foundations of Mobile Computing,
2004.
[bibtex-entry]
-
R. Klasing,
A. Navarra,
A. Papadopoulos,
and S. Pérennes.
Adaptive Broadcast Consumption (ABC), a new heuristic and new bounds for the Minimum Energy Broadcast Routing Problem.
In Proc. 3rd FIP-TC6 Networking Conference ( Networking 2004),
volume 3042 of Lecture Notes in Computer Science,
pages 866--877,
2004.
Springer-Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
G. Kozma,
Z. Lotker,
M. Sharir,
and G. Stupp.
Geometrically Aware Communication in Random Wireless Networks.
In 24th ACM Symp. on Principles of Distributed Computing,
pages 310--319,
2004.
[bibtex-entry]
-
L. Liquori and B. P. Serpette.
iRho: an imperative rewriting calculus.
In Proc. of ACM-PPDP: International Conference on Principles and Practice of Declarative Programming,
pages 167--178,
2004.
[POSTSCRIPT
] [bibtex-entry]
-
Z. Lotker,
M. Martinez de Albeniz,
and S. Pérennes.
Range-Free Ranking in Sensors Networks and Its Applications to Localization.
In ADHOC-NOW 2004,
pages 158--171,
2004.
[POSTSCRIPT
] [bibtex-entry]
-
J. Moulierac,
J.-C. König,
and M. Molnár.
Diffusion contrainte dans un groupe.
In ALGOTEL - Rencontre francophone sur les aspects Algorithmiques des Télécommunications,
2004.
[PDF
] [Abstract] [bibtex-entry]
-
E. Altman,
I. Buret,
B. Fabre,
J. Galtier,
C. Guiraud,
T. Tocker,
and C. Touati.
Slot allocation in a TDMA satellite system: simulated annealing approach.
In Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit,
Yokohama, Japan,
April 2003.
[PDF
] [bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Radio Planning in Multibeam Geostationary Satellite Networks.
In Proceedings of AIAA International Communication Satellite Systems Conference and Exhibit,
Yokohama, Japan,
April 2003.
[PDF
] [bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Semi-definite programming approach for bandwidth allocation and routing in networks.
In Proceedings of ITC 18,
Berlin, Germany,
pages 1091--1100,
August/September 2003.
[PDF
] [bibtex-entry]
-
G. Barthe,
H. Cirstea,
C. Kirchner,
and L. Liquori.
Pure Patterns Type Systems.
In POPL, Symposium on Principles of Programming Languages,
pages 250--261,
2003.
ACM.
[POSTSCRIPT
] [bibtex-entry]
-
R. Bayon,
N. Lygeros,
and J.-S. Sereni.
Nouveaux progrès dans l'énumération des modèles mixtes.
In Knowledge discovery and discrete mathematics : JIM'2003,
Université de Metz, France,
pages 243--246,
2003.
INRIA.
[WWW
] [PDF
] [bibtex-entry]
-
J.-C. Bermond and D. Coudert.
Traffic Grooming in Unidirectional WDM Ring Networks using Design Theory.
In IEEE ICC,
volume 2,
Anchorage, Alaska,
pages 1402-1406,
May 2003.
Note: ON07-3.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J.-C. Bermond,
D. Coudert,
and X. Muñoz.
Traffic Grooming in Unidirectional WDM Ring Networks: The All-to-all Unitary Case.
In The 7th IFIP Working Conference on Optical Network Design & Modelling -- ONDM,
Budapest, Hongrie,
pages 1135-1153,
2003.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J.-C. Bermond,
O. DeRivoyre,
S. Pérennes,
and M. Syska.
Groupage par tubes.
In Conference ALGOTEL2003, Banyuls, May 2003,
pages 169--174,
2003.
[PDF
] [bibtex-entry]
-
J.-C. Bermond,
O. Delmas,
F. Havet,
M. Montassier,
and S. Pérennes.
Réseaux de télécommunications minimaux embarqués tolérants.
In Conference ALGOTEL2003, Banyuls, May 2003,
pages 27--32,
2003.
[PDF
] [bibtex-entry]
-
P. Berthomé,
M. Diallo,
and A. Ferreira.
Generalized Parametric Multi-Terminal Flows Problem.
In Proceedings of WG'03,
volume 2880 of Lecture Notes in Computer Science,
pages 71--80,
June 2003.
Springer-Verlag.
[bibtex-entry]
-
S. Bhadra and A. Ferreira.
Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks.
In S. Pierre,
M. Barbeau,
and E. Kranakis, editors,
Proceedings of Adhoc-Now'03,
volume 2865 of Lecture Notes in Computer Science,
Montreal,
pages 259--270,
October 2003.
Springer Verlag.
[bibtex-entry]
-
M. Bouklit,
D. Coudert,
J-F. Lalande,
C. Paul,
and H. Rivano.
Approximate multicommodity flow for WDM networks design.
In J. Sibeyn, editor,
SIROCCO 10,
number 17 of Proceedings in Informatics,
Umea, Sweden,
pages 43--56,
2003.
Carleton Scientific.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
M. Bouklit,
D. Coudert,
J-F. Lalande,
and H. Rivano.
Approximation combinatoire de multiflot fractionnaire : améliorations.
In AlgoTel'03,
Banyuls-sur-mer, France,
mai 2003.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
B. Bui-Xuan,
A. Ferreira,
and A. Jarry.
Evolving graphs and least cost journeys in dynamic networks.
In Proceedings of WiOpt'03 -- Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks,
Sophia Antipolis,
pages 141--150,
March 2003.
INRIA Press.
[bibtex-entry]
-
H.-J. Böckenhauer,
D. Bongartz,
J. Hromkovic,
R. Klasing,
G. Proietti,
S. Seibert,
and W. Unger.
On $k$-Edge-Connectivity Problems with Sharpened Triangle Inequality (Extended Abstract).
In Proc. 5th Italian Conference on Algorithms and Complexity ( CIAC 2003),
volume 2653 of Lecture Notes in Computer Science,
pages 189--200,
2003.
Springer-Verlag.
[bibtex-entry]
-
A. Ciaffaglione,
L. Liquori,
and M. Miculan.
Imperative Object-Based Calculi in Co-inductive Type Theories.
In LPAR, International Conference on Logic for Programming Artificial Intelligence and Reasoning,
volume 2850 of Lecture Notes in Computer Science,
pages 59--77,
2003.
[PDF
] [bibtex-entry]
-
A. Ciaffaglione,
L. Liquori,
and M. Miculan.
Reasoning on an imperative object-based calculus in Higher Order Abstract Syntax.
In MERLIN, International Workshop on Mechanized Reasoning about Languages with Variable Binding,
2003.
ACM.
[PDF
] [bibtex-entry]
-
H. Cirstea,
L. Liquori,
and B. Wack.
Rewriting Calculus with Fixpoints: Untyped and First-order Systems.
In TYPES, International Workshop on Types for Proof and Programs,
volume 3085 of Lecture Notes in Computer Science,
pages 147--161,
2003.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
A. Clementi,
G. Huiban,
G. Rossi,
and Y. Verhoeven.
On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks.
In Parallel and Distributed Processing Symposium (IPDPS),
pages 8,
April 2003.
IEEE Computer Society Press.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
H. Rivano,
and X. Roche.
A combinatorial approximation algorithm for the multicommodity flow problem.
In K. Jansen and R. Solis-Oba, editors,
WAOA 03,
number 2909 of Lecture Notes in Computer Science,
Budapest, Hungary,
pages 256--259,
September 2003.
Springer-Verlag.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Dalle and P. Mussi.
Cooperative Software Development and Computational Resource Sharing.
In NMSC System Simulation Workshop,
ESTEC, Noordwijk, The Netherlands,
March 2003.
European Space Agency.
[bibtex-entry]
-
A. Ferreira,
S. Perennes,
A.W. Richa,
H. Rivano,
and N. Stier Moses.
Models, complexity and algorithms for the design of multifiber WDM networks.
In Telecommunications, 2003. ICT 2003. 10th International Conference on,
volume 1,
pages 12--18,
23 Feb.-1 March 2003.
[PDF
] [Abstract] [bibtex-entry]
-
F. Giroire,
A. Nucci,
N. Taft,
and C. Diot.
Increasing the Robustness of IP Backbones in the Absence of Optical Level Protection.
In Proceedings of the Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM),
2003.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
C. Gomes and G. Robson Mateus.
Alocação de Caminhos Comutatos por Rótulo em Redes Multiplexadas por Comprimento de Onda.
In SPG,
2003.
[bibtex-entry]
-
A. Jarry and A. Laugier.
Graphes 2-connexes à diamètre donné.
In ROADEF 2003,
number 5 of Proceedings in Informatics,
Avignon, France,
pages 102--104,
June 2003.
Université d'Avignon et des Pays de Vaucluse.
[bibtex-entry]
-
J.-F. Lalande,
S. Pérennes,
and M. Syska.
Groupage dans les réseaux dorsaux WDM.
In ROADEF 2003,
number 5 of Proceedings in Informatics,
Avignon, France,
pages 254--255,
June 2003.
Université d'Avignon et des Pays de Vaucluse.
[bibtex-entry]
-
A. Laugier and S. Petat.
Network Design and b-matching.
In Proc. of International Network Optimization Conference,
pages 374--379,
2003.
[POSTSCRIPT
] [bibtex-entry]
-
E. Trajano,
D. Guigue,
E. Costa,
C. Gomes,
H. Almeida,
K. Silva,
and N. Cavalcanti.
SOS - A Tool for the Automatic Segmentation of Musical Flows.
In IX SBCM,
2003.
[bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Fair power and transmission rate control in wireless networks.
In Proc. of IEEE GlobeCom'02,
Taipei, Taiwan,
November 2002.
[bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Semi-Definite Programming Approach for Bandwidth Allocation and Routing in Networks.
In Proc. of 10th Int. Symp. on Dynamic Games and Application -- Networking Games & Resource Allocation Workshop (NGRA-2002),
Petrozavodsk, Russia,
July 2002.
Altman and Mazaloz.
[bibtex-entry]
-
E. Altman,
J. Galtier,
and C. Touati.
Utility Based Fair Bandwidth Allocation.
In IASTED International Conference on Networks, Parallel and Distributed Processing, and Applications (NPDPA 2002),
2002.
[bibtex-entry]
-
J.-C. Bermond,
S. Choplin,
and S. Pérennes.
Hierarchical Ring Network Design.
In 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO'02),
pages 1--16,
2002.
Carleton Scientific.
[bibtex-entry]
-
H.-J. Böckenhauer,
D. Bongartz,
J. Hromkovic,
R. Klasing,
G. Proietti,
S. Seibert,
and W. Unger.
On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality.
In Proc. of the 22nd Conference on Foundations of Software Technology and Theoretial Computer Science (FSTTCS 2002),
volume 2556 of Lecture Notes in Computer Science,
pages 59--70,
2002.
Springer-Verlag.
[bibtex-entry]
-
D. Coudert and H. Rivano.
Lightpath assignment for multifibers WDM networks with wavelength translators.
In Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE,
volume 3,
pages 2686--2690vol.3,
17-21 Nov. 2002.
Note: OPNT-01-5.
[PDF
] [Abstract] [bibtex-entry]
-
D. Coudert and H. Rivano.
Routage optique dans les réseaux WDM multifibres avec conversion partielle..
In AlgoTel'02,
Mèze, France,
pages 17-24,
May 2002.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
A. Ferreira.
On models and algorithms for dynamic communication networks: The case for evolving graphs.
In 4$^{\rm e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2002),
Mèze, France,
May 2002.
[bibtex-entry]
-
A. Ferreira,
S. Pérennes,
A. Richa,
H. Rivano,
and N. Stier.
On the design of multifiber WDM networks.
In AlgoTel'02,
Mèze, France,
pages 25--32,
May 2002.
[WWW
] [PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
F. Havet.
Design of Fault Tolerant Satellite Networks with Priorities via Selectors.
In Proc. of SIROCCO'02,
Andros, Greece,
pages 165--180,
June 2002.
[bibtex-entry]
-
F. Havet.
Robustness of a Routing Tree for the Push Tree Problem.
In $4^{e}$ rencontres francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'02),
Mèze, France,
pages 81--86,
May 2002.
[bibtex-entry]
-
G. Huiban,
S. Pérennes,
and M. Syska.
Traffic Grooming in WDM Networks with Multi-Layer Switches.
In IEEE ICC,
New-York,
April 2002.
Note: CD-Rom.
[bibtex-entry]
-
A. Jarry.
Disjoint Paths in Symmetric Digraphs.
In International Colloquium on Structural Information and Communi cation Complexity -- SIROCCO,
Andros, Greece,
pages 211--222,
June 2002.
Carleton.
[bibtex-entry]
-
P. Mussi.
Tuning Car Following Algorithms for Realistic Behaviour.
In AI, Simulation & Planning in High Autonomy Systems,
Lisbon, Portugal,
pages 281--284,
April 2002.
[bibtex-entry]
-
B. Reed and B. Sudakov.
List colouring of graphs with at most $(2-o(1))\chi$ vertices.
In Proceedings of the International Congress of Mathematicians, Vol. III (Beijing, 2002),
Beijing,
pages 587--603,
2002.
Higher Ed. Press.
[bibtex-entry]
-
J.-C. Bermond,
L. Chacon,
D. Coudert,
and F. Tillerot.
A Note on Cycle Covering.
In ACM Symposium on Parallel Algorithms and Architectures -- SPAA,
Crete island, Greece,
pages 310-311,
4-6 July 2001.
[POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J.-C. Bermond,
L. Chacon,
D. Coudert,
and F. Tillerot.
Cycle Covering.
In International Colloquium on Structural Information and Communication Complexity -- SIROCCO,
Proceedings in Informatics 11,
Vall de Nuria, Spain,
pages 21-34,
27-29 June 2001.
Carleton Scientific.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
J.-C. Bermond,
F. Havet,
and D. Tóth.
Design of fault tolerant on board networks with priorities.
In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001),
Saint-Jean-de-Luz , France,
pages 95--98,
Mai 2001.
[bibtex-entry]
-
S. Bertrand,
A. Laugier,
and P. Mahey.
Routing flows in networks with heterogenous protocols and path-dependent edge costs.
In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001),
Saint-Jean-de-Luz , France,
pages 55--60,
Mai 2001.
[bibtex-entry]
-
A. Caminada,
A. Ferreira,
and L. Floriani.
Principal Component Analysis for data volume reduction in experimental analysis of heuristics.
In Proceedings of GECCO 2001 Workshop on Real-life Evolutionary Design Optimisation,
San Francisco (USA),
2001.
[bibtex-entry]
-
I. Caragianis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
and H. Rivano.
Fractional path coloring on bounded degree trees.
In F. Orejas,
P. G. Spirakis,
and J. van Leeuwen, editors,
Proceedings of the 28th ICALP,
volume 2076 of Lecture Notes in Computer Science,
Crete, Greece,
pages 732--743,
July 2001.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
I. Caragiannis,
A. Ferreira,
C. Kaklamanis,
S. Pérennes,
P. Persiano,
and H. Rivano.
Approximate Constrained Bipartite Edge Coloring.
In V.B. Le A. Branstädt, editor,
27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'01),
volume 2204 of Lecture Notes in Computer Science,
Boltenhagen, Germany,
pages 21--31,
June 2001.
Springer-Verlag.
[PDF
] [Abstract] [bibtex-entry]
-
S. Choplin.
Virtual Path Layout in ATM Path with given hop count.
In International Conference on Networking, ICN01,
volume 2094, Part II of LNCS,
pages 527--537,
2001.
Springer.
[bibtex-entry]
-
H. Cirstea,
C. Kirchner,
and L. Liquori.
Matching Power.
In RTA, International Conference on Rewriting Techniques and Applications,
volume 2051 of Lecture Notes in Computer Science,
pages 77--92,
2001.
[POSTSCRIPT
] [bibtex-entry]
-
H. Cirstea,
C. Kirchner,
and L. Liquori.
The Rho Cube.
In FoSSaCS, International Conference on Foundations of Software Science and Computation Structures,
volume 2030 of Lecture Notes in Computer Science,
pages 168--183,
2001.
[POSTSCRIPT
] [bibtex-entry]
-
M. Cosnard and L. Grigori.
A Parallel Algorithm for Sparse Symbolic LU Factorization without Pivoting on Out of Core Matrices.
In 15th ACM International Conference on Supercomputing (ICS'01),
2001.
[bibtex-entry]
-
D. Coudert.
Chemins disjoints de poids minimum pour la sécurisation de réseaux de télécommunications.
In Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications -- AlgoTel,
St-Jean de Luz, France,
pages 47-53,
28-30 Mai 2001.
[POSTSCRIPT
] [Abstract] [bibtex-entry]
-
D. Coudert and X. Muñoz.
How Graph Theory can help Communications Engineering.
In D.K.Gautam, editor,
Broad band optical fiber communications technology -- BBOFCT,
Jalgaon, India,
pages 47-61,
December 2001.
Nirtali Prakashan.
Note: Invited paper.
[POSTSCRIPT
] [Abstract] [bibtex-entry]
-
S. Céroi and F. Havet.
Trees with three leaves are (n + 1)-unavoidable.
In Jayme Szwarcfiter and Siang Song, editors,
Electronic Notes in Discrete Mathematics,
volume 7,
2001.
Elsevier Science Publishers.
[bibtex-entry]
-
O. Dalle,
J. Radzik,
C. Rigal,
F. Rodière,
and C. Saroléa.
ASIMUT: An Environment for the Simulation of Multi-Media Satellite Telecommunication Networks.
In 19th International Communications Satellite Systems Conference (ICSSC),
Toulouse, France,
April 2001.
AIAA.
[bibtex-entry]
-
H. Everett,
C. M. H. de Figueiredo,
S. Klein,
and B. Reed.
Bull-reducible Berge graphs are perfect.
In Comb01---Euroconference on Combinatorics, Graph Theory and Applications,
volume 10 of Electron. Notes Discrete Math.,
Amsterdam,
pages 3 pp. (electronic),
2001.
Elsevier.
[bibtex-entry]
-
G. Fertin,
A. Raspaud,
and B. Reed.
On star coloring of graphs.
In Graph-theoretic concepts in computer science (Boltenhagen, 2001),
volume 2204 of Lecture Notes in Comput. Sci.,
Berlin,
pages 140--153,
2001.
Springer.
[bibtex-entry]
-
J. Galtier.
Semi-Definite Programming as a Simple Extension to Linear Programming: Convex Optimization with Queueing, Equity and Other Telecom Functionals.
In $3^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2001),
Saint-Jean-de-Luz,
pages 21--28,
May 2001.
[bibtex-entry]
-
J. Galtier and A. Oliveira.
A proposal to study satellite constellation routing via classical linear programming methods.
In 43rd conference of the Canadian Operations Research Society,
2001.
[bibtex-entry]
-
C. Gavoille,
D. Peleg,
S. Pérennes,
and R. Raz.
Distance Labeling in Graphs.
In SODA'01,
pages 210--219,
2001.
[bibtex-entry]
-
C. Gomes and A. H. Dominguez.
Modelagem e Implementação do módulo tutor do ambiente AVA-TA@ead.
In Anais XI Encontro de Iniciação Cientìfica da Universidade Federal de Alagoas,
2001.
[bibtex-entry]
-
F. Havet and M. Wennink.
The Push Tree Problem.
In SPAA'01: 13th ACM Symposium on Parallel Algorithms and Architectures,
Crète , Grèce,
pages 318--319,
Juillet 2001.
[bibtex-entry]
-
C. McDiarmid and B. Reed.
Channel assignment on nearly bipartite and bounded treewidth graphs.
In Comb01---Euroconference on Combinatorics, Graph Theory and Applications,
volume 10 of Electron. Notes Discrete Math.,
Amsterdam,
pages 4 pp. (electronic),
2001.
Elsevier.
[bibtex-entry]
-
M. Molloy and B. Reed.
Colouring graphs when the number of colours is nearly the maximum degree.
In Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing,
New York,
pages 462--470 (electronic),
2001.
ACM.
[bibtex-entry]
-
D. Rautenbach and B. Reed.
Approximately covering by cycles in planar graphs.
In Proceedings of the Twelfth Annual ACM-SIAM Symposium on Discrete Algorithms (Washington, DC, 2001),
Philadelphia, PA,
pages 402--406,
2001.
SIAM.
[bibtex-entry]
-
H. Rivano.
Planification de réseaux optiques WDM k-fibres.
In AlgoTel'01 - $3^{e}$ Rencontres Françaises sur les Aspects Algorithmiques des Télécommunications,
Saint-Jean-de-Luz, France,
pages 41--46,
mai 2001.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
E. Altman,
E. Baçsar,
T. Jiménez,
and N. Shimkin.
Competitive Routing in Networks with Polynomial Cost.
In IEEE Infocom 2000,
pages 1586--1593,
mars 2000.
[bibtex-entry]
-
A. Andreev,
A. Clementi,
P. Penna,
and J. Rolim.
Parallel Read Operations Without Memory Contention.
In Electronic Colloquium on Computational Complexity,
volume TR00-53,
2000.
[bibtex-entry]
-
B. Beauquier,
K.S. Candan,
A. Ferreira,
S. Pérennes,
and A. Sen.
On shortest path problems with ``non-Markovian'' link contribution to path lengths.
In Proc. of IFIP/TC6 Networking 2000 Conference,
Paris, France,
mai 2000.
[bibtex-entry]
-
B. Beauquier and E. Darrot.
Arbitrary size Waksman networks and their vulnerability.
In Actes des $1^{res}$ Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
2000.
World Scientific.
[bibtex-entry]
-
P. Bergé,
A. Ferreira,
J. Galtier,
and S. Petit.
A probabilistic study of inter-satellite links load in polar orbit satellite constellations.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 137--142,
Mai 2000.
[bibtex-entry]
-
J.-C. Bermond,
A. Bonnecaze,
T. Kodate,
S. Perennes,
and P. Sole.
Broadcasting in hypercubes in the circuit switched model.
In Proc. Conference IPDPS 2000, Cancun, Mexico,, May 2000,
pages 21-26,
2000.
[PDF
] [bibtex-entry]
-
J-C. Bermond,
L. Chacon,
D. Coudert,
and F. Tillerot.
Conception d'un réseau WDM protégé par sous-réseaux.
In 2ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'00),
La Rochelle, France,
pages 83-88,
May 2000.
INRIA.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Bongiovanni,
A. Clementi,
and P. Penna.
A Note on Parallel Read Operations on Large Public Databases.
In Proc. of ARACNE-00, International Workshop on Approximation and Randomized Algorithms in Communication Networks,
volume Carleton Scientific Press,
pages 123--133,
2000.
[bibtex-entry]
-
A. Clementi,
A. Ferreira,
P. Penna,
S. Pérennes,
and R. Silvestri.
The Minimum Range Assignment Problem on Linear Radio Networks.
In Proc. of ESA-00, 8th Annual European Symposium on Algorithms,
volume LNCS,
pages 143--154,
2000.
[bibtex-entry]
-
A. Clementi,
P. Penna,
and R. Silvestri.
On The Power Assignment Problem in Radio Networks.
In Electronic Colloquium on Computational Complexity,
volume TR00-54,
2000.
[bibtex-entry]
-
A. Clementi,
P. Penna,
and R. Silvestri.
The Power Range Assignment Problem in Radio Networks on the Plane.
In Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science,
volume LNCS,
pages 651--660,
2000.
[bibtex-entry]
-
D. Colnet and L. Liquori.
Match-O, a Statically Safe (?) Dialect of Eiffel.
In TOOLS, International Conference on Technology of Object-Oriented Languages and Systems,
pages 190--201,
2000.
IEEE Computer Society.
[POSTSCRIPT
] [bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
De Bruijn Isomorphisms and Free Space Optical Networks.
In IEEE International Parallel and Distributed Processing Symposium,
pages 769-774,
2000.
IEEE Press.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
P. Crescenzi,
G. Gambosi,
and P. Penna.
On-Line Algorithms for the Channel Assignment Problem in Cellular Networks.
In Proc. of ACM DIALM-2000, 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications,
pages 1--7,
2000.
[bibtex-entry]
-
O. Dalle,
P. Mussi,
and C. Rigal,
and V. Sutter.
ASIMUT: An Environment for the Simulation of Multi-Media Satellite Telecommunication Networks.
In Proc. 6th ESA Workshop on Simulation in European Space Pragrams,
ESTEC, Noordwijk, The Netherlands,
pages 285--288,
October 2000.
European Space Agency.
[WWW
] [bibtex-entry]
-
A. Ferreira,
J. Galtier,
P. Mahey,
G. Mateus,
and A. Oliveira.
An Optimization Model for Routing in Low Earth Orbit Satellite Constellations.
In Proceedings of ISPAN,
Dallas, USA,
December 2000.
[bibtex-entry]
-
A. Ferreira,
J. Galtier,
and S. Pérennes.
Approximation of a straight line in a bounded lattice.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 53--58,
Mai 2000.
[bibtex-entry]
-
P. Fraigniaud,
A. Pelc,
D. Peleg,
and S. Pérennes.
Assigning labels in unknown anonymous networks.
In Proceedings of PODC 2000, (Nineteenth Annual ACM SIGACT-SIGOPS Symposium on PRINCIPLES OF DISTRIBUTED COMPUTING),
pages 101--112,
2000.
[bibtex-entry]
-
J. Galtier.
Routing issues for LEO satellite constellations.
In International Conference on Advances in Infrastructure for Electronic Business, Science, and Education on the Internet (SSGRR 2000),
L'Aquila, Italie,
juillet 2000.
[bibtex-entry]
-
J. Galtier and S. Lanteri.
On overlapping partitions.
In David J. Lilja, editor,
Proceedings of the 2000 International Conference on Parallel Processing,
Toronto, Canada,
pages 461--468,
août 2000.
[bibtex-entry]
-
L. Gargano,
A. Pelc,
S. Pérennes,
and U. Vaccaro.
Efficient communication in unknown networks.
In Proc. of WG'2000 - 26th International Workshop on Graph-Theoretic Concepts in Computer Science,
2000.
Note: A paraître.
[bibtex-entry]
-
S. Haddad,
A. Laugier,
and Jean-Francois Maurras.
Designing telecommunication networks with global capacities under survivability constraints.
In ECCO XIII,
2000.
[bibtex-entry]
-
S. Haddad,
A. Laugier,
and Jean-Francois Maurras.
Global designing of telecommunication networks.
In CO 2000,
2000.
[bibtex-entry]
-
M.-C. Heydemann,
N. Marlin,
and S. Pérennes.
Rotational Cayley Graphs on Transposition Generated Groups (Extended Abstract).
In 6ème Colloque International de Théorie des Graphes,
Electronical Notes in Discrete Mathematics,
pages 187--190,
2000.
Elsevier Science.
[bibtex-entry]
-
T. Jiménez.
Optimal Admission Control for High Speed Networks: A Dynamic Programming Approach.
In IEEE Conference on Decision and Control,
decembre 2000.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
and G. Siegel.
A road traffic simulator : car-following and lane-changing.
In European Simulation Multiconference 2000,
Gent, Belgium,
pages 241--245,
Mai 2000.
[bibtex-entry]
-
T. Jiménez,
P. Mussi,
and G. Siegel.
The distribution and partitioning scheme of the HIPERTRANS traffic simulator.
In European Simulation Symposium 2000,
Hamburg, Allemagne,
pages 462--466,
September 2000.
[bibtex-entry]
-
A. Laugier and P. Mahey.
Design of multi-level-protocol data networks.
In $2^{e}$ rencontres francophones sur les Aspects Algorithmiques des Telecommunications (ALGOTEL'2000),
La Rochelle, France,
pages 107--111,
Mai
2000.
[bibtex-entry]
-
M. Molloy and B. Reed.
$k$-colouring when $k$ is close to $\Delta$.
In 6th International Conference on Graph Theory (Marseille, 2000),
volume 5 of Electron. Notes Discrete Math.,
Amsterdam,
pages 4 pp. (electronic),
2000.
Elsevier.
[bibtex-entry]
-
M. Molloy and B. Reed.
Near-optimal list colorings.
In Proceedings of the Ninth International Conference ``Random Structures and Algorithms'' (Poznan, 1999),
volume 17,
pages 376--402,
2000.
[bibtex-entry]
-
P. Penna.
Succinct Representations of Model Based Belief Revision.
In Proc. of STACS-00, 17th Annual Symposium on Theoretical Aspects of Computer Science,
volume LNCS,
pages 205--216,
2000.
[bibtex-entry]
-
B. Reed.
How tall is a tree?.
In Proceedings of the Thiry-Second Annual ACM Symposium on Theory of Computing,
New York,
pages 479--483 (electronic),
2000.
ACM.
[bibtex-entry]
-
E. Altman,
G. Koole,
and T. Jiménez.
Comparing tandem queueing systems and their fluid limits.
In 37th Annual Allerton Conference on Communication, Control, and Computing,
September 1999.
[bibtex-entry]
-
F. Baude,
D. Caromel,
N. Furmento,
and D. Sagnol.
Overlapping Communication with Computation in Distributed Object Systems.
In Peter Sloot,
Marian Bubak,
Alfons Hoekstra,
and Bob Hertzberger, editors,
Proceedings of the 7th International Conference - High Performance Computing Networking'99 (HPCN Europe 1999),
volume 1593 of Lecture Notes in Computer Science,
Amsterdam, The Netherlands,
pages 744-753,
April 1999.
[bibtex-entry]
-
B. Beauquier and E. Darrot.
Arbitrary size Waksman networks.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 95-100,
May 1999.
[bibtex-entry]
-
B. Beauquier,
S. Pérennes,
and D. Tóth.
All-to-All Routing and Coloring in Weighted Trees of Rings.
In Proc. of 11th ACM Symp. on Parallel Algorithms and Architectures (SPAA),
Saint-Malo, France,
pages 185-190,
June 1999.
ACM Press.
[bibtex-entry]
-
P. Bergé,
A. Ferreira,
J. Galtier,
and J.-N. Petit.
A load study for intersatellite links in satellite constellations.
In ECSC 5 - Fifth European Conference on Satellite Communications,
Toulouse, France,CDRom,
November 1999.
[bibtex-entry]
-
J.-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Virtual path layouts with low congestion or low diameter in ATM networks.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 77-82,
May 1999.
[bibtex-entry]
-
R. Corrêa and A. Ferreira.
A polynomial-time branching procedure for the multiprocessor scheduling problem.
In Proceedings of Europar'99,
volume 1685 of Lecture Notes in Computer Science,
Toulouse (F),
pages 272-279,
August 1999.
Springer Verlag.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and X. Muñoz.
OTIS-Based Multi-Hop Multi-OPS Lightwave Networks.
In J. Rolim et al., editor,
Proceedings of the Workshop on Optics and Computer Science 1999,
volume 1586 of Lecture Notes in Computer Science,
pages 897-910,
April 1999.
Springer Verlag.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
D. Coudert,
A. Ferreira,
and S. Perennes.
Theoretical Aspects of the Optical Transpose Interconnecting System Architecture.
In Première Rencontres Francophones sur les aspects Algorithmiques des Télécommunications -- AlgoTel,
Roscoff, France,
pages 101-106,
5-7 Mai 1999.
[PDF
] [POSTSCRIPT
] [bibtex-entry]
-
A. Ferreira,
J. Galtier,
J.-N. Petit,
and H. Rivano.
Algorithmes de reroutage dans une constellation de satellites.
In Actes des 1ères Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'99),
Roscoff, France,
pages 107-112,
May 1999.
[WWW
] [PDF
] [POSTSCRIPT
] [bibtex-entry]
-
A. Ferreira and N. Schabanel.
A randomized BSP/CGM algorithm for the maximal independent set problem.
In Proceedings of ISPAN'99,
Fremantle, Australia,
pages 284-289,
June 1999.
IEEE.
[bibtex-entry]
-
J. Galtier.
Geographical reservation for guaranteed handover and routing in low earth orbit constellations.
In Geraldo Robson Mateus, editor,
I Workshop de Comunicacao Sem Fio,
Belo Horizonte, Minas Gerais, Brazil,
pages 77-86,
July 1999.
[bibtex-entry]
-
J. Galtier and S. Pérennes.
Parallel flips on planar triangulations.
In 15th European Workshop on Computational Geometry, Antibes Juan-Les-Pins,
pages 80-86,
1999.
[bibtex-entry]
-
T. Jiménez,
N. Furmento,
P. Mussi,
and G. Siegel.
A Traffic Simulator for Advanced Transport Telematics (ATT) Strategies.
In AFRICON'99,
volume 1,
Cape Town, South Africa,
pages 33--36,
September 1999.
[bibtex-entry]
-
T. Jiménez,
N. Furmento,
P. Mussi,
and G. Siegel.
Un framework à objets pour la simulation de trafic routier.
In Georges Habchi et Alain Haurat, editor,
Modélisation et Simulation des Flux Physiques et Informationnels (MOSIM),
Annecy, France,
pages 257--262,
Octobre 1999.
SCS International.
[bibtex-entry]
-
F. Lang,
P. Lescanne,
and L. Liquori.
A Framework for Defining Object-Calculi (extended abstract).
In FM, World Congress on Formal Methods in the Development of Computing Systems,
volume 1709 of Lecture Notes in Computer Science,
pages 963--982,
1999.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
M. Molloy and B. Reed.
Further algorithmic aspects of the local lemma.
In STOC '98 (Dallas, TX),
New York,
pages 524--529,
1999.
ACM.
[bibtex-entry]
-
L. Perkovic and B. Reed.
An improved algorithm for finding tree decompositions of small width.
In Graph-theoretic concepts in computer science (Ascona, 1999),
volume 1665 of Lecture Notes in Comput. Sci.,
Berlin,
pages 148--154,
1999.
Springer.
[bibtex-entry]
-
B. Reed.
Introducing directed tree width.
In 6th Twente Workshop on Graphs and Combinatorial Optimization (Enschede, 1999),
volume 3 of Electron. Notes Discrete Math.,
Amsterdam,
pages 8 pp. (electronic),
1999.
Elsevier.
[bibtex-entry]
-
J.-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Directed virtual path layouts in ATM networks.
In Proc. Conference DISC98, Andros, Greece,Sep. 1998 Lecture Notes in Computer Science, 1499,
pages 75-i88. (Full version appeared in TCS),
1998.
Springer Verlag.
[bibtex-entry]
-
J.-C. Bermond,
N. Marlin,
D. Peleg,
and S. Pérennes.
Virtual path layouts in simple ATM networks.
In Proc. Conference IFIP ATM '98,Ilkley,U.K.,Jul. 1998,
1998.
[bibtex-entry]
-
Gruia Calinescu,
Cristina G. Fernandes,
and B. Reed.
Multicuts in unweighted graphs with bounded degree and bounded tree-width.
In Integer programming and combinatorial optimization (Houston, TX, 1998),
volume 1412 of Lecture Notes in Comput. Sci.,
Berlin,
pages 137--152,
1998.
Springer.
[bibtex-entry]
-
D. Coudert,
A. Ferreira,
and X. Muñoz.
Multiprocessor Architectures Using Multi-hops Multi-OPS Lightwave Networks and Distributed Control.
In IEEE International Parallel Processing Symposium,
pages 151-155,
1998.
IEEE Press.
[PDF
] [POSTSCRIPT
] [Abstract] [bibtex-entry]
-
O. Dalle.
MPCFS : un exemple d'intégration transparente de mécanismes de communication multipoints dans les systèmes UNIX.
In Dominique Méry and Guy-René Perrin, editors,
10$^e$ Rencontres Francophones du Parallélisme (RENPAR'10),
Strasbourg,
Juin 1998.
[bibtex-entry]
-
O. Dalle.
MPCFS : un système de fichiers virtuel pour communications multipoints fiables entre systèmes UNIX.
In Deuxièmes Journées Doctorales Informatique et Réseaux (JDIR'98),
Paris,
Avril 1998.
[bibtex-entry]
-
P. Di Gianantonio,
F. Honsell,
and L. Liquori.
A Lambda Calculus of Objects with Self-inflicted Extension.
In Proc. of ACM-SIGPLAN OOPSLA, International Symposium on Object Oriented, Programming, System, Languages and Applications,
pages 166--178,
1998.
The ACM Press.
[POSTSCRIPT
] [bibtex-entry]
-
M. Diallo,
A. Ferreira,
and A. Rau-Chaplin.
Communication-efficient deterministic parallel algorithms for planar point location and 2d Voronoi diagram.
In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science -- STACS'98,
volume 1373 of Lecture Notes in Computer Science,
Paris, France,
pages 399--409,
February 1998.
Springer Verlag.
[bibtex-entry]
-
Hazel Everett,
Sulamita Klein,
and B. Reed.
An optimal algorithm for finding clique-cross partitions.
In Proceedings of the Twenty-ninth Southeastern International Conference on Combinatorics, Graph Theory and Computing (Boca Raton, FL, 1998),
volume 135,
pages 171--177,
1998.
[bibtex-entry]
-
A. Ferreira,
I. Guérin-Lassous,
K. Marcus,
and A. Rau-Chaplin.
Parallel Computation on Interval Graphs using PC clusters: Algorithms and Experiments.
In D. Pritchard and J. Reeves, editors,
Proceedings of Europar'98 (Distinguished Paper),
volume 1470 of Lecture Notes in Computer Science,
Southampton, UK,
pages 875-886,
September 1998.
Springer Verlag.
[bibtex-entry]
-
L. Liquori.
Bounded Polymorphism for Extensible Objects.
In Types, International Workshop on Types for Proof and Programs,
volume 1657 of Lecture Notes in Computer Science,
pages 149--163,
1998.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
L. Liquori.
On Object Extension.
In ECOOP, European Conference on Object Oriented Programming,
volume 1445 of Lecture Notes in Computer Science,
pages 498--552,
1998.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
M. Molloy and B. Reed.
Colouring graphs where chromatic number is almost their maximum degree.
In LATIN'98: theoretical informatics (Campinas, 1998),
volume 1380 of Lecture Notes in Comput. Sci.,
Berlin,
pages 216--225,
1998.
Springer.
[bibtex-entry]
-
B. Beauquier,
J.-C. Bermond,
L. Gargano,
P. Hell,
S. Perennes,
and U. Vaccaro.
Graph problems arising from Wavelength--Routing in All--Optical Networks.
In Proc. Conference WOCS97, Geneva,April 1997,
1997.
[PDF
] [bibtex-entry]
-
J.-C. Bermond,
J. Bond,
D. Peleg,
and S. Pérennes.
Tight bounds on the size of 2-monopolies.
In Proc. Conference SIROCCO96, Siena, June 96, International Informatics Series 6,
pages 170--179,
1997.
Carleton U. Press.
[bibtex-entry]
-
J.-C. Bermond,
M. Di Ianni,
M. Flammini,
and S. Pérennes.
Systolic orientations for deadlock prevention in usual networks.
In Proceedings 23th Int Workshop on Graph Theoretic Concepts in Computer Science WG97, Lecture Notes in Computer Science,
volume 1335,
pages 52--64,
1997.
Springer verlag.
[bibtex-entry]
-
P. Berthomé,
J. Cohen,
and A. Ferreira.
Embedding tori in Partitioned Optical Passive Star networks.
In D. Krizanc and P. Widmayer, editors,
Proceedings of 4th International Colloquium on Structural Information and Communication Complexity - Sirocco'97,
volume 1 of Proceedings in Informatics,
pages 40-52,
July 1997.
Carleton Scientific.
[bibtex-entry]
-
V. Bono,
M. Bugliesi,
M. Dezani-Ciancaglini,
and L. Liquori.
Subtyping Constraint for Incomplete Objects.
In TAPSOFT/CAAP, International Conference of Theory and Practice of Software Development,
volume 1214 of Lecture Notes in Computer Science,
pages 465--477,
1997.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
E. Caceres,
F. Dehne,
A. Ferreira,
P. Flocchini,
I. Rieping,
A. Roncato,
N. Santoro,
and S. Song.
Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP.
In P. Degano,
R. Gorrieri,
and A. Marchetti-Spaccamela, editors,
Proceedings of ICALP'97,
volume 1256 of Lecture Notes in Computer Science,
pages 390--400,
1997.
Springer-Verlag.
[bibtex-entry]
-
M. Cosnard and E. Jeannot.
Automatic Coarse-Grained Parallelization Techniques.
In NATO workshop on Advances in High Performance Computing,
1997.
Kluwer Academic Publishers.
[bibtex-entry]
-
A. Ferreira,
E. Fleury,
and M. Grammatikakis.
Multicasting Control and Communications on Multihop Stack-Ring OPS Networks.
In Proceedings of the 4th IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'97,
Montreal (Ca),
pages 39--44,
1997.
IEEE CS Press.
[bibtex-entry]
-
A. Ferreira,
C. Kenyon,
A. Rau-Chaplin,
and S. Ubéda.
d-Dimensional Range Search on Multicomputers.
In Proceedings of the 11th IEEE International Parallel Processing Symposium,
pages 616--620,
1997.
IEEE CS Press.
[bibtex-entry]
-
L. Gargano,
P. Hell,
and S. Pérennes.
Colouring paths in directed symmetric trees with applications to WDM routing.
In ICALP'97,
volume 1256 of Lecture Notes in Computer Science,
Bologna, Italy,
pages 505--515,
July 1997.
Springer-Verlag.
[bibtex-entry]
-
L. Liquori.
An Extended Theory of Primitive Objects: First Order System.
In ECOOP, European Conference on Object Oriented Programming,
volume 1241 of Lecture Notes in Computer Science,
pages 146--169,
1997.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
M. Badel,
T. de Pretto,
P. Mussi,
and G. Siegel.
Stat-Tool: An extensible and Distributed Object Oriented Statistic Tool for Discrete Event Simulation.
In Object Oriented Simulation Conference,
La Jolla -- USA,
January 1996.
[bibtex-entry]
-
F. Baude,
F. Belloncle,
J.-C. Bermond,
D. Caromel,
O. Dalle,
E. Darrot,
O. Delmas,
N. Furmento,
B. Gaujal,
P. Mussi,
S. Pérennes,
Y. Roudier,
G. Siegel,
and M. Syska.
The SLOOP project: Simulations, Parallel Object-Oriented Languages, Interconnection Networks.
In 2nd European School of Computer Science, Parallel Programming Environments for High Performance Computing ESPPE'96,
Alpe d'Huez,
pages 85--88,
April 1996.
[PDF
] [bibtex-entry]
-
J.-C. Bermond,
L. Gargano,
S. Pérennes,
A.A. Rescigno,
and U. Vaccaro.
Efficient Collective Communications in Optical Networks.
In Proc.23nd ICALP96, Paderborn, Germany Lecture Notes in Computer Science, 1099,
pages 574--585,
1996.
Springer verlag.
[POSTSCRIPT
] [bibtex-entry]
-
J.-C. Bermond,
T. Kodate,
and S. Perennes.
Gossiping in Cayley graphs by packets.
In Proceedings of the Franco-Japanese conference Brest July 95,
volume Lecture Notes in Computer Science, 1120,
pages 301-315,
1996.
Springer verlag.
[PDF
] [bibtex-entry]
-
J.-C. Bermond,
A. Marchetti,
and X. Munoz.
Induced broadcasting algorithms in iterated line digraphs.
In Proc. Conference EUROPAR96, Lyon, August 96, Lecture Notes in Computer Science, 1123,
pages 313--324,
1996.
Springer Verlag.
[bibtex-entry]
-
P. Berthomé and A. Ferreira.
Improved embeddings in POPS networks through stack-graph models.
In Proceedings of the 3rd IEEE International Conference on Massively Parallel Processing using Optical Interconnections -- MPPOI'96,
pages 130--136,
October 1996.
IEEE CS Press.
[bibtex-entry]
-
V. Bono,
M. Bugliesi,
and L. Liquori.
A Lambda Calculus of Incomplete Objects.
In MFCS, International Symposium of Mathematical Foundation of Computer Science,
volume 1113 of Lecture Notes in Computer Science,
pages 218--229,
1996.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
H. Bourdin,
A. Ferreira,
and K. Marcus.
On stack-graph OPS-based lightwave networks.
In L. Bougé,
P. Fraigniaud,
A. Mignotte,
and Y. Robert, editors,
Proceedings of EuroPar'96,
volume 1123 of Lecture Notes in Computer Science,
Lyon (F),
pages 218--221,
October 1996.
Springer-Verlag.
[bibtex-entry]
-
M. Bugliesi,
G. Delzanno,
L. Liquori,
and M. Martelli.
A Linear Logic Calculus of Objects.
In The MIT Press, editor,
JICSLP, Joint International Conference and Symposium on Logic Programming,
pages 67--81,
1996.
[POSTSCRIPT
] [bibtex-entry]
-
D. Caromel,
P. Dzwig,
R. Kauffman,
H. Liddell,
A. McEwan,
P. Mussi,
Johnathan Poole,
M. Rigg,
and R. Winder.
EC++ -- EUROPA Parallel C++ : A Draft Definition.
In Proceedings of High-Performance Computing and Networking (HPCN'96),
volume 1067,
pages 848--857,
April 1996.
Springer, Lectures Notes in Computer Science (LNCS).
[bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Algorithmes génétiques ``intelligents'' pour l'ordonnancement de tâches.
In Proceedings of the 8ème Rencontres du Parallélisme,
Bordeaux,
May 1996.
[bibtex-entry]
-
R. Corrêa,
A. Ferreira,
and P. Rebreyend.
Integrating list heuristics in genetic algorithms for multiprocessor scheduling.
In Proceedings of the 8th IEEE Symposium on Parallel and Distributed Processing -- SPDP'96,
New Orleans (USA),
pages 462--469,
October 1996.
IEEE CS Press.
[bibtex-entry]
-
O. Dalle.
LoadBuilder: A tool for generating and modeling workloads in distributed workstations environments.
In K. Yetongnon and S. Hariri, editors,
Proceedings of Parallel and Distributed Computing Systems (PDCS'96),
volume 1,
Dijon (France),
pages 248--253,
September 1996.
International Society for Computers and their Applications (ISCA).
[bibtex-entry]
-
T. Duboux and A. Ferreira.
Achieving Good Performance for Dictionary Machines: A Scalable Distributed Data Balancing Technique.
In Proceedings of Euromicro's 4th Workshop on Parallel and Distributed Processing,
Braga, Portugal,
1996.
IEEE Press.
[bibtex-entry]
-
A. Ferreira and K. Marcus.
A theoretical framework for the design of lightwave networks.
In F. Dehne and B. Hodson, editors,
Proceedings of The 10th IEEE Annual International Symposium on High Performance Computers -- HPCS'96,
Ottawa,
June 1996.
IEEE Press.
Note: CD-ROM.
[bibtex-entry]
-
B. Gaujal,
A. Jean-Marie,
P. Mussi,
and G.Siegel.
High Speed Simulation of Discrete Event Systems by Mixing Process Oriented and Equational Approaches.
In Environments and Tools for Parallel Scientific Computing,
Faverges de la Tour -- France,
August 1996.
[bibtex-entry]
-
C. Gavoille and S. Pérennes.
Lower Bounds for Shortest Path Interval Routing.
In N. Santoro and P. G. Spirakis, editors,
SIROCCO'96, The 3rd International Colloquium on Structural Information & Communication Complexity,
Siena, Italy,
pages 88-103,
June 1996.
[bibtex-entry]
-
C. Gavoille and S. Pérennes.
Memory Requirements for Routing in Distributed Networks (Extended Abstract).
In PODC,
pages 125-133,
1996.
Note: Best student paper award.
[bibtex-entry]
-
L. Liquori and G. Castagna.
A Typed Lambda Calculus of Objects.
In Asian, International Conference on Concurrency and Parallelism, Programming, Networking, and Security,
volume 1179 of Lecture Notes in Computer Science,
pages 129--141,
1996.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
P. Mussi and G.Siegel.
Extending the Prosit System to Support Distributed Simulation.
In European Simulation Symposium,
Genoa--Italy,
October 1996.
[bibtex-entry]
-
J.-C. Bermond,
J. Bond,
and S. Djelloul.
Dense bus networks of diameter 2.
In Proc. Workshop on interconnection Networks, DIMACS, Feb. 1994, DIMACS Ser.,
volume 21,
pages 9--18,
1995.
Annals New York Academy of Sciences.
[PDF
] [bibtex-entry]
-
J.-C. Bermond,
D. Caromel,
and P. Mussi.
Simulation within a Parallel Object-Oriented Language: The SLOOP System.
In proceedings Joint Conference on Information Sciences (JCIS),
pages 218--221,
October 1995.
Note: Invited session on Object-Oriented Programming.
[bibtex-entry]
-
J.-C. Bermond,
D. Caromel,
and P. Mussi.
Simulation within a parallel object oriented language : The SLOOP System.
In Proceedings Joint Conference on Information Sciences (JCIS'95), North Carolina , Sept. 1995,
1995.
[bibtex-entry]
-
J.-C. Bermond,
L. Gargano,
A.A. Rescigno,
and U. Vaccaro.
Fast gossiping by short messages.
In Proc.22nd ICALP95, Szeged, Hungary,
volume 944,
pages 135--146,
1995.
Lecture Notes in Computer Science, Springer Verlag.
[PDF
] [bibtex-entry]
-
J.-C. Bermond and D. Peleg.
The power of small coalitions in graphs.
In Proc. Conference SIROCCO95 Olympie June 95, International Informatics Series 2,
pages 173--184,
1995.
Carleton U. Press.
[PDF
] [bibtex-entry]
-
J.-C. Bermond and S. Pérennes.
Efficient broadcasting protocols on de Bruijn and similar networks.
In Proc. Conference SIROCCO95, Olympie June 95, International Informatics Series 2,
pages 199--209,
1995.
Carleton U. Press.
[PDF
] [bibtex-entry]
-
P. Berthomé and A. Ferreira.
Communication Issues in Parallel Systems with Optical Interconnections.
In R. A. Cryan,
P. N. Fernando,
P. Ghiggino,
and J. M. Senior, editors,
Broadband Networks: Strategies and Technologies,
volume 2450 of Proceedings of SPIE,
pages 464--473,
1995.
SPIE -- The International Society for Optical Engineering.
[bibtex-entry]
-
V. Bono and L. Liquori.
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects.
In CSL, International Conference of Computer Science Logic,
volume 933 of Lecture Notes in Computer Science,
pages 16--30,
1995.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
H. Bourdin,
A. Ferreira,
and K. Marcus.
A comparative study of one-to-many WDM lightwave interconnection networks for multiprocessors.
In Proceedings of the 2nd IEEE International Workshop on Massively Parallel Processing using Optical Interconnections -- MPPOI'95,
San Antonio (USA),
pages 257--264,
October 1995.
IEEE Press.
[bibtex-entry]
-
T. Duboux,
A. Ferreira,
and M. Gastaldo.
A scalable design for Dictionary Machines.
In Moonen and Cathoor, editors,
Algorithms and Parallel VLSI Architectures III,
pages 143--154,
1995.
Elsevier.
[bibtex-entry]
-
A. Ferreira and K. Marcus.
Modular multihop WDM--based lightwave networks, and routing.
In S. I Najafi and H. Porte, editors,
Fiber Optic Network Components,
volume 2449 of Proceedings of SPIE,
pages 78--86,
1995.
SPIE -- The International Society for Optical Engineering.
[bibtex-entry]
-
A. Ferreira and N. Qadri.
Performance of WDM systems.
In IEEE International Conference on High Performance Computing -- HiPC'95,
New Delhi,
December 1995.
IEEE Press.
[bibtex-entry]
-
A. Ferreira,
A. Rau-Chaplin,
and S. Ubeda.
Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers.
In Proceedings of the 7th IEEE Symposium on Parallel and Distributed Processing -- SPDP'95,
San Antonio (USA),
pages 561--569,
October 1995.
IEEE Press.
[bibtex-entry]
-
A. Ferreira and S. Ubéda.
Parallel complexity of the medial axis transform.
In Proceedings of the IEEE International Conference on Image Processing -- ICIP'95,
volume II,
Washington DC,
pages 105--107,
October 1995.
IEEE Press.
[bibtex-entry]
-
L. Liquori.
A Typed Axiomatic Object Calculus with Subtyping.
In ATSC, International Workshop on Advances in Type Systems for Computing,
Newton Institute, Cambridge,
1995.
[bibtex-entry]
-
M. Molloy and B. Reed.
A critical point for random graphs with a given degree sequence.
In Proceedings of the Sixth International Seminar on Random Graphs and Probabilistic Methods in Combinatorics and Computer Science, ``Random Graphs '93'' (Poznan, 1993),
volume 6,
pages 161--179,
1995.
[bibtex-entry]
-
P. Mussi and G. Siegel.
The PROSIT Sequential Simulator: A Test-bed for Object Oriented Discrete Event Simulation.
In European Simulation Symposium,
Erlangen, Germany,
pages 297--301,
October 1995.
[bibtex-entry]
-
S. Akl,
J. Duprat,
and A. Ferreira.
Building hamiltonian circuits and paths on star graphs.
In I. Dimov and O. Tonev, editors,
Advances in Parallel Algorithms -- Proceedings of the Workshop on Parallel Algorithms '92,
Sophia (Bul),
pages 131--143,
1994.
IOS Press.
[bibtex-entry]
-
F. Desprez,
A. Ferreira,
and B. Tourancheau.
Efficient communication operations on passive optical star networks.
In Proceedings of the First IEEE International Workshop on Massively Parallel Processing Using Optical Interconnections -- MPPOI'94,
pages 52--58,
1994.
IEEE Press.
[bibtex-entry]
-
P. Ferrante,
P. Mussi,
G. Siegel,
and L. Mallet.
Object Oriented Simulation: Highlights on the Prosit Parallel Discrete Event Simulator.
In Western Simulation Conference 1994, Tempe (AZ),
Juanary 1994.
SCS.
[bibtex-entry]
-
A. Ferreira,
A. Goldman,
and S. W. Song.
Broadcasting in bus interconnection networks.
In B. Buchberger and J. Volkert, editors,
Parallel Processing: CONPAR 94 -- VAPP VI,
volume 854 of Lecture Notes in Computer Science,
pages 797--807,
1994.
Springer Verlag.
[bibtex-entry]
-
A. Ferreira,
A. Goldman,
and S.W. Song.
Bus based parallel computers: A viable way for massive parallelism.
In C. Halatsis,
D. Maritsas,
G. Philokyprou,
and S. Thoedoridis, editors,
PARLE '94 -- Parallel Architectures and Languages Europe,
volume 817 of Lecture Notes in Computer Science,
pages 553--564,
1994.
Springer Verlag.
[bibtex-entry]
-
A. Ferreira and M. Grammatikakis.
Improved probabilistic routing in generalized hypercubes.
In C. Halatsis,
D. Maritsas,
G. Philokyprou,
and S. Theodoridis, editors,
Proceedings of PARLE,
volume 817 of Lecture Notes in Computer Science,
pages 1--12,
1994.
Springer Verlag.
[bibtex-entry]
-
L. Liquori and M.L. Sapino.
Dealing with Explicit Exceptions.
In M. Alpuente,
R. Barbuti,
and I. Ramos, editors,
GULP-PRODE, International Joint Conference on Declarative Programming,
pages 296--308,
1994.
[POSTSCRIPT
] [bibtex-entry]
-
P. Mussi,
P. Ferrante,
G. Siegel,
and L. Mallet.
Object Oriented SImulation: Highlights on the PROSIT Distributed DIscrete Event Simulator.
In Object Oriented SImulation Conference,
Juanary 1994.
SCS,
SCS.
Note: Part of the 1994 Western Simulation Multiconference, Tempe, Arizona.
[bibtex-entry]
-
S. van Bakel,
L. Liquori,
S. Ronchi della Rocca,
and P. Urzyczyn.
Comparing Cubes.
In LFCS, International Symposium on Logical Foundations of Computer Science,
volume 813 of Lecture Notes in Computer Science,
pages 353--365,
1994.
Springer Verlag.
[POSTSCRIPT
] [bibtex-entry]
-
P. Berthomé,
A. Ferreira,
B. Maggs,
S. Perennes,
and G. Plaxton.
Sorting-based selection algorithms on hypercubic networks.
In Proceedings of the 7th IEEE International Parallel Processing Symposium -- IPPS'93,
pages 89--95,
1993.
IEEE Press.
[bibtex-entry]
-
P. Berthomé,
A. Ferreira,
and S. Perennes.
Improved algorithm design and optimal information dissemination in Star and Pancake networks.
In Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing -- SPDP'93,
pages 720--723,
December 1993.
IEEE Press.
[bibtex-entry]
-
V. Castro-Alves,
A. Ferreira,
and O. Kebichi.
A new class of fault models and test algorithms for dual-port dynamic RAM testing.
In Proceedings of the IEEE International Workshop on Memory Testing,
San Jose (CA),
pages 68--71,
August 1993.
IEEE Press.
[bibtex-entry]
-
T. Duboux,
A. Ferreira,
and M. Gastaldo.
Machine dictionnaire sur architectures à mémoire distribuée.
In Proceedings of the 5ème Rencontres du Parallélisme,
Brest,
pages 213--216,
May 1993.
[bibtex-entry]
-
A. Ferreira,
A. Goldman,
and S. Song.
Comunicação em hipergrades e hipertoros usando barramentos.
In Proceedings of the 5th Simpósio Brasileiro de Arquitetura de Computadores e Proc. de Alto Desempenho, SBC,
Florianópolis (Br),
pages 17--32,
September 1993.
Brazilian Society of Computer Science.
[bibtex-entry]
-
A. Ferreira and S. Ubéda.
Ultra-fast parallel contour tracking, with applications to thinning.
In G.R. Joubert,
D. Trystram,
F.J. Peters,
and D.J. Evans, editors,
Parallel Computing: Trends and Applications (ParCo'93),
volume 9 of Advances in Parallel Computing,
pages 97--104,
1993.
Elsevier Science B.V., Amsterdam.
[bibtex-entry]
-
L. Mallet and P. Mussi.
Object Oriented Parallel Discrete Event Simulation: The PROSIT Approach.
In Modelling and Simulation FSM 93, june 7-9, LYON,
June 1993.
SCS.
[bibtex-entry]
-
H. Rakotoarisoa and P. Mussi.
PARSEVAL: A Workbench for Queueing Networks Parallel Simulation.
In Modelling and Simulation FSM 93, june 7-9, LYON,
June 1993.
SCS.
[bibtex-entry]
-
S. Akl,
M. Cosnard,
and A. Ferreira.
Revisiting parallel speedup complexity.
In W.W. Koczkodaj,
P.L. Lauer,
and A.A. Toptsis, editors,
Proceedings of the IEEE International Conference on Computing and Information -- ICCI'92,
pages 179--182,
1992.
IEEE Press.
[bibtex-entry]
-
J.-C. Bermond and P. Fraigniaud.
Broadcasting and NP-Completeness.
In Graph Theory Notes of New York,
volume XXII,
pages 8--14,
1992.
[PDF
] [bibtex-entry]
-
J. C. Bermond and M. Syska.
Routage wormhole et canaux virtuels.
In M. Nivat M. Cosnard and Y. Robert, editors,
Algorithmique Parallèle,
pages 149--158,
1992.
Masson.
[PDF
] [bibtex-entry]
-
P. Berthomé and A. Ferreira.
Efficiently solving geometric problems on large hypercube multiprocessors.
In S. Tzafestas,
P. Borne,
and L. Grandinetti, editors,
Parallel and Distributed Computing in Engineering Systems,
pages 123--128,
1992.
IMACS - North Holland.
[bibtex-entry]
-
M. Cosnard and A. Ferreira.
Designing non-numerical parallel algorithms.
In D.J. Evans,
G.R. Joubert,
and H. Liddell, editors,
invited paper, Proceedings of the International Conference on Parallel Computing -- ParCo'91,
London (UK),
pages 3--18,
1992.
Elsevier Science Publishers B.V..
[bibtex-entry]
-
T. Duboux,
A. Ferreira,
and M. Gastaldo.
MIMD Dictionary Machines: from theory to practice.
In L. Bougé et al., editor,
Parallel Processing: CONPAR 92 - VAPP V,
volume 634 of Lecture Notes in Computer Science,
pages 545--550,
1992.
Springer-Verlag.
[bibtex-entry]
-
A. Ferreira.
Parallel search in sorted multisets, and NP-Complete problems.
In R. Baeza-Yates and U. Manber, editors,
Computer Science - Research and Applications,
Santiago - Chile,
pages 383--394,
1992.
Plenum Press.
[bibtex-entry]
-
A. Ferreira and S. Song.
Achieving optimality for gate matrix layout and PLA folding: a graph theoretic approach.
In I. Simon, editor,
LATIN '92,
volume 384 of Lecture Notes in Computer Science,
São Paulo (Br),
pages 139--153,
1992.
Springer-Verlag.
[bibtex-entry]
-
C. McDiarmid,
B. Reed,
A. Schrijver,
and B. Shepherd.
Noninterfering network flows.
In Algorithm theory---SWAT '92 (Helsinki, 1992),
volume 621 of Lecture Notes in Comput. Sci.,
Berlin,
pages 245--257,
1992.
Springer.
[bibtex-entry]
-
M. Cosnard and A. Ferreira.
A tight bound for selection in X+Y.
In F. Dehne et al., editor,
Advances in Computing and Information - ICCI '91,
volume 497 of Lecture Notes in Computer Science,
pages 134--138,
1991.
Springer-Verlag.
[bibtex-entry]
-
F. Dehne,
A. Ferreira,
and A. Rau-Chaplin.
Efficient parallel construction and manipulation of pointer based quadtrees.
In Proceedings of the International Conference on Parallel Processing -- ICPP'91,
St. Charles (USA),
pages 255--262,
1991.
[bibtex-entry]
-
A. Ferreira and J. Peters.
Finding the smallest path in a rectilinear polygon on a hypercube multiprocessor.
In Proceedings of the Third Canadian Conference on Computational Geometry -- CCCG'91,
Vancouver (Ca),
pages 162--165,
1991.
[bibtex-entry]
-
B. Alspach,
J.-C. Bermond,
and D. Sotteau.
Decomposition into cycles I: Hamilton decompositions.
In Proceedings of 1987 Cycles and Rays Colloquium, Montréal,
pages 9--18,
1990.
NATO ASI Ser. C, Kluwer Academic Publishers, Dordrech PDF = ftp://ftp-sop.inria.fr/mascotte/personnel/Jean-Claude.Bermond/PUBLIS/ABS90.pdf.
[bibtex-entry]
-
J.-C. Bermond and J. Bond.
Combinatorial designs and hypergraphs of diameter one.
In Proceedings of the firts China-US International Conference, Jinan, China, June 1986,
volume 576,
pages 51--62,
1990.
Annals of the New York Academy of Sciences.
[bibtex-entry]
-
B. Braschi,
A. Ferreira,
and J. Zerovnik.
On the asymptotic behaviour of parallel simulated annealing.
In D.J. Evans,
G.R. Joubert,
and F.J. Peters, editors,
Proceedings of the International Conference on Parallel Computing -- ParCo'89,
pages 263--268,
1990.
North-Holland.
[bibtex-entry]
-
F. Dehne,
A. Ferreira,
and A. Rau-Chaplin.
A massively parallel knowledge-base server using a hypercube multiprocessor.
In Proceedings of the IEEE International Conference on Tools for AI,
Washington D.C.,
pages 660--666,
1990.
IEEE Press.
[bibtex-entry]
-
F. Dehne,
A. Ferreira,
and A. Rau-Chaplin.
Parallel AI algorithms for fine-grained hypercube multiprocessors.
In G. Wolf et al., editor,
invited paper, Proceedings of the International Workshop on Parallel Processing by Cellular Automata and Arrrays (PARCELLA),
volume 2,
East-Berlin,
pages 51--65,
1990.
[bibtex-entry]
-
J.-C. Bermond,
G. Illiades,
and C. Peyrat.
An optimization problem in distributed loop computer networks.
In Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985),
volume 555 of Ann. New York Acad. Sci.,
New York,
pages 45--55,
1989.
New York Acad. Sci..
[bibtex-entry]
-
J.-C. Bermond and J.-C. Konig.
General and efficient decentralized consensus protocols II.
In Proc. of the International Workshop on Parallel and distributed algorithms, Bonas, France,
pages 199--210,
1989.
North-Holland.
[bibtex-entry]
-
J.-C. Bermond and C. Peyrat.
De Bruijn and Kautz networks: a competitor for the hypercube?.
In F. André and J-P. Verjus, editors,
Proceedings of the 1st European Workshop on Hypercubes and Distributed Computers, Rennes,
pages 279--293,
1989.
North Holland.
[bibtex-entry]
-
M. Cosnard and A. Ferreira.
Parallel algorithms for searching in X+Y.
In F.Ris and P.M.Kogge, editors,
Proceedings of the International Conference on Parallel Processing -- ICPP'89,
volume 3,
pages 16--19,
1989.
Penn State University Press.
[bibtex-entry]
-
F. Dehne,
A. Ferreira,
and A. Rau-Chaplin.
Parallel branch and bound on fine grained hypercube multiprocessors.
In Proceedings of the IEEE Workshop on Tools for AI,
Herndon, VA (USA),
pages 616--622,
1989.
IEEE Press.
[bibtex-entry]
-
F. Dehne,
A. Ferreira,
and A. Rau-Chaplin.
Parallel fractional cascading on a hypercube multiprocessor.
In Proceedings of the 27th Annual Allerton Conference on Communication, Control and Computing,
pages 1084--1093,
October 1989.
[bibtex-entry]
-
A. Ferreira.
The Knapsack Problem on Parallel Architectures.
In M. Cosnard et al., editor,
Parallel and Distributed Algorithms,
pages 145--152,
1989.
North-Holland.
[bibtex-entry]
-
A. Ferreira and M. Gastaldo.
Implementing sorting on a hypercube.
In F. André et J.-P. Verjus, editor,
Hypercube and Distributed Computers,
pages 359--360,
1989.
INRIA-North-Holland.
[bibtex-entry]
-
Z. Liu and P. Mussi.
Performance evaluation of a deadlock free protocol for blocking rings.
In International Conference on Super Computing,
June 1989.
[bibtex-entry]
-
J.-C. Bermond and J.-M. Fourneau.
Independent connections: an easy characterization of baseline equivalent multistage interconnection networks.
In Int. Conf. on Parallel Processing,
August 1988.
[bibtex-entry]
-
J.-C. Bermond,
J.-C. König,
and M. Raynal.
General and efficient decentralized consensus protocols.
In Distributed algorithms (Amsterdam, 1987),
volume 312 of Lecture Notes in Comput. Sci.,
Berlin,
pages 41--56,
1988.
Springer.
[bibtex-entry]
-
M. Cosnard and A. Ferreira.
A processor network for generating all the permutations.
In E. Chiricozzi and A. D'Amico, editors,
Parallel Processing and Applications,
pages 141--147,
1988.
North-Holland.
[bibtex-entry]
-
A. Ferreira.
An optimal ${O(n^2)}$ algorithm to fold special PLA's.
In H.A.Eiselt and G.Pederzoli, editors,
Advances in Optimization and Control,
volume 302 of Lecture Notes in Economics and Math. Systems,
pages 92--102,
1988.
Springer-Verlag.
[bibtex-entry]
-
A. Ferreira.
Efficient parallel algorithms for the knapsack problem.
In M. Cosnard et al., editor,
Parallel Processing,
pages 169--179,
1988.
IFIP-North Holland.
[bibtex-entry]
-
J.-C. Bermond,
J. Bond,
and C. Peyrat.
Interconnection networks with each node on two buses in Parallel Algorithms and Architectures.
In Proceedings InTernational Workshop on Parallel Algorithms and Architectures,
pages 155--167,
April 1986.
North Holland.
[bibtex-entry]
-
A. Ferreira.
O problema do dobramento optimal de PLA's: uma nova abordagem e seu algoritmo.
In Proceedings of the 6th Brazilian Congress on Computer Science,
1986.
University of Pernambuco Press.
[bibtex-entry]
-
C. L. Monma,
B. Reed,
and W. T. Trotter, Jr..
A generalization of threshold graphs with tolerances.
In Proceedings of the seventeenth Southeastern international conference on combinatorics, graph theory, and computing (Boca Raton, Fla., 1986),
volume 55,
pages 187--197,
1986.
[bibtex-entry]
-
J.-C. Bermond and G. Memmi.
A graph theoretical characterization of minimal deadlocks in Petri nets.
In Graph theory with applications to algorithms and computer science (Kalamazoo, Mich., 1984),
Wiley-Intersci. Publ.,
New York,
pages 73--87,
1985.
Wiley.
[bibtex-entry]
-
A. Ferreira.
Algoritmos heurìsticos para otimização de PLA's.
In Proceedings of the 5th Brazilian Symposium of Microelectronics,
1985.
University of São Paulo Press.
[bibtex-entry]
-
W. Jalby,
J. Maillard,
and P. Mussi.
Evaluation of Parallel Execution of Program Tree Structures.
In Parallel Computing 85,
pages 279--285,
1985.
[bibtex-entry]
-
J.-C. Bermond,
J. Bond,
and J.-F. Saclé.
Large hypergraphs of diameter $1$.
In Graph theory and combinatorics (Cambridge, 1983),
London,
pages 19--28,
1984.
Academic Press.
[bibtex-entry]
-
P. Mussi and P. Nain.
Evaluation of Parallel Execution of Program Tree Structures.
In ACM SIGMETRICS Conference on Measurement and Modeling,
volume 12,
August 1984.
ACM.
[bibtex-entry]
-
J.-C. Bermond,
C. Delorme,
and J.-J. Quisquater.
Grands graphes de degré et diamètre fixés.
In Combinatorial mathematics (Marseille-Luminy, 1981),
volume 75 of North-Holland Math. Stud.,
Amsterdam,
pages 65--73,
1983.
North-Holland.
[bibtex-entry]
-
J.-C. Bermond and B. Bollobás.
The diameter of graphs---a survey.
In Proceedings of the Twelfth Southeastern Conference on Combinatorics, Graph Theory and Computing, Vol. I (Baton Rouge, La., 1981),
volume 32,
pages 3--27,
1981.
[bibtex-entry]
-
J.-C. Bermond.
Graceful graphs, radio antennae and French windmills.
In Graph theory and combinatorics (Proc. Conf., Open Univ., Milton Keynes, 1978),
volume 34 of Res. Notes in Math.,
Boston, Mass.,
pages 18--37,
1979.
Pitman.
[bibtex-entry]
-
J.-C. Bermond.
Le problème des ``ouvroirs''.
In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976),
volume 260 of Colloq. Internat. CNRS,
Paris,
pages 31--34,
1978.
CNRS.
[bibtex-entry]
-
J.-C. Bermond,
A. E. Brouwer,
and A. Germa.
Systèmes de triplets et différences associées.
In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976),
volume 260 of Colloq. Internat. CNRS,
Paris,
pages 35--38,
1978.
CNRS.
[bibtex-entry]
-
J.-C. Bermond,
A. Germa,
M.-C. Heydemann,
and D. Sotteau.
Hypergraphes hamiltoniens.
In Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976),
volume 260 of Colloq. Internat. CNRS,
Paris,
pages 39--43,
1978.
CNRS.
[PDF
] [bibtex-entry]
-
J.-C. Bermond,
A. Kotzig,
and J. Turgeon.
On a combinatorial problem of antennas in radioastronomy.
In Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I,
volume 18 of Colloq. Math. Soc. János Bolyai,
Amsterdam,
pages 135--149,
1978.
North-Holland.
[bibtex-entry]
-
J.-C. Bermond and D. Sotteau.
Cycle and circuit designs odd case.
In Contributions to graph theory and its applications (Internat. Colloq., Oberhof, 1977) (Germany),
Ilmenau,
pages 11--32,
1977.
Tech. Hochschule Ilmenau.
[PDF
] [bibtex-entry]
-
J.-C. Bermond.
On Hamiltonian walks.
In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975),
Winnipeg, Man.,
pages 41--51. Congressus Numerantium, No. XV,
1976.
Utilitas Math..
[bibtex-entry]
-
J.-C. Bermond and D. Sotteau.
Graph decompositions and $G$-designs.
In Proceedings of the Fifth British Combinatorial Conference (Univ. Aberdeen, Aberdeen, 1975),
Winnipeg, Man.,
pages 53--72. Congressus Numerantium, No. XV,
1976.
Utilitas Math..
[PDF
] [bibtex-entry]
-
J.-C. Bermond.
Decomposition of $K\sp*\sb{n}$ into $k$-circuits and balanced $G$-designs.
In Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974),
Prague,
pages 57--68,
1975.
Academia.
[bibtex-entry]
-
J.-C. Bermond.
The circuit-hypergraph of a tournament.
In Infinite and finite sets (Colloq., Keszthely, 1973; dedicated to P. Erdos on his 60th birthday), Vol. I,
Amsterdam,
pages 165--180. Colloq. Math. Soc. János Bolyai, Vol. 10,
1975.
North-Holland.
[bibtex-entry]
-
J.-C. Bermond.
Graphe représentatif de l'hypergraphe $h$-parti complet.
In Hypergraph Seminar (Proc. First Working Sem., Ohio State Univ., Columbus, Ohio, 1972; dedicated to Arnold Ross),
Berlin,
pages 34--53. Lecture Notes in Math., Vol. 411,
1974.
Springer.
[bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
A. Navarra,
N. Nisse,
and N. Suchan.
A unified approach for different tasks on rings in robot-based computing systems.
In 15th Workshop on Advances in Parallel and Distributed Computational Models (APDCM),
.
IEEE.
Note: To appear.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and R. Soares.
On The Monotonicity of Process Number.
In proceedings of the Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS'13),
Electronic Notes in Discrete Mathematics,
Playa del Carmen, Mexico,
April.
[PDF
] [Abstract] [bibtex-entry]
BACK TO MASCOTTE PUBLICATION INDEX
Last modified: Thu Oct 10 14:10:00 2013
This document was translated from BibTEX by
bibtex2html
|
