The SCEAS System
Navigation Menu

Journals in DBLP

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


  1. Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. [Citation Graph (, )][DBLP]


  2. Average-case analysis of incremental topological ordering. [Citation Graph (, )][DBLP]


  3. Directed defective asymmetric graph coloring games. [Citation Graph (, )][DBLP]


  4. Most balanced minimum cuts. [Citation Graph (, )][DBLP]


  5. Minimum cut bases in undirected networks. [Citation Graph (, )][DBLP]


  6. An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse. [Citation Graph (, )][DBLP]


  7. The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions. [Citation Graph (, )][DBLP]


  8. minimum dominating set of queens: A trivial programming exercise? [Citation Graph (, )][DBLP]


  9. The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. [Citation Graph (, )][DBLP]


  10. Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian. [Citation Graph (, )][DBLP]


  11. Three supplements to Reid's theorem in multipartite tournaments. [Citation Graph (, )][DBLP]


  12. Solving a multicoloring problem with overlaps using integer programming. [Citation Graph (, )][DBLP]


  13. Bounds on the index of the signless Laplacian of a graph. [Citation Graph (, )][DBLP]


  14. Relaxed voting and competitive location under monotonous gain functions on trees. [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