Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete mathematics & theoretical computer science
Tome 9 (2007)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Waiting time distributions for pattern occurrence in a constrained sequence
Stefanov, Valeri T.
;
Szpankowski, Wojciech
On the complexity of the balanced vertex ordering problem
Kára, Jan
;
Kratochvil, Jan
;
Wood, David R.
Approximation and inapproximability results on balanced connected partitions of graphs
Chataigner, Frédéric
;
Salgado, Liliane R. B.
;
Wakabayashi, Yoshiko
Independent sets in graphs with an excluded clique minor
Wood, David R.
A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations
Louchard, Guy
;
Prodinger, Helmut
Complexity results on graphs with few cliques
Rosgen, Bill
;
Stewart, Lorna
On the tileability of polygons with colored dominoes
Worman, Chris
;
Yang, Boting
Arithmetics in β-numeration
Bernat, Julien
A perimeter enumeration of column-convex polyominoes
Feretić, Svjetlan
A lower bound for approximating the Grundy number
Kortsarz, Guy
On the critical exponent of generalized Thue-Morse words
Massé, Alexandre B.
;
Brlek, Srečko
;
Glen, Amy
;
Labbé, Sébastien
Tribes of cubic partial cubes
Klavžar, Sandi
;
Shpectorov, Sergey
Asymptotic behaviour of a non-commutative rational series with a nonnegative linear representation
Dumas, Philippe
;
Lipmaa, Helger
;
Wallén, Johan
Latin square Thue-Morse sequences are overlap-free
Tompkins, C. Robinson
Probe split graphs
Le, Van Bang
;
Ridder, H. N.
"Trivializing'' generalizations of some Izergin-Korepin-type determinants
Amdeberhan, Tewodros
;
Zeilberger, Doron
Note on the weighted internal path length of b-ary trees
Rüschendorf, Ludger
;
Schopp, Eva-Maria
FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees
Minet, Pascale
;
Martin, Steven
;
Saidane, Leila Azouz
;
Azzaz, Skander
Exponential bounds and tails for additive random recursive sequences
Rüschendorf, Ludger
;
Schopp, Eva-Maria
On the kth Eigenvalues of Trees with Perfect Matchings
Chang, An
;
Shiu, Wai Chee
Strong chromatic index of products of graphs
Togni, Olivier
Sommaire du
Fascicule no. 2
NONCOMMUTATIVE SYMMETRIC FUNCTIONS ASSOCIATED WITH A CODE, LAZARD ELIMINATION, AND WITT VECTORS
Luque, Jean-Gabriel
;
Thibon, Jean-Yves
An algorithm for generating ribbon tableaux and spin polynomials
Descouens, Francois
Coding partitions
Burderi, Fabio
;
Restivo, Antonio
Ambiguity in the m-bonacci numeration system
Kocábová, Petra
;
Masáková, Zuzana
;
Pelantová, Edita
Baire and automata
Simonnet, Pierre
;
Cagnard, Benoit
Gray code order for Lyndon words
Vajnovszki, Vincent
Addition and multiplication of beta-expansions in generalized Tribonacci base
Ambrož, Petr
;
Masáková, Zuzana
;
Pelantová, Edita
The \v Cerný conjecture for aperiodic automata
Trahtman, A. N.
Foreword to the special issue dedicated to the tenth ''Journées montoises d'informatique théorique''
Bruyère, Véronique
;
Rigo, Michel
Words and bisimulations of dynamical systems
Brihaye, Thomas
Computation of L_⊕ for several cubic Pisot numbers
Bernat, Julien
Regular languages and associative language descriptions
Anselmo, Marcella
;
Cherubini, Alessandra
;
San Pietro, Pierluigi
A geometrical approach of palindromic factors of standard billiard words
Borel, Jean-Pierre
On morphisms preserving infinite Lyndon words
Richomme, Gwenael
Properties of the extremal infinite smooth words
Brlek, Srečko
;
Melançon, Guy
;
Paquin, Geneviève
Tiling a Pyramidal Polycube with Dominoes
Bodini, Olivier
;
Jamet, Damien
Infinite special branches in words associated with beta-expansions
Frougny, Christiane
;
Masáková, Zuzana
;
Pelantová, Edita
Tag-systems for the Hilbert curve
Séébold, Patrice