DIMACS Technical Reports Published in 2000

Obtaining Reports

Problems with Technical Reports?

• 2000-01 (abstract): On Formulating Semidefinite Programming Problems as Smooth Convex Nonlinear Optimization Problems by Robert J. Vanderbei and Hande Yurttan Benson.
• 2000-02 (abstract): On the Economics of Multicasting by Yuval Shavitt, Peter Winkler and Avishai Wool.
• 2000-03 (abstract): Tree and Forest Volumes of Graphs by Alexander Kelmans, Igor Pak and Alexander Postnikov.
• 2000-04 (abstract): Spatial Structure in Low Dimensions for Diffusion Limited Two-Particle Reactions by M. Bramson and J. L. Lebowitz.
• 2000-05 (abstract): On the Derivation of Hydrodynamics from the Boltzmann Equation by R. Esposito, J. L. Lebowitz and R. Marra.
• 2000-06 (abstract): Time-Space Tradeoffs for Nondeterministic Computation by Lance Fortnow and Dieter van Melkebeek.
• 2000-07 (abstract): Efficient Dominating Sets in Cayley Graphs by Italo J. Dejter and Oriol Serra.
• 2000-08 (abstract): Full Color Theorems for L(2,1)-Colorings by Peter C. Fishburn and Fred S. Roberts.
• 2000-09 (abstract): Competition Graphs of Semiorders and the Conditions C(p) and C*(p) by Suh-Ryung Kim and Fred S. Roberts.
• 2000-10 (abstract): Finding Small Sets of Essential Attributes in Binary Data by Endre Boros, Takashi Horiyama, Toshihide Ibaraki, Kazuhisa Makino and Mutsunori Yagiura.
• 2000-11 (abstract): A Note on Set Systems with no Union of Cardinality 0 Modulo m by Vince Grolmusz.
• 2000-12 (abstract): An Efficient Sorting Algorithm for a Sequence of Kings in a Tournament by Jie Wu and Li Sheng.
• 2000-13 (abstract): Directional Newton Methods in n Variables by Yuri Levin and Adi Ben-Israel.
• 2000-14 (abstract): Consensus Algorithms for the Generation of all Maximal Bicliques by Gabriela Alexe, Sorin Alexe, Stephan Foldes, Peter L. Hammer and Bruno Simeone.
• 2000-15 (abstract): Computing the Unmeasured: An Algebraic Approach to Internet Mapping by Yuval Shavitt, Xiaodong Sun, Avishai Wool and Bulent Yener.
• 2000-16 (abstract): The Sherrington--Kirkpatrick model with short range ferromagnetic interactions by F. Comets, G. Giacomin and J.L. Lebowitz.
• 2000-17 (abstract): Generating Weighted Transversals of a Hypergraph by Endre Boros, Vladimir Gurvich, Leonid Khachiyan and Kazuhisa Makino.
• 2000-18 (abstract): A Scalable Distributed QoS Multicast Routing Protocol by Shigang Chen and Yuval Shavitt.
• 2000-19 (abstract): Bounds for Packings of Spheres in the Grassmann Manifolds by A. Barg, D. Nogin.
• 2000-20 (abstract): A Hypergraph Approach to the Identifying Parent Property: the Case of Multiple Parents by A. Barg, G. Cohen, S. Encheva, G. Kabatiansky, G. Zemor.
• 2000-21 (abstract): An Incremental RNC Algorithm for Generating All Maximal Independent Sets in Hypergraphs of Bounded Dimension by E. Boros, K. Elbassioni, V. Gurvich and L. Khachiyan.
• 2000-22 (abstract): Asymptotically Optimal Tree--Pacings in Regular Graphs by Alexander Kelmans, Dhruv Mubayi and Benny Sudakov.
• 2000-23 (abstract): How Many Disjoint 2--edge Paths Must a Cubic Graph Have? by Alexander Kelmans and Dhruv Mubayi.
• 2000-24 (abstract): Question-Answering System for Teaching Autistic Children to Reason about Mental States by Boris Galitsky.
• 2000-25 (abstract): On the Number of Independent Sets in Bipartite Graphs with by A.A. Sapozhenko.
• 2000-26 (abstract): On the Exact Size of the Binary Space Partitioning of Sets of Isothetic Rectangl es with Applications by Piotr Berman, Bhaskar DasGupta and S. Muthukrishnan.
• 2000-27 (abstract): Opportunity Cost Algorithms for Combinatorial Auctions by Karhan Akcoglu, James Aspnes, Bhaskar DasGupta and Ming-Yang Kao.
• 2000-28 (abstract): Explicit Interpolation Sets Using Perfect Hash Families by Xiaodong Sun.
• 2000-29 (abstract): Technique of semantic headers: a manual for knowledge engineers by Boris Galitsky.
• 2000-30 (abstract): A Model for Stock Price Fluctuations Based on Information by Larry Shepp.
• 2000-31 (abstract): Binary Fluids with Long Range Segregating Interaction I: Derivation of Kinetic and Hydrodynamic Equations by S. Bastea, R. Esposito, J. L. Lebowitz and R. Marra.
• 2000-32 (abstract): Minimal Forbidden Graphs for L(2,1)-Colorings by Peter C. Fishburn and Fred S. Roberts.
• 2000-33 (abstract): Difference Graphs by E. Boros, V. Gurvich and R. Meshulam.
• 2000-34 (abstract): An Online Scheduling Problem with Job Set-ups by Srikrishna Divakaran and Michael Saks.
• 2000-35 (abstract): Close to close packing by Oliver Penrose and George Stell.
• 2000-36 (abstract): Interaction in Quantum Communication and the Complexity of Set Disjointness by Ashwin Nayak, Amnon Ta-Shma and David Zuckerman.
• 2000-37 (abstract): An inequality limiting the number of maximal frequent sets by E. Boros,V. Gurvich, L. Khachiyan and K. Makino.
• 2000-38 (abstract): Polynomial Time Array Dataflow Analysis by Robert Seater and David Wonnacott.
• 2000-39 (abstract): Tight Bound for the Density of Sequences of Integers the Sum of No Two of which is a Perfect Square by Ayman Khalfalah, Sachin Lodha and Endre Szemeredi.
• 2000-40 (abstract): Resource Allocation in a Distributed Network by Tiina Heikkinen.
• 2000-41 (abstract): The Center Function on Trees by F. R. McMorris, Fred S. Roberts and Chi Wang.
• 2000-42 (abstract): Perfect Dominating Sets of Grids by Italo J. Dejter.
• 2000-43 (abstract): Quantum Walk on the Line by Ashwin Nayak and Ashvin Vishwanath.
• 2000-44 (abstract): Packing Trees in Graphs by Alexander Kelmans.
• 2000-45 (abstract): On the ratio of the stability number and the domination number by I. E. Zverovich and I. I. Zverovich.
• 2000-46 (abstract): Graph Bipartition with Hereditary Properties by I. E. Zverovich.
• 2000-47 (abstract): An Integrated Architecture for the Scalable Delivery of Semi-Dynamic Web Content by Danny Dolev, Osnat Mokryn, Yuval Shavitt, Innocenty Sukhov.

Return to Tech Reports Page

DIMACS Homepage