default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 82
Volume 82, Number 1-3, March 1998
- Noga Alon, Ayal Zaks:
T-choosability in Graphs. 1-13 - Eric Angel, Vassilis Zissimopoulos:
On the Quality of Local Search for the Quadratic Assignment Problem. 15-25 - Shoshana Anily, Celia A. Glass, Refael Hassin:
The Scheduling of Maintenance Service. 27-42 - Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan:
The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. 43-77 - Bintong Chena, Monique Guignard:
Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems. 79-91 - Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos:
An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. 93-101 - John Harrison, Thomas Brennan, Steven Gapinski:
The Gergonne p-pile Problem and the Dynamics of the Function x | => (x + r)/p. 103-113 - Michael A. Henning
, Hiren Maharaj:
Some General Aspects of the Framing Number of a Digraph. 115-133 - Zhiquan Hu, Zhenhong Liu:
A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. 135-154 - Mark Jerrum, Gregory B. Sorkin:
The Metropolis Algorithm for Graph Bisection. 155-175 - Simon Litsyn, Patrick Solé, René Struik:
On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. 177-191 - Wayne Martin:
Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition. 193-207 - Carmen Ortiz, Nelson Maculan, Jayme Luiz Szwarcfiter:
Characterizing and Edge-colouring Split-indifference Graphs. 209-217 - Huei-Jan Shyr, Shyr-Shen Yu:
The Single Loop Representations of Regular Languages. 219-229 - Nan Zhu, Kevin A. Broughan:
On Aggregating Two Linear Diophantine Equations. 231-246 - Jørgen Bang-Jensen, Gregory Z. Gutin, Anders Yeo:
Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. 247-250 - Zoltán Füredi:
On the Double Competition Number. 251-255 - Alexandros V. Gerbessiotis:
A Graph-theoretic Result for a Model of Neural Computation. 257-262 - Martin Klazar:
On Trees and Noncrossing Partitions. 263-269 - Akiyoshi Shioura:
A Constructive Proof for the Induction of M-convex Functions through Networks. 271-278
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-12-04 22:29 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:
