DIMACS Technical Reports Published in 2005

Obtaining Reports

Problems with Technical Reports?

• 2005-01 (abstract): Exploration Approaches to Adaptive Filtering by Dmitriy Fradkin and Michael Littman
• 2005-02 (abstract): Integer Programming Methods for Several Optimization Problems in Graph Theory by Jamiru Luttamaguzi, Michael Pelsmajer, Zhizhang Shen and Boting Yang
• 2005-03 (abstract): Modelling continuous positive and negative reasons in decision aiding by Meltem Ozturk and Alexis Tsoukias
• 2005-04 (abstract): Extending Dijkstra's Algorithm to Shortest Paths with Blocks by Jihui Zhao, Vladimir Gurvich and Leonid Khachiyan
• 2005-05 (abstract): Linear Complementarity Algorithms for Mean Payoff Games by Henrik Bjorklund, Ola Svensson and Sergei Vorobyov
• 2005-06 (abstract): Even-hole-free and Balanced Circulants by Diogo Andrade, Endre Boros and Vladimir Gurvich
• 2005-07 (abstract): On the misere version of game Euclid and miserable games by Vladimir Gurvich
• 2005-08 (abstract): Cyclically Orientable Graphs by Vladimir Gurvich
• 2005-09 (abstract): Approximation of the Quadratic Set Covering Problem by Bruno Escoffier and Peter L. Hammer
• 2005-10 (abstract): Mental Illness and Length of Hospital Stay for Medicaid Inpatients Infected with HIV by Donald R. Hoover, Usha Sambamoorthi, James T. Walkup and Stephen Crystal
• 2005-11 (abstract): Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling by Graham Cormode, S. Muthukrishnan and Irina Rozenbaum
• 2005-12 (abstract): Generating All Minimal Integral Solutions to AND-OR Systems of Monotone Inequalities: Conjunctions are Easier than Disjunctions by Endre Boros, Khaled Elbassioni, Vladimir Gurvich and Leonid Khachiyan
• 2005-13 (abstract): Controlled Linear Programming for Infinite Games by Henrik Bjorklund, Ola Svensson and Sergei Vorobyov
• 2005-14 (abstract): Inapproximability Results for the Lateral Gene Transfer Problem by Bhaskar Dasgupta, Sergio Ferrarini, Uthra Gopalakrishnan and Nisha Raj Paryani
• 2005-15 (abstract): Santa Claus' Towers of Hanoi by Xiaomin Chen, Bin Tian and Lei Wang
• 2005-16 (abstract): Extending Power and Sample Size Approaches for McNemar's Procedure to General Sign Tests by Donald R. Hoover
• 2005-17 (abstract): Maximal Independent Sets In Graphs With At Most $r$ Cycles by Goh Chee Ying, Koh Khee Meng, Bruce E. Sagan and Vincent R. Vatter
• 2005-18 (abstract): Maximal and Maximum Independent Sets In Graphs With At Most $r$ Cycles by Bruce E. Sagan and Vincent R. Vatter
• 2005-19 (abstract): Workload-Optimal Histograms on Streams by S. Muthukrishnan, Martin J. Strauss and Xuan Zheng
• 2005-20 (abstract): A Subexponential Algorithm for a Subclass of P-Matrix Generalized Linear Complementarity Problems by Ola Svensson and Sergei Vorobyov
• 2005-21 (abstract): Generating all vertices of a polyhedron is hard by Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni and Vladimir Gurvich
• 2005-22 (abstract): The Nagger-Mover Game by Z. Nedev and S. Muthukrishnan
• 2005-23 (abstract): Fractional Firefighting in the Two Dimensional Grid by K. L. Ng and P. Raff
• 2005-24 (abstract): Enumerating Cut Conjunctions in Graphs and Related Problems by Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled Elbassioni, Vladimir Gurvich and Kazuhisa Makino
• 2005-25 (abstract): Towards an Algorithmic Theory of Compressed Sensing by Graham Cormode and S. Muthukrishnan
• 2005-26 (abstract): Critical Groups in Dynamic Social Networks by Tanya Y Berger-Wolf and Jared Saia
• 2005-27 (abstract): Combinatorial Reconstruction of Sibling Relationships in Absence of Parental Data by Tanya Y. Berger-Wolf, Bhaskar DasGupta, Wanpracha Chaovalitwongse and Mary V. Ashley
• 2005-28 (abstract): A Framework for Analysis of Dynamic Social Networks by Tanya Y. Berger-Wolf and Jared Saia
• 2005-29 (abstract): Universal Subsets of Zn, Linear Integer Optimization, and Integer Factorization by Zhivko Nedev
• 2005-30 (abstract): Upper Bound on the Number of Vertices of Polyhedra with $0,1$-Constraint Matrices by Khaled Elbassioni, Zvi Lotker and Raimund Seidel
• 2005-32 (abstract): Decoding of Expander Codes at Rates Close to Capacity by Alexei Ashikhmin and Vitaly Skachek
• 2005-33 (abstract): Estimating Entropy and Entropy Norm on Data Streams by Amit Chakrabarti, Khanh Do Ba and S. Muthukrishnan
• 2005-34 (abstract): Monge Property and Bounding Multivariate Probability Distribution Functions with Given Marginals and Covariances by Xiaoling Hou and Andras Prekopa
• 2005-35 (abstract): Machine Learning Methods in the Analysis of Lung Cancer Survival Data by Dmitriy Fradkin, Dona Schneider and Ilya Muchnik
• 2005-38 (abstract): A polynomial algorithm to find an independent set of maximum weight in a fork-free graph by Vadim V. Lozin and Martin Milanic
• 2005-39 (abstract): An evaluation of the edit-distance-with-moves similarity metric for comparing genetic sequences by Shiri Azenkot, Tzu-Yi Chen and Graham Cormode
• 2005-40 (abstract): Combinatorial Algorithms for Compressed Sensing by Graham Cormode and S. Muthukrishnan
• 2005-41 (abstract): Inferring (Biological) Signal Transduction Networks via Binary Transitive Reductions by Reka Albert, Bhaskar DasGupta, Riccardo Dondi and Eduardo Sontag
• 2005-42 (abstract): Simulated Entity Resolution by Diverse Means: DIMACS Work on the KDD Challenge of 2005 by Andrei Anghelescu, Aynur Dayanik, Dmitriy Fradkin, Alex Genkin, Paul Kantor, David Lewis, David Madigan, Ilya Muchnik and Fred Roberts
• 2005-43 (abstract): Interactive Navigation of Power-Law Graphs by James Abello and Frank van Ham

Return to Tech Reports Page

DIMACS Homepage