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 8 (2006)
Précédent Suivant


The Online Specialization Problem
Hong, Edwin S.

On randomly colouring locally sparse graphs
Frieze, Alan ; Vera, Juan

Optimal L(h,k)-Labeling of Regular Grids
Calamoneri, Tiziana

Common intervals in permutations
Corteel, Sylvie ; Louchard, Guy ; Pemantle, Robin

The first descent in samples of geometric random variables and permutations
Knopfmacher, Arnold ; Prodinger, Helmut

On the number of spanning trees of K_n^m #x00B1 G graphs
Nikolopoulos, Stavros D. ; Papadopoulos, Charis

On the computability of the topological entropy of subshifts
Simonsen, Jakob Grue

Tiling Z² with translations of one set
Rao, Hui ; Xue, Yu-Mei

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks
Angelelli, Enrico ; Speranza, Maria Grazia ; Tuza, Zsolt

On Sampling Colorings of Bipartite Graphs
Balasubramanian, R. ; Subramanian, C.R.

A survey of multivariate aspects of the contraction method
Neininger, Ralph ; Rüschendorf, Ludger

Recognizing HH-free, HHD-free, and Welsh-Powell Opposition Graphs
Nikolopoulos, Stavros D. ; Palios, Leonidas

Approximation Algorithms for Multicoloring Planar Graphs and Powers of Square and Triangular Meshes
Kchikech, Mustapha ; Togni, Olivier

P6- and triangle-free graphs revisited: structure and bounded clique-width
Brandstädt, Andreas ; Klembt, Tilo ; Mahfud, Suhail

Generalized connected domination in graphs
Kouider, Mekkia ; Vestergaard, Preben Dahl

A Cartesian closed category of event structures with quotients
Abbes, Samy

d-records in geometrically distributed random variables
Prodinger, Helmut

Counting l-letter subwords in compositions
Mansour, Toufik ; Sirhan, Basel O.

Some new optimal and suboptimal infinite families of undirected double-loop networks
Chen, Bao-Xing ; Meng, Ji-Xiang ; Xiao, Wen-Jun
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité