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 10 (2007-2008)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
Kheddouci, Hamamache
;
Togni, Olivier
Strong Oriented Chromatic Number of Planar Graphs without Short Cycles
Montassier, Mickael
;
Ochem, Pascal
;
Pinlou, Alexandre
Interaction properties of relational periods
Halava, Vesa
;
Harju, Tero
;
Kärki, Tomi
On quadratic residue codes and hyperelliptic curves
Joyner, David
Sufficient conditions for labelled 0-1 laws
Burris, Stanley N.
;
Yeats, Karen A.
Total domination in K₅- and K₆-covered graphs
Favaron, Odile
;
Karami, H.
;
Sheikholeslami, S. M.
Bounded-degree graphs have arbitrarily large queue-number
Wood, David R.
The Laplacian spread of a tree
Fan, Yi-Zheng
;
Xu, Jing
;
Wang, Yi
;
Liang, Dong
On hereditary Helly classes of graphs
Groshaus, Marina
;
Szwarcfiter, Jayme Luiz
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
Kheddouci, Hamamache
;
Togni, Olivier
Recurrence among trees with most numerous efficient dominating sets
Bród, Dorota
;
Skupień, Zdzisław
VC-dimensions of random function classes
Ycart, Bernard
;
Ratsaby, Joel
Sommaire du
Fascicule no. 2
On symmetric structures of order two
Bousquet, Michel
;
Lamathe, Cédric
A determinant of Stirling cycle numbers counts unlabeled acyclic single-source automata
Callan, David
On the size of induced acyclic subgraphs in random digraphs
Spencer, Joel
;
Subramanian, C.R.
Culminating paths
Bousquet-Mélou, Mireille
;
Ponty, Yann
Spanning forests on the Sierpinski gasket
Chang, Shu-Chiuan
;
Chen, Lung-Chi
Leftmost derivations of propagating scattered context grammars: a new proof
Masopust, Tomáš
;
Techet, Jiří
Analysis of some parameters for random nodes in priority trees
Panholzer, Alois
Sommaire du
Fascicule no. 3
On the k-restricted structure ratio in planar and outerplanar graphs
Călinescu, Gruia
;
Fernandes, Cristina G.
Simultaneous generation for zeta values by the Markov-WZ method
Pilehrood, Khodabakhsh Hessami
;
Pilehrood, Tatiana Hessami
Shifts with decidable language and non-computable entropy
Hertling, Peter
;
Spandl, Christoph
The location of the first maximum in the first sojourn of a Dyck path
Prodinger, Helmut
On-line Ramsey numbers for paths and stars
Grytczuk, J. A.
;
Kierstead, H. A.
;
Prałat, P.
Progress on the traceability conjecture for oriented graphs
Frick, Marietjie
;
Katrenič, Peter
A note on compact and compact circular edge-colorings of graphs
Dereniowski, Dariusz
;
Nadolski, Adam
Counting descents, rises, and levels, with prescribed first element, in words
Kitaev, Sergey
;
Mansour, Toufik
;
Remmel, Jeff
Extremal K_(s,t)-free bipartite graphs
Balbuena, Camino
;
García-Vázquez, P.
;
Marcote, Xavier
;
Valenzuela, J. C.
On Compact Encoding of Pagenumber
$k$
Graphs
Gavoille, Cyril
;
Hanusse, Nicolas
Convergence of some leader election algorithms
Janson, Svante
;
Lavault, Christian
;
Louchard, Guy
Multidimensional cellular automata and generalization of Fekete's lemma
Capobianco, Silvio
An optimal permutation routing algorithm on full-duplex hexagonal networks
Sau, Ignasi
;
Žerovnik, Janez
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
Nuel, Gregory