Gerta Rücker

Orcid: 0000-0002-2192-2560

According to our database1, Gerta Rücker authored at least 20 papers between 1990 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
netmeta: An <i>R</i> Package for Network Meta-Analysis Using Frequentist Methods.
J. Stat. Softw., 2023

2021
Network meta-analysis and random walks.
CoRR, 2021

2020
Comment on 'Open is not forever: a study of vanished open access journals'.
CoRR, 2020

2009
copas: An R package for Fitting the Copas Selection Model.
R J., 2009

2007
y-Randomization and Its Variants in QSPR/QSAR.
J. Chem. Inf. Model., 2007

2004
Organic Synthesis - Art or Science?.
J. Chem. Inf. Model., 2004

2003
Walking Backward: Walk Counts of Negative Order.
J. Chem. Inf. Comput. Sci., 2003

2002
Exploring the Limits of Graph Invariant- and Spectrum-Based Discrimination of (Sub)structures.
J. Chem. Inf. Comput. Sci., 2002

2001
Substructure, Subgraph, and Walk Counts as Measures of the Complexity of Graphs and Molecules.
J. Chem. Inf. Comput. Sci., 2001

On Finding Nonisomorphic Connected Subgraphs and Distinct Molecular Substructures.
J. Chem. Inf. Comput. Sci., 2001

On Finding Nonisomorphic Connected Subgraphs and Distinct Molecular Substructures [J. Chem. Inf. Comput. Sci. 41, 314-320 (2001)].
J. Chem. Inf. Comput. Sci., 2001

On Walks in Molecular Graphs.
J. Chem. Inf. Comput. Sci., 2001

2000
Walk Counts, Labyrinthicity, and Complexity of Acyclic and Cyclic Graphs and Molecules.
J. Chem. Inf. Comput. Sci., 2000

1999
On Topological Indices, Boiling Points, and Cycloalkanes.
J. Chem. Inf. Comput. Sci., 1999

1998
Symmetry-Aided Computation of the Detour Matrix and the Detour Index.
J. Chem. Inf. Comput. Sci., 1998

1994
Mathematical Relation between Extended Connectivity and Eigenvector Coefficients.
J. Chem. Inf. Comput. Sci., 1994

1993
Counts of all walks as atomic and molecular descriptors.
J. Chem. Inf. Comput. Sci., 1993

1991
Isocodal and isospectral points, edges, and pairs in graphs and how to cope with them in computerized symmetry recognition.
J. Chem. Inf. Comput. Sci., 1991

On using the adjacency matrix power method for perception of symmetry and for isomorphism testing of highly intricate graphs.
J. Chem. Inf. Comput. Sci., 1991

1990
Computer perception of constitutional (topological) symmetry: TOPSYM, a fast algorithm for partitioning atoms and pairwise relations among atoms into equivalence classes.
J. Chem. Inf. Comput. Sci., 1990


  Loading...