DIMACS Technical Reports Published in 2004

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.

2004-01 (abstract): On the Complexities of Some Combinatorial Problems in Reverse Engineering of Protein and Gene Networks by Piotr Berman, Bhaskar DasGupta and Eduardo Sontag
2004-02 (abstract): A Study of K-Means Clustering for Improving Classification Accuracy of Multi-Class SVM by Dmitriy Fradkin and Ilya Muchnik
2004-03 (abstract): Recognizing $k$-complete bipartite bihypergraphs by I. E. Zverovich and I. I. Zverovich
2004-04 (abstract): Generalizations of interval-filament graphs by Fanica Gavril
2004-05 (abstract): A Combinatorial Strongly Subexponential Strategy Improvement Algorithm for Mean Payoff Games by Henrik Bjorklund, Sven Sandberg and Sergei Vorobyov
2004-06 (abstract): War and Peace in Veto Voting by Vladimir Gurvich
2004-07 (abstract): Finding Central Sets of Tree Structures in Synchronous Distributed Systems by Jonathan W. Berry, Daniel Hrozencik, Shrisha Rao and Zhizhang Shen
2004-08 (abstract): Simultaneous Feature Selection And Margin Maximization Using Saddle Point Approach by Yuri Goncharov, Ilya Muchnik and Leonid Shvartser
2004-09 (abstract): Randomized Subexponential Algorithms for Infinite Games by Henrik Bjorklund, Sven Sandberg and Sergei Vorobyov
2004-10 (abstract): Randomized Approximation Algorithms for Set Multicover Problems with Applications to Reverse Engineering of Protein and Gene Networks by Piotr Berman, Bhaskar DasGupta and Eduardo Sontag
2004-11 (abstract): The Hardness of the Lemmings Game by Graham Cormode (Also available in PDF format.)
2004-12 (abstract): How to Increase the Acceptance Ratios of Top Conferences by Graham Cormode, Artur Czumaj and S. Muthukrishnan
2004-13 (abstract): Pair Approximation of the stochastic susceptible-infected-recovered-susceptible epidemic model on the hypercubic lattice by Jaewook Joo and Joel L. Lebowitz
2004-14 (abstract): Behavior of $SIS$ epidemics on heterogeneous networks with saturation by Jaewook Joo and Joel Lebowitz
2004-15 (abstract): A tutorial on monotone systems- with an application to chemical reaction networks by P. De Leenheer, D. Angeli and E.D. Sontag (Also available in PDF format.)
2004-16 (abstract): Monotone chemical reaction networks by P. De Leenheer, D. Angeli and E.D. Sontag (Also available in PDF format.)
2004-17 (abstract): Further Analysis of the Number of Spanning Trees in Circulant Graphs by Talip Atajan, Xuerong Yong and Hiroshi Inaba
2004-18 (abstract): The number of spanning trees in circulant graphs with non--fixed jumps by Yuanping Zhang, Zhiyong Zhang and Xuerong Yong
2004-19 (abstract): The Relative Clique-Width of a Graph by Vadim V. Lozin and Dieter Rautenbach
2004-20 (abstract): Subject Allocation and Study Curtailment for Fixed Event Comparative Poisson Trials by Donald R. Hoover
2004-21 (abstract): A Framework for Reducing Comparisons in Heap Operations by Amr Elmasry
2004-22 (abstract): A Degree Constraint for Uniquely Hamiltonian Graphs by Sarmad Abbasi and Asif Jamshed
2004-23 (abstract): Protecting (even) Naīve Web Users, or: Preventing Spoofing and Establishing Credentials of Web Sites by Amir Herzberg and Ahmad Gbara
2004-24 (abstract): Network Augmentation for Confluent Flow in Data Networks by Randeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Joseph (Seffi) Naor and Baruch Schieber
2004-25 (abstract): Workload-Optimal Wavelet Synposis by S. Muthukrishnan
2004-26 (abstract): Maximal induced matchings of minimum/maximum size by Yury L. Orlovich and Igor E. Zverovich
2004-27 (abstract): Medical Expenditures During The Last Year On Life: Findings From The 1992-96 Medicare Current Beneficiary Survey by Donald R. Hoover, Stephen Crystal, Rizie Kumar, Usha Sambamoorthi and Joel C. Cantor
2004-28 (abstract): Location Streams: Models and Algorithms by M. Hoffmann, S. Muthukrishnan and Rajeev Raman
2004-29 (abstract): A Note on a Monotone Small Gain Theorem, with Applications to Delay Systems by German A. Enciso and Eduardo D. Sontag
2004-30 (abstract): k-Interval-filament graphs by Fanica Gavril
2004-31 (abstract): A Global Parallel Algorithm for Finding All Minimal Transversals of Hypergraphs of Bounded Edge-size by E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan
2004-32 (abstract): Controlling Spam by Secure Internet Content Selection by Amir Herzberg
2004-33 (abstract): Automatic screening for groups of orthologous genes in comparative genomics using multiple-component clustering by Akshay Vashist, Casimir A. Kulikowski, Ilya Muchnik
2004-34 (abstract): On Hamiltonicity Of Claw- And Net-Free Graphs by Alexander Kelmans
2004-35 (abstract): On Claw- And Net-Free Graphs by Alexander Kelmans
2004-36 (abstract): A note on the monotonicity of matrix Riccati equations by Patrick De Leenheer and Eduardo Sontag (Also available in PDF format.)
2004-37 (abstract): Report on DIMACS Working Group Meeting: Data Mining and Epidemiology, March 18-19, 2004 by James Abello and Graham Cormode
2004-38 (abstract): Verification of Minimum-Redundancy Prefix Codes by Ahmed Belal and Amr Elmasry
2004-39 (abstract): Distribution-Sensitive Priority Queues by Amr Elmasry
2004-40 (abstract): Category-based feature extraction in supervised categorization of Aviation Safety Report System documents by Yangzhe Xiao, Haym Hirsh, Casimir Kulikowski, Michael Littman and Ilya Muchnik
2004-41 (abstract): The Controlled Linear Programming Problem by Henrik Bjorklund, Olle Nilsson, Ola Svensson and Sergei Vorobyov
2004-42 (abstract): Nonuniform Sparse Approximation with Haar Wavelet Basis by S. Muthukrishnan
2004-43 (abstract): On Critical Trees Labeled with a Condition at Distance Two by Denise Sakai Troxell
2004-44 (abstract): Computing Many Maximal Independent Sets for Hypergraphs in Parallel by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan
2004-45 (abstract): A Computational Study of the Broadcast Domination Problem by Steven B. Horton, Claudio N. Meneses, Arup Mukherjee and M. Erol Ulucakli
2004-46 (abstract): Tight Bounds on Deterministic Seed Design by Martin Farach-Colton, Gad M. Landau, S. Cenk Sahinalp and Dekel Tsur
2004-47 (abstract): Principles of nonstationary regression estimation: A new approach to dynamic multi-factor models in finance by Michael Markov, Vadim Mottl and Ilya Muchnik
2004-48 (abstract): Three Optimal Algorithms for Balls of Three Colors by Zdenek Dvorak, Vit Jelinek, Daniel Kral, Jan Kyncl and Michael Saks
2004-49 (abstract): Improved Time Bounds for Near-Optimal Sparse Fourier Representations by Anna C. Gilbert, S. Muthukrishnan, and Martin J. Strauss
2004-50 (abstract): On the Realizability of Point Processes with Specified One and Two Particle Densities by Joel L. Lebowitz, O. Costin, T. Kuna and E.R. Speer
2004-51 (abstract): A $O(n^2)$ lower bound for swaping the order of $n$ input bits in planar boolean circuit by Bin Tian
2004-52 (abstract): Approximate Histogram and Wavelet Summaries of Streaming Data by S. Muthukrishan and Martin J. Strauss
2004-53 (abstract): Optimal Mapping of Deep Gray Scale Images to a Coarser Scale of Gray by Solomon Borodkin, Aleksey Borodkin and Ilya Muchnik
2004-54 (abstract): Initiation of colorectal cancer: where do the two hits hit? by Natalia L. Komarova and Liming Wang
2004-55 (abstract): Optimal Protein Encoding by Logan Everett and Endre Boros
2004-56 (abstract): Controlled Linear Programming: Duality and Boundedness by Henrik Bjorklund, Olle Nilsson, Ola Svensson and Sergei Vorobyov
2004-57 (abstract): Does Wee1 inhibits the entry to M phase? by Liming Wang

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.