BACK TO MASCOTTE PUBLICATION INDEX
Publications of year 2012
-
J. Araujo.
Graph Coloring and Graph Convexity.
PhD thesis,
University of Nice-Sophia Antipolis and Federal University of Ceará,
September 2012.
[PDF
] [Abstract] [bibtex-entry]
-
L. Sampaio.
Algorithmic aspects of graph colouring heuristics.
PhD thesis,
University of Nice-Sophia Antipolis,
November 2012.
[PDF
] [Abstract] [bibtex-entry]
-
B. M. T. Worou.
Outils Algorithmiques pour la Détection des Communautés dans les Réseaux.
PhD thesis,
University of Nice-Sophia Antipolis,
December 2012.
[Abstract] [bibtex-entry]
-
F. Giroire,
D. Mazauric,
and J. Moulierac.
Energy Efficient Routing by Switching-Off Network Interfaces,
chapter 10 - Energy-Aware Systems and Networking for Sustainable Initiatives,
pages 207-236.
IGI Global,
june 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
O. Amini,
D. Peleg,
S. Pérennes,
I. Sau,
and S. Saurabh.
On the approximability of some degree-constrained subgraph problems.
Discrete Applied Mathematics,
160(12):1661 - 1679,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
J-C. Bermond,
F. Giroire,
F. Havet,
D. Mazauric,
and R. Modrzejewski.
Weighted improper colouring.
Journal of Discrete Algorithms,
16:53-66,
2012.
Note: Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011).
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
N. Cohen,
F. Giroire,
and F. Havet.
Good edge-labelling of graphs.
Discrete Applied Mathematics,
160(18):2501-2513,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo and C. Linhares Sales.
On the Grundy number of graphs with few P4's.
Discrete Applied Mathematics,
160(18):2514-2522,
2012.
Note: V Latin American Algorithms, Graphs, and Optimization Symposium â Gramado, Brazil, 2009.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and N. Trotignon.
Finding an induced subdivision of a digraph.
Theoretical Computer Science,
443:10-24,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Barrière,
P. Flocchini,
F. Fomin,
P. Fraigniaud,
N. Nisse,
N. Santoro,
and D. Thilikos.
Connected Graph Searching.
Information and Computation,
219:1-16,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Baruah,
V. Bonifaci,
G. D'Angelo,
H. Li,
A. Marchetti-Spaccamela,
N. Megow,
and L. Stougie.
Scheduling Real-time Mixed-criticality Jobs.
IEEE Transactions on Computers,
61(8):1140-1152,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
R. Bauer,
G. D'Angelo,
D. Delling,
A. Schumm,
and D. Wagner.
The Shortcut Problem - Complexity and Algorithms.
Journal of Graph Algorithms and Applications,
16(2):447-481,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
J. Moulierac,
S. Pérennes,
I. Sau,
and F. Solano Donado.
GMPLS Label Space Minimization through Hypergraph Layouts.
Theoretical Computer Science (TCS),
444:3-16,
July 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and J. Moulierac.
Internet et la théorie des graphes.
Revue TDC Textes et documents pour la Classe : la révolution Internet,
1042:32-33,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond and J. Peters.
Optimal Gathering in Radio Grids with Interference.
Theoretical Computer Science,
457:10-26,
October 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
S. Bhadra and A. Ferreira.
Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs.
J. Internet Services and Applications,
3(3):269-275,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Campos,
A. Gyárfás,
F. Havet,
C. Linhares Sales,
and F. Maffray.
New bounds on the Grundy number of products of graphs.
Journal of Graph Theory,
71(1):78-88,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
Y. Chen,
E. Le Merrer,
Z. Li,
Y. Liu,
and G. Simon.
OAZE: A Network-Friendly Distributed Zapping System for Peer-to-Peer IPTV.
Computer Networks,
56(1):365-377,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
D. Coudert,
F. Huc,
and D. Mazauric.
A Distributed Algorithm for Computing the Node Search Number in Trees.
Algorithmica,
63(1-2):158-190,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
and A. Navarra.
Minimize the Maximum Duty in Multi-interface Networks.
Algorithmica,
63(1-2):274-295,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Esperet,
F. Kardos,
and D. Král'.
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs.
European Journal of Combinatorics,
33(5):767-798,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
A. Ferreira and A. Jarry.
Minimum-Energy Broadcast Routing in Dynamic Wireless Networks.
Journal of Green Engineering,
2(2):115-123,
2012.
[PDF
] [Abstract] [bibtex-entry]
-
D. Gonçalves,
F. Havet,
A. Pinlou,
and S. Thomassé.
On spanning galaxies in digraphs.
Discrete Applied Mathematics,
160(6):744-754,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
C. Linhares Sales,
and L. Sampaio.
b-coloring of tight graphs.
Discrete Applied Mathematics,
160(18):2709-2715,
2012.
[WWW
] [bibtex-entry]
-
F. Havet,
B. Reed,
and J.-S. Sereni.
Griggs and Yeh's conjecture and $L(p,1)$-labellings.
SIAM Journal on Discrete Mathematics,
26(1):145-168,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse,
I. Rapaport,
and K. Suchan.
Distributed computing of efficient routing schemes in generalized chordal graphs.
Theoretical Computer Science,
444(27):17-27,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
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,
F. Giroire,
Y. Liu,
R. Modrzejewski,
and J. Moulierac.
Energy Efficient Content Distribution.
Technical report RR-8091,
INRIA,
October 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Araujo,
G. Morel,
L. Sampaio,
R. Soares,
and V. Weber.
Hull number: $P_5$-free graphs and reduction rules.
Technical report RR-8045,
INRIA,
August 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J. Bang-Jensen,
F. Havet,
and A. K. Maia.
Finding a subdivision of a digraph.
Technical report RR-8024,
INRIA,
July 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
J-C. Bermond,
D. Coudert,
G. D'Angelo,
and F. Z. Moataz.
Diverse Routing with the star property.
Technical report RR-8071,
INRIA,
September 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
L. Blin,
J. Burman,
and N. Nisse.
Perpetual Graph Searching.
Technical report RR-7897,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
V. Campos,
F. Havet,
R. Sampaio,
and A. Silva.
Backbone colouring: tree backbones with small diameter in planar graphs.
Technical report RR-8151,
INRIA,
November 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Cohen,
D. Coudert,
and A. Lancin.
Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs.
Technical report RR-8074,
INRIA,
September 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
and A. Navarra.
How to gather asynchronous oblivious robots on anonymous rings.
Technical report RR-7963,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. D'Angelo,
G. Di Stefano,
A. Navarra,
N. Nisse,
and K. Suchan.
A unified approach for different tasks on rings in robot-based computing systems.
Technical report RR-8013,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
G. Ducoffe.
Eulerian and Hamiltonian Directed Hypergraphs.
Technical report RR-7893,
INRIA,
2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet and A. D. King.
List circular backbone colouring.
Technical report RR-8159,
INRIA,
November 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
A. D. King,
M. Liedloff,
and I. Todinca.
(Circular) backbone colouring: tree backbones in planar graphs.
Technical report RR-8152,
INRIA,
November 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
A. K. Maia,
and M. Yu.
Complexity of greedy edge-colouring.
Technical report RR-8171,
INRIA,
December 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
F. Havet,
N. Paramaguru,
and R. Sampathkumar.
Detection number of bipartite graphs and cubic graphs.
Technical report RR-8115,
INRIA,
October 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.
Technical report RR-7888,
INRIA,
February 2012.
[WWW
] [PDF
] [Abstract] [bibtex-entry]
-
N. Nisse and R. Soares.
On The Monotonicity of Process Number.
Technical report RR-7003,
INRIA,
October 2012.
[WWW
] [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