Conference and Journal Publications

  1. Partial Digest is Hard to Solve for Erroneous Input Data. Mark Cieliebak, Stephan Eidenbenz, and Paolo Penna.Theoretical Computer Science, 2005.
  2. Finding Submasses in Weighted Strings with Fast Fourier Transform. Nikhil Bansal, Mark Cieliebak, and Zsuzsanna Lipták. Discrete Applied Mathematics (DAM), Special Issue on Computational Biology, to appear.
  3. Efficient Algorithms for Detecting Regular Point Configurations. Luzi Anderegg, Mark Cieliebak, and Giuseppe Prencipe. ICTCS 2005.
  4. AUDENS: A Tool for Automated Peptide de Novo Sequencing. Jonas Grossmann, Franz F. Roos, Mark Cieliebak, Zsuzsanna Lipták, Lucas K. Mathis, Matthias Müller, Wilhelm Gruissem, and Sacha Baginsky. Journal of Proteome Research, 2005.
  5. Complexity and Approximability of Double Digest. Mark Cieliebak, Stephan Eidenbenz, and Gerhard J. Woeginger. Journal of Bioinformatics and Computational Biology, 2005.
  6. Scheduling with Release Times and Deadlines on a Minimum Number of Machines. Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, and Peter Widmayer. IFIP TCS 2004.
  7. Efficient Algorithms for Finding Submasses in Weighted Strings. Nikhil Bansal, Mark Cieliebak, and Zsuzsanna Lipták. CPM 2004.
  8. Gathering Non-Oblivious Mobile Robots. Mark Cieliebak. LATIN 2004.
  9. Measurement Errors Make the Partial Digest Problem NP-hard. Mark Cieliebak and Stephan Eidenbenz. LATIN 2004.
  10. Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, and Emo Welzl. Discrete Applied Mathematics, 2004.
  11. Noisy Data Make the Partial Digest Problem NP-hard. Mark Cieliebak, Stephan Eidenbenz, and Paolo Penna. WABI 2003.
  12. Composing Equipotent Teams. Mark Cieliebak, Stephan Eidenbenz, and Aris Pagourtzis. FCT 2003.
  13. Solving the Robots Gathering Problem. Mark Cieliebak, Paola Flocchini, Giuseppe Prencipe, and Nicola Santoro. ICALP 2003.
  14. Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. Mark Cieliebak, Stephan Eidenbenz, and Gerhard J. Woeginger. COCOON 2003.
  15. Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, and Emo Welzl. TCS 2002.
  16. Gathering Autonomous Mobile Robots. Mark Cieliebak and Giuseppe Prencipe. SIROCCO 2002.

 

Theses

  1. Algorithms and Hardness Results for DNA Physical Mapping, Protein Identification, and Related Problems". Mark Cieliebak. Ph.D. Thesis, ETH Zurich, 2003.
  2. Attribut-effizientes Lernen in Klassen von symmetrischen Funktionen und Threshold-Funktionen. Mark Cieliebak. Diploma Thesis, University of Dortmund, 1999.

 

Technical Reports

  1. Scheduling with Release Times and Deadlines on a Minimum Number of Machines. Mark Cieliebak, Thomas Erlebach, Fabian Hennecke, Birgitta Weber, and Peter Widmayer. Technical Report 419, ETH Zurich, 2003.
  2. The Weber Point can be Found in Linear Time for Points in Biangular Configuration. Luzi Anderegg, Mark Cieliebak, and Giuseppe Prencipe. Technical Report TR-03-01, Universitá di Pisa, 2003.
  3. AuDeNS: A Tool for Automatic De Novo Peptide Sequencing. Sacha Baginsky, Mark Cieliebak, Wilhelm Gruissem, Torsten Kleffmann, Zsuzsanna Lipták, and Matthias Müller, and Paolo Penna. Technical Report 383, ETH Zurich, 2002.
  4. Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. Mark Cieliebak, Stephan Eidenbenz, and Gerhard J. Woeginger. Technical Report 382, ETH Zurich, 2002.
  5. Noisy Data Make the Partial Digest Problem NP-hard. Mark Cieliebak, Stephan Eidenbenz, and Paolo Penna. Technical Report 381, ETH Zurich, 2002.
  6. Gathering Autonomous Mobile Robots in Non Totally Symmetric Configurations. Mark Cieliebak and Giuseppe Prencipe. Technical Report 379, ETH Zurich, 2002.
  7. Equal Sum Subsets: Complexity of Variations. Mark Cieliebak, Stephan Eidenbenz, Aris Pagourtzis, and Konrad Schlude. Technical Report 370, ETH Zurich, 2002.
  8. Algorithmic Complexity of Protein Identification: Combinatorics of Weighted Strings. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, and Emo Welzl. Technical Report 361, ETH Zurich, 2001.

 

Other Publications

  1. Startschuss für die 8. Schweizer Informatikolympiade. Mark Cieliebak and Roland Ulber. Visionen, ETH Zurich, 2003.
  2. Statistical Foundations of De Novo Sequencing. Sacha Baginsky, Mark Cieliebak, Jonas Grossmann, Wilhelm Gruissem, Torsten Kleffmann, and Lukas K. Mathis. Poster Abstract, SPS 2002.
  3. Javakurs: Ein Autointerview mit den Veranstaltern. Alexander Below and Mark Cieliebak. Visionen, ETH Zurich, 2002.