Discrete Applied Mathematics, Volume 40

Volume 40, Number 1, 1992

• Thomas Andreae: Some Results on Visibility Graphs. 5-17
• Ulrich Faigle, Rainer Schrader, György Turán: The Communication Complexity of Interval Orders. 19-28
• Prabhakar Raghavan: Integer Programming in VLSI Design. 29-43
• Stefan Voß: Steiner's Problem in Graphs: Heuristic Methods. 45-72
• Dorothea Wagner, Frank Wagner: An Efficient Parallel Logarithmic Time Algorithm for the Channel Routing Problem. 73-81
• Charlotte Wieners-Lummer: A Manhattan Channel Router with Good Theoretical and Practical Performance. 83-104

Volume 40, Number 2, 1992

• Foto N. Afrati: The Parallel Complexity of Single Rule Logic Programs. 107-126
• János Demetrovics, Gyula O. H. Katona, Dezsö Miklós: Partial Dependencies in Relational Databases and their Realization. 127-138
• János Demetrovics, Gyula O. H. Katona, Attila Sali: The Characterization of Branching Dependencies. 139-153
• János Demetrovics, Leonid Libkin, Ilya B. Muchnik: Functional Dependencies in Relational Databases: A Lattice Point of View. 155-185
• Georg Gottlob, Michael Schrefl, Markus Stumptner: Selective Inheritance of Attribute Values in Relational Databases. 187-216
• Georg Lausen: Locking Based on a Pairwise Decomposition of the Transaction System. 217-236
• Heikki Mannila, Kari-Jouko Räihä: On the Complexity of Inferring Functional Dependencies. 237-243
• Yehoshua Sagiv, Yatin P. Saraiya: Minimizing Restricted-Fanout Queries. 245-264
• Bernhard Thalheim: The Number of Keys in Relational and Nested Relational Databases. 265-282

Volume 40, Number 3, 1992

• Paul A. Catlin, Jerrold W. Grossman, Arthur M. Hobbs, Hong-Jian Lai: Fractional Arboricity, Strength, and Principal Partitions in Graphs and Matroids. 285-302
• Israel Cederbaum, Israel Koren, Shmuel Wimer: Balanced Block Spacing for VLSI Layout. 303-318
• Arundhati Raychaudhuri: Optimal Multiple Interval Assignments in Frequency Assignment and Traffic Phasing. 319-332
• Stephen T. Schibell, Richard M. Stafford: Processor Interconnection Networks from Cayley Graphs. 333-357

Volume 40, Number 4, 1992

• András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki: Algorithms for Routing around a Rectangle. 363-378
• Naoki Katoh, Toshihide Ibaraki, Tiko Kameda: A Multiversion Cautious Scheduler with Dynamic Serialization Constraints for Database Concurrency Control. 379-395
• Ming-Tat Ko, Y. T. Ching: Linear Time Algorithms for the Weighted Tailored 2-Partition Problem and the Weighted 2-Center Problem under l_infty-Distance. 397-410
• Hsun-Ming Lee, Gerard J. Chang: Set to Set Broadcasting in Communication Networks. 411-421
• Christos Levcopoulos, Ola Petersson: Matching Parentheses in Parallel. 423-431
• Ruey-Der Lou, Majid Sarrafzadeh: Circular Permutation Graph Family with Applications. 433-457