![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Clemens Gröpl
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
- [j11]Eva Lange, Ralf Tautenhahn, Steffen Neumann
, Clemens Gröpl:
Critical assessment of alignment procedures for LC-MS proteomics and metabolomics measurements. BMC Bioinform. 9 (2008) - [j10]Ole Schulz-Trieglaff, Nico Pfeifer
, Clemens Gröpl, Oliver Kohlbacher
, Knut Reinert
:
LC-MSsim - a simulation software for liquid chromatography mass spectrometry data. BMC Bioinform. 9 (2008) - [j9]Marc Sturm
, Andreas Bertsch, Clemens Gröpl, Andreas Hildebrandt
, Rene Hussong, Eva Lange, Nico Pfeifer
, Ole Schulz-Trieglaff, Alexandra Zerck, Knut Reinert
, Oliver Kohlbacher
:
OpenMS - An open-source software framework for mass spectrometry. BMC Bioinform. 9 (2008) - [j8]Ole Schulz-Trieglaff, Rene Hussong, Clemens Gröpl, Andreas Leinenbach, Andreas Hildebrandt
, Christian G. Huber
, Knut Reinert
:
Computational Quantification of Peptides from LC-MS Data. J. Comput. Biol. 15(7): 685-704 (2008) - [j7]Manuel Bodirsky
, Clemens Gröpl, Mihyun Kang
:
Generating unlabeled connected cubic planar graphs uniformly at random. Random Struct. Algorithms 32(2): 157-180 (2008) - 2007
- [j6]Oliver Kohlbacher
, Knut Reinert
, Clemens Gröpl, Eva Lange, Nico Pfeifer
, Ole Schulz-Trieglaff, Marc Sturm
:
TOPP - the OpenMS proteomics pipeline. Bioinform. 23(2): 191-197 (2007) - [j5]Manuel Bodirsky
, Clemens Gröpl, Mihyun Kang
:
Generating labeled planar graphs uniformly at random. Theor. Comput. Sci. 379(3): 377-386 (2007) - [c9]Eva Lange, Clemens Gröpl, Ole Schulz-Trieglaff, Andreas Leinenbach, Christian G. Huber
, Knut Reinert
:
A geometric approach for the alignment of liquid chromatography - mass spectrometry data. ISMB/ECCB (Supplement of Bioinformatics) 2007: 273-281 - [c8]Ole Schulz-Trieglaff, Rene Hussong, Clemens Gröpl, Andreas Hildebrandt, Knut Reinert
:
A Fast and Accurate Algorithm for the Quantification of Peptides from Mass Spectrometry Data. RECOMB 2007: 473-487 - 2006
- [c7]Eva Lange, Clemens Gröpl, Knut Reinert, Oliver Kohlbacher, Andreas Hildebrandt:
High-Accuracy Peak Picking of Proteomics Data Using Wavelet Techniques. Pacific Symposium on Biocomputing 2006: 243-254 - 2005
- [c6]Clemens Gröpl, Eva Lange, Knut Reinert, Oliver Kohlbacher, Marc Sturm, Christian G. Huber
, Bettina M. Mayr, Christoph L. Klein:
Algorithms for the Automated Absolute Quantification of Diagnostic Markers in Complex Proteomics Samples. CompLife 2005: 151-162 - [c5]Manuel Bodirsky
, Clemens Gröpl, Mihyun Kang
:
Sampling Unlabeled Biconnected Planar Graphs. ISAAC 2005: 593-603 - [i2]Clemens Gröpl:
An Algorithm for Feature Finding in LC/MS Raw Data. Computational Proteomics 2005 - [i1]Eva Lange, Clemens Gröpl, Oliver Kohlbacher, Andreas Hildebrandt:
High-accuracy peak picking of proteomics data. Computational Proteomics 2005 - 2004
- [j4]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Ordered binary decision diagrams and the Shannon effect. Discret. Appl. Math. 142(1-3): 67-85 (2004) - 2003
- [j3]Cornelius Frömmel, Christoph Gille, Andrean Goede
, Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Robert Preissner
, Martin Thimm:
Accelerating screening of 3D protein data with a graph theoretical approach. Bioinform. 19(18): 2442-2447 (2003) - [c4]Manuel Bodirsky
, Clemens Gröpl, Mihyun Kang:
Generating Labeled Planar Graphs Uniformly at Random. ICALP 2003: 1095-1107 - 2002
- [j2]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Steiner trees in uniformly quasi-bipartite graphs. Inf. Process. Lett. 83(4): 195-200 (2002) - 2001
- [j1]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
On the evolution of the worst-case OBDD size. Inf. Process. Lett. 77(1): 1-7 (2001) - [c3]Clemens Gröpl, Stefan Hougardy, Till Nierhoff, Hans Jürgen Prömel:
Lower Bounds for Approximation Algorithms for the Steiner Tree Problem. WG 2001: 217-228
1990 – 1999
- 1999
- [b1]Clemens Gröpl:
Binary decision diagrams for random Boolean functions. Humboldt University of Berlin, Unter den Linden, Germany, 1999, pp. 1-126 - 1998
- [c2]Clemens Gröpl, Hans Jürgen Prömel, Anand Srivastav:
Size and Structure of Random Ordered Binary Decision Diagrams (Extended Abstract). STACS 1998: 238-248 - 1997
- [c1]Clemens Gröpl, Martin Skutella:
Parallel Repetition of MIP(2, 1) Systems. Lectures on Proof Verification and Approximation Algorithms 1997: 161-178
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint