|
Journals in DBLP
Cologne/Twente workshop on graphs and combinatorial optimization CTW 2007. [Citation Graph (, )][DBLP]
Average-case analysis of incremental topological ordering. [Citation Graph (, )][DBLP]
Directed defective asymmetric graph coloring games. [Citation Graph (, )][DBLP]
Most balanced minimum cuts. [Citation Graph (, )][DBLP]
Minimum cut bases in undirected networks. [Citation Graph (, )][DBLP]
An algorithm for stochastic programs with first-order dominance constraints induced by linear recourse. [Citation Graph (, )][DBLP]
The Transitive Minimum Manhattan Subnetwork Problem in 3 dimensions. [Citation Graph (, )][DBLP]
minimum dominating set of queens: A trivial programming exercise? [Citation Graph (, )][DBLP]
The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops. [Citation Graph (, )][DBLP]
Degree conditions on distance 2 vertices that imply k-ordered Hamiltonian. [Citation Graph (, )][DBLP]
Three supplements to Reid's theorem in multipartite tournaments. [Citation Graph (, )][DBLP]
Solving a multicoloring problem with overlaps using integer programming. [Citation Graph (, )][DBLP]
Bounds on the index of the signless Laplacian of a graph. [Citation Graph (, )][DBLP]
Relaxed voting and competitive location under monotonous gain functions on trees. [Citation Graph (, )][DBLP]
|