default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 42
Volume 42, Number 1, 1993
- Vladimir Estivill-Castro, Heikki Mannila, Derick Wood:
Right Invariant Metrics and Measures of Presortedness. 1-16 - Monique Guignard:
Solving Makespan Minimization Problems with Lagrangean Decomposition. 17-29 - A. Sadam Hedayat, Gholamreza B. Khosrovshahi, Dibyen Majumdar:
A Prospect for a General Method of Constructing t-Designs. 31-50 - J. Mark Keil:
The Complexity of Domination Problems in Circle Graphs. 51-63 - John Shawe-Taylor
, Martin Anthony, Norman Biggs:
Bounding Sample Size with the Vapnik-Chervonenkis Dimension. 65-73 - Vaidy S. Sunderam, Peter Winkler:
Fast Information Sharing in a Complete Network. 75-86 - Brent M. Troutman, Michael R. Karlinger:
A Note on Subtrees Rooted Along the Primary Path of a Binary Tree. 87-93 - Lianwen Zhang:
Studies on Hypergraphs I: Hyperforests. 95-112
- Mario Martelli, Mario Pedrazzoli:
On Pseudounimodular Matrices. 113-117
Volume 42, Number 2, 1993
- Giulia Galbiati, Francesco Maffioli:
Preface. 119 - Francesco Maffioli:
In Memoriam Paolo M. Camerini. 121-122 - Jacek Blazewicz, Wieslaw Kubiak, Silvano Martello:
Algorithms for Minimizing Maximum Lateness with Unit Length Tasks and Resource Constraints. 123-138 - Sung-Jin Chung, Horst W. Hamacher, Francesco Maffioli, Katta G. Murty:
Note on Combinatorial Optimization with Max-Linear Objective Functions. 139-145 - Brenda L. Dietrich, Laureano F. Escudero, F. Chance:
Efficient Reformulation for 0-1 Programs - Methods and Computational Results. 147-175 - Giorgio Gallo, Giustino Longo, Stefano Pallottino:
Directed Hypergraphs and Applications. 177-201 - Dorit S. Hochbaum:
Why Should Biconnected Components be Identified First. 203-210 - Gerard A. P. Kindervater, Jan Karel Lenstra, Martin W. P. Savelsbergh:
Sequential and Parallel Local Search for the Time-Constrained Traveling Salesman Problem. 211-225 - Mario Lucertini, Yehoshua Perl, Bruno Simeone:
Most Uniform Path Partitioning and its Use in Image Processing. 227-256 - Philippe Michelon, Nelson Maculan:
Lagrangean Methods for 0-1 Quadratic Problems. 257-269 - Christos H. Papadimitriou, Paolo Serafini, Mihalis Yannakakis:
Computing the Throughput of a Network with Dedicated Lines. 271-278 - A. H. G. Rinnooy Kan, Leen Stougie, Carlo Vercellis:
A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem. 279-290 - Leen Stougie:
A Fast Randomized Algorithm for Partitioning a Graph into Paths of Fixed Length. 291-303
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-05 20:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
