default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 68
Volume 68, Number 1-2, 1996
- Jean-Claude Bermond, Fahir Ö. Ergincan:
Bus Interconnection Networks. 1-15 - Igor Averbakh, Oded Berman:
A Heuristic with Worst-case Analysis for Minimax Routing of Two Travelling Salesmen on a Tree. 17-32 - Francine Blanchet-Sadri:
Inclusion Relations Between Some Congruences Related to the Dot-depth Hierarchy. 33-71 - Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning:
The Algorithmic Complexity of Minus Domination in Graphs. 73-84 - Gerd Fricke, Michael A. Henning, Ortrud Oellermann, Henda C. Swart:
An Algorithm to Find Two Distance Domination Parameters in a Graph. 85-91 - Sandi Klavzar
, Janez Zerovnik:
Algebraic Approach to Fasciagraphs and Rotagraphs. 93-100 - Chung-Yee Lee, Chung-Lun Li:
On the Fixed Interval Due-date Scheduling Problem. 101-117 - Arthur L. Liestman, Thomas C. Shermer, Christopher R. Stolte:
Degree-constrained Spanners for Multidimensional Grids. 119-144 - Dragos Radu Popescu, Ioan Tomescu:
Negative Cycles in Complete Signed Graphs. 145-152 - Hanif D. Sherali, Youngho Lee:
Tighter Representations for Set Partitioning Problems. 153-167 - Dominique de Werra, Alan J. Hoffman, Nadimpalli V. R. Mahadev, Uri N. Peled:
Restrictions and Preassignments in Preemptive open Shop Scheduling. 169-188 - Wenci Yu:
Augmentations of Consistent Partial orders for the one-machine Total Tardiness Problem. 189-202 - Brian Aldershof, Olivia M. Carducci:
Stable Matchings with Couples. 203-207
Volume 68, Number 3, 1996
- Peter C. Fishburn:
Decision Theory and Discrete Mathematics. 209-221 - Iain A. Stewart:
Finding Regular Subgraphs in Both Arbitrary and Planar Graphs. 223-235 - Kazutoshi Ando, Satoru Fujishige, Toshio Nemoto:
Decomposition of a Bidirected Graph into Strongly Connected Components and Its Signed Poset Structure. 237-248 - Lowell W. Beineke, Ortrud Oellermann, Raymond E. Pippert:
on the Steiner Median of a Tree. 249-258 - Feodor F. Dragan, Vitaly I. Voloshin:
Incidence Graphs of Biacyclic Hypergraphs. 259-266 - Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs:
Maximal Irredundant Functions. 267-277 - Yannis Manoussakis, Zsolt Tuza:
The Forwarding Index of Directed Networks. 279-291 - Satyan R. Coorg, C. Pandu Rangan:
The Parity Path Problem on Some Subclasses of Perfect Graphs. 293-302
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-21 20:30 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:
