INDEX DES CITATIONS par ordre alphabétique (87 auteurs) : par

INDEX DES CITATIONS par ordre alphabétique (87 auteurs) : par

INDEX DES CITATIONS
par ordre alphabétique (87 auteurs) :
Anholcer M. :[56],
Azizah M.R. :[44],
Barcucci E. :[19],
Baskoro E.T. :[20],
Batut Ch. :[5,9],
Bergé A.M. :[11],
Bernini A. :[18,21,19],
Bouvel M. :[49],
Chameni Nembua C. :[59],
Chen Y.J. :[53],
Cleary S. :[22,37,36,62],
Cuckler B. :[30],
Dehornoy P. :[54],
Diaconis P. :[28],
Disanto F. :[47],
Do P.T. :[61],
Domaratzki M. :[14],
Dukes W.M.B. :[29],
Dutour-Sikiric M. :[17],
Ernastuti E. :[55],
Ferrari L. :[47],
Flanagan M.F. :[29],
Fulman J. :[28],
Grazzini E. :[21],
Greenhill C. :[16],
Guralnick R. :[28],
Kokosinski Z. :[25],
Har H. :[55],
Haryanto H. :[55],
Haslinda I. :[44],
Huang, G.-S. :[46],
Huemer C. :[34],
Hurtado F. :[34],
Jezek J. :[3],
Juarna A. :[23],
Karonski M. :[56],
Khandoker M. :[57],
Kim Y. :[41],
Kitaev S. :[50],
Korsh J. :[12],
Kuo T. :[43],
Lafolette P.S. :[12],
Laihem M. :[11],
Lazenik F. :[30],
Li S. :[32],
Lin X. :[35,42],
Liu J.-J. :[53],
Luccio F. :[22,38,48,60],
Mansour T. :[29,33,52],
Marcjan L. :[45],
Martinet J. :[40,6],
Mesa Enriquez A. :[48],
Mominul H. :[57],
Monjardet B. :[59],
Nawawi M.S. :[20],
Nassar G. :[33,52],
Noy M. :[34],
Nurdin :[20],
Omana-Pulido E. :[34],
Pagli L. :[22,38,48,60],
Pergola E. :[21],
Pfender F. :[56],
Pinzani R. :[21,47],
Poneti M. :[39,19],
Rechnitzer A. :[62],
Rinaldi S. :[47],
Rossin D. :[61],
Rucinski A. :[16],
Schürmann A. :[13,17],
Shorser L. :[58],
Sloane N.J.A. :[2,4],
St-John K. :[37,36],
Stojmenovic I. :[15],
Tong C. :[35,42],
Tran T.T.H. :[61],
Vallentin F. :[13,17],
Vajnovszki V. :[23,24,29,39,26,27,51,52],
Wang D. :[32],
Wang L. :[42],
Wang X. :[32],
Wong T. :[62],
Wu, C.-S. :[46],
Yang Y. :[35,42],
Yen W.C.K. :[53],
Zhang S. :[32],
Zhihe L. :[35],
Zurni O. :[44],
par ordre chronologique (62 citations) :
1.
2.
3.
4.
J. Martinet, http ://www.math.u-bordeaux.fr/ martinet
N.J.A. Sloane, http ://www.research.att.com/ njas/lattices/perfect.html
J. Jezek, http ://www.karlin.mff.cuni.cz/ jezek.
N.J.A. Sloane, Eulerian Numbers, A000295, http ://www.research.att.com/ njas/sequences/
1
5. Ch. Batut, J. Martinet, Radiographie des réseaux parfaits, Experimental Mathematics, 3(1), 39-49,
1994.
6. J. Martinet, Les réseaux parfaits dans les espaces euclidiens. Editions Dunod, 1996.
7. J. Martinet, Une famille de réseaux dual-extrêmes, Journal de Théorie des Nombres de Bordeaux,
9, 169-181, 1997.
8. J. Martinet, Algebraic Constructions of Lattices ; Isodual Lattices, Acts of the 1996 Eger conference,
Györy, Pethö, Sós, eds, Walter de Gruyter GmbH, Berlin-New York, pp. 349 - 360, 1998.
9. Ch. Batut, Classification of quintic eutactic forms, Math. Comp. 70, 395-417, 2001.
10. J. Martinet, Perfect lattices in euclidean spaces. Springer-Verlag, 2002.
11. A.-M. Bergé, M. Laihem, Lattices with a prescribed hyperplane perfect section, preprint, 2002.
12. J. Korsh, P. S. Lafolette, Constant time generation of derangements, Inf. Process. Lett., 90 (4),
181-186, 2004.
13. A. Schürmann, F. Vallentin, Methods in the local theory of packing and covering lattices, arXiv :math.MG/0412320v
2004.
14. M. Domaratzki, Trajectory based operations, Thesis, Queen’s University, Kingston, Ontario, Canada,
2004.
15. I. Stojmenovic, Listing combinatorial objects in parallel, The international Journal of Parallel,
Emergent and Distributed Systems, 21 (2), 127-146, 2006.
16. C. Greenhill, A. Rucinski, Neighbour-distinguishing edge colorings of random regular graphs, The
electronic journal of combinatorics, 13, R77, 1-12, 2006.
17. M. Dutour Sikiric, A. Schürmann, F. Vallentin, Classification of eight dimensional perfect
forms, Electron. Res. Announc. Amer. Math. Soc. 13, 21-32. math/0609388, 2007.
18. A. Bernini, Some properties of pattern avoiding permutations, Thèse, Florence, Italie, 2006.
19. E. Barcucci, A. Bernini, M. Poneti, From Fibonacci to Catalan permutations, Journal of Pure
Mathematics and Applications, Vol. 17(1-2), pp. 1-17., 2006.
20. Nurdin, Baskoro E.T., Nawawi M.S.A., The total edge irregular strengths of union graphs of K2,n ,
International Conference on Mathematics and Natural Sciences, 2006.
21. A. Bernini, E. GrazZini, E. Pergola, R. Pinzani, A general exhaustive generation algorithm for
Gray structures, Acta Informatica, vol. 44, 5, 361-376, 2007.
22. S. Cleary, F. Luccio, L. Pagli, Refined upper bounds for right-arm rotation distances, Theoretical
Computer Science, 377, 277-281, 2007.
23. A. Juarna, V. Vajnovszki, Some Generalizations of a Simion-Schmidt Bijection, The Computer
Journal, 50(5), 574-580, 2007.
24. V. Vajnovszki, Gray code order for Lyndon words, Discrete Mathematics and Theoretical Computer
Science, 9 (2), 145-152, 2007.
25. Z. Kokosinski, On parallel generation of partial derangements, derangements and permutations, Proc.
7th Int. Conference ”Parallel Processing and Applied Mathematics” PPAM’2007, Gdansk, Poland [in :]
Lecture Notes in Computer Science, 2008.
26. V. Vajnovszki, Discrete Mathematics and Theoretical Computer Science, 9,2,145-152, 2007.
27. V. Vajnovszki, More restrictive Gray codes for necklaces and Lyndon words, IPL, 106, 3, 96-99, 2007.
28. P. Diaconis, J. Fulman, R. Guralnick, On fixed points of permutations, Journal of Algebraic
Combinatorics, 2008.
29. W.M.B. Dukes, M.F. Flanagan, T. Mansour, V. Vajnovszki, Combinatorial Gray code for
classes of pattern avoiding permutations, Theoretical computer science, vol. 396, 1-3, 35-49, 2008.
30. B. Cuckler, F. Lazebnik, Irregularity Strength of Denses Graphs, journal of graph theory, 58, 4,
299-313, 2008.
31. Jacques Martinet, Anne-Marie Bergé - In Memoriam, Journal de Théorie des Nombres de Bordeaux, Vol. 20, i-xi, 2008.
32. D. Wang, X. Wang, S. Li, S. Zhang, Diagonal-flip distance algorithms of three type triangulations,
International conference on computer science and software engineering, Wuhan, China, IEEE, 2008.
33. T. Mansour, G. Nassar, Gray codes, Loopless algorithm and partitions, Journal of Mathematical
Modelling and Algorithms 7 :3, 291-310, 2008.
2
34. C. Huemer, F. Hurtado, M. Noy, E. Omana-Pulido, Gray codes for non-crossing partitions and
dissections of a convex polygon, Discrete Applied Mathematics, 157, 7, 1509-1520, 2009.
35. C. Tong, X. Lin, Y. Yang, L. Zhihe, Equitable total coloring of Cm 2Cn , Discrete Applied Mathematics, 157, 596-601, 2009.
36. S. Cleary, K. St. John, A Linear-Time Approximation Algorithm for Rotation Distance, arXiv :math.CO/09030199v1
2009.
37. S. Cleary, K. St. John, Rotation Distance is Fixed-Parameter Tractable, Vol. 109, 16, 918-922 ,
2009.
38. F. Luccio, L. Pagli, The Fermat star of binary trees, Information Processing Letters, 109, 11, 568571, 2009.
39. M. Poneti, V. Vajnovszki, Generating restricted classes of involutions, Bell and Stirling permutations, European Journal of Combinatorics, 2009.
40. J. Martinet, Compléments pour le livre : Les réseaux parfaits dans les espaces euclidiens. Editions
Dunod, 2009.
41. Y. Kim, On semistability of root lattices and perfect lattices, 2010.
42. C. Tong, X. Lin., Y. Yang, L. Wang., Irregular total labellings of some families of graphs, Indian
Journal of Pure and Applied Mathematics, 40 (3), 155-181, 2009.
43. T. Kuo, A New Method for Generating Permutations in Lexicographic Order, Journal of Science and
Engineering Technology, 5(4), 21-29, 2009.
44. I. Haslinda, O. Zurni, Azizah M. Rohni, New algorithm for listing permutations, Modern applied
science, 4, 2, 2010
45. L. Marcjan, http ://kolos.math.uni.lodz.pl/ lmarcjan/Szkola/pracamagisterska2/pracamag.pdf, 2010
46. Wu, C.-S., Huang, G.-S., A metric for rooted trees with unlabeled vertices based on nested parentheses, Theoretical Computer Science, 411, 44-46, 3923 - 3931, 2010.
47. F. Disanto, L. Ferrari, R. Pinzani, S. Rinaldi, Catalan lattices on series parallel interval orders,
arXiv :1007.1911v1 [math.CO], 12 Jul 2010.
48. F. Luccio, A. Mesa Enriquez, L. Pagli, Lower bounds on the rotation distance of binary trees,
Information processing letters, 110, 21, 934-938, 2010.
49. M. Bouvel, Thèse, http ://www.liafa.jussieu.fr/ mbouvel/these.pdf, 2010
50. S. Kitaev, Patterns in permutations and words, Springer, 2011
51. V. Vajnovszki, Generating involutions, derangements, and relatives by ECO, Discrete Mathematics
and Theoretical Computer Science, Vol 12(1), 2010
52. T. Mansour, G. Nassar, V. Vajnovszki, Loop-free Gray code algorithm for the e-restricted growth
functions, Information Processing Letters, 111(11), 541-544, 2011.
53. J.J. Liu, W.C.K. Yen, Y.J. Chen, An Optimal Algorithm for Untangling Binary Trees via Rotations,
The computer journal, March 2011.
54. P. Dehornoy, Tamari Lattices and the symmetric Thompson monoid, arXiv :1109.5296v1, 2011.
55. E. Ernastuti, H. Haryanto, H. Har, Algoritma paralel odd even transposition pada model jaringan
nonlinier, Jurnal Ilmu Komputer Fakultas Ilmu Komputer, 3(2), 2010.
56. M. Anholcer, M. Karonski, F. Pfender, Total Vertex Irregularity Strength of Forests, arXiv :1103.2087v1,
2011.
57. M. Khandoker, H. Mominul, Irregular Total Labellings of Generalized Petersen Graphs, Theory of
Computing Systems DOI : 10.1007/s00224-011-9350-7, 2011.
58. L. Shorser, Scalar and Vector Coherent State Representations of Compact and Non-Compact Symplectic Groups, Thesis, University of Toronto, http ://www.math.toronto.edu/lshorser/LSThesis.pdf,
2010
59. C. Chameni Nembua, B. Monjardet, Finite Pseudocomplemented Lattices and Permutoedre, Preprint, 2012.
60. F. Luccio, L. Pagli, Chain rotations : A new look at tree distance, Information Processing Letters,
113, 201-204, 2013.
61. P.T. Do, D. Rossin, T.T.H. Tran, Combinatorial bijections from hatted avoiding permutations in
Sn (132) to generalized Dyck and Motzkin paths, Arxiv :1208.1075, 2012.
3
62. S. Cleary, A. Rechnitzer, T. Wong, Common Edges in Rooted Trees and Polygonal Triangulations, The Electronic Journal of Combinatorics, 20(1),P39, 2013.
4