Abstract is missing.
- Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertexNair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira, Leoanardo Silva de Lima. 1-4
- Some flexibility problmes and their complexityNéstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini. 5-8
- Directed defective asymmetric graph coloring games on forestsStepahn Dominique Andres. 9-12
- The valve location problemHans Leo Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks. 13-16
- Most balanced minimum cuts and partially ordered knapsackPaul S. Bonsma. 17-21
- A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraintAndrea Bettinelli, Alberto Ceselli, Giovanni Righini. 23-27
- A latency problem with profitsSofie Coene, Frits C. R. Spieksma. 29-32
- A two-phase greedy algorithm for modular lattice polyhedraUlrich Faigle, Britta Peis. 33-37
- A characterization for jump graphs containing complementary cyclesJinfeng Feng. 39-42
- Dynamic programming for queen dominationHenning Fernau. 43-48
- Stochastic programs with dominance contraints induced by mixed-integer linear recourseRalf Gollmer, Uwe Gotzes, Frederike Neise, Rüdiger Schultz. 49-51
- Edge intersection graphs of single bend paths on a gridMartin Charles Golumbic, Marina Lipshteyn, Michal Stern. 53-55
- Optimal bundle pricing for homogeneous itemsAlexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld. 57-60
- Operations Research for hospital process optimizationErwin W. Hans. 61-61
- On path partitions and colourings in digraphsIrith Ben-Arroyo Hartman. 63-66
- On a network pricing problem with consecutive toll arcsGéraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard. 67-68
- On revenue equivalence in truthful mechanismsBirgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra. 69-72
- A multi-phase approach to the university course timetabling problemShahadat Hossain, Minhaz Fahim Zibran. 73-76
- Approximating minimum independent dominating sets in wireless networksJohann Hurink, Tim Nieberg. 77-80
- Representation of poly-antimatroidsYulia Kempner, Vadim E. Levit. 81-84
- On full components for Rectilinear Steiner treeWalter Kern, Xinhui Wang. 85-88
- St-serie decomposition of ordersJimmy Leblet, Jean-Xavier Rampon. 89-93
- The number of vertices whose out-arcs are pancyclic in 2-strong tournamentsRuijuan Li, Shengjia Li, Jinfeng Feng. 95-97
- A local tournament contains a vertex whose out-arcs are ::::g::::-pancyclicShengjia Li, Wei Meng, Yubao Guo. 99-102
- A useful characterization of the feasible region of binary linear programsLeo Liberti. 103-106
- On the maximum independent set problem in subclasses of planar and more general graphsVadim V. Lozin, Martin Milanic. 107-110
- Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategiesDmitrii Lozovanu, Stefan Pickl. 111-114
- Fast point-to-point shortest path queries on dynamic road networks with interfal dataGiacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti. 115-118
- Decomposition method for project scheduling with adjacent resourcesJacob Jan Paulus, Johann Hurink. 119-122
- GrInvIn for graph theory teaching and researchAdriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack. 123-126
- Edge cover by bipartite subgraphsMarie-Christine Plateau, Leo Liberti, Laurent Alfandari. 127-132
- On the defensive ::::k::::-alliance number of a graphJuan Alberto Rodríguez-Velazquez, Jose Maria Sigarreta. 133-136
- Relaxed voting and competitive location on trees under monotonous gain functionsJoachim Spoerhase, Hans-Christoph Wirth. 137-140