DIMACS Technical Reports Published in 2007

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.

2007-01 (abstract): Simple and fast reoptimizations for the Steiner tree problem by Bruno Escoffier, Martin Milanic and Vangelis Th. Paschos
2007-02 (abstract): On short paths interdiction problems: Total and node-wise limited interdiction by Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich, Gabor Rudolf and Jihui Zhao
2007-03 (abstract): Generating vertices of polyhedra and related monotone generation problems by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino
2007-04 (abstract): Decomposing complete edge-chromatic graphs and hypergraphs by Vladimir Gurvich
2007-05 (abstract): Game Seki by Diogo V. Andrade, Konrad Borys, Vladimir Gurvich and Gabor Rudolf
2007-06 (abstract): On complexity of algorithms for modeling disease transmission by Endre Boros and Vladimir Gurvich
2007-07 (abstract): The Cyclic Sieving Phenomenon for Faces of Generalized Cluster Complexes by Sen-Peng Eu and Tung-Shan Fu
2007-08 (abstract): Saddle Point Feature Selection In SVM Regression by Yuri Goncharov, Ilya Muchnik and Leonid Shvartser
2007-09 (abstract): Process Grammar by Michael Leyton
2007-10 (abstract): Time-Decaying Aggregates in Out-of-order Streams by Graham Cormode, Flip Korn and Srikanta Tirthapura
2007-11 (abstract): Using Cartoons to Teach Internet Security by Sukamol Srikwan and Markus Jakobsson
2007-12 (abstract): Approximating the Online Set Multicover Problems Via Randomized Winnowing by Piotr Berman and Bhaskar DasGupta
2007-13 (abstract): ACM Classification Can Be Used for Representing Research Organizations by Boris Mirkin, Susana Nascimento and Luis Moniz Pereira
2007-14 (abstract): On Approximating Four Covering/Packing Problems With Applications to Bioinformatics by Mary Ashley, Tanya Berger-Wolf, Piotr Berman, Wanpracha Chaovalitwongse, Bhaskar DasGupta and Ming-Yang Kao
2007-15 (abstract): Berge Multiplication for Monotone Boolean Dualization by Endre Boros, Khaled Elbassioni and Kazuhisa Makino
2007-16 (abstract): Saddle Point Feature Selection in SVM Classification by Yuri Goncharov, Ilya Muchnik and Leonid Shvartser
2007-17 (abstract): Cryptographic vs. Trust-based Methods for MANET Routing Security by Jared Cordasco and Susanne Wetzel
2007-18 (abstract): Computer Science and Decision Theory by Fred S. Roberts
2007-19 (abstract): Betweenness Centrality Measure in Dynamic Networks by Habiba, Chayant Tantipathananandh and Tanya Y. Berger-Wolf
2007-20 (abstract): Maximizing the Extent of Spread in a Dynamic Network by Habiba and Tanya Y. Berger-Wolf
2007-21 (abstract): Algorithms and Heuristics for Constrained Generalized Tree Alignment Problem by Dr. Srikrishnan Divakaran

Return to Tech Reports Page

DIMACS Homepage

Report problems concerning Technical Reports to: tech@dimacs.rutgers.edu

Contacting the Center
Document last modified on Feb 12, 2008.