default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 63
Volume 63, Number 1, 1995
- Hernán G. Abeledo, Uriel G. Rothblum:
Paths to Marriage Stability. 1-12 - J. Orestes Cerdeira
, Isabel Faria, Paulo Bárcia:
Establishing Determinantal Inequalities for Positive-definite Matrices. 13-24 - Mauro Dell'Amico, Silvano Martello, Daniele Vigo:
Minimizing the Sum of Weighted Completion Times with Unrestricted Weights. 25-41 - Bettina Klinz, Rüdiger Rudolf, Gerhard J. Woeginger:
on the Recognition of Permuted Bottleneck Monge Matrices. 43-74 - Markus W. Schäffter:
Drawing Graphs on Rectangular Grids. 75-89 - Abdelmadjid Bouabdallah, Charles Delorme, Selma Djelloul:
Edge Deletion Preserving the Diameter of the Hypercube. 91-95
Volume 63, Number 2, 1995
- James R. Driscoll, Dennis M. Healy Jr., Garth Isaak:
Scheduling Dyadic Intervals. 101-116 - Fahir Ö. Ergincan, David A. Gregory:
Directed Moore Hypergraphs. 117-127 - Alexandros V. Gerbessiotis:
Close-to-optimal and Near-optimal Broadcasting in Random Graphs. 129-150 - Hong-Jian Lai, Hongyuan Lai:
Every Matroid Is a Submatroid of a Uniformly Dense Matroid. 151-160 - Mandayam A. Srinivas:
Matroid optimization with Generalized Constraints. 161-174 - Li-Hui Tsai:
The Modified Differencing Method for the Set Partitioning Problem with Cardinality Constraints. 175-180 - María Rosa Brito:
A Simple as Correct Algorithm for Deciding If a Graph Has a Perfect Matching. 181-185 - Carsten Flotow:
on Powers of M-trapezoid Graphs. 187-192 - Marjo Lipponen, Gheorghe Paun:
Strongly Prime PCP Words. 193-197 - Bruno Courcelle:
The Monadic Second-order Logic of Graphs VI: On Several Representations of Graphs by Relational Structures. 199-200
Volume 63, Number 3, 1995
- Igor Averbakh, Oded Berman, Abraham P. Punnen:
Constrained Matroidal Bottleneck Problems. 201-214 - Gerard J. Chang, C. Pandu Rangan, Satyan R. Coorg:
Weighted Independent Perfect Domination on Cocomparability Graphs. 215-222 - Evangelos Kranakis, Danny Krizanc:
Labeled Versus Unlabeled Distributed Cayley Networks. 223-236 - Eugeniusz Nowicki, Stanislaw Zdrzalka:
A Bicriterion Approach to Preemptive Scheduling of Parallel Machines with Controllable Job Processing Times. 237-256 - Wolfgang Stadje:
Selecting Jobs for Scheduling on a Machine Subject to Failure. 257-265 - Jerzy Topp, Preben D. Vestergaard:
Well Irredundant Graphs. 267-276 - Lucian Ilie:
on Subwords of Infinite Words. 277-279
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-10-31 20:05 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:
