default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCTW 2007: Enschede, The Netherlands
- Johann L. Hurink, Walter Kern, Gerhard F. Post, Georg Still:
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007. University of Twente 2007 - Nair Maria Maia de Abreu, Pierre Hansen, Carla Silva Oliveira, Leonardo Silva de Lima:
Bounds on the index of the Signless Laplacian of a graph involving the average degree of neighbors of a vertex. CTW 2007: 1-4 - Néstor E. Aguilera, Valeria A. Leoni, Graciela L. Nasini:
Some flexibility problmes and their complexity. CTW 2007: 5-8 - Stephan Dominique Andres:
Directed defective asymmetric graph coloring games on forests. CTW 2007: 9-12 - Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks:
The valve location problem. CTW 2007: 13-16 - Paul S. Bonsma:
Most balanced minimum cuts and partially ordered knapsack. CTW 2007: 17-21 - Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. CTW 2007: 23-27 - Sofie Coene, Frits C. R. Spieksma:
A latency problem with profits. CTW 2007: 29-32 - Ulrich Faigle, Britta Peis:
A two-phase greedy algorithm for modular lattice polyhedra. CTW 2007: 33-37 - Jinfeng Feng:
A characterization for jump graphs containing complementary cycles. CTW 2007: 39-42 - Henning Fernau:
Dynamic programming for queen domination. CTW 2007: 43-48 - Ralf Gollmer, Uwe Gotzes, Frederike Neise, Rüdiger Schultz:
Stochastic programs with dominance contraints induced by mixed-integer linear recourse. CTW 2007: 49-51 - Martin Charles Golumbic, Marina Lipshteyn, Michal Stern:
Edge intersection graphs of single bend paths on a grid. CTW 2007: 53-55 - Alexander Grigoriev, Joyce van Loon, Maxim Sviridenko, Marc Uetz, Tjark Vredeveld:
Optimal bundle pricing for homogeneous items. CTW 2007: 57-60 - Erwin W. Hans:
Operations Research for hospital process optimization. CTW 2007: 61-61 - Irith Ben-Arroyo Hartman:
On path partitions and colourings in digraphs. CTW 2007: 63-66 - Géraldine Heilporn, Martine Labbé, Patrice Marcotte, Gilles Savard:
On a network pricing problem with consecutive toll arcs. CTW 2007: 67-68 - Birgit Heydenreich, Rudolf Müller, Marc Uetz, Rakesh Vohra:
On revenue equivalence in truthful mechanisms. CTW 2007: 69-72 - Shahadat Hossain, Minhaz Fahim Zibran:
A multi-phase approach to the university course timetabling problem. CTW 2007: 73-76 - Johann L. Hurink, Tim Nieberg:
Approximating minimum independent dominating sets in wireless networks. CTW 2007: 77-80 - Yulia Kempner, Vadim E. Levit:
Representation of poly-antimatroids. CTW 2007: 81-84 - Walter Kern, Xinhui Wang:
On full components for Rectilinear Steiner tree. CTW 2007: 85-88 - Jimmy Leblet, Jean-Xavier Rampon:
St-serie decomposition of orders. CTW 2007: 89-93 - Ruijuan Li, Shengjia Li, Jinfeng Feng:
The number of vertices whose out-arcs are pancyclic in 2-strong tournaments. CTW 2007: 95-97 - Shengjia Li, Wei Meng, Yubao Guo:
A local tournament contains a vertex whose out-arcs are g-pancyclic. CTW 2007: 99-102 - Leo Liberti:
A useful characterization of the feasible region of binary linear programs. CTW 2007: 103-106 - Vadim V. Lozin, Martin Milanic:
On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110 - Dmitrii Lozovanu, Stefan Pickl:
Multiobjective hierarchical control of time-discrete systems and dtermining Stackelberg strategies. CTW 2007: 111-114 - Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti:
Fast point-to-point shortest path queries on dynamic road networks with interfal data. CTW 2007: 115-118 - Jacob Jan Paulus, Johann L. Hurink:
Decomposition method for project scheduling with adjacent resources. CTW 2007: 119-122 - Adriaan Peeters, Kris Coolsaet, Gunnar Brinkmann, Nicolas Van Cleemput, Veerle Fack:
GrInvIn for graph theory teaching and research. CTW 2007: 123-126 - Marie-Christine Plateau, Leo Liberti, Laurent Alfandari:
Edge cover by bipartite subgraphs. CTW 2007: 127-132 - Juan Alberto Rodríguez-Velázquez, José María Sigarreta:
On the defensive k-alliance number of a graph. CTW 2007: 133-136 - Joachim Spoerhase, Hans-Christoph Wirth:
Relaxed voting and competitive location on trees under monotonous gain functions. CTW 2007: 137-140
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-10-17 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
