|
|
Journals in DBLP
Corrigendum to "Surmise relations between tests - mathematical considerations": [Discrete Applied Mathematics 127 (2003) 221-239]. [Citation Graph (, )][DBLP]
Necessary conditions for multistationarity in discrete dynamical systems. [Citation Graph (, )][DBLP]
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids. [Citation Graph (, )][DBLP]
Reconstruction of permutations distorted by reversal errors. [Citation Graph (, )][DBLP]
Characterization and recognition of generalized clique-Helly graphs. [Citation Graph (, )][DBLP]
On the edge-connectivity and restricted edge-connectivity of a product of graphs. [Citation Graph (, )][DBLP]
On the (co)girth of a connected matroid. [Citation Graph (, )][DBLP]
Constrained sequence alignment: A general model and the hardness results. [Citation Graph (, )][DBLP]
Generalizing D-graphs. [Citation Graph (, )][DBLP]
Dirichlet problem on locally finite graphs. [Citation Graph (, )][DBLP]
General neighborhood sequences in Zn. [Citation Graph (, )][DBLP]
The source location problem with local 3-vertex-connectivity requirements. [Citation Graph (, )][DBLP]
Computation of best possible low degree expanders. [Citation Graph (, )][DBLP]
Online scheduling with machine cost and rejection. [Citation Graph (, )][DBLP]
Hybrid one-dimensional reversible cellular automata are regular. [Citation Graph (, )][DBLP]
Inequalities for the Grundy chromatic number of graphs. [Citation Graph (, )][DBLP]
Several polynomials associated with the harmonic numbers. [Citation Graph (, )][DBLP]
(2, 1)-Total labelling of outerplanar graphs. [Citation Graph (, )][DBLP]
On encodings of spanning trees. [Citation Graph (, )][DBLP]
Easy and hard instances of arc ranking in directed graphs. [Citation Graph (, )][DBLP]
Distance distributions for graphs modeling computer networks. [Citation Graph (, )][DBLP]
3D-interval-filament graphs. [Citation Graph (, )][DBLP]
|
