The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
2010, volume: 158, number: 8


  1. An implicit representation of chordal comparability graphs in linear time. [Citation Graph (, )][DBLP]


  2. Szeged index, edge Szeged index, and semi-star trees. [Citation Graph (, )][DBLP]


  3. Finding large cycles in Hamiltonian graphs. [Citation Graph (, )][DBLP]


  4. On well-covered triangulations: Part III. [Citation Graph (, )][DBLP]


  5. A tight bound on the number of mobile servers to guarantee transferability among dominating configurations. [Citation Graph (, )][DBLP]


  6. Integrated production and delivery scheduling with disjoint windows. [Citation Graph (, )][DBLP]


  7. Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches. [Citation Graph (, )][DBLP]


  8. Independence polynomials of k-tree related graphs. [Citation Graph (, )][DBLP]


  9. Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices. [Citation Graph (, )][DBLP]


  10. A note on the hardness of Skolem-type sequences. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002