DIMACS Technical Reports Published in 2003
Obtaining Reports
Most technical reports are available on-line and we encourage
down-loading 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.
- 2003-01
(abstract):
Comparison of convex hulls and box hulls
by E. Boros, V. Gurvich, Y. Liu.
- 2003-02
(abstract):
On the Notion of Category Size in Multiple Criteria Sorting Models
by Vincent Mousseau, Lu\'is C. Dias and Jos\'e R. Figueira.
- 2003-03
(abstract):
Chordal Bipartite Graphs of Bounded Tree- and Clique-width
by V. Lozin and D. Rautenbach.
- 2003-04
(abstract):
Flexible Regulation of Distributed Coalitions
by Xuhui Ao and Naftaly Minsky.
- 2003-05
(abstract):
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search
by Piotr Berman, Paul Bertone, Bhaskar DasGupta, Mark Gerstein, Ming-Yang Kao and Michael Snyder.
- 2003-06
(abstract):
A Data Mining Problem in Stochastic Programming
by Andras Prekopa and Xiaoling Hou.
- 2003-07
(abstract):
On a Conjecture of Chvatal
by Xiaomin Chen.
- 2003-08
(abstract):
On Bayesian Learning of Sparse Classifiers
by Wen-Hua Ju, David Madigan, and Steven L. Scott.
- 2003-09
(abstract):
Uplink Scheduling in CDMA Packet-Data Systems
by Krishnan Kumaran, Lijun Qian.
- 2003-10
(abstract):
Perfect Graphs, Kernels, and Cores of Cooperative Games
by E. Boros and V. Gurvich.
- 2003-11
(abstract):
Radial Histograms for Spatial Streams
by Graham Cormode and S. Muthukrishnan.
- 2003-12
(abstract):
Basic perfect graphs and their extensions
by I. E. Zverovich and V. E. Zverovich.
- 2003-13
(abstract):
From the Ground Up: The DIMACS Software Security Workshop
by Gary McGraw.
- 2003-14
(abstract):
Tight Approximability Results for Test Set Problems in Bioinformatics
by Piotr Berman and Bhaskar DasGupta and Ming-Yang Kao.
- 2003-15
(abstract):
Towards an Efficient Cluster-based E-Commerce Server
by Victoria Ungureanu, Michael Katehakis, Benjamin Melamed.
- 2003-16
(abstract):
Class-Dependent Assignment in Cluster-based Servers
by Victoria Ungureanu, Phillip G. Bradford, Michael Katehakis, Benjamin Melamed.
- 2003-17
(abstract):
On the Complexity of Some Enumeration Problems for Matroids
by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan.
- 2003-18
(abstract):
IPSOFACTO: A Visual Correlation Tool for Aggregate Network Traffic Data
by Flip Korn, S. Muthukrishnan and Yunyue Zhu.
- 2003-19
(abstract):
Checks and Balances: Monitoring Data Quality Problems in Network Traffic Databases
by Flip Korn, S. Muthukrishnan and Yunyue Zhu.
- 2003-20
(abstract):
Improved Data Stream Summaries: The Count-Min Sketch and its Applications
by Graham Cormode and S. Muthukrishnan.
- 2003-21
(abstract):
From Decision Theory to Decision Aiding Methodology
by Alexis Tsoukiās.
- 2003-22
(abstract):
Independent domination on $2P_3$-free perfect graphs
by I. E. Zverovich.
- 2003-23
(abstract):
Feature Selection and Training Set Sampling for Ensemble Learning on
Heterogeneous Data
by Iryna Skrypnyk and Tin Kam Ho
- 2003-24
(abstract):
A new kind of graph colorings
by Igor Zverovich
- 2003-25
(abstract):
On a problem of Lesniak, Polimeni, and Vanderjagt
by Igor Zverovich
- 2003-26
(abstract):
Algorithmic aspects of Reducing Pseudopath Method
by Igor Zverovich
- 2003-27
(abstract):
Minimum Edge Ranking Spanning Trees of Split Graphs
by Kazuhisa Makino, Yushi Uno and Toshihide Ibaraki
- 2003-28
(abstract):
Simplicial Depth: An Improved Definition, Analysis, and Efficiency for
the Finite Sample Case
by Michael A. Burr, Eynat Raflin and Diane L. Souvaine
- 2003-29
Deterministic Jumplists
by Amr Elmasry
- 2003-30
Modeling Social Response to Bioterrorism Involving Infectious Agents
by Ellis McKenzie and Fred Roberts
- 2003-31
(abstract):
What's New: Finding Significant Differences in Network Data Streams
by Graham Cormode and S. Mutukrishnan
- 2003-32
(abstract):
The Sylvester-Chvatal Theorem
by Xiaomin Chen
- 2003-33
(abstract):
L(2,1)-Labelings of Products of Two Cycles
by Christopher Schwarz and Denise Sakai Troxell
- 2003-34
(abstract):
Preference Modelling
by Meltem Ozturk, Alexis Tsoukias and Philippe Vincke
- 2003-35
(abstract):
On Enumerating Minimal Dicuts and Strongly Connected Subgraphs
by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan
- 2003-36
(abstract):
A solution to a problem of Le
by I. E. Zverovich
- 2003-37
(abstract):
Perfect interval filament graphs
by Fanica Gavril
- 2003-38
(abstract):
On the concept of decision aiding process
by Alexis Tsoukias
- 2003-39
(abstract):
The Bin-Covering Technique for Thresholding Random Geometric Graph Properties
by S. Muthukrishnan, Gopal Pandurangan
- 2003-40
(abstract):
Global stability in a chemostat with multiple nutrients
by Patrick De Leenheer, Simon A. Levin, Eduardo D. Sontag and Christopher A. Klausmeier
- 2003-41
(abstract):
On Traversal and Exploration Sequences
by Michal Koucky
- 2003-42
(abstract):
The Elimination Procedure for the Competition Number is Not Optimal
by Stephen Hartke
- 2003-43
(abstract):
Mining Deviants in Time Series Data Streams
by S. Muthukrishnan, Rahul Shah and Jeffrey Scott Vitter
- 2003-44
(abstract):
Crowding effects promote coexistence in the chemostat
by Patrick De Leenheer, David Angeli and Eduardo Sontag
- 2003-45
(abstract):
The Voter Model with Confidence Levels
by Stephen Hartke
- 2003-46
(abstract):
Adaptive Sorting with AVL Trees
by Amr Elmasry
Return to Tech Reports Page
DIMACS Homepage
Report problems concerning Technical Reports to: tech@dimacs.rutgers.edu
Contacting the Center
Document last modified on January 22, 2002.