The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ján Manuch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Daya Ram Gaur, Ramesh Krishnamurti, Ján Manuch
    Improved Approximation Algorithm for Scheduling Tasks with a Choice of Start Times. [Citation Graph (0, 0)][DBLP]
    ACiD, 2006, pp:85-94 [Conf]
  2. Ján Manuch, Xiaohong Zhao, Ladislav Stacho, Arvind Gupta
    Characterization of the Existence of Galled-Tree Networks. [Citation Graph (0, 0)][DBLP]
    APBC, 2006, pp:297-306 [Conf]
  3. Ján Manuch, Daya Ram Gaur
    Fitting Protein Chains to Cubic Lattice is NP-Complete. [Citation Graph (0, 0)][DBLP]
    APBC, 2007, pp:153-164 [Conf]
  4. Arvind Gupta, Ján Manuch, Ladislav Stacho, Chenchen Zhu
    Small Phylogeny Problem: Character Evolution Trees. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:230-243 [Conf]
  5. Arvind Gupta, Ján Manuch, Ladislav Stacho
    Inverse Protein Folding in 2D HP Mode (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:311-318 [Conf]
  6. Ján Manuch
    Characterization of a word by its subwords. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:210-219 [Conf]
  7. Jonathan Kavanagh, David G. Mitchell, Eugenia Ternovska, Ján Manuch, Xiaohong Zhao, Arvind Gupta
    Constructing Camin-Sokal Phylogenies Via Answer Set Programming. [Citation Graph (0, 0)][DBLP]
    LPAR, 2006, pp:452-466 [Conf]
  8. Pavol Duris, Ján Manuch
    On the Computational Complexity of Infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:328-337 [Conf]
  9. Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
    On Defect Effect of Bi-Infinite Words. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:674-682 [Conf]
  10. Ján Manuch
    Multiparty Communication Complexity: Very Hard Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1999, pp:160-169 [Conf]
  11. Arvind Gupta, Ján Manuch, Ladislav Stacho
    Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:197-208 [Conf]
  12. Ján Manuch, Laszlo L. Stachó
    Fault-Tolerant Wavelength Allocations in All-optical Hypercubes. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:219-222 [Conf]
  13. Ján Manuch
    Defect Effect of Bi-infinite Words in the Two-element Case. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:273-290 [Journal]
  14. Julien Cassaigne, Juhani Karhumäki, Ján Manuch
    On Conjugacy of Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:6, pp:535-550 [Journal]
  15. Ján Manuch
    Construction of very hard functions for multiparty communication complexity. [Citation Graph (0, 0)][DBLP]
    ITA, 2000, v:34, n:1, pp:61-76 [Journal]
  16. Ján Manuch, Ladislav Stacho
    On f-wise Arc Forwarding Index and Wavelength Allocations in Faulty All-optical Hypercubes. [Citation Graph (0, 0)][DBLP]
    ITA, 2003, v:37, n:3, pp:255-270 [Journal]
  17. Arvind Gupta, Ján Manuch, Xiaohong Zhao, Ladislav Stacho
    Characterization of the Existence of Galled-tree Networks. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2006, v:4, n:6, pp:1309-1328 [Journal]
  18. Petra Berenbrink, Tom Friedetzky, Ján Manuch, Ladislav Stacho
    (quasi) Spanners for Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2005, v:6, n:2, pp:63-84 [Journal]
  19. Pavol Duris, Ján Manuch
    On the computational complexity of infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:141-151 [Journal]
  20. Juhani Karhumäki, Ján Manuch
    Multiple factorizations of words and defect effect. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:81-97 [Journal]
  21. Juhani Karhumäki, Ján Manuch, Wojciech Plandowski
    A defect theorem for bi-infinite words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:292, n:1, pp:237-243 [Journal]
  22. Arvind Gupta, Ján Manuch, Ladislav Stacho, Xiaohong Zhao
    Algorithm for Haplotype Inferring Via Galled-Tree Networks with Simple Galls. [Citation Graph (0, 0)][DBLP]
    ISBRA, 2007, pp:121-132 [Conf]

  23. Structure-Approximating Design of Stable Proteins in 2D HP Model Fortified by Cysteine Monomers. [Citation Graph (, )][DBLP]


  24. Design of Artificial Tubular Protein Structures in 3D Hexagonal Prism Lattice Under HP Model. [Citation Graph (, )][DBLP]


  25. Inverse protein folding in 3D hexagonal prism lattice under HP model. [Citation Graph (, )][DBLP]


  26. Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. [Citation Graph (, )][DBLP]


  27. Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. [Citation Graph (, )][DBLP]


  28. On the Generalised Character Compatibility Problem for Non-branching Character Trees. [Citation Graph (, )][DBLP]


  29. NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots. [Citation Graph (, )][DBLP]


  30. Two lower bounds for self-assemblies at temperature 1. [Citation Graph (, )][DBLP]


  31. A Robust Class of Stable Proteins in the 2D HPC Model. [Citation Graph (, )][DBLP]


  32. Hardness Results for the Gapped Consecutive-Ones Property [Citation Graph (, )][DBLP]


  33. Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices. [Citation Graph (, )][DBLP]


  34. The Odd-Distance Plane Graph. [Citation Graph (, )][DBLP]


  35. Spanning cubic graph designs. [Citation Graph (, )][DBLP]


Search in 0.144secs, Finished in 0.146secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002