%------ 2007 --------------------------------------------------------- @INPROCEEDINGS{GL07b, AUTHOR = {Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Distributed Relationship Schemes for Trees}, BOOKTITLE = {$18^{th}$ Annual International Symposium on Algorithms and Computation (ISAAC)}, PUBLISHER = {Springer}, VOLUME = {4835 of Lecture Notes in Computer Science}, LOCATION = {Sendai, Japan}, PAGES = {728-738}, MONTH = dec, YEAR = 2007, KEYWORDS = {labeling scheme, tree}, DOI = {10.1007/978-3-540-77120-3_63} } @TECHREPORT{GKKKN07b, AUTHOR = {Gavoille, Cyril and Klasing, Ralf and Kosowski, Adrian and Kuszner, {\L}ukasz and Navarra, Alfredo}, TITLE = {On the Complexity of Distributed Graph Coloring with Local Minimality Constraints}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1440-07}, MONTH = dec, YEAR = 2007, KEYWORDS = {coloring, distributed, decomposition} } @TECHREPORT{GKKKN07, AUTHOR = {Gavoille, Cyril and Klasing, Ralf and Kosowski, Adrian and Kuszner, {\L}ukasz and Navarra, Alfredo}, TITLE = {On the Complexity of Distributed Graph Coloring with Local Minimality Constraints}, INSTITUTION= {INRIA}, TYPE = {{Research Report}}, NUMBER = {6399}, MONTH = dec, YEAR = 2007, KEYWORDS = {coloring, distributed, decomposition} } @INPROCEEDINGS{GL07c, AUTHOR = {Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Sch\'ema relationnel distribu\'e pour les arbres}, BOOKTITLE = {$9^{\mbox{\`emes}}$ Journ\'ees Graphes et Algorithmes}, LOCATION = {Insititut Henri Poincar\'e, Paris}, PAGES = 19, MONTH = nov, YEAR = 2007, KEYWORDS = {labeling scheme, tree} } @INPROCEEDINGS{GL07, AUTHOR = {Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs}, BOOKTITLE = {$15^{th}$ Annual European Symposium on Algorithms (ESA)}, PUBLISHER = {Springer}, EDITOR = {Lars Arge and Emo Welzl}, VOLUME = {4698 of Lecture Notes in Computer Science}, LOCATION = {Eilat, Israel}, PAGES = {582-593}, MONTH = oct, YEAR = 2007, KEYWORDS = {distance labeling, planar, tree-decomposition} } @INPROCEEDINGS{GKKN07, AUTHOR = {Gavoille, Cyril and Klasing, Ralf and Kosowski, Adrian and Navarra, Alfredo}, TITLE = {Brief Announcement: On the Complexity of Distributed Greedy Coloring}, BOOKTITLE = {$21^{st}$ International Symposium on Distributed Computing (DISC)}, PUBLISHER = {Springer}, VOLUME = {4731 of Lecture Notes in Computer Science}, PAGES = {482-484}, MONTH = sep, YEAR = 2007, KEYWORDS = {coloring, distributed} } @INPROCEEDINGS{DGP07, AUTHOR = {Derbel, Bilel and Gavoille, Cyril and Peleg, David}, TITLE = {Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time}, BOOKTITLE = {$21^{st}$ International Symposium on Distributed Computing (DISC)}, PUBLISHER = {Springer}, VOLUME = {4731 of Lecture Notes in Computer Science}, PAGES = {179-192}, MONTH = sep, YEAR = 2007, KEYWORDS = {spanner, distributed} } @ARTICLE{DDGY07, AUTHOR = {Dourisboure, Yon and Dragan, Feodor F. and Gavoille, Cyril and Yan, Chenyu}, TITLE = {Spanners for Bounded Tree-Length Graphs}, JOURNAL = {Theoretical Computer Science}, VOLUME = 383, NUMBER = 1, PAGES = {34-44}, MONTH = sep, YEAR = 2007, KEYWORDS = {spanner, tree-decomposition}, DOI = {10.1016/j.tcs.2007.03.058} } @INPROCEEDINGS{GL07a, AUTHOR = {Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Brief Annoucement: On Local Representation of Distances in Trees}, BOOKTITLE = {$26^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, LOCATION = {Portland, WA, USA}, PAGES = {246-247}, MONTH = aug, YEAR = 2007, KEYWORDS = {distance labeling}, DOI = {10.1145/1281100.1281169} } @INPROCEEDINGS{i:Gav07a, AUTHOR = {Gavoille, Cyril}, TITLE = {Localized Data Structures (Keynote Talk)}, BOOKTITLE = {$2^{nd}$ Workshop on Locality Preserving Distributed Computing Methods (LOCALITY)}, NOTE = {Co-located with PODC 2007}, LOCATION = {Portland, Oregon, USA}, MONTH = aug, YEAR = 2007, KEYWORDS = {labeling scheme, data-structure} } @INPROCEEDINGS{CGKT07, AUTHOR = {Courcelle, Bruno and Gavoille, Cyril and Kant\'e, Mustapha and Twigg, David Andrew}, TITLE = {Forbidden-Set Labeling on Graphs}, BOOKTITLE = {$2^{nd}$ Workshop on Locality Preserving Distributed Computing Methods (LOCALITY)}, NOTE = {Co-located with PODC 2007}, LOCATION = {Portland, Oregon, USA}, MONTH = aug, YEAR = 2007, KEYWORDS = {labeling scheme, planar, forbidden} } @INPROCEEDINGS{FGIP07, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Ilcinkas, David and Pelc, Andrzej}, TITLE = {Distributed Computing with Advice: Information Sensitivity of Graph Coloring}, BOOKTITLE = {$34^{th}$ International Colloquium on Automata, Languages and Programming (ICALP)}, PUBLISHER = {Springer}, VOLUME = {4596 of Lecture Notes in Computer Science}, PAGES = {231-242}, MONTH = jul, YEAR = 2007, KEYWORDS = {coloring, distributed}, DOI = {10.1007/978-3-540-73420-8_22} } @INPROCEEDINGS{FGKLL07, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Kosowski, Adrian and Lebhar, Emmanuelle and Lotker, Zvi}, TITLE = {Universal Augmentation Schemes for Network Navigability: Overcoming the $\sqrt{n}$-Barrier}, BOOKTITLE = {$19^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, LOCATION = {San Diego, CA, USA}, PAGES = {1-7}, MONTH = jun, YEAR = 2007, KEYWORDS = {small world, tree-decomposition} } @INPROCEEDINGS{AGMW07, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia and Wieder, Udi}, TITLE = {Strong-Diameter Decompositions of Minor Free Graphs}, BOOKTITLE = {$19^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, LOCATION = {San Diego, CA, USA}, PAGES = {16-24}, MONTH = jun, YEAR = 2007, KEYWORDS = {decomposition, planar, minor, compact routing} } @INPROCEEDINGS{FGKLL07a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Kosowski, Adrian and Lebhar, Emmanuelle and Lotker, Zvi}, TITLE = {A propos des sch\'emas d'augmentation universels pour la navigation dans les r\'eseaux}, BOOKTITLE = {$9^{\mbox{\`emes}}$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, PAGES = {23-26}, MONTH = may, YEAR = 2007, KEYWORDS = {small world, tree-decomposition} } @INPROCEEDINGS{DG07a, AUTHOR = {Dieng, Youssou and Gavoille, Cyril}, TITLE = {Routage dans les graphes cellulaires}, BOOKTITLE = {$9^{\mbox{\`emes}}$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, PAGES = {91-94}, MONTH = may, YEAR = 2007, KEYWORDS = {compact routing, outerplanar} } @INPROCEEDINGS{i:Gav07, AUTHOR = {Gavoille, Cyril}, TITLE = {An Overview on Compact Routing}, BOOKTITLE = {Workshop on Peer-to-Peer, Routing in Complex Graphs, and Network Coding}, LOCATION = {Thomson Labs - Paris}, MONTH = mar, YEAR = 2007, KEYWORDS = {compact routing} } @Article{BMR07, author = {Bazzaro, F. and Montassier, M. and Raspaud, A. }, title = {(d,1)-total labeling of planar graphs with large girth and high maximum degree.}, journal = {Discrete Mathematics}, year = {2007}, volume="307", pages="2141-2151" } @ARTICLE{GF07, AUTHOR = "G.~{Fertin} and A.~{Raspaud}", TITLE = {L(p,q) labeling of d-dimensional grids}, JOURNAL= {Discrete Mathematics}, YEAR = {2007}, VOLUME ={307}, NUMBER = {16}, PAGES= {2132-2140} } @Article{MRW07, author = {Montassier, M. and Raspaud, A. and Wang, W.}, title = {Acyclic 5-choosability of planar graphs without small cycles.}, journal = {Journal of Graph Theory}, year = {2007}, volume="54", pages="245-260" } @Article{CRW07, author = {Chen, M. and Raspaud, A. and Wang, W.}, title = {Three-coloring planar graphs without short cycles}, journal = {Information Processing Letters}, year = {2007}, volume="101", pages="134-138" } @ARTICLE{GP07, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Optimal distance labeling for interval graphs and related graphs families}, JOURNAL = {SIAM Journal on Discrete Mathematics}, NOTE = {To appear}, YEAR = 2007, KEYWORDS = {distance labeling, circular-arc, interval graph} } @ARTICLE{EGP07, AUTHOR = {Eilam, Tamar and Gavoille, Cyril and Peleg, David}, TITLE = {Average Stretch Analysis of Compact Routing Schemes}, JOURNAL = {Discrete Applied Mathematics}, VOLUME = 155, PAGES = {598-610}, MONTH = jan, YEAR = 2007, KEYWORDS = {compact routing, interval routing}, DOI = {10.1016/j.dam.2006.09.010} } @ARTICLE{DG07b, AUTHOR = {Derbel, Bilel and Gavoille, Cyril}, TITLE = {Fast Deterministic Distributed Algorithms for Sparse Spanners}, JOURNAL = {Theoretical Computer Science}, NOTE = {To appear}, YEAR = 2007, KEYWORDS = {spanner, distributed} } @ARTICLE{DG07, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Tree-Decompositions with Bags of Small Diameter}, JOURNAL = {Discrete Mathematics}, VOLUME = 307, NUMBER = 16, PAGES = {2008-2029}, YEAR = 2007, KEYWORDS = {spanner, tree-decomposition}, DOI = {10.1016/j.disc.2005.12.060} } @ARTICLE{BG07, AUTHOR = {Bazzaro, Fabrice and Gavoille, Cyril}, TITLE = {Localized and Compact Data-Structure for Comparability Graphs}, JOURNAL = {Discrete Mathematics}, YEAR = 2007, NOTE = {to appear}, KEYWORDS = {data-structure, permutation graph, labeling scheme}, DOI = {10.1016/j.disc.2007.12.091} } %------ 2006 --------------------------------------------------------- @PHDTHESIS{Ferchaud06, AUTHOR = {Ferchaud, Fr\'{e}d\'{e}ric}, TITLE = {\'Etude des zones d'absorption dans la gestion du flux du trafic aérien}, SCHOOL = {Universit{\'e} Bordeaux 1, Talence, France}, MONTH = dec, YEAR = 2006, KEYWORDS = {atfm} } @TECHREPORT{AGMW06, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia and Wieder, Udi}, TITLE = {Strongly-Bounded Sparse Decompositions of Minor Free Graphs}, INSTITUTION= {Microsoft Research}, ADDRESS = {Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com}, NUMBER = {MSR-TR-2006-192}, MONTH = dec, YEAR = 2006, KEYWORDS = {decomposition, compact routing, minor} } @INPROCEEDINGS{BGL06c, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Sch\'ema d'\'etiquetage d'adjacence pour les arbres de degr\'es born\'e}, BOOKTITLE = {$8^{\mbox{\`emes}}$ Journ\'ees Graphes et Algorithmes}, LOCATION = {Orl\'eans}, MONTH = nov, YEAR = 2006, KEYWORDS = {labeling scheme, universal graph} } @INPROCEEDINGS{i:Gav06a, AUTHOR = {Gavoille, Cyril}, TITLE = {An Overview on Compact Routing}, BOOKTITLE = {$2^{nd}$ Research Workshop on Flexible Network Design}, LOCATION = {University of Bologna Residential Center Bertinoro (Forl\`\i), Italy}, MONTH = oct, YEAR = 2006, KEYWORDS = {compact routing} } @INPROCEEDINGS{i:Gav06, AUTHOR = {Gavoille, Cyril}, TITLE = {Distributed Data Structures: A Survey on Informative Labeling Schemes (Invited Talk)}, BOOKTITLE = {$31^{st}$ International Symposium on Mathematical Foundations of Computer Science (MFCS)}, EDITOR = {R. Kr\'alovic and P. Urzyczyn}, PUBLISHER = {Springer}, VOLUME = {4162 of Lecture Notes in Computer Science}, LOCATION = {High Tatras, Slovakia}, PAGES = 38, MONTH = aug, YEAR = 2006, KEYWORDS = {labeling scheme, data-structure} } @ARTICLE{FG06, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Header-Size Lower Bounds for End-to-End Communication in Memoryless Networks}, JOURNAL = {Computer Networks}, VOLUME = 50, NUMBER = 10, PAGES = {1630-1638}, MONTH = jul, YEAR = 2006, KEYWORDS = {end-to-end} } @INPROCEEDINGS{DG06, AUTHOR = {Derbel, Bilel and Gavoille, Cyril}, TITLE = {Fast Deterministic Distributed Algorithms for Sparse Spanners}, BOOKTITLE = {$13^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, PUBLISHER = {Springer}, VOLUME = {4056 of Lecture Notes in Computer Science}, PAGES = {100-114}, MONTH = jul, YEAR = 2006, KEYWORDS = {spanner, distributed}, DOI = {10.1007/11780823_9} } @INPROCEEDINGS{BGL06b, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Adjacency labeling for bounded degree trees and applications}, BOOKTITLE = {$6^{th}$ Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications}, LOCATION = {Prague}, MONTH = jul, YEAR = 2006, NOTE = {Dedicated to Jarik Ne\v{s}et\v{r}il on the occasion of his 60th birthday}, KEYWORDS = {labeling scheme} } @INPROCEEDINGS{BGL06, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Short Labels by Traversal and Jumping}, BOOKTITLE = {$13^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, PUBLISHER = {Springer}, VOLUME = {4056 of Lecture Notes in Computer Science}, PAGES = {143-156}, MONTH = jul, YEAR = 2006, KEYWORDS = {tree, labeling scheme}, DOI = {10.1007/11780823_12} } @INPROCEEDINGS{AGM06b, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia}, TITLE = {On Space-Stretch Trade-Offs: Lower Bounds}, BOOKTITLE = {$18^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, LOCATION = {Cambridge, Massachusetts, USA}, PAGES = {217-224}, MONTH = jul, YEAR = 2006, KEYWORDS = {compact routing, name-independent}, DOI = {10.1145/1148109.1148143} } @INPROCEEDINGS{AGM06a, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia}, TITLE = {On Space-Stretch Trade-Offs: Upper Bounds}, BOOKTITLE = {$18^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, LOCATION = {Cambridge, Massachusetts, USA}, PAGES = {207-216}, MONTH = jul, YEAR = 2006, KEYWORDS = {compact routing, name-independent}, DOI = {10.1145/1148109.1148144} } @INPROCEEDINGS{AGGM06, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Goldberg, Andrew V. and Malkhi, Dahlia}, TITLE = {Routing in Networks with Low Doubling Dimension}, BOOKTITLE = {$26^{th}$ International Conference on Distributed Computing Systems (ICDCS)}, PUBLISHER = {IEEE Computer Society Press}, LOCATION = {Lisboa, Portugal}, MONTH = jul, YEAR = 2006, KEYWORDS = {compact routing, doubling dimension} } @INPROCEEDINGS{AG06, AUTHOR = {Abraham, Ittai and Gavoille, Cyril}, TITLE = {Object Location Using Path Separators}, BOOKTITLE = {$25^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, LOCATION = {Denver, Colorado, USA}, PAGES = {188-197}, MONTH = jul, YEAR = 2006, KEYWORDS = {minor, small world, compact routing, labeling scheme} } @techreport{d:EP06, Address = {351 Cours de la Lib{\'e}ration, 33405 Talence Cedex, France}, Author = {L. Esperet and A. Pinlou}, Institution = {LaBRI, Universit{\'e} Bordeaux 1}, Keywords = {improper choosability, acyclic choosability, outerplanar graphs}, Local-Url = {file://localhost/Users/alex/These/bibliographie/ep06.pdf}, Month = {may}, Number = {RR-1405-06}, Title = {Acyclic improper choosability of outerplanar graphs}, Type = {Research Report}, Year = {2006} } @ARTICLE{FGP06, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Paul, Christophe}, TITLE = {Eclecticism Shrinks Even Small Worlds}, JOURNAL = {Distributed Computing}, PUBLISHER = {Springer-Verlag}, VOLUME = 18, NUMBER = 4, PAGES = {279-291}, MONTH = mar, YEAR = 2006, DOI = {10.1007/s00446-005-0137-4}, KEYWORDS = {small world} } @TECHREPORT{BGL06a, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Short Labels by Traversal and Jumping}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1389-06}, MONTH = mar, YEAR = 2006, KEYWORDS = {tree, labeling scheme} } @TECHREPORT{AG06a, AUTHOR = {Abraham, Ittai and Gavoille, Cyril}, TITLE = {Object Location Using Path Separators}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1394-06}, MONTH = mar, YEAR = 2006, KEYWORDS = {minor, small world, compact routing, labeling scheme} } @techreport{d:OPS06, Address = {351 cours de la Lib\'eration, 33405 Talence Cedex, France}, Author = {P. Ochem and A. Pinlou and {\'E}. Sopena}, Institution = {LaBRI, Universit\'e Bordeaux 1}, Month = {feb}, Number = {RR-1390-06}, Title = {On the oriented chromatic index of oriented graphs}, Type = {Research report}, Url = {http://www.labri.fr/publications/combalgo/2006/OPS06/OPS0_.pdf}, Year = {2006} } @TECHREPORT{DG06a, AUTHOR = {Derbel, Bilel and Gavoille, Cyril}, TITLE = {Fast Deterministic Distributed Algorithms for Sparse Spanners}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1388-06}, MONTH = feb, YEAR = 2006, KEYWORDS = {spanner, distributed} } @Article{DNR06, author= "M.~{DeVos} and J.~{Ne\v set\v ril} and A.~{Raspaud}", title= {On edge-maps whose inverse preserves flows or tensions}, journal= {in Graph Theory in Paris (Proceedings of a Conference in Memory of Claude Berge), Trends in Mathematics, Birkh\"auser, Basel}, year={2006}, pages= "109-138" } @Article{GRS06, author= {Gon\c{c}alves, D. and Raspaud, A. and Shalu, {\mbox{M.A}}.}, title={On Oriented Labelling Parameters}, journal={Formal Models, Languages and Applications,World Scientific, Singapore}, year={2006}, volume="66", pages= "33-45" } @Article{MRW06c, author = {Montassier, M. and Raspaud, A. and Wang, W.}, title = {Acyclic 4-Choosability of Planar Graphs without Cycles of Specific lengths}, journal= {Algorithms and Combinatorics, Springer}, year = {2006}, volume="26", pages= "473-491" } @Article{EdiAR06, author = {{M\'ac\v ajov\'a} , E. and Raspaud, A.}, title = {On the Strong Circular 5-flow Conjecture}, journal = {J. of Graph Theory}, year = {2006}, volume= "52", pages= "307-316" } @Article{MR05, author = {Montassier, M. and Raspaud, A.}, title = {A note on 2-facial coloring of plane graphs}, journal = {Information Processing Letters}, year = {2006}, volume="98", pages="235-241" } @Article{MRW05c, author = {Montassier, M. and Raspaud, A. and Wang, W.}, title = {Bordeaux 3-color Conjecture and 3-choosability}, journal= {Discrete Mathematics}, year = {2006}, volume="306", pages= "573-579" } @Article{MOR04, author = {Montassier, M. and Ochem, P. and Raspaud, A.}, title = {On the acyclic choosability of graphs}, journal = {J. of Graph Theory}, year = {2006}, volume= "51", pages= "281-300" } @ARTICLE{a:MR06, author = "M.~{Montassier} and A.~{Raspaud}", title = "$(d,1)$-total labeling of graphs with a given maximum average degree", journal = {J. of Graph Theory}, year = "2006", volume= "51", pages= "93-109" } @article{A:pin06, Author = {A. Pinlou}, Journal = {Elect. J. Comb.}, Keywords = {oriented coloring, cubic graphs, oriented chromatic index, oriented graphs}, Number = {1}, Title = {On oriented arc-coloring of subcubic graphs}, Volume = {13}, Year = {2006} } @article{A:PS06b, Author = {A. Pinlou and {\'E}. Sopena}, Journal = {Discrete Math.}, Keywords = {acircuitic directed star arboricity, cubic graphs, star arboricity, arboricity}, Title = {The acircuitic directed star arboricity of subcubic graphs is at most four}, Volume = {306}, Issue = {24}, Year = {2006} } @article{A:PS06a, Author = {A. Pinlou and {\'E}. Sopena}, Journal = {Inform. Process. Lett.}, Keywords = {oriented chromatic number, oriented chromatic index, oriented coloring, girth, outerplanar graphs, oriented graphs}, Title = {Oriented vertex and arc colorings of outerplanar graphs}, Volume = {100}, Issue = {3}, Year = {2006} } @techreport{d:MOP06, Address = {351 cours de la Lib\'eration, 33405 Talence Cedex, France}, Author = {M. Montassier and P. Ochem and A. Pinlou}, Institution = {LaBRI, Universit\'e Bordeaux 1}, Month = {jan}, Number = {RR-1380-06}, Title = {Strong oriented chromatic number of planar graphs without short cycles}, Type = {Research report}, Url = {http://www.labri.fr/publications/combalgo/2006/MOP06/MOP0_.pdf}, Year = {2006} } @InProceedings{WP06, author = "A. Pecher and A. Wagler", title = "Extended clique family inequalities for claw-free graphs", booktitle = "10th Aussois Workshop on Combinatorial Optimization", month = "jan", year = "2006", url = "http://www.labri.fr/publications/combalgo/2006/WP06" } @Article{Pecher/Zhu:2003:2, author = {A. Pêcher and X. Zhu}, title = {On the Circular Chromatic Number of Circular Partitionable Graphs}, year = 2006, Journal = {J. of Graph Theory}, note = {accepted} } @Article{Pecher/Wagler:2004, author = {A. Pêcher and A. Wagler}, title = {Almost all webs are not rank-perfect}, Journal = {Math. prog.}, year = 2006, volume = 105, number = {2--3}, pages = {311--328} } @Article{Pecher/Wagler:2002:2b, author = {A. Pêcher and A. Wagler}, title = {A construction for non-rank facets of stable set polytopes of webs}, Journal = {European J. of Comb.}, year = 2006, note = {accepted} } @Article{Pecher/Wagler:2002b, author = {A. Pêcher and A. Wagler }, title = {On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four}, Journal = {Discrete Applied Math.}, year = 2006, volume = 154, number = 9, pages = {1408--1415} } @ARTICLE{BGHPS06, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas and Poulalhon, Dominique and Schaeffer, Gilles}, TITLE = {Planar Graphs, via Well-Orderly Maps and Trees}, JOURNAL = {Graphs and Combinatorics}, VOLUME = 22, NUMBER = 2, PAGES = {185-202}, YEAR = 2006, KEYWORDS = {coding, planar}, DOI = {10.1007/s00373-006-0647-2} } %------ 2005 --------------------------------------------------------- @INPROCEEDINGS{GL05, AUTHOR = {Gavoille, Cyril and Ly, Olivier}, TITLE = {Distance Labeling in Hyperbolic Graphs}, BOOKTITLE = {$16^{th}$ Annual International Symposium on Algorithms and Computation (ISAAC)}, PUBLISHER = {Springer}, VOLUME = {3827 of Lecture Notes in Computer Science}, LOCATION = {Sanya, Hainan, China}, PAGES = {1071-1079}, MONTH = dec, YEAR = 2005, DOI = {10.1007/11602613_106}, KEYWORDS = {distance labeling, hyperbolic} } @INPROCEEDINGS{BG05b, AUTHOR = {Bazzaro, Fabrice and Gavoille, Cyril}, TITLE = {Localized and Compact Data-Structure for Comparability Graphs}, BOOKTITLE = {$16^{th}$ Annual International Symposium on Algorithms and Computation (ISAAC)}, PUBLISHER = {Springer}, VOLUME = {3827 of Lecture Notes in Computer Science}, LOCATION = {Sanya, Hainan, China}, PAGES = {1122-1131}, MONTH = dec, YEAR = 2005, DOI = {10.1007/11602613_111}, KEYWORDS = {data-structure, permutation graph, labeling scheme} } @TECHREPORT{AGGM05, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Goldberg, Andrew V. and Malkhi, Dahlia}, TITLE = {Routing in Networks with Low Doubling Dimension}, INSTITUTION= {Microsoft Research}, ADDRESS = {Microsoft Corporation, One Microsoft Way, Redmond, WA 98052 - http://www.research.microsoft.com}, NUMBER = {MSR-TR-2005-175}, MONTH = dec, YEAR = 2005, KEYWORDS = {compact routing, doubling dimension} } @TECHREPORT{AGM05a, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia}, TITLE = {On Space-Stretch Trade-Offs for Compact Routing Schemes}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1374-05}, MONTH = nov, YEAR = 2005, KEYWORDS = {compact routing, name-independent} } @InProceedings{Coulonges/Pecher/Wagler:2005c, author = {S. Coulonges and A. Pêcher and A. Wagler}, title = {On stable set polytopes of circular-perfect graphs}, year = 2005, booktitle = {ALIO/EURO V conference on combinatorial optimization}, month = {October}, note = {talk by S. Coulonges} } @INPROCEEDINGS{BGL05, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Labourel, Arnaud}, TITLE = {Edge Partition of Toroidal Graphs into Forests in Linear Time}, BOOKTITLE = {$7^{th}$ International Conference on Graph Theory (ICGT)}, LOCATION = {Hy\`eres, France}, EDITOR = {Elsevier}, PUBLISHER = {Electronic Notes in Discrete Mathematics}, VOLUME = 22, MONTH = oct, PAGES = {421-425}, YEAR = 2005, KEYWORDS = {torus, decomposition}, DOI = {10.1016/j.endm.2005.06.065} } @INPROCEEDINGS{BG05a, AUTHOR = {Bazzaro, Fabrice and Gavoille, Cyril}, TITLE = {Distance Labeling for Permutation Graphs}, BOOKTITLE = {$7^{th}$ International Conference on Graph Theory (ICGT)}, LOCATION = {Hy\`eres, France}, EDITOR = {Elsevier}, PUBLISHER = {Electronic Notes in Discrete Mathematics}, VOLUME = 22, MONTH = oct, PAGES = {461-467}, YEAR = 2005, KEYWORDS = {permutation graph, labeling scheme}, DOI = {10.1016/j.endm.2005.06.098} } @InProceedings{Coulonges/Pecher/Wagler:2005b, author = {S. Coulonges and A. Pêcher and A. Wagler}, title = {On strongly circular-perfectness}, year = 2005, booktitle = {ICGT'05 - 7th International Colloquium on Graph Theory}, month = {September}, note = {talk by S. Coulonges}, pages = {369--374}, SERIES = {Electron. Notes Discrete Math.}, VOLUME = {22}, PUBLISHER = {Elsevier} } @InProceedings{EMR05, author = {Esperet, L. and Montassier, M. and Raspaud, A.}, title = {Linear choosability of graphs}, booktitle = {EuroComb'05, European conference on Combinatorics, Graph Theory and Applications}, year = {2005}, address = {Berlin, Germany}, month = {September 5-9} } @INPROCEEDINGS{AGM05, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia}, TITLE = {Compact Routing for Graphs Excluding a Fixed Minor}, BOOKTITLE = {$19^{th}$ International Symposium on Distributed Computing (DISC)}, PUBLISHER = {Springer}, VOLUME = {3724 of Lecture Notes in Computer Science}, PAGES = {442-456}, MONTH = sep, YEAR = 2005, DOI = {10.1007/11561927_32}, KEYWORDS = {compact routing, name-independent, minor} } @InProceedings{GM05, author = {Gonçalves, D. and Montassier, M.}, title = {Acyclic choosability of graphs with small maximum degree}, booktitle = {WG 2005, 31st International Workshop on Graph Theoretic Concepts in Computer Science}, year = {2005}, address = {Metz, France}, month = {June 23-25}, note = {D. Kratsch (Ed.): WG2005, LNCS 3787, pp.239-248, Springer-Verlag} } @INPROCEEDINGS{i:Gav05b, AUTHOR = {Gavoille, Cyril}, TITLE = {Distributed Data Structures: A Survey {I} \& {II}}, BOOKTITLE = {$8^{th}$ Seminar on Optimization and Decision Aid (SODA), France Télécom R\&{}D Division}, LOCATION = {Sophia-Antipolis, France}, MONTH = jun, YEAR = 2005, KEYWORDS = {labeling scheme, data-structure} } @InProceedings{Coulonges/Pecher/Wagler:2005, author = {S. Coulonges and A. Pêcher and A. Wagler}, title = {On the imperfection ratio of a-perfect graphs and some consequences}, year = 2005, booktitle = {CTW'05 - Cologne-Twente Workshop on Graphs and Combinatorial Optimization}, month = {May}, note = {LaBRI Research Report RR-1359-05} } @INPROCEEDINGS{i:Gav05, AUTHOR = {Gavoille, Cyril}, TITLE = {Distributed Data Structures: A Survey (Invited Talk)}, BOOKTITLE = {$12^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, PUBLISHER = {Springer}, VOLUME = {3499 of Lecture Notes in Computer Science}, LOCATION = {Mont St-Michel, France}, MONTH = may, PAGES = 2, YEAR = 2005, KEYWORDS = {labeling scheme, data-structure} } @INPROCEEDINGS{i:Gav05c, AUTHOR = {Gavoille, Cyril}, TITLE = {{\'E}tiquetage des graphes}, BOOKTITLE = {{\'E}cole Jeunes Chercheurs en Algorithmique et Calcul Formel - \'Ecole thématique CNRS 05 13 051}, LOCATION = {Montpellier}, MONTH = apr, YEAR = 2005, KEYWORDS = {labeling scheme} } @TECHREPORT{BG05, AUTHOR = {Bazzaro, Fabrice and Gavoille, Cyril}, TITLE = {Localized and Compact Data-Structure for Comparability Graphs}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1343-05}, MONTH = feb, YEAR = 2005, KEYWORDS = {data-structure, permutation graph, labeling scheme} } @ARTICLE{A:Douris05, AUTHOR = {Dourisboure, Yon}, TITLE = {Compact Routing Schemes for generalised chordal graphs}, JOURNAL = {Journal of Graph Algorithms and Applications}, YEAR = {2005}, NOTE = {to appear} } @ARTICLE{A:DG05, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Tree-decompositions with bags of small diameter}, JOURNAL = {Discrete Math}, YEAR = {2005}, NOTE = {to appear} } @TechReport{dhmp05, author = {Delmas, Olivier and Havet, Frédéric and Montassier, Mickaël and Pérennes, Stéphane}, title = {Design of fault tolerant on-board networks}, institution = {Laboratoire bordelais de recherche en informatique (LaBRI), Unité Mixte de Recherche CNRS (UMR 5800)}, year = {2005}, type = {Research report}, number = {RR 1345-05}, OPTaddress = {Université Bordeaux 1, France} } @ARTICLE{a:HS05a, author = "M. {Hosseini Dolama} and E. {Sopena}", title = "On the oriented chromatic number of Halin graphs", journal= "Inform. Proc. Letters", year = "2005", note = "to appear" } @inproceedings{DMTCS-AE0175, author = {G.~Fertin and A.~Raspaud}, title = {Acyclic Coloring of Graphs of Maximum Degree {${\Delta }$}}, keywords = {Acyclic chromatic number, acyclic coloring algorithm, maximum degree}, editor = {Stefan Felsner}, booktitle = {2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)}, series = {DMTCS Proceedings}, publisher = {Discrete Mathematics and Theoretical Computer Science}, year = 2005, volume = {AE}, pages = {389-396}, url = {http://www.dmtcs.org/proceedings/html/dmAE0175.abs.html} } @InProceedings{Loui05, author = {L. Esperet and M.Montassier and A. Raspaud}, title = {Linear choosability of graphs}, editor = {Stefan Felsner}, booktitle = {2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)}, series = {DMTCS Proceedings}, publisher = {Discrete Mathematics and Theoretical Computer Science}, year = 2005, volume = {AE}, pages = {99-104}, url = {http://www.dmtcs.org/proceedings/html/dmAE0120.abs.html} } @InProceedings{Abelian05, AUTHOR = { {M\'a\v cajov\'a}, E. and Raspaud, A. and {\v Skoviera}, M.}, TITLE = {Abelian Colourings of Cubic Graphs}, BOOKTITLE = {7th International Colloquium on Graph Theory (ICGT'05)}, SERIES = {Electronic Notes on Discrete Mathematics}, VOLUME = {22}, PAGES = {333-339 }, YEAR = {2005}, PUBLISHER = {Elsevier} } @ARTICLE{a:BGRS05, author = "O.V.~{Borodin} and A.N.~{Glebov} and A.~{Raspaud} and M.R.~{Salavatipour}", title = "Planar graphs without cycles of length from 4 to 7 are 3-colorable", journal = {J. Combin. Theory Ser. B.}, year = "2005", volume= "93", pages= "303-311" } @PhdThesis{t:Bazzaro05, author = {Bazzaro, Fabrice}, title = {Etiquetage de graphes : codage et coloration}, school = {LaBRI (Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux 1)}, year = {2005} } @Article{A:BMR03, author = {Bazzaro, F. and Montassier, M. and Raspaud, A.}, title = {$(d,1)$-total labelling of planar graphs with large girth and high maximum degree}, journal = {Discrete Math.}, year = {2005}, note = {To appear} } @TechReport{d:BG05, author = {Bazzaro, F. and Gavoille, C.}, title = {Localized and compact data-structure for comparability graphs}, institution = {{LaBRI}}, year = {2005}, number = {RR-1343-05} } @Unpublished{2005/03/21, author = {S. Coulonges and A. Pêcher and A.K. Wagler}, title = {On the imperfection ratio of a-perfect webs}, note = {8th Combinatorial Optimization Workshop, Aussois - talk by A.K. Wagler}, year = 2005 } @Unpublished{2005/06/03, author = {S. Coulonges and A. Pêcher and A.K. Wagler}, title = {Graphes fortement circulaires-parfaits sans triangles}, note = {JPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinato ire, Marseille}, pages = {56--59}, year = 2005 } @Unpublished{2005/06/02, author = {S. Coulonges and A. Pêcher and A.K. Wagler}, title = {Polytope des stables des graphes fortement circulaires-parfaits}, note = {JPOC2 - Deuxièmes Journées Polyèdres et Optimisation Combinatoire, Marseille - talk by S. Coulonges}, pages = {27--29}, year = 2005 } @Unpublished{2005/09/05, author = {S. Coulonges and A. PÃcª¿½her and A.K. Wagler}, title = {Triangle free strongly circular-perfect graphs}, note = {Eurocomb'05, poster}, year = 2005 } @InProceedings{Pecher/Wagler/Zhu:2005, author = {A. Pêcher and A. Wagler and X. Zhu}, title = {Three classes of minimal circular imperfect graphs}, pages = {9--15}, BOOKTITLE = {Proceedings of GRACO2005}, SERIES = {Electron. Notes Discrete Math.}, VOLUME = {19}, PUBLISHER = {Elsevier}, ADDRESS = {Rio de Janeiro, Brazil}, YEAR = {2005} } @TechReport{MRW05c, author = {Montassier, M. and Raspaud, A. and Wang, W.}, title = {Bordeaux 3-color Conjecture and 3-choosability}, institution = {{LaBRI}}, year = {2005}, number = {RR-1367-05} } @TechReport{MRW05b, author = {Montassier, M. and Raspaud, A. and Wang, W.}, title = {Acyclic 5-choosability of planar graphs without small cycles}, institution = {{LaBRI}}, year = {2005}, number = {RR-1366-05} } @TechReport{MRW05, author = {Montassier, M. and Raspaud, A. and Wang, W.}, title = {Acyclic 4-choosability of planar graphs without cycles of specific lengths}, institution = {{LaBRI}}, year = {2005}, number = {RR-1365-05} } @TechReport{Mon05x, author = {Montassier, M.}, title = {A smaller not 3-choosable planar graph without 4- and 5-cycles}, institution = {{LaBRI}}, year = {2005}, number = {RR-1361-05} } @TechReport{GM05x, author = {Gonçalves, D. and Montassier, M.}, title = {Acyclic choosability of graphs with small maximum degree}, institution = {{LaBRI}}, year = {2005}, number = {RR-1348-05} } @TechReport{DHMP05, author = {Delmas, O. and Havet, F. and Montassier, M. and P\'erennes, S. }, title = {Design of fault tolerant on-board networks}, institution = {{LaBRI}}, year = {2005}, number = {RR-1345-05} } @TechReport{MR05x, author = {Montassier, M. and Raspaud, A.}, title = {A note on 2-facial coloring of plane graphs}, institution = {{LaBRI}}, year = {2005}, number = {RR-1341-05} } @Article{Mon05a, author = {Montassier, M.}, title = {A note on the not 3-choosability of some families of planar graphs}, journal = {Information Processing Letters}, year = {2005}, note = {To appear} } @Article{Mon04, author = {Montassier, M.}, title = {Acyclic 4-choosability of planar graphs with girth at least 5}, journal = {GT04 special volume in memory of Claude Berge}, year = {2005}, note = {To appear} } @Article{MOR04, author = {Montassier, M. and Ochem, P. and Raspaud, A.}, title = {On the acyclic choosability of graphs}, journal = {Journal of Graph Theory}, year = {2005}, note = {To appear} } @Article{MR03, author = {Montassier, M. and Raspaud, A.}, title = {$(d,1)$-total labelling of graphs with a given maximum average degree}, journal = {Journal of Graph Theory}, year = {2005}, note = {To appear} } @Article{MR05, author = {Montassier, M. and Raspaud, A.}, title = {A note on 2-facial coloring of plane graphs}, journal = {Information Processing Letters}, year = {2005}, note = {To appear} } @Article{BMR03, author = {Bazzaro, F. and Montassier, M. and Raspaud, A.}, title = {$(d,1)$-total labelling of planar graphs with large girth and high maximum degree}, journal = {Discrete Mathematics}, year = {2005}, note = {To appear} } @ARTICLE{GN05, AUTHOR = {Gavoille, Cyril and Neh\'ez, Martin}, TITLE = {Interval Routing in Reliability Networks}, JOURNAL = {Theoretical Computer Science}, YEAR = 2005, VOLUME = 333, NUMBER = 3, PAGES = {415-432}, KEYWORDS = {interval routing, percolation} } @ARTICLE{GH05, AUTHOR = {Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {On Compact Encoding of Pagenumber $k$ Graphs}, JOURNAL = {Discrete Mathematics \& Theoretical Computer Science}, NOTE = {To appear}, YEAR = 2005, KEYWORDS = {data-structure} } @ARTICLE{AFGW05, author = {Amar, D. and Flandrin, E. and Gancarzewicz, G. and Wojda, A.P.}, title = {Bipartite graphs with every matching in a cycle}, journal = {Discrete Math.}, note = {To appear}, year = {2005} } @ARTICLE{BGH05, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation}, JOURNAL = {Journal of Graph Algorithms and Applications}, VOLUME = 9, NUMBER = 2, PAGES = {185-204}, YEAR = 2005, KEYWORDS = {counting, coding, outerplanar} } @MISC{AFG05, author = {Amar, D. and Flandrin, E. and Gancarzewicz, G.}, title = {Cyclability in bipartite graphs}, note = {Submitted}, year = {2005} } @ARTICLE{ABO05, author = {Amar, D. and Brito, D. and Ordaz, O.}, title = {Hamiltonian cycles and hamiltonian biconnectedness in bipartite digraph}, journal = {Divulgacines Matematicas}, note = {To appear}, year = {2005} } %------ 2004 --------------------------------------------------------- @INPROCEEDINGS{FDGM04, AUTHOR = {Ferchaud, Fr\'{e}d\'{e}ric and Duong, Vu and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {Reducing Disturbances by Using Absorption Areas}, BOOKTITLE = {$1^{st}$ International Conference on Research in Air Transportation (ICRAT)}, LOCATION = {Zilina, Slovac Republik}, ISBN = {80-8070-196-2}, PAGES = {111-115}, MONTH = nov, YEAR = 2004, KEYWORDS = {atfm} } @INPROCEEDINGS{FDGM04, AUTHOR = {Ferchaud, Fr\'{e}d\'{e}ric and Duong, Vu and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {Reducing Disturbances by Using Absorption Areas}, BOOKTITLE = {$1^{st}$ International Conference on Research in Air Transportation (ICRAT)}, LOCATION = {Zilina, Slovac Republik}, ISBN = {80-8070-196-2}, PAGES = {111-115}, MONTH = nov, YEAR = 2004, KEYWORDS = {atfm} } @INPROCEEDINGS{DFGM04a, AUTHOR = {Duong, Vu and Ferchaud, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {Using Absorption Areas to Improve {ATFM}}, BOOKTITLE = {$23^{rd}$ IEEE International Digital Avionics Systems Conference (DASC)}, LOCATION = {Salt Lake City, USA}, ISBN = {0-7803-8539-X}, MONTH = oct, YEAR = 2004, KEYWORDS = {atfm} } @INPROCEEDINGS{DFGM04, AUTHOR = {Duong, Vu and Ferchaud, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {A New Slot Allocation for {ATFM}}, BOOKTITLE = {$7^{th}$ IEEE International Conference on Intelligent Transportation Systems (ITSC)}, LOCATION = {Washington, D.C.}, ISBN = {0-7803-8501-2}, PAGES = {1075-1079}, MONTH = oct, YEAR = 2004, KEYWORDS = {atfm} } @INPROCEEDINGS{C:Douris04, AUTHOR = {Dourisboure, Yon}, TITLE = {Compact Routing Schemes for Tree-Length $\delta$ Graphs and for $k$-chordal graphs}, BOOKTITLE = {$18$-th International Symposium on DIStributed Computing (DISC~2004)}, PAGES = {365-378}, PUBLISHER = {Springer}, VOLUME = {3274 of Lecture Notes in Computer Science}, MONTH = Oct, YEAR = 2004 } @INPROCEEDINGS{c:BG04, AUTHOR = {Bazzaro, F. and Gavoille, C.}, TITLE = {Etiquetage de Distance des Graphes de Permutation}, BOOKTITLE = {$6^{\mbox{\`emes}}$ Journées Graphes et Algorithmes}, EDITOR = {E. Duch\`ene et S. Gravier}, PUBLISHER = {Les Cahiers du laboratoire Leibniz, No~114}, PAGES = {22-24}, MONTH = {oct}, YEAR = {2004} } @INPROCEEDINGS{DFGM04a, AUTHOR = {Duong, Vu and Ferchaud, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {Using Absorption Areas to Improve {ATFM}}, BOOKTITLE = {$23^{rd}$ IEEE International Digital Avionics Systems Conference (DASC)}, LOCATION = {Salt Lake City, USA}, ISBN = {0-7803-8539-X}, MONTH = oct, YEAR = 2004, KEYWORDS = {atfm} } @INPROCEEDINGS{DFGM04, AUTHOR = {Duong, Vu and Ferchaud, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {A New Slot Allocation for {ATFM}}, BOOKTITLE = {$7^{th}$ IEEE International Conference on Intelligent Transportation Systems (ITSC)}, LOCATION = {Washington, D.C.}, ISBN = {0-7803-8501-2}, PAGES = {1075-1079}, MONTH = oct, YEAR = 2004, KEYWORDS = {atfm} } @INPROCEEDINGS{BG04, AUTHOR = {Bazzaro, Fabrice and Gavoille, Cyril}, TITLE = {Etiquetage de Distance des Graphes de Permutation}, BOOKTITLE = {$6^{\mbox{\`emes}}$ Journées Graphes et Algorithmes}, LOCATION = {Grenoble}, EDITOR = {E. Duch\`ene et S. Gravier}, PUBLISHER = {Les Cahiers du laboratoire Leibniz, No~114}, PAGES = {22-24}, MONTH = oct, YEAR = 2004, KEYWORDS = {permutation graph, labeling scheme} } @INPROCEEDINGS{AGM04, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia}, TITLE = {Routing with Improved Communication-Space Trade-Off}, BOOKTITLE = {$18^{th}$ International Symposium on Distributed Computing (DISC)}, LOCATION = {Amsterdam, The Netherlands}, PUBLISHER = {Springer}, VOLUME = {3274 of Lecture Notes in Computer Science}, PAGES = {305-319}, MONTH = oct, YEAR = 2004, KEYWORDS = {compact routing, name-independent} } @Unpublished{2004/09/08, author = {A. Pêcher and A. Wagler}, title = {Almost all webs are not rank-perfect}, note = {XXXV Annual Conference of the Operational Research Society of Italy - talk by A. Wagler}, month = {septembre}, year = 2004 } @TECHREPORT{BGHPS04a, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas and Poulalhon, Dominique and Schaeffer, Gilles}, TITLE = {Planar Graphs, via Well-Orderly Maps and Trees}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, MONTH = sep, YEAR = 2004, KEYWORDS = {coding, planar} } @InProceedings{MORGT04, author = {Montassier, M. and Ochem, P. and Raspaud, A.}, title = {On the acyclic choosability of graphs}, booktitle = {GTO4 Graph Theory 2004: a conference in memory of Claude Berge}, year = {2004}, address = {Paris}, month = {July} } @INPROCEEDINGS{FGP04, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Paul, Christophe}, TITLE = {Eclecticism Shrinks Even Small Worlds}, BOOKTITLE = {$23^{rd}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, LOCATION = {St. John's, Newfoundland, Canada}, PUBLISHER = {ACM Press}, PAGES = {169-178}, MONTH = jul, YEAR = 2004, KEYWORDS = {small world} } @INPROCEEDINGS{AGMNT04, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia and Nisan, Noam and Thorup, Mikkel}, TITLE = {Compact Name-Independent Routing with Minimum Stretch}, BOOKTITLE = {$16^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, PAGES = {20-24}, MONTH = jul, YEAR = 2004, KEYWORDS = {compact routing, name-independent} } @TECHREPORT{AGM04a, AUTHOR = {Abraham, Ittai and Gavoille, Cyril and Malkhi, Dahlia}, TITLE = {Routing with Improved Communication-Space Trade-Off}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1330-04}, MONTH = jul, YEAR = 2004, KEYWORDS = {compact routing, name-independent} } @INPROCEEDINGS{C:DG04, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Sparse Additive Spanners for Bounded Tree-Length Graphs}, BOOKTITLE = {$11^{th}$ Colloquium on Structural Information and Communication Complexity (SIROCCO)}, PUBLISHER = {Springer}, PAGES = {123-137}, MONTH = jun, VOLUME = {3104 of Lecture Notes in Computer Science}, YEAR = {2004} } @INPROCEEDINGS{FRS04, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O.}, TITLE = {No-Hole L(p,0)-Labelling of Cycles, Grids and Hypercubes}, BOOKTITLE = {$11^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Ratislav \mbox{Kralovi\v c} and Ondrej S\'ykora}, MONTH ={June}, YEAR ={2004}, PUBLISHER = {Springer-Verlag}, VOLUME = {3104 of Lecture Notes in Computer Science}, PAGES = {138-148} } @INPROCEEDINGS{DG04, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Sparse Additive Spanners for Bounded Tree-Length Graphs}, BOOKTITLE = {$11^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, PUBLISHER = {Springer}, VOLUME = {3104 of Lecture Notes in Computer Science}, PAGES = {123-137}, MONTH = jun, YEAR = 2004, ISBN = {3-540-22230-8}, DOI = {10.1007/b98251}, KEYWORDS = {spanner} } @INPROCEEDINGS{BGHPS04, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas and Poulalhon, Dominique and Schaeffer, Gilles}, TITLE = {Planar Graphs, via Well-Orderly Maps and Trees}, BOOKTITLE = {$30^{th}$ International Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, PUBLISHER = {Springer}, VOLUME = {3353 of Lecture Notes in Computer Science}, NOTE = {270-284}, MONTH = jun, YEAR = 2004, DOI = {10.1007/b104584}, KEYWORDS = {coding, planar} } @InProceedings{c:BM04, author = {Bazzaro, F. and Montassier, M.}, title = {Assignation de fréquences et étiquetage $(d,1)$-total dans les topologies planaires}, booktitle = {6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2004)}, pages = {27--31}, year = {2004}, address = {Batz-sur-mer, France}, month = {26--28 mai}, publisher = {Institut National de Recherche en Informatique et Automatique} } @InProceedings{BM04, author = {Bazzaro, F. and Montassier, M.}, title = {Assignation de fréquences et étiquetage $(d,1)$-total dans les topologies planaires}, booktitle = {6ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2004)}, pages = {27--31}, year = {2004}, address = {Batz-sur-mer, France}, month = {26--28 mai}, publisher = {Institut National de Recherche en Informatique et Automatique} } @INPROCEEDINGS{FGP04a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Paul, Christophe}, TITLE = {Eclectisme dans les petits mondes}, BOOKTITLE = {$6^{\mbox{\`emes}}$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, MONTH = may, YEAR = 2004, KEYWORDS = {small world} } @TECHREPORT{DG04b, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Small Diameter Bag Tree-Decompositions}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1326-04}, MONTH = may, YEAR = 2004, KEYWORDS = {spanner, tree-decomposition} } @TECHREPORT{DG04a, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Sparse Additive Spanners for Bounded Tree-Length Graphs}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1316-04}, MONTH = feb, YEAR = 2004, KEYWORDS = {spanner, tree-decomposition} } @Article{Lpq-Journal, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {${L}(p,q)$ labeling of $d$-Dimensional Grids}, JOURNAL = {Discrete Mathematics}, YEAR = {2004}, NOTE = {To appear} } @Article{synteny, AUTHOR = {Chauve, C. and Fertin, G.}, TITLE = {On Maximal Instances for the Original Syntenic Distance}, JOURNAL = {Theoretical Computer Science}, VOLUME = {326}, PAGES = {29-43}, YEAR = {2004} } @Article{starJournal, AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.}, TITLE = {On Star Coloring of Graphs}, JOURNAL = {Journal of Graph Theory}, VOLUME = {47(3)}, PAGES = {163-182}, YEAR = {2004} } @Article{SFSW_PRE, AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.}, TITLE = {Recursive graphs with small-world scale-free properties}, JOURNAL = {Physical Review E, Brief Notes}, VOLUME = {69-037104}, YEAR = {2004} } @TECHREPORT{CGMF04, AUTHOR = {Castanet, Richard and Gavoille, Cyril and Mosbah, Mohamed and Ferchaud, Fr\'ed\'eric}, TITLE = {Utilisation des zones d'absorption pour améliorer la gestion de flux du trafic aérien}, INSTITUTION= {LaBRI, Universit\'e Bordeaux~1 - ENSEIRB}, TYPE = {Rapport de contrat (intermédiaire)}, NUMBER = {march\'e C/1.291/CE/NB/03/}, MONTH = jan, YEAR = 2004, KEYWORDS = {contract} } @ARTICLE{a:HSZ04, author = "M. {Hosseini Dolama} and E. {Sopena} and X. {Zhu}", title = "Incidence coloring of k-degenerated graphs", journal= "Discrete Math.", year = "2004", volume ="283", pages="121-128" } @ARTICLE{a:FRR04, AUTHOR = { Fertin, G. and Raspaud, A. and Reed, B.}, TITLE = {Star Coloring of Graphs}, JOURNAL= {Journal of Graph Theory}, YEAR = {2004}, VOLUME = {47, No.3}, PAGES= {163-182} } @ARTICLE{a:CFR04, AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.}, TITLE = {Recursive graphs with small-word scale-free properties}, JOURNAL= {Physical Review E}, YEAR = {2004}, VOLUME = {69}, PAGES= {037104-1,037104-4} } @ARTICLE{a:DNR04, AUTHOR = "M.~{DeVos} and J.~{Ne\v set\v ril} and A.~{Raspaud}", TITLE = {Antisymmetric flows and edge-connectivity}, JOURNAL= {Discrete Mathematics}, YEAR = {2004}, VOLUME ={276}, PAGES= {161-167} } @ARTICLE{a:GF04, AUTHOR = "G.~{Fertin} and A.~{Raspaud}", TITLE = {A Survey of {K}n\"odel Graphs}, JOURNAL= {Discrete Applied Mathematics}, YEAR = {2004}, VOLUME ={137}, NUMBER = {2}, PAGES= {173-195} } @Unpublished{2004/10/01, author = {A. Pêcher and A.K. Wagler and X. Zhu}, title = {Quelques familles de graphes minimaux imparfaits circulaires}, note = {6èmes Journées Graphes et Algorithmes, Grenoble, Les Cahiers du laboratoire Leibniz}, number = 114, pages = {82--84}, year = 2004 } @article {Pecher:2000:3, AUTHOR = {P{\^e}cher, A.}, TITLE = {Cayley partitionable graphs and near-factorizations of finite groups}, NOTE = {6th International Conference on Graph Theory}, JOURNAL = {Discrete Math.}, FJOURNAL = {Discrete Mathematics}, VOLUME = {276}, YEAR = {2004}, NUMBER = {1-3}, PAGES = {295--311}, ISSN = {0012-365X}, CODEN = {DSMHA4}, MRCLASS = {05C25}, MRNUMBER = {2 046 643} } @inproceedings{DBLP:conf/mfcs/IlieOS04, author = {Lucian Ilie and Pascal Ochem and Jeffrey Shallit}, title = {A Generalization of Repetition Threshold}, booktitle = {MFCS}, year = {2004}, pages = {818-826}, bibsource = {DBLP, http://dblp.uni-trier.de} } @inproceedings{WaCAM, author = {Pascal Ochem}, title = {A generator of morphisms for infinite words}, booktitle = {Proceedings of the Workshop on Words avoidability, complexity and morphisms - Edited by G. Richomme}, year = {2004} } @article{DBLP:journals/ipl/Ochem04, author = {Pascal Ochem}, title = {Oriented colorings of triangle-free planar graphs}, journal = {Inf. Process. Lett.}, volume = {92}, number = {2}, year = {2004}, pages = {71-76}, bibsource = {DBLP, http://dblp.uni-trier.de} } @Article{BOP04, author = {J\'ozsef Balogh and Pascal Ochem and Andr\'as Pluh\'ar}, title = {On the interval number of special graphs}, journal = {J. Graph Theory.}, volume = {46 (4)}, year = {2004}, pages = {241-253} } @TechReport{MS04, author = {Montassier, M. and Serra, O.}, title = {Acyclic choosability and probabilistic methods}, year = {2004}, note = {Manuscript} } @TechReport{MOR04x, author = {Montassier, M. and Ochem, P. and Raspaud, A.}, title = {On the acyclic choosability of graphs}, institution = {{LaBRI}}, year = {2004}, number = {RR-1335-04} } @TechReport{Mon04x, author = {Montassier, M.}, title = {On acyclic choosability of planar graphs with large girth}, institution = {{LaBRI}}, year = {2004}, number = {RR-1336-04} } @ARTICLE{GPPR04, AUTHOR = {Gavoille, Cyril and Peleg, David and P\'{e}renn\`{e}s, St\'{e}phane and Raz, Ran}, TITLE = {Distance Labeling in Graphs}, JOURNAL = {Journal of Algorithms}, VOLUME = 53, NUMBER = 1, PAGES = {85-112}, YEAR = 2004, DOI = {10.1016/j.jalgor.2004.05.002}, KEYWORDS = {distance labeling} } @TECHREPORT{CGMF04, AUTHOR = {Castanet, Richard and Gavoille, Cyril and Mosbah, Mohamed and Ferchaud, Fr\'ed\'eric}, TITLE = {Utilisation des zones d'absorption pour améliorer la gestion de flux du trafic aérien}, INSTITUTION= {LaBRI, Universit\'e Bordeaux~1 - ENSEIRB}, TYPE = {Rapport de contrat (intermédiaire)}, NUMBER = {march\'e C/1.291/CE/NB/03/}, MONTH = jan, YEAR = 2004, KEYWORDS = {contract} } @ARTICLE{AGKR04, AUTHOR = {Alstrup, Stephen and Gavoille, Cyril and Kaplan, Haim and Rauhe, Theis}, TITLE = {Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment}, JOURNAL = {Theory of Computing Systems}, VOLUME = 37, PAGES = {441-456}, YEAR = 2004, KEYWORDS = {labeling scheme, nca}, DOI = {10.1007/s00224-004-1155-5} } @TechReport{APSus, AUTHOR = {Blin, G. and Fertin, G. and Rizzi, R. and Vialette, S.}, TITLE = {Pattern Matching in Arc-Annotated Sequences: New Results for the {APS} Problem}, INSTITUTION = {LINA, Universit\'e de Nantes}, NOTE = {Submitted for publication}, YEAR = {2004} } @InProceedings{Nohole_algotel04, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O.}, TITLE = {No-Hole ${L}(p,0)$ labelings}, BOOKTITLE = {6\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel '04)}, PUBLISHER = {INRIA}, YEAR = {2004}, NOTE = {To appear} } @InProceedings{GD, AUTHOR = {Blin, G. and Chauve, C. and Fertin, G.}, TITLE = {The breakpoint distance for signed sequences}, BOOKTITLE = {Proc. 1st International Conference on Algorithms and Computational Methods for Biochemical and Evolutionary Networks(CompBioNets 2004)}, PUBLISHER = {King's College London}, YEAR = {2004}, NOTE = {To appear} } @InProceedings{Nohole, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O.}, TITLE = {No-Hole ${L}(p,0)$ labelling of Grids, Tori and Hypercubes}, BOOKTITLE = {Proc. 11th International Colloquium on Structural Information and Communication Complexity (SIROCCO '04)}, PUBLISHER = {Springer-Verlag}, VOLUME = {3104 of Lecture Notes in Computer Science}, YEAR = {2004}, PAGES = {138-148} } @InProceedings{2int, AUTHOR = {Blin, G. and Fertin, G. and Vialette, S.}, TITLE = {New Results for the 2-Interval Problem}, BOOKTITLE = {Proc. Fifteenth Annual Combinatorial Pattern Matching Symposium (CPM 2004)}, PUBLISHER = {Springer-Verlag}, VOLUME = {3109 of Lecture Notes in Computer Science}, PAGES = {311-322}, YEAR = {2004} } %------ 2003 --------------------------------------------------------- @INPROCEEDINGS{FGM03, AUTHOR = {Ferchaud, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {Using Absorption Areas to Improve {ATFM}}, BOOKTITLE = {ERC Innovative Research Workshop}, MONTH = dec, YEAR = 2003, KEYWORDS = {atfm} } @INPROCEEDINGS{FGM03, AUTHOR = {Ferchaud, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Mosbah, Mohamed}, TITLE = {Using Absorption Areas to Improve {ATFM}}, BOOKTITLE = {ERC Innovative Research Workshop}, MONTH = dec, YEAR = 2003, KEYWORDS = {atfm} } @MISC{CGMF03, AUTHOR = {Castanet, Richard and Gavoille, Cyril and Mosbah, Mohamed and Ferchaud, Fr\'ed\'eric}, TITLE = {Gestion de flux du traffic aérien en intra et inter réseaux~: un modèle de graphes évolutifs}, INSTITUTION= {LaBRI, Universit\'e Bordeaux~1 - ENSEIRB}, TYPE = {Rapport de contrat (final)}, NUMBER = {march\'e C20135E/DM/02 - EUROCONTROL}, MONTH = nov, YEAR = 2003, KEYWORDS = {contract} } @MISC{CGMF03, AUTHOR = {Castanet, Richard and Gavoille, Cyril and Mosbah, Mohamed and Ferchaud, Fr\'ed\'eric}, TITLE = {Gestion de flux du traffic aérien en intra et inter réseaux~: un modèle de graphes évolutifs}, INSTITUTION= {LaBRI, Universit\'e Bordeaux~1 - ENSEIRB}, TYPE = {Rapport de contrat (final)}, NUMBER = {march\'e C20135E/DM/02 - EUROCONTROL}, MONTH = nov, YEAR = 2003, KEYWORDS = {contract} } @TECHREPORT{FGP03, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Paul, Christophe}, TITLE = {Eclecticism Shrinks the World}, INSTITUTION= {LRI}, ADDRESS = {Universit\'{e} Paris-Sud, 91405 Orsay cedex, France}, TYPE = {{Research Report}}, NUMBER = {LRI-1376}, MONTH = oct, YEAR = 2003, KEYWORDS = {small world} } @INPROCEEDINGS{FG03, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Lower Bounds for Oblivious Single-Packet End-to-End Communication}, BOOKTITLE = {$17^{th}$ International Symposium on Distributed Computing (DISC)}, PUBLISHER = {Springer}, VOLUME = {2848 of Lecture Notes in Computer Science}, PAGES = {211-223}, MONTH = oct, YEAR = 2003, KEYWORDS = {end-to-end} } @INPROCEEDINGS{C:DG03, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Tree-Decomposition of Graphs with small Diameter Bags}, BOOKTITLE = {European conference on Combinatorics, Graph Theory and Applications (EUROCOMB~2003)}, PAGES = {100-104}, MONTH = sep, PUBLISHER = {ITI}, YEAR = {2003} } @InProceedings{Pecher/Wagler:2002:2a, author = {A. Pêcher and A. Wagler}, title = {A construction for non-rank facets of stable set polytopes of webs}, booktitle = {Eurocomb'03}, year = 2003, month = {September}, note = {full version accepted in European J. of Comb.}, pages = {301--305} } @InProceedings{Mon03, author = {Montassier, M.}, title = {Observability of recursive clique-trees}, booktitle = {Eurocomb03. European conference on Combinatorics, Graph Theory and Applications}, pages = {275--279}, year = {2003}, address = {Prague}, month = {September 8 - 12,} } @INPROCEEDINGS{GP03, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Optimal Distance Labeling Schemes for Interval and Circular-arc Graphs}, BOOKTITLE = {$11^{th}$ Annual European Symposium on Algorithms (ESA)}, EDITOR = {G. Di Battista and U. Zwick}, PUBLISHER = {Springer}, VOLUME = {2832 of Lecture Notes in Computer Science}, PAGES = {254-265}, MONTH = sep, YEAR = 2003, KEYWORDS = {distance labeling, circular-arc, interval graph}, DOI = {10.1007/b13632} } @INPROCEEDINGS{GN03b, AUTHOR = {Gavoille, Cyril and Neh\'ez, Martin}, TITLE = {On Interval Routing in Random Meshes}, BOOKTITLE = {$2^{nd}$ European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB)}, EDITOR = {Fila, J.}, ISBN = {80-239-1185-6}, PAGES = {147-150}, MONTH = sep, YEAR = 2003, KEYWORDS = {interval routing, percolation} } @INPROCEEDINGS{DG03, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Tree-Decomposition of Graphs with small Diameter Bags}, BOOKTITLE = {$2^{nd}$ European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB)}, EDITOR = {Fila, J.}, ISBN = {80-239-1185-6}, PAGES = {100-104}, MONTH = sep, YEAR = 2003, KEYWORDS = {spanner, tree-decomposition} } @INPROCEEDINGS{CFR03, AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.}, TITLE = {Vertex labeling and routing in recursive clique-trees, a new family of small-world scale-free graphs}, BOOKTITLE = {$10^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Sibeyn,Jop}, PUBLISHER = {Carleton University Press}, MONTH = {June}, YEAR = {2003}, PAGES= {73-87} } @INPROCEEDINGS{GN03, AUTHOR = {Gavoille, Cyril and Neh\'ez, Martin}, TITLE = {Interval Routing in Reliability Networks}, BOOKTITLE = {$9^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, PUBLISHER = {Carleton University Press}, PAGES = {149-164}, MONTH = jun, YEAR = 2003, KEYWORDS = {interval routing, percolation} } @INPROCEEDINGS{BGH03c, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation}, BOOKTITLE = {$29^{th}$ International Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, PUBLISHER = {Springer-Verlag}, VOLUME = {2880 of Lecture Notes in Computer Science}, PAGES = {81-92}, MONTH = jun, YEAR = 2003, KEYWORDS = {counting, coding, outerplanar}, DOI = {10.1007/b93953} } @InProceedings{bdhmp03, author = {Bermond, Jean-Claude and Delmas, Olivier and Havet, Frédéric and Montassier, Mickaël and Pérennes, Stéphane}, title = {Réseaux de télécommunication minimaux embarqués tolérants aux pannes }, booktitle = {5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003)}, pages = {27--32}, year = 2003, address = {Banyuls-sur-mer, France}, month = {12-14 mai}, publisher = {Institut National de Recherche en Informatique et Automatique}, note = {ISBN 2-7261-1246-3} } @InProceedings{bdhmp03, author = {Bermond, Jean-Claude and Delmas, Olivier and Havet, Frédéric and Montassier, Mickaël and Pérennes, Stéphane}, title = {Réseaux de télécommunication minimaux embarqués tolérants aux pannes}, booktitle = {5ème Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (ALGOTEL 2003)}, pages = {27--32}, year = {2003}, address = {Banyuls-sur-mer, France}, month = {12-14 mai}, publisher = {Institut National de Recherche en Informatique et Automatique}, note = {ISBN 2-7261-1246-3} } @ARTICLE{GP03c, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {Compact and Localized Distributed Data Structures}, JOURNAL = {Distributed Computing}, PUBLISHER = {Springer-Verlag}, VOLUME = 16, PAGES = {111-120}, MONTH = may, YEAR = 2003, NOTE = {PODC 20-Year Special Issue}, KEYWORDS = {labeling scheme, data-structure} } @Unpublished{2003/04/04, author = {A. Pêcher and X. Zhu}, title = {Colorations circulaires des graphes circulaires partitionnables}, note = {Journées GRAAL, Dijon}, month = {avril}, year = 2003 } @Unpublished{2003/03/09, author = {A. Pêcher and A. Wagler}, title = {Almost all Webs are not Rank-Perfect}, note = {7th Combinatorial Optimization Workshop, Aussois}, month = {mars}, year = 2003 } @TECHREPORT{GN03a, AUTHOR = {Gavoille, Cyril and Neh\'ez, Martin}, TITLE = {Interval Routing in Reliability Networks}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1294-03}, MONTH = mar, YEAR = 2003, KEYWORDS = {interval routing, percolation} } @TECHREPORT{BGH03b, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding and Generation}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1295-03}, MONTH = mar, YEAR = 2003, KEYWORDS = {counting, coding, outerplanar} } @TECHREPORT{GP03a, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Small Universal Distance Matrices}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1290-03}, MONTH = feb, YEAR = 2003, KEYWORDS = {distance labeling, circular-arc, interval graph} } @TECHREPORT{FG03a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Lower Bounds for Oblivious Single-Message End-to-End Communication}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1289-03}, MONTH = feb, YEAR = 2003, KEYWORDS = {end-to-end} } @INPROCEEDINGS{BGH03, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation}, BOOKTITLE = {$20^{th}$ Annual Symposium on Theoretical Aspects of Computer Science (STACS)}, PUBLISHER = {Springer}, VOLUME = {2607 of Lecture Notes in Computer Science}, PAGES = {499-510}, MONTH = feb, YEAR = 2003, KEYWORDS = {planar, counting, coding} } @Article{acycl, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, TITLE = {Acyclic and $k$-distance Coloring of the Grid}, JOURNAL = {Information Processing Letters}, VOLUME = {87(1)}, PAGES = {51-58}, YEAR = {2003} } @Article{survey-knodel, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {A Survey on {K}n\"odel Graphs}, JOURNAL = {Discrete Applied Mathematics}, VOLUME = {137(2)}, PAGES = {173-195}, YEAR = {2003} } @Article{arup, AUTHOR = {Fertin, G. and Raspaud, A. and Roychowdhury, A.}, TITLE = {On the Oriented Chromatic Number of Grids}, JOURNAL = {Information Processing Letters}, VOLUME = {85(5)}, PAGES = {261-266}, YEAR = {2003} } @Article{domatic, AUTHOR = {Alon, N. and Fertin, G. and Liestman, A.L. and Shermer, T.C. and Stacho, L.}, JOURNAL = {Discrete Mathematics}, TITLE = {Factor $d$-Domatic Colorings of Graphs}, YEAR = {2003}, VOLUME = {262(1-3)}, PAGES = {17-25} } @PhdThesis{t:Douris03, AUTHOR = {Dourisboure, Yon}, TITLE = {Routage compact et longueur arborescente}, School = {Universit\'e Bordeaux 1}, key = {2760}, YEAR = 2003 } @ARTICLE{a:FGR03, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, TITLE = {Acyclic and k-distance coloring of the grid}, JOURNAL = {Information Processing Letters}, VOLUME={87}, YEAR = {2003}, PAGES= {51-58} } @ARTICLE{a:BR2003, author = "O.V.~{Borodin} and A.~{Raspaud}", title = "A sufficient condition for planar graphs to be 3-colorable", journal = {J. Combin. Theory Ser. B.}, year = "2003", volume= "88", pages= "17-27" } @TechReport{d:BMR03b, author = {Bazzaro, F. and Montassier, M. and Raspaud, A.}, title = {$(d,1)$-total labelling of connected planar graphs with large girth and high maximum degree}, institution = {{LaBRI}}, year = {2003}, number = {RR-1307-03} } @article{Fertin-On-grids, author = "Fertin, G. and Raspaud, A. and Roychowdhury, A.", title = "On the oriented chromatic number of grids", journal = "Information Processing Letters", volume = "85", pages = "261-266", year = "2003" } @Unpublished{Pecher:2003:2, author = {A. Pêcher}, title = {A note on the circular chromatic number of circular perfect planar graphs}, note = {LaBRI Research Report RR-1309-03}, year = 2003 } @Unpublished{2003/06/19, author = {A. Pêcher and A. K. Wagler}, title = {La plupart des webs ne sont pas rang-parfaits.}, note = { Journées Polyèdres et Optimisation Combinatoire JPOC, Clermont-Ferrand}, pages = {32--35}, year = 2003 } @InProceedings{Pecher/Wagler:2002a, author = {A. Pêcher and A. Wagler }, title = {On Non-Rank Facets in Stable Set Polytopes of Webs with Clique Number Four}, booktitle = {Electronic Notes in Discrete Mathematics}, pages = {96--99}, year = 2003, publisher = {2nd Cologne Twente Workshop on Graphs and Combinatorial Optimization}, note = {full version accepted in Discrete Applied Mathematics}, volume = 13 } @article {Pecher:2000, AUTHOR = {P{\^e}cher, Arnaud}, TITLE = {Partitionable graphs arising from near-factorizations of finite groups}, JOURNAL = {Discrete Math.}, FJOURNAL = {Discrete Mathematics}, VOLUME = {269}, YEAR = {2003}, NUMBER = {1-3}, PAGES = {191--218}, ISSN = {0012-365X}, CODEN = {DSMHA4}, MRCLASS = {05C70 (05C25 20D60)}, MRNUMBER = {1 989 461} } @article{DBLP:journals/combinatorics/KucherovOR03, author = {Gregory Kucherov and Pascal Ochem and Micha\"el Rao}, title = {How Many Square Occurrences Must a Binary Sequence Contain?}, journal = {Electr. J. Comb.}, volume = {10}, year = {2003}, bibsource = {DBLP, http://dblp.uni-trier.de} } @TechReport{MR03x, author = {Montassier, M. and Raspaud, A.}, title = {$(d,1)$-total labelling of graphs with a given maximum average degree}, institution = {{LaBRI}}, year = {2003}, number = {RR-1308-03} } @TechReport{BMR03x, author = {Bazzaro, F. and Montassier, M. and Raspaud, A.}, title = {$(d,1)$-total labelling of planar graphs with large girth and high maximum degree}, institution = {{LaBRI}}, year = {2003}, number = {RR-1307-03} } @ARTICLE{GZ03, AUTHOR = {Gavoille, Cyril and Zemmari, Akka}, TITLE = {The Compactness of Adaptive Routing Tables}, JOURNAL = {Journal of Discrete Algorithms}, VOLUME = 1, NUMBER = 2, PAGES = {237-254}, YEAR = 2003, KEYWORDS = {interval routing} } @ARTICLE{GP03b, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Distance Labeling Scheme and Split Decomposition}, JOURNAL = {Discrete Mathematics}, VOLUME = 273, NUMBER = {1-3}, PAGES = {115-130}, YEAR = 2003, KEYWORDS = {distance labeling} } @ARTICLE{EGP03, AUTHOR = {Eilam, Tamar and Gavoille, Cyril and Peleg, David}, TITLE = {Compact Routing Schemes With Low Stretch Factor}, JOURNAL = {Journal of Algorithms}, VOLUME = 46, NUMBER = 2, PAGES = {97-114}, YEAR = 2003, KEYWORDS = {compact routing, interval routing} } @TechReport{nested, AUTHOR = {Blin, G. and Fertin, G. and Rusu, I. and Sinoquet, C.}, TITLE = {{RNA} Sequences and the {EDIT(NESTED,NESTED)} Problem}, INSTITUTION = {IRIN, Universit\'e de Nantes}, YEAR = {2003}, TYPE = {{Research Report}}, NUMBER = {RR-IRIN-03.07}, NOTE = {Submitted for publication} } @TechReport{SpannersDM_submitted, AUTHOR = {Fertin, G. and Liestman, A.L. and Shermer, T.C. and Stacho, L.}, TITLE = {Edge-Disjoint Spanners in Cartesian Products of Graphs}, INSTITUTION = {Simon Fraser University, Vancouver, Canada}, NOTE = {Submitted for publication}, YEAR = {2003} } @InProceedings{Pvialette, AUTHOR = {Blin, G. and Fertin, G. and Vialette, S.}, TITLE = {A polynomial algorithm for the 2-interval pattern problem}, BOOKTITLE = {Poster session of the 3rd Workshop on Algorithms in Bioinformatics (WABI 2003)}, YEAR = {2003} } @InProceedings{Psynteny, AUTHOR = {Chauve, C. and Fertin, G.}, TITLE = {On maximal instances for the original syntenic distance}, BOOKTITLE = {Proc. 2nd European Conference on Computational Biology (ECCB 2003) - Short Papers and Posters}, PAGES = {285-286}, YEAR = {2003}, OPTNOTE = {ISBN 2-7261-1257}, PUBLISHER = {INRIA} } @InProceedings{Lpq, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {${L}(p,q)$ labeling of $d$-Dimensional Grids}, BOOKTITLE = {Proc. Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'03)}, YEAR = {2003} } @InProceedings{SFSW_Sirocco, AUTHOR = {Comellas, F. and Fertin, G. and Raspaud, A.}, TITLE = {Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs}, BOOKTITLE = {Proc. 10th International Colloquium on Structural Information and Communication Complexity (SIROCCO '03)}, VOLUME = {17}, SERIES = {Proceedings in Informatics}, PAGES = {73-87}, YEAR = {2003}, OPTNOTE = {To appear}, PUBLISHER = {Carleton Scientific} } %------ 2002 --------------------------------------------------------- @INPROCEEDINGS{C:DG02, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Improved Compact Routing Scheme for Chordal Graphs}, BOOKTITLE = {$16$-th International Symposium on DIStributed Computing (DISC~2002)}, PAGES = {252-264}, MONTH = oct, PUBLISHER = {Springer-Verlag}, VOLUME = {2508 of Lecture Notes in Computer Science}, YEAR = {2002} } @INPROCEEDINGS{DG02, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Improved Compact Routing Scheme for Chordal Graphs}, BOOKTITLE = {$16^{th}$ International Symposium on Distributed Computing (DISC)}, PUBLISHER = {Springer}, PAGES = {252-264}, VOLUME = {2508 of Lecture Notes in Computer Science}, MONTH = oct, YEAR = 2002, KEYWORDS = {compact routing, chordal} } @Unpublished{2002/09/12, author = {A. Pêcher and A. Wagler}, title = {How imperfect are Webs and Antiwebs}, note = {XXXIII Annual Conference of the Operational Research Society of Italy - talk by A. Wagler}, month = {septembre}, year = 2002 } @TECHREPORT{BGH02, AUTHOR = {Bonichon, Nicolas and Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {An Information Upper Bound of Planar Graphs Using Triangulation}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1279-02}, MONTH = sep, YEAR = 2002, KEYWORDS = {planar, counting, coding} } @INPROCEEDINGS{AGKR02, AUTHOR = {Alstrup, Stephen and Gavoille, Cyril and Kaplan, Haim and Rauhe, Theis}, TITLE = {Nearest Common Ancestors: A Survey and a new Distributed Algorithm}, BOOKTITLE = {$14^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, PAGES = {258-264}, MONTH = aug, YEAR = 2002, KEYWORDS = {labeling scheme, nca} } @Article{BBPyy, author = {Barth, D. and Baudon, O. and Puech, J.}, title = {Decomposable trees: a polynomial algorithm for tripodes}, journal = {Discrete Applied Mathematics}, year = {2002}, volume = {119}, number = {3}, pages = {205-216}, month = {july} } @InProceedings{PA02, author = {Auillans, P.}, title = {Toward Topic Maps processing and visualization}, booktitle = {Sixth International Conference on Information Visualisation (IV'02)}, year = {2002}, address = {London, England}, month = {July} } @INPROCEEDINGS{C:Douris02, AUTHOR = {Dourisboure, Yon}, TITLE = {An Additive Stretched Routing Scheme for Chordal Graphs}, BOOKTITLE = {$28$-th International Workshop on Graph-Theoretic Concepts in Computer Science (WG~'02)}, PAGES = {150-163}, MONTH = Jun, PUBLISHER = {Springer-Verlag}, VOLUME = {2573 of Lecture Notes in Computer Science}, YEAR = 2002 } @TECHREPORT{DG02a, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Improved Compact Routing Scheme for Chordal Graphs}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1274-02}, MONTH = may, YEAR = 2002, KEYWORDS = {compact routing, chordal} } @INPROCEEDINGS{FG02, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {A Space Lower Bound for Routing in Trees}, BOOKTITLE = {$19^{th}$ Annual Symposium on Theoretical Aspects of Computer Science (STACS)}, PUBLISHER = {Springer}, VOLUME = {2285 of Lecture Notes in Computer Science}, PAGES = {65-75}, MONTH = mar, YEAR = 2002, KEYWORDS = {compact routing, tree} } @Article{fvs_ipl, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, JOURNAL = {Information Processing Letters}, TITLE = {Minimum Feedback Vertex Set and Acyclic Coloring}, YEAR = {2002}, VOLUME = {84(3)}, PAGES = {131-139} } @Article{bedade02, author = {Bermond, Jean-Claude and Darrot, Éric and Delmas, Olivier}, title = {Design of fault-tolerant networks for satellites ({TWTA} redundancy)}, journal = {Networks}, year = {2002}, volume = {40}, number = {4}, pages = {202--207}, note = {Wiley InterScience} } @ARTICLE{a:S01a, author = "E. {Sopena}", title = "There exist oriented planar graphs with oriented chromatic number at least sixteen", journal = "Inform. Proc. Letters", year = "2002", volume = "81(6)", pages = "309-312" } @ARTICLE{a:FKNRS01, author = "D. {Fon-Der-Flaass} and A.V. {Kostochka} and A. {Raspaud} and E. {Sopena}", title = "Nilpotent families of endomorphisms of $(P(V)^+,\cup)$", journal = {J. Combin. Theory, Ser.~B}, year = "2002", volume="86(1)", pages="100-108" } @ARTICLE{a:BFKRS01b, author = "O.V. {Borodin} and D. {Fon-Der-Flaass} and A.V. {Kostochka} and A. {Raspaud} and E. {Sopena}", title = "Acyclic list 7-colouring of planar graphs", journal= "J. Graph Theory", year = "2002", volume ="40(2)", pages="83-90" } @ARTICLE{a:RUSBKRS02, author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = "On the minimum number of colours in acyclic k-strong colorings of maps on surfaces", journal = {Matem. zametki (in Russian)}, year = "2002", volume= "72, No. 1", pages= "35-37" } @ARTICLE{a:FKNRS02, author = "D.~{Fon-Der-Flaass} and A.V.~{Kostochka} and J.~{Ne\v set\v ril} and A.~{Raspaud} and E.~{Sopena}", title = "Nilpotent Families of Endomorphisms of $(P(V)^+,\cup)$", journal = {J. Combin. Theory Ser. B.}, year = "2002", volume= "No. 86", pages= "100-108" } @ARTICLE{a:FGR02, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, TITLE = {Minimum feedback vertex set and acyclic coloring}, JOURNAL = {Information Processing Letters}, VOLUME={84}, YEAR = {2002}, PAGES= {131-139} } @ARTICLE{a:BFKRS02, author = "O.V.~{Borodin} and D. {Fon-Der-Flaass} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = "Acyclic List 7-coloring of Planar Graphs", journal = {Journal of Graph Theory}, year = "2002", volume= "40, No. 2", pages= "83-90" } @InProceedings{AB02, author = {Auillans, Pascal and Baudon, Olivier}, title = {Topic maps et hypergraphes}, booktitle = {WVDR 2002}, year = {2002}, editor = {Yves Chiricota}, address = {Montpellier}, month = {Janvier} } @InProceedings{AMRV02, author = {Auillans, P. and Ossona de Mendez, P. and Rosenstiehl, P. and Vatant, B.}, title = {A Formal Model for Topic Maps}, booktitle = {Proceedings of the First International Semantic Web Conference on The Semantic Web}, year = {2002}, isbn = {3-540-43760-6}, pages = {69--83}, publisher = {Springer-Verlag} } @ARTICLE{CFG02, AUTHOR = {Cohen, Johanne and Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Recognizing {K}n{\"o}del Graphs}, JOURNAL = {Discrete Mathematics}, VOLUME = 250, NUMBER = {1-3}, PAGES = {41-62}, YEAR = 2002, KEYWORDS = {recognizing} } @InProceedings{fvs_algotel02, AUTHOR = {Fertin, G. and Godard, E. and Raspaud, A.}, TITLE = {Conversion de Longueur d'Onde dans les R\'eseaux Optiques - Facteur d'Optimalit\'e $\frac{5}{3}$ }, OPTNOTE = {To appear}, BOOKTITLE = {4\`emes Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel '02)}, PAGES = {33-39}, YEAR = {2002}, PUBLISHER = {INRIA} } %------ 2001 --------------------------------------------------------- @InProceedings{ABJ01, author = {Auillans, Pascal and Baudon, Olivier and Jarry, Franck}, title = {Using XML-Topic Map on a PDA}, booktitle = {XML 2001-US}, year = {2001}, editor = {Jane Harnad}, address = {Orlando}, month = {December} } @TECHREPORT{Gav01a, AUTHOR = {Gavoille, Cyril}, TITLE = {A Note on Implicit Representation of Graphs}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1268-01}, MONTH = dec, YEAR = 2001, KEYWORDS = {labeling scheme} } @InProceedings{AB01b, author = {Auillans, P. and Baudon, O. and Jarry, F.}, title = {Using XML-Topic Map on a PDA}, booktitle = {XML 2001-US}, year = {2001}, editor = {Pamela Gennusa}, address = {Orlando}, month = {December} } @TECHREPORT{GP01c, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Distance Labeling Scheme and Split Decomposition}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1263-01}, MONTH = nov, YEAR = 2001, KEYWORDS = {distance labeling} } @INPROCEEDINGS{GP01a, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Split Decomposition and Distance Labelling: {A}n Optimal Scheme for Distance Hereditary Graphs}, BOOKTITLE = {European Conference on Combinatorics, Graph Theory and Applications (COMB)}, EDITOR = {Jaroslav Ne\v{s}et\v{r}il, Marc Noy and Oriol Serra}, PUBLISHER = {Electronic Notes in Discrete Mathematics}, VOLUME = 10, PAGES = {117-120}, MONTH = nov, YEAR = 2001, KEYWORDS = {distance labeling}, DOI = {10.1016/S1571-0653(04)00374-9} } @Article{BFH01, author = {Baudon, O. and Fertin, G. and Havel, I.}, title = {Routing Permutations in the Hypercube}, journal = {Discrete Applied Mathematics}, year = {2001}, volume = {113}, number = {1}, pages = {43-58}, month = sep } @TECHREPORT{FG01c, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {A Space Lower Bound for Routing in Trees}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1262-01}, MONTH = sep, YEAR = 2001, KEYWORDS = {compact routing, tree} } @TECHREPORT{GP01b, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {Compact and Localized Distributed Data Structures}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1261-01}, MONTH = aug, YEAR = 2001, KEYWORDS = {labeling scheme, data-structure} } @INPROCEEDINGS{GKKPP01, AUTHOR = {Gavoille, Cyril and Katz, Michal and Katz, Nir A. and Paul, Christophe and Peleg, David}, TITLE = {Approximate Distance Labeling Schemes}, BOOKTITLE = {$9^{th}$ Annual European Symposium on Algorithms (ESA)}, EDITOR = {F. Meyer auf der Heide}, PUBLISHER = {Springer}, VOLUME = {2161 of Lecture Notes in Computer Science}, PAGES = {476-488}, MONTH = aug, YEAR = 2001, KEYWORDS = {distance labeling} } @TECHREPORT{AGKR01, AUTHOR = {Alstrup, Stephen and Gavoille, Cyril and Kaplan, Haim and Rauhe, Theis}, TITLE = {Identifying Nearest Common Ancestors in a Distributed Environment}, INSTITUTION= {The IT University of Copenhagen}, NUMBER = {IT-C Series 2001-6, ISSN 1600-6100}, MONTH = aug, YEAR = 2001, KEYWORDS = {labeling scheme, nca} } @ARTICLE{FGM01, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Mans, Bernard}, TITLE = {Interval Routing Schemes Allow Broadcasting with Linear Message-Complexity}, JOURNAL = {Distributed Computing}, VOLUME = 14, PAGES = {217-229}, MONTH = jul, YEAR = 2001, KEYWORDS = {interval routing, broadcast} } @INPROCEEDINGS{FG01a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Routing in Trees}, BOOKTITLE = {$28^{th}$ International Colloquium on Automata, Languages and Programming (ICALP)}, EDITOR = {Orejas, Fernando and Spirakis, Paul G. and Leeuwen, Jan van}, PUBLISHER = {Springer}, VOLUME = {2076 of Lecture Notes in Computer Science}, PAGES = {757-772}, MONTH = jul, YEAR = 2001, KEYWORDS = {compact routing, tree} } @InProceedings{KNB_Sirocco, AUTHOR = {Fertin, G. and Raspaud, A.}, BOOKTITLE = {$8^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Comellas, Francesc and F\`abrega,Josep and Fraigniaud, Pierre}, PUBLISHER = {Carleton Scientific}, MONTH = {june}, TITLE = {$k$-Neighborhood Broadcasting}, PAGES = {133-146}, YEAR = {2001} } @INPROCEEDINGS{GPRS01, AUTHOR = {Gavoille, Cyril and Peleg, David and Raspaud, Andr{\'e} and Sopena, Eric}, TITLE = {Small $k$-Dominating Sets in Planar Graphs with Applications}, BOOKTITLE = {$27^{th}$ International Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, PUBLISHER = {Springer}, VOLUME = {2204 of Lecture Notes in Computer Science}, PAGES = {201-216}, MONTH = jun, YEAR = 2001, KEYWORDS = {dominating, planar, interval routing} } @INPROCEEDINGS{i:Gav01, AUTHOR = {Gavoille, Cyril}, TITLE = {Compact and Distributed Data Structures (invited lecture)}, BOOKTITLE = {IWIN-SIROCCO~'01 joint conference}, LOCATION = {Vall de Nuria, Spain}, MONTH = jun, YEAR = 2001, KEYWORDS = {compact routing, labeling scheme} } @INPROCEEDINGS{c:DG01, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Interval Routing for Generalized {H}ypercube-Like Graphs}, BOOKTITLE = {$3^e$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, PUBLISHER = {INRIA}, PAGES = {61-68}, MONTH = may, YEAR = 2001 } @InProceedings{AB01, author = {Auillans, Pascal and Baudon, Olivier}, title = {Graph Clustering for Very Large Topic Maps}, booktitle = {XML 2001-Europe}, year = {2001}, editor = {Pamela Gennusa}, address = {Berlin}, month = {May} } @TECHREPORT{GPRS01a, AUTHOR = {Gavoille, Cyril and Peleg, David and Raspaud, Andr{\'e} and Sopena, Eric}, TITLE = {Small $k$-Dominating Sets in Planar Graphs with Applications}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1258-01}, MONTH = may, YEAR = 2001, KEYWORDS = {dominating, planar, interval routing} } @InProceedings{AB01, author = {Auillans, P. and Baudon, O.}, title = {Graph Clustering for Very Large Topic Maps}, booktitle = {XML 2001-Europe}, year = {2001}, editor = {Pamela Gennusa}, address = {Berlin}, month = {May} } @INPROCEEDINGS{FG01b, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Comment router dans un arbre ?}, BOOKTITLE = {$3^{\mbox{\`emes}}$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, PUBLISHER = {INRIA}, PAGES = {85-88}, MONTH = may, YEAR = 2001, KEYWORDS = {compact routing, tree} } @INPROCEEDINGS{DG01, AUTHOR = {Dourisboure, Yon and Gavoille, Cyril}, TITLE = {Interval Routing for Generalized {H}ypercube-Like Graphs}, BOOKTITLE = {$3^{\mbox{\`emes}}$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, PUBLISHER = {INRIA}, PAGES = {61-68}, MONTH = may, YEAR = 2001, KEYWORDS = {interval routing} } @ARTICLE{Gav01, AUTHOR = {Gavoille, Cyril}, TITLE = {Routing in Distributed Networks: Overview and Open Problems}, JOURNAL = {ACM SIGACT News - Distributed Computing Column}, VOLUME = 32, NUMBER = 1, PAGES = {36-52}, MONTH = mar, YEAR = 2001, KEYWORDS = {compact routing} } @InProceedings{kNeighb_COMB, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Neighborhood Communications in Networks}, BOOKTITLE = {Proc. Euroconference on Combinatorics, Graph Theory and Applications (COMB'01)}, SERIES = {Electronic Notes on Discrete Mathematics}, YEAR = {2001} } @InProceedings{kNB_Sirocco, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {$k$-Neighborhood Broadcasting}, BOOKTITLE = {8th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2001)}, VOLUME = {11}, SERIES = {Proceedings in Informatics}, PAGES = {133-146}, YEAR = {2001}, PUBLISHER = {Carleton Scientific} } @InProceedings{starWG, AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.}, TITLE = {On Star Coloring of Graphs}, BOOKTITLE = {27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001)}, YEAR = {2001}, VOLUME = {2204 of Lecture Notes in Computer Science}, PUBLISHER = {Springer-Verlag}, PAGES = {140-153} } @Article{routingDAM, AUTHOR = {Baudon, O. and Fertin, G. and Havel, I.}, JOURNAL = {Discrete Applied Mathematics}, TITLE = {Routing Permutations and 2-1 Routing Requests in the Hypercube}, YEAR = {2001}, VOLUME = {113(1)}, PAGES = {43-58} } @Article{beadelper01, author = {Beauquier, Bruno and Delmas, Olivier and Pérennes, Stéphane}, title = {Tight bounds for broadcasting in the linear cost model}, journal = {Journal of Interconnection Networks}, year = 2001, volume = 2, number = {2--2001}, pages = {175--188}, note = {World Scientific Publishing Company} } @ARTICLE{a:NS00, author = "J. {Nesetril} and E. {Sopena}", title = "On the oriented game chromatic number", journal = {Electronic J. of Combin.}, year = "2001", volume="8(2)", note="Paper 14" } @ARTICLE{a:HKRS01, author = "P. {Hell} and A.V. {Kostochka} and A. {Raspaud} and E. {Sopena}", title = "On nice graphs", journal = {Discrete Math.}, year = "2001", volume="234", pages="39-51" } @ARTICLE{a:S01b, author = "E. {Sopena}", title = "Oriented graph coloring", journal = {Discrete Math.}, year = "2001", volume= "229(1-3)", pages= "359-369" } @InProceedings{p:S01c, author= "E. {Sopena}", title = "Two problems on planar graphs", booktitle = "Proc. 5th Graph Theory Day", year = "2001" } @ARTICLE{a:BFKRS01a, author = "O.V. {Borodin} and D. {Fon-Der-Flaass} and A.V. {Kostochka} and A. {Raspaud} and E. {Sopena}", title = "On deeply critical oriented graphs", journal = {J. Combin. Theory, Ser.~B}, year = "2001", volume= "81", pages= "150-155" } @InProceedings{p:GPRS01, author= "C. {Gavoile} and D. {Peleg} and A. {Raspaud} and E. {Sopena}", title = "Small $k$-dominating sets in planar graphs with applications", booktitle = "Proc. Workshop on Graphs, WG'01, LNCS 2204", year = "2001", pages="201-216" } @InProceedings{kNeighb_COMB, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Neighborhood Communications in Networks}, BOOKTITLE = {Euroconference on Combinatorics, Graph Theory and Applications (EUROCOMB'01)}, VOLUME = {10}, editor = {Jaroslav Nesetril and Marc Noy and Oriol Serra}, SERIES = {Electronic Notes on Discrete Mathematics}, YEAR = {2001}, PUBLISHER = {Elsevier} } @InProceedings{GPRS01, AUTHOR = {Gavoille, C. and Peleg, D. and Raspaud, A. and Sopena, E.}, TITLE = {Small $k$-Dominating Sets in Planar Graphs with Applications }, BOOKTITLE = {27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001)}, YEAR = {2001}, VOLUME = {2204}, PUBLISHER = {Springer-Verlag}, NOTE = {LNCS}, PAGES = {201--216} } @InProceedings{starWG, AUTHOR = {Fertin, G. and Raspaud, A. and Reed, B.}, TITLE = {On Star Coloring of Graphs}, BOOKTITLE = {27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2001)}, YEAR = {2001}, VOLUME = {2204}, PUBLISHER = {Springer-Verlag}, NOTE = {LNCS}, PAGES = { 140--153 } } @ARTICLE{a:HKRS01, author = "P. {Hell} and A.V. {Kostochka} and A. {Raspaud} and E. {Sopena}", title = "On nice graphs", journal = {Discrete Math.}, year = "2001", volume= "234", pages= "39-51" } @ARTICLE{a:BFKRS01, author = "O.V.~{Borodin} and D. {Fon-Der-Flaass} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = "On Deeply Critical Oriented Graphs.", journal = {J. Combin. Theory Ser. B.}, year = "2001", volume= "81, No. 1", pages= "150-155" } @ARTICLE{a:RuBKRS01, author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = " Acyclic Coloring of 1-Planar Graphs.", journal = {Discrete Applied Math.}, year = "2001", volume= "114, No.1-3", pages= "29-41" } @Article{a:ARO99, author = {D. Amar and A. Raspaud and O. Togni}, title = {All-to-all Wavelength-routing in all-optical compound networks}, journal= "Discrete Math.", volume="235", year="2001", pages="353-363" } @TechReport{Pecher:2001, author = {A. Pêcher}, title = {Getting partitionable graphs from another one, by modifying only two maximum cliques}, institution = {I.A.S.I.}, year = 2001 } @Article{HPV01, author = {M. Habib and C. Paul and L. Viennot}, title = {Linear time recognition of $P_4$-indifference graphs}, journal = {Discrete Mathematics and Theoretical Computer Science}, year = 2001, note = {To appear} } @ARTICLE{AAKF01, author = {Amar, D. and Abderrezzak, M. El Kadi and Flandrin, E.}, title = {Cyclability and pancyclability in bipartite graphs}, journal = {Discrete Math.}, volume = 236, pages = {3-11}, year = {2001} } @INPROCEEDINGS{GPPR01, AUTHOR = {Gavoille, Cyril and Peleg, David and P\'{e}renn\`{e}s, St\'{e}phane and Raz, Ran}, TITLE = {Distance Labeling in Graphs}, BOOKTITLE = {$12^{th}$ Symposium on Discrete Algorithms (SODA)}, PUBLISHER = {ACM-SIAM}, PAGES = {210-219}, MONTH = jan, YEAR = 2001, KEYWORDS = {distance labeling} } @ARTICLE{GP01, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {The Compactness of Interval Routing for Almost All Graphs}, JOURNAL = {SIAM Journal on Computing}, VOLUME = 31, NUMBER = 3, PAGES = {706-721}, YEAR = 2001, KEYWORDS = {interval routing, compact routing} } @ARTICLE{GG01, AUTHOR = {Gavoille, Cyril and Gengler, Marc}, TITLE = {Space-Efficiency of Routing Schemes of Stretch Factor Three}, JOURNAL = {Journal of Parallel and Distributed Computing}, VOLUME = 61, NUMBER = 5, PAGES = {679-687}, YEAR = 2001, KEYWORDS = {compact routing}, DOI = {10.1006/jpdc.2000.1705} } @Inproceedings{AD02, author ={P. Auillans and J. Delahousse}, booktitle ={Graph Drawing, 9th International Symposium}, title ={Knowledge Index Manager}, editor ={P. Mutzel, M. Jünger and S. Leipert}, publisher ={LNCS}, year ={2001}, pages ={469--470} } @TECHREPORT{FG01, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Routing in Trees}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1252-01}, MONTH = jan, YEAR = 2001, KEYWORDS = {compact routing, tree} } %------ 2000 --------------------------------------------------------- @PhdThesis{Pecher:2000:2, author = {A. Pêcher}, title = {Graphes de Cayley partitionnables}, school = {University of Orleans, France}, year = 2000, month = {December} } @TECHREPORT{GKKPP00, AUTHOR = {Gavoille, Cyril and Katz, Michal and Katz, Nir A. and Paul, Christophe and Peleg, David}, TITLE = {Approximate Distance Labeling Schemes}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1250-00}, MONTH = dec, YEAR = 2000, KEYWORDS = {distance labeling} } @MISC{Gav00b, AUTHOR = {Gavoille, Cyril}, TITLE = {Structures de donn\'ees compactes et distribu\'ees}, NOTE = {Th{\`e}se d'habilitation à diriger les recherches, Universit{\'e} de Bordeaux}, MONTH = dec, YEAR = 2000, KEYWORDS = {labeling scheme, compact routing, interval routing} } @INPROCEEDINGS{BFGMR00, AUTHOR = {Barri\`{e}re, Lali and Fraigniaud, Pierre and Gavoille, Cyril and Mans, Bernard and Robson, John Michael}, TITLE = {On Recognizing {C}ayley Graphs}, BOOKTITLE = {$8^{th}$ Annual European Symposium on Algorithms (ESA)}, PUBLISHER = {Springer}, VOLUME = {1879 of Lecture Notes in Computer Science}, PAGES = {76-87}, MONTH = sep, YEAR = 2000, KEYWORDS = {cayley, recognizing} } @InProceedings{FIBO, AUTHOR = "G.~{Fertin} and A.~{Raspaud}", TITLE = {Gossiping in Directed Graphs}, YEAR = {2000}, MONTH= {july}, DATE= {17-22 july 2000}, ADDRESS= {Luxembourg}, booktitle = {Ninth International Conference on Fibonacci Numbers and their Applications} } @INPROCEEDINGS{GP00, AUTHOR = {Gavoille, Cyril and Paul, Christophe}, TITLE = {Approximate Distance Labeling Schemes}, BOOKTITLE = {$6^{th}$ International Conference on Graph Theory (ICGT)}, EDITOR = {Elsevier}, PUBLISHER = {Electronic Notes in Discrete Mathematics}, VOLUME = 5, PAGES = {134-137}, MONTH = jul, YEAR = 2000, KEYWORDS = {distance labeling}, DOI = {10.1016/S1571-0653(05)80145-3} } @INPROCEEDINGS{FGM00a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Mans, Bernard}, TITLE = {Interval Routing Schemes Allow Broadcasting with Linear Message-Complexity}, BOOKTITLE = {$19^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, PAGES = {11-20}, MONTH = jul, YEAR = 2000, KEYWORDS = {interval routing, broadcast} } @InProceedings{i:wg2000, AUTHOR = {G. Fertin and A. Raspaud and H. Schr\"{o}der and O. {S\'ykora} and I. {Vrt'o}}, TITLE = {Diameter of the Kn\"{o}del Graph}, BOOKTITLE = {26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '00)}, MONTH =jun, YEAR ={2000}, PUBLISHER = {Springer-Verlag}, VOLUME = {1928 of Lecture Notes in Computer Science}, PAGES = {149-160} } @InProceedings{i:rvs00, AUTHOR = {A. {Raspaud} and O. {S\'ykora} and I. {Vrt'o}}, BOOKTITLE = {$7^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Flammini, Michele and Nardelli, Enrico and Proietti, Guido and Spirakis, Paul}, PUBLISHER = {Carleton Scientific}, MONTH = jun, TITLE = {Congestion and Dilatation, Similarities and Differences: a Survey}, PAGES = {269-280}, YEAR = {2000} } @INPROCEEDINGS{GZ00a, AUTHOR = {Gavoille, Cyril and Zemmari, Akka}, TITLE = {The Compactness of Adaptive Routing Tables}, BOOKTITLE = {$7^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Flammini, Michele and Nardelli, Enrico and Proietti, Guido and Spirakis, Paul}, PUBLISHER = {Carleton Scientific}, PAGES = {127-140}, MONTH = jun, YEAR = 2000, KEYWORDS = {interval routing} } @TECHREPORT{GPPR00, AUTHOR = {Gavoille, Cyril and Peleg, David and P\'{e}renn\`{e}s, St\'{e}phane and Raz, Ran}, TITLE = {Distance Labeling in Graphs}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1239-00}, YEAR = 2000, MONTH = apr, KEYWORDS = {distance labeling} } @TECHREPORT{GZ00, AUTHOR = {Gavoille, Cyril and Zemmari, Akka}, TITLE = {The Compactness of Adaptive Routing Tables}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1233-00}, MONTH = feb, YEAR = 2000, KEYWORDS = {interval routing} } @InProceedings{ICGT200, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Recognizing Recursive Circulant Graphs}, BOOKTITLE = {6th International Conference on Graph Theory (ICGT 2000)}, VOLUME = {5}, SERIES = {Electronic Notes on Discrete Mathematics}, YEAR = {2000} } @InProceedings{Fibo, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Gossiping in Directed Graphs}, BOOKTITLE = {9th International Conference on Fibonacci Numbers and their Applications}, YEAR = {2000} } @InProceedings{diamknodel, AUTHOR = {Fertin, G. and Raspaud, A. and S\'ykora, O. and Schr\"oder, H. and Vr\v{t}o, I.}, TITLE = {Diameter of {K}n\"odel Graph}, BOOKTITLE = {26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000)}, YEAR = {2000}, PUBLISHER = {Springer-Verlag}, VOLUME = {1928 of Lecture Notes in Computer Science}, PAGES = {149-160} } @Article{flcomp, AUTHOR = {Fertin, G. and Labahn, R.}, TITLE = {Compounding of Gossip Graphs}, YEAR = {2000}, VOLUME = {36(2)}, JOURNAL = {Networks}, PAGES = {126-137} } @Article{fertin-hier, AUTHOR = {Fertin, G.}, JOURNAL = {Information Processing Letters}, TITLE = {Hierarchical Broadcast and Gossip Networks}, YEAR = {2000}, VOLUME = {73(3-4)}, PAGES = {131-136} } @Article{fertinmbd, AUTHOR = {Fertin, G.}, JOURNAL = {Theoretical Computer Science}, TITLE = {On the Structure of Minimum Broadcast Digraphs}, YEAR = {2000}, VOLUME = {245(2)}, PAGES = {203-216} } @Article{annex-fertin, AUTHOR = {Fertin, G.}, JOURNAL = {Discrete Mathematics}, TITLE = {A Study of Minimum Gossip Graphs}, YEAR = {2000}, VOLUME = {215(1-3)}, PAGES = {33-57} } @TechReport{berdardel00, author = {Bermond, Jean-Claude and Darrot, Éric and Delmas, Olivier}, title = {Design of fault-tolerant networks on satellites ({TWTA} redundancy)}, institution = {Laboratoire Bordelais de Recherche en Informatique (LaBRI), Joint unit of the CNRS (UMR 5800)}, year = 2000, type = {Research Report}, number = {1243-00}, address = {Université Bordeaux 1, France} } @InProceedings{ToPla, author = {O. Togni}, title = {Placement de Convertisseurs de longueur d'onde dans les réseaux optiques}, booktitle = {Proceedings of Algotel'00}, year = 2000 } @Article{ToCom, author = {O. Togni}, title = {Irregularity strength and Compound Graphs}, journal = "Discrete Math.", volume = 218, number = "1-3", pages = "235--243", year = 2000 } @ARTICLE{a:BKRS00, author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = "Acyclic k-strong hypergraph coloring of maps on surfaces", journal = {Mathematical Note}, year = "2000", volume= "67(1-2)", pages= "29-35" } @ARTICLE{a:HNRS00, author = "P. {Hell} and J. {Nesetril} and A. {Raspaud} and E. {Sopena}", title = "Three-and-more set theorems", journal = {Comment. Math. Univ. Carolinae}, year = "2000", volume= "41(4)", pages= "7793-801" } @TechReport{recogn, AUTHOR = "G.~{Fertin} and A.~{Raspaud}", TITLE = {Recognizing Recursive Circulant Graphs {$G(cd^m,d)$}}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {2000}, TYPE = {{Research Report}}, NUMBER = {RR-1235-00}, NOTE = {Submitted for publication} } @BOOK{b:AR2000, AUTHOR = { Raspaud, Andr{\'e}}, TITLE = {Proceedings of the Workshop ALTEC-KIT, Saarbr\"ucken, May 1997}, PUBLISHER = {Theoretical Computer Science}, VOLUME ="245", YEAR = {2000} } @ARTICLE{a:RuBKRS00, author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = " Acyclic Coloring of 1-Planar Graphs (Russian).", journal = {Diskretn. Anal. Issled. Oper. Ser.1}, year = "2000", volume= "6", pages= "20-35" } @Article{a:HNRS00, author = "P. {Hell} and J. {Ne\v set\v ril} and A. {Raspaud} and E. {Sopena}", title = "Three and more Set Theorems", journal = "Comment. Math. Univ. Carolin.", year = {2000}, volume = "41", pages = "793-801" } @ARTICLE{a:nesra98, author = "J. {Ne\v set\v ril} and A. {Raspaud}", title = "Colored Homomorphisms of Colored Mixed Graphs.", journal ={J. Combin. Theory Ser. B}, volume="80", year= "2000", pages="147-155" } @ARTICLE{a:BKRS00, author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = " Acyclic k-strong hypergraph coloring of maps on surfaces. ", journal = {Mathematical Note}, year = "2000", volume= "67, No. 1", pages= "29-35" } @Manual{Pecher:NFFinder, title = {NFFinder}, key = {NFFinder}, author = {A. Pêcher}, year = 2000 } @incollection {Pecher:2000:3b, AUTHOR = {Pêcher, A.}, TITLE = {Cayley partitionable graphs}, BOOKTITLE = {6th International Conference on Graph Theory (Marseille, 2000)}, SERIES = {Electron. Notes Discrete Math.}, VOLUME = {5}, PAGES = {4 pp. (electronic)}, PUBLISHER = {Elsevier}, ADDRESS = {Amsterdam}, YEAR = {2000}, MRCLASS = {05C25 (05C17)}, MRNUMBER = {1 969 973} } @TechReport{GKKPP00, author = {C. Gavoille and M. Katz and N. Katz and C. Paul and D. Peleg}, title = {Approximate Distance Labeling Scheme}, institution = {Université Bordeaux I, LaBRI}, year = 2000, number = {RR-1250-0} } @TechReport{HP00, author = {M. Habib and C. Paul}, title = {A new vertex splitting algorithm for cograph recognition}, institution = {LaBRI}, year = 2000, number = {RR-123800} } @Article{HMcCPV00, author = {M. Habib and R. McConnell and C. Paul and L. Viennot}, title = {Lex-BFS and Partition Refinement, with Applications to Transitive Orientation, Interval Graph Recognition and Consecutive Ones Testing}, journal = {Theoretical Computer Science}, year = 2000, volume = 234, pages = {59--84} } @Article{CDHP00, author = {D. Corneil and F. Dragan and M. Habib and C. Paul}, title = {Diameter Determination on Restricted Graph Families}, journal = {Discrete Applied Mathematics}, year = 2000, note = {To appear} } @ARTICLE{Gav00a, AUTHOR = {Gavoille, Cyril}, TITLE = {On the Dilation of Interval Routing}, JOURNAL = {The Computer Journal}, VOLUME = 43, NUMBER = 1, PAGES = {1-7}, YEAR = 2000, KEYWORDS = {interval routing} } @ARTICLE{Gav00, AUTHOR = {Gavoille, Cyril}, TITLE = {A Survey On Interval Routing}, JOURNAL = {Theoretical Computer Science}, VOLUME = 245, NUMBER = 2, PAGES = {217-253}, YEAR = 2000, KEYWORDS = {interval routing} } @TECHREPORT{FGM00, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Mans, Bernard}, TITLE = {Interval Routing Schemes Allow Broadcasting with Linear Message-Complexity}, INSTITUTION= {LRI}, ADDRESS = {Universit\'{e} Paris-Sud, 91405 Orsay cedex, France}, TYPE = {{Research Report}}, NUMBER = {LRI-1241}, MONTH = jan, YEAR = 2000, KEYWORDS = {interval routing, broadcast} } @TECHREPORT{CFG00, AUTHOR = {Cohen, Johanne and Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Recognizing {K}n{\"o}del and {F}ibonacci Graphs}, INSTITUTION= {LRI}, ADDRESS = {Universit\'{e} Paris-Sud, 91405 Orsay cedex, France}, NUMBER = {LRI-1238}, TYPE = {{Research Report}}, MONTH = jan, YEAR = 2000, KEYWORDS = {recognizing} } @TECHREPORT{BFGM00, AUTHOR = {Barri\`{e}re, Lali and Fraigniaud, Pierre and Gavoille, Cyril and Mans, Bernard}, TITLE = {Recognizing Abelian {C}ayley Colored Digraphs}, INSTITUTION= {LRI}, ADDRESS = {Universit\'{e} Paris-Sud, 91405 Orsay cedex, France}, TYPE = {{Research Report}}, NUMBER = {LRI-1242}, MONTH = jan, YEAR = 2000, KEYWORDS = {cayley, recognizing} } @TechReport{recogn, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Recognizing Recursive Circulant Graphs {$G(cd^m,d)$}}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {2000}, TYPE = {{Research Report}}, NUMBER = {RR-1235-00} } %------ 1999 --------------------------------------------------------- @ARTICLE{GP99, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {The Compactness of Interval Routing}, JOURNAL = {SIAM Journal on Discrete Mathematics}, VOLUME = 12, NUMBER = 4, PAGES = {459-473}, MONTH = oct, YEAR = 1999, KEYWORDS = {interval routing, compact routing} } @BOOK{b:BGR99, AUTHOR = {Bermond, Jean-Claude and Gavoille, Cyril and Raspaud, Andr{\'e}}, TITLE = {Proceedings of the $6^{th}$ International Colloquium on Structural Information \& Communication Complexity, SIROCCO 6}, PUBLISHER = {Carleton Scientific}, MONTH = jul, YEAR = {1999} } @INPROCEEDINGS{GH99, AUTHOR = {Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {Compact Routing Tables for Graphs of Bounded Genus}, BOOKTITLE = {$26^{th}$ International Colloquium on Automata, Languages and Programming (ICALP)}, EDITOR = {Wiedermann, Ji\v{r}\'{\i} and van Emde Boas, Peter and Nielsen, Mogens}, PUBLISHER = {Springer}, VOLUME = {1644 of Lecture Notes in Computer Science}, PAGES = {351-360}, MONTH = jul, YEAR = 1999, KEYWORDS = {compact routing} } @BOOK{GBR99, AUTHOR = {Gavoille, Cyril and Bermond, Jean-Claude and Raspaud, Andr{\'e}}, TITLE = {Proceedings of the $6^{th}$ International Colloquium on Structural Information \& Communication Complexity, SIROCCO 6}, PUBLISHER = {Carleton Scientific}, ISBN = {1-894145-04-6}, MONTH = jul, YEAR = 1999, KEYWORDS = {misc graph} } @INPROCEEDINGS{CFG99, AUTHOR = {Cohen, Johanne and Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Recognizing Bipartite Incident-Graphs of Circulant Digraphs}, BOOKTITLE = {$25^{th}$ International Workshop on Graph-Theoretic Concepts in Computer Science (WG)}, PUBLISHER = {Springer}, EDITOR = {Widmayer, Peter and Neyer, Gabriele and Eidenbenz, Stephan}, VOLUME = {1665 of Lecture Notes in Computer Science}, PAGES = {215-227}, MONTH = jun, YEAR = 1999, KEYWORDS = {recognizing} } @INPROCEEDINGS{GH99b, AUTHOR = {Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {Routage compact dans les r\'eseaux de genre born\'e}, BOOKTITLE = {$1^{\mbox{\`ere}}$ Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel)}, PUBLISHER = {INRIA}, PAGES = {1-5}, MONTH = may, YEAR = 1999, KEYWORDS = {compact routing} } @TECHREPORT{GH99a, AUTHOR = {Gavoille, Cyril and Hanusse, Nicolas}, TITLE = {Compact Routing Tables for Graphs of Bounded Genus}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1213-99}, MONTH = feb, YEAR = 1999, KEYWORDS = {compact routing} } @InProceedings{fertin-troff, AUTHOR = {Fertin, G.}, TITLE = {Trade-Offs for Odd Gossiping}, BOOKTITLE = {6th International Colloquium on Structural Information and Communication Complexity (SIROCCO '99)}, VOLUME = {6}, SERIES = {Proceedings in Informatics}, PAGES = {137-151}, YEAR = {1999}, PUBLISHER = {Carleton Scientific} } @InProceedings{routing, AUTHOR = {Baudon, O. and Fertin, G. and Havel, I.}, TITLE = {Routing Permutations in the Hypercube}, BOOKTITLE = {25th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '99)}, YEAR = {1999}, PUBLISHER = {Springer-Verlag}, VOLUME = {1665 of Lecture Notes in Computer Science}, PAGES = {179-190} } @PhdThesis{fertin_thesis, AUTHOR = {Fertin, G.}, SCHOOL = {Universit\'e Bordeaux I}, TITLE = {{\'E}tude des Communications dans les R\'eseaux d'Interconnexion}, YEAR = {1999} } @InProceedings{ARO99, author = {D. Amar and A. Raspaud and O. Togni}, title = {All-to-all Wavelength-routing in all-optical compound networks}, booktitle = {Proceedings of the Fifth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications}, year = 1999, publisher = {Elsevier}, note = {To be published in Discrete Math.} } @Unpublished{ToCir, author = {O. Togni}, title = {All-to-all communication in All-optical Circulant Networks}, note = {Submitted}, year = 1999 } @InCollection{p:LMS99, author= "I. {Litovsky} and Y.{M\'etivier} and E. {Sopena}", title = "Graph relabelling systems and distributed algorithms", booktitle = "Handbook of graph grammars and computing by graph transformation", year = "1999", publisher = "World Scientific", editor="H.~{Ehrig} and H.-J.~{Kreowski} and U.~{Montanari} and G.~{Rozenberg}", volume = "3", pages = "1-56" } @ARTICLE{a:BKRS99, author = "O.V.~{Borodin} and A.V.~{Kostochka} and A.~{Raspaud} and E.~{Sopena}", title = "Acyclic colouring of 1-planar graphs", journal = {Discrete Analysis and Operations Research}, year = "1999", volume= "6(4)", pages= "20-35" } @Article{a:BSV99, author= "P. {Boiron} and E. {Sopena} and L. {Vignal}", title = "Acyclic improper colourings of graphs", journal= "J. Graph Theory", year = "1999", volume = "32", pages = "97-107" } @TechReport{d:NS99, author = "J. {Nesetril} and E. {Sopena}", title = "On four coloring problems", Institution = "LaBRI, Universit\'e Bordeaux~1", year = "1999", } @ARTICLE{a:BKNRS99, author = "O.V.~{Borodin} and A.V.~{Kostochka} and J. {Nesetril} and A.~{Raspaud} and E.~{Sopena}", title = "On the maximum average degree and the oriented chromatic number of a graph", journal = {Discrete Math.}, year = "1999", volume= "206", pages= "77-89" } @ARTICLE{RN99, AUTHOR = "J.~{Ne\v set\v ril} and A.~{Raspaud} ", JOURNAL = {Texte \'ecrit pour l'Ecole de Printemps en Combinatoire (Borov\'a Lada). KAM-DIMATIA Series (Prague) }, TITLE = {Duality, Nowhere-Zero Flows, Coloring and Cycle covers}, VOLUME ="99-442", YEAR = {1999} } @InProceedings{p:ARO99, author = {D. Amar and A. Raspaud and O. Togni}, title = {All-to-all Wavelength-routing in all-optical compound networks}, booktitle = {Proceedings of the 5-Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Prague July 6-11, 1998}, year = 1999, publisher = {Elsevier}, note = {To appear in Discrete Math.} } @ARTICLE{a:NESRAS99, author = "J.~{Ne\v set\v ril} and A.~{Raspaud} ", title = " Antisymmetric Flows and Strong Colourings of Oriented Graphs.", journal = {Annales de l'Institut Fourier}, year = "1999", volume= "49", pages= "1037-1056" } @ARTICLE{a:BKRS96a, author = "O.V.~{Borodin} and A.V.~{Kostochka} and J.~{Ne\v set\v ril} and A.~{Raspaud} and E.~{Sopena}", title = "On the Maximal Average Degree and the Oriented Chromatic Number of a Graph.", journal = {Discrete Math.}, year = "1999", volume= "206", pages= "77-89" } @TechReport{fertin-mgd, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Minimum Gossip Digraphs}, INSTITUTION = {Laboratoire Bordelais de Recherche en Informatique}, YEAR = {1999}, TYPE = {{Research Report}}, NUMBER = {RR-1223-99}, {ftp://ftp.labri.u-bordeaux.fr/pub/Local/Info/Publications/Rapports-internes/RR-122399.ps.gz} } @TechReport{HPV99b, author = {M. Habib and C. Paul and L. Viennot}, title = {Linear time recognition of $P_4$-indifference graphs}, institution = {INRIA}, year = 1999, number = 3779, note = {To appear in DMTCS} } @Article{HPV99, author = {M. Habib and C. Paul and L. Viennot}, title = {Partition refinement: an interested algorithmic tool kit}, journal = {International Journal of Foundation of Computer Science}, year = 1999, volume = 10, number = 2, pages = {147--170} } @Article{DGP99, author = {G. Damiand and M. Habib and C. Paul}, title = {A simple paradigm for graph recognition: application to cographs and distance hereditary graphs}, journal = {Theoretical Computer Science}, year = 1999, note = {To appear} } @InProceedings{BFH99, author = {Baudon, O. and Fertin, G. and Havel, I.}, title = {Routing Permutations in the Hypercube}, booktitle = {25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'99}, pages = {179-190}, year = {1999}, volume = {1665}, series = {Lecture Notes in Computer Science}, publisher = {Springer-Verlag} } @TechReport{fertin-mgd, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Minimum Gossip Digraphs}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {1999}, TYPE = {{Research Report}}, NUMBER = {RR-1223-99} } @TechReport{tradeoffs, AUTHOR = {Fertin, G.}, TITLE = {Trade-Offs for Odd Gossiping}, INSTITUTION = {LaBRI, Universit\'e Bordeaux 1}, YEAR = {1999}, TYPE = {{Research Report}}, NUMBER = {RR-1216-99}, NOTE = {Submitted for publication} } @InProceedings{fertin-algotel99, AUTHOR = {Fertin, G.}, TITLE = {Compromis pour l'\'Echange Total Impair}, BOOKTITLE = {1\`eres Rencontres Francophones sur les Aspects Algorithmiques des T\'el\'ecommunications (AlgoTel '99)}, PAGES = {47-52}, YEAR = {1999}, PUBLISHER = {INRIA} } %------ 1998 --------------------------------------------------------- @Article{ bddp98b, author = {Bermond, Jean-Claude and Darrot, Éric and Delmas, Olivier and Perennes, St\'ephane}, title = {Hamilton cycle decomposition of the {B}utterfly network}, journal = {Parallel Processing Letters}, year = 1998, volume = 8, number = 3, month = sep, pages = {371--385}, OPTannote = {ISSN: 0219-6264}, abstract = {In this paper, we prove that the wrapped Butterfly graph (undirected graph) WBF(d,n) of degree d and dimension n is decomposable into Hamilton cycles. This answers a conjecture of D. Barth and A. Raspaud who solved the case d=2}, keywords = {Butterfly graph, graph theory, Hamilton decomposition, Hamilton cycle, Hamilton circuit, perfect matching} } @INPROCEEDINGS{GP98a, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {The Compactness of Interval Routing for Almost All Graphs}, BOOKTITLE = {$12^{th}$ International Symposium on Distributed Computing (DISC)}, EDITOR = {Kutten, Shay}, PUBLISHER = {Springer}, VOLUME = {1499 of Lecture Notes in Computer Science}, PAGES = {161-174}, MONTH = sep, YEAR = 1998, KEYWORDS = {interval routing, compact routing} } @INPROCEEDINGS{EGP98a, AUTHOR = {Eilam, Tamar and Gavoille, Cyril and Peleg, David}, TITLE = {Compact Routing Schemes With Low Stretch Factor}, BOOKTITLE = {$17^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, PAGES = {11-20}, MONTH = aug, YEAR = 1998, KEYWORDS = {compact routing, interval routing} } @INPROCEEDINGS{FG98b, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {A Theoretical Model for Routing Complexity}, BOOKTITLE = {$5^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Gargano, Luisa and Peleg, David}, PUBLISHER = {Carleton Scientific}, PAGES = {98-113}, MONTH = jul, YEAR = 1998, KEYWORDS = {compact routing} } @InProceedings{ del98, author = {Delmas, Olivier}, title = {Trade-off for broadcast protocols}, booktitle = {Proceedings of 5th International Colloquium on Structural Information and Communication Complexity (SIROCCO 5)}, editor = {Gargano, Luisa and Peleg, David}, series = {Proceedings in informatics 3}, year = 1998, publisher = {Carleton Scientific}, month = jun, pages = {36--50} } @Article{ bddp98a, Author = {Bermond, Jean-Claude and Darrot, Éric and Delmas, Olivier and Perennes, St\'ephane}, Title = {Hamilton circuits in the directed {B}utterfly network}, Journal = {Discrete Applied Mathematics}, Volume = 84, Number = {1--3}, Pages = {21--42}, Month = may, Year = 1998 } @TECHREPORT{GP98, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {The Compactness of Interval Routing for Almost All Graphs}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1202-98}, MONTH = apr, YEAR = 1998, KEYWORDS = {interval routing, compact routing} } @InProceedings{petersfertinodd, AUTHOR = {Fertin, G. and Peters, J.G.}, TITLE = {Odd Gossiping in the Linear Cost Model}, BOOKTITLE = {Workshop on Communication - 23rd Int. Symp. on Mathematical Foundations of Computer Science (MFCS '98)}, YEAR = {1998} } @InProceedings{famfertin, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Families of Graphs having Broadcasting and Gossiping Properties}, BOOKTITLE = {24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98)}, YEAR = {1998}, PUBLISHER = {Springer-Verlag}, VOLUME = {1517 of Lecture Notes in Computer Science}, PAGES = {63-77} } @Article{a:A98a, author = "D. {Amar} and O. {Togni}", title = "Irregularity strengh of trees", journal= {Discrete Math.}, year = "1998", volume= "190", pages= "15-38" } @Article{a:ABO98a, author = "D. {Amar} and S. {Brandt} and D. {Brito} and O. {Ordaz} ", title = "Neighborhood conditions for independent sets in bipartite graphs", journal= {Discrete Math.}, year = "1998", volume= "181", pages= "31-36" } @Article{AT98, author = {D. Amar and O. Togni}, title = {Irregularity strength of trees}, year = 1998, journal = "Discrete Math.", volume = 190, number = "1-3", pages = "15--38" } @InProceedings{ToInf, author = {O. Togni}, title = {Optical All-to-all communication in inflated networks}, booktitle = {Proc. of the 5th annual International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98}, year = 1998, series = {Lecture Notes in Computer Science}, publisher = {Springer Verlag}, OPTpages = {78--87}, OPTvolume = {1517} } @PhdThesis{OT98, author = {O. Togni}, title = {Force des graphes -- Indice optique des r\'eseaux}, school = {Universit\'e de Bordeaux~I}, year = {Octobre 1998} } @ARTICLE{a:BKNRS98, author = "O.V.~{Borodin} and A.V.~{Kostochka} and J. {Nesetril} and A.~{Raspaud} and E.~{Sopena}", title = "On universal graphs for planar oriented graphs of a given girth", journal = {Discrete Math.}, year = "1998", volume= "188", pages= "73-85" } @ARTICLE{a:CFKR98, author ="J.~{Cohen} and P.~ {Fraigniaud} and J.-C.~{Konig} and A.~{Raspaud}", title="Optimized Broadcasting and Multicasting Protocols in Cut-Through Routed Networks.", journal = {IEEE Transactions on Parallel and Distributed Systems}, year="1998", volume= "9", pages="788-802" } @ARTICLE{a:BKRS96b, author = "O.V.~{Borodin} and A.V.~{Kostochka} and J.~{Ne\v set\v ril} and A.~{Raspaud} and E.~{Sopena}", title = "On universal graphs for planar oriented graphs of a given girth.", journal = {Discrete Math.}, year = "1998", volume= "188", pages= "73-85" } @InProceedings{famfertin, AUTHOR = {Fertin, G. and Raspaud, A.}, TITLE = {Families of Graphs having Broadcasting and Gossiping Properties}, BOOKTITLE = {24th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '98)}, YEAR = {1998}, PUBLISHER = {Springer-Verlag}, VOLUME = {1517 of Lecture Notes in Computer Science}, PAGES = {63-77} } @InProceedings{GMR98, author = "G. {Gauyacq} and C.{ Micheneau} and A.{Raspaud} ", title = "Routing in recursive circulant graphs : edge-forwarding index and Hamiltonian decomposition", booktitle = {Graph-Theoretic Concepts in Computer Science, WG'98}, editor = {Juraj Hromkovic and Ondrej S\'ykora}, series = {Lecture Notes in Computer Science}, year = 1998, pages = {227-241} } @PhdThesis{Pau98, author = {C. Paul}, title = {Parcours en largeur lexicographique~: un algorithme de partitionnement, application aux graphes et généralisation}, school = {LIRMM, Université de Montpellier II}, year = 1998 } @InProceedings{HPV98, author = {M. Habib and C. Paul and L. Viennot}, title = {A synthesis on partition refinement: a useful routine for strings, graphs, boolean matrices and automata}, booktitle = {STACS 98}, number = 1373, series = {LNCS}, year = 1998, organization = {15th Symposium on Theoretical Aspect of Computer Science}, pages = {25--38} } @InProceedings{CDHP98, author = {D. Corneil and F. Dragan and M. Habib and C. Paul}, title = {Diameter Determination on Restricted Graph Families}, booktitle = {Graph-Theoretic Concepts in Computer Science, WG'98}, year = 1998, series = {Lecture Notes in Computer Science}, volume = 1517, organization = {24st Internationnal Workshop WG'98} } @ARTICLE{GG98, AUTHOR = {Gavoille, Cyril and Gu\'{e}vremont, Eric}, TITLE = {Worst Case Bounds For Shortest Path Interval Routing}, JOURNAL = {Journal of Algorithms}, VOLUME = 27, NUMBER = 1, PAGES = {1-25}, YEAR = 1998, KEYWORDS = {interval routing} } @ARTICLE{FG98a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Interval Routing Schemes}, JOURNAL = {Algorithmica}, VOLUME = 21, PAGES = {155-182}, YEAR = 1998, KEYWORDS = {interval routing} } @TECHREPORT{EGP98, AUTHOR = {Eilam, Tamar and Gavoille, Cyril and Peleg, David}, TITLE = {Compact Routing Schemes With Low Stretch Factor}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1195-98}, MONTH = jan, YEAR = 1998, KEYWORDS = {compact routing, interval routing} } @InProceedings{GMR98, author = "G. {Gauyacq} and C.{ Micheneau} and A.{Raspaud} ", title = "Routing in recursive circulant graphs : edge-forwarding index and Hamiltonian decomposition", booktitle = {Graph-Theoretic Concepts in Computer Science, WG'98}, editor = {Juraj Hromkovic and Ondrej Sijkora}, series = {Lecture Notes in Computer Science}, year = 1998, pages = {227-241} } @TechReport{pfodd2, AUTHOR = {Fertin, G. and Peters, J.G.}, TITLE = {Optimal Odd Gossiping}, INSTITUTION = {Simon Fraser University, Burnaby, B.C.}, YEAR = {1998}, TYPE = {{Research Report}}, NUMBER = {CMPT TR 1998-24}, NOTE = {Submitted for publication} } %------ 1997 --------------------------------------------------------- @TECHREPORT{GG97a, AUTHOR = {Gavoille, Cyril and Gengler, Marc}, TITLE = {Space-Efficiency of Routing Schemes of Stretch Factor Three}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1181-97}, MONTH = oct, YEAR = 1997, KEYWORDS = {compact routing} } @TECHREPORT{Gav97a, AUTHOR = {Gavoille, Cyril}, TITLE = {A Survey On Interval Routing Scheme}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1182-97}, MONTH = oct, YEAR = 1997, KEYWORDS = {interval routing} } @TECHREPORT{GP97, AUTHOR = {Gavoille, Cyril and Peleg, David}, TITLE = {The Compactness of Interval Routing}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1176-97}, MONTH = sep, YEAR = 1997, KEYWORDS = {interval routing, compact routing} } @INPROCEEDINGS{Gav97, AUTHOR = {Gavoille, Cyril}, TITLE = {On the Dilation of Interval Routing}, BOOKTITLE = {$22^{nd}$ International Symposium on Mathematical Foundations of Computer Science (MFCS)}, EDITOR = {Pr{\'{\i}}vara, Igor and Ru{\v{z}}i{\v{c}}ka, Peter}, PUBLISHER = {Springer}, VOLUME = {1300 of Lecture Notes in Computer Science}, PAGES = {259-268}, MONTH = aug, YEAR = 1997, DOI = {10.1007/BFb0029943}, KEYWORDS = {interval routing} } @INPROCEEDINGS{GG97, AUTHOR = {Gavoille, Cyril and Gengler, Marc}, TITLE = {Space-Efficiency of Routing Schemes of Stretch Factor Three}, BOOKTITLE = {$4^{th}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Krizanc, Danny and Widmayer, Peter}, PUBLISHER = {Carleton Scientific}, PAGES = {162-175}, MONTH = jul, YEAR = 1997, KEYWORDS = {compact routing} } @INPROCEEDINGS{i:Gav97, AUTHOR = {Gavoille, Cyril}, TITLE = {Compact Routing: Lower Bounds Techniques (invited lecture)}, BOOKTITLE = {International Research School on "Sense of Direction and Compact Routing"}, LOCATION = {Siena, Italy}, MONTH = jun, YEAR = 1997, KEYWORDS = {interval routing} } @Article{delper97, author = {Delmas, Olivier and Perennes, St\'ephane}, title = {Diffusion par commutation de circuits dans les tores de dimension $k$ / {C}ircuit-switched broadcasting in the $k$-dimensional torus networks}, journal = {Technique et science informatiques}, year = 1997, volume = 16, number = 5, pages = {563-581}, note = {RAIRO, afcet, Herm\`es.} } @PhDThesis{ del97, author = {Delmas, Olivier}, title = {Communications par commutation de circuits dans les r\'eseaux d'interconnexion}, school = {Universit\'e de Nice - Sophia Antipolis, U.F.R. de Sciences, \'Ecole doctorale sciences pour l'ing\'enieur}, month = jan, year = 1997, address = {France}, type = {Th\`ese de doctorat}, OPTissn_isbn = {2 - 7261 - 1066 - 5 * TU - 453 *} } @InProceedings{OT97, author = {O. Togni}, title = {Irregularity strength of the toroidal grid}, booktitle = {5i\`eme Colloque International de Th\'eorie des Graphes et Combinatoire, Luminy}, pages = {609--620}, year = 1997, volume = {165-166}, series = {Discrete Math.}, publisher = {Elsevier} } @Article{a:NSV97, author = "J. {Nesetril} and E. {Sopena} and L. {Vignal}", title = "T-preserving homomorphisms of oriented graphs", journal = "Comment. Math. Univ. Carolinae", year = "1997", volume = "38-1", pages = "125-136" } @Article{a:NRS97, author = "J. {Nesetril} and A. {Raspaud} and E. {Sopena}", title = "Colorings and girth of oriented planar graphs", journal = "Discrete Math.", year = {1997}, volume = "165-166", pages = "519-530" } @InProceedings{p:BSV97, author= "P. {Boiron} and E. {Sopena} and L. {Vignal}", title = "Acyclic improper colourings of graphs with bounded degree", booktitle = "Proc. DIMACS/DIMATIA Conf. Contemporary trends in Discrete Math., Dimacs Series in Discrete Math. and Theoret. Comput.Sci.", year = "1997", volume = "49", pages = "1-10" } @InProceedings{p:KLSS97, author= "A. V. {Kostochka} and T. {Luczak} and G. {Simonyi} and E. {Sopena}", title = "On the minimum number of edges giving maximum oriented chromatic number", booktitle = "Proc. DIMACS/DIMATIA Conf. Contemporary trends in Discrete Math., Dimacs Series in Discrete Math. and Theoret. Comput. Sci.", year = "1997", volume = "49", pages = "179-182" } @ARTICLE{a:MS97, author = "Y. {M\'etivier} and E. {Sopena}", title = "Graph relabelling systems: a general overview", journal = {Computers and Artificial Intelligence}, year = "1997", volume= "16(2)", pages= "167-185" } @Article{a:KSZ97, author = "A.V. {Kostochka} and E. {Sopena} and X. {Zhu}", title = "Acyclic and oriented chromatic numbers", journal = "J. Graph Theory", year = {1997}, volume = "24(4)", pages = "331-340" } @Article{a:S97, author = "E. {Sopena}", title = "The chromatic number of oriented graphs", journal = "J. Graph Theory", year = {1997}, volume = "25", pages = "191-205" } @Article{d:nrs95, author = "J. {Ne\v set\v ril} and A. {Raspaud} and E. {Sopena}", title = "Colorings and girth of oriented planar graphs", journal = "Discrete Math.", year = {1997}, volume = "165-166", pages = "519-530" } @ARTICLE{a:RL94a, author = "R. {Labahn} and A. {Raspaud} ", title = "Periodic Gossiping in Back-To-Back Trees", journal = {Discrete Applied Math.}, year = "1997" , volume= "75", pages= "157-168" } @Article{HMcCPV97, author = {M. Habib and R. McConnell and C. Paul and L. Viennot}, title = {Lex-BFS and Partition Refinement, with Applications to Transitive Orientation, Interval Graph Recognition and Consecutive Ones Testing}, journal = {Theoretical Computer Science}, year = 1997, note = {To appear} } @ARTICLE{FG97, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Universal Routing Schemes}, JOURNAL = {Distributed Computing}, PUBLISHER = {Springer-Verlag}, VOLUME = 10, PAGES = {65-78}, YEAR = 1997, KEYWORDS = {compact routing} } @Article{Gau97a, author = "G. {Gauyacq} ", title = "On quasi-Cayley graphs", journal = "Discrete Applied Math.", year = "1997", volume = "77", pages = "43-58" } @Article{Gau97b, author = "G. {Gauyacq} ", title = "Edge-forwarding index of star graphs and other Cayley graphs", journal = "Discrete Applied Math.", year = "1997", volume = "80", pages = "149-160" } %------ 1996 --------------------------------------------------------- @TECHREPORT{Gav96c, AUTHOR = {Gavoille, Cyril}, TITLE = {On Dilation of Interval Routing}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1145-96}, YEAR = 1996, MONTH = nov, KEYWORDS = {interval routing} } @TECHREPORT{Gav96b, AUTHOR = {Gavoille, Cyril}, TITLE = {Lower Bounds for Interval Routing on Bounded Degree Networks}, INSTITUTION= {LaBRI}, ADDRESS = {University of Bordeaux~1, 351, cours de la Lib\'{e}ration, 33405 Talence Cedex, France}, TYPE = {{Research Report}}, NUMBER = {RR-1144-96}, NOTE = {Submitted for publication}, MONTH = oct, YEAR = 1996, KEYWORDS = {interval routing} } @inproceedings{ delper96c, author = {Delmas, Olivier and Perennes, St\'ephane}, booktitle = {Proceedings of the Euro-Par'96 Parallel Processing / Second International EURO-PAR Conference}, title = {{Circuit-Switched Gossiping in 3-Dimensional Torus Networks}}, editor = {Boug\'e, L. and Fraigniaud, P. and Mignotte, A. and Robert, Y.}, publisher = {Springer Verlag}, series = {Lecture Notes in Computer Science}, pages = {370-373}, volume = 1123, address = {Lyon, France}, month = aug, year = 1996, note = {(Version \'etendue disponible en rapport de recherche 2930 de l'Unit\'e de recherche INRIA Sophia Antipolis - Juillet 1996, France.)} } @INPROCEEDINGS{GP96, AUTHOR = {Gavoille, Cyril and P\'{e}renn\`{e}s, St\'{e}phane}, TITLE = {Lower Bounds for Interval Routing on $3$-Regular Networks}, BOOKTITLE = {$3^{rd}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, EDITOR = {Santoro, Nicola and Spirakis, Paul}, PUBLISHER = {Carleton University Press}, PAGES = {88-103}, MONTH = jun, YEAR = 1996, KEYWORDS = {interval routing} } @INPROCEEDINGS{FG96a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Local Memory Requirement of Universal Routing Schemes}, BOOKTITLE = {$8^{th}$ Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)}, PUBLISHER = {ACM Press}, PAGES = {183-188}, MONTH = jun, YEAR = 1996, KEYWORDS = {compact routing} } @Inproceedings{ delper96a, author = {Delmas, Olivier and Perennes, St\'ephane}, booktitle = {Proceedings of the 8th RenPar Conference}, title = {Diffusion en mode commutation de circuits}, year = 1996, pages = {53--56}, editor = {Castanet, R. and Roman, J.}, month = may, address = {Bordeaux, France} } @INPROCEEDINGS{GP96b, AUTHOR = {Gavoille, Cyril and P\'{e}renn\`{e}s, St\'{e}phane}, TITLE = {Memory Requirement for Routing in Distributed Networks}, BOOKTITLE = {$15^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, PAGES = {125-133}, YEAR = 1996, MONTH = may, KEYWORDS = {compact routing} } @TECHREPORT{GP96a, AUTHOR = {Gavoille, Cyril and P\'{e}renn\`{e}s, St\'{e}phane}, TITLE = {Lower Bounds for Shortest Path Interval Routing}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, TYPE = {{Research Report}}, NUMBER = {96-08}, MONTH = apr, YEAR = 1996, KEYWORDS = {interval routing} } @Article{a:RAO96a, author = "D. {Amar} and O. {Ordaz} and A. {Raspaud} ", title = "Hamiltonian properties and the bipartite independence number ", journal = "Discrete Math.", year = "1996", volume= "161", pages= "207-215" } @ARTICLE{a:S96, author = "E. {Sopena}", title = "Expanding graph relabeling systems have the power of recursive enumerability", journal = {Fundamentae Informatica}, volume = "27(1)", pages = "1-26", year = "1996" } @TechReport{d:SV96, author = "E. {Sopena} and L. {Vignal}", title = "A note on the chromatic number of graphs with maximum degree three", Institution = "LaBRI, Universit\'e Bordeaux~1", year = "1996", number = {1125-96} } @ARTICLE{a:LMS96, author = "I. {Litovsky} and Y.{M\'etivier} and E. {Sopena}", title = "Checking global graph properties by means of local computations: the majority problem", journal = {Electronic Notes in Comput. Sci.}, year = "1996", volume= "2", } @Article{a:RAO96a, author = "D. {Amar} and O. {Ordaz} and A. {Raspaud} ", title = "Hamiltonian properties and the bipartite independence number ", journal = "Discrete Math.", year = "1996", volume= "161", pages= "207-215" } @Article{BL96, author = "Baudon, O. and Laborde, J.-M.", title = "Cabri-graph, a Sketchpad for Graph Theory", journal = "Mathematics and Computers in Simulation", year = "1996", volume = "1340", pages = "1-10" } @InProceedings{c:Micheneau1_96, author = "C. {Micheneau}", title = "GRIAP : a new way to develop communication schemes in interconnection networks", booktitle = "Proceedings de Parco 95", year = "1996", note = "A para\^{\i}tre" } @PhdThesis{t:mich96, type = "Th\`ese de Doctorat", author = "C. {Micheneau}", title = "Graphes r\'ecursifs circulants, communications vagabondes et simulation", school = "Universit\'e Bordeaux I", year = "1996" } @PHDTHESIS{Gav96, AUTHOR = {Gavoille, Cyril}, TITLE = {Complexit\'{e} m\'{e}moire du routage dans les r\'{e}seaux distribu\'{e}s}, SCHOOL = {{\'E}cole {N}ormale {S}up\'{e}rieure de {L}yon}, ADDRESS = {46, all\'{e}e d'{I}talie}, MONTH = jan, YEAR = 1996, KEYWORDS = {compact routing, interval routing} } @TECHREPORT{FG96, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Local Memory Requirement of Universal Routing Schemes}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, TYPE = {{Research Report}}, NUMBER = {96-01}, MONTH = jan, YEAR = 1996, KEYWORDS = {compact routing} } %------ 1995 --------------------------------------------------------- @TECHREPORT{GP95a, AUTHOR = {Gavoille, Cyril and P\'{e}renn\`{e}s, St\'{e}phane}, TITLE = {Memory Requirement for Routing in Distributed Networks}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, TYPE = {{Research Report}}, NUMBER = {95-46}, MONTH = dec, YEAR = 1995, KEYWORDS = {compact routing} } @TechReport{GHP95b, author = {P. Galinier and M. Habib and C. Paul}, title = {Maximal Intersection Search: a new algorithm for chordal graph recognition}, institution = {LIRM Montpellier}, year = 1995, adress = {161 rue Ada, 34392 Montpellier Cedex 5}, number = 95044, month = {October} } @TECHREPORT{GP95, AUTHOR = {Gavoille, Cyril and P\'{e}renn\`{e}s, St\'{e}phane}, TITLE = {Routing Memory Requirement for Distributed Networks}, INSTITUTION= {I3S}, ADDRESS = {Universit\'{e} de Nice-Sophia Antipolis, 06903 Sophia Antipolis, France}, TYPE = {{Research Report}}, NUMBER = {95-37}, MONTH = aug, YEAR = 1995, KEYWORDS = {compact routing} } @INPROCEEDINGS{FG95a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Memory Requirement for Universal Routing Schemes}, BOOKTITLE = {$14^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, PAGES = {223-230}, MONTH = aug, YEAR = 1995, KEYWORDS = {compact routing} } @InProceedings{GHP95, author = {P. Galinier and M. Habib and C. Paul}, title = {Chordal graphs and their clique graph}, booktitle = {Graph-Theoretic Concepts in Computer Science, WG'95}, editor = {M. Nagl (Ed.)}, volume = 1017, series = {Lecture Notes in Computer Science}, year = 1995, organization = {21st Internationnal Workshop WG'95}, publisher = {Springer}, address = {Aachen, Germany}, month = {June}, pages = {358--371} } @INPROCEEDINGS{GG95a, AUTHOR = {Gavoille, Cyril and Gu\'{e}vremont, Eric}, TITLE = {On the Compactness of Bounded Degree Graphs for Shortest Path Interval Routing}, BOOKTITLE = {$2^{nd}$ International Colloquium on Structural Information \& Communication Complexity (SIROCCO)}, PUBLISHER = {Carleton University Press}, PAGES = {113-121}, MONTH = jun, YEAR = 1995, KEYWORDS = {interval routing} } @TECHREPORT{FG95, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Memory Requirement for Universal Routing Schemes}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, TYPE = {{Research Report}}, NUMBER = {95-05}, MONTH = mar, YEAR = 1995, KEYWORDS = {compact routing} } @MastersThesis{Fer95DEA, author = "Fertin, G.", title = "Etude des Graphes Minimaux pour l'\'Echange Total", school = "DEA Informatique, Universit\'e Bordeaux 1", year = "1995" } @InProceedings{p:AS95, author= "V. {Albiero} and E. {Sopena}", title = "Combinatorial construction of time-stamp systems", booktitle = "Proc. Formal Power Series and Algebraic Combinatorics, FPSAC'95", year = "1995", } @ARTICLE{a:LMS95, author = "I. {Litovsky} and Y.{M\'etivier} and E. {Sopena}", title = "Different local controls for graph relabeling systems", journal = {Math. Systems Theory}, year = "1995", volume= "28", pages= "41-65" } @PhdThesis{t:Bel95b, type = "Th\`ese de Doctorat", author = "A. {Bel Hala} ", title = "Communications dans les r\'eseaux d'interconnexion : plongements optimaux de l'hypercube", school = "Universit\'e Bordeaux I", year = "1995" } @ARTICLE{a:bprr95, AUTHOR = {D. {Barth} and F. {Pellegrini} and A. {Raspaud} and J. {Roman}}, JOURNAL = {RAIRO}, PAGES = {487-508}, TITLE = {On bandwidth, cutwidth and quotient graphs}, VOLUME = {29}, YEAR = {1995} } @ARTICLE{a:bbr95, AUTHOR = {D. {Barth} and J. {Bond} and A. {Raspaud}}, JOURNAL = {Discrete Applied Math}, PAGES = {127-136}, TITLE = {Compatible eulerian circuits in K**}, VOLUME = {56}, YEAR = {1995} } @ARTICLE{a:rvs95, AUTHOR = {A. {Raspaud} and O. {S\'ykora} and I. {Vrt'o}}, JOURNAL = {RAIRO}, PAGES = {509-514}, TITLE = {Cutwidth of the de Bruijn graph}, VOLUME = {29}, YEAR = {1995} } @TechReport{d:Micheneau2_95, type = Ri, author = "C. {Micheneau}", title = "GRIAP : a new way to develop communication schemes in interconnection networks", institution = "LaBRI, Universit\'e Bordeaux I", year = "1995", number = "1097-95" } @TechReport{d:Micheneau1_95, type = Ri, author = "C. {Micheneau}", title = "Disjoint Hamiltonian cycles in recursive circulant graphs", institution = "LaBRI, Universit\'e Bordeaux I", year = "1995", number = "1080-95", note = "A para\^{\i}tre dans I.P.L." } @TECHREPORT{GG95, AUTHOR = {Gavoille, Cyril and Gu\'{e}vremont, Eric}, TITLE = {Worst Case Bounds For Shortest Path Interval Routing}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, TYPE = {{Research Report}}, NUMBER = {95-02}, MONTH = jan, YEAR = 1995, KEYWORDS = {interval routing} } @TechReport{d:A95a, type = Ri, author = "D. {Amar} and S. {Brandt} and {D. Brito} and O. {Ordaz}", title = "Neighborhood conditions for balanced independent sets in bipartite graphs", Institution = {Freie Universit\"at Berlin}, numero = "A95-27", year = "1995" } @PhdThesis{t:gg, type = "Th\`ese de Doctorat", author = "G. {Gauyacq}", title = "Routages uniformes dans les graphes sommet-transitifs", school = "Universit\'e Bordeaux I", year = "1995" } @Article{a:AFMa, author = "D. {Amar} and O. {Favaron} and P. {Mago} and O. {Ordaz}", title = "Biclosure and bistability in a balanced bipartite graph", journal = "Journal of Graph Theory", volume = "20", year = "1995", pages = "513-529" } %------ 1994 --------------------------------------------------------- @INPROCEEDINGS{FG94a, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Optimal Interval Routing}, BOOKTITLE = {Parallel Processing: CONPAR~'94 - VAPP~VI}, PUBLISHER = {Springer-Verlag}, EDITOR = {Buchberger, Bruno and Volkert, Jens}, VOLUME = {854 of Lecture Notes in Computer Science}, PAGES = {785-796}, MONTH = sep, YEAR = 1994, KEYWORDS = {interval routing} } @INPROCEEDINGS{FG94c, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {A Characterization of Networks supporting Linear Interval Routing}, BOOKTITLE = {$13^{th}$ Annual ACM Symposium on Principles of Distributed Computing (PODC)}, PUBLISHER = {ACM Press}, PAGES = {216-224}, MONTH = aug, YEAR = 1994, KEYWORDS = {interval routing} } @INPROCEEDINGS{Gav94, AUTHOR = {Gavoille, Cyril}, TITLE = {Routages efficaces et compacts}, ADDRESS = {LIP, \'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, BOOKTITLE = {$6^{\mbox{\`emes}}$ Rencontres Francophones du Parall\'{e}lisme (RenPar)}, EDITOR = {Luc Boug\'{e} and Michel Cosnard and Pierre Fraigniaud}, MONTH = jun, PAGES = {298}, YEAR = 1994, DATE = {7-10 juin 1994}, KEYWORDS = {interval routing, compact routing} } @Article{a:RS94, author = "A. {Raspaud} and E. {Sopena}", title = "Good and semi-strong colorings of oriented planar graphs", journal = "Information Processing Letters", year = "1994", volume = "51", pages = "171-174" } @Article{a:BR94a, author = "D. {Barth} and A. {Raspaud} ", title = "Two Disjoint Hamiltonian Cycles in the Butterfly Graph", journal = "Information Processing Letters", year = "1994", volume = "51", pages = "175-179" } @Book{l:Rum94a, author = "J. {de Rumeur} ", title = "Communication dans les r\'eseaux de processeurs", publisher = "Masson", year = "1994" } @Article{a:FR94, author= {G. Fan and A.Raspaud}, title= {Fulkerson's conjecture and circuit covers.}, journal= {J. Combin. Theory Ser. B}, volume="61", year= "1994", pages="133-138" } @InProceedings{c:BBMa, author = "D. {Barth} and A. {Bel Hala} and C. {Micheneau} ", title = "GRIAP : un logiciel d'aide \`a la mise au point d'algorithmes de communication dans les r\'eseaux d'interconnexion", pages = "213-216", year = "1994", booktitle = "RENPAR'6 " } @PhdThesis{t:Bar94b, type = "Th\`ese de Doctorat", author = "D. {Barth} ", title = "R\'eseaux d'interconnexion : structures et communications", school = "Universit\'e Bordeaux I", year = "1994" } @InProceedings{i:Bar94a, author = "D. {Barth}", title = "Embedding by exclusions", year = "1994", booktitle = "DIMACS Workshop Proposal : Interconnection Networks and Mapping and Scheduling Parallel Computations, Rutgers University" } @TECHREPORT{FG94, AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril}, TITLE = {Interval Routing Schemes}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, TYPE = {{Research Report}}, NUMBER = {94-04}, MONTH = jan, YEAR = 1994, KEYWORDS = {interval routing} } %------ 1993 --------------------------------------------------------- @InProceedings{Bau93b, author = "Baudon, O.", title = "Le projet {GSK}", year = "1993", organization = "Journ\'ees GDR-Programmation", address = "Orsay", month = "Novembre" } @ARTICLE{DGJP93a, AUTHOR = {Desprez, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Jargot, Bruno and Pourzandi, Makan}, TITLE = {Tests des performances des communications de la machine {V}olvox~{IS}-860}, JOURNAL = {La lettre du Transputer et des Calculateurs Parall\`{e}les}, VOLUME = 19, PAGES = {11-35}, MONTH = oct, YEAR = 1993, KEYWORDS = {routing, parallel} } @MASTERSTHESIS{Gav93, AUTHOR = {Gavoille, Cyril}, TITLE = {Routage par Intervalles}, SCHOOL = {\'{E}cole Normale Sup\'{e}rieure de Lyon}, ADDRESS = {69364 Lyon Cedex 07, France}, TYPE = {Stage de {DEA}}, DATE = {28 juin 1993}, MONTH = jun, YEAR = 1993, KEYWORDS = {interval routing} } @TECHREPORT{DGJP93, AUTHOR = {Desprez, Fr\'{e}d\'{e}ric and Gavoille, Cyril and Jargot, Bruno and Pourzandi, Makan}, TITLE = {Tests des performances des communications de la machine {V}olvox~{IS}-860}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, NUMBER = {93-02}, MONTH = mar, YEAR = 1993, KEYWORDS = {routing, parallel} } @TechReport{d:Bel93b, type = Ri, author = "A. {Bel Hala}", title = "Congestion Optimale du Plongement de l'Hypercube $H(n_1+n_2+...+n_d)$ dans la Grille \`a d dimensions $GR(2^{n_1}, 2^{n_2},...,2^{n_d})$ ", institution = "LaBRI, Universit\'e Bordeaux I", year = "1993", number = "93-21", note = "Soumis pour publication." } @Article{a:Bel93a, author = "A. {Bel Hala}", title = "Congestion Optimale du Plongement de l'Hypercube $H(n)$ dans la Cha\^{\i}ne $P(2^n)$", journal = "Informatique th\'eorique et Applications", year = "1993", volume = "5", pages = "465--481" } @Article{a:R93, author = "A. {Raspaud}", title = "Good and semi-strong colorings of oriented planar graphs", journal = "Bulletin of the EATCS", year = "1993", volume = "50", pages = "260-263" } @Article{a:Ras93b, author = "A. {Raspaud} ", title = "Postman tours and cycle covers ", journal = "Discrete Math.", year = "1993", volume = "111", pages = "447-454" } @InProceedings{BL93, author = "Baudon, O. and Laborde, J.-M.", title = "Cabri-graph, a Sketchpad for Graph Theory", editor = "Jacob, G. and Oussous, N.E. and Steinberg, S.", pages = "50-55", booktitle = "IMACS Symposium on Symbolic Computation, New Trends and Developments", year = "1993" } @Article{a:Bar93a, author = "D. {Barth}", title = "Embedding meshes of d-ary trees into de {B}ruijn graphs", journal = "Parallel Processing Letters", year = "1993", volume = "3", number = "2", pages = "115-127" } @TechReport{d:ABO93c, type = Ri, author = "D. {Amar} and D. {Brito} and O. {Ordaz} ", title = "Hamiltonian cycles and hamiltonian-biconnectedness in bipartite digraphs", Institution = "LaBRI, Universit\'e Bordeaux I", year = "1993", note = "Soumis pour publication" } @TechReport{d:ABO93b, type = Ri, author = "D. {Amar} and D. {Brito} and O. {Ordaz} ", title = "Balanced bipartite sets and cycles in bipartite graphs", Institution = "LaBRI, Universit\'e Bordeaux I", year = "1993", note = "Soumis pour publication" } @TechReport{d:ABO93a, type = Ri, author = "D. {Amar} and D. {Brito} and O. {Ordaz} ", title = "Hamiltonism and neighborhood of balanced bipartite sets in bipartite graphs", Institution = "LaBRI, Universit\'e Bordeaux I", year = "1993", note = "Soumis pour publication" } @Article{a:Ama93b, author = "D. {Amar}", title = "Irregularity strength of regular graphs of large degree", journal = "Discrete Math.", volume = "114", year = "1993", pages = "9-17" } @Article{a:Ama93a, author = "D. {Amar}", title = "Applying a Condition for a Hamiltonian Bipartite Graph to be Bipancyclic", journal = "Discrete Math.", volume = "111", year = "1993", pages = "19-25" } %------ 1992 --------------------------------------------------------- @TECHREPORT{Gav92, AUTHOR = {Gavoille, Cyril}, TITLE = {Evaluation of the {M}as{P}ar {MP}-1 Performances}, INSTITUTION= {LIP}, ADDRESS = {\'{E}cole Normale Sup\'{e}rieure de Lyon, 69364 Lyon Cedex 07, France}, NUMBER = {92-01}, MONTH = feb, YEAR = 1992, KEYWORDS = {parallel} } @Article{a:AM92a, author = "D. {Amar} and Y. {Manoussakis}", title = "Hamiltonian paths and cycles, number of arcs and independance number in digraphs", journal = "Discrete Math.", volume = "105", year = "1992", pages = "1-16" } @Article{a:Ama92a, author = "D. {Amar} ", title = "A condition for a Hamiltonian bipartite graph to be bipancyclic", journal = "Discrete Math.", volume = "102", year = "1992", pages = "221-227" } @InProceedings{i:Ras92c, author = "A. {Raspaud}", title = "Cycle Covers of Graphs with the {Fulkerson} Property", year = "1992", booktitle = "VI Jordanas en teoria de grafos y sus aplicaciones. Cuman\'a (Venezuela)" } @InProceedings{i:Ras92b, author = "A. {Raspaud}", title = "Cycle Covers and Nowhere-zero Flows", year = "1992", booktitle = "VI Jordanas en teoria de grafos y sus aplicaciones. Cuman\'a (Venezuela)" } @TechReport{d:Ras92a, author = "A. {Raspaud} ", title = "Short Circuit Covers for Binary Matroids with a {P}etersen Flow", Institution = "LaBRI, Universit\'e Bordeaux I", year = "1992", number="92-03" } @InProceedings{i:Ama92c, author = "D. {Amar}", title = "Hamiltonism in bipartite digraphs", year = "1992", booktitle = "VI Jordanas en teoria de grafos y sus aplicaciones. Cuman\'a (Venezuela)" } @InProceedings{i:Ama92b, author = "D. {Amar}", title = "Paths and Cycles in bipartite graphs", year = "1992", booktitle = "VI Jordanas en teoria de grafos y sus aplicaciones. Cuman\'a (Venezuela)" } %------ 1991 --------------------------------------------------------- @Article{a:Ras91b, author = "A. {Raspaud} ", title = "Cycle covers of graphs with a nowhere-zero 4-flow. ", journal = "Journal of Graph Theory", year = "1991", volume = "15", number="6", pages = "649-654" } @Article{a:AR91, author = {D. Amar and A. Raspaud}, title= {Covering the vertices of a digraph by cycles of prescribed length.}, journal= "Discrete Math.", volume="87", year="1991", pages="111-118" } %------ 1990 --------------------------------------------------------- @PhdThesis{Bau90, author = "Baudon, O.", title = "Cabri-graphes, un Cahier de Brouillon Interactif pour la Th\'eorie des Graphes", school = "Universit\'e Joseph Fourier-Grenoble 1", year = "1990" } %------ 1987 --------------------------------------------------------- @ARTICLE{a:JRT, author = "U. {Jamshy} and A. {Raspaud} and M. {Tarsi}", title = "Short circuit covers for regular matroids with a nowhere zero 5-flow.", journal = {J. Combin. Theory Ser. B.43}, year = "1987" , volume= "3", pages= "354--357" }