The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1989, volume: 22, number: 2


  1. Avoiding-sequences with minimum sum. [Citation Graph (, )][DBLP]


  2. The complexity of generalized clique covering. [Citation Graph (, )][DBLP]


  3. Pick-and-choose heuristics for partial set covering. [Citation Graph (, )][DBLP]


  4. To vote or not to vote: What is the quota? [Citation Graph (, )][DBLP]


  5. Online variable-sized bin packing. [Citation Graph (, )][DBLP]


  6. Optimal normal bases in GF(pn). [Citation Graph (, )][DBLP]


  7. Acyclic k-connected subgraphs for distributed alternate routing in communications networks. [Citation Graph (, )][DBLP]


  8. On a class of functions attaining their maximum at the vertices of a polyhedron. [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