| Publication | Date of Publication | Type |
|---|
Maximizing coverage while ensuring fairness: a tale of conflicting objectives
Algorithmica | 2023-04-28 | Paper |
| A review of two network curvature measures | 2021-09-07 | Paper |
On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering
Journal of Combinatorial Optimization | 2020-07-29 | Paper |
Why did the shape of your network change? (On detecting network anomalies via non-local curvatures)
Algorithmica | 2020-05-21 | Paper |
On the computational complexities of three problems related to a privacy measure for large networks under active attack
Theoretical Computer Science | 2019-05-29 | Paper |
Densely entangled financial systems
Network Models in Economics and Finance | 2018-12-20 | Paper |
On global stability of financial networks
Journal of Complex Networks | 2018-10-16 | Paper |
| Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes? | 2018-04-27 | Paper |
Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications
Algorithmica | 2018-04-06 | Paper |
A Review of Several Optimization Problems Related to Security in Networked System
Springer Optimization and Its Applications | 2017-11-30 | Paper |
On optimal approximability results for computing the strong metric dimension
Discrete Applied Mathematics | 2017-02-27 | Paper |
A decomposition theorem and two algorithms for reticulation-visible networks
Information and Computation | 2016-12-22 | Paper |
Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks
Optimization in Science and Engineering | 2015-10-05 | Paper |
| scientific article; zbMATH DE number 6488170 (Why is no real title available?) | 2015-10-01 | Paper |
Column-generation framework of nonlinear similarity model for reconstructing sibling groups
INFORMS Journal on Computing | 2015-09-11 | Paper |
| scientific article; zbMATH DE number 6472618 (Why is no real title available?) | 2015-08-14 | Paper |
On the computational complexity of measuring global stability of banking networks
Algorithmica | 2015-01-19 | Paper |
Improvements in throughout maximization for real-time scheduling
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On a connection between small set expansions and modularity clustering
Information Processing Letters | 2014-04-17 | Paper |
On the complexity of Newman's community finding approach for biological and social networks
Journal of Computer and System Sciences | 2013-02-21 | Paper |
Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction
Computers & Operations Research | 2012-11-15 | Paper |
On communication protocols that compute almost privately
Theoretical Computer Science | 2012-10-11 | Paper |
New optimization model and algorithm for sibling reconstruction from genetic markers
INFORMS Journal on Computing | 2012-07-28 | Paper |
On communication protocols that compute almost privately
Algorithmic Game Theory | 2011-10-28 | Paper |
On approximate Horn formula minimization
Automata, Languages and Programming | 2010-09-07 | Paper |
An implicit cover problem in wild population study
Discrete Mathematics, Algorithms and Applications | 2010-05-19 | Paper |
On constructing an optimal consensus clustering from multiple clusterings
Information Processing Letters | 2010-03-24 | Paper |
Approximating Transitive Reductions for Directed Networks
Lecture Notes in Computer Science | 2009-10-20 | Paper |
On Approximating an Implicit Cover Problem in Biology
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
On approximating four covering and packing problems
Journal of Computer and System Sciences | 2009-06-08 | Paper |
Inferring (biological) signal transduction networks via transitive reductions of directed graphs
Algorithmica | 2008-07-01 | Paper |
Approximating the online set multicover problems via randomized winnowing
Theoretical Computer Science | 2008-04-15 | Paper |
| On computing the nearest neighbor interchange distance | 2008-04-14 | Paper |
Inapproximability results for the lateral gene transfer problem
Journal of Combinatorial Optimization | 2008-04-04 | Paper |
Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
Experimental Algorithms | 2007-09-14 | Paper |
Set covering approach for reconstruction of sibling relationships
Optimization Methods & Software | 2007-09-03 | Paper |
Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
Discrete Applied Mathematics | 2007-04-18 | Paper |
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics | 2007-04-18 | Paper |
Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Honey-pot constrained searching with local sensory information
Nonlinear Analysis. Theory, Methods & Applications. Series A: Theory and Methods | 2006-10-05 | Paper |
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science | 2006-01-10 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Tight approximability results for test set problems in bioinformatics
Journal of Computer and System Sciences | 2005-08-03 | Paper |
Static equilibrium analysis of compliant mechanical systems using relative coordinates and loop closure equations
Mechanism and Machine Theory | 2004-09-03 | Paper |
| scientific article; zbMATH DE number 2080455 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2065154 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 1996311 (Why is no real title available?) | 2003-12-16 | Paper |
Variational approach for singularity-free path-planning of parallel manipulators.
Mechanism and Machine Theory | 2003-10-15 | Paper |
Domain mapping as an expeditionary strategy for fast path planning.
Mechanism and Machine Theory | 2003-10-15 | Paper |
| scientific article; zbMATH DE number 1945181 (Why is no real title available?) | 2003-07-02 | Paper |
A Newton-Euler formulation for the inverse dynamics of the Stewart platform manipulator
Mechanism and Machine Theory | 2003-01-28 | Paper |
Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem
Journal of Global Optimization | 2002-12-15 | Paper |
Online real-time preemptive scheduling of jobs with deadlines on multiple machines
Journal of Scheduling | 2002-10-24 | Paper |
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms | 2002-07-08 | Paper |
The Stewart platform manipulator: a review
Mechanism and Machine Theory | 2002-07-02 | Paper |
Exact size of binary space partitionings and improved rectangle tiling algorithms
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
Multi-phase algorithms for throughput maximization for real-time scheduling
Journal of Combinatorial Optimization | 2002-04-23 | Paper |
A polynomial-time algorithm for checking equivalence under certain semiring congruences motivated by the state-space isomorphism problem for hybrid systems
Theoretical Computer Science | 2002-03-03 | Paper |
Some permutation routing algorithms for low-dimensional hypercubes
Theoretical Computer Science | 2002-03-03 | Paper |
| Improved approximation algorithms for rectangle tiling and packing. | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1670533 (Why is no real title available?) | 2001-11-11 | Paper |
On the linear-cost subtree-transfer distance between phylogenetic trees
Algorithmica | 2001-01-14 | Paper |
Provably good algorithms for transmission scheduling in WDM optical networks
Journal of Parallel and Distributed Computing | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1302179 (Why is no real title available?) | 2000-04-17 | Paper |
| scientific article; zbMATH DE number 1304891 (Why is no real title available?) | 1999-10-05 | Paper |
A general strategy based on the Newton-Euler approach for the dynamic formulation of parallel manipulators.
Mechanism and Machine Theory | 1999-09-15 | Paper |
Closed-form dynamic equations of the general Stewart platform through the Newton-Euler approach.
Mechanism and Machine Theory | 1999-09-13 | Paper |
Singularity-free path planning for the Stewart platform manipulator.
Mechanism and Machine Theory | 1999-09-07 | Paper |
Force redundancy in parallel manipulators: theoretical and practical issues.
Mechanism and Machine Theory | 1999-09-07 | Paper |
On the complexity and approximation of syntenic distance
Discrete Applied Mathematics | 1999-06-20 | Paper |
The Rectangle Enclosure and Point-Dominance Problems Revisited
International Journal of Computational Geometry & Applications | 1997-10-30 | Paper |
Sample complexity for learning recurrent perceptron mappings
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
Classifying trend movements in the MSCI U.S.A. capital market index -- a comparison of regression, ARIMA and neural network methods
Computers & Operations Research | 1996-07-01 | Paper |
| scientific article; zbMATH DE number 774006 (Why is no real title available?) | 1996-04-16 | Paper |
| scientific article; zbMATH DE number 776079 (Why is no real title available?) | 1996-01-08 | Paper |
| scientific article; zbMATH DE number 683527 (Why is no real title available?) | 1994-11-08 | Paper |
An approximate algorithm for the minimal vertex nested polygon problem
Information Processing Letters | 1992-06-25 | Paper |
