Articles in journal or book's chapters

BACK TO COATI PUBLICATION INDEX

Articles in journal or book's chapters

2016
  1. Julio Araujo, Frédéric Giroire, Joanna Moulierac, Yi Liu, and Remigiusz Modrzejewski. Energy Efficient Content Distribution. The Computer Journal, 59(2):192--207, November 2016. [WWW ] [PDF ]
    Keywords: Future Internet, In-network Caching, Content Deliv-ery Network, Integer Linear Programming, Energy Efficiency. [Abstract] [bibtex-entry]
     
  2. Julio Araujo, Frédéric Havet, Claudia Linhares Sales, and Ana Silva. Proper orientation of cacti. Journal of Theoretical Computer Science (TCS), 639:14-25, 2016. [WWW ] [PDF ]
    Keywords: proper orientation, graph coloring, cactus graph, claw-free graph, planar graph, block graph. [Abstract] [bibtex-entry]
     
  3. Joergen Bang-Jensen, Nathann Cohen, and Frédéric Havet. Finding good 2-partitions of digraphs II. Enumerable properties. Journal of Theoretical Computer Science (TCS), 640:1-19, August 2016. [WWW ] [PDF ]
    Keywords: Feedback vertex set, Out-branching, Tournament, Oriented, NP-complete, Polynomial, Partition, Splitting digraphs, Acyclic, Semicomplete digraph, 2-Partition, Minimum degree. [Abstract] [bibtex-entry]
     
  4. J Bang-Jensen, Frédéric Havet, and Anders Yeo. The complexity of finding arc-disjoint branching flows. Discrete Applied Mathematics, 209:16-26, 2016. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. J Bang-Jensen and Frédéric Havet. Finding good 2-partitions of digraphs I. Hereditary properties. Journal of Theoretical Computer Science (TCS), 636:85--94, 2016. [WWW ] [PDF ]
    Keywords: minimum degree, 2-partition, tournament, out-branching, feedback vertex set, oriented, NP-complete, polynomial, partition, splitting digraphs, acyclic, semicomplete digraph. [Abstract] [bibtex-entry]
     
  6. Jean-Claude Bermond, Cristiana Gomes Huiban, and Patricio Reyes. Round weighting problem and gathering in radio networks with symmetrical interference. Discrete Mathematics, Algorithms and Applications, 8(2):1650035 57 pages, 2016. [WWW ]
    Keywords: Radio networks, wireless networks, interference, grids, gathering, bounds, approximation algorithms.. [Abstract] [bibtex-entry]
     
  7. Jean-Claude Bermond, Alain Jean-Marie, Dorian Mazauric, and Joseph Yu. Well Balanced Designs for Data Placement. Journal of Combinatorial Designs, 24(2):55-76, February 2016. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. Lélia Blin, Janna Burman, and Nicolas Nisse. Exclusive Graph Searching. Algorithmica, February 2016. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. David Coudert and Guillaume Ducoffe. Data center interconnection networks are not hyperbolic. Theoretical Computer Science, 639:72-90, 2016. [WWW ] [PDF ]
    Keywords: interconnection network, data center, Cayley graph, greedy routing scheme, metric embedding, graph endomorphism, Gromov hy-perbolicity. [Abstract] [bibtex-entry]
     
  10. David Coudert and Guillaume Ducoffe. On the hyperbolicity of bipartite graphs and intersection graphs. Discrete Applied Mathematics, 214:187-195, 2016. [WWW ] [PDF ]
    Keywords: biclique graph, line graph, clique graph, Gromov hyperbolicity, bipartite graph, intersection graph, graph power. [Abstract] [bibtex-entry]
     
  11. David Coudert, Guillaume Ducoffe, and Nicolas Nisse. To Approximate Treewidth, Use Treelength!. Siam Journal on Discrete Mathematics, 30(3):13, 2016. [WWW ] [PDF ]
    Keywords: Graph, Treewidth, Treelength, Cycle basis, Genus. [Abstract] [bibtex-entry]
     
  12. David Coudert, Dorian Mazauric, and Nicolas Nisse. Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth and Directed Pathwidth. ACM Journal of Experimental Algorithmics, 21(1):23, 2016. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. David Coudert, Stéphane Pérennes, Hervé Rivano, and Marie-Emilie Voge. Combinatorial optimization in networks with Shared Risk Link Groups. Discrete Mathematics and Theoretical Computer Science, Vol. 18, no 3:25, May 2016. [WWW ] [PDF ]
    Keywords: colored graphs, Shared Risk Link Group, complexity, algorithms, Multi-layer networks. [Abstract] [bibtex-entry]
     
  14. Gianlorenzo D 'angelo, Alfredo Navarra, and Nicolas Nisse. A unified approach for Gathering and Exclusive Searching on rings under weak assumptions. Distributed Computing, 2016. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. Nicolas Nisse and Ronan Pardo Soares. On the Monotonicity of Process Number. Discrete Applied Mathematics, 210:103-111, 2016. [WWW ] [PDF ]
    Keywords: Graph Searching, Process Number, Monotonicity. [Abstract] [bibtex-entry]
     
2015
  1. Deepesh Agarwal, Christelle Caillouet, David Coudert, and Frédéric Cazals. Unveiling Contacts within Macro-molecular assemblies by solving Minimum Weight Connectivity Inference Problems. Molecular and Cellular Proteomics, 14:2274-2284, April 2015. [WWW ] [PDF ]
    Keywords: Biophysics, Bioinformatics, Mathematical Modeling, connectivity inference, Algorithms, Mass Spectrometry, Structural Biology. [Abstract] [bibtex-entry]
     
  2. Omid Amini, David Coudert, and Nicolas Nisse. Non-deterministic graph searching in trees. Journal of Theoretical Computer Science (TCS), 580:101-121, May 2015. [WWW ] [PDF ]
    Keywords: Pathwidth, Trees, Graph Searching, Treewidth. [Abstract] [bibtex-entry]
     
  3. Julio Araujo, Nathann Cohen, Susanna F. De Rezende, Frédéric Havet, and Phablo Moura. On the proper orientation number of bipartite graphs. Journal of Theoretical Computer Science (TCS), 566:59-75, February 2015. [WWW ] [Abstract] [bibtex-entry]
     
  4. Julio Araujo, Frédéric Havet, and Mathieu Schmitt. Steinberg-like theorems for backbone colouring. Electronic Notes in Discrete Mathematics, pp 223-229, December 2015. [WWW ] [PDF ]
    Keywords: Graph Colouring, Planar Graph, Backbone Colouring, Steinberg's Conjecture. [Abstract] [bibtex-entry]
     
  5. Jorgen Bang-Jensen, Frédéric Havet, and Ana Karolinna MAIA DE OLIVEIRA. Finding a subdivision of a digraph. Theoretical Computer Science, 562:20, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. Florent Becker, Adrian Kosowski, Martin Matamala, Nicolas Nisse, Ivan Rapaport, Karol Suchan, and Ioan Todinca. Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distributed Computing, 28(3):189-200, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. Jean-Claude Bermond, David Coudert, Gianlorenzo D 'angelo, and Fatima Zahra Moataz. Finding disjoint paths in networks with star shared risk link groups. Journal of Theoretical Computer Science (TCS), 579:74-87, May 2015. [WWW ] [PDF ]
    Keywords: Diverse routing, Shared Risk Link Group, Complexity, Algorithms, Disjoint paths, Colored graph. [Abstract] [bibtex-entry]
     
  8. Jean-Claude Bermond, Bi Li, Nicolas Nisse, Hervé Rivano, and Min-Li Yu. Data gathering and personalized broadcasting in radio grids with interference. Journal of Theoretical Computer Science (TCS), 562:453-475, 2015. [WWW ] [PDF ]
    Keywords: Gathering, Personalized broadcasting, Interference, Grid, Radio networks. [Abstract] [bibtex-entry]
     
  9. Nathann Cohen, David Coudert, and Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal on Experimental Algorithmics, 20(1):18, 2015. [WWW ] [PDF ]
    Keywords: Algorithms, Gromov Hyperbolicity, Networks. [Abstract] [bibtex-entry]
     
  10. David Coudert, Alvinice Kodjo, and Truong Khoa Phan. Robust Energy-aware Routing with Redundancy Elimination. Computers and Operations Research, 64:21, December 2015. [WWW ] [PDF ]
    Keywords: Robust Network Optimization, Green Networking, Energy-aware Routing, Redundancy Elimination. [Abstract] [bibtex-entry]
     
  11. Gianlorenzo d'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, and Karol Suchan. Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica, 72(4):1055-1096, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. Olivier Delmas, Frédéric Havet, and Mickaël Montassier. Design of fault-tolerant on-board networks with variable switch sizes. Theoretical Computer Science, 562:15, 2015. [WWW ] [Abstract] [bibtex-entry]
     
  13. Frédéric Giroire, Ioannis Lamprou, Dorian Mazauric, Nicolas Nisse, Stéphane Pérennes, and Ronan Soares. Connected Surveillance Game. Journal of Theoretical Computer Science (TCS), 584:131-143, June 2015. [WWW ] [PDF ]
    Keywords: Surveillance game, Cops and robber games, Prefetching, Online strategy, Competitive ratio, Cost of connectivity. [Abstract] [bibtex-entry]
     
  14. Frédéric Giroire, Joanna Moulierac, Truong Khoa Phan, and frederic roudaut. Minimization of network power consumption with redundancy elimination. Computer Communications, 59:98--105, March 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. Frédéric Giroire, Stéphane Pérennes, and Issam Tahiri. On the complexity of equal shortest path routing. Networks, 2015. [WWW ] [PDF ]
    Keywords: shortest path, routing, OSPF-ECMP protocol, maximum flow, NP-hard, approximation algorithms, inverse shortest path. [Abstract] [bibtex-entry]
     
  16. Frédéric Havet, A Karolinna Maia, and Min-Li Yu. Complexity of greedy edge-colouring. Journal of the Brazilian Computer Society, 21(18), 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  17. Adrian Kosowski, Bi Li, Nicolas Nisse, and Karol Suchan. k-Chordal Graphs: from Cops and Robber to Compact Routing via Treewidth. Algorithmica, 72(3):758-777, 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  18. Joanna Moulierac and Truong Khoa Phan. Optimizing IGP link weights for energy-efficiency in multi-period traffic matrices. Computer Communications, 61:11, May 2015. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2014
  1. Julio Araujo, Jean-Claude Bermond, and Guillaume Ducoffe. Eulerian and Hamiltonian dicycles in directed hypergraphs. Discrete Mathematics, Algorithms and Applications, 06:1450012, 2014. [WWW ] [PDF ] [bibtex-entry]
     
  2. Julio Araujo, Nicolas Nisse, and Stéphane Pérennes. Weighted Coloring in Trees. Siam Journal on Discrete Mathematics, 28(4):2029 - 2041, 2014. [WWW ] [PDF ] [bibtex-entry]
     
  3. Victor Campos, Claudia Linhares Sales, Ana Karolinna Maia, and Rudini Sampaio. Maximization Coloring Problems on graphs with few P4s. Discrete Applied Mathematics, 164(2):539-546, February 2014. [WWW ] [PDF ] [bibtex-entry]
     
  4. Grit Classen, David Coudert, Arie Koster, and Napoleao Nepomuceno. Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks. INFORMS Journal on Computing, 26(4):893-909, 2014. [WWW ] [PDF ] [bibtex-entry]
     
  5. David Coudert and Guillaume Ducoffe. Recognition of C4-free and 1/2-hyperbolic graphs. Siam Journal on Discrete Mathematics, 28(3):1601-1617, September 2014. [WWW ] [PDF ] [bibtex-entry]
     
  6. Fedor V. Fomin, Frédéric Giroire, Jean-Marie Alain, Dorian Mazauric, and Nicolas Nisse. To satisfy impatient Web surfers is hard. Journal of Theoretical Computer Science (TCS), 526:1-17, March 2014. [WWW ] [PDF ] [bibtex-entry]
     
  7. Frédéric Havet and Andrew King. List circular backbone colouring. Discrete Mathematics and Theoretical Computer Science, 16(1):89--104, 2014.
    Note: Graph Theory. [WWW ] [PDF ] [bibtex-entry]
     
  8. Frederic Havet, Andrew D. King, Mathieu Liedloff, and Ioan Todinca. (Circular) backbone colouring: Forest backbones in planar graphs. Discrete Applied Mathematics, 169:119-134, 2014. [WWW ] [bibtex-entry]
     
  9. Frederic Havet, Nagarajan Paramaguru, and Rathinaswamy Sampathkumar. Detection number of bipartite graphs and cubic graphs. Discrete Mathematics and Theoretical Computer Science, 16(3):333-342, 2014. [WWW ] [PDF ] [bibtex-entry]
     
2013
  1. L. Addario-Berry, F. Havet, C. Linhares Sales, B. Reed, and S. Thomassé. Oriented trees in digraphs. Discrete Mathematics, 313(8):967-974, 2013. [WWW ] [bibtex-entry]
     
  2. J. Araujo, V. Campos, F. Giroire, N. Nisse, L. Sampaio, and R Soares. On the hull number of some graph classes. Theoretical Computer Science, 475:1-12, January 2013. [WWW ] [PDF ] [bibtex-entry]
     
  3. J. Araujo and C. Linhares Sales. A Hajós-like theorem for weighted coloring. Journal of the Brazilian Computer Society, 19(3):275-278, January 2013. [WWW ] [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, M. Cosnard, and S. Pérennes. Directed acyclic graphs with the unique dipath property. Theoretical Computer Science, 504:5-11, September 2013. [WWW ] [PDF ] [bibtex-entry]
     
  5. J-C. Bermond, L. Gargano, S. Pérennes, A. Rescigno, and U. Vaccaro. Optimal Time Data Gathering in Wireless Networks with Multidirectional Antennas. Journal of Theoretical Computer Science (TCS), 509:122-139, October 2013. [WWW ] [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, R. Klasing, N. Morales, S. Pérennes, and P. Reyes. Gathering radio messages in the path. Discrete Mathematics, Algorithms and Applications, 5(1):1-28, March 2013. [WWW ] [PDF ] [bibtex-entry]
     
  7. S. Bessy and F. Havet. Enumerating the edge-colourings and total colourings of a regular graph. Journal of Combinatorial Optimization, 25(4):523-535, 2013. [WWW ] [bibtex-entry]
     
  8. V. Campos, F. Havet, R. Sampaio, and A. Silva. Backbone colouring: Tree backbones with small diameter in planar graphs. Theoretical Computer Science, 487:50-64, 2013. [WWW ] [bibtex-entry]
     
  9. S. Caron, F. Giroire, D. Mazauric, J. Monteiro, and S. Pérennes. P2P Storage Systems: Study of Different Placement Policies. Peer-to-Peer Networking and Applications, March 2013. [WWW ] [PDF ] [bibtex-entry]
     
  10. S. Cicerone, G. D'Angelo, G. Di Stefano, D. Frigioni, and V. Maurizio. Engineering a new algorithm for distributed shortest paths on dynamic networks. Algorithmica, 66(1):51-86, May 2013. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. W. Fang, X. Liang, S. Li, L. Chiaraviglio, and N. Xiong. VMPlanner: Optimizing Virtual Machine Placement and Traffic Flow Routing to Reduce Network Power Costs in Cloud Data Centers. Computer Networks, 57(1):179-196, January 2013. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. S. Guillemot, F. Havet, C. Paul, and A. Perez. On the (non-)existence of polynomial kernels for $P\_l$-free edge modification problems. Algorithmica, 65(4):900-926, 2013. [WWW ] [bibtex-entry]
     
  13. F. Havet and L. Sampaio. On the Grundy and b-chromatic numbers of a graph. Algorithmica, 65(4):885-899, 2013. [WWW ] [bibtex-entry]
     
  14. F. Havet and X. Zhu. The game Grundy number of graphs. Journal of Combinatorial Optimization, 25(4):752-765, 2013. [WWW ] [bibtex-entry]
     
  15. A. Lancin and D. Papadimitriou. DRMSim: A Routing-Model Simulator for Large-Scale Networks. ERCIM News, 94:31-32, July 2013. [WWW ] [bibtex-entry]
     
2012
  1. O. Amini, D. Peleg, S. Pérennes, I. Sau, and S. Saurabh. On the approximability of some degree-constrained subgraph problems. Discrete Applied Mathematics, 160(12):1661 - 1679, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. J. Araujo, J-C. Bermond, F. Giroire, F. Havet, D. Mazauric, and R. Modrzejewski. Weighted improper colouring. Journal of Discrete Algorithms, 16:53-66, 2012.
    Note: Selected papers from the 22nd International Workshop on Combinatorial Algorithms (IWOCA 2011). [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. J. Araujo, N. Cohen, F. Giroire, and F. Havet. Good edge-labelling of graphs. Discrete Applied Mathematics, 160(18):2501-2513, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. J. Araujo and C. Linhares Sales. On the Grundy number of graphs with few P4's. Discrete Applied Mathematics, 160(18):2514-2522, 2012.
    Note: V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. J. Bang-Jensen, F. Havet, and N. Trotignon. Finding an induced subdivision of a digraph. Theoretical Computer Science, 443:10-24, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. L. Barrière, P. Flocchini, F. Fomin, P. Fraigniaud, N. Nisse, N. Santoro, and D. Thilikos. Connected Graph Searching. Information and Computation, 219:1-16, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. S. Baruah, V. Bonifaci, G. D'Angelo, H. Li, A. Marchetti-Spaccamela, N. Megow, and L. Stougie. Scheduling Real-time Mixed-criticality Jobs. IEEE Transactions on Computers, 61(8):1140-1152, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. R. Bauer, G. D'Angelo, D. Delling, A. Schumm, and D. Wagner. The Shortcut Problem - Complexity and Algorithms. Journal of Graph Algorithms and Applications, 16(2):447-481, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. J-C. Bermond, D. Coudert, J. Moulierac, S. Pérennes, I. Sau, and F. Solano Donado. GMPLS Label Space Minimization through Hypergraph Layouts. Theoretical Computer Science (TCS), 444:3-16, July 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. J-C. Bermond and J. Moulierac. Internet et la théorie des graphes. Revue TDC Textes et documents pour la Classe : la révolution Internet, 1042:32-33, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. J-C. Bermond and J. Peters. Optimal Gathering in Radio Grids with Interference. Theoretical Computer Science, 457:10-26, October 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. S. Bhadra and A. Ferreira. Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs. J. Internet Services and Applications, 3(3):269-275, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. V. Campos, A. Gyárfás, F. Havet, C. Linhares Sales, and F. Maffray. New bounds on the Grundy number of products of graphs. Journal of Graph Theory, 71(1):78-88, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. Y. Chen, E. Le Merrer, Z. Li, Y. Liu, and G. Simon. OAZE: A Network-Friendly Distributed Zapping System for Peer-to-Peer IPTV. Computer Networks, 56(1):365-377, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. D. Coudert, F. Huc, and D. Mazauric. A Distributed Algorithm for Computing the Node Search Number in Trees. Algorithmica, 63(1-2):158-190, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  16. G. D'Angelo, G. Di Stefano, and A. Navarra. Minimize the Maximum Duty in Multi-interface Networks. Algorithmica, 63(1-2):274-295, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  17. L. Esperet, F. Kardos, and D. Král'. A superlinear bound on the number of perfect matchings in cubic bridgeless graphs. European Journal of Combinatorics, 33(5):767-798, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  18. A. Ferreira and A. Jarry. Minimum-Energy Broadcast Routing in Dynamic Wireless Networks. Journal of Green Engineering, 2(2):115-123, 2012. [PDF ] [Abstract] [bibtex-entry]
     
  19. F. Giroire, D. Mazauric, and J. Moulierac. Energy Efficient Routing by Switching-Off Network Interfaces, chapter 10 - Energy-Aware Systems and Networking for Sustainable Initiatives, pages 207-236. IGI Global, june 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  20. D. Gonçalves, F. Havet, A. Pinlou, and S. Thomassé. On spanning galaxies in digraphs. Discrete Applied Mathematics, 160(6):744-754, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  21. F. Havet, C. Linhares Sales, and L. Sampaio. b-coloring of tight graphs. Discrete Applied Mathematics, 160(18):2709-2715, 2012. [WWW ] [bibtex-entry]
     
  22. F. Havet, B. Reed, and J.-S. Sereni. Griggs and Yeh's conjecture and $L(p,1)$-labellings. SIAM Journal on Discrete Mathematics, 26(1):145-168, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  23. N. Nisse, I. Rapaport, and K. Suchan. Distributed computing of efficient routing schemes in generalized chordal graphs. Theoretical Computer Science, 444(27):17-27, 2012. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2011
  1. V. Andova, N. Cohen, and R. Skrekovski. Graph Classes (Dis)satisfying the Zagreb Indices Inequality. MATCH Commun. Math. Comput. Chem., 65(3):647-658, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  2. M. Basavaraju, L. S. Chandran, N. Cohen, F. Havet, and T. Müller. Acyclic edge-coloring of planar graphs. SIAM Journal of Discrete Mathematics, 25(2):463--478, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  3. J. Beauquier, J. Burman, and S. Kutten. A self-stabilizing Transformer for Population Protocols with Covering. Theoretical Computer Science, 412(33):4247-4259, 2011. [WWW ] [Abstract] [bibtex-entry]
     
  4. J-C. Bermond, Y. M. Chee, N. Cohen, and X. Zhang. The $\alpha$-Arboricity of Complete Uniform Hypergraphs. SIAM Journal on Discrete Mathematics, 25(2):600-610, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, F. Ergincan, and M. Syska. Quisquater Festschrift, volume 6805 of Lecture Notes in Computer Science, chapter Line Directed Hypergraphs, pages 25-34. Springer-Verlag, Berlin Heidelberg, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  6. J-C. Bermond, X. Muñoz, and I. Sau. Traffic Grooming in Bidirectional WDM Ring Networks. Networks, 58(1):20-35, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. V. Bilo, M. Flammini, G. Monaco, and L. Moscardelli. On the performances of Nash equilibria in isolation games. Journal of Combinatorial Optimization, 22:378-391, 2011.
    Note: Special Issue: Selected Papers from the 15th International Computing and Combinatorics Conference. [WWW ] [Abstract] [bibtex-entry]
     
  8. B. Bresar, F. Kardos, J. Katrenic, and G. Semanisin. Minimum $k$-path vertex cover. Discrete Applied Mathematics, 159(12):1189-1195, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  9. C. Caillouet, S. Pérennes, and H. Rivano. Framework for Optimizing the Capacity of Wireless Mesh Networks. Computer Communications, 34(13):1645-1659, 2011. [WWW ]
    Keywords: Wireless mesh networks, capacity, routing, scheduling, linear programming, column and cut generation.. [Abstract] [bibtex-entry]
     
  10. J. Chalopin, V. Chepoi, N. Nisse, and Y. Vaxès. Cop and robber games when the robber can hide and ride. SIAM Journal of Discrete Maths., 25(1):333-359, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. N. Cohen, D. Coudert, D. Mazauric, N. Nepomuceno, and N. Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science (TCS), 412(35):4675-4687, August 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. N. Cohen and F. Havet. Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs and Combinatorics, 27(6):831-849, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. D. Coudert, F. Giroire, and I. Sau. Circuits in graphs through a prescribed set of ordered vertices. Journal of Interconnection Networks (JOIN), 11(3-4):121-141, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. D. Coudert and J-S. Sereni. Characterization of graphs and digraphs with small process number. Discrete Applied Mathematics (DAM), 159(11):1094-1109, July 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. J. Czap, S. Jendrol', and F. Kardos. On the strong parity chromatic number. Discussiones Mathematicae Graph Theory, 31:587-600, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  16. J. Czap, S. Jendrol', and F. Kardos. Facial parity edge colouring. Ars Mathematica Contemporanea, 4(2):255-269, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  17. J. Czap, S. Jendrol', F. Kardos, and J. Miskuf. Looseness of Plane Graphs. Graphs and Combinatorics, 27(1):73-85, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  18. O. Dalle. Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? -- Part 1. Modeling & Simulation Magazine, 11(3), 07 2011.
    Note: Online publication. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  19. O. Dalle. Should Simulation Products Use Software Engineering Techniques or Should They Reuse Products of Software Engineering? -- Part 2. Modeling & Simulation Magazine, 11(4), 10 2011.
    Note: Online publication. [WWW ] [Abstract] [bibtex-entry]
     
  20. G. D'Angelo, Gabriele Di Stefano, Alfredo Navarra, and Cristina Pinotti. Recoverable Robust Timetables: An Algorithmic Approach on Trees. IEEE Transactions on Computers, 60(3):433 - 446, March 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  21. R. Erman, F. Havet, B. Lidicky, and O. Pangrác. 5-colouring graphs with 4 crossings. SIAM Journal on Discrete Mathematics, 25(1):401-422, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  22. L. Esperet, F. Kardos, A. D. King, D. Král', and S. Norine. Exponentially many perfect matchings in cubic graphs. Advances in Mathematics, 227(4):1646-1664, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  23. P. Giabbanelli and J. G. Peters. Complex networks and epidemics. Technique et Science Informatiques, 20(2):181-212, 2011. [Abstract] [bibtex-entry]
     
  24. F. Havet, S. Jendrol', R. Soták, and E. Skrabul'áková. Facial non-repetitive edge-colouring of plane graphs. Journal of Graph Theory, 66(1):38--48, 2011. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  25. F. Havet, M. Klazar, J. Kratochvìl, D. Kratsch, and M. Liedloff. Exact algorithms for L(2,1)-labelling. Algorithmica, 59(2):169--194, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  26. F. Kardos, J. Katrenic, and I. Schiermeyer. On computing the minimum 3-path vertex cover and dissociation number of graphs. Theoretical Computer Science, 412(50):7009-7017, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  27. F. Kardos, D. Král', and J. Volec. Fractional colorings of cubic graphs with large girth. SIAM Journal on Discrete Mathematics, 25(3):1454-1476, 2011. [PDF ] [Abstract] [bibtex-entry]
     
  28. G . Wainer, K. Al-Zoubi, O. Dalle, R. C. Hill, S. Mittal, J. L. R. Martin, H. Sarjoughian, L. Touraille, M. K. Traoré, and B. P. Zeigler. Discrete-Event Modeling and Simulation: Theory and Applications, chapter 17 - Standardizing DEVS model representation, pages 427-458. Taylor and Francis, 2011. [WWW ] [bibtex-entry]
     
  29. G. A. Wainer, K. Al-Zoubi, O. Dalle, R.C. Hill, S. Mittal, J. L. R. Martin, H. Sarjoughian, L. Touraille, M. K. Traoré, and B. P. Zeigler. Discrete-Event Modeling and Simulation: Theory and Applications, chapter 18 - Standardizing DEVS Simulation Middleware, pages 459-494. Taylor and Francis, 2011. [WWW ] [bibtex-entry]
     
2010
  1. L. Addario-Berry, W.S. Kennedy, A.D. King, Z. Li, and B. Reed. Finding the maximum-weight induced $k$-partite subgraph of an $i$-triangulated graph. Discrete Applied Mathematics, 158(7):765-770, April 2010. [WWW ] [Abstract] [bibtex-entry]
     
  2. O. Amini, F. Giroire, F. Huc, and S. Pérennes. Minimal selectors and fault tolerant networks. Networks, 55(4):326-340, July 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. O. Amini, F. Havet, F. Huc, and S. Thomassé. WDM and directed star arboricity. Combinatorics, Probability and Computing, 19:161--182, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  4. M. Asté, F. Havet, and C. Linhares Sales. Grundy number and products of graphs. Discrete Mathematics, 310(9):1482--1490, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, C. J. Colbourn, L. Gionfriddo, G. Quattrocchi, and I. Sau. Drop Cost and Wavelength Optimal Two-Period Grooming with Ratio 4. SIAM Journal on Discrete Mathematics, 24(2):400-419, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  6. J-C. Bermond, L. Gargano, and A. A. Rescigno. Gathering with minimum completion time in sensor tree networks. JOIN, 11(1-2):1-33, 2010.
    Note: A preliminary version has been presented at Sirocco08. [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, F. Havet, F. Huc, and C. Linhares Sales. Improper colouring of weighted grid and hexagonal graphs. Discrete Mathematics, Algorithms and Applications, 2(3):395-411, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  8. J-C. Bermond and M-L. Yu. Optimal gathering algorithms in multi-hop radio tree networks with interferences. Ad Hoc and Sensor Wireless Networks, 9(1-2):109-128, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  9. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, and H. Rivano. Fractional Path Coloring in Bounded Degree Trees with Applications. Algorithmica, 58(2):516-540, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  10. A. Casamayou, N. Cohen, G. Connan, T. Dumont, L. Fousse, F. Maltey, M. Meulien, M. Mezzarobba, C. Pernet, N.M. Thiéry, and P. Zimmermann. Calcul mathématique avec Sage, chapter Théorie des graphes. 2010. [WWW ] [bibtex-entry]
     
  11. A. Casamayou, N. Cohen, G. Connan, T. Dumont, L. Fousse, F. Maltey, M. Meulien, M. Mezzarobba, C. Pernet, N. M. Thiéry, and P. Zimmermann. Calcul mathématique avec Sage, chapter Programmation Linéaire. 2010. [WWW ] [bibtex-entry]
     
  12. T. Cinkler, D. Coudert, M. Flammini, G. Monaco, L. Moscardelli, X. Muñoz, I. Sau, M. Shalom, and S. Zaks. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, chapter Traffic Grooming: Combinatorial Results and Practical Resolutions, pages 63-94. Springer, A. Koster and X. Muñoz edition, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. N. Cohen, D. Dimitrov, R. Krakovski, R. Skrekovski, and V. Vukasinovic. On Wiener Index of Graphs and Their Line Graphs. MATCH Commun. Math. Comput. Chem., 64(3):683-698, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  14. N. Cohen, F. V. Fomin, G. Gutin, E. Jung Kim, S. Saurabh, and A. Yeo. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. Journal of Computer and System Sciences, 76(7):650 - 662, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. N. Cohen and F. Havet. Planar graphs with maximum degree $\Delta\geq 9$ are ($\Delta+1$)-edge-choosable -- short proof. Discrete Mathematics, 310(21):3049--3051, 2010. [PDF ]
    Keywords: edge-colouring, list colouring, List Colouring Conjecture, planar graphs. [Abstract] [bibtex-entry]
     
  16. D. Coudert, N. Nepomuceno, and H. Rivano. Power-Efficient Radio Configuration in Fixed Broadband Wireless Networks. Computer Communications, Special Section on Hot Topics in Mesh Networking, 33(8):898-906, May 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  17. O. Dalle, Q. Liu, G. Wainer, and B. P. Zeigler. Applying Cellular Automata and DEVS Methodologies to Digital Games: A Survey. Simulation & Gaming, 41(6):796-823, December 2010.
    Note: EA DISSIMINET (Associated Team). [WWW ] [Abstract] [bibtex-entry]
     
  18. N. Eggemann, F. Havet, and S. Noble. k-L(2,1)-Labelling for Planar Graphs is NP-Complete for $k\geq 4$. Discrete Applied Mathematics, 158(16):1777--1788, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  19. C. Eslahchi, H. Pezeshk, M. Sadeghi, P. Giabbanelli, F. Movahedi, and V. Dabbaghian. A Probabilistic Model for the Spread of HIV Infection among Injection Drug Users. World Journal of Modelling and Simulation (WJMS), 6(4):267-273, November 2010. [PDF ] [Abstract] [bibtex-entry]
     
  20. A. Ferreira, A. Goldman, and J. Monteiro. Performance evaluation of routing protocols for MANETs with known connectivity patterns using evolving graphs. Wireless Networks, 16(3):627--640, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  21. A. Ferreira. Uma estratégia face à Revolução Digital. Teoria e Debate, 87:20-23, 2010. [Abstract] [bibtex-entry]
     
  22. M. Flammini, G. Monaco, L. Moscardelli, H. Shachnai, M. Shalom, T. Tamir, and S. Zaks. Minimizing Total Busy Time in Parallel Scheduling with Application to Optical Networks. Theoretical Computer Science, 411(40-42):3553-3562, September 2010. [Abstract] [bibtex-entry]
     
  23. F. V. Fomin, P. A. Golovach, J. Kratochvil, N. Nisse, and K. Suchan. Pursuing a fast robber on a graph. Theoretical Computer Science, 411(7-9):1167-1181, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  24. F. Havet, D. Král, J.-S. Sereni, and R. Skrekovski. Facial coloring using Hall's theorems. European Journal of Combinatorics, 31:1001--1019, 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  25. C. Molle and M-E. Voge. A quantitative analysis of the capacity of wireless mesh networks. IEEE Communications Letters, 14(5):438-440, May 2010. [WWW ] [bibtex-entry]
     
  26. C. Molle. Optimization of the Capacity of Wireless Mesh Networks. 4OR: A Quarterly Journal of Operations Research, 8(4):425-428, December 2010. [WWW ] [bibtex-entry]
     
  27. H. Rivano, F. Theoleyre, and F. Valois. A Framework for the Capacity Evaluation of Multihop Wireless Networks. Ad Hoc and Sensor Wireless networks (AHSWN), 9(3-4):139-162, 2010. [PDF ] [Abstract] [bibtex-entry]
     
  28. I. Sau and D. M. Thilikos. Subexponential Parameterized Algorithms for Degree-constrained Subgraph Problems on Planar Graphs. Journal of Discrete Algorithms, 8(3):330-338, September 2010. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2009
  1. L. Addario-Berry, N. Broutin, and B. Reed. Critical random graphs and the structure of a minimum spanning tree. Random Structures and Algorithms, 35:323--347, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  2. L. Addario-Berry and B. Reed. Minima in branching random walks. Annals of Probability, 37:1044--1079, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. O. Amini, F. Huc, and S. Pérennes. On the pathwidth of planar graphs. SIAM Journal of Discrete Mathematics, 23(3):1311-1316, August 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  4. O. Amini, F. Mazoit, N. Nisse, and S. Thomassé. Submodular partition functions. Discrete Mathematics, 309(20):6000-6008, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  5. O. Amini, S. Pérennes, and I. Sau. Hardness and Approximation of Traffic Grooming. Theoretical Computer Science, 410(38-40):3751-3760, 2009. [PDF ] [Abstract] [bibtex-entry]
     
  6. J-C. Bermond, R. Correa, and M-L. Yu. Optimal Gathering Protocols on Paths under Interference Constraints. Discrete Mathematics, 309(18):5574-5587, September 2009.
    Note: A preliminary version has been presented at CIAC06. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. V. Bilò, I. Caragiannis, A. Fanelli, M. Flammini, C. Kaklamanis, G. Monaco, and L. Moscardelli. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, chapter Game-Theoretic Approaches to Optimization Problems in Communication Networks, pages 241-264. Springer, A. Koster and X. Muñoz edition, November 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  8. E. Birmelé, J. A. Bondy, and B. Reed. Tree-width of graphs without a 3 by 3 grid minor. Discrete Applied Mathematics, 157:2577--2598, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  9. R. Correa, F. Havet, and J-S. Sereni. About a Brooks-type theorem for improper colouring. Australasian Journal of Combinatorics, 43:219--230, 2009. [PDF ] [Abstract] [bibtex-entry]
     
  10. F. V. Fomin, P. Fraigniaud, and N. Nisse. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica, 53(3):358-373, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  11. J. Galtier. Real-time resource allocation for LEO satellite constellations. Wireless Networks, 15(6):791-803, August 2009. [WWW ] [Abstract] [bibtex-entry]
     
  12. J. Geelen, B. Gerards, B. Reed, P. Seymour, and A. Vetta. On the odd-minor variant of Hadwiger's conjecture. Journal of Combinatorial Theory Ser. B, 99:20--29, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  13. F. Giroire. Order statistics and estimating cardinalities of massive data sets. Discrete Applied Mathematics, 157(2):406-427, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  14. F. Havet, R. Kang, T. Müller, and J.-S. Sereni. Circular choosability. Journal of Graph Theory, 61(4):241--334, 2009. [PDF ] [Abstract] [bibtex-entry]
     
  15. F. Havet, R. Kang, and J.-S. Sereni. Improper Colouring of Unit Disk Graphs. Networks, 54(3):150--164, 2009. [Abstract] [bibtex-entry]
     
  16. F. Havet and S. Thomassé. Complexity of $(p,1)$-total labelling. Dicrete Applied Mathematics, 157:2859--2870, 2009. [PDF ] [Abstract] [bibtex-entry]
     
  17. F. Havet. Choosability of the square of planar subcubic graphs with large girth. Discrete Mathematics, 309:3553--3563, 2009. [PDF ] [Abstract] [bibtex-entry]
     
  18. F. Huc, I. Sau, and J. Zerovnik. $(\ell,k)$-Routing on Plane Grids. Journal of Interconnection Networks, 10(1-2):27-57, 2009. [PDF ] [Abstract] [bibtex-entry]
     
  19. D. Ilcinkas, N. Nisse, and D. Soguet. The Cost of Monotonicity in Distributed Graph Searching. Distributed Computing, 22(2):117-127, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  20. A. Jarry and S. Pérennes. Disjoint Path in symmetric Graphs. Discrete Applied Mathematics, 157(1):90-97, 2009. [bibtex-entry]
     
  21. K. Kawarabayashi, O. Lee, and B. Reed. Removable cycles in non-bipartite graphs. Journal of Combinatorial Theory Ser. B, 99:30--38, 2009. [WWW ] [Abstract] [bibtex-entry]
     
  22. K. Kawarabayashi and B. Reed. Highly parity linked graphs. Combinatorica, 29:215--225, 2009. [WWW ] [Abstract] [bibtex-entry]
     
  23. R. Klasing, Z. Lotker, A. Navarra, and S. Pérennes. From Balls and Bins to Points and Vertices. Algorithmic Operations Research (AlgOR), 4(2):133-143, 2009. [Abstract] [bibtex-entry]
     
  24. B. Lévêque, F. Maffray, B. Reed, and N. Trotignon. Coloring Artemis graphs. Theoretical Computer Science, 410:2234--2240, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  25. G. B. Mertzios, I. Sau, and S. Zaks. A New Intersection Model and Improved Algorithms for Tolerance Graphs. SIAM Journal on Discrete Mathematics, 23:1800-1813, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  26. N. Nisse and D. Soguet. Graph Searching with Advice. Theoretical Computer Science, 410(14):1307-1318, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  27. N. Nisse. Connected graph searching in chordal graphs. Discrete Applied Mathematics, 157(12):2603-2610, 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  28. I. Sau and J. Zerovnik. Graphs and Algorithms in Communication Networks: Studies in Broadband, Optical, Wireless, and Ad Hoc Networks, volume XXVII of EATCS Texts in Theoretical Computer Science, chapter Permutation Routing and $(\ell,k)$-Routing on Plane Grids, pages 265-279. Springer, A. Koster and X. Muñoz edition, November 2009. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
2008
  1. L. Addario-Berry, M. Chudnovsky, F. Havet, B. Reed, and P. Seymour. Bisimplicial vertices in even-hole-free graphs. Journal of Combinatorial Theory Ser. B, 98(6):1119--1164, 2008. [PDF ] [Abstract] [bibtex-entry]
     
  2. L. Addario-Berry, K. Dalal, and B. Reed. Degree-Constrained Subgraphs. Discrete Applied Mathematics, 156:1168-1174, 2008. [bibtex-entry]
     
  3. L. Addario-Berry and B. Reed. Horizons of Combinatorics, volume 17 of Bolyai Society Mathematical Studies, chapter Ballot Theorems, Old and New, pages 9-35. Springer, 2008. [bibtex-entry]
     
  4. N. Ben Ali, B. Belghith, J. Moulierac, and M. Molnár. QoS multicast aggregation under multiple additive constraints. Computer Communications, 31(15):3564-3578, September 2008. [PDF ] [Abstract] [bibtex-entry]
     
  5. J-C. Bermond, D. Coudert, and B. Lévêque. Approximations for All-to-all Uniform Traffic Grooming on Unidirectional Ring. Journal of Interconnection Networks (JOIN), 9(4):471-486, December 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. L. Blin, P. Fraigniaud, N. Nisse, and S. Vial. Distributed chasing of network intruders. Theoretical Computer Science, 399(1-2):12-37, 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  7. M. Cerioli, L. Faria, T. Ferreira, C. Martinhon, F. Protti, and B. Reed. Partition into cliques for cubic graphs: Planar case, complexity and approximation. Discrete Applied Mathematics, 156:2270-2278, 2008. [bibtex-entry]
     
  8. R. Chand, M. Cosnard, and L. Liquori. Powerful resource discovery for Arigatoni overlay network. Future Generation Computer Systems, 24:31--38, 2008. [WWW ] [PDF ] [bibtex-entry]
     
  9. S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Planar graph bipartization in linear time. Discrete Applied Mathematics, 156:1175-1180, 2008. [Abstract] [bibtex-entry]
     
  10. M. Flammini, R. Klasing, A. Navarra, and S. Pérennes. Tightening the Upper Bound for the Minimum Energy Broadcasting problem. Wireless Networks, 14(5):659--669, October 2008.
    Note: Special Issue associated to the 3rd International Symposium on Modelling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt 2005). [WWW ] [bibtex-entry]
     
  11. M. Flammini, L. Moscardelli, A. Navarra, and S. Pérennes. Asymptotically Optimal Solutions for Small World Graphs. Theory of Computing Systems, 42(4):632-650, May 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  12. N. Fountoulakis and B. Reed. The evolution of the mixing rate of a simple random walk on the giant component of a random graph. Random Structures and Algorithms, 33:68-86, 2008. [bibtex-entry]
     
  13. P. Fraigniaud and N. Nisse. Monotony Properties of Connected Visible Graph Searching. Information and Computation, 206(12):1383-1393, 2008. [Abstract] [bibtex-entry]
     
  14. F. Havet, J.-S. Sereni, and R. Skrekovski. 3-facial colouring of plane graphs. SIAM Journal on Discrete Mathematics, 22(1):231--247, 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. F. Havet, S. Thomassé, and A. Yeo. Hoang-Reed conjecture for tournaments. Discrete Mathematics, 308(15):3412--3415, August 2008. [PDF ] [Abstract] [bibtex-entry]
     
  16. F. Havet and M-L. Yu. $(p,1)$-total labelling of graphs. Discrete Mathematics, 308(4):496--513, February 2008. [PDF ] [Abstract] [bibtex-entry]
     
  17. R. J. Kang, T. Müller, and J.-S. Sereni. Improper colouring of (random) unit disk graphs. Discrete Mathematics, 308:1438--1454, April 2008.
    Note: The Special Issue devoted to EuroComb 2005. [PDF ] [bibtex-entry]
     
  18. K. Kawarabayashi, O. Lee, B. Reed, and P. Wollan. A weaker version of Lovasz' path removable conjecture. Journal of Combinatorial Theory (Series B), 98:972-979, 2008. [bibtex-entry]
     
  19. K. Kawarabayashi and B. Reed. Fractional coloring and the odd Hadwiger's conjecture. European Journal of Combinatorics, 29(2):411-417, 2008. [Abstract] [bibtex-entry]
     
  20. R. Klasing, N. Morales, and S. Pérennes. On the Complexity of Bandwidth Allocation in Radio Networks. Theoretical Computer Science, 406(3):225-239, October 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  21. C. Linhares-Sales, F. Maffray, and B. Reed. On Planar Quasi-Parity Graphs. SIAM Journal of Discrete Mathematics, 22:329-347, 2008. [bibtex-entry]
     
  22. F. Mazoit and N. Nisse. Monotonicity of non-deterministic graph searching. Theoretical Computer Science, 399(3):169-178, 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  23. C. McDiarmid and B. Reed. On the maximum degree of a random planar graph. Combinatorics, Probability and Computing, 17:591-601, 2008. [bibtex-entry]
     
  24. C. Meagher and B. Reed. Fractionally total colouring ${G}_{n,p}$. Discrete Applied Mathematics, 156:1112-1124, 2008. [bibtex-entry]
     
  25. N. Nepomuceno, P.R. Pinheiro, and A.L.V. Coelho. A Hybrid Optimization Framework for Cutting and Packing Problems: Case Study on Constrained 2D Non-guillotine Cutting. In Recent Advances in Evolutionary Computation for Combinatorial Optimization, volume 153 of Studies in Computational Intelligence, chapter 6, pages 87-99. Springer, 2008. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  26. B. Reed. Skew Partitions in Perfect Graphs. Discrete Applied Mathematics, 156:1150-1156, 2008. [bibtex-entry]
     
  27. I. Sau and J. Zerovnik. An Optimal Permutation Routing Algorithm on Full-Duplex Hexagonal Networks. Discrete Mathematics and Theoretical Computer Science, 10(3):49-62, 2008. [PDF ] [Abstract] [bibtex-entry]
     
2007
  1. L. Addario-Berry, K. Dalal, C. McDiarmid, B. Reed, and A. Thomason. Vertex Colouring Edge Weightings. Combinatorica, 27:1-12, 2007. [bibtex-entry]
     
  2. L. Addario-Berry, F. Havet, and S. Thomassé. Paths with two blocks in $n$-chromatic digraphs. Journal of Combinatorial Theory Ser. B, 97:620--626, 2007. [PDF ] [bibtex-entry]
     
  3. E. Alba, B. Dorronsoro, F. Luna, A.J. Nebro, P. Bouvry, and L. Hogie. A cellular multi-objective genetic algorithm for optimal broadcasting strategy in metropolitan MANETs. Computer Communications, 30(4):685--697, August 2007. [WWW ] [Abstract] [bibtex-entry]
     
  4. R. Bayon, N. Lygeros, and J.-S. Sereni. Orders with ten elements are circle orders. Applied Mathematics E-Notes, 7:16--22, 2007. [WWW ] [PDF ] [bibtex-entry]
     
  5. J-C. Bermond, L. Braud, and D. Coudert. Traffic Grooming on the Path. Theoretical Computer Science, 384(2-3):139-151, October 2007. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. J-C. Bermond, A. Ferreira, S. Pérennes, and J. Peters. Neighbourhood Broadcasting in Hypercubes. SIAM Journal on Discrete Mathematics, 21(4):823-843, 2007. [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond and M-L. Yu. Vertex disjoint routings of cycles over tori. Networks, 49(3):217-225, 2007. [PDF ] [bibtex-entry]
     
  8. E. Birmelé, J. A. Bondy, and B. Reed. The Erdos-Posa property for long circuits. Combinatorica, 27:135-145, 2007. [bibtex-entry]
     
  9. P. Charbit, S. Thomassé, and A. Yeo. The minimum feedback arc set problem is NP-hard for tournament. Combinatorics, Probability and Computing, 16:1--4, 2007. [bibtex-entry]
     
  10. A. Ciaffaglione, L. Liquori, and M. Miculan. Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts. JAR, Journal of Automated Reasoning, 39:1--47, 2007. [PDF ] [bibtex-entry]
     
  11. D. Coudert, P. Datta, S. Perennes, H. Rivano, and M-E. Voge. Shared Risk Resource Group: Complexity and Approximability issues. Parallel Processing Letters, 17(2):169-184, June 2007. [PDF ] [Abstract] [bibtex-entry]
     
  12. D. Coudert, F. Huc, and J.-S. Sereni. Pathwidth of outerplanar graphs. Journal of Graph Theory, 55(1):27-41, May 2007. [PDF ] [Abstract] [bibtex-entry]
     
  13. S. Fiorini, N. Hardy, B. Reed, and A. Vetta. Approximate min-max relations for odd cycles in planar graphs. Mathematical Programming Ser. B, 110(1):71--91, 2007. [bibtex-entry]
     
  14. M. Flammini, R. Klasing, A. Navarra, and S. Pérennes. Improved approximation results for the Minimum Energy Broadcasting problem. Algorithmica, 49(4):318-336, 2007. [WWW ] [Abstract] [bibtex-entry]
     
  15. N. Fountoulakis and B. Reed. Faster Mixing and Small Bottlenecks. Probability Theory and Related Fields, 137:475-486, 2007. [bibtex-entry]
     
  16. J. Galtier and A. Laugier. Flow on data network and a positive semidefinite representable delay function. Journal of Interconnection Networks, 8(1):29--43, March 2007. [PDF ] [Abstract] [bibtex-entry]
     
  17. L. Grigori, M. Cosnard, and E. G. Ng. On the row merge for sparse LU factorization with partial pivoting. BIT Numerical Mathematics, 47(1):45--76, March 2007. [PDF ] [Abstract] [bibtex-entry]
     
  18. F. Honsell, M. Lenisa, and L. Liquori. A Framework for Defining Logical Frameworks. Electronic Notes in Theoretical Computer Science, 172:399 - 436, 2007.
    Note: Computation, Meaning, and Logic: Articles dedicated to Gordon Plotkin. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  19. L. Liquori and S. Ronchi Della Rocca. Intersection Typed System it à la Church. IC, Journal of Information and Computation, 205(9):1371--1386, September 2007. [WWW ] [PDF ] [bibtex-entry]
     
2006
  1. S. Alouf, E. Altman, J. Galtier, J.-F. Lalande, and C. Touati. Quasi-Optimal Resource Allocation in Multi-Spot MFTDMA Satellite Networks. In M. Cheng, Y. Li, and D.-Z. Du, editors,Combinatorial Optimization in Communication Networks, chapter 12, pages 325-366. Kluwer Academic Publishers, 2006. [PDF ] [bibtex-entry]
     
  2. J. Bang-Jensen, B. Reed, M. Schacht, R. Sámal, B. Toft, and U. Wagner. Topics in Discrete Mathematics, Dedicated to Jarik Nesetril on the Occasion of his 60th birthday, volume 26 of Algorithms and Combinatorics, chapter On six problems posed by Jarik Nesetril, pages 613--627. Springer, Berlin, M. Klazar, J. Kratochvil, M. Loebl, J. Matousek, R. Thomas and P. Valtr edition, 2006. [bibtex-entry]
     
  3. D. Bartha, P. Berthomé, M. Diallo, and A. Ferreira. Revisiting parametric multi-terminal problems: Maximum flows, minimum cuts and cut-tree computations. Discrete Optimization, 3(3):195--205, September 2006. [bibtex-entry]
     
  4. J. Becker, Z. Csizmadia, J. Galtier, A. Laugier, J. Szabó, and L. Szego. An integer programming approach to routing in Daisy networks. Networks, 47(2):116--121, 2006. [PDF ] [bibtex-entry]
     
  5. J-C. Bermond and D. Coudert. Handbook of Combinatorial Designs (2nd edition), volume 42 of Discrete mathematics and Applications, chapter VI.27, Grooming, pages 494-496. Chapman & Hall- CRC Press, editors C.J. Colbourn and J.H. Dinitz, November 2006. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  6. J-C. Bermond, J. Galtier, R. Klasing, N. Morales, and S. Pérennes. Hardness and approximation of Gathering in static radio networks. Parallel Processing Letters, 16(2):165--183, 2006. [PDF ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, F. Havet, and D. Tóth. Fault tolerant on board networks with priorities. Networks, 47(1):9--25, 2006. [PDF ] [Abstract] [bibtex-entry]
     
  8. S. Bessy, E. Birmelé, and F. Havet. Arc-chromatic number of digraphs in which each vertex has bounded outdegree or bounded indegree. Journal of Graph Theory, 53(4):315--332, 2006. [WWW ] [PDF ] [bibtex-entry]
     
  9. A. Bondy, J. Shen, S. Thomassé, and C. Thomassen. Density conditions for triangles in multipartite graphs. Combinatorica, 26(2):121--131, 2006. [bibtex-entry]
     
  10. D. J. Dougherty, P. Lescanne, and L. Liquori. Addressed Term Rewriting Systems: Application to a Typed Object Calculus. Journal of Mathematical Structures in Computer Science, 16(4):667--709, 2006. [PDF ] [bibtex-entry]
     
  11. M. Flammini, A. Navarra, and S. Pérennes. The Real Approximation Factor of the MST heuristic for the Minimum Energy Broadcasting. ACM Journal of Experimental Algorithmics, 11:1--13, 2006.
    Note: (Special Issue associated to the 4th International Workshop on Efficient and Experimental Algorithms (WEA 2005)). [bibtex-entry]
     
  12. F. Havet. Repartitors, selectors and superselectors. Journal of Interconnection Networks, 7(3):391--415, 2006. [PDF ] [bibtex-entry]
     
  13. F. Havet and J.-S. Sereni. Improper choosability of graphs and maximum average degree. Journal of Graph Theory, 52(3):181--199, 2006. [PDF ] [bibtex-entry]
     
  14. C. McDiarmid and B. Reed. Concentration for self-bounding functions and an inequality of talagrand. Random Structures and Algorithms, 29:549--557, 2006. [bibtex-entry]
     
  15. J. Moulierac, A. Guitton, and M. Molnár. Hierarchical Aggregation of Multicast Trees in Large Domains. Journal of Communications (JCM), 6(1):33--44, September 2006. [PDF ] [Abstract] [bibtex-entry]
     
  16. C. Touati, E. Altman, and J. Galtier. Generalized Nash Bargaining Solution for bandwidth allocation. Computer Networks, 50:3242--3263, 2006. [PDF ] [bibtex-entry]
     
2005
  1. L. Addario-Berry, R. E. L. Aldred, K. Dalal, and B. Reed. Vertex colouring edge partitions. J. Combin. Theory Ser. B, 94(2):237--244, 2005. [bibtex-entry]
     
  2. D. Avis, C. De Simone, and B. Reed. On the fractional chromatic index of a graph and its complement. Oper. Res. Lett., 33(4):385--388, 2005. [bibtex-entry]
     
  3. R. Bayon, N. Lygeros, and J.-S. Sereni. New progress in enumeration of mixed models. Applied Mathematics E-Notes, 5:60--65, 2005. [WWW ] [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, C. Colbourn, D. Coudert, G. Ge, A. Ling, and X. Muñoz. Traffic Grooming in Unidirectional WDM Rings With Grooming Ratio C=6. SIAM Journal on Discrete Mathematics, 19(2):523-542, 2005. [PDF ] [Abstract] [bibtex-entry]
     
  5. S. Choplin, A. Jarry, and S. Pérennes. Virtual network embedding in the cycle. Discrete Applied Mathematics, 145(3):368--375, 2005. [bibtex-entry]
     
  6. C. Cooper, R. Klasing, and M. Zito. Lower Bounds and Algorithms for Dominating Sets in Web Graphs. Internet Mathematics, 2(3):275--300, 2005. [bibtex-entry]
     
  7. D. J. Dougherty, P. Lescanne, L. Liquori, and F. Lang. Addressed Term Rewriting Systems: Syntax, Semantics, and Pragmatics: Extended Abstract. TERMGRAPH: International Workshop on Computing with Terms and Graphs. Electr. Notes Theor. Comput. Sci., 127(5):57--82, 2005. [POSTSCRIPT ] [bibtex-entry]
     
  8. H. Everett, C. M. H. de Figueiredo, S. Klein, and B. Reed. The perfection and recognition of bull-reducible Berge graphs. Theor. Inform. Appl., 39(1):145--160, 2005. [bibtex-entry]
     
  9. B. Farzad, M. Molloy, and B. Reed. $(\Delta-k)$-critical graphs. J. Combin. Theory Ser. B, 93(2):173--185, 2005. [bibtex-entry]
     
  10. M. Flammini and S. Pérennes. Lower bounds on systolic gossip. Information and Computation, 196(2):71--94, 2005. [bibtex-entry]
     
  11. L. Liquori and S. Ronchi Della Rocca. Towards an Intersection Typed System it à la Church. ITRS: Workshop on Intersection Types and Related Systems. Electr. Notes Theor. Comput. Sci., 136:43--56, 2005. [POSTSCRIPT ] [bibtex-entry]
     
  12. L. Liquori and B. Wack. The Polymorphic Rewriting-calculus: [Type Checking vs. Type Inference]. WRLA: International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci., 117:89--111, 2005. [POSTSCRIPT ] [bibtex-entry]
     
  13. B. Reed and B. Sudakov. List colouring when the chromatic number is close to the order of the graph. Combinatorica, 25(1):117--123, 2005. [bibtex-entry]
     
2004
  1. J-C. Bermond, C.J. Colbourn, A. Ling, and M-L. Yu. Grooming in unidirectional rings : $K_4 -e$ designs. Discrete Mathematics, Lindner's Volume, 284(1-3):57--62, 2004. [PDF ] [bibtex-entry]
     
  2. H.-J. Böckenhauer, D. Bongartz, J. Hromkovic, R. Klasing, G. Proietti, S. Seibert, and W. Unger. On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality. Theoretical Computer Science, 326(1--3):137--153, 2004. [bibtex-entry]
     
  3. I. Caragiannis, A. Ferreira, C. Kaklamanis, S. Pérennes, P. Persiano, and H. Rivano. Approximate Constrained Bipartite Edge Coloring. Discrete Applied Mathematics, 143(1-3):54--61, September 2004. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  4. S. Céroi and F. Havet. Trees with three leaves are $(n+1)$-unavoidable. Discrete Applied Mathematics, 141:19--39, 2004. [PDF ] [bibtex-entry]
     
  5. M. Cosnard, E. Jeannot, and T. Yang. Compact Dag Representation and its Symbolic Scheduling. Journal of Parallel and Distributed Computing, 64(8):921--935, August 2004. [bibtex-entry]
     
  6. S. Dantas, C. M. H. de Figueiredo, S. Klein, S. Gravier, and B. Reed. Stable skew partition problem. Discrete Appl. Math., 143(1-3):17--22, 2004. [bibtex-entry]
     
  7. M. DeVos, G. Ding, B. Oporowski, D. P. Sanders, B. Reed, P. Seymour, and D. Vertigan. Excluding any graph as a minor allows a low tree-width 2-coloring. J. Combin. Theory Ser. B, 91(1):25--41, 2004. [bibtex-entry]
     
  8. A. Ferreira. Building a reference combinatorial model for MANETs. IEEE Network, 18(5):24--29, 2004. [bibtex-entry]
     
  9. G. Fertin, A. Raspaud, and B. Reed. Star coloring of graphs. J. Graph Theory, 47(3):163--182, 2004. [bibtex-entry]
     
  10. M. Flammini and S. Pérennes. Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols. SIAM Journal on Discrete Mathematics, 17(4):521--540, 2004. [PDF ] [bibtex-entry]
     
  11. C. Gavoille, D. Peleg, S. Pérennes, and R. Raz. Distance labeling in Graphs. Journal of Algorithms, 53(1):85--112, 2004. [PDF ] [bibtex-entry]
     
  12. F. Havet. Pancyclic arcs and connectivity in tournaments. Journal of Graph Theory, 47(2):87--110, 2004. [PDF ] [bibtex-entry]
     
  13. F. Havet. Stable set meeting every longest path. Discrete Mathematics, 289(1--3):169--173, 2004. [PDF ] [bibtex-entry]
     
  14. F. Havet and M. Wennink. The Push Tree Problem. Networks, 44(4):281--291, 2004. [PDF ] [bibtex-entry]
     
  15. C. T. Hoàng and B. Reed. On the co-$P\sb 3$-structure of perfect graphs. SIAM J. Discrete Math., 18(3):571--576 (electronic), 2004/05. [bibtex-entry]
     
  16. R. Klasing and C. Laforest. Hardness results and approximation algorithms of $k$-tuple domination in graphs. Information Processing Letters, 89(2):75--83, 2004. [WWW ] [bibtex-entry]
     
  17. B. Reed and P. Seymour. Hadwiger's conjecture for line graphs. European J. Combin., 25(6):873--876, 2004. [bibtex-entry]
     
  18. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Oper. Res. Lett., 32(4):299--301, 2004. [bibtex-entry]
     
  19. B. Reed, S. W. Song, and J. L. Szwarcfiter. Preface [Brazilian Symposium on Graphs, Algorithms and Combinatorics]. Discrete Appl. Math., 141(1-3):1, 2004.
    Note: Held in Fortaleza, 2001. [bibtex-entry]
     
2003
  1. R. Balakhrishnan, J-C. Bermond, P. Paulraja, and M-L. Yu. On Hamilton cycle decompositions of the tensor product of complete graphs. Discrete Mathematics, 268:49--58, 2003. [PDF ] [bibtex-entry]
     
  2. O. Barrientos, R. Correa, P. Reyes, and A. Valdebenito. A Branch and Bound Method for Solving Integer Separable Concave Problems. Comput. Optim. Appl., 26(2):155--171, 2003. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  3. J-C. Bermond, J. Bond, D. Peleg, and S. Pérennes. The power of small coalitions in graphs. Discrete Applied Mathematics, Editor's Choice, 127(3):399-414, 2003. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond and S. Ceroi. Minimizing SONET ADMs in unidirectional WDM rings with grooming ratio 3. Networks, 41(2):83--86, 2003. [PDF ] [bibtex-entry]
     
  5. J-C. Bermond, S. Choplin, and S. Pérennes. Hierarchical ring networks design. Theory of Computing Systems, 36(6):663--682, 2003. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, D. Coudert, and M-L. Yu. On DRC-Covering of $K_n$ by cycles. Journal of Combinatorial Designs, 11(2):100-112, 2003. [WWW ] [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  7. J-C. Bermond, M. Di Ianni, M. Flammini, and S. Pérennes. Acyclic orientations for deadlock prevention in usual networks. Discrete Applied Mathematics, 129(1):31--47, 2003. [PDF ] [bibtex-entry]
     
  8. J-C. Bermond, N. Marlin, D. Peleg, and S. Pérennes. Directed Virtual Path Layout in ATM networks. Theoretical Computer Science, 291(1):3--28, 2003. [PDF ] [bibtex-entry]
     
  9. B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267--285, April 2003. [bibtex-entry]
     
  10. G. Calinescu, C. G. Fernandes, and B. Reed. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. J. Algorithms, 48(2):333--359, 2003. [bibtex-entry]
     
  11. H. Cirstea, C. Kirchner, L. Liquori, and B. Wack. Rewrite strategies in the Rewriting Calculus. WRS, International Workshop on Reduction Strategies in Rewriting and Programming. Electr. Notes Theor. Comput. Sci., 86(4), 2003. [POSTSCRIPT ] [bibtex-entry]
     
  12. A. Clementi, A. Ferreira, P. Penna, S. Pérennes, and R. Silvestri. The Minimum Range Assignment Problem on Linear Radio Networks. Algorithmica, 35(2):95--110, 2003. [bibtex-entry]
     
  13. D. Coudert and X. Muñoz. Recent Research Developments in Optics, 3, chapter 37, Graph Theory and Traffic Grooming in WDM Rings, pages 759-778. Research Signpost. Kerala, India, 2003.
    Note: ISBN: 81-271-0028-5. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  14. A. Ferreira, S. Pérennes, A. W. Richa, H. Rivano, and N. Stier. Models, Complexity and Algorithms for the Design of Multi-fiber WDM Networks. Telecommunication Systems, 24(2):123--138, October 2003. [WWW ] [PDF ] [Abstract] [bibtex-entry]
     
  15. J. Galtier, F. Hurtado, M. Noy, S. Pérennes, and J. Hurrutia. Simultaneous edge flipping in triangulations. International Journal of Computational Geometry and Applications, 13(2):113--133, 2003. [bibtex-entry]
     
  16. O. Goldschmidt, A. Laugier, and E. Olinick. SONET/SDH ring assignment with capacity constraints. Discrete Applied Math., 129:99--128, June 2003. [PDF ] [bibtex-entry]
     
  17. F. Havet. On unavoidability of trees with $k$ leaves. Graphs and Combinatorics, 19:101--110, 2003. [PDF ] [bibtex-entry]
     
  18. M. Loebl, J. Nesetril, and B. Reed. A note on random homomorphism from arbitrary graphs to $\mathbb Z$. Discrete Math., 273(1-3):173--181, 2003.
    Note: EuroComb'01 (Barcelona). [bibtex-entry]
     
  19. C. McDiarmid and B. Reed. Channel assignment on graphs of bounded treewidth. Discrete Math., 273(1-3):183--192, 2003.
    Note: EuroComb'01 (Barcelona). [bibtex-entry]
     
  20. B. Reed. Algorithmic aspects of tree width. In Recent advances in algorithms and combinatorics, volume 11 of CMS Books Math./Ouvrages Math. SMC, pages 85--107. Springer, New York, 2003. [bibtex-entry]
     
  21. B. Reed. The height of a random binary search tree. J. ACM, 50(3):306--332 (electronic), 2003. [bibtex-entry]
     
  22. C. Touati, E. Altman, and J. Galtier. Semi-definite programming approach for bandwidth allocation and routing in networks. Game Theory and Applications, 9:169--179, 2003. [bibtex-entry]
     
2002
  1. B. Beauquier and E. Darrot. On Arbitrary Size Waksman Networks and their Vulnerability. Parallel Processing Letters, 12(3), 2002. [bibtex-entry]
     
  2. J-C. Bermond, E. Darrot, and O. Delmas. Design of fault tolerant on-board networks in satellites. Networks, 40:202--207, 2002. [PDF ] [bibtex-entry]
     
  3. H.-J. Böckenhauer, J. Hromkovic, R. Klasing, S. Seibert, and W. Unger. Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. Theoretical Computer Science, 285(1):3--24, 2002. [bibtex-entry]
     
  4. E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP. Algorithmica, 33:183--200, 2002. [bibtex-entry]
     
  5. H. Cirstea, C. Kirchner, and L. Liquori. Rewriting Calculus with(out) Types. WRLA, International Workshop on Rewriting Logic and its Applications. Electr. Notes Theor. Comput. Sci., 71, 2002. [POSTSCRIPT ] [bibtex-entry]
     
  6. C. Cooper, A. Frieze, B. Reed, and O. Riordan. Random regular graphs of non-constant degree: independence and chromatic number. Combin. Probab. Comput., 11(4):323--341, 2002. [bibtex-entry]
     
  7. C. Cooper, A. Frieze, and B. Reed. Random regular graphs of non-constant degree: connectivity and Hamiltonicity. Combin. Probab. Comput., 11(3):249--261, 2002. [bibtex-entry]
     
  8. M. Cosnard. Introduction to the Complexity of Parallel Algorithms. In R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, editors,Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications, Applied Optimization, chapter 1, part I, pages 3--25. Kluwer Academic Publishers, Boston (USA), 2002. [bibtex-entry]
     
  9. D. Coudert, A. Ferreira, and S. Pérennes. Isomorphisms of the De Bruijn Digraph and Free-Space Optical Networks. Networks (Wiley-Interscience), 40(3):155-164, October 2002. [PDF ] [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  10. L. Devroye, C. McDiarmid, and B. Reed. Giant components for two expanding graph processes. In Mathematics and computer science, II (Versailles, 2002), Trends Math., pages 161--173. Birkhäuser, Basel, 2002. [bibtex-entry]
     
  11. A. Ferreira, J. Galtier, and P. Penna. Topological design, routing and hand-over in satellite networks. In I. Stojmenovic, editor,Handbook of Wireless Networks and Mobile Computing, pages 473--507. John Wiley and Sons, 2002. [PDF ] [bibtex-entry]
     
  12. A. Ferreira and I. Guérin-Lassous. Discrete Computing with Coarse Grained Systems. In R. Corrêa, I. Dutra, M. Fiallos, and F. Gomes, editors,Parallel and Distributed Algorithms: Theory, Algorithmic Techniques and Applications, Applied Optimization, chapter 5, part I, pages 117--143. Kluwer Academic Publishers, Boston (USA), 2002. [bibtex-entry]
     
  13. A. Ferreira, I. Guérin-Lassous, K. Marcus, and A. Rau-Chaplin. Parallel Computation on Interval Graphs: Algorithms and Experiments. Concurrency and Computation - Practice and Experience, 56(1):47--70, january 2002. [bibtex-entry]
     
  14. A. Ferreira. Parallel Computing: Models. In C. Floudas and P. Pardalos, editors,Encyclopedia of Optimization. Kluwer Academic Publisher, Boston (USA), 2002. [bibtex-entry]
     
  15. F. Havet and J. Zerovnik. Finding a Five Bicolouring of a Triangle-Free Subgraph of the Triangular Lattice. Discrete Mathematics, 244:103--108, 2002. [bibtex-entry]
     
  16. F. Havet. Trees in Tournament. Discrete Mathematics, 243(1--3):121--134, 2002. [PDF ] [bibtex-entry]
     
  17. B. Reed and B. Sudakov. Asymptotically the list colouring constants are 1. J. Combin. Theory Ser. B, 86(1):27--37, 2002. [bibtex-entry]
     
2001
  1. J.-P. Allouche and M. Cosnard. Non-integer bases, iteration of continuous real maps, and an arithmetic self-similar set. Acta Mathematica Hungarica, 91:325--332, 2001. [bibtex-entry]
     
  2. E. Altman, E. Baçsar, T. Jiménez, and N. Shimkin. Competitive Routing in Networks with Polynomial Cost. IEEE Trans. on Automatic Control, 2001. [bibtex-entry]
     
  3. E. Altman, T. Jiménez, and G. Koole. Comparing tandem queueing systems and their fluid limits. PEIS, (2), 2001. [bibtex-entry]
     
  4. B. Beauquier, O. Delmas, and S. Pérennes. Tight Bounds for Broadcasting in the Linear Cost Model. Journal of Interconnection Network, 2(2):175--188, 2001. [bibtex-entry]
     
  5. P. Bergé, A. Ferreira, J. Galtier, and J.-N. Petit. A Probabilistic Study of Inter-Satellite Links Load in Polar Orbit Satellite Constellations. International Journal on Telecommunication Systems, 18(1-3):123--135, 2001. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, X. Muñoz, and A. Marchetti-Spaccamela. A Broadcasting Protocol in Line Digraphs. Journal of Parallel and Distributed Computing, 61(8):1013--1032, August 2001. [PDF ] [bibtex-entry]
     
  7. M. Cosnard and E. Jeannot. Automatic Parallelization Techniques Based on Compact DAG Extraction and Symbolic Scheduling. Parallel Processing Letters, 11(1):151--168, 2001. [bibtex-entry]
     
  8. M. Diallo, A. Ferreira, and A. Rau-Chaplin. A note on communication-efficient deterministic p aralle algorithms for planar point location and 2D Voronoi diagram. Parallel Processing Letters, 11(2/3):327--340, 2001. [bibtex-entry]
     
  9. H. Everett, C. M. H. de Figueiredo, C. Linhares-Sales, F. Maffray, O. Porto, and B. Reed. Even pairs. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 67--92. Wiley, Chichester, 2001. [bibtex-entry]
     
  10. A. Ferreira, J. Galtier, J.-N. Petit, and H. Rivano. Re-routing algorithms in a meshed satellite constellation. Annals of Telecommunications, 56(3/4):169--174, march/april 2001. [PDF ] [Abstract] [bibtex-entry]
     
  11. A. Ferreira. Parallel Computing: Models. In C. A. Floudas and P. Pardalos, editors,Encyclopedia of Optimization -- Vol. IV, pages 264--269. Kluwer Academic Publisher, Boston (USA), 2001. [bibtex-entry]
     
  12. M. Flammini and S. Pérennes. On the optimality of general lower bounds for broadcasting and gossiping. SIAM J. Discrete Math., 14(2):267--282, 2001. [bibtex-entry]
     
  13. P. Fraigniaud, A. Pelc, D. Peleg, and S. Pérennes. Assigning labels in unknown network with a leader. Distributed Computing, 14(3):163--183, 2001. [bibtex-entry]
     
  14. J. Galtier. Geographical reservation for guaranteed handover and routing in low earth orbit constellations. Telecommunication Systems, 18(1/3):101--121, 2001. [PDF ] [bibtex-entry]
     
  15. L. Gargano, P. Hell, and S. Pérennes. Coloring all directed paths in a symmetric tree, with an application to optical networks. Journal of Graph Theory, 38(4):183--196, 2001. [bibtex-entry]
     
  16. L. Gargano, A. Pelc, S. Pérennes, and U. Vaccaro. Efficient communication in unknown networks. Networks, 38(1):39--49, 2001. [bibtex-entry]
     
  17. F. Havet. Channel assignement and multicolouring of the induced subgraphs of the triangular lattice. Discrete Mathematics, 233:219--231, 2001. [bibtex-entry]
     
  18. R. Hayward and B. Reed. Forbidding holes and antiholes. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 113--137. Wiley, Chichester, 2001. [bibtex-entry]
     
  19. M.-C. Heydemann, N. Marlin, and S. Pérennes. Complete Rotations in Cayley Graphs. European Journal of Combinatorics, 22(2):179-196, 2001. [WWW ] [bibtex-entry]
     
  20. C. Linhares-Sales, F. Maffray, and B. Reed. Recognizing planar strict quasi-parity graphs. Graphs Combin., 17(4):745--757, 2001. [bibtex-entry]
     
  21. D. Rautenbach and B. Reed. The Erdos-Pósa property for odd cycles in highly connected graphs. Combinatorica, 21(2):267--278, 2001.
    Note: Paul Erdos and his mathematics (Budapest, 1999). [bibtex-entry]
     
  22. B. Reed. A gentle introduction to semi-definite programming. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 233--259. Wiley, Chichester, 2001. [bibtex-entry]
     
  23. B. Reed. From conjecture to theorem. In Perfect graphs, Wiley-Intersci. Ser. Discrete Math. Optim., pages 13--24. Wiley, Chichester, 2001. [bibtex-entry]
     
2000
  1. E. Altman, E. Baçsar, T. Jiménez, and N. Shimkin. Routing into Two Parallel Links:Game-Theoretic Distributed Algorithms. Journal of Parallel and Distributed Computing, (Special Issue on Routing in Computer and Communication Networks), 2000. [bibtex-entry]
     
  2. E. Altman, T. Jiménez, and G. Koole. On optimal call admission control. IEEE Trans. on Communications, 2000. [bibtex-entry]
     
  3. M. Becker, A.-L. Beylot, O. Dalle, R. Dhaou, M. Marot, P. Mussi, C. Rigal, and V. Sutter. The ASIMUT Simulation Workshop. Networking and Information Systems Journal, 3(2):335--348, 2000. [bibtex-entry]
     
  4. C. Berge and B. Reed. Optimal packings of edge-disjoint odd cycles. Discrete Math., 211(1-3):197--202, 2000. [bibtex-entry]
     
  5. J-C. Bermond, J. Bond, C. Martin, A. Pekec, and F. S. Roberts. Optimal orientation of annular networks. JOIN, 1(1):21-46, 2000. [PDF ] [bibtex-entry]
     
  6. J-C. Bermond, L. Gargano, S. Pérennes, A.A. Rescigno, and U. Vaccaro. Efficient Collective Communications in Optical Networks. Theoretical Computer Science, 233(1-2):165--189, 2000. [PDF ] [bibtex-entry]
     
  7. J-C. Bermond, S. Marshall, and M-L. Yu. Improved bounds for gossiping in mesh-bus networks. JOIN, 1(1):1-19, 2000. [PDF ] [bibtex-entry]
     
  8. P. Berthomé, A. Ferreira, S. Pérennes, G. Plaxton, and B. Maggs. Sorting-based selection algorithms on hypercubic networks. Algorithmica, 26(2):237--254, 2000. [bibtex-entry]
     
  9. M. Bugliesi, G. Delzanno, L. Liquori, and M. Martelli. Object Calculi in Linear Logic. Journal of Logic and Computation, 10(1):75--104, 2000. [POSTSCRIPT ] [bibtex-entry]
     
  10. D. Coudert, A. Ferreira, and X. Muñoz. Topologies for Optical Interconnection Networks Based on the Optical Transpose Interconnection System. OSA Applied Optics -- Information Processing, 39(17):2965-2974, June 2000. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  11. D. Coudert, A. Ferreira, and X. Muñoz. A Multihop-Multi-OPS Optical Interconnection Network. IEEE/OSA Journal of Lightwave Technology, 18(12):2076-2085, 2000. [POSTSCRIPT ] [Abstract] [bibtex-entry]
     
  12. A. Ferreira, A. Goldman, and S. W. Song. Broadcasting in bus interconnection networks. Journal of Interconnection Networks - JOIN, 1(2):73--94, 2000. [bibtex-entry]
     
  13. A. Ferreira and Nicolas Schabanel. A randomized BSP/CGM algorithm for the maximal independent set. Parallel Processing Letters, 9(3):411--422, 2000. [bibtex-entry]
     
  14. J. Galtier. Load Balancing Issues in the Prepartitioning Method. Computers and Artificial Intelligence, 19(4), 2000. [PDF ] [bibtex-entry]
     
  15. C. McDiarmid and B. Reed. Channel assignment and weighted coloring. Networks, 36(2):114--117, 2000. [bibtex-entry]
     
  16. L. Perkovic and B. Reed. An improved algorithm for finding tree decompositions of small width. Internat. J. Found. Comput. Sci., 11(3):365--371, 2000.
    Note: Selected papers from the Workshop on Theoretical Aspects of Computer Science (WG 99), Part 1 (Ascona). [bibtex-entry]
     
  17. B. Reed and R. Thomas. Clique minors in graphs and their complements. J. Combin. Theory Ser. B, 78(1):81--85, 2000. [bibtex-entry]
     
1999
  1. R. Balakhrishnan, J-C. Bermond, and P. Paulraja. Combinatorics and Number Theory. In Editors Special Issues of Discrete Mathematics, volume 206, pages 1-220. North Holland, 1999. [bibtex-entry]
     
  2. B. Beauquier. All-To-All Communication in some Wavelength-Routed All-Optical Networks. Networks, 33(3):179--187, May 1999. [bibtex-entry]
     
  3. C. Berge and B. Reed. Edge-disjoint odd cycles in graphs with small chromatic number. Ann. Inst. Fourier (Grenoble), 49(3):783--786, 1999.
    Note: Symposium à la Mémoire de François Jaeger (Grenoble, 1998). [bibtex-entry]
     
  4. J-C. Bermond, A. Bonnecaze, T. Kodate, S. Pérennes, and P. Solé. Symetric flows and broadcasting in hypercubes. Annales de l'Institut Fourier, 49:787-807, 1999. [PDF ] [bibtex-entry]
     
  5. V. Bono, M. Bugliesi, M. Dezani-Ciancaglini, and L. Liquori. Subtyping for Extensible, Incomplete Objects. Fundamenta Informaticae, 38(4):325--364, 1999. [POSTSCRIPT ] [bibtex-entry]
     
  6. R. Corrêa, A. Ferreira, and P. Rebreyend. Integrating list heuristics in genetic algorithms for multiprocessor scheduling. IEEE Transactions on Parallel and Distributed Systems, 10(8):825-837, August 1999. [bibtex-entry]
     
  7. R. Corrêa, A. Ferreira, and P. Rebreyend. Scheduling multiprocessor tasks with genetic algorithms. IEEE Transactions on Parallel and Distributed Systems, 10(8):825-837, August 1999. [bibtex-entry]
     
  8. M. Diallo, A. Ferreira, A. Rau-Chaplin, and S. Ubéda. Scalable 2d convex hull and triangulation algorithms for coarse-grained multicomputers. Journal of Parallel and Distributed Computing, 56(1):47--70, January 1999. [bibtex-entry]
     
  9. A. Ferreira, C. Kenyon, A. Rau-Chaplin, and S. Ubéda. d-Dimensional Range Search on Multicomputers. Algorithmica, 24(3/4):195-208, 1999.
    Note: Special Issue on Coarse Grained Parallel Algorithms. [bibtex-entry]
     
  10. A. Ferreira and S. Ubéda. Computing the medial axis transform in parallel with 8 scan operations. IEEE Transactions on Pattern Analysis & Machine Intelligence (PAMI), 21(3):277-282, March 1999. [bibtex-entry]
     
  11. A. Ferreira. On the design of parallel discrete algorithms for high performance computing systems. In P. Pardalos, editor,Parallel Processing of Discrete Problems, volume 106 of The IMA Volumes in Mathematics and its Aplications, pages 75-83. Springer Verlag, New York (USA), 1999. [bibtex-entry]
     
  12. A. Ferreira. On the design of parallel discrete algorithms for high performance computing systems. In P. Pardalos, editor,Parallel Processing of Discrete Problems, volume 106 of The IMA Volumes in Mathematics and its Aplications, pages 75-83. Springer Verlag, New York (USA), 1999. [bibtex-entry]
     
  13. Hugh Hind, M. Molloy, and B. Reed. Total coloring with $\Delta+{\rm poly}(\log\Delta)$ colors. SIAM J. Comput., 28(3):816--821 (electronic), 1999. [bibtex-entry]
     
  14. F. Maffray and B. Reed. A description of claw-free perfect graphs. J. Combin. Theory Ser. B, 75(1):134--156, 1999. [bibtex-entry]
     
  15. N. V. R. Mahadev and B. A. Reed. A note on vertex orders for stability number. J. Graph Theory, 30(2):113--120, 1999. [bibtex-entry]
     
  16. C. McDiarmid and B. Reed. Colouring proximity graphs in the plane. Discrete Math., 199(1-3):123--137, 1999. [bibtex-entry]
     
  17. M. Molloy and B. Reed. Critical subgraphs of a random graph. Electron. J. Combin., 6:Research Paper 35, 13 pp. (electronic), 1999. [bibtex-entry]
     
  18. M. Molloy and B. Reed. Graph colouring via the probabilistic method. In Graph theory and combinatorial biology (Balatonlelle, 1996), volume 7 of Bolyai Soc. Math. Stud., pages 125--155. János Bolyai Math. Soc., Budapest, 1999. [bibtex-entry]
     
  19. M. Molloy, B. Reed, and William Steiger. On the mixing rate of the triangulation walk. In Randomization methods in algorithm design (Princeton, NJ, 1997), volume 43 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 179--190. Amer. Math. Soc., Providence, RI, 1999. [bibtex-entry]
     
  20. B. Reed. A strengthening of Brooks' theorem. J. Combin. Theory Ser. B, 76(2):136--149, 1999. [bibtex-entry]
     
  21. B. Reed. Edge coloring nearly bipartite graphs. Oper. Res. Lett., 24(1-2):11--14, 1999. [bibtex-entry]
     
  22. B. Reed. Mangoes and blueberries. Combinatorica, 19(2):267--296, 1999. [bibtex-entry]
     
  23. B. Reed. The list colouring constants. J. Graph Theory, 31(2):149--153, 1999. [bibtex-entry]
     
1998
  1. B. Beauquier, P. Hell, and S. Pérennes. Optimal Wavelength-routed Multicasting. DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, 84(1-3), May 1998. [WWW ] [bibtex-entry]
     
  2. J-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton circuits in the directed wrapped butterfly network. Discrete Applied Mathematics, 84(1-3):21-42, 1998. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, E. Darrot, O. Delmas, and S. Pérennes. Hamilton cycle decomposition of the butterfly networks. Parallel Processing Letters, 8(3):371-385, 1998. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, L. Gargano, and S. Pérennes. Optimal sequential gossiping by short messages. Discrete Applied Mathematics, 86(2-3):145-155, 1998. [PDF ] [bibtex-entry]
     
  5. J-C. Bermond, L. Gargano, A.A. Rescigno, and U. Vaccaro. Fast gossiping by short messages. SIAM Journal on Computing, 27(4):917-941, 1998. [PDF ] [bibtex-entry]
     
  6. H. Bourdin, A. Ferreira, and K. Marcus. A performance comparison between graph and hypergraph topologies for passive star WDM lightwave networks. Computer Networks and ISDN Systems, 8(30):805-819, May 1998. [bibtex-entry]
     
  7. R. Corrêa, A. Ferreira, and S. Porto. Selected Algorithmic Techniques for Parallel Optimization. In D. Du and P. Pardalos, editors,Handbook of Combinatorial Optimization, volume 3, pages 407-456. Kluwer Academic Publisher, Boston (USA), 1998. [bibtex-entry]
     
  8. A. Ferreira and I. Guérin-Lassous. Algorithmique discrète parallèle : le chaînon manquant. In J.-F. Myoupo, editor,Parallélisme et Répartitions, chapter II, pages 23-47. Hermes, Paris (F), 1998. [bibtex-entry]
     
  9. A. Ferreira. Towards effective models for OPS--based lightwave networks. In P. Berthomé and A. Ferreira, editors,Optical Interconnects and Parallel Processing: Trends at the Interface, pages 209-233. Kluwer Academic Publisher, Boston (USA), 1998. [bibtex-entry]
     
  10. A. M. Frieze and B. Reed. Probabilistic analysis of algorithms. In Probabilistic methods for algorithmic discrete mathematics, volume 16 of Algorithms Combin., pages 36--92. Springer, Berlin, 1998. [bibtex-entry]
     
  11. M. Molloy and B. Reed. The size of the giant component of a random graph with a given degree sequence. Combin. Probab. Comput., 7(3):295--305, 1998. [bibtex-entry]
     
  12. M. Molloy and B. Reed. A bound on the total chromatic number. Combinatorica, 18(2):241--280, 1998. [bibtex-entry]
     
  13. S. Perennes. Broadcasting and gossiping on de Bruijn, shuffle exchange and similar networks.. Discrete Applied Mathematics, 83:247-262, 1998. [bibtex-entry]
     
  14. B. Reed and P. Seymour. Fractional colouring and Hadwiger's conjecture. J. Combin. Theory Ser. B, 74(2):147--152, 1998. [bibtex-entry]
     
  15. B. Reed. $\omega,\ \Delta$, and $\chi$. J. Graph Theory, 27(4):177--212, 1998. [bibtex-entry]
     
1997
  1. J-C. Bermond, R. Dawes, and F.O. Ergincan. De Bruijn and Kautz bus networks. Networks, 30:205-218, 1997. [PDF ] [bibtex-entry]
     
  2. J-C. Bermond, H.A. Harutyunyan, A.L. Liestman, and S. Pérennes. A note on the dimensionalityof modified Knödel Graphs. International Journal of Foundations of Computer Science, 8(2):109-116, 1997. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, Z. Liu, and M. Syska. Mean eccentricities of de Bruijn networks. Networks, 30:187-203, 1997. [PDF ] [bibtex-entry]
     
  4. P. Berthomé and A. Ferreira. Communication Issues in Parallel Systems with Optical Interconnections. International Journal of Foundations of Computer Science, 8(2):143--162, 1997.
    Note: Special Issue on Interconnection Networks. [bibtex-entry]
     
  5. M. Cosnard and E. Goles. Discrete state neural networks and energies. Neural Networks, 10(2):327-334, 1997. [bibtex-entry]
     
  6. H. Everett, S. Klein, and B. Reed. An algorithm for finding homogeneous pairs. Discrete Appl. Math., 72(3):209--218, 1997. [bibtex-entry]
     
  7. A. Ferreira and M. Morvan. Models for Parallel Algorithm Design: An Introduction. In A. Migdalas, P. Pardalos, and S. Storoy, editors,Parallel Computing in Optimization, pages 1--26. Kluwer Academic Publisher, Boston (USA), 1997. [bibtex-entry]
     
  8. B. Gaujal, A. Jean-Marie, P. Mussi, and G. Siegel. High speed simulation of discrete event systems by mixing process oriented and equational approaches. Parallel Computing, 23(1-2):219--233, April 1997. [bibtex-entry]
     
  9. H. Hind, M. Molloy, and B. Reed. Colouring a graph frugally. Combinatorica, 17(4):469--482, 1997. [bibtex-entry]
     
  10. C. Linhares-Sales, F. Maffray, and B. Reed. On planar perfectly contractile graphs. Graphs Combin., 13(2):167--187, 1997. [bibtex-entry]
     
  11. M. Molloy and B. Reed. A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B, 69(2):103--109, 1997. [bibtex-entry]
     
  12. S. Perennes. A Proof of Jean de Rumeur's conjecture. Discrete Applied Mathematics, 74:295-299, 1997. [bibtex-entry]
     
  13. L. Perkovic and B. Reed. Edge coloring regular graphs of high degree. Discrete Math., 165/166:567--578, 1997.
    Note: Graphs and combinatorics (Marseille, 1995). [bibtex-entry]
     
  14. B. A. Reed. Tree width and tangles: a new connectivity measure and some applications. In Surveys in combinatorics, 1997 (London), volume 241 of London Math. Soc. Lecture Note Ser., pages 87--162. Cambridge Univ. Press, Cambridge, 1997. [bibtex-entry]
     
  15. S. van Bakel, L. Liquori, S. Ronchi della Rocca, and P. Urzyczyn. Comparing Cubes of Typed and Type Assignment System. Annals of Pure and Applied Logics, 86(3):267--303, 1997. [POSTSCRIPT ] [bibtex-entry]
     
1996
  1. F. Baude, F. Belloncle, D. Caromel, N. Furmento, P. Mussi, Y. Roudier, and G. Siegel. Parallel Object-Oriented Programming for Parallel Simulations. Information Sciences, 1996. [bibtex-entry]
     
  2. J-C. Bermond and F.O. Ergincan. Bus Interconnection Networks. Discrete Applied Mathematics, 68:1-15, 1996. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, C. Peyrat, I. Sakho, and M. Tchuente. Parallelization of Gauss elimination algorithm on systolic arrays. Journal of Parallel and Distributed Computing, 33:69--75, 1996. [bibtex-entry]
     
  4. P. Berthomé, A. Ferreira, and S. Pérennes. Decomposing hierarchical Cayley graphs, with applications to information dissemination and algorithm design. IEEE Transactions on Parallel and Distributed Systems, 7(12):1292--1300, December 1996. [bibtex-entry]
     
  5. O. Bournez and M. Cosnard. On the computational power of dynamical systems and hybrid systems. Theoretical Computer Science, 168(2):417--459, 1996. [bibtex-entry]
     
  6. C. Cooper, A. Frieze, M. Molloy, and B. Reed. Perfect matchings in random $r$-regular, $s$-uniform hypergraphs. Combin. Probab. Comput., 5(1):1--14, 1996. [bibtex-entry]
     
  7. R. Corrêa and A. Ferreira. Parallel Best-First Branch-and-Bound in Discrete Optimization: A Framework. In A. Ferreira and P. Pardalos, editors,Solving Combinatorial Optimization Problems in Parallel, volume 1054 of LNCS State-of-the-Art Surveys, pages 171--200. Springer-Verlag, 1996. [bibtex-entry]
     
  8. A. Ferreira, A. Goldman, and S. W. Song. Gossiping in bus interconnection networks. Parallel Algorithms and Applications, 8:309--331, 1996.
    Note: Special Issue on Algorithms for Enhanced Meshes. [bibtex-entry]
     
  9. A. Ferreira and M. Grammatikakis. Randomized routing in generalized hypercubes. Theoretical Computer Science, 158(1--2):53--64, 1996. [bibtex-entry]
     
  10. A. Ferreira and P. Pardalos. SCOOP -- Solving Combinatorial Optimization Problems in Parallel. In A. Ferreira and P. Pardalos, editors,Solving Combinatorial Optimization Problems in Parallel, volume 1054 of LNCS State-of-the-Art Surveys, pages 1--6. Springer-Verlag, 1996. [bibtex-entry]
     
  11. A. Ferreira and J.M. Robson. Fast and Scalable Parallel Algorithms for Knapsack and Similar Problems. Journal of Parallel and Distributed Computing, 39(1):1--13, November 1996. [bibtex-entry]
     
  12. A. Ferreira. Parallel and Communication Algorithms for Hypercube Multiprocessors. In A. Zomaya, editor,Handbook of Parallel and Distributed Computing, chapter 19, pages 568--589. McGraw-Hill, New York (USA), 1996. [bibtex-entry]
     
  13. S. E. Markossian, G. S. Gasparian, and B. A. Reed. $\beta$-perfect graphs. J. Combin. Theory Ser. B, 67(1):1--11, 1996. [bibtex-entry]
     
  14. B. Reed. Paths, stars and the number three. Combin. Probab. Comput., 5(3):277--295, 1996. [bibtex-entry]
     
  15. B. Reed, N. Robertson, P. Seymour, and R. Thomas. Packing directed circuits. Combinatorica, 16(4):535--554, 1996. [bibtex-entry]
     
  16. B. A. Reed and F. B. Shepherd. The Gallai-Younger conjecture for planar graphs. Combinatorica, 16(4):555--566, 1996. [bibtex-entry]
     
1995
  1. M. Albert, A. Frieze, and B. Reed. Multicoloured Hamilton cycles. Electron. J. Combin., 2:Research Paper 10, approx. 13 pp. (electronic), 1995. [bibtex-entry]
     
  2. M. Albert, A. Frieze, and B. Reed. Comments on: ``Multicoloured Hamilton cycles'' [Electron. J. Combin. \bf 2 (1995), Research Paper 10, 13 pp. (electronic); MR1327570 (96b:05058)]. Electron. J. Combin., 2:Research Paper 10, Comment 1, 1 HTML document (electronic), 1995. [bibtex-entry]
     
  3. J-C. Bermond, F. Comellas, and D.F. Hsu. Distributed Loop Computer Networks: a survey. Journal of Parallel and Distributed Computing, 24:2--10, 1995. [bibtex-entry]
     
  4. J-C. Bermond, P. Fraigniaud, and J.G. Peters. Antepenultimate Broadcasting. Networks, 26(3):125--137, 1995. [bibtex-entry]
     
  5. P. Berthomé and A. Ferreira. On Broadcasting Schemes in Restricted Optical Passive Star Systems. DIMACS series in Discrete Mathematics and Theoretical Computer Science, 21:19--29, 1995. [bibtex-entry]
     
  6. R. Corrêa and A. Ferreira. Modeling Parallel Branch-and-Bound for Asynchronous Implementations. DIMACS series in Discrete Mathematics and Theoretical Computer Science, 22:45--56, 1995. [bibtex-entry]
     
  7. R. Corrêa and A. Ferreira. On the effectivenes of parallel branch and bound. Parallel Processing Letters, 5(3):375--386, 1995. [bibtex-entry]
     
  8. R. Corrêa and A. Ferreira. A Distributed Implementation of Asynchronous Parallel Branch and Bound. In A. Ferreira and J. Rolim, editors,Solving Irregular Problems in Parallel: State of the Art, pages 157--176. Kluwer Academic Publisher, Boston (USA), 1995. [bibtex-entry]
     
  9. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel processing of pointer based quadtrees. Computer Vision and Image Understanding, 62(1):1--10, 1995. [bibtex-entry]
     
  10. L. Devroye and B. Reed. On the variance of the height of random binary search trees. SIAM J. Comput., 24(6):1157--1162, 1995. [bibtex-entry]
     
  11. T. Duboux, A. Ferreira, and M. Gastaldo. A Scalable Design for VLSI Dictionary Machines. Microprocessors & Microprogramming Journal, 41:359--372, 1995.
    Note: Special Issue on Parallel Programmable Architectures and Compilation for Multi-dimensional Processing.
    Keywords: parallelisme, grain fin, machine dico. [bibtex-entry]
     
  12. A. Ferreira. Work and memory efficient parallel algorithms for the knapsack problem. International Journal of High Speed Computing, 4:595--606, 1995. [bibtex-entry]
     
  13. A. Frieze, R. M. Karp, and B. Reed. When is the assignment bound tight for the asymmetric traveling-salesman problem?. SIAM J. Comput., 24(3):484--493, 1995. [bibtex-entry]
     
  14. A. Frieze and B. Reed. Covering the edges of a random graph by cliques. Combinatorica, 15(4):489--497, 1995. [bibtex-entry]
     
  15. B. Gamble, W. Pulleyblank, B. Reed, and B. Shepherd. Right angle free subsets in the plane. Graphs Combin., 11(2):121--129, 1995. [bibtex-entry]
     
  16. C. McDiarmid and B. Reed. Almost every graph can be covered by $\lceil{\Delta/2}\rceil$ linear forests. Combin. Probab. Comput., 4(3):257--268, 1995. [bibtex-entry]
     
  17. M. Molloy and B. Reed. The dominating number of a random cubic graph. Random Structures Algorithms, 7(3):209--221, 1995. [bibtex-entry]
     
  18. B. Reed and N. Sbihi. Recognizing bull-free perfect graphs. Graphs Combin., 11(2):171--178, 1995. [bibtex-entry]
     
  19. B. Reed. Rooted routing in the plane. Discrete Appl. Math., 57(2-3):213--227, 1995.
    Note: Combinatorial optimization 1992 (CO92) (Oxford). [bibtex-entry]
     
1994
  1. J-C. Bermond and P. Fraigniaud. Broadcasting and Gossiping in de Bruijn Networks. SIAM Journal on Computing, 23(1):212--225, 1994. [bibtex-entry]
     
  2. P. Berthomé and A. Ferreira. Time-optimal geometric algorithms in hypercubic networks. Parallel Algorithms and Applications, 4:169--181, 1994. [bibtex-entry]
     
  3. F. Dehne, A. Ferreira, and A. Rau-Chaplin. A massively parallel knowledge-base server using a hypercube multiprocessor. Parallel Computing, 20:1369--1382, 1994. [bibtex-entry]
     
  4. T. Duboux, A. Ferreira, and M. Gastaldo. 6: Algorithmique Parallèle -- Structures de Données Arborescentes. In G. Authié, A. Ferreira, J.L. Roch, G. Villard, J. Roman, C. Roucairol, and B. Virot, editors,Algorithmes parallèles -- analyse et conception, pages 129--171. Hermes, Paris (F), 1994. [bibtex-entry]
     
  5. A. Ferreira and S. Ubéda. Ultra-fast parallel contour tracking, with applications to thinning. Pattern Recognition, 27(7):867--878, 1994. [bibtex-entry]
     
  6. C. McDiarmid, B. Reed, A. Schrijver, and B. Shepherd. Induced circuits in planar graphs. J. Combin. Theory Ser. B, 60(2):169--176, 1994. [bibtex-entry]
     
1993
  1. J-C. Bermond and P. Hell. On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs. Journal of Graph theory, 17(5):647--655, 1993. [PDF ] [bibtex-entry]
     
  2. J-C. Bermond, E. Lazard, D. Sotteau, and M. Syska. La Théorie des graphes. Courrier du CNRS, la recherche en informatique, 80:54--55, 1993. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, N. Homobono N., and C. Peyrat. Connectivity of Kautz Networks. Discrete Mathematics, 114:51--62, 1993. [bibtex-entry]
     
  4. B. Bollobás, B. Reed, and A. Thomason. An extremal function for the achromatic number. In Graph structure theory (Seattle, WA, 1991), volume 147 of Contemp. Math., pages 161--165. Amer. Math. Soc., Providence, RI, 1993. [bibtex-entry]
     
  5. G. Cornuéjols and B. Reed. Complete multi-partite cutsets in minimal imperfect graphs. J. Combin. Theory Ser. B, 59(2):191--198, 1993. [bibtex-entry]
     
  6. A. Ferreira and J. Zerovnik. Bounding the probability of success of stochastic methods for global optimization. International Journal on Computers & Mathematics with Applications, 25(10/11):1--8, 1993.
    Note: 2nd Special Issue on Global Optimization, Control and Games. [bibtex-entry]
     
  7. A. Ferreira. On space-efficient algorithms for certain NP-Complete problems. Theoretical Computer Science, 120:311--315, 1993.
    Keywords: parallelisme, optimisation, knapsack. [bibtex-entry]
     
  8. A. Frieze and B. Reed. Polychromatic Hamilton cycles. Discrete Math., 118(1-3):69--74, 1993. [bibtex-entry]
     
  9. K. Kilakos and B. Reed. Fractionally colouring total graphs. Combinatorica, 13(4):435--440, 1993. [bibtex-entry]
     
  10. C. McDiarmid and B. Reed. On total colourings of graphs. J. Combin. Theory Ser. B, 57(1):122--130, 1993. [bibtex-entry]
     
  11. B. Reed. Rooted routing in the plane. CWI Quarterly, 6(3):241--255, 1993. [bibtex-entry]
     
  12. B. Reed. Counterexamples to a conjecture of Las Vergnas and Meyniel. In Graph structure theory (Seattle, WA, 1991), volume 147 of Contemp. Math., pages 157--159. Amer. Math. Soc., Providence, RI, 1993. [bibtex-entry]
     
  13. B. A. Reed, N. Robertson, A. Schrijver, and P. D. Seymour. Finding disjoint trees in planar graphs in linear time. In Graph structure theory (Seattle, WA, 1991), volume 147 of Contemp. Math., pages 295--301. Amer. Math. Soc., Providence, RI, 1993. [bibtex-entry]
     
1992
  1. S. Akl, M. Cosnard, and A. Ferreira. Data-movement-intensive problems : two folk theorems in parallel computation revisited. Theoretical Computer Science, 95:323--337, 1992. [bibtex-entry]
     
  2. N. Alon, C. McDiarmid, and B. Reed. Star arboricity. Combinatorica, 12(4):375--380, 1992. [bibtex-entry]
     
  3. J-C. Bermond, C. Delorme, and J-J. Quisquater. Table of large $({\Delta},D)$-graphs. Discrete Applied Mathematics, 37/38:575--577, 1992. [bibtex-entry]
     
  4. J-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Broadcasting in bounded degree graphs. SIAM Journal on Discrete Mathematics, 5(1):10--24, 1992. [PDF ] [bibtex-entry]
     
  5. J-C. Bermond, P. Hell, A. L. Liestman, and J. G. Peters. Sparse broadcast graphs. Discrete Applied Mathematics, 36:97--130, 1992. [bibtex-entry]
     
  6. J-C. Bermond, P. Hell, and J.-J. Quisquater. Construction of large packet radio networks. Parallel Processing Letters, 2(1):3-12, 1992. [PDF ] [bibtex-entry]
     
  7. J-C. Bermond, P. Michallon, and D. Trystram. Broadcasting in wraparound meshes with parallel monodirectional links. Parallel Computing, 18:639--648, 1992. [bibtex-entry]
     
  8. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Algorithmique SIMD. In M.Cosnard, M.Nivat, and Y.Robert, editors,Algorithmique Parallèle, Etudes et Recherches en Informatique, pages 65--80. Masson, 1992. [bibtex-entry]
     
  9. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel fractional cascading on hypercube multiprocessors. Computational Geometry - Theory and Applications, 2:141--167, 1992. [bibtex-entry]
     
  10. A. Ferreira and S.W. Song. Achieving optimality for gate matrix layout and PLA folding : a graph theoretic approach. Integration: the VLSI journal, 14:173--195, 1992. [bibtex-entry]
     
  11. A. Frieze, C. McDiarmid, and B. Reed. On a conjecture of Bondy and Fan. Ars Combin., 33:329--336, 1992. [bibtex-entry]
     
  12. K. Kilakos and B. Reed. A semi-integral total colouring. In Sets, graphs and numbers (Budapest, 1991), volume 60 of Colloq. Math. Soc. János Bolyai, pages 429--438. North-Holland, Amsterdam, 1992. [bibtex-entry]
     
  13. B. Reed and C. McDiarmid. The strongly connected components of $1$-in, $1$-out. Combin. Probab. Comput., 1(3):265--274, 1992. [bibtex-entry]
     
1991
  1. N. Alon, C. McDiarmid, and B. Reed. Acyclic coloring of graphs. Random Structures Algorithms, 2(3):277--288, 1991. [bibtex-entry]
     
  2. J-C. Bermond and J-C. Konig. Un protocole distribué pour la 2-connexité. TSI, 10(4):269--274, 1991. [bibtex-entry]
     
  3. J-C. Bermond and D. Tzvieli. Minimal diameter double loop networks, part II: dense optimal families. Networks, 21:1--9, 1991. [bibtex-entry]
     
  4. M. Cosnard and A. Ferreira. On the real power of loosely coupled parallel architectures. Parallel Processing Letters, 1(2):103--111, 1991. [bibtex-entry]
     
  5. A. Ferreira. A parallel time/hardware tradeoff $T.H = O(2^{n/2})$ for the knapsack problem. IEEE Transactions on Computers, 40(2):221--225, 1991. [bibtex-entry]
     
1990
  1. J-C. Bermond, K. Heinrich, and M-L. Yu. Existence of resolvable path designs. Journal Europeen de Combinatoire, 11:205--211, 1990. [bibtex-entry]
     
  2. J-C. Bermond, K. Heinrich, and M-L. Yu. On resolvable mixed path designs. Journal Europeen de Combinatoire, 11:313--318, 1990. [bibtex-entry]
     
  3. M. Cosnard, J. Duprat, and A. Ferreira. The complexity of searching in X+Y and other multisets. Information Processing Letters, (34):103--109, 1990. [bibtex-entry]
     
  4. F. Dehne, A. Ferreira, and A. Rau-Chaplin. Parallel branch and bound on fine grained hypercube multiprocessors. Parallel Computing, 15(1-3):201--209, 1990. [bibtex-entry]
     
  5. A. Ferreira and M. Gastaldo. Experimentations de deux algorithmes de tri sur un hypercube de transputers. La Lettre du Transputer, (5):311--21, 1990. [bibtex-entry]
     
  6. A. Frieze, C. McDiarmid, and B. Reed. Greedy matching on the line. SIAM J. Comput., 19(4):666--672, 1990. [bibtex-entry]
     
  7. C. McDiarmid and B. Reed. Linear arboricity of random regular graphs. Random Structures Algorithms, 1(4):443--445, 1990. [bibtex-entry]
     
1989
  1. J-C. Bermond, K. Berrada, and J. Bond. Extensions of networks with given diameter. Discrete Math., 75(1-3):31--40, 1989.
    Note: Graph theory and combinatorics (In honor of P. Erdös' 75, Cambridge, 1988). [bibtex-entry]
     
  2. J-C. Bermond, O. Favaron, and M. Mahéo. Hamiltonian decomposition of Cayley graphs of degree $4$. J. Combin. Theory Ser. B, 46(2):142--153, 1989. [bibtex-entry]
     
  3. J-C. Bermond and J.-M. Fourneau. Independent connections: an easy characterization of baseline-equivalent multistage interconnection networks. Theoret. Comput. Sci., 64(2):191--201, 1989. [bibtex-entry]
     
  4. J-C. Bermond, N. Homobono, and C. Peyrat. Large fault-tolerant interconnection networks. Graphs Combin., 5(2):107--123, 1989. [bibtex-entry]
     
  5. J-C. Bermond and C. Peyrat. Induced subgraphs of the power of a cycle. SIAM J. Discrete Math., 2(4):452--455, 1989. [bibtex-entry]
     
  6. M. Cosnard, J. Duprat, and A. Ferreira. Complexity of selection in X+Y. Theoretical Computer Science, 67:115--120, 1989. [bibtex-entry]
     
  7. M. Cosnard and A. Ferreira. Generating Permutations on a VLSI Suitable Linear Network. The Computer Journal, 32(6):571--573, 1989. [bibtex-entry]
     
  8. C. T. Hoàng and B. A. Reed. $P\sb 4$-comparability graphs. Discrete Math., 74(1-2):173--200, 1989.
    Note: Graph colouring and variations. [bibtex-entry]
     
  9. C. T. Hoàng and B. A. Reed. Some classes of perfectly orderable graphs. J. Graph Theory, 13(4):445--463, 1989. [bibtex-entry]
     
  10. C. J. H. McDiarmid and B. A. Reed. Building heaps fast. J. Algorithms, 10(3):352--365, 1989. [bibtex-entry]
     
1988
  1. J-C. Bermond, J.-M. Fourneau, and A. Jean-Marie. A graph theoretical approach to equivalence of multistage interconnection networks. Discrete Appl. Math., 22(3):201--214, 1988/89. [bibtex-entry]
     
  2. J-C. Bermond and C. Peyrat. Broadcasting in de Bruijn networks. Congr. Numer., 66:283--292, 1988.
    Note: Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988). [bibtex-entry]
     
  3. M. Bertschi and B. A. Reed. Erratum: ``A note on even pairs'' [Discrete Math. \bf 65 (1987), no. 3, 317--318; MR0897656 (88f:05066)] by Reed. Discrete Math., 71(2):187, 1988. [bibtex-entry]
     
  4. M. Cosnard, A. Ferreira, and H. Herbelin. The Two-List Algorithm for the Knapsack Problem on a FPS T20. Parallel Computing, (9):385--388, 1988. [bibtex-entry]
     
  5. A. M. Frieze, B. Jackson, C. J. H. McDiarmid, and B. Reed. Edge-colouring random graphs. J. Combin. Theory Ser. B, 45(2):135--149, 1988. [bibtex-entry]
     
  6. C. L. Monma, B. Reed, and W. T. Trotter, Jr.. Threshold tolerance graphs. J. Graph Theory, 12(3):343--362, 1988. [bibtex-entry]
     
1987
  1. J-C. Bermond, J. Bond, and D. Sotteau. On regular packings and coverings. Annals of Discrete mathematics, 34:81--100, 1987. [PDF ] [bibtex-entry]
     
  2. J-C. Bermond, J.-M. Fourneau, and A. Jean-Marie. Equivalence of multistage interconnection networks. Information Processing Letters, 26:45--50, 1987. [bibtex-entry]
     
  3. C. T. Hoàng and B. Reed. A note on short cycles in digraphs. Discrete Math., 66(1-2):103--107, 1987. [bibtex-entry]
     
  4. B. Reed. A semistrong perfect graph theorem. J. Combin. Theory Ser. B, 43(2):223--240, 1987. [bibtex-entry]
     
  5. B. A. Reed. A note on even pairs. Discrete Math., 65(3):317--318, 1987. [bibtex-entry]
     
1986
  1. F. Baccelli and P. Mussi. An asynchronous parallel interpreter for arithmetic expressions and its evaluation. IEEE Transactions on Computers, C35-3:245--256, March 1986. [bibtex-entry]
     
  2. J-C. Bermond, C. Delorme, and J.-J. Quisquater. Strategies for interconnection networks: some methods from graph theory. J. Parallel Distributed Computing, 3(4):433--449, 1986. [WWW ] [bibtex-entry]
     
  3. J-C. Bermond and M. Paoli. Research problem: Hamilton powers of graphs. Discrete Mathematics, 62:329--331, 1986. [bibtex-entry]
     
1985
  1. B. Reed. A note on the semistrong perfect graph conjecture. Discrete Math., 54(1):111--112, 1985. [bibtex-entry]
     
1984
  1. J-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. II. J. Combin. Theory Ser. B, 36(1):32--48, 1984. [bibtex-entry]
     
  2. J-C. Bermond, J.-L. Fouquet, M. Habib, and B. Péroche. On linear $k$-arboricity. Discrete Math., 52(2-3):123--132, 1984. [bibtex-entry]
     
  3. J-C. Bermond and M. Las Vergnas. Regular factors in nearly regular graphs. Discrete Math., 50(1):9--13, 1984. [bibtex-entry]
     
  4. M. Hébert, P. Mussi, O. Faugeras, and J.-D. Boissonnat. Polyhedral Approximation of 3-D Objects without Holes. Computer Vision, Graphics, and Image Processing, 25, 1984. [bibtex-entry]
     
1983
  1. J-C. Bermond, J. Bond, M. Paoli, and C. Peyrat. Graphs and interconnection networks: diameter and vulnerability. In Surveys in combinatorics (Southampton, 1983), volume 82 of London Math. Soc. Lecture Note Ser., pages 1--30. Cambridge Univ. Press, Cambridge, 1983. [bibtex-entry]
     
  2. J-C. Bermond, B. Jackson, and F. Jaeger. Shortest coverings of graphs with cycles. J. Combin. Theory Ser. B, 35(3):297--308, 1983. [bibtex-entry]
     
1982
  1. J-C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. III. In Graph theory, volume 62 of North-Holland Math. Stud., pages 23--31. North-Holland, Amsterdam, 1982.
    Note: Présenté au Colloque Cambridge, England, 1981. [bibtex-entry]
     
  2. J-C. Bermond, C. Delorme, and J.-J. Quisquater. Tables of large graphs with given degree and diameter. Inform. Process. Lett., 15(1):10--13, 1982. [bibtex-entry]
     
  3. J-C. Bermond and G. Farhi. Sur un problème combinatoire d'antennes en radioastronomie. II. In Theory and practice of combinatorics, volume 60 of North-Holland Math. Stud., pages 49--53. North-Holland, Amsterdam, 1982. [bibtex-entry]
     
1981
  1. J-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Longest paths in digraphs. Combinatorica, 1(4):337--341, 1981. [PDF ] [bibtex-entry]
     
  2. J-C. Bermond and C. Thomassen. Cycles in digraphs---a survey. J. Graph Theory, 5(1):1--43, 1981. [bibtex-entry]
     
1980
  1. J-C. Bermond, P. Frankl, and F. Sterboul. On the maximum number of edges in a hypergraph whose linegraph contains no cycle. Discrete Math., 30(3):295--298, 1980. [bibtex-entry]
     
  2. J-C. Bermond, A. Germa, M.-C. Heydemann, and D. Sotteau. Girth in digraphs. J. Graph Theory, 4(3):337--341, 1980. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, C. Huang, A. Rosa, and D. Sotteau. Decomposition of complete graphs into isomorphic subgraphs with five vertices. Ars Combin., 10:211--254, 1980. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond, D. Sotteau, A. Germa, and M.-C. Heydemann. Chemins et circuits dans les graphes orientés. Ann. Discrete Math., 8:293--309, 1980.
    Note: Présenté au Colloque Combinatorics 79, Univ. Montréal, Montreal, Canada, 1979. [PDF ] [bibtex-entry]
     
1979
  1. J-C. Bermond, A. Germa, and M.-C. Heydemann. Hamiltonian cycles in strong products of graphs. Canad. Math. Bull., 22(3):305--309, 1979. [bibtex-entry]
     
  2. J-C. Bermond, A. Germa, and D. Sotteau. Resolvable decomposition of $K\sp{\ast} \sb{n}$. J. Combin. Theory Ser. A, 26(2):179--185, 1979. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond. Hamiltonian Graphs, chapter 6, pages 127-167. Selected Topics in Graph Theory. Academic Press, 1979. [bibtex-entry]
     
  4. J-C. Bermond and Anton Marczyk. Comparaison des puissances de graphes. C. R. Acad. Sci. Paris Sér. A-B, 288(1):A13--A15, 1979. [bibtex-entry]
     
  5. J-C. Bermond, J. M. S. Sim oes-Pereira, and Christina M. Zamfirescu. On non-Hamiltonian homogeneously traceable digraphs. Math. Japon., 24(4):423--426, 1979/80. [bibtex-entry]
     
1978
  1. J-C. Bermond, A. Germa, and M.-C. Heydemann. Graphes représentatifs d'hypergraphes. Cahiers Centre Études Rech. Opér., 20(3-4):325--329, 1978.
    Note: Présenté au Colloque Mathématiques Discrètes: Codes et Hypergraphes, Brussels, 1978. [bibtex-entry]
     
  2. J-C. Bermond. Hamiltonian decompositions of graphs, directed graphs and hypergraphs. Ann. Discrete Math., 3:21--28, 1978.
    Note: Présenté au Cambridge Combinatorial Conf., Advances in graph theory , Trinity College, Cambridge, England, 1977. [bibtex-entry]
     
  3. J-C. Bermond, C. Huang, and D. Sotteau. Balanced cycle and circuit designs: even cases. Ars Combin., 5:293--318, 1978. [PDF ] [bibtex-entry]
     
1977
  1. J-C. Bermond and P. Frankl. On a conjecture of Chvátal on $m$-intersecting hypergraphs. Bull. London Math. Soc., 9(3):310--312, 1977. [bibtex-entry]
     
  2. J-C. Bermond, A. Germa, and D. Sotteau. Hypergraph-designs. Ars Combinatoria, 3:47--66, 1977. [PDF ] [bibtex-entry]
     
  3. J-C. Bermond, M.-C. Heydemann, and D. Sotteau. Line graphs of hypergraphs. I. Discrete Math., 18(3):235--241, 1977. [PDF ] [bibtex-entry]
     
  4. J-C. Bermond and J. Schönheim. $G$-decomposition of $K\sb{n}$, where $G$ has four vertices or less. Discrete Math., 19(2):113--120, 1977. [bibtex-entry]
     
1976
  1. J-C. Bermond and V. Faber. Decomposition of the complete directed graph into $k$-circuits. J. Combinatorial Theory Ser. B, 21(2):146--155, 1976. [bibtex-entry]
     
  2. J-C. Bermond and Y. Kodratoff. Une heuristique pour le calcul de l'indice de transitivité d'un tournoi. Rev. Française Automat. Informat. Recherche Opérationnelle Sér. Rouge Informat. Théor., 10(R-1):83--92, 1976. [bibtex-entry]
     
  3. Unsolved problems. pp 678--696. Congressus Numerantium, No. XV, 1976.
    Note: Chairman: P. Erdos, With contributions by C. C. Chen, D. E. Daykin, B. Bollobás, P. Erdos, A. Frank, A. Gardiner, F. Jaeger, A. Bondy, L. Lovász, A. Recski, S. Maurer, A. Rényi, C. St. J. A. Nash-Williams, B. Recamán, D. A. Waller, D. D. Grant, M. Las Vergnas, S. E. Eldridge, A. D. Keedwell, J. Sheehan, A. J. W. Hilton, J-C. Bermond, R. J. Wilson, J. A. Bondy, and R. L. Hemminger. [bibtex-entry]
     
1975
  1. J-C. Bermond and J. C. Meyer. Hypergraphes et configurations. Cahiers Centre Études Recherche Opér., 17(2-4):137--154, 1975.
    Note: Présenté au Colloque sur la Théorie des Graphes, Paris, 1974. [bibtex-entry]
     
  2. J-C. Bermond. $1$-graphes réguliers minimaux de girth donné. Cahiers Centre Études Recherche Opér., 17(2-4):125--135, 1975.
    Note: Présenté au Colloque sur la Théorie des Graphes, Paris, 1974. [bibtex-entry]
     
  3. Problems. In Recent advances in graph theory (Proc. Second Czechoslovak Sympos., Prague, 1974), pages 541--544. Academia, Prague, 1975.
    Note: Contributed by P. Erdos, M. Simonovits, V. T. Sós, L. Lovász, J-C. Bermond, G. O. H. Katona, T. Tarján, R. A. Brualdi, L. S. Mel' nikov and B. Toft. [bibtex-entry]
     
1974
  1. J-C. Bermond. Some Ramsey numbers for directed graphs. Discrete Math., 9:313--321, 1974. [bibtex-entry]
     
  2. J-C. Bermond. An application of the solution of Kirkman's schoolgirl problem: the decomposition of the symmetric oriented complete graph into $3$-circuits. Discrete Math., 8:301--304, 1974. [bibtex-entry]
     
  3. J-C. Bermond. Nombre chromatique total du graphe $r$-parti complet. J. London Math. Soc. (2), 9:279--285, 1974/75. [bibtex-entry]
     
1973
  1. J-C. Bermond and J. C. Meyer. Graphe représentatif des arêtes d'un multigraphe. J. Math. Pures Appl. (9), 52:299--308, 1973. [PDF ] [bibtex-entry]
     
  2. J-C. Bermond and P. Rosenstiehl. Pancyclisme du carré du graphe aux arêtes d'un graphe. Cahiers Centre Études Recherche Opér., 15:285--286, 1973.
    Note: Présenté au Colloque sur la Théorie des Graphes,Brussels, 1973. [bibtex-entry]
     
1972
  1. J-C. Bermond. Arbres maximaux ayant au plus $n$ sommets pendants. C. R. Acad. Sci. Paris Sér. A-B, 274:A1878--A1881, 1972. [bibtex-entry]
     
  2. J-C. Bermond. Ordres à distance minimum d'un tournoi et graphes partiels sans circuits maximaux. Math. Sci Humaines, (37):5--25, 1972. [bibtex-entry]
     
1970
  1. J-C. Bermond. Graphes orientés fortement $k$-connexes et graphes ``$k$ arc hamiltoniens''. C. R. Acad. Sci. Paris Sér. A-B, 271:A141--A144, 1970. [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Tue Jul 25 17:12:05 2017