Stefan Grünewald

According to our database1, Stefan Grünewald authored at least 38 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
MuLMS: A Multi-Layer Annotated Text Corpus for Information Extraction in the Materials Science Domain.
CoRR, 2023

MuLMS-AZ: An Argumentative Zoning Dataset for the Materials Science Domain.
CoRR, 2023

2022
MiST: a Large-Scale Annotated Resource and Neural Models for Functions of Modal Verbs in English Scientific Text.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2022, 2022

2021
Maximum Spanning Trees Are Invariant to Temperature Scaling in Graph-based Dependency Parsing.
CoRR, 2021

Coordinate Constructions in English Enhanced Universal Dependencies: Analysis and Computational Modeling.
Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 2021

Negation-Instance Based Evaluation of End-to-End Negation Resolution.
Proceedings of the 25th Conference on Computational Natural Language Learning, 2021

2020
Graph-Based Universal Dependency Parsing in the Age of the Transformer: What Works, and What Doesn't.
CoRR, 2020

RobertNLP at the IWPT 2020 Shared Task: Surprisingly Simple Enhanced UD Parsing for English.
Proceedings of the 16th International Conference on Parsing Technologies and the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies, 2020

2018
Structured sparse <i>K</i>-means clustering via Laplacian smoothing.
Pattern Recognit. Lett., 2018

Statistical testing and power analysis for brain-wide association study.
Medical Image Anal., 2018

Combinatorial properties of triplet covers for binary trees.
Adv. Appl. Math., 2018

Formalisierung von Märchen.
Proceedings of the 5. Tagung des Verbands Digital Humanities im deutschsprachigen Raum, 2018

Generalized chart constraints for efficient PCFG and TAG parsing.
Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, 2018

2014
Quartet-based methods to reconstruct phylogenetic networks.
BMC Syst. Biol., 2014

2013
SuperQ: Computing Supernetworks from Quartets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

BinAligner: a heuristic method to align biological networks.
BMC Bioinform., 2013

2012
SurvNet: a web server for identifying network-based biomarkers that most correlate with patient survival data.
Nucleic Acids Res., 2012

Slim sets of binary trees.
J. Comb. Theory A, 2012

2011
On agreement forests.
J. Comb. Theory A, 2011

Analysis on the reconstruction accuracy of the Fitch method for inferring ancestral states.
BMC Bioinform., 2011

2009
Maximum Parsimony for Tree Mixtures.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Consistency of the QNet algorithm for generating planar split networks from weighted quartets.
Discret. Appl. Math., 2009

Quartets in maximal weakly compatible split systems.
Appl. Math. Lett., 2009

Characterizing weak compatibility in terms of weighted quartets.
Adv. Appl. Math., 2009

2008
Quartet Compatibility and the Quartet Graph.
Electron. J. Comb., 2008

Noisy: Identification of problematic columns in multiple sequence alignments.
Algorithms Mol. Biol., 2008

Constructing Phylogenetic Supernetworks from Quartets.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

2005
Chromatic-index-critical graphs of orders 13 and 14.
Discret. Math., 2005

Integer linear programming as a tool for constructing trees from quartet data.
Comput. Biol. Chem., 2005

Semiharmonic bicyclic graphs.
Appl. Math. Lett., 2005

2004
Independent sets and 2-factors in edge-chromatic-critical graphs.
J. Graph Theory, 2004

Semiharmonic graphs with fixed cyclomatic number.
Appl. Math. Lett., 2004

2003
Harmonic graphs with small number of cycles.
Discret. Math., 2003

Semiharmonic trees and monocyclic graphs.
Appl. Math. Lett., 2003

2002
Harmonic trees.
Appl. Math. Lett., 2002

2000
Chromatic-index critical multigraphs of order 20.
J. Graph Theory, 2000

1999
Chromatic-index-critical graphs of even order.
J. Graph Theory, 1999

Cyclically 5-edge connected non-bicritical critical snarks.
Discuss. Math. Graph Theory, 1999


  Loading...