Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 98
Volume 98, Number 1-2, October 1999
- Jacek Blazewicz
, Alain Hertz, Daniel Kobler, Dominique de Werra:
On some Properties of DNA Graphs. 1-19 - Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann, Andreas S. Schulz:
On the Chvátal Rank of Polytopes in the 0/1 Cube. 21-27 - Chandra Chekuri, Rajeev Motwani:
Precedence Constrained Scheduling to Minimize Sum of Weighted Completion Times on a Single Machine. 29-38 - Jitender S. Deogun, Ton Kloks, Dieter Kratsch, Haiko Müller:
On the Vertex Ranking Problem for Trapezoid, Circular-arc and Other Graphs. 39-63 - Ian Gambini:
A Method for Cutting Squares into Distinct Squares. 65-80 - Hovhannes A. Harutyunyan, Arthur L. Liestman:
More Broadcast Graphs. 81-102 - Khee Meng Koh, Eng Guan Tay:
On Optimal Orientations of Cartesian Products with a Bipartite Graph. 103-120 - Colin McDiarmid:
Pattern Minimisation in Cutting Stock Problems. 121-130 - Xiangtong Qi, Fengsheng Tu:
Earliness and Tardiness Scheduling Problems on a Batch Processor. 131-145 - Juha Honkala:
On the Equivalence Problem of Context-free and DT0L Languages. 147-149 - Gwénaël Richomme, Patrice Séébold:
Characterization of Test-sets for Overlap-free Morphisms. 151-157 - Ioan Tomescu:
Some Extremal Properties of the Degree Distance of a Graph. 159-163 - Fuji Zhang, Chang An:
Acyclic Molecules with Greatest HOMO-LUMO Separation. 165-171
Volume 98, Number 3, January 2000
- Tiru S. Arthanari, Usha Mohan:
An Alternate Formulation of the Symmetric Traveling Salesman Problem and Its Properties. 173-190 - Feodor F. Dragan, Falk Nicolai:
LexBFS-orderings of Distance-hereditary Graphs with Application to the Diametral Pair Problem. 191-207 - Svetlana A. Kravchenko:
Minimizing the Number of Late Jobs for the Two-machine Unit-time Job-shop Scheduling Problem. 209-217 - Mingchu Li, Derek G. Corneil, Eric Mendelsohn:
Pancyclicity and NP-completeness in Planar Graphs. 219-225 - Meei Pyng Ng, Mike A. Steel, Nicholas C. Wormald:
The Difficulty of Constructing a Leaf-labelled Tree Including or Avoiding Given Subtrees. 227-235 - Jaroslav Opatrny, Dominique Sotteau:
Embeddings of Complete Binary Trees into Grids and Extended Grids with Total Vertex-congestion 1. 237-254 - Paul Peart, Wen-Jin Woan:
A Divisibility Property for a Subgroup of Riordan Matrices. 255-263 - Jan Stallaert:
Valid Inequalities and Separation for Capacitated Fixed Charge Flow Problems. 265-274
a service of 
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 2024-07-21 21:02 CEST 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:
