default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 41
Volume 41, Number 1, 1993
- Richard J. Nowakowski
:
Search ans Sweep Numbers of Finite Directed Acyclic Graphs. 1-11 - Randy Shull, Alan Shuchat, James B. Orlin, Marianne Lepp:
Recognizing Hidden Bicircular Networks. 13-53 - Frank W. Sinden:
Coloring Drawings of Bipartite Graphs: A Problem in Automated Assembly. 55-68
- Tadashi Arai, Shuichi Ueno, Yoji Kajitani:
Generalization of aTheorem on the Parametric Maximum Flow Problem. 69-74 - Jørgen Bang-Jensen, Pavol Hell:
Fast Algorithms for Finding Hamiltonian Paths and Cycles in In-Tournament Digraphs. 75-79
Volume 41, Number 2, 1993
- Karel Culík II, Simant Dube:
Rational and Affine Expressions for Image Description. 85-120 - Caterina De Simone, Antonio Sassano:
Stability Number of Bull- and Chair-Free Graphs. 121-129 - Jutta Eusterbrock:
Errata to "Selecting the Top Three Elements" by M. Aigner: A Result of a Computer-Assisted Proof Search. 131-137 - Frieda Granot, Jadranka Skorin-Kapov:
On Polynomial Solvability of the High Multiplicity Total Weighted Tardiness Problem. 139-146 - Ephraim Korach, Ady Tal:
General Vertex Disjoint Paths in Series-Parallel Graphs. 147-164
- Neal Brand, Stephen J. Curran, Sajal K. Das, Tom Jacob:
Probability of Diameter Two for Steinhaus Graphs. 165-171 - Gábor Galambos, J. B. G. Frenk:
A Simple Proof of Liang's Lower Bound for On-Line bin Packing and the Extension to the Parametric Case. 173-178
- Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
New Clique and Independent Set Algorithms for Circle Graphs (Discrete Applied Mathematics 36 (1992) 1-24). 179-180
Volume 41, Number 3, 1993
- E. Andrew Boyd:
Polyhedral Results for the Precedence-Constrained Knapsack Problem. 185-201 - John V. Franco:
On the Occurrence of Null Clauses in Random Instances of Satisfiability. 203-209 - Chung-Yee Lee, Surya Danusaputro Liman:
Capacitated Two-Parallel Machines Scheduling to Minimize Sum of Job Completion Times. 211-222 - Sheelagh Lloyd:
Balance, Uncorrelatedness and the Strict Avalanche Criterion. 223-233 - Kyle Siegrist, Ashok T. Amin, Peter J. Slater:
The Optimal Unicyclic Graphs for Pair-Connected Reliability. 235-243 - Mike A. Steel:
Distributions on Bicoloured Binary Trees Arising from the Principle of Parsimony. 245-261 - Huishan Zhou:
The Chromatic Difference Sequence of the Cartesian Product of Graphs: Part II. 263-267
- J. Csima, László Lovász:
Dating to Marriage. 269-270 - Arto Salomaa:
Simple Reductions Between D0L Language and Sequence Equivalence Problems. 271-274
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-11-11 21:18 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:
