Jean-Marc Fedou

According to our database1, Jean-Marc Fedou authored at least 24 papers between 1989 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2017
Preface.
Electron. Notes Discret. Math., 2017

2015
Vertical representation of C<sup>∞</sup>-words.
Theor. Comput. Sci., 2015

2014
Assessing the quality of multilevel graph clustering.
Data Min. Knowl. Discov., 2014

2013
Enumeration of 4-stack polyominoes.
Theor. Comput. Sci., 2013

2012
Automata and differentiable words.
Theor. Comput. Sci., 2012

Vertical representation of C{\infty}-words
CoRR, 2012

2011
Encoding Centered Polyominoes by Means of a Regular Language.
Proceedings of the Developments in Language Theory - 15th International Conference, 2011

2009
On the tiling by translation problem.
Discret. Appl. Math., 2009

2006
A Quality Measure for Multi-Level Community Structure.
Proceedings of the 8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2006), 2006

2004
From object grammars to ECO systems.
Theor. Comput. Sci., 2004

2003
Object grammars and bijections.
Theor. Comput. Sci., 2003

1998
Object grammars and random generation.
Discret. Math. Theor. Comput. Sci., 1998

Steep polyominoes, q-Motzkin numbers and q-Bessel functions.
Discret. Math., 1998

Computation and images in combinatorics.
Proceedings of the Computer-Human Interaction in Symbolic Computation, 1998

1995
Statistics on pairs of permutations.
Discret. Math., 1995

Sur les fonctions de Bessel.
Discret. Math., 1995

The generating function of convex polyominoes: The resolution of a q-differential system.
Discret. Math., 1995

1994
More Statistics on Permutation Pairs.
Electron. J. Comb., 1994

1993
Enumeration of skew Ferrers diagrams.
Discret. Math., 1993

CalICo, a visual tool for combinatorial mathematics.
Proceedings of the 1993 IEEE Workshop on Visual Languages, 1993

1992
Attibute Grammars are Useful for Combinatorics.
Theor. Comput. Sci., 1992

1991
Introduction aux polyèdres en combinatoire d'apres E. Ehrhart et R. Stanley.
RAIRO Theor. Informatics Appl., 1991

1990
Counting Polyominoes Using Attribute Grammars.
Proceedings of the Attribute Grammars and their Applications, 1990

1989
Labeled Trees and Relations on Generating Functions.
Proceedings of the TAPSOFT'89: Proceedings of the International Joint Conference on Theory and Practice of Software Development, 1989


  Loading...