The following pages link to Bhaskar Das Gupta (Q1709596):
Displaying 50 items.
- Vibration suppression during input tracking of a flexible manipulator using a hybrid controller (Q301782) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- On optimal approximability results for computing the strong metric dimension (Q512531) (← links)
- (Q590738) (redirect page) (← links)
- On communication protocols that compute almost privately (Q714841) (← links)
- A decomposition theorem and two algorithms for reticulation-visible networks (Q729819) (← links)
- On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering (Q782765) (← links)
- The inverse protein folding problem on 2D and 3D lattices (Q876470) (← links)
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks (Q876471) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- On approximating four covering and packing problems (Q1021577) (← links)
- On the linear-cost subtree-transfer distance between phylogenetic trees (Q1125442) (← links)
- On the complexity and approximation of syntenic distance (Q1281760) (← links)
- Singularity-free path planning for the Stewart platform manipulator. (Q1301004) (← links)
- Force redundancy in parallel manipulators: theoretical and practical issues. (Q1301005) (← links)
- A general strategy based on the Newton-Euler approach for the dynamic formulation of parallel manipulators. (Q1301117) (← links)
- Closed-form dynamic equations of the general Stewart platform through the Newton-Euler approach. (Q1301494) (← links)
- Provably good algorithms for transmission scheduling in WDM optical networks (Q1306098) (← links)
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines (Q1348736) (← links)
- Variational approach for singularity-free path-planning of parallel manipulators. (Q1410807) (← links)
- Domain mapping as an expeditionary strategy for fast path planning. (Q1410816) (← links)
- Multi-phase algorithms for throughput maximization for real-time scheduling (Q1587588) (← links)
- The Stewart platform manipulator: a review (Q1602050) (← links)
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction (Q1762010) (← links)
- An approximate algorithm for the minimal vertex nested polygon problem (Q1812727) (← links)
- Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem (Q1850838) (← links)
- A Newton-Euler formulation for the inverse dynamics of the Stewart platform manipulator (Q1854916) (← links)
- Static equilibrium analysis of compliant mechanical systems using relative coordinates and loop closure equations (Q1875933) (← links)
- Classifying trend movements in the MSCI U.S.A. capital market index -- a comparison of regression, ARIMA and neural network methods (Q1915985) (← links)
- On the complexity of Newman's community finding approach for biological and social networks (Q1936247) (← links)
- A review of two network curvature measures (Q1982207) (← links)
- Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) (Q2182087) (← links)
- On constructing an optimal consensus clustering from multiple clusterings (Q2380012) (← links)
- On the computational complexities of three problems related to a privacy measure for large networks under active attack (Q2419112) (← links)
- On a connection between small set expansions and modularity clustering (Q2446591) (← links)
- Inapproximability results for the lateral gene transfer problem (Q2479568) (← links)
- Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
- Tight approximability results for test set problems in bioinformatics (Q2485280) (← links)
- Honey-pot constrained searching with local sensory information (Q2507866) (← links)
- On approximate learning by multi-layered feedforward circuits (Q2581366) (← links)
- Maximizing coverage while ensuring fairness: a tale of conflicting objectives (Q2701386) (← links)
- (Q2753730) (← links)
- New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers (Q2899050) (← links)
- Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups (Q2942680) (← links)
- (Q2949558) (← links)
- Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks (Q2949909) (← links)
- On Communication Protocols That Compute Almost Privately (Q3095257) (← links)
- Approximating Transitive Reductions for Directed Networks (Q3183442) (← links)
- Improvements in throughout maximization for real-time scheduling (Q3192041) (← links)
