This page, and any PDF documents linked on this page, are no longer maintained and may not meet accessibility standards. To request an accessible version of any content, please contact us.
DIMACS Technical Reports Published in 1995
Obtaining Reports
Most technical reports are available on-line and we encourage
downloading from WWW browsers or FTP.
Reports that are not available
may be ordered by email to
tech@dimacs.rutgers.edu .
Be sure to include the numbers of the reports needed and your full
Postal Address.
Problems with Technical Reports?
We try to check on the accessibility of technical reports regularly, but
mistakes do happen. If you have trouble obtaining reports, please send email to
tech@dimacs.rutgers.edu identifying the
report you had trouble with. We will try to assist you in obtaining the report.
95-01 (abstract)
Analysis of approximate algorithms for constrained and
unconstrained edge-coloring of bipartite graphs 95-02 (abstract)
An Exact Dualigy Theory for Semidefinite Programming and it's
Complexity Implications 95-03 (abstract)
Parallel Best-First
Branch-and-Bound in Discrete Optimization
Ricardo Correa and Afonso Ferreira
95-04 (abstract)
DNA Sequence Classification Using Compression-Based Induction 95-05 (abstract)
Finding Cuts in the TSP (A preliminary report) 95-06 (abstract)
Relation between Protein Structure,
Sequence Homology and Composition of Amino Acids 95-07 (abstract)
Directed Rectangle-Visibility Graphs have Unbounded Dimension 95-08 (abstract)
Optimization under Ordinal Scales: When is a Greedy Solution Optimal? 95-09 (abstract)
Computationally Manageable Combinatorial Auctions 95-10 (abstract)
A Winning Strategy for the Ramsey Graph Game 95-11 (abstract)
Airdisks and AirRAID: Modeling and scheduling periodic wireless
data broadcast 95-12 (abstract)
Equivalence between sorting and priority queues 95-13 (abstract)
Approximate Minimum-cost Multicommodity Flows in
$\tilde 0(\eps^{-2}KNM)$ Time 95-14 (abstract)
Resolution Search 95-15 (abstract)
LINK: A Combinatorics and Graph Theory Workbench for Applications and Research 95-16 (abstract)
Bipartite Steinhaus Graphs 95-17 (abstract)
Sample Complexity for Learning Recurrent Perceptron Mappings 95-18 (abstract)
Sorting with Fixed-Length Reversals 95-19 (abstract)
Positional Sequencing by Hybridization 95-20 (abstract)
Single Machine Scheduling with Earliness and Tardiness Penalties:
When is an Optimal Solution Not Optimal? 95-21 (abstract)
A Game-Theoretic Classification of Interactive Complexity Classes 95-22 (abstract)
The Use of Coding Theory in Computational Complexity 95-23 (abstract)
Balanced Graphs and Network Flows 95-24 (abstract)
Clique-like Dominating Sets 95-25 (abstract)
Coloring with Defects 95-26 (abstract)
Defective Coloring of Toroidal Graphs and Graphs of Bounded Genus 95-27 (abstract)
A Formal Framework for Evaluating Heuristic Programs 95-28 (abstract)
A Biologically Meaningful Model for Comparing Molecular Phylogenies 95-29 (abstract)
Some New Graph Labeling Problems: A Preliminary Report 95-30 (abstract)
Algorithms for matrix groups and the Tits alternative 95-31 (abstract)
Improved construction of negation-limited circuits 95-32 (abstract)
Multiplicative equations over commuting matrices 95-33 (abstract)
Algorithms for Polycyclic-by-finite Matrix Groups: Preliminary Report 95-34 (abstract)
Path Optimization for Graph Partitioning Problems 95-35 (abstract)
Constructive Training Methods for Feedforward Neural Networks
with Binary Weights 95-36 (abstract)
Nonoverlapping Local Alignments, Weighted Independent Sets of
Axis Parallel Rectangles 95-37 (abstract)
Improved Approximation Guarantees for Packing and Covering Integer Programs
by Aravind Srinivasan
95-38 (abstract)
Covering Polygonal Regions with Affine Images
(Paper only.)
Kiran B. Chilakamarri, Nathaniel Dean, Henry R. Gee
95-39 (abstract)
On the Power of Democratic Networks
(Paper only.)
Eddy Mayoraz
95-40 (abstract)
Localizing a Robot with Minimum Travel 95-41 (abstract)
A semidefinite bound for mixing rates of Markov chains 95-42 (abstract)
Geometric Probing and Testing - A Survey 95-43 (abstract)
Steiner Minimal Trees in Simple Polygons 95-44 (abstract)
Monotone Linkage Clustering and Quasi-Convex Set Functions 95-45 (abstract)
On Point Covers of Multiple Intervals and Axis-Parallel Rectangles 95-46 (abstract)
On the Approximability of Numerical Taxonomy... 95-47 (abstract)
Higher Dimensional Representations of Graphs Cover page
Andreas Buja, Nathaniel Dean, Michael L. Littman, Deborah Swayne
95-48 (abstract)
Proceedings of Phylogeny Workshop 95-49 (abstract)
Ramsey-Type Results for Geometric Graphs 95-50 (abstract)
Zero one laws for graphs with edge probabilities decaying with distance 95-51 (abstract)
Finite Canonization 95-52 (abstract)
In the random Graph G(n,p),p=n^{-\alpha}: If \psi has probability O(n^{-\epsilon}) for every \epsilon>0, then it has probability O(e^{-n^{\epsilon}}) for some \epsilon>0 95-53 (abstract)
Very weak zero one law for random graphs with order and random binary functions 95-54 (abstract)
On a Metric Generalization of Ramsey's Theorem 95-55 (abstract)
Asymptotically Good Covers in Hypergraphs: Extended Abstract
of the Dissertation 95-56 (abstract)
Relational expressive power of local generic queries
tech@dimacs.rutgers.edu
Contacting the Center 
Return to Tech Reports Page
DIMACS Homepage