Electronic Notes in Discrete Mathematics, Volume 17

Volume 17, October 2004

• Leo Liberti, Francesco Maffioli:
  Preface. 1
  
• Horst W. Hamacher:
  Decomposition of consecutive-1 matrices and applications. 3
  
• Maurice Queyranne:
  Submodular function minimization in I and searching in Monge arrays. 5
  
• Leen Stougie:
  Polynomial solvability of Mader's edge-disjoint paths problem. 7
  
• Nitin Ahuja, Andreas Baltz, Benjamin Doerr, Anand Srivastav:
  Coloring Graphs with Minimal Edge Load. 9-13
  
• Méziane Aïder:
  Extended Distance-Hereditary Graphs. 15-17
  
• A. Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
  Virtual Private Network Design Under Traffic Uncertainty. 19-22
  
• Carme Àlvarez, Maria J. Serna:
  The Proper Interval Colored Graph problem for caterpillar trees: (Extended Abstract). 23-28
  
• Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan:
  Algorithms for finding minimum fundamental cycle bases in graphs. 29-33
  
• Roberto Aringhieri, Roberto Cordone:
  The Multicommodity Multilevel Bottleneck Assignment Problem. 35-40
  
• Roberto Aringhieri, Maurizio Bruglieri, Federico Malucelli, Maddalena Nonato:
  An asymmetric vehicle routing problem arising in the collection and disposal of special waste. 41-47
  
• Wolfgang W. Bein:
  Knowledge State Algorithms and the 2-Server Problem. 49
  
• Pietro Belotti, Federico Malucelli:
  Network design with grooming constraints. 51-56
  
• Nadja Betzler, Rolf Niedermeier, Johannes Uhlmann:
  Tree Decompositions of Graphs: Saving Memory in Dynamic Programming. 57-62
  
• Valentin E. Brimkov:
  Clique, chromatic, and Lovász numbers of certain circulant graphs. 63-67
  
• Tobias Brüggemann, Walter Kern:
  An improved local search algorithm for 3-SAT. 69-73
  
• Miroslava Cajkova, Veerle Fack:
  Clique algorithms for classifying substructures in generalized quadrangles. 75-79
  
• Domenico Cantone, Simone Faro:
  Two-Levels-Greedy: a generalization of Dijkstra's shortest path algorithm. 81-86
  
• Francesco Carrabs, Raffaele Cerulli, Monica Gentili, Gennaro Parlato:
  Minimum Weighted Feedback Vertex Set on Diamonds. 87-91
  
• William Y. C. Chen, Xueliang Li, Chao Wang, Xiaoyan Zhang:
  Linear Time Algorithms to the Minimum All-Ones Problem for Unicyclic and Bicyclic Graphs. 93-98
  
• Alessandro Chierici, Roberto Cordone, Roberto Maja:
  The demand-dependent optimization of regular train timetables. 99-104
  
• Marie-Christine Costa, Alain Billionnet:
  Multiway cut and integer flow problems in trees. 105-109
  
• Vladimir G. Deineko:
  New exponential neighbourhood for polynomially solvable TSPs. 111-115
  
• Paolo Detti, Carlo Meloni, Marco Pranzo:
  Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs. 117-122
  
• Vânia M. F. Dias, Celina M. Herrera de Figueiredo, Jayme Luiz Szwarcfiter:
  On the generation of bicliques of a graph. 123-127
  
• Benjamin Doerr, Nils Hebbinghaus, Sören Werth:
  An Improved Discrepancy Approach to Declustering. 129-133
  
• Takashi Doi, Toshihiro Fujito:
  A Primal-Dual Method for Approximating Tree Cover with Two Weights. 135-140
  
• M. Reza Emamy-Khansary:
  The Cut Number of the n-Cube, Boolean Methods and a Geometric Connection to Threshold Logic. 141-143
  
• Ulrich Faigle, Bernhard Fuchs, Britta Wienand:
  Covering Graphs by Colored Stable Sets. 145-149
  
• Taoufik Faik:
  About the b-continuity of graphs: (Extended Abstract). 151-156
  
• Fedor V. Fomin, Dimitrios M. Thilikos:
  A 3-approximation for the pathwidth of Halin graphs. 157-162
  
• Jean-Luc Fouquet, Jean-Marie Vanherpe:
  On I-sparse graphs and other families: Extended abstract. 163-167
  
• Vassilis Giakoumakis, Stephan Olariu:
  The set of prime extensions of a graph: the finite and the infinite case. 169-174
  
• Dion Gijswijt:
  On a packet scheduling problem for smart antennas and polyhedra defined by circular-ones matrices. 175-178
  
• Harald Gropp:
  More on orbital matrices. 179-183
  
• Nils Hebbinghaus:
  Discrepancy of Sums of Arithmetic Progressions. 185-189
  
• Michael Joswig, Marc E. Pfetsch:
  Computing Optimal Discrete Morse Functions. 191-195
  
• Stavros G. Kolliopoulos:
  Minimum-Cost Single-Source 2-Splittable Flow. 197-201
  
• Leo Liberti, Nelson Maculan, Sergei Kucherenko:
  The Kissing Number Problem: A New Result from Global Optimization. 203-207
  
• Dmitrii Lozovanu, Stefan Pickl:
  A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks. 209-214
  
• Andreas Märkert, Rüdiger Schultz:
  On Deviation Measures in Stochastic Integer Programming. 215-218
  
• Francesco Maffioli, Norma Zagaglia Salvi:
  A particular class of graphic matroids. 219-222
  
• Gaia Nicosia, Andrea Pacifici:
  Exact algorithms for a discrete metric labeling problem. 223-227
  
• Stavros D. Nikolopoulos, Leonidas Palios:
  On the Strongly Connected and Biconnected Components of the Complement of Graphs. 229-235
  
• Erich Prisner:
  k-Pseudosnakes in n-dimensional Hypercubes. 237-240
  
• Dirk Räbiger:
  Semi-preemptive routing on a line. 241-246
  
• Giovanni Righini, Matteo Salani:
  Dynamic programming algorithms for the elementary shortest path problem with resource constraints. 247-249
  
• A. N. M. Salman, H. J. Broersma:
  The Ramsey Numbers of Paths Versus Kipases. 251-255
  
• Fabio Tardella:
  Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming. 257-262
  
• Luis M. Torres:
  On cliques associated to 3-set packing problems. 263-267
  
• Akihiro Uejima, Hiro Ito:
  Subdivision of the hierarchy of H-colorable graph classes by circulant graphs. 269-274
  
• Dries Van Dyck, Veerle Fack:
  To be or not to be Yutsis. 275-279
  
• Andrea Vietri:
  The complexity of arc-colorings for directed hypergraphs. 281-284
  
• Mirjam Wattenhofer, Roger Wattenhofer:
  Fast and Simple Algorithms for Weighted Perfect Matching. 285-291
  
• Shenggui Zhang, Bing Chen, Rongzu Yu:
  Heavy cycles in k-connected weighted graphs. 293-296
  
• Blaz Zmazek, Janez Zerovnik:
  Behzad-Vizing conjecture and Cartesian product graphs. 297-300