Leonid Molokov

Showing 8 publications

2013

Fixed-parameter tractability of error correction in graphical linear systems

Peter Damaschke, Ömer Egecioglu, Leonid Molokov
7th International Workshop on Algorithms and Computation WALCOM 2013, Lecture Notes in Computer Science. Vol. 7748, p. 245-256
Paper in proceedings
2012

Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover

Peter Damaschke, Leonid Molokov
Theoretical Computer Science. Vol. 452, p. 39-46
Journal article
2012

Error propagation in sparse linear systems with peptide-protein incidence matrices

Peter Damaschke, Leonid Molokov
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7292, p. 72-83
Paper in proceedings
2011

Parameterized reductions and algorithms for another vertex cover generalization

Peter Damaschke, Leonid Molokov
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6844, p. 279-289
Paper in proceedings
2010

Application of Combinatorial Methods to Protein Identification in Peptide Mass Fingerprinting

Leonid Molokov
KDIR 2010 - International Conference on Knowledge Discovery and Information Retrieval, Valencia, Spain, p. 307-313
Paper in proceedings
2009

The union of minimal hitting sets: parameterized combinatorial bounds and counting

Peter Damaschke, Leonid Molokov
Journal of Discrete Algorithms. Vol. 7 (4), p. 391-401
Journal article

Download publicaton list

You can download this list to your computer.

Filter and download publication list

As logged in user (Chalmers employee) you find more export functions in MyResearch.

You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:

Zotero Connector
Mendeley Web Importer

There are no projects.
There might be more projects where Leonid Molokov participates, but you have to be logged in as a Chalmers employee to see them.