On universally easy classes for NP-complete problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computing a context-free grammar-generating series
Information and Computation
Basic analytic combinatorics of directed lattice paths
Theoretical Computer Science
Generating functions for generating trees
Discrete Mathematics
Context-free languages of sub-exponential growth
Journal of Computer and System Sciences
Note: on universally easy classes for NP-complete problems
Theoretical Computer Science
Walks confined in a quadrant are not always D-finite
Theoretical Computer Science - Random generation of combinatorial objects and bijective combinatorics
On the structure of the counting function of sparse context-free languages
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
On the context-freeness of the set of words containing overlaps
Information Processing Letters
Analytic combinatorics: a calculus of discrete structures
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Classifying lattice walks restricted to the quarter plane
Journal of Combinatorial Theory Series A
The Parikh counting functions of sparse context-free languages are quasi-polynomials
Theoretical Computer Science
On the growth of context-free languages
Journal of Automata, Languages and Combinatorics
On the density of regular and context-free languages
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
Counting colored planar maps: Algebraicity results
Journal of Combinatorial Theory Series B
A combinatorial framework for designing (pseudoknotted) RNA algorithms
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
Algebraic generating functions in enumerative combinatorics and context-free languages
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Non-D-finite excursions in the quarter plane
Journal of Combinatorial Theory Series A
| Hi-index | 5.24 |