Team Gang

Members
Overall Objectives
Scientific Foundations
Application Domains
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

Bibliography

Publications of the year

Articles in International Peer-Reviewed Journal

[1]
D. Fortin, I. Tseveendorj.
A Trust Branching Path Heuristic for permutation Problems, in: International Journal of Pure and Applied Mathematics, 2009, vol. 56, no 3, p. 329-343.
[2]
D. Fortin, I. Tseveendorj.
A Trust Branching Path Heuristic for Zero-One Programming, in: European Journal of Operational Research, 2009, vol. 197, no 2, p. 439-445.
[3]
M. Kiwi, M. Soto, C. Thraves.
Adversarial queuing theory with setups, in: Theor. Comput. Sci., 2009, vol. 410, no 8-10, p. 670-687
http://dx.doi.org/10.1016/j.tcs.2008.09.064.

International Peer-Reviewed Conference/Proceedings

[4]
O. Bailleux, Y. Boufkhad, O. Roussel.
New Encodings of Pseudo-Boolean Constraints into CNF, in: Theory and Applications of Satisfiability Testing - SAT 2009, Royaume-Uni Swansea, 2009, p. 181-194
http://hal.archives-ouvertes.fr/hal-00415126/en/.
[5]
H. Baumann, P. Crescenzi, P. Fraigniaud.
Parsimonious Flooding in Dynamic Graphs, in: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC), 2009, p. 260-269.
[6]
H. Baumann, P. Fraigniaud.
Sub-linear Universal Spatial Gossip Protocols, in: Proc. 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS, Springer, 2009.
[7]
Y. Boufkhad, F. Mathieu, F. de Montgolfier, D. Perino, L. Viennot.
An Upload Bandwidth Threshold for Peer-to-Peer Video-on-Demand Scalability, in: 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2009, p. 1–10.
[8]
Y. Boufkhad, F. Mathieu, F. de Montgolfier, D. Perino, L. Viennot.
Fine Tuning of a Distributed VoD System, in: 18th IEEE International Conference on Computer Communications and Networks (ICCCN), 2009, p. 1–7.
[9]
B. Derbel, C. Gavoille, D. Peleg, L. Viennot.
Local Computation of Nearly Additive Spanners, in: DISC, Espagne Elche/Elx, Springer, 2009, vol. 5805, p. 176-190
http://hal.archives-ouvertes.fr/hal-00408725/en/.
[10]
Y. Emek, P. Fraigniaud, A. Korman, A. Rosen.
On the Additive Constant of the k -Server Work Function Algorithm, in: 7th Workshop on Approximation and Online Algorithms (WAOA), LNCS, Springer, 2009.
[11]
Y. Emek, P. Fraigniaud, A. Korman, A. Rosen.
Online Computation with Advice, in: Proc. 36th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 5555, 2009, p. 427-438.
[12]
P. Fraigniaud, G. Giakkoupis.
The Effect of Power-Law Degrees on the Navigability of Small Worlds, in: Proc. 28th ACM Symposium on Principles of Distributed Computing (PODC), 2009, p. 240-249.
[13]
P. Fraigniaud, A. Korman.
On Randomized Representations of Graphs Using Short Labels, in: Proc. 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2009, p. 131-137.
[14]
P. Fraigniaud, A. Korman.
Compact Ancestry Labeling Schemes for XML Trees, in: 21st ACM-SIAM Symposium on Discrete Algorithms (SODA), 2010, to appear.
[15]
P. Jacquet, L. Viennot.
Average Size of Unstretched Remote-Spanners, in: 5th ACM Workshop on Analytic Algorithmics and Combinatorics (ANALCO), 2009, p. 23–33.
[16]
P. Jacquet, L. Viennot.
Remote spanners: what to know beyond neighbors, in: 23rd IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2009, p. 1–10.
[17]
A. Korman.
Compact Routing Schemes for Dynamic Trees in the Fixed Port Model, in: 10th International Conference on Distributed Computing and Networking, (ICDCN), Lecture Notes in Computer Science, 2009, vol. 5408, p. 218-229.
[18]
A. Korman, S. Kutten.
A Note on Models for Graph Representations, in: Theoretical Computer Science(TCS), 2009, vol. 410, p. 1401-1412.
[19]
L. Muscariello, D. Perino.
Evaluating the performance of multi-path routing and congestion control in presence of network resource management, in: IEEE Conference on Ultra Modern Telecommunications (ICUMT), 2009.
[20]
L. Muscariello, D. Perino.
Modeling multi-path routing and congestion control under FIFO and Fair Queuing, in: IEEE Conference on Local Computer Network (LCN), 2009.
[21]
L. Muscariello, D. Perino, B. Nardelli.
Towards real implementations of dynamic robust routing paradigms exploiting path diversity, in: IEEE Conference on Ultra Modern Telecommunications (ICUMT), 2009.
[22]
L. Muscariello, D. Perino, D. Rossi.
Do Next Generation Networks need Path Diversity?, in: International Conference on Communications (ICC), 2009.

National Peer-Reviewed Conference/Proceedings

[23]
N. Hegde, F. Mathieu, D. Perino.
Diffusion epidemique de chunks en quasi-direct : la taille compte, in: Algotel, 2009.

Scientific Books (or Scientific Book chapters)

[24]
D. Fortin.
Hadamard's matrices, Grothendieck's constant and square Root Two, in: Optimal Control: Theory and Applications, Springer, 2009.
[25]
D. Fortin, I. Tseveendorj.
Escaping from a local solution region of convex maximization problem, in: Global Optimization : Theory, Methods & Applications I, lecture notes in decision sciences, Global-Link, september 2009, vol. 12(B), p. 943-948.

Internal Reports

[26]
N. Hegde, F. Mathieu, D. Perino.
Size does matter (in P2P live streaming), INRIA, 2009, RR-7032.
[27]
F. Mathieu, D. Perino.
On Resource Aware Algorithms in Epidemic Live Streaming, INRIA, 2009
http://hal.inria.fr/inria-00414706/en/, RR-7031.

Scientific Popularization

[28]
L. Viennot.
Idée reçue : Web et Internet, c'est la même chose, 2009
http://interstices.info/jcms/c_42755/web-et-internet-c-est-la-meme-chose, Interstices (French vulgarization site).

References in notes

[29]
I. Abraham, C. Gavoille, A. V. Goldberg, D. Malkhi.
Routing in Networks with Low Doubling Dimension, in: 26th International Conference on Distributed Computing Systems (ICDCS), IEEE Computer Society Press, July 2006.
[30]
L. Adamic, R. Lukose, A. Puniyani, B. Huberman.
Search in power-law networks, in: Physical Review E, 2001.
[31]
R. Albert, H. Jeong, A.-L. Barabasi.
Diameter of the World Wide Web, in: Nature, 1999, vol. 401, p. 130–131.
[32]
P. Assouad.
Plongements lipschitziens dans Rn, in: Bull. Soc. Math. France, 1983.
[33]
B.-M. Bui Xuan, M. Habib, V. Limouzy, F. de Montgolfier.
Unifying two graph decompositions with modular decomposition, in: The 18th International Symposium on Algorithms and Computation (ISAAC 2007), 2007.
[34]
B. Cohen.
Incentives Build Robustness in BitTorrent, in: Workshop on Economics of Peer-to-Peer Systems, 2003.
[35]
W. Cook, P. Seymour.
Tour Merging via Branch-Decomposition, in: INFORMS Journal on Computing, 2003.
[36]
B. Courcelle, J. Makowsky, U. Rotics.
Linear time solvable optimization problems on graphs of bounded clique-width, in: Theory Comput. Syst., 2000, vol. 33(2), p. 125–150.
[37]
J. Dai, O. Jennings.
Stabilizing Queueing Networks with Setups, in: Mathematics of Operation Research, 2004, vol. 29.
[38]
P. Duchon, N. Hanusse, E. Lebhar, N. Schabanel.
Could any graph be turned into a small-world?, in: DISC: International Symposium on Distributed Computing, 2006, vol. 355(1), p. 96-103.
[39]
A. Fabrikant, E. Koutsoupias, C. Papadimitriou.
Heuristically optimized trade-offs: A new paradigm for power laws in the Internet, in: ICALP, 2002.
[40]
P. Fraigniaud.
A new perspective on the small-world phenomenon: Greedy routing in tree-decomposed graphs, in: Proceedings of the 13th Annual European Symposium on Algorithms (ESA), 2005, p. 791–802.
[41]
P. Fraigniaud, E. Lebhar, Z. Lotker.
A Doubling Dimension Threshold $ \upper_theta$(loglogn) for Augmented Graph Navigability, in: Proceedings of14th Annual European Symposium (ESA), 2006, p. 376-386.
[42]
Anh-Tuan. Gai, L. Viennot.
Broose: A Practical Distributed Hashtable based on the De-Brujin Topology, in: The Fourth IEEE International Conference on Peer-to-Peer Computing, 2004.
[43]
Anh-Tuan. Gai, L. Viennot.
Incentive, Resilience and Load Balancing in Multicasting through Clustered de Bruijn Overlay Network (PrefixStream), in: 14th IEEE International Conference on Networks, September 2006.
[44]
D. Gamarnik.
Stability of adversarial queues via fluid model, in: Proc. of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, 1998, p. 60–70.
[45]
D. Karger, M. Ruhl.
Finding nearest neighbors in growth-restricted metrics, 2002.
[46]
J. Kleinberg.
The Small-World Phenomenon: An Algorithmic Perspective, in: Proceedings of the 32nd ACM Symposium on Theory of Computing (STOC), 2000, p. 163–170.
[47]
R. Krauthgamer, J. Lee.
Navigating nets: Simple algorithms for proximity search, 2004.
[48]
V. Limouzy, F. de Montgolfier, M. Rao.
NLC-2 graph recognition and isomorphism, in: WG'07, 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, 2007.
[49]
P. Maymounkov, D. Mazieres.
Kademlia: A peer-to-peer information system based on the xor metric, in: 1st International Workshop on Peer-to-Peer Systems (IPTPS), 2002.
[50]
S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker.
A scalable content-addressable network, in: Proc. ACM SIGCOMM'01, San Diego, CA, August 2001.
[51]
N. Roberston, P. Seymour.
Graph Minors X. Obstructions to tree-decomposition, in: J. Combinatorial Theory Ser. B, 1991, vol. 52(2), p. 153–190.
[52]
A. Rowstron, Y. Druschel.
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems, in: IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), LNCS 2218, 2001, p. 329–350.
[53]
A. Slivkins.
Distance Estimation and Object Location via Rings of Neighbors, in: Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), 2005, p. 41-50.
[54]
I. Stoica, R. Morris, D. Karger, M. Kaashoek, H. Balakrishnan.
Chord: A scalable peer-to-peer lookup service for internet applications, in: Proceedings of the 2001 conference on applications, technologies, architectures, and protocols for computer communications (SIGCOMM), ACM Press, 2001, p. 149–160.
[55]
D. Watts, S. Strogatz.
Collective dynamics of small-world networks, 1998.

previous
next