| Publication | Date of Publication | Type |
|---|
| Maximizing coverage while ensuring fairness: a tale of conflicting objectives | 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 | 2020-07-29 | Paper |
| Why did the shape of your network change? (On detecting network anomalies via non-local curvatures) | 2020-05-21 | Paper |
| On the computational complexities of three problems related to a privacy measure for large networks under active attack | 2019-05-29 | Paper |
| Densely Entangled Financial Systems | 2018-12-20 | Paper |
| On global stability of financial 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 | 2018-04-06 | Paper |
| A Review of Several Optimization Problems Related to Security in Networked System | 2017-11-30 | Paper |
| On optimal approximability results for computing the strong metric dimension | 2017-02-27 | Paper |
| A decomposition theorem and two algorithms for reticulation-visible networks | 2016-12-22 | Paper |
| Vibration suppression during input tracking of a flexible manipulator using a hybrid controller | 2016-07-01 | Paper |
| Computational Complexities of Optimization Problems Related to Model-Based Clustering of Networks | 2015-10-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2949558 | 2015-10-01 | Paper |
| Column-Generation Framework of Nonlinear Similarity Model for Reconstructing Sibling Groups | 2015-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501820 | 2015-08-14 | Paper |
| On the computational complexity of measuring global stability of banking networks | 2015-01-19 | Paper |
| Improvements in throughout maximization for real-time scheduling | 2014-09-26 | Paper |
| On a connection between small set expansions and modularity clustering | 2014-04-17 | Paper |
| On the complexity of Newman's community finding approach for biological and social networks | 2013-02-21 | Paper |
| Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction | 2012-11-15 | Paper |
| On communication protocols that compute almost privately | 2012-10-11 | Paper |
| New Optimization Model and Algorithm for Sibling Reconstruction from Genetic Markers | 2012-07-28 | Paper |
| On Communication Protocols That Compute Almost Privately | 2011-10-28 | Paper |
| On Approximate Horn Formula Minimization | 2010-09-07 | Paper |
| AN IMPLICIT COVER PROBLEM IN WILD POPULATION STUDY | 2010-05-19 | Paper |
| On constructing an optimal consensus clustering from multiple clusterings | 2010-03-24 | Paper |
| Approximating Transitive Reductions for Directed Networks | 2009-10-20 | Paper |
| On Approximating an Implicit Cover Problem in Biology | 2009-07-02 | Paper |
| On approximating four covering and packing problems | 2009-06-08 | Paper |
| Inferring (biological) signal transduction networks via transitive reductions of directed graphs | 2008-07-01 | Paper |
| Approximating the online set multicover problems via randomized winnowing | 2008-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5457044 | 2008-04-14 | Paper |
| Inapproximability results for the lateral gene transfer problem | 2008-04-04 | Paper |
| Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems | 2007-09-14 | Paper |
| Set covering approach for reconstruction of sibling relationships | 2007-09-03 | Paper |
| The inverse protein folding problem on 2D and 3D lattices | 2007-04-18 | Paper |
| Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks | 2007-04-18 | Paper |
| Theoretical Computer Science | 2006-11-01 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Honey-pot constrained searching with local sensory information | 2006-10-05 | Paper |
| On approximate learning by multi-layered feedforward circuits | 2006-01-10 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2005-08-25 | Paper |
| Tight approximability results for test set problems in bioinformatics | 2005-08-03 | Paper |
| Static equilibrium analysis of compliant mechanical systems using relative coordinates and loop closure equations | 2004-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473252 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4459826 | 2004-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4432280 | 2003-12-16 | Paper |
| Variational approach for singularity-free path-planning of parallel manipulators. | 2003-10-15 | Paper |
| Domain mapping as an expeditionary strategy for fast path planning. | 2003-10-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410158 | 2003-07-02 | Paper |
| A Newton-Euler formulation for the inverse dynamics of the Stewart platform manipulator | 2003-01-28 | Paper |
| Polynomial time approximation scheme for symmetric rectilinear Steiner arborescence problem | 2002-12-15 | Paper |
| Online real-time preemptive scheduling of jobs with deadlines on multiple machines | 2002-10-24 | Paper |
| The Stewart platform manipulator: a review | 2002-07-02 | Paper |
| Multi-phase algorithms for throughput maximization for real-time scheduling | 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 | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753730 | 2001-11-11 | Paper |
| On the linear-cost subtree-transfer distance between phylogenetic trees | 2001-01-14 | Paper |
| Provably good algorithms for transmission scheduling in WDM optical networks | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247446 | 2000-04-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251756 | 1999-10-05 | Paper |
| A general strategy based on the Newton-Euler approach for the dynamic formulation of parallel manipulators. | 1999-09-15 | Paper |
| Closed-form dynamic equations of the general Stewart platform through the Newton-Euler approach. | 1999-09-13 | Paper |
| Singularity-free path planning for the Stewart platform manipulator. | 1999-09-07 | Paper |
| Force redundancy in parallel manipulators: theoretical and practical issues. | 1999-09-07 | Paper |
| On the complexity and approximation of syntenic distance | 1999-06-20 | Paper |
| The Rectangle Enclosure and Point-Dominance Problems Revisited | 1997-10-30 | Paper |
| Sample complexity for learning recurrent perceptron mappings | 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 | 1996-07-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4839060 | 1996-04-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4840099 | 1996-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4312661 | 1994-11-08 | Paper |
| An approximate algorithm for the minimal vertex nested polygon problem | 1992-06-25 | Paper |
