Werner M. Seiler - Citegraph

Author Info

Name	Affiliation	Papers
WERNER M. SEILER	Interdisciplinary Centre for Scientific Computing, Universitat Heidelberg, 69120 Heidelberg, Germany	37
Collaborators	Citations	PageRank
54	79	17.45
Referers	Referees	References
86	244	201

Search Limit

100244

Publications (37 rows)

Collaborators (54 rows)

Referers (86 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Singularities of algebraic differential equations	0	0.34	2021
Degree Upper Bounds For Involutive Bases	0	0.34	2021
Computing the resolution regularity of bi-homogeneous ideals	0	0.34	2021
A Logic Based Approach to Finding Real Singularities of Implicit Ordinary Differential Equations	0	0.34	2021
Foreword, With A Dedication To Andreas Weber	0	0.34	2021
Dimension and depth dependent upper bounds in polynomial ideal theory.	0	0.34	2020
On the Numerical Analysis and Visualisation of Implicit Ordinary Differential Equations	0	0.34	2020
Algebraic and Geometric Analysis of Singularities of Implicit Differential Equations (Invited Talk).	0	0.34	2020
Deterministic Genericity for Polynomial Ideals.	1	0.36	2018
A Pommaret bases approach to the degree of a polynomial ideal	0	0.34	2018
The SYMBIONT project: symbolic methods for biological networks	0	0.34	2018
Dimension-Dependent Upper Bounds for Grobner Bases.	0	0.34	2017
SC-square: when Satisfiability Checking and Symbolic Computation join forces.	0	0.34	2017
Satisfiability Checking meets Symbolic Computation (Project Paper).	4	0.47	2016
Satisfiability Checking and Symbolic Computation.	0	0.34	2016
Sc2: Satisfiability Checking Meets Symbolic Computation (Project Paper)	0	0.34	2016
Detection of Hopf bifurcations in chemical reaction networks using convex coordinates	8	0.64	2015
On the free resolution induced by a Pommaret basis.	1	0.48	2015
Janet Bases and Resolutions in CoCoALib	0	0.34	2015
Deterministically Computing Reduction Numbers Of Polynomial Ideals	1	0.36	2014
Singularities of Implicit Differential Equations and Static Bifurcations	0	0.34	2013
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates	6	0.50	2013
Computing hopf bifurcations in chemical reaction networks using reaction coordinates	5	0.59	2012
Quasi-stability versus genericity	2	0.42	2012
On Muldowney's criteria for polynomial vector fields with constraints	2	0.40	2011
Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk)	2	0.40	2010
A combinatorial approach to involution and delta-regularity I: involutive bases in polynomial algebras of solvable type	8	0.89	2009
A combinatorial approach to involution and -regularity II: structure analysis of polynomial modules with pommaret bases	15	1.22	2009
Overdetermined Elliptic Systems	4	0.82	2006
Taylor and Lyubeznik resolutions via Gröbner bases	2	0.54	2002
Involutive bases in the Weyl algebra	1	0.39	2002
An Efficient Algebraic Algorithm for the Geometric Completion to Involution	7	0.85	2002
On the numerical analysis of overdetermined linear partial differential systems	2	0.72	2001
Special Issue "Computational Geometry for Differential Equations" Guest Editor's Preface	0	0.34	2001
Indices and Solvability for General Systems of Differential Equations	6	0.76	1999
Numerical integration of constrained Hamiltonian systems using Dirac brackets	2	0.58	1999
Formale Theorie partieller Differentialgleichungen	0	0.34	1991