Search the dblp DataBase
Charles Delorme :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Charles Delorme , Petrisor Panaite Rubik Routing Permutations on Graphs. [Citation Graph (0, 0)][DBLP ] Euro-Par, Vol. I, 1996, pp:283-286 [Conf ] Evripidis Bampis , Charles Delorme , Jean-Claude König Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STACS, 1996, pp:655-666 [Conf ] Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater Table of Large (Delta, D )-Graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:37, n:, pp:575-577 [Journal ] Abdelmadjid Bouabdallah , Charles Delorme , Selma Djelloul Edge Deletion Preserving the Diameter of the Hypercube. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1995, v:63, n:1, pp:91-95 [Journal ] Charles Delorme Examples of Products Giving Large Graphs with Given Degree and Diameter. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1992, v:37, n:, pp:157-167 [Journal ] Charles Delorme , Odile Favaron , Dieter Rautenbach Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:130, n:3, pp:503-512 [Journal ] Charles Delorme Presentations of groups generated by transpositions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:236, n:1-3, pp:59-64 [Journal ] Charles Delorme Laplacian eigenvalues and fixed size multisection. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:276, n:1-3, pp:149-159 [Journal ] Charles Delorme , Odile Favaron , Dieter Rautenbach On the reconstruction of the degree sequence. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:259, n:1-3, pp:293-300 [Journal ] Charles Delorme , Odile Favaron , Dieter Rautenbach On the Randic Image index. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:257, n:1, pp:29-38 [Journal ] Charles Delorme , Samuel Gonzalez , Oscar Ordaz , María Teresa Varela Barycentric sequences and barycentric Ramsey numbers stars. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:277, n:1-3, pp:45-56 [Journal ] Charles Delorme , Isabel Marquez , Oscar Ordaz , Asdrubal Ortuño Existence conditions for barycentric sequences. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2004, v:281, n:1-3, pp:163-172 [Journal ] Charles Delorme , Oscar Ordaz , Domingo Quiroz Some remarks on Davenport constant. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:237, n:1-3, pp:119-128 [Journal ] Fan R. K. Chung , Charles Delorme , Patrick Solé Multidiameters and Multiplicities. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1999, v:20, n:7, pp:629-640 [Journal ] Charles Delorme Distance Biregular Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1994, v:15, n:3, pp:223-238 [Journal ] Charles Delorme , J. Gómez Some New Large Compound Graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2002, v:23, n:5, pp:539-547 [Journal ] Charles Delorme , Svatopluk Poljak Combinatorial Properties and the Complexity of a Max-cut Approximation . [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1993, v:14, n:4, pp:313-333 [Journal ] Charles Delorme , Jean-Pierre Tillich The Spectrum of de Bruijn and Kautz Graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1998, v:19, n:3, pp:307-319 [Journal ] Domingos Moreira Cardoso , Charles Delorme , Paula Rama Laplacian eigenvectors and eigenvalues and almost equitable partitions. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2007, v:28, n:3, pp:665-673 [Journal ] Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater Tables of Large Graphs with Given Degree and Diameter. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1982, v:15, n:1, pp:10-13 [Journal ] Jean-Claude Bermond , Charles Delorme , G. Farhi Large graphs with given degree and diameter. II. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1984, v:36, n:1, pp:32-48 [Journal ] Jean-Claude Bermond , Charles Delorme , Jean-Jacques Quisquater Strategies for Interconnection Networks: Some Methods from Graph Theory. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 1986, v:3, n:4, pp:433-449 [Journal ] Charles Delorme , Svatopluk Poljak Laplacian eigenvalues and the maximum cut problem. [Citation Graph (0, 0)][DBLP ] Math. Program., 1993, v:62, n:, pp:557-574 [Journal ] Charles Delorme , Oscar Ordaz , Domingo Quiroz Tools for studying paths and cycles in digraphs. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:2, pp:125-148 [Journal ] Evripidis Bampis , Charles Delorme , Jean-Claude König Optimal Schedules for d-D Grid Graphs with Communication Delays. [Citation Graph (0, 0)][DBLP ] Parallel Computing, 1998, v:24, n:11, pp:1653-1664 [Journal ] Charles Delorme , G. Farhi Large Graphs with Given Degree and Diameter - Part I. [Citation Graph (0, 0)][DBLP ] IEEE Trans. Computers, 1984, v:33, n:9, pp:857-860 [Journal ] Charles Delorme , Gena Hahn Infinite generalized friendship graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:49, n:3, pp:261-266 [Journal ] Charles Delorme , Jean-Pierre Tillich Eigenvalues, eigenspaces and distances to subsets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1997, v:165, n:, pp:171-194 [Journal ] Charles Delorme , Svatopluk Poljak The performance of an eigenvalue bound on the max-cut problem in some classes of graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:111, n:1-3, pp:145-156 [Journal ] Efficient edge domination in regular graphs. [Citation Graph (, )][DBLP ] On bipartite graphs of defect 2. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.005secs