Conferences in DBLP

(colognetwente)
2007 (conf/colognetwente/2007)

1. 
   Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex. [Citation Graph (, )][DBLP]
   
   
2. 
   Some flexibility problmes and their complexity. [Citation Graph (, )][DBLP]
   
   
3. 
   Directed defective asymmetric graph coloring games on forests. [Citation Graph (, )][DBLP]
   
   
4. 
   The valve location problem. [Citation Graph (, )][DBLP]
   
   
5. 
   Most balanced minimum cuts and partially ordered knapsack. [Citation Graph (, )][DBLP]
   
   
6. 
   A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. [Citation Graph (, )][DBLP]
   
   
7. 
   A latency problem with profits. [Citation Graph (, )][DBLP]
   
   
8. 
   A two-phase greedy algorithm for modular lattice polyhedra. [Citation Graph (, )][DBLP]
   
   
9. 
   A characterization for jump graphs containing complementary cycles. [Citation Graph (, )][DBLP]
   
   
10. 
    Dynamic programming for queen domination. [Citation Graph (, )][DBLP]
    
    
11. 
    Stochastic programs with dominance contraints induced by mixed-integer linear recourse. [Citation Graph (, )][DBLP]
    
    
12. 
    Edge intersection graphs of single bend paths on a grid. [Citation Graph (, )][DBLP]
    
    
13. 
    Optimal bundle pricing for homogeneous items. [Citation Graph (, )][DBLP]
    
    
14. 
    Operations Research for hospital process optimization. [Citation Graph (, )][DBLP]
    
    
15. 
    On path partitions and colourings in digraphs. [Citation Graph (, )][DBLP]
    
    
16. 
    On a network pricing problem with consecutive toll arcs. [Citation Graph (, )][DBLP]
    
    
17. 
    On revenue equivalence in truthful mechanisms. [Citation Graph (, )][DBLP]
    
    
18. 
    A multi-phase approach to the university course timetabling problem. [Citation Graph (, )][DBLP]
    
    
19. 
    Approximating minimum independent dominating sets in wireless networks. [Citation Graph (, )][DBLP]
    
    
20. 
    Representation of poly-antimatroids. [Citation Graph (, )][DBLP]
    
    
21. 
    On full components for Rectilinear Steiner tree. [Citation Graph (, )][DBLP]
    
    
22. 
    St-serie decomposition of orders. [Citation Graph (, )][DBLP]
    
    
23. 
    The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. [Citation Graph (, )][DBLP]
    
    
24. 
    A local tournament contains a vertex whose out-arcs are g-pancyclic. [Citation Graph (, )][DBLP]
    
    
25. 
    A useful characterization of the feasible region of binary linear programs. [Citation Graph (, )][DBLP]
    
    
26. 
    On the maximum independent set problem in subclasses of planar and more general graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies. [Citation Graph (, )][DBLP]
    
    
28. 
    Fast point-to-point shortest path queries on dynamic road networks with interfal data. [Citation Graph (, )][DBLP]
    
    
29. 
    Decomposition method for project scheduling with adjacent resources. [Citation Graph (, )][DBLP]
    
    
30. 
    GrInvIn for graph theory teaching and research. [Citation Graph (, )][DBLP]
    
    
31. 
    Edge cover by bipartite subgraphs. [Citation Graph (, )][DBLP]
    
    
32. 
    On the defensive k-alliance number of a graph. [Citation Graph (, )][DBLP]
    
    
33. 
    Relaxed voting and competitive location on trees under monotonous gain functions. [Citation Graph (, )][DBLP]