Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCTW 2010: Cologne, Germany
- Ulrich Faigle, Rainer Schrader, Daniel Herrmann:
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts. 2010 - Pablo Adasme, Abdel Lisser:
Semidenite Programming for Stochastic Wireless OFDMA Networks. CTW 2010: 1-4 - Edoardo Amaldi, Bernard Fortz, Claudio Iuliano:
On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. CTW 2010: 5-8 - Stephan Dominique Andres:
The Classfication of B-perfect Graphs. CTW 2010: 9-12 - Avraham Trakhtman, Tomer Bauer, Noam Cohen:
Linear Visualization of a Road Coloring. CTW 2010: 13-16 - Frank Baumann, Christoph Buchheim, Frauke Liers:
Exact Bipartite Crossing Minimization under Tree Constraints. CTW 2010: 17-20 - Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti:
On the Convergence of Feasibility based Bounds Tightening. CTW 2010: 21-24 - Andrea Bettinelli, Alberto Ceselli, Giovanni Righini:
Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows. CTW 2010: 25-28 - Matthijs Bomhoff, Bodo Manthey:
Bisimplicial Edges in Bipartite Graphs. CTW 2010: 29-32 - Valentina Cacchiani, Alberto Caprara, Paolo Toth:
A Heuristic Algorithm for the Train-Unit Assignment Problem. CTW 2010: 33-36 - Alberto Ceselli, Roberto Cordone, Yari Melzani, Giovanni Righini:
Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints. CTW 2010: 37-41 - Irène Charon, Olivier Hudry:
A Branch and Bound Method for a Clique Partitioning Problem. CTW 2010: 43-46 - Alberto Costa, Pierre Hansen, Leo Liberti:
Static Symmetry Breaking in Circle Packing. CTW 2010: 47-50 - Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Chromatic Index of Chordless Graphs. CTW 2010: 51-54 - Satoru Fujishige, Britta Peis:
Lattice Polyhedra and Submodular Flows. CTW 2010: 55-59 - Ismael González Yero, Juan Alberto Rodríguez-Velázquez, Magdalena Lemanska:
On the Partition Dimension of Cartesian Product Graphs. CTW 2010: 61-64 - Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi:
On the Design of the Fiber To The Home Networks. CTW 2010: 65-68 - Stefano Gualandi, Francesco Maffioli, Claudio Magni:
A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem. CTW 2010: 69-72 - Adrien Guignard:
The Game Chromatic Number of 1-Caterpillars. CTW 2010: 73-77 - Jochen Harant:
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph. CTW 2010: 79-82 - Ararat Harutyunyan:
Some Bounds on Alliances in Trees. CTW 2010: 83-86 - Johannes Hatzl:
The Inverse 1-Median Problem in Rd with the Chebyshev-Norm. CTW 2010: 87-90 - Shahadat Hossain, Trond Steihaug:
Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination. CTW 2010: 91-96 - Gerold Jäger:
An Effective SAT Encoding for Magic Labeling. CTW 2010: 97-100 - Imed Kacem:
New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval. CTW 2010: 101-104 - Enver Kayaaslan:
On Enumerating All Maximal Bicliques of Bipartite Graphs. CTW 2010: 105-108 - Walter Kern, Jacob Jan Paulus:
A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing. CTW 2010: 109-110 - Stefanie Kosuch, Marc Letournel, Abdel Lisser:
On a Stochastic Knapsack Problem. CTW 2010: 111-114 - Dmitrii Lozovanu, Stefan Pickl:
Determining Optimal Stationary Strategies for Discounted Stochastic Optimal Control Problem on Networks. CTW 2010: 115-118 - Bodo Manthey, Kai Plociennik:
Approximating Independent Set in Semi-Random Graphs. CTW 2010: 119-122 - Jannik Matuschke:
Lattices and Maximum Flow Algorithms in Planar Graphs. CTW 2010: 123-127 - Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Delta-edge-colorable Subgraphs of Class II Graphs. CTW 2010: 129-132 - Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Torosyan:
Interval Total Colorings of Bipartite Graphs. CTW 2010: 133-136 - Val Pinciu:
Pixel Guards in Polyominoes. CTW 2010: 137-140 - Rija Erves, Janez Zerovnik:
Mixed Connectivity of Cartesian Graph Products and Bundles. CTW 2010: 141-144 - Maja Rotovnik, Janez Zerovnik:
Wide - Sense Nonblocking logd(N; 0; p) Networks. CTW 2010: 145-148 - Oliver Schaudt:
Efficient Total Domination. CTW 2010: 149-152 - Ingo Schiermeyer:
Progress on Rainbow Connection. CTW 2010: 153-156 - Joachim Spoerhase:
An Optimal Algorithm for the Indirect Covering Subtree Problem. CTW 2010: 157-161 - Cindy Wyels, Maggy Tomova:
Radio Labeling Cartesian Graph Products. CTW 2010: 163-167 - Ping-Ying Tsai:
Cycle Embedding in Alternating Group Graphs with Faulty Vertices and Faulty Edges. CTW 2010: 169-172 - Vera Weil:
On Reed's Conjecture in Triangle-Free Graphs. CTW 2010: 173-175
Appendix
- Matjaz Konvalinka, Igor Pak:
Complexity of O'Hara's Algorithm. CTW 2010
a service of 
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 2024-04-15 20:33 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
