Discrete Applied Mathematics, Volume 144

Volume 144, Number 1-2, November 2004

• Martin Anthony, Endre Boros, Peter L. Hammer, Alexander Kogan:
  Introduction to special volume of Discrete Applied Mathematics. 1-
  
• Martin Anthony:
  On data classification by iterative linear partitioning. 2-16
  
• Martin Anthony:
  Some connections between learning and optimization. 17-26
  
• Anne Berry, Alain Sigayret:
  Representing a concept lattice by a graph. 27-42
  
• Endre Boros, Vladimir Menkov:
  Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis. 43-58
  
• Renato Bruni:
  Discrete models for data imputation. 59-69
  
• Jitender S. Deogun, Jamil Saquer:
  Monotone concepts for formal concept analysis. 70-78
  
• Peter L. Hammer, Alexander Kogan, Bruno Simeone, Sándor Szedmák:
  Pareto-optimal patterns in logical analysis of data. 79-102
  
• Peter L. Hammer, Yanpei Liu, Bruno Simeone, Sándor Szedmák:
  Saturated systems of homogeneous boxes and the logical analysis of numerical data. 103-109
  
• Ferran Hurtado, Mercè Mora, Pedro A. Ramos, Carlos Seara:
  Separability by two lines and by nearly straight polygonal chains. 110-122
  
• Szymon Jaroszewicz, Dan A. Simovici, Ivo G. Rosenberg:
  Measures on Boolean polynomials and their applications in data mining. 123-139
  
• Gyula O. H. Katona, Attila Sali:
  New type of coding problem motivated by database theory. 140-148
  
• Anthony J. Macula, Leonard J. Popyack:
  A group testing method for finding patterns in data. 149-157
  
• Michel Minoux:
  Polynomial approximation schemes and exact algorithms for optimum curve segmentation problems. 158-172
  
• Ron Shamir, Roded Sharan, Dekel Tsur:
  Cluster graph modification problems. 173-182
  
• Nicolae Tandareanu:
  Distinguished representatives for equivalent labelled stratified graphs and applications. 183-208
  
• Eduardo Sany Laber, Loana Tito Nogueira:
  On the hardness of the minimum height decision tree problem. 209-212
  
• Christophe Moan, Irena Rusu:
  Hard problems in similarity searching. 213-227
  

Volume 144, Number 3, December 2004

• Elena Lodi, Linda Pagli, Nicola Santoro:
  Fun with algorithms. 229-230
  
• Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro:
  Fun-Sort--or the chaos of unordered binary search. 231-236
  
• Giusi Castiglione, Antonio Restivo, Sergio Salemi:
  Patterns in words and languages. 237-246
  
• Ferdinando Cicalese, Luisa Gargano, Ugo Vaccaro:
  On searching strategies, parallel questions, and delayed answers. 247-262
  
• Valentina Ciriani, Nadia Pisanti, Anna Bernasconi:
  Room allocation: a polynomial subcase of the quadratic assignment problem. 263-269
  
• Christian S. Collberg, Todd A. Proebsting:
  Problem identification using program checking. 270-280
  
• Pilu Crescenzi, Federico Montecalvo, Gianluca Rossi:
  Optimal covering designs: complexity results and new bounds. 281-290
  
• Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi:
  A bijection for the total area of parallelogram polyominoes. 291-302
  
• Riccardo Focardi, Flaminia L. Luccio:
  A modular approach to Sprouts. 303-319
  
• Pierre Fraigniaud:
  A note on line broadcast in digraphs under the edge-disjoint paths mode. 320-323
  
• Vincenzo Gervasi, Giuseppe Prencipe:
  Coordination without communication: the case of the flocking problem. 324-344
  
• Markus Holzer, Waltraud Holzer:
  Tantrix^TM rotation puzzles are intractable. 345-358
  
• Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
  Waiting patterns for a printer. 359-373
  
• Pat Morin, Jason Morrison:
  The geometry of carpentry and joinery. 374-380