DIMACS Technical Reports Published in 2001

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.

2001-01 (abstract): Alignment scores in a regularized support vector classification method for fold recognition of remote protein families by Vadim Mottl, Sergey Dvoenko, Oleg Seredin, Casimir Kulikowski, Ilya Muchnik.
2001-02 (abstract): Multiple sequence alignment using the quasi-concave function optimization based on the DIALIGN combinatorial structures by Leonid Shvartser, Casimir Kulikowski, Ilya Muchnik.
2001-03 (abstract): Constructing Set-Systems with Prescribed Intersection Sizes by Vince Grolmusz.
2001-04 (abstract): Set-Systems with Restricted Multiple Intersections and Explicit Ramsey Hypergraphs by Vince Grolmusz.
2001-05 (abstract): Distribution of Distances in Star Graphs by Italo J. Dejter.
2001-06 (abstract): Weighted well-covered graphs and complexity questions by I. E. Zverovich.
2001-07 (abstract): Finding a maximum stable set in pentagraphs by I. E. Zverovich and I. I. Zverovich.
2001-08 (abstract): On the inter-residue correlation patterns and their role in classification of protein families by Boris Galitsky and Sergey Shelepin.
2001-09 (abstract): Entropy Waves, the Zig-Zag Graph Product, and New Constant-Degree Expanders and Extractors by Omer Reingold, Salil Vadhan, and Avi Wigderson.
2001-10 (abstract): No-Hole L(2,1)-Colorings by Peter C. Fishburn and Fred S. Roberts.
2001-11 (abstract): k-wise Set-Intersections and k-wise Hamming-Distances by Vince Grolmusz and Benny Sudakov.
2001-12 (abstract): Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities by Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan and Kazuhisa Makino
2001-13 (abstract): On Hamiltonian Cycles in Strong Products of Graphs by Daniel Kral, Jana Maxova, Pavel Podbrdsky, Robert Samal.
2001-14 (abstract): An inequality for polymatroid functions and its applications by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan.
2001-15 (abstract): On-line Admission Control and Job Scheduling with Preemption by Juan Garay, Joseph (Seffi) Naor, B\"ulent Yener and Peng Zhao.
2001-16 (abstract): Application of default reasoning to semantic processing under question-answering by Olga Ourioupina and Boris Galitsky.
2001-17 (abstract): How good can IP routing be? by Dean H. Lorenz, Ariel Orda, Danny Raz, and Yuval Shavitt.
2001-18 (abstract): Short containers in Cayley graphs by Shuhong Gao and D. Frank Hsu.
2001-19 (abstract): Networked Cryptographic Devices Resilient to Capture by Philip MacKenzie and Michael K. Reiter.
2001-20 (abstract): Mobile Filters for Efficient Dissemination of Personalized Information Using Content-Based Multicast by Rahul Shah, Ravi Jain, S. Rajagopalan, Farooq Anjum.
2001-21 (abstract): Generalized Fitting Subgroups and p-Layers of Finite Groups by Richard Lyons.
2001-22 (abstract): Local Groups in Free Burnside Groupoids by Alair Pereira do Lago.
2001-23 (abstract): Generalized Pairing Heaps by Amr Elmasry.
2001-24 (abstract): Optimal Adaptive Sorting by Amr Elmasry.
2001-25 (abstract): Remarks on the maximum correlation coefficient by Amir Dembo, Abram Kagan, and Lawrence A. Shepp.
2001-26 (abstract): The String Edit Distance Matching Problem with Moves by Graham Cormode and S. Muthukrishnan.
2001-27 (abstract): Fuzzy outranking relations in ELECTRE providing manageable disaggregation procedures by Vincent Mousseau and Luis Dias.
2001-28 (abstract): On Performance Prediction of Cellular Telephone Networks by Linchun Gao and Andras Prekopa.
2001-29 (abstract): Adaptive Properties of Pairing Heaps by Amr Elmasry.
2001-30 (abstract): Scrambled pairing and square-root trees by Amr Elmasry.
2001-31 (abstract): Large Deviation of the Density Profile in the Symmetric Simple Exclusion Process by B. Derrida, J. L. Lebowitz and E. R. Speer.
2001-32 (abstract): On 3-Simplicial Vertices in Planar Graphs by Endre Boros, Robert E. Jamison, Renu Laskar and Henry Martyn Mulder.
2001-33 (abstract): Pseudo-Boolean Optimization by Endre Boros and Peter L. Hammer.
2001-34 (abstract): A Randomized Online Algorithm for the k-Server Problem on a Line by Bela Csaba and Sachin Lodha.
2001-35 (abstract): Secret Sharing and Hypergraph Decomposition by Giovanni Di Crescenzo and Clemente Galdi.
2001-36 (abstract): On a Tiling Conjecture of Komlos for 3-Chromatic Graphs by Ali Shokoufandeh and Yi Zhao.
2001-37 (abstract): Delegation of Cryptographic Servers for Capture-Resilient Devices by Philip MacKenzie and Michael K. Reiter..
2001-38 (abstract): On a Conjecture of Loebl by Yi Zhao.
2001-39 (abstract): Extended $(P_5, {\overline P_5})$-free graph by I. E. Zverovich.
2001-40 (abstract): Characterization of superbipartite graphs by I. E. Zverovich.
2001-41 (abstract): 1.375-Approximation Algorithm for Sorting by Reversals by Piotr Berman, Sridhar Hannenhalli, and Marek Karpinski..
2001-42 (abstract): Efficient Amplifiers and Bounded Degree Optimization by Piotr Berman and Marek Karpinski.
2001-43 (abstract): QuickSAND: Quick Summary and Analysis of Network Data by Anna C. Gilbert, Yannis Kotidis, S. Muthukrishnan, and Martin. J. Strauss.
2001-44 (abstract): Near-Optimal Sparse Fourier Representations via Sampling by Anna C. Gilbert, Sudipto Guha, Piotr Indyk, S. Muthukrishnan, and Martin. J. Strauss.
2001-45 (abstract): On the components of NEPS of connected bipartite graphs by Dragan Stevanovic.
2001-46 (abstract): Antipodal graphs of small diameter by Dragan Stevanovic.
2001-47 (abstract): Integral Complete Split Graphs by Pierre Hansen, Hadrien Melot, Dragan Stevanovic
2001-48 (abstract): On the separator of fullerenes by Dragan Stevanovic, Gilles Caporossi.
2001-49 (abstract): Approximation algorithms for Offline scheduling with set-ups by Srikrishnan Divakaran and Michael Saks.
2001-50 (abstract): Online scheduling with release times and set-ups by Srikrishnan Divakaran and Michael Saks.
2001-51 (abstract): Proof of a Tiling Conjecture of Komlos by Ali Shokoufandeh and Yi Zhao.
2001-52 (abstract): Digital fingerprinting codes: Problems statements, constructions, identification of traitors by A. Barg, G. R. Blakley, and G. Kabatiansky.
2001-53 (abstract): Weighted stability in hypergraphs and weighted domination in split graphs by I. E. Zverovich.

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 5, 2001.