default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Grünewald
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i8]Timo Pierre Schrader, Teresa Bürkle, Sophie Henning, Sherry Tan, Matteo Finco
, Stefan Grünewald, Maira Indrikova, Felix Hildebrand, Annemarie Friedrich:
MuLMS-AZ: An Argumentative Zoning Dataset for the Materials Science Domain. CoRR abs/2307.02340 (2023)- [i7]Timo Pierre Schrader, Matteo Finco, Stefan Grünewald, Felix Hildebrand, Annemarie Friedrich:
MuLMS: A Multi-Layer Annotated Text Corpus for Information Extraction in the Materials Science Domain. CoRR abs/2310.15569 (2023) - 2022
- [c7]Sophie Henning, Nicole Macher, Stefan Grünewald, Annemarie Friedrich:
MiST: a Large-Scale Annotated Resource and Neural Models for Functions of Modal Verbs in English Scientific Text. EMNLP (Findings) 2022: 1305-1324 - [i6]Sophie Henning, Nicole Macher, Stefan Grünewald, Annemarie Friedrich:
MIST: a Large-Scale Annotated Resource and Neural Models for Functions of Modal Verbs in English Scientific Text. CoRR abs/2212.07156 (2022) - 2021
- [c6]Elizaveta Sineva, Stefan Grünewald, Annemarie Friedrich, Jonas Kuhn:
Negation-Instance Based Evaluation of End-to-End Negation Resolution. CoNLL 2021: 528-543 - [c5]Stefan Grünewald, Prisca Piccirilli, Annemarie Friedrich:
Coordinate Constructions in English Enhanced Universal Dependencies: Analysis and Computational Modeling. EACL 2021: 795-809 - [i5]Stefan Grünewald, Prisca Piccirilli, Annemarie Friedrich:
Coordinate Constructions in English Enhanced Universal Dependencies: Analysis and Computational Modeling. CoRR abs/2103.08955 (2021) - [i4]Stefan Grünewald:
Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing. CoRR abs/2106.08159 (2021) - [i3]Elizaveta Sineva, Stefan Grünewald, Annemarie Friedrich, Jonas Kuhn:
Negation-Instance Based Evaluation of End-to-End Negation Resolution. CoRR abs/2109.10013 (2021) - 2020
- [c4]Stefan Grünewald, Annemarie Friedrich:
RobertNLP at the IWPT 2020 Shared Task: Surprisingly Simple Enhanced UD Parsing for English. IWPT 2020 2020: 245-252 - [i2]Stefan Grünewald, Annemarie Friedrich, Jonas Kuhn:
Graph-Based Universal Dependency Parsing in the Age of the Transformer: What Works, and What Doesn't. CoRR abs/2010.12699 (2020)
2010 – 2019
- 2018
- [j27]Stefan Grünewald, Katharina T. Huber, Vincent Moulton, Mike A. Steel:
Combinatorial properties of triplet covers for binary trees. Adv. Appl. Math. 99: 59-82 (2018) - [j26]Weikang Gong, Lin Wan, Wenlian Lu, Liang Ma, Fan Cheng, Wei Cheng, Stefan Grünewald, Jianfeng Feng:
Statistical testing and power analysis for brain-wide association study. Medical Image Anal. 47: 15-30 (2018) - [j25]Weikang Gong, Renbo Zhao, Stefan Grünewald:
Structured sparse K-means clustering via Laplacian smoothing. Pattern Recognit. Lett. 112: 63-69 (2018) - [c3]Stefan Grünewald, Sophie Henning, Alexander Koller:
Generalized chart constraints for efficient PCFG and TAG parsing. ACL (2) 2018: 626-631 - [c2]Thierry Declerck, Anastasija Aman, Stefan Grünewald, Matthias Lindemann, Lisa Schäfer, Natalia Skachkova:
Formalisierung von Märchen. DHd 2018 - [i1]Stefan Grünewald, Sophie Henning, Alexander Koller:
Generalized chart constraints for efficient PCFG and TAG parsing. CoRR abs/1806.10654 (2018) - 2014
- [j24]Jialiang Yang, Stefan Grünewald, Yifei Xu, Xiu-Feng Wan:
Quartet-based methods to reconstruct phylogenetic networks. BMC Syst. Biol. 8: 21 (2014) - 2013
- [j23]Jialiang Yang, Jun Li, Stefan Grünewald, Xiu-Feng Wan:
BinAligner: a heuristic method to align biological networks. BMC Bioinform. 14(S-14): S8 (2013) - [j22]Stefan Grünewald, Andreas Spillner, Sarah Bastkowski, Anja Bögershausen, Vincent Moulton:
SuperQ: Computing Supernetworks from Quartets. IEEE ACM Trans. Comput. Biol. Bioinform. 10(1): 151-160 (2013) - 2012
- [j21]Stefan Grünewald:
Slim sets of binary trees. J. Comb. Theory A 119(2): 323-330 (2012) - [j20]Jun Li, Paul Roebuck, Stefan Grünewald, Han Liang:
SurvNet: a web server for identifying network-based biomarkers that most correlate with patient survival data. Nucleic Acids Res. 40(Web-Server-Issue): 123-126 (2012) - 2011
- [j19]Jialiang Yang, Jun Li, Liuhuan Dong, Stefan Grünewald:
Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states. BMC Bioinform. 12: 18 (2011) - [j18]Yang Ding, Stefan Grünewald, Peter J. Humphries:
On agreement forests. J. Comb. Theory A 118(7): 2059-2065 (2011)
2000 – 2009
- 2009
- [j17]Stefan Grünewald, Katharina T. Huber, Vincent Moulton, Charles Semple, Andreas Spillner:
Characterizing weak compatibility in terms of weighted quartets. Adv. Appl. Math. 42(3): 329-341 (2009) - [j16]Stefan Grünewald, Jacobus H. Koolen, Woo-Sun Lee:
Quartets in maximal weakly compatible split systems. Appl. Math. Lett. 22(10): 1604-1608 (2009) - [j15]Stefan Grünewald, Vincent Moulton, Andreas Spillner:
Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discret. Appl. Math. 157(10): 2325-2334 (2009) - [j14]Stefan Grünewald, Vincent Moulton:
Maximum Parsimony for Tree Mixtures. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 97-102 (2009) - 2008
- [j13]Andreas W. M. Dress, Christoph Flamm, Guido Fritzsch, Stefan Grünewald, Matthias Kruspe, Sonja J. Prohaska, Peter F. Stadler:
Noisy: Identification of problematic columns in multiple sequence alignments. Algorithms Mol. Biol. 3 (2008) - [j12]Stefan Grünewald, Peter J. Humphries, Charles Semple:
Quartet Compatibility and the Quartet Graph. Electron. J. Comb. 15(1) (2008) - [c1]Stefan Grünewald, Andreas Spillner, Kristoffer Forslund, Vincent Moulton:
Constructing Phylogenetic Supernetworks from Quartets. WABI 2008: 284-295 - 2005
- [j11]Stefan Grünewald, Dragan Stevanovic:
Semiharmonic bicyclic graphs. Appl. Math. Lett. 18(11): 1228-1238 (2005) - [j10]Jan Weyer-Menkhoff, Claudine Devauchelle, Alexander Grossmann, Stefan Grünewald:
Integer linear programming as a tool for constructing trees from quartet data. Comput. Biol. Chem. 29(3): 196-203 (2005) - [j9]Drago Bokal, Gunnar Brinkmann, Stefan Grünewald:
Chromatic-index-critical graphs of orders 13 and 14. Discret. Math. 300(1-3): 16-29 (2005) - 2004
- [j8]Andreas W. M. Dress, Stefan Grünewald, Dragan Stevanovic:
Semiharmonic graphs with fixed cyclomatic number. Appl. Math. Lett. 17(6): 623-629 (2004) - [j7]Stefan Grünewald, Eckhard Steffen:
Independent sets and 2-factors in edge-chromatic-critical graphs. J. Graph Theory 45(2): 113-118 (2004) - 2003
- [j6]Andreas W. M. Dress, Stefan Grünewald:
Semiharmonic trees and monocyclic graphs. Appl. Math. Lett. 16(8): 1329-1332 (2003) - [j5]Bojana Borovicanin, Stefan Grünewald, Ivan Gutman, Miroslav Petrovic:
Harmonic graphs with small number of cycles. Discret. Math. 265(1-3): 31-44 (2003) - 2002
- [j4]Stefan Grünewald:
Harmonic trees. Appl. Math. Lett. 15(8): 1001-1004 (2002) - 2000
- [j3]Stefan Grünewald:
Chromatic-index critical multigraphs of order 20. J. Graph Theory 33(4): 240-245 (2000)
1990 – 1999
- 1999
- [j2]Stefan Grünewald, Eckhard Steffen:
Cyclically 5-edge connected non-bicritical critical snarks. Discuss. Math. Graph Theory 19(1): 5-11 (1999) - [j1]Stefan Grünewald, Eckhard Steffen:
Chromatic-index-critical graphs of even order. J. Graph Theory 30(1): 27-36 (1999)
Coauthor Index
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-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
