The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark Cieliebak: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
    Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:519-527 [Conf]
  2. Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
    Efficient Algorithms for Finding Submasses in Weighted Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:194-204 [Conf]
  3. Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis
    Composing Equipotent Teams. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:98-108 [Conf]
  4. Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro
    Solving the Robots Gathering Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:1181-1196 [Conf]
  5. Luzi Anderegg, Mark Cieliebak, Giuseppe Prencipe
    Efficient Algorithms for Detecting Regular Point Configurations. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:23-35 [Conf]
  6. Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, Peter Widmayer
    Scheduling with Release Times and Deadlines on a Minimum Number of Machines. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:209-222 [Conf]
  7. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:143-156 [Conf]
  8. Mark Cieliebak
    Gathering Non-oblivious Mobile Robots. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:577-588 [Conf]
  9. Mark Cieliebak, Stephan Eidenbenz
    Measurement Errors Make the Partial Digest Problem NP-Hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:379-390 [Conf]
  10. Mark Cieliebak, Giuseppe Prencipe
    Gathering Autonomous Mobile Robots. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:57-72 [Conf]
  11. Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
    Noisy Data Make the Partial Digest Problem NP-hard. [Citation Graph (0, 0)][DBLP]
    WABI, 2003, pp:111-123 [Conf]
  12. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic complexity of protein identification: combinatorics of weighted strings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:1, pp:27-46 [Journal]
  13. Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták
    Finding submasses in weighted strings with Fast Fourier Transform. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:707-718 [Journal]
  14. Mark Cieliebak, Stephan Eidenbenz, Gerhard J. Woeginger
    Complexity and Approximability of Double Digest. [Citation Graph (0, 0)][DBLP]
    J. Bioinformatics and Computational Biology, 2005, v:3, n:2, pp:207-224 [Journal]
  15. Mark Cieliebak, Stephan Eidenbenz, Paolo Penna
    Partial Digest is hard to solve for erroneous input data. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:3, pp:361-381 [Journal]
  16. Mark Cieliebak, Alexander Hall, Riko Jacob, Marc Nunkesser
    Sequential Vector Packing. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:12-23 [Conf]

Search in 0.004secs, Finished in 0.004secs
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