DIMACS Technical Reports Published in 2006

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.

2006-01 (abstract): On the Complexity of Monotone Boolean Duality Testing by Khaled M. Elbassioni
2006-02 (abstract): The Paradoxical Nature of Locating Sensors in Paths and Cycles: The Case of 2-Identifying Codes by David L. Roberts and Fred S. Roberts
2006-03 (abstract): An exact algorithm for MAX-CUT in sparse graphs by F. Della Croce, M. J. Kaminski and V. Th. Paschos
2006-04 (abstract): Polynomial Time Algorithm for Column-Row Based Relative-Error Low-Rank Matrix Approximation by Petros Drineas, Michael W. Mahoney and S. Muthukrishnan
2006-05 (abstract): Experimental Analysis of Sequential Decision Making Algorithms for Port of Entry Inspection Procedures by Saket Anand, David Madigan, Richard Mammone, Saumitr Pathak and Fred Roberts
2006-06 (abstract): Generalized Traffic Equations by Michael Tortorella
2006-07 (abstract): Large Deviations for a Point Process of Bounded Variability by S. Goldstein, J. L. Lebowitz and E. R. Speer
2006-08 (abstract): Hyper-Rectangular and k-Nearest-Neighbor Models in Stochastic Discrimination by Iryna Skrypnyk and Tin Kam Ho
2006-09 (abstract): Probabilistic Distance Clustering by Adi Ben-Israel and Cem Iyigun
2006-10 (abstract): Finding max-cliques in power-law graphs with large clique coefficients by James Abello and Michael Capalbo
2006-11 (abstract): Blocking sequences of sets in infinite graphs by James Abello and Michael Capalbo
2006-12 (abstract): Generating 3-Vertex Connected Spanning Subgraphs by Endre Boros, Konrad Borys, Vladimir Gurvich and Gabor Rudolf
2006-13 (abstract): Inapproximability Bounds for Shortest-Path Network Interdiction Problems by Endre Boros, Konrad Borys, Vladimir Gurvich and Gabor Rudolf
2006-14 (abstract): An Efficient Optimal-Equilibrium Algorithm for Two-player Game Trees by Michael L. Littman, Nishkam Ravi, Arjun Talwar and Martin Zinkevich
2006-15 (abstract): Polynomial-time algorithm for vertex k-colorability of P5-free graphs by Marcin Kaminski and Vadim Lozin
2006-16 (abstract): On graphs whose maximal cliques and stable sets intersect by Diogo V. Andrade, Endre Boros and Vladimir Gurvich
2006-17 (abstract): On the complexity of the exact weighted independent set problem for various graph classes by Martin Milanic and Jerome Monnot
2006-18 (abstract): Proper Partitions of a Polygon and $k$-Catalan Numbers by Bruce E. Sagan
2006-19 (abstract): Pattern Avoidance in Set Partitions by Bruce E. Sagan
2006-20 (abstract): Contour approximation of data and the harmonic mean by Marina Arav
2006-21 (abstract): What power of two divides a weighted Catalan number by Alexander Postnikov and Bruce E. Sagan
2006-22 (abstract): Domination in Graphs of Low Degree by Vadim Lozin and Martin Milanic
2006-23 (abstract): Note on regular spanning subgraphs of bipartite graphs of high minimum degree by Bela Csaba
2006-24 (abstract): Approximation algorithms for a Resource Allocation Problem by Srikrishnan Divakaran
2006-27 (abstract): The Clique Width of Bipartite Graphs in Monogenic Classes by Vadim Lozin and Jordan Volz

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.