|
Journals in DBLP
An implicit representation of chordal comparability graphs in linear time. [Citation Graph (, )][DBLP]
Szeged index, edge Szeged index, and semi-star trees. [Citation Graph (, )][DBLP]
Finding large cycles in Hamiltonian graphs. [Citation Graph (, )][DBLP]
On well-covered triangulations: Part III. [Citation Graph (, )][DBLP]
A tight bound on the number of mobile servers to guarantee transferability among dominating configurations. [Citation Graph (, )][DBLP]
Integrated production and delivery scheduling with disjoint windows. [Citation Graph (, )][DBLP]
Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. [Citation Graph (, )][DBLP]
Independence polynomials of k-tree related graphs. [Citation Graph (, )][DBLP]
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices. [Citation Graph (, )][DBLP]
A note on the hardness of Skolem-type sequences. [Citation Graph (, )][DBLP]
|