Sushil K. Prasad, Vijay Madisetti, Shamkant B. Navathe, Raj Sunderraman, Erdogan Dogdu, Anu Bourgeois, ...
Abstract. Developing a collaborative application running on a collection of heterogeneous, possibly mobile, devices, each potentially hosting data stores, using existing middleware technologies such...
Nisar Hundewale, Sunsook Jung, Alex Zelikovsky
Abstract: Enhancing route request broadcasting protocols constitutes a substantial part of recent research in mobile ad-hoc network (MANET) routing. We suggest a novel approach to modify route...
Moving-Target TSP and Related Problems \Lambda (2008)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
Abstract Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent...
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two (2008)
Berman, Piotr, Karpinski, Marek, Zelikovsky, Alex
We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of...
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two (2008)
Berman, Piotr, Karpinski, Marek, Zelikovsky, Alex
We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
Gulsah Altun, Hae-jin Hu, Dumitru Brinza, Robert W. Harrison, Alex Zelikovsky, Yi Pan
Abstract—The Support Vector Machine is a powerful methodology for solving problems in nonlinear classification, function estimation and density estimation. When data are not linearly separable,...
Fast Yield-Driven Fracture for Variable Shaped-Beam Mask Writing (2008)
Andrew B. Kahng, Xu Xu, Alex Zelikovsky
Increasing transistor densities, smaller feature sizes, and the aggressive use of RET techniques with each successive process generation have collectively presented new challenges for current...
The Moving-Target Traveling Salesman Problem (2008)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of...
Tag SNP Selection Based on Multivariate Linear Regression (2006)
Abstract. The search for the association between complex diseases and single nucleotide polymorphisms (SNPs) or haplotypes has been recently received great attention. For these studies, it is...
ALGORITHMS FOR COMPUTATIONAL GENETIC EPIDEMIOLOGY by (2006)
Jingwu He, Under Direction, Alex Zelikovsky, Jingwu He, Jingwu He, Jingwu He
The most intriguing problems in genetics epidemiology are to predict genetic disease susceptibility and to associate single nucleotide polymorphisms (SNPs) with diseases. In such these studies, it is...
Delay and Power Reduction in Deep Submicron Buses (2005)
Sharareh Babvey, Sharareh Babvey, Alex Zelikovsky, Sharareh Babvey, A. P. Preethy
As technology scales down, coupling between nodes of the circuits increases and becomes an important factor in interconnection analysis. In many cases like the deep submicron technology (DSM), the...
A Combinatorial Method for Predicting Genetic Susceptibility to Complex Diseases (2005)
Weidong Mao, Jingwu He, Dumitru Brinza, Alex Zelikovsky
Abstract — Recent improvements in the accessibility of highthroughput genotyping have brought a great deal of attention to disease association and susceptibility studies. This paper explores...
Tighter Bounds for Graph Steiner Tree Approximation (2005)
Gabriel Robins, Alex Zelikovsky
The classical Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices (terminals). We present a new polynomial-ln 3 time heuristic...
Linear Reduction for Haplotype Inference (2004)
Abstract. Haplotype inference problem asks for a set of haplotypes explaining a given set of genotypes. Popular software tools for haplotype inference (e.g., PHASE, HAPLOTYPER) as well as new...
Traversing probabilistic graphs (1999)
Murali Mani, Alex Zelikovsky, Gautam Bhatia, Andrew B. Kahng
The problem of traversing probabilistic graphs has been studied for a long time. This is because most of the graphs that we come across, whether it is a network of roads or a set of network links are...
Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks (1999)
Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alex Zelikovsky
We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase-shifting masks in the single-exposure regime. We make the following...
Optimization of Linear Placements for Wirelength Minimization with Free Sites (1999)
Andrew Kahng, Paul Tucker, Alex Zelikovsky
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placement problem, the cell...
Optimization of Linear Placements for Wirelength Minimization with Free Sites (1999)
Andrew Kahng, Paul Tucker, Alex Zelikovsky
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of whitespace (extra sites). In this single-row placement problem, the cell...
On Wirelength Estimations for Row-based Placement (1999)
Andrew E. Caldwell, Andrew B. Kahng, Stefanus Mantik, Igor L. Markov, Alex Zelikovsky
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop new wirelength estimation techniques appropriate for...
Optimal Phase Conflict Removal for Layout of Dark Field Alternating Phase Shifting Masks (1999)
Piotr Berman, Andrew B. Kahng, Devendra Vidhani, Huijuan Wang, Alex Zelikovsky
We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase-shifting masks in the single-exposure regime. We make the following...
Automated Layout and Phase Assignment Techniques for Dark Field Alternating (1998)
Andrew B. Kahng, Huijuan Wang, Alex Zelikovsky
We describe new, e cient algorithms for layout modi cation and phase assignment for dark eld alternating-type phase-shifting masks in the single-exposure regime. We make the following contributions....
On Wirelength Estimations for Row-Based Placement (1998)
Andrew E. Caldwell, Andrew B. Kahng, Stefanus Mantik, Igor L. Markov, Alex Zelikovsky
Wirelength estimation in VLSI layout is fundamental to any pre-detailed routing estimate of timing or routability. In this paper, we develop new wirelength estimation techniques appropriate for...
Automated Layout and Phase Assignment Techniques for Dark Field Alternating PSM (1998)
Andrew Kahng, Huijuan Wang, Alex Zelikovsky
We describe new, efficient algorithms for layout modification and phase assignment for dark field alternating-type phase-shifting masks in the single-exposure regime. We make the following...
Moving-target TSP and related problems (1998)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
Abstract. Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent...
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs (1997)
Marek Karpinski, Jürgen Wirtgen, Alex Zelikovsky
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum difference between two numbers of adjacent vertices is minimal. The problem is known to be...
Moving-Target TSP and Related Problems (1997)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
. Previous literature on the Traveling Salesman Problem (TSP) implicitly assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent...
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs (1997)
Marek Karpinski, Jurgen Wirtgen, Alex Zelikovsky
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum difference between the numbers of adjacent vertices is minimal. The problem has a long history...
Moving-Target TSP and Related Problems (1997)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
. Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of...
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs (1997)
Marek Karpinski, Jurgen Wirtgen, Alex Zelikovsky
The bandwidth problem is the problem of numbering the vertices of a given graph G such that the maximum di erence between two numbers of adjacent vertices is minimal. The problem is known to be...