-
L. Addario-Berry,
F. Havet,
C. Linhares Sales,
B. Reed,
and S. Thomassé.
Oriented trees in digraphs.
Discrete Mathematics,
313(8):967-974,
2013.
[WWW
]
@article{addarioberry:hal-00821609,
AUTHOR = {Addario-Berry, L. and Havet, F. and Linhares Sales, C. and Reed, B. and Thomassé, S.},
TITLE = {Oriented trees in digraphs},
JOURNAL = {Discrete Mathematics},
PUBLISHER = {Elsevier},
VOLUME = {313},
NUMBER = {8},
PAGES = {967-974},
YEAR = {2013},
URL2 = {http://www.sciencedirect.com/science/article/pii/S0012365X13000289},
DOI = {10.1016/j.disc.2013.01.011},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821609},
X-ID-HAL = {hal-00821609},
}
-
J. Araujo,
V. Campos,
F. Giroire,
N. Nisse,
L. Sampaio,
and R Soares.
On the hull number of some graph classes.
Theoretical Computer Science,
475:1-12,
January 2013.
[WWW
] [PDF
]
@article{araujo:hal-00770650,
AUTHOR = {Araujo, J. and Campos, V. and Giroire, F. and Nisse, N. and Sampaio, L. and Soares, R},
TITLE = {On the hull number of some graph classes},
JOURNAL = {Theoretical Computer Science},
PUBLISHER = {Elsevier},
VOLUME = {475},
PAGES = {1-12},
YEAR = {2013},
MONTH = Jan,
DOI = {10.1016/j.tcs.2012.12.035},
PDF={http://hal.inria.fr/hal-00770650/PDF/Hull-TCS-Corrected.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00770650},
X-ID-HAL = {hal-00770650},
}
-
J. Araujo and C. Linhares Sales.
A Hajós-like theorem for weighted coloring.
Journal of the Brazilian Computer Society,
19(3):275-278,
January 2013.
[WWW
] [PDF
]
@article{araujo:hal-00773410,
AUTHOR = {Araujo, J. and Linhares Sales, C.},
TITLE = {A Hajós-like theorem for weighted coloring},
JOURNAL = {Journal of the Brazilian Computer Society},
PUBLISHER = {Springer},
VOLUME = {19},
NUMBER = {3},
PAGES = {275-278},
YEAR = {2013},
MONTH = Jan,
DOI = {10.1007/s13173-012-0098-y},
PDF={http://hal.inria.fr/hal-00773410/PDF/hajos\_journalSBC.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00773410},
X-ID-HAL = {hal-00773410},
}
-
J-C. Bermond,
M. Cosnard,
and S. Pérennes.
Directed acyclic graphs with the unique dipath property.
Theoretical Computer Science,
504:5-11,
September 2013.
[WWW
] [PDF
]
@article{bermond:hal-00869501,
AUTHOR = {Bermond, J-C. and Cosnard, M. and Pérennes, S.},
TITLE = {Directed acyclic graphs with the unique dipath property},
JOURNAL = {Theoretical Computer Science},
VOLUME = {504},
PAGES = {5-11},
YEAR = {2013},
MONTH = Sep,
DOI = {10.1016/j.tcs.2012.06.015},
PDF={http://hal.inria.fr/hal-00869501/PDF/tcs270412.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00869501},
X-ID-HAL = {hal-00869501},
}
-
J-C. Bermond,
L. Gargano,
S. Pérennes,
A. A. Rescigno,
and U. Vaccaro.
Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas.
Journal of Theoretical Computer Science (TCS),
509:122-139,
October 2013.
[WWW
] [PDF
]
@article{bermond:hal-00905187,
AUTHOR = {Bermond, J-C. and Gargano, L. and Pérennes, S. and Rescigno, A. A. and Vaccaro, U.},
TITLE = {Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas},
JOURNAL = {Journal of Theoretical Computer Science (TCS)},
PUBLISHER = {Elsevier},
VOLUME = {509},
PAGES = {122-139},
YEAR = {2013},
MONTH = Oct,
DOI = {10.1016/j.tcs.2013.03.017},
PDF={http://hal.inria.fr/hal-00905187/PDF/journal-revised-II-15-1-13.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00905187},
X-ID-HAL = {hal-00905187},
}
-
J-C. Bermond,
R. Klasing,
N. Morales,
S. Pérennes,
and P. Reyes.
Gathering radio messages in the path.
Discrete Mathematics, Algorithms and Applications,
5(1):1-28,
March 2013.
[WWW
] [PDF
]
@article{bermond:hal-00907494,
AUTHOR = {Bermond, J-C. and Klasing, R. and Morales, N. and Pérennes, S. and Reyes, P.},
TITLE = {Gathering radio messages in the path},
JOURNAL = {Discrete Mathematics, Algorithms and Applications},
PUBLISHER = {World Scientific},
VOLUME = {5},
NUMBER = {1},
PAGES = {1-28},
YEAR = {2013},
MONTH = Mar,
DOI = {10.1142/S1793830913500043},
PDF={http://hal.inria.fr/hal-00907494/PDF/path301012.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00907494},
X-ID-HAL = {hal-00907494},
}
-
S. Bessy and F. Havet.
Enumerating the edge-colourings and total colourings of a regular graph.
Journal of Combinatorial Optimization,
25(4):523-535,
2013.
[WWW
]
@article{bessy:hal-00821598,
AUTHOR = {Bessy, S. and Havet, F.},
TITLE = {Enumerating the edge-colourings and total colourings of a regular graph},
JOURNAL = {Journal of Combinatorial Optimization},
PUBLISHER = {Springer},
VOLUME = {25},
NUMBER = {4},
PAGES = {523-535},
YEAR = {2013},
DOI = {10.1007/s10878-011-9448-5},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821598},
X-ID-HAL = {hal-00821598},
}
-
V. Campos,
F. Havet,
R. Sampaio,
and A. Silva.
Backbone colouring: Tree backbones with small diameter in planar graphs.
Theoretical Computer Science,
487:50-64,
2013.
[WWW
]
@article{campos:hal-00821608,
AUTHOR = {Campos, V. and Havet, F. and Sampaio, R. and Silva, A.},
TITLE = {Backbone colouring: Tree backbones with small diameter in planar graphs},
JOURNAL = {Theoretical Computer Science},
PUBLISHER = {Elsevier},
VOLUME = {487},
PAGES = {50-64},
YEAR = {2013},
URL2 = {http://www.sciencedirect.com/science/article/pii/S0304397513001941},
DOI = {10.1016/j.tcs.2013.03.003},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821608},
X-ID-HAL = {hal-00821608},
}
-
S. Caron,
F. Giroire,
D. Mazauric,
J. Monteiro,
and S. Pérennes.
P2P Storage Systems: Study of Different Placement Policies.
Peer-to-Peer Networking and Applications,
March 2013.
[WWW
] [PDF
]
@article{caron:hal-00880902,
AUTHOR = {Caron, S. and Giroire, F. and Mazauric, D. and Monteiro, J. and Pérennes, S.},
TITLE = {P2P Storage Systems: Study of Different Placement Policies},
JOURNAL = {Peer-to-Peer Networking and Applications},
PUBLISHER = {Springer},
YEAR = {2013},
MONTH = Mar,
DOI = {10.1007/s12083-013-0203-9},
PDF={http://hal.inria.fr/hal-00880902/PDF/placement-journal.pdf},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00880902},
X-ID-HAL = {hal-00880902},
}
-
S. Cicerone,
G. D'Angelo,
G. Di Stefano,
D. Frigioni,
and V. Maurizio.
Engineering a new algorithm for distributed shortest paths on dynamic networks.
Algorithmica,
66(1):51-86,
May 2013.
[WWW
] [PDF
]
| Abstract: |
|
We study the problem of dynamically updatingall-pairs shortest paths in a distributed network while edge update operations occur to the network. We consider the practical case of a dynamic network in which an edge update can occur while one or more other edge updates are under processing. A node of the network might be affected by a subset of these changes, thus being involved in the concurrent executions related to such changes. In this paper, we provide a new algorithm for this problem, and experimentally compare its performance with respect to those of the most popular solutions in the literature: the classical distributed Bellman-Ford method, which is still used in real network and implemented in the RIP protocol, and DUAL, the Diffuse Update ALgorithm, which is part of CISCO's widely used EIGRP protocol. As input to the algorithms, we used both real-world and artificial instances of the problem. The experiments performed show that the space occupancy per node required by the new algorithm is smaller than that required by both Bellman-Ford and DUAL. In terms of messages, the new algorithm outperforms both Bellman-Ford and DUAL on the real-world topologies, while on artificial instances, the new algorithm sends a number of messages that is more than that of DUAL and much smaller than that of Bellman-Ford. |
@article{CDD+12,
title = {{Engineering a new algorithm for distributed shortest paths on dynamic networks}},
author = {Cicerone, S. and D'Angelo, G. and Di Stefano, G. and Frigioni, D. and Maurizio, V.},
journal = {Algorithmica},
year = {2013},
volume = {66},
number = {1},
pages = {51-86},
month = may,
publisher = {Springer},
abstract = {{We study the problem of dynamically updatingall-pairs shortest paths in a distributed network while edge update operations occur to the network. We consider the practical case of a dynamic network in which an edge update can occur while one or more other edge updates are under processing. A node of the network might be affected by a subset of these changes, thus being involved in the concurrent executions related to such changes. In this paper, we provide a new algorithm for this problem, and experimentally compare its performance with respect to those of the most popular solutions in the literature: the classical distributed Bellman-Ford method, which is still used in real network and implemented in the RIP protocol, and DUAL, the Diffuse Update ALgorithm, which is part of CISCO's widely used EIGRP protocol. As input to the algorithms, we used both real-world and artificial instances of the problem. The experiments performed show that the space occupancy per node required by the new algorithm is smaller than that required by both Bellman-Ford and DUAL. In terms of messages, the new algorithm outperforms both Bellman-Ford and DUAL on the real-world topologies, while on artificial instances, the new algorithm sends a number of messages that is more than that of DUAL and much smaller than that of Bellman-Ford.}},
doi = {10.1007/s00453-012-9623-9},
url = {http://hal.inria.fr/hal-00728876},
pdf = {http://hal.inria.fr/hal-00728876/PDF/main.pdf},
OPTx-editorial-board={yes},
OPTx-proceedings={no},
OPTx-international-audience={yes},
x-pays = {IT},
sorte = "rev-int",
}
-
W. Fang,
X. Liang,
S. Li,
L. Chiaraviglio,
and N. Xiong.
VMPlanner: Optimizing Virtual Machine Placement and Traffic Flow Routing to Reduce Network Power Costs in Cloud Data Centers.
Computer Networks,
57(1):179-196,
January 2013.
[WWW
] [PDF
]
| Abstract: |
|
In recent years, the power costs of cloud data centers have become a practical concern and have attracted significant attention from both industry and academia. Most of the early works on data center energy efficiency have focused on the biggest power consumers (i.e., computer servers and cooling systems), yet without taking the networking part into consideration. However, recent studies have revealed that the network elements consume 10-20\0f the total power in the data center, which poses a great challenge to effectively reducing network power cost without adversely affecting overall network performance. Based on the analysis on topology characteristics and traffic patterns of data centers, this paper presents a novel approach, called VMPlanner, for network power reduction in the virtualization-based data centers. The basic idea of VMPlanner is to optimize both virtual machine placement and traffic flow routing so as to turn off as many unneeded network elements as possible for power saving. We formulate the optimization problem, analyze its hardness, and solve it by designing VMPlanner as a stepwise optimization approach with three approximation algorithms. VMPlanner is implemented and evaluated in a simulated environment with traffic traces collected from a data center test-bed, and the experiment results illustrate the efficacy and efficiency of this approach. |
@article{FLL+12,
author = {Fang, W. and Liang, X. and Li, S. and Chiaraviglio, L. and Xiong, N.},
title = {{VMPlanner: Optimizing Virtual Machine Placement and Traffic Flow Routing to Reduce Network Power Costs in Cloud Data Centers}},
abstract = {{In recent years, the power costs of cloud data centers have become a practical concern and have attracted significant attention from both industry and academia. Most of the early works on data center energy efficiency have focused on the biggest power consumers (i.e., computer servers and cooling systems), yet without taking the networking part into consideration. However, recent studies have revealed that the network elements consume 10-20\0f the total power in the data center, which poses a great challenge to effectively reducing network power cost without adversely affecting overall network performance. Based on the analysis on topology characteristics and traffic patterns of data centers, this paper presents a novel approach, called VMPlanner, for network power reduction in the virtualization-based data centers. The basic idea of VMPlanner is to optimize both virtual machine placement and traffic flow routing so as to turn off as many unneeded network elements as possible for power saving. We formulate the optimization problem, analyze its hardness, and solve it by designing VMPlanner as a stepwise optimization approach with three approximation algorithms. VMPlanner is implemented and evaluated in a simulated environment with traffic traces collected from a data center test-bed, and the experiment results illustrate the efficacy and efficiency of this approach.}},
publisher = {Elsevier},
journal = {Computer Networks},
year = {2013},
volume = {57},
number = {1},
pages = {179-196},
month = jan,
url = {http://dx.doi.org/10.1016/j.comnet.2012.09.008},
pdf={http://www.telematica.polito.it/oldsite/chiaraviglio/papers/VMPlanner.pdf},
x-pays={CN,IT},
OPTx-editorial-board={yes},
OPTx-proceedings={yes},
OPTx-international-audience={yes},
sorte = "inv-conf"
}
-
S. Guillemot,
F. Havet,
C. Paul,
and A. Perez.
On the (non-)existence of polynomial kernels for $P\_l$-free edge modification problems.
Algorithmica,
65(4):900-926,
2013.
[WWW
]
@article{guillemot:hal-00821612,
AUTHOR = {Guillemot, S. and Havet, F. and Paul, C. and Perez, A.},
TITLE = {On the (non-)existence of polynomial kernels for $P\_l$-free edge modification problems},
JOURNAL = {Algorithmica},
PUBLISHER = {Springer},
VOLUME = {65},
NUMBER = {4},
PAGES = {900-926},
YEAR = {2013},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821612},
X-ID-HAL = {hal-00821612},
}
-
F. Havet and L. Sampaio.
On the Grundy and b-chromatic numbers of a graph.
Algorithmica,
65(4):885-899,
2013.
[WWW
]
@article{havet:hal-00905927,
AUTHOR = {Havet, F. and Sampaio, L.},
TITLE = {On the Grundy and b-chromatic numbers of a graph},
JOURNAL = {Algorithmica},
PUBLISHER = {Springer Verlag (Germany)},
VOLUME = {65},
NUMBER = {4},
PAGES = {885-899},
YEAR = {2013},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00905927},
X-ID-HAL = {hal-00905927},
}
-
F. Havet and X. Zhu.
The game Grundy number of graphs.
Journal of Combinatorial Optimization,
25(4):752-765,
2013.
[WWW
]
@article{havet:hal-00821597,
AUTHOR = {Havet, F. and Zhu, X.},
TITLE = {The game Grundy number of graphs},
JOURNAL = {Journal of Combinatorial Optimization},
PUBLISHER = {Springer},
VOLUME = {25},
NUMBER = {4},
PAGES = {752-765},
YEAR = {2013},
DOI = {10.1007/s10878-012-9513-8},
X-INTERNATIONAL-AUDIENCE = {yes},
X-EDITORIAL-BOARD = {yes},
URL = {http://hal.inria.fr/hal-00821597},
X-ID-HAL = {hal-00821597},
}
-
A. Lancin and D. Papadimitriou.
DRMSim: A Routing-Model Simulator for Large-Scale Networks.
ERCIM News,
94:31-32,
July 2013.
[WWW
]
@article{lancin:hal-00924952,
AUTHOR = {Lancin, A. and Papadimitriou, D.},
TITLE = {DRMSim: A Routing-Model Simulator for Large-Scale Networks},
JOURNAL = {ERCIM News},
PUBLISHER = {ERCIM},
VOLUME = {94},
PAGES = {31-32},
YEAR = {2013},
MONTH = Jul,
URL2 = {http://ercim-news.ercim.eu/en94/ri/drmsim-a-routing-model-simulator-for-large-scale-networks},
X-INTERNATIONAL-AUDIENCE = {yes},
X-SCIENTIFIC-POPULARIZATION = {yes},
URL = {http://hal.inria.fr/hal-00924952},
X-ID-HAL = {hal-00924952},
}
-
D. Agarwal,
J. Araujo,
C. Caillouet,
F. Cazals,
D. Coudert,
and S. Perennes.
Connectivity Inference in Mass Spectrometry based Structure Determination.
In H.L. Bodlaender and G.F. Italiano, editors,
European Symposium on Algorithms,
volume 8125 of Lecture Notes in Computer Science - LNCS,
Sophia-Antipolis, France, France,
pages 289-300,
2013.
Springer.
[WWW
]
@inproceedings{agarwal:hal-00849873,
AUTHOR = {Agarwal, D. and Araujo, J. and Caillouet, C. and Cazals, F. and Coudert, D. and Perennes, S.},
TITLE = {Connectivity Inference in Mass Spectrometry based Structure Determination},
BOOKTITLE = {European Symposium on Algorithms},
YEAR = {2013},
SERIES = {Lecture Notes in Computer Science - LNCS},
URL2 = {http://link.springer.com/chapter/10.10070.000000978-3-642-40450-4\_25},
EDITOR = {Bodlaender, H.L. and Italiano, G.F.},
DOI = {10.1007/978-3-642-40450-4\_25},
PUBLISHER = {Springer},
VOLUME = {8125},
PAGES = {289-300},
ADDRESS = {Sophia-Antipolis, France, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00849873},
X-ID-HAL = {hal-00849873},
}
-
J. Araujo,
F. Giroire,
Y. Liu,
R. Modrzejewski,
and J. Moulierac.
Energy Efficient Content Distribution.
In IEEE International Conference on Communications (ICC),
Budapest, Hungary,
pages 4233-4238,
June 2013.
[WWW
] [PDF
]
@inproceedings{araujo:hal-00800273,
AUTHOR = {Araujo, J. and Giroire, F. and Liu, Y. and Modrzejewski, R. and Moulierac, J.},
TITLE = {Energy Efficient Content Distribution},
BOOKTITLE = {IEEE International Conference on Communications (ICC)},
YEAR = {2013},
MONTH = Jun,
DOI = {10.1109/ICC.2013.6655228},
PAGES = {4233-4238},
PDF={http://hal.inria.fr/hal-00800273/PDF/1569672533-6.pdf},
ADDRESS = {Budapest, Hungary},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00800273},
X-ID-HAL = {hal-00800273},
}
-
J. Araujo,
G. Morel,
L. Sampaio,
R. Soares,
and V. Weber.
Hull number: P5-free graphs and reduction rules.
In VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS),
Playa del Carmen, Mexico,
March 2013.
[WWW
] [PDF
]
@inproceedings{araujo:hal-00799868,
AUTHOR = {Araujo, J. and Morel, G. and Sampaio, L. and Soares, R. and Weber, V.},
TITLE = {Hull number: P5-free graphs and reduction rules},
BOOKTITLE = {VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)},
YEAR = {2013},
MONTH = Mar,
PDF={http://hal.inria.fr/hal-00799868/PDF/hull2-LAGOS-corrected-ENDM-newfiliation.pdf},
ADDRESS = {Playa del Carmen, Mexico},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00799868},
X-ID-HAL = {hal-00799868},
}
-
J-C. Bermond,
D. Coudert,
G. D'Angelo,
and F. Z. Moataz.
SRLG-Diverse Routing with the Star Property.
In Design of Reliable Communication Networks, DRCN,
Budapest, Hungary,
March 2013.
[WWW
] [PDF
]
@inproceedings{bermond:hal-00794638,
AUTHOR = {Bermond, J-C. and Coudert, D. and D'Angelo, G. and Moataz, F. Z.},
TITLE = {SRLG-Diverse Routing with the Star Property},
BOOKTITLE = {Design of Reliable Communication Networks, DRCN},
YEAR = {2013},
MONTH = Mar,
PDF={http://hal.inria.fr/hal-00794638/PDF/SRLG-Divrse\_Routing\_with\_the\_Star.pdf},
ADDRESS = {Budapest, Hungary},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00794638},
X-ID-HAL = {hal-00794638},
}
-
J-C. Bermond,
D. Coudert,
G. D'Angelo,
and F. Z. Moataz.
Diverse Routing with Star SRLGs.
In N. Nisse,
Franck Rousseau,
and Yann Busnel, editors,
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel),
Pornic, France,
pages 1-4,
May 2013.
[WWW
] [PDF
]
@inproceedings{bermond:hal-00817992,
AUTHOR = {Bermond, J-C. and Coudert, D. and D'Angelo, G. and Moataz, F. Z.},
TITLE = {Diverse Routing with Star SRLGs},
BOOKTITLE = {15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)},
YEAR = {2013},
MONTH = May,
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PAGES = {1-4},
PDF={http://hal.inria.fr/hal-00817992/PDF/DiverseRoutingStarSRLG.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00817992},
X-ID-HAL = {hal-00817992},
}
-
L. Blin,
J. Burman,
and N. Nisse.
Exclusive Graph Searching.
In 21st European Symposium on Algorithms (ESA 2013),
volume LNCS 8125 of Lecture Notes in Computer Science / ARCoSS,
Sophia Antipolis, France,
pages 181-192,
2013.
Springer.
[WWW
] [PDF
]
@inproceedings{blin:hal-00845530,
AUTHOR = {Blin, L. and Burman, J. and Nisse, N.},
TITLE = {Exclusive Graph Searching},
BOOKTITLE = {21st European Symposium on Algorithms (ESA 2013)},
YEAR = {2013},
SERIES = {Lecture Notes in Computer Science / ARCoSS},
PUBLISHER = {Springer},
VOLUME = {LNCS 8125},
PAGES = {181-192},
PDF={http://hal.inria.fr/hal-00845530/PDF/paper\_201.pdf},
ADDRESS = {Sophia Antipolis, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845530},
X-ID-HAL = {hal-00845530},
}
-
C. Caillouet,
D. Coudert,
and A. Kodjo.
Robust optimization in multi-operators microwave backhaul networks.
In 4th Global Information Infrastructure and Networking Symposium,
Trento, Italy,
pages 1-6,
2013.
IEEE.
[WWW
] [PDF
]
@inproceedings{caillouet:hal-00870931,
AUTHOR = {Caillouet, C. and Coudert, D. and Kodjo, A.},
TITLE = {Robust optimization in multi-operators microwave backhaul networks},
BOOKTITLE = {4th Global Information Infrastructure and Networking Symposium},
YEAR = {2013},
PUBLISHER = {IEEE},
PAGES = {1-6},
PDF={http://hal.inria.fr/hal-00870931/PDF/CCK13--GISS13.pdf},
ADDRESS = {Trento, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00870931},
X-ID-HAL = {hal-00870931},
}
-
C. Caillouet and A.M.C.A. Koster.
Robust Round Weighting with Traffic Uncertainty in Wireless Mesh Networks.
In 26th European Conference on Operational Research (EURO XXVI),
Rome, Italy,
July 2013.
[WWW
]
@inproceedings{caillouet:hal-00840148,
AUTHOR = {Caillouet, C. and Koster, A.M.C.A.},
TITLE = {Robust Round Weighting with Traffic Uncertainty in Wireless Mesh Networks},
YEAR = {2013},
MONTH = Jul,
BOOKTITLE = {26th European Conference on Operational Research (EURO XXVI)},
ADDRESS = {Rome, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {no},
URL = {http://hal.inria.fr/hal-00840148},
X-ID-HAL = {hal-00840148},
}
-
N. Cohen,
D. Coudert,
and A. Lancin.
Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe.
In N. Nisse,
Franck Rousseau,
and Yann Busnel, editors,
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel),
Pornic, France,
pages 1-4,
May 2013.
Note: Page 1-4.
[WWW
] [PDF
]
@inproceedings{cohen:hal-00818441,
AUTHOR = {Cohen, N. and Coudert, D. and Lancin, A.},
TITLE = {Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe},
BOOKTITLE = {15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)},
YEAR = {2013},
MONTH = May,
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PAGES = {1-4},
NOTE = {Page 1-4},
PDF={http://hal.inria.fr/hal-00818441/PDF/algotel2013-rev.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00818441},
X-ID-HAL = {hal-00818441},
}
-
D. Coudert,
A. Koster,
K. Phan,
and M. Tieves.
Robust Redundancy Elimination for Energy-aware Routing.
In The 2013 IEEE International Conference on Green Computing and Communications (GreenCom 2013),
Beijing, China,
August 2013.
IEEE.
[WWW
] [PDF
]
@inproceedings{coudert:hal-00862018,
AUTHOR = {Coudert, D. and Koster, A. and Phan, K. and Tieves, M.},
TITLE = {Robust Redundancy Elimination for Energy-aware Routing},
BOOKTITLE = {The 2013 IEEE International Conference on Green Computing and Communications (GreenCom 2013)},
YEAR = {2013},
MONTH = Aug,
PUBLISHER = {IEEE},
PDF={http://hal.inria.fr/hal-00862018/PDF/greencom-robust-woc.pdf},
ADDRESS = {Beijing, China},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00862018},
X-ID-HAL = {hal-00862018},
}
-
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.
In 15th Workshop on Advances in Parallel and Distributed Computational Models (IPDPS Workshop),
Boston, United States,
pages 667-676,
2013.
[WWW
] [PDF
]
@inproceedings{dangelo:hal-00845546,
AUTHOR = {D'Angelo, G. and Di Stefano, G. and Navarra, A. and Nisse, N. and Suchan, K.},
TITLE = {A unified approach for different tasks on rings in robot-based computing systems},
BOOKTITLE = {15th Workshop on Advances in Parallel and Distributed Computational Models (IPDPS Workshop)},
YEAR = {2013},
PAGES = {667-676},
PDF={http://hal.inria.fr/hal-00845546/PDF/apdcm2013.pdf},
ADDRESS = {Boston, United States},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845546},
X-ID-HAL = {hal-00845546},
}
-
F. Giroire,
S. Gupta Kumar,
R. Modrzejewski,
J. Monteiro,
and S. Perennes.
Repair Time in Distributed Storage Systems.
In 6th International Conference on Data Management in Cloud, Grid and P2P Systems (Globe 2013),
volume 8059,
Prague, Czech Republic,
pages 99-110,
August 2013.
Springer.
[WWW
] [PDF
]
@inproceedings{giroire:hal-00866058,
AUTHOR = {Giroire, F. and Gupta Kumar, S. and Modrzejewski, R. and Monteiro, J. and Perennes, S.},
TITLE = {Repair Time in Distributed Storage Systems},
BOOKTITLE = {6th International Conference on Data Management in Cloud, Grid and P2P Systems (Globe 2013)},
YEAR = {2013},
MONTH = Aug,
DOI = {10.1007/978-3-642-40053-7\_9},
PUBLISHER = {Springer},
VOLUME = {8059},
PAGES = {99-110},
PDF={http://hal.inria.fr/hal-00866058/PDF/globe-preprint.pdf},
ADDRESS = {Prague, Czech Republic},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00866058},
X-ID-HAL = {hal-00866058},
}
-
F. Giroire,
D. Mazauric,
N. Nisse,
S. Pérennes,
and R. Soares.
Connected Surveillance Game.
In 20th Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume LNCS 8179 of Lecture Notes in Computer Science (LNCS),
Ischia, Italy,
pages pages 68-79,
2013.
Springer.
[WWW
] [PDF
]
@inproceedings{giroire:hal-00845531,
AUTHOR = {Giroire, F. and Mazauric, D. and Nisse, N. and Pérennes, S. and Soares, R.},
TITLE = {Connected Surveillance Game},
BOOKTITLE = {20th Colloquium on Structural Information and Communication Complexity (SIROCCO)},
YEAR = {2013},
SERIES = {Lecture Notes in Computer Science (LNCS)},
PUBLISHER = {Springer},
VOLUME = {LNCS 8179},
PAGES = {pages 68-79},
PDF={http://hal.inria.fr/hal-00845531/PDF/ConnectedSurveillanceFinal.pdf},
ADDRESS = {Ischia, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845531},
X-ID-HAL = {hal-00845531},
}
-
F. Giroire,
R. Modrzejewski,
N. Nisse,
and S. Pérennes.
Maintaining Balanced Trees For Structured Distributed Streaming Systems.
In 20th Colloquium on Structural Information and Communication Complexity (SIROCCO),
volume LNCS 8179,
Ischia, Italy,
pages pages 177-188,
2013.
[WWW
] [PDF
]
@inproceedings{giroire:hal-00845536,
AUTHOR = {Giroire, F. and Modrzejewski, R. and Nisse, N. and Pérennes, S.},
TITLE = {Maintaining Balanced Trees For Structured Distributed Streaming Systems},
BOOKTITLE = {20th Colloquium on Structural Information and Communication Complexity (SIROCCO)},
YEAR = {2013},
DOI = {10.1007/978-3-319-03578-9\_15},
VOLUME = {LNCS 8179},
PAGES = {pages 177-188},
PDF={http://hal.inria.fr/hal-00845536/PDF/llncs.pdf},
ADDRESS = {Ischia, Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845536},
X-ID-HAL = {hal-00845536},
}
-
F. Giroire,
S. Pérennes,
and I. Tahiri.
On the Hardness of Equal Shortest Path Routing.
In International Network Optimization Conference,
volume 41 of Electronic Notes in Discrete Mathematics,
Tenerife, Spain,
pages 439-446,
2013.
Elsevier.
[WWW
] [PDF
]
@inproceedings{giroire:hal-00926348,
AUTHOR = {Giroire, F. and Pérennes, S. and Tahiri, I.},
TITLE = {On the Hardness of Equal Shortest Path Routing},
BOOKTITLE = {International Network Optimization Conference},
YEAR = {2013},
SERIES = {Electronic Notes in Discrete Mathematics},
DOI = {10.1016/j.endm.2013.05.123},
PUBLISHER = {Elsevier},
VOLUME = {41},
PAGES = {439-446},
PDF={http://hal.inria.fr/hal-00926348/PDF/ospfcomplexity\_inoc.pdf},
ADDRESS = {Tenerife, Spain},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00926348},
X-ID-HAL = {hal-00926348},
}
-
F. Giroire,
S. Pérennes,
and I. Tahiri.
Sur la complexité du routage OSPF.
In N. Nisse,
Franck Rousseau,
and Yann Busnel, editors,
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel),
Pornic, France,
pages 1-4,
2013.
[WWW
] [PDF
]
@inproceedings{giroire:hal-00817923,
AUTHOR = {Giroire, F. and Pérennes, S. and Tahiri, I.},
TITLE = {Sur la complexité du routage OSPF},
BOOKTITLE = {15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)},
YEAR = {2013},
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PAGES = {1-4},
PDF={http://hal.inria.fr/hal-00817923/PDF/algotel.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00817923},
X-ID-HAL = {hal-00817923},
}
-
A. Koster,
K. Phan,
and M. Tieves.
Extended Cutset Inequalities for the Network Power Consumption Problem.
In INOC - International Network Optimization Conference - 2013,
volume 41,
Tenerife, Spain,
pages 69-76,
May 2013.
Electronic Notes in Discrete Mathematics, Springer.
[WWW
] [PDF
]
@inproceedings{koster:hal-00862016,
AUTHOR = {Koster, A. and Phan, K. and Tieves, M.},
TITLE = {Extended Cutset Inequalities for the Network Power Consumption Problem},
BOOKTITLE = {INOC - International Network Optimization Conference - 2013},
YEAR = {2013},
MONTH = May,
PUBLISHER = {Electronic Notes in Discrete Mathematics, Springer},
VOLUME = {41},
PAGES = {69-76},
PDF={http://hal.inria.fr/hal-00862016/PDF/ExtendedCutsetInequalitiesfortheNetworkPowerConsumptionProblem.pdf},
ADDRESS = {Tenerife, Spain},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00862016},
X-ID-HAL = {hal-00862016},
}
-
E. Le Rouzic,
E. Bonetto,
L. Chiaraviglio,
F. Giroire,
F. Idzikowski,
F. Jimenez,
C. Lange,
J. Montalvo,
F. Musumeci,
I. Tahiri,
A. Valenti,
W. Van Heddeghem,
Y. Ye,
A. Bianco,
and A. Pattavina.
TREND towards more energy-efficient optical networks.
In 17th International Conference on Optical Network Design and Modeling (ONDM),
Brest, France,
pages 211--216,
2013.
[WWW
] [PDF
]
@inproceedings{lerouzic:hal-00880944,
AUTHOR = {Le Rouzic, E. and Bonetto, E. and Chiaraviglio, L. and Giroire, F. and Idzikowski, F. and Jimenez, F. and Lange, C. and Montalvo, J. and Musumeci, F. and Tahiri, I. and Valenti, A. and Van Heddeghem, W. and Ye, Y. and Bianco, A. and Pattavina, A.},
TITLE = {TREND towards more energy-efficient optical networks},
BOOKTITLE = {17th International Conference on Optical Network Design and Modeling (ONDM)},
YEAR = {2013},
PAGES = {211--216},
PDF={http://hal.inria.fr/hal-00880944/PDF/ONDM\_TREND\_joint\_paper\_v9\_22\_02\_2013\_fin.pdf},
ADDRESS = {Brest, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00880944},
X-ID-HAL = {hal-00880944},
}
-
R. Modrzejewski,
L. Chiaraviglio,
I. Tahiri,
F. Giroire,
E. Le Rouzic,
E. Bonetto,
F. Masumeci,
R. Gonzalez,
and C. Guerro.
Energy Efficient Content Distribution in an ISP Network.
In IEEE Global Communications Conference,
Atlanta, United States,
December 2013.
[WWW
] [PDF
]
@inproceedings{modrzejewski:hal-00865378,
AUTHOR = {Modrzejewski, R. and Chiaraviglio, L. and Tahiri, I. and Giroire, F. and Le Rouzic, E. and Bonetto, E. and Masumeci, F. and Gonzalez, R. and Guerro, C.},
TITLE = {Energy Efficient Content Distribution in an ISP Network},
BOOKTITLE = {IEEE Global Communications Conference},
YEAR = {2013},
MONTH = Dec,
PDF={http://hal.inria.fr/hal-00865378/PDF/globecom-preprint.pdf},
ADDRESS = {Atlanta, United States},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00865378},
X-ID-HAL = {hal-00865378},
}
-
N. Nisse.
Fractional Combinatorial Two-Player Games.
In 26th European Conference on Operational Research (EURO XXVI),
Italy,
2013.
[WWW
]
@inproceedings{nisse:hal-00845550,
AUTHOR = {Nisse, N.},
TITLE = {Fractional Combinatorial Two-Player Games},
YEAR = {2013},
BOOKTITLE = {26th European Conference on Operational Research (EURO XXVI)},
ADDRESS = {Italy},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {no},
URL = {http://hal.inria.fr/hal-00845550},
X-ID-HAL = {hal-00845550},
}
-
N. Nisse and R. Soares.
On the Monotonicity of Process Number.
In 7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS),
volume 44,
Mexico, Mexico,
pages 141-147,
2013.
Elsevier.
[WWW
] [PDF
]
@inproceedings{nisse:hal-00845539,
AUTHOR = {Nisse, N. and Soares, R.},
TITLE = {On the Monotonicity of Process Number},
BOOKTITLE = {7th Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS)},
YEAR = {2013},
PUBLISHER = {Elsevier},
VOLUME = {44},
PAGES = {141-147},
PDF={http://hal.inria.fr/hal-00845539/PDF/MonotoneDecomposition-LAGOS13.pdf},
ADDRESS = {Mexico, Mexico},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00845539},
X-ID-HAL = {hal-00845539},
}
-
R. Pardo Soares.
Fractional Combinatorial Games on Graphs.
In N. Nisse,
Franck Rousseau,
and Yann Busnel, editors,
15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel),
Pornic, France,
2013.
[WWW
] [PDF
]
@inproceedings{pardosoares:hal-00813229,
AUTHOR = {Pardo Soares, R.},
TITLE = {Fractional Combinatorial Games on Graphs},
BOOKTITLE = {15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel)},
YEAR = {2013},
EDITOR = {Nisse, N. and Rousseau, Franck and Busnel, Yann},
PDF={http://hal.inria.fr/hal-00813229/PDF/FractionalGamesSurveillance-Submited.pdf},
ADDRESS = {Pornic, France},
X-INTERNATIONAL-AUDIENCE = {yes},
X-PROCEEDINGS = {yes},
URL = {http://hal.inria.fr/hal-00813229},
X-ID-HAL = {hal-00813229},
}
-
D. Agarwal,
J. Araujo,
C. Caillouet,
F. Cazals,
D. Coudert,
and S. Pérennes.
Connectivity Inference in Mass Spectrometry based Structure Determination.
Research Report RR-8320,
INRIA,
June 2013.
[WWW
] [PDF
]
@techreport{agarwal:hal-00837496,
AUTHOR = {Agarwal, D. and Araujo, J. and Caillouet, C. and Cazals, F. and Coudert, D. and Pérennes, S.},
TITLE = {Connectivity Inference in Mass Spectrometry based Structure Determination},
TYPE = {Research Report},
PAGES = {23},
YEAR = {2013},
MONTH = Jun,
INSTITUTION = {INRIA},
NUMBER = {RR-8320},
PDF={http://hal.inria.fr/hal-00837496/PDF/RR-8320-MCI.pdf},
URL = {http://hal.inria.fr/hal-00837496},
X-ID-HAL = {hal-00837496},
}
-
O. Amini,
D. Coudert,
and N. Nisse.
Some Results on Non-deterministic Graph Searching in Trees.
Research Report,
2013.
[WWW
] [PDF
]
@techreport{amini:inria-00174965,
AUTHOR = {Amini, O. and Coudert, D. and Nisse, N.},
TITLE = {Some Results on Non-deterministic Graph Searching in Trees},
TYPE = {Research Report},
PAGES = {27},
YEAR = {2013},
PDF={http://hal.inria.fr/inria-00174965/PDF/ACN--hal.pdf},
URL = {http://hal.inria.fr/inria-00174965},
X-ID-HAL = {inria-00174965},
}
-
J. Araujo,
F. Giroire,
Y. Liu,
R. Modrzejewski,
and J. Moulierac.
Energy Efficient Content Distribution.
Research Report RR-8091,
INRIA,
May 2013.
[WWW
] [PDF
]
@techreport{araujo:hal-00743248,
AUTHOR = {Araujo, J. and Giroire, F. and Liu, Y. and Modrzejewski, R. and Moulierac, J.},
TITLE = {Energy Efficient Content Distribution},
TYPE = {Research Report},
PAGES = {27},
YEAR = {2013},
MONTH = May,
INSTITUTION = {INRIA},
NUMBER = {RR-8091},
PDF={http://hal.inria.fr/hal-00743248/PDF/report.pdf},
URL = {http://hal.inria.fr/hal-00743248},
X-ID-HAL = {hal-00743248},
}
-
J. Araujo,
N. Nisse,
and S. Pérennes.
Weighted Coloring in Trees.
Research Report RR-8249,
INRIA,
2013.
[WWW
] [PDF
]
@techreport{araujo:hal-00794622,
AUTHOR = {Araujo, J. and Nisse, N. and Pérennes, S.},
TITLE = {Weighted Coloring in Trees},
TYPE = {Research Report},
YEAR = {2013},
INSTITUTION = {INRIA},
NUMBER = {RR-8249},
PDF={http://hal.inria.fr/hal-00794622/PDF/RR-8249.pdf},
URL = {http://hal.inria.fr/hal-00794622},
X-ID-HAL = {hal-00794622},
}
-
J-C. Bermond,
B. Li,
N. Nisse,
H. Rivano,
and M-L. Yu.
Data Gathering and Personalized Broadcasting in Radio Grids with Interferences.
Research Report RR-8218,
INRIA,
2013.
[WWW
] [PDF
]
@techreport{bermond:hal-00783198,
AUTHOR = {Bermond, J-C. and Li, B. and Nisse, N. and Rivano, H. and Yu, M-L.},
TITLE = {Data Gathering and Personalized Broadcasting in Radio Grids with Interferences},
TYPE = {Research Report},
YEAR = {2013},
INSTITUTION = {INRIA},
NUMBER = {RR-8218},
PDF={http://hal.inria.fr/hal-00783198/PDF/RR-8218.pdf},
URL = {http://hal.inria.fr/hal-00783198},
X-ID-HAL = {hal-00783198},
}
-
P. Bertomé,
T. Bouvier,
F. Mazoit,
N. Nisse,
and R. Pardo Soares.
An Unified FPT Algorithm for Width of Partition Functions.
Research Report RR-8372,
INRIA,
September 2013.
[WWW
] [PDF
]
@techreport{bertome:hal-00865575,
AUTHOR = {Bertomé, P. and Bouvier, T. and Mazoit, F. and Nisse, N. and Pardo Soares, R.},
TITLE = {An Unified FPT Algorithm for Width of Partition Functions},
TYPE = {Research Report},
YEAR = {2013},
MONTH = Sep,
INSTITUTION = {INRIA},
NUMBER = {RR-8372},
PDF={http://hal.inria.fr/hal-00865575/PDF/RR-8372.pdf},
URL = {http://hal.inria.fr/hal-00865575},
X-ID-HAL = {hal-00865575},
}
-
L. Blin,
J. Burman,
and N. Nisse.
Exclusive Graph Searching.
Report,
June 2013.
[WWW
] [PDF
]
@techreport{blin:hal-00837543,
AUTHOR = {Blin, L. and Burman, J. and Nisse, N.},
TITLE = {Exclusive Graph Searching},
TYPE = {Report},
YEAR = {2013},
MONTH = Jun,
PDF={http://hal.inria.fr/hal-00837543/PDF/ESA13.pdf},
URL = {http://hal.inria.fr/hal-00837543},
X-ID-HAL = {hal-00837543},
}
-
D. Coudert,
Luc Hogie,
A. Lancin,
D. Papadimitriou,
S. Pérennes,
and I. Tahiri.
Feasibility study on distributed simulations of BGP.
Research Report RR-8283,
INRIA,
April 2013.
[WWW
] [PDF
]
@techreport{coudert:hal-00813481,
AUTHOR = {Coudert, D. and Hogie, Luc and Lancin, A. and Papadimitriou, D. and Pérennes, S. and Tahiri, I.},
TITLE = {Feasibility study on distributed simulations of BGP},
TYPE = {Research Report},
PAGES = {24},
YEAR = {2013},
MONTH = Apr,
INSTITUTION = {INRIA},
NUMBER = {RR-8283},
PDF={http://hal.inria.fr/hal-00813481/PDF/RR-8283.pdf},
URL = {http://hal.inria.fr/hal-00813481},
X-ID-HAL = {hal-00813481},
}
-
G. D'Angelo,
A. Navarra,
and N. Nisse.
Robot Searching and Gathering on Rings under Minimal Assumptions.
Research Report RR-8250,
INRIA,
2013.
[WWW
] [PDF
]
@techreport{dangelo:hal-00794921,
AUTHOR = {D'Angelo, G. and Navarra, A. and Nisse, N.},
TITLE = {Robot Searching and Gathering on Rings under Minimal Assumptions},
TYPE = {Research Report},
YEAR = {2013},
INSTITUTION = {INRIA},
NUMBER = {RR-8250},
PDF={http://hal.inria.fr/hal-00794921/PDF/RR-8250.pdf},
URL = {http://hal.inria.fr/hal-00794921},
X-ID-HAL = {hal-00794921},
}
-
F. Giroire,
D. Mazauric,
N. Nisse,
S. Pérennes,
and R. Pardo Soares.
Connected Surveillance Game.
Research Report RR-8297,
INRIA,
May 2013.
[WWW
] [PDF
]
@techreport{giroire:hal-00820271,
AUTHOR = {Giroire, F. and Mazauric, D. and Nisse, N. and Pérennes, S. and Pardo Soares, R.},
TITLE = {Connected Surveillance Game},
TYPE = {Research Report},
PAGES = {22},
YEAR = {2013},
MONTH = May,
INSTITUTION = {INRIA},
NUMBER = {RR-8297},
PDF={http://hal.inria.fr/hal-00820271/PDF/RR-8297.pdf},
URL = {http://hal.inria.fr/hal-00820271},
X-ID-HAL = {hal-00820271},
}
-
F. Giroire,
R. Modrzejewski,
N. Nisse,
and S. Pérennes.
Maintaining Balanced Trees For Structured Distributed Streaming Systems.
Research Report RR-8309,
INRIA,
May 2013.
[WWW
] [PDF
]
@techreport{giroire:hal-00824269,
AUTHOR = {Giroire, F. and Modrzejewski, R. and Nisse, N. and Pérennes, S.},
TITLE = {Maintaining Balanced Trees For Structured Distributed Streaming Systems},
TYPE = {Research Report},
YEAR = {2013},
MONTH = May,
INSTITUTION = {INRIA},
NUMBER = {RR-8309},
PDF={http://hal.inria.fr/hal-00824269/PDF/report.pdf},
URL = {http://hal.inria.fr/hal-00824269},
X-ID-HAL = {hal-00824269},
}
-
F. Giroire,
N. Nisse,
S. Pérennes,
and R. Pardo Soares.
Fractional Combinatorial Two-Player Games.
Research Report RR-8371,
INRIA,
September 2013.
[WWW
] [PDF
]
@techreport{giroire:hal-00865345,
AUTHOR = {Giroire, F. and Nisse, N. and Pérennes, S. and Pardo Soares, R.},
TITLE = {Fractional Combinatorial Two-Player Games},
TYPE = {Research Report},
YEAR = {2013},
MONTH = Sep,
INSTITUTION = {INRIA},
NUMBER = {RR-8371},
PDF={http://hal.inria.fr/hal-00865345/PDF/RR-8371.pdf},
URL = {http://hal.inria.fr/hal-00865345},
X-ID-HAL = {hal-00865345},
}
-
F. Havet and A. K. Maia.
On disjoint directed cycles with prescribed minimum lengths.
Research Report RR-8286,
INRIA,
April 2013.
[WWW
] [PDF
]
@techreport{havet:hal-00816135,
AUTHOR = {Havet, F. and Maia, A. K.},
TITLE = {On disjoint directed cycles with prescribed minimum lengths},
TYPE = {Research Report},
YEAR = {2013},
MONTH = Apr,
INSTITUTION = {INRIA},
NUMBER = {RR-8286},
PDF={http://hal.inria.fr/hal-00816135/PDF/RR-8286.pdf},
URL = {http://hal.inria.fr/hal-00816135},
X-ID-HAL = {hal-00816135},
}
