Daniel Simson

According to our database1, Daniel Simson authored at least 32 papers between 2006 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm.
Discret. Appl. Math., 2019

2017
Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops.
Fundam. Informaticae, 2017

2016
Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups.
Fundam. Informaticae, 2016

Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification.
Fundam. Informaticae, 2016

2015
Algorithms for Isotropy Groups of Cox-regular Edge-bipartite Graphs.
Fundam. Informaticae, 2015

Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, II. Application to Coxeter Spectral Analysis.
Fundam. Informaticae, 2015

Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems.
Fundam. Informaticae, 2015

On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams.
Eur. J. Comb., 2015

Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs.
Discret. Appl. Math., 2015

2014
Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups.
J. Comput. Appl. Math., 2014

On Corank Two Edge-Bipartite Graphs and Simply Extended Euclidean Diagrams.
Proceedings of the 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2014

2013
A Coxeter-Gram Classification of Positive Simply Laced Edge-Bipartite Graphs.
SIAM J. Discret. Math., 2013

A Framework for Coxeter Spectral Classification of Finite Posets and Their Mesh Geometries of Roots.
Int. J. Math. Math. Sci., 2013

Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$.
Fundam. Informaticae, 2013

A Framework for Coxeter Spectral Analysis of Edge-bipartite Graphs, their Rational Morsifications and Mesh Geometries of Root Orbits.
Fundam. Informaticae, 2013

Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams.
Fundam. Informaticae, 2013

An inflation algorithm and a toroidal mesh algorithm for edge-bipartite graphs.
Electron. Notes Discret. Math., 2013

On Coxeter spectral classification of P-critical edge-bipartite graphs of Euclidean type A<sub>n</sub>.
Electron. Notes Discret. Math., 2013

On Coxeter spectral study of finite posets using computer algebra tools.
Electron. Notes Discret. Math., 2013

On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram <i>A</i><sub><i>n</i></sub>.
Discret. Math., 2013

Algorithmic Experiences in Coxeter Spectral Study of P-critical Edge-Bipartite Graphs and Posets.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

On Computing Non-negative Loop-Free Edge-Bipartite Graphs.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

On Coxeter Type Classification of Loop-Free Edge-Bipartite Graphs and Matrix Morsifications.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

2012
On Coxeter Spectral Study of Posets and a Digraph Isomorphism Problem.
Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

On Computing Mesh Root Systems and the Isotropy Group for Simply-laced Dynkin Diagrams.
Proceedings of the 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2012

On Coxeter Spectral Study of Edge-bipartite Graphs in Relation with Dynkin Diagrams.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots.
Fundam. Informaticae, 2011

Symbolic and numerical computation in determining P-critical unit forms and Tits P-critical posets.
Electron. Notes Discret. Math., 2011

Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets.
Electron. Notes Discret. Math., 2011

Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++.
Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

2008
An Algorithmic Solution of a Birkhoff Type Problem.
Fundam. Informaticae, 2008

2006
Irreducible morphisms, the Gabriel-valued quiver and colocalizations for coalgebras.
Int. J. Math. Math. Sci., 2006


  Loading...