%\documentclass[11pt]{article}
%\documentclass{endm}
%\documentclass{ctwart}

\begin{center}
\centerline{\bf Table of Contents}
\end{center}
\bigskip

\noindent \textit{Pablo Adasme, Abdel Lisser}\\
\noindent Semidenite Programming for Stochastic Wireless OFDMA Networks \hfill
1 \\

\noindent \textit{Edoardo Amaldi, Claudio Iuliano}\\
\noindent On finding a minimum weight cycle basis with cycles of bounded length
\hfill  5\\

\noindent \textit{Stephan Dominique Andres}\\
\noindent The classification of B-perfect graphs \hfill  9\\

\noindent \textit{Avraham Trahtman, Tomer Bauer, Noam Cohen}\\
\noindent  	Linear Visualization of a Road Coloring \hfill  13\\

\noindent \textit{Frank Baumann, Christoph Buchheim, Frauke Liers}\\
\noindent  	Exact Bipartite Crossing Minimization under Tree Constraints
\hfill  17\\

\noindent \textit{Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti}\\
\noindent 	On the convergence of feasibility based bounds tightening
\hfill  21\\

\noindent \textit{Andrea Bettinelli, Alberto Ceselli, Giovanni Righini}\\
\noindent Branch-and-price for the multi-depot pickup and delivery\\
\noindent problem with heterogeneous fleet and soft time windows \hfill  25\\

\noindent \textit{Matthijs Bomhoff, Bodo Manthey}\\
\noindent  	Bisimplicial Edges in Bipartite Graphs
\hfill  29\\

\noindent \textit{Valentina Cacchiani, Alberto Caprara, Paolo Toth}\\
\noindent 	A Heuristic Algorithm for the Train-Unit Assignment Problem
\hfill  33\\

\noindent \textit{Alberto Ceselli, Roberto Cordone, Yari Melzani, Giovanni Righini}\\
\noindent 	Optimization algorithms for the Max Edge Weighted Clique problem\\ 
\noindent with Multiple Choice constraints \hfill  37\\

\noindent \textit{Irene Charon, Olivier Hudry}\\
\noindent A branch and bound method for a clique partitioning problem
\hfill  43\\

\noindent \textit{Alberto Costa, Pierre Hansen, Leo Liberti}\\
\noindent 	Static symmetry breaking in circle packing
\hfill  47\\

\noindent \textit{Raphael Machado, Celina de Figueiredo, Nicolas Trotignon}\\
\noindent Chromatic index of chordless graphs
\hfill  51\\

\noindent \textit{Satoru Fujishige , Britta Peis}\\
\noindent Lattice Polyhedra and Submodular Flows
\hfill  55\\

\noindent \textit{Ismael Gonzalez Yero, Juan A. Rodriguez-Velazquez, Magdalena
Lemanska}\\ 
\noindent On the partition dimension of Cartesian product graphs \hfill  61\\

\noindent \textit{Stefano Gualandi, Federico Malucelli, Domenico Sozzi}\\
\noindent On the Design of the Fiber To The Home Networks
\hfill  65\\

\noindent \textit{Stefano Gualandi, Francesco Maffioli, Claudio Magni}\\
\noindent  	A branch-and-price approach to the k-Clustering Minimum\\ 
\noindent Biclique Completion Problem \hfill  69\\

\noindent \textit{Guignard Adrien}\\
\noindent The game chromatic number of 1-caterpillars
\hfill  73\\

\noindent \textit{Jochen Harant}\\
\noindent On Hamiltonian cycles through prescribed edges of a planar graph
\hfill  79\\

\noindent \textit{Ararat Harutyunyan}\\
\noindent  	Some bounds on alliances in trees
\hfill  83\\

\noindent \textit{Johannes Hatzl}\\
\noindent The Inverse 1-Median Problem in $\mathbb{R}^d$ with the
Chebyshev-Norm \hfill  87\\

\noindent \textit{Shahadat Hossain, Trond Steihaug}\\
\noindent Graph Models and their Efficient Implementation for\\
\noindent Sparse Jacobian Matrix Determination \hfill  91\\

\noindent \textit{Gerold Jaeger}\\
\noindent  	An Effective SAT Encoding for Magic Labeling 
\hfill  97\\

\noindent \textit{Imed Kacem}\\
\noindent  	New Fully Polynomial Time Approximation Scheme for the makespan\\
\noindent minimization with positive tails on a single machine\\
\noindent with a fixed non-availability interval 
\hfill  101\\

\noindent \textit{Enver Kayaaslan}\\
\noindent  	On Enumerating All Maximal Bicliques of Bipartite Graphs
\hfill  105\\

\noindent \textit{Walter Kern, Jacob Jan Paulus}\\
\noindent A tight analysis of Brown-Baker-Katseff sequences\\
\noindent for online strip packing \hfill  109\\

\noindent \textit{Stefanie Kosuch, Marc Letournel, Abdel Lisser}\\
\noindent  	On a Stochastic Knapsack Problem
\hfill  111\\

\noindent \textit{Dmitrii Lozovanu, Stefan Pickl}\\
\noindent  	Determining Optimal Stationary Strategies for Discounted\\
\noindent Stochastic Optimal Control Problem on Networks \hfill  115\\

\noindent \textit{Bodo Manthey, Kai Plociennik}\\
\noindent   	Approximating Independent Set in Semi-Random Graphs
\hfill  119\\

\noindent \textit{Jannik Matuschke}\\
\noindent  	Lattices and maximum flow algorithms in planar graphs
\hfill  123\\

\noindent \textit{Vahan Mkrtchyan, Eckhard Steffen}\\
\noindent  Maximum $\Delta$-edge-colorable subgraphs of class II graphs
\hfill  129\\

\noindent \textit{Petros Petrosyan, Ani Shashikyan, Arman Torosyan}\\
\noindent  	Interval total colorings of bipartite graphs
\hfill  133\\

\noindent \textit{Val Pinciu}\\
\noindent  	Pixel Guards in Polyominoes
\hfill  137\\

\noindent \textit{Rija Erves, Janez Zerovnik}\\
\noindent  	 	Mixed connectivity of Cartesian graph products and bundles
\hfill  141\\

\noindent \textit{Maja Rotovnik, Janez Zerovnik}\\
\noindent  	 	Wide - sense nonblocking $\log_d(N,0,p)$ networks
\hfill  145\\



\noindent \textit{Oliver Schaudt}\\
\noindent  	 	 	Efficient total domination
\hfill  149\\


\noindent \textit{Ingo Schiermeyer}\\
\noindent  	 	 	Progress on rainbow connection
\hfill  153\\


\noindent \textit{Joachim Spoerhase}\\
\noindent  	  	An Optimal Algorithm for the Indirect Covering Subtree Problem
\hfill  157\\


\noindent \textit{Cynthia Wyels, Maggy Tomova}\\
\noindent  	Radio Labeling Cartesian Graph Products
\hfill  163\\

\noindent \textit{Ping-Ying Tsai}\\
\noindent Cycle embedding in alternating group graphs with faulty vertices\\
\noindent and faulty edges \hfill  169\\

\noindent \textit{Vera Weil}\\
\noindent  On Reed's Conjecture in Triangle-Free Graphs
\hfill  173\\

\noindent \textit{Appendix}\\

%noindent \textit{Angel Garrido}\\
%\noindent   	Graph of Complex Networks
%\hfill  Appendix\\

\noindent \textit{Matjaz Konvalinka, Igor Pak}\\
\noindent   	Complexity of O'Hara's algorithm
\hfill  Appendix\\



 	