activity
20092017
most citedOrdering with precedence constraints and budget minimization

3 citations · 4 across the 8 of their papers we have counts for

collaborators

8 papers

cs.DC2017

Weak Coverage of a Rectangular Barrier

Stefan Dobrev, Evangelos Kranakis, Danny Krizanc +5

Assume n wireless mobile sensors are initially dispersed in an ad hoc manner in a rectangular region. They are required to move to final locations so that they can detect any intru…

q-bio.QM2016

Combinatorial RNA Design Designability and Structure-Approximating Algorithm in Watson-Crick and Nussinov-Jacobson Energy Models

Jozef Haleš, Alice Héliou, Ján Maňuch +2

We consider the Combinatorial RNA Design problem, a minimal instance of RNA design where one must produce an RNA sequence that adopts a given secondary structure as its minimal fre…

cs.DM2015★ 3 cited

Ordering with precedence constraints and budget minimization

Akbar Rafiey, Jeff Kinne, Ján Manuch +1

We introduce a variation of the scheduling with precedence constraints problem that has applications to molecular folding and production management. We are given a bipartite graph…

q-bio.QM2015

Combinatorial RNA Design: Designability and Structure-Approximating Algorithm

Jozef Haleš, Ján Maňuch, Yann Ponty +1

In this work, we consider the Combinatorial RNA Design problem, a minimal instance of the RNA design problem which aims at finding a sequence that admits a given target as its uniq…

cs.CG2014

Pattern overlap implies runaway growth in hierarchical tile systems

Ho-Lin Chen, David Doty, Ján Maňuch +2

We show that in the hierarchical tile assembly model, if there is a producible assembly that overlaps a nontrivial translation of itself consistently (i.e., the pattern of tile typ…

cs.DS2014

Finding minimum Tucker submatrices

Jan Manuch, Arash Rafiey

A binary matrix has the Consecutive Ones Property (C1P) if its columns can be ordered in such a way that all 1s on each row are consecutive. These matrices are used for DNA physica…

cs.CC2012

The complexity of string partitioning

Anne Condon, Ján Maňuch, Chris Thachuk

Given a string over a finite alphabet and an integer , can be partitioned into strings of length at most , such that there are no \emph{collisions}? We refer to t…

cs.CC2009★ 1 cited

Hardness Results for the Gapped Consecutive-Ones Property

Cedric Chauve, Jan Manuch, Murray Patterson

Motivated by problems of comparative genomics and paleogenomics, in [Chauve et al., 2009], the authors introduced the Gapped Consecutive-Ones Property Problem (k,delta)-C1P: given…