CTW C

43 papers

YearTitle / Authors
20109th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Cologne, Germany, May 25-27, 2010. Extended Abstracts
Ulrich Faigle, Rainer Schrader, Daniel Herrmann
2010A Branch and Bound Method for a Clique Partitioning Problem.
Irène Charon, Olivier Hudry
2010A Branch-and-price Approach to the k-Clustering Minimum Biclique Completion Problem.
Stefano Gualandi, Francesco Maffioli, Claudio Magni
2010A Heuristic Algorithm for the Train-Unit Assignment Problem.
Valentina Cacchiani, Alberto Caprara, Paolo Toth
2010A tight Analysis of Brown-Baker-Katseff Sequences for Online Strip Packing.
Walter Kern, Jacob Jan Paulus
2010An Effective SAT Encoding for Magic Labeling.
Gerold Jäger
2010An Optimal Algorithm for the Indirect Covering Subtree Problem.
Joachim Spoerhase
2010Approximating Independent Set in Semi-Random Graphs.
Bodo Manthey, Kai Plociennik
2010Bisimplicial Edges in Bipartite Graphs.
Matthijs Bomhoff, Bodo Manthey
2010Branch-and-price for the Multi-depot Pickup and Delivery Problem with Heterogeneous Fleet and Soft Time Windows.
Andrea Bettinelli, Alberto Ceselli, Giovanni Righini
2010Chromatic Index of Chordless Graphs.
Raphael Machado, Celina M. H. de Figueiredo, Nicolas Trotignon
2010Complexity of O'Hara's Algorithm.
Matjaz Konvalinka, Igor Pak
2010Cycle Embedding in Alternating Group Graphs with Faulty Vertices and Faulty Edges.
Ping-Ying Tsai
2010Determining Optimal Stationary Strategies for Discounted Stochastic Optimal Control Problem on Networks.
Dmitrii Lozovanu, Stefan Pickl
2010Efficient Total Domination.
Oliver Schaudt
2010Exact Bipartite Crossing Minimization under Tree Constraints.
Frank Baumann, Christoph Buchheim, Frauke Liers
2010Graph Models and their Efficient Implementation for Sparse Jacobian Matrix Determination.
Shahadat Hossain, Trond Steihaug
2010Interval Total Colorings of Bipartite Graphs.
Petros A. Petrosyan, Ani Shashikyan, Arman Yu. Torosyan
2010Lattice Polyhedra and Submodular Flows.
Satoru Fujishige, Britta Peis
2010Lattices and Maximum Flow Algorithms in Planar Graphs.
Jannik Matuschke
2010Linear Visualization of a Road Coloring.
Avraham Trakhtman, Tomer Bauer, Noam Cohen
2010Maximum Delta-edge-colorable Subgraphs of Class II Graphs.
Vahan V. Mkrtchyan, Eckhard Steffen
2010Mixed Connectivity of Cartesian Graph Products and Bundles.
Rija Erves, Janez Zerovnik
2010New Fully Polynomial Time Approximation Scheme for the Makespan Minimization with Positive Tails on a Single Machine with a Fixed Non-availability Interval.
Imed Kacem
2010On Enumerating All Maximal Bicliques of Bipartite Graphs.
Enver Kayaaslan
2010On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length.
Edoardo Amaldi, Bernard Fortz, Claudio Iuliano
2010On Hamiltonian Cycles through Prescribed Edges of a Planar Graph.
Jochen Harant
2010On Reed's Conjecture in Triangle-Free Graphs.
Vera Weil
2010On a Stochastic Knapsack Problem.
Stefanie Kosuch, Marc Letournel, Abdel Lisser
2010On the Convergence of Feasibility based Bounds Tightening.
Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti
2010On the Design of the Fiber To The Home Networks.
Stefano Gualandi, Federico Malucelli, Domenico L. Sozzi
2010On the Partition Dimension of Cartesian Product Graphs.
Ismael González Yero, Juan Alberto Rodríguez-Velázquez, Magdalena Lemanska
2010Optimization Algorithms for the Max Edge Weighted Clique Problem with Multiple Choice Constraints.
Alberto Ceselli, Roberto Cordone, Yari Melzani, Giovanni Righini
2010Pixel Guards in Polyominoes.
Val Pinciu
2010Progress on Rainbow Connection.
Ingo Schiermeyer
2010Radio Labeling Cartesian Graph Products.
Cindy Wyels, Maggy Tomova
2010Semidenite Programming for Stochastic Wireless OFDMA Networks.
Pablo Adasme, Abdel Lisser
2010Some Bounds on Alliances in Trees.
Ararat Harutyunyan
2010Static Symmetry Breaking in Circle Packing.
Alberto Costa, Pierre Hansen, Leo Liberti
2010The Classfication of B-perfect Graphs.
Stephan Dominique Andres
2010The Game Chromatic Number of 1-Caterpillars.
Adrien Guignard
2010The Inverse 1-Median Problem in Rd with the Chebyshev-Norm.
Johannes Hatzl
2010Wide - Sense Nonblocking logd(N; 0; p) Networks.
Maja Rotovnik, Janez Zerovnik