default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Simson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j24]Bartosz Makuracki
, Daniel Simson:
A Gram classification of principal Cox-regular edge-bipartite graphs via inflation algorithm. Discret. Appl. Math. 253: 25-36 (2019)- 2017
- [j23]Bartosz Makuracki, Daniel Simson, Blazej Zyglarski:
Inflation Agorithm for Cox-regular Postive Edge-bipartite Graphs with Loops. Fundam. Informaticae 153(4): 367-398 (2017) - 2016
- [j22]Daniel Simson:
Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, I. A Gram Classification. Fundam. Informaticae 145(1): 19-48 (2016) - [j21]Daniel Simson:
Symbolic Algorithms Computing Gram Congruences in the Coxeter Spectral Classification of Edge-bipartite Graphs, II. Isotropy Mini-groups. Fundam. Informaticae 145(1): 49-80 (2016) - 2015
- [j20]Mariusz Felisiak, Daniel Simson:
Applications of matrix morsifications to Coxeter spectral study of loop-free edge-bipartite graphs. Discret. Appl. Math. 192: 49-64 (2015) - [j19]Marcin Gasiorek, Daniel Simson, Katarzyna Zajac:
On Coxeter type study of non-negative posets using matrix morsifications and isotropy groups of Dynkin and Euclidean diagrams. Eur. J. Comb. 48: 127-142 (2015) - [j18]Stanislaw Kasjan, Daniel Simson:
Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, I. Mesh Root Systems. Fundam. Informaticae 139(2): 153-184 (2015) - [j17]Stanislaw Kasjan, Daniel Simson:
Mesh Algorithms for Coxeter Spectral Classification of Cox-regular Edge-bipartite Graphs with Loops, II. Application to Coxeter Spectral Analysis. Fundam. Informaticae 139(2): 185-209 (2015) - [j16]Stanislaw Kasjan, Daniel Simson:
Algorithms for Isotropy Groups of Cox-regular Edge-bipartite Graphs. Fundam. Informaticae 139(3): 249-275 (2015) - 2014
- [j15]Rafal Bocian, Mariusz Felisiak, Daniel Simson:
Numeric and mesh algorithms for the Coxeter spectral study of positive edge-bipartite graphs and their isotropy groups. J. Comput. Appl. Math. 259: 815-827 (2014) - [c8]Marcin Gasiorek, Daniel Simson, Katarzyna Zajac:
On Corank Two Edge-Bipartite Graphs and Simply Extended Euclidean Diagrams. SYNASC 2014: 66-73 - 2013
- [j14]Mariusz Felisiak, Daniel Simson:
On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram An. Discret. Math. 313(11): 1358-1367 (2013) - [j13]Marcin Gasiorek, Daniel Simson, Katarzyna Zajac:
On Coxeter spectral study of finite posets using computer algebra tools. Electron. Notes Discret. Math. 40: 121-127 (2013) - [j12]Agnieszka Polak, Daniel Simson:
On Coxeter spectral classification of P-critical edge-bipartite graphs of Euclidean type An. Electron. Notes Discret. Math. 40: 311-316 (2013) - [j11]Daniel Simson, Katarzyna Zajac:
An inflation algorithm and a toroidal mesh algorithm for edge-bipartite graphs. Electron. Notes Discret. Math. 40: 377-383 (2013) - [j10]Daniel Simson:
Algorithms Determining Matrix Morsifications, Weyl orbits, Coxeter Polynomials and Mesh Geometries of Roots for Dynkin Diagrams. Fundam. Informaticae 123(4): 447-490 (2013) - [j9]Daniel Simson:
A Framework for Coxeter Spectral Analysis of Edge-bipartite Graphs, their Rational Morsifications and Mesh Geometries of Root Orbits. Fundam. Informaticae 124(3): 309-338 (2013) - [j8]Daniel Simson:
Toroidal Algorithms for Mesh Geometries of Root Orbits of the Dynkin Diagram $\mathbb{D}_4$. Fundam. Informaticae 124(3): 339-364 (2013) - [j7]Daniel Simson, Katarzyna Zajac:
A Framework for Coxeter Spectral Classification of Finite Posets and Their Mesh Geometries of Roots. Int. J. Math. Math. Sci. 2013: 743734:1-743734:22 (2013) - [j6]Daniel Simson:
A Coxeter-Gram Classification of Positive Simply Laced Edge-Bipartite Graphs. SIAM J. Discret. Math. 27(2): 827-854 (2013) - [c7]Grzegorz Marczak, Daniel Simson, Katarzyna Zajac:
On Computing Non-negative Loop-Free Edge-Bipartite Graphs. SYNASC 2013: 68-75 - [c6]Rafal Bocian, Mariusz Felisiak, Daniel Simson:
On Coxeter Type Classification of Loop-Free Edge-Bipartite Graphs and Matrix Morsifications. SYNASC 2013: 115-118 - [c5]Agnieszka Polak, Daniel Simson:
Algorithmic Experiences in Coxeter Spectral Study of P-critical Edge-Bipartite Graphs and Posets. SYNASC 2013: 375-382 - 2012
- [c4]Mariusz Felisiak, Daniel Simson:
On Coxeter Spectral Study of Edge-bipartite Graphs in Relation with Dynkin Diagrams. CTW 2012: 125-129 - [c3]Mariusz Felisiak, Daniel Simson:
On Computing Mesh Root Systems and the Isotropy Group for Simply-laced Dynkin Diagrams. SYNASC 2012: 91-97 - [c2]Marcin Gasiorek, Daniel Simson, Katarzyna Zajac:
On Coxeter Spectral Study of Posets and a Digraph Isomorphism Problem. SYNASC 2012: 369-375 - 2011
- [j5]Marcin Gasiorek, Daniel Simson:
Programming in PYTHON and an algorithmic description of positive wandering on one-peak posets. Electron. Notes Discret. Math. 38: 419-424 (2011) - [j4]Agnieszka Polak, Daniel Simson:
Symbolic and numerical computation in determining P-critical unit forms and Tits P-critical posets. Electron. Notes Discret. Math. 38: 723-730 (2011) - [j3]Daniel Simson:
Mesh Algorithms for Solving Principal Diophantine Equations, Sand-glass Tubes and Tori of Roots. Fundam. Informaticae 109(4): 425-462 (2011) - [c1]Mariusz Felisiak, Daniel Simson:
Experiences in Computing Mesh Root Systems for Dynkin Diagrams Using Maple and C++. SYNASC 2011: 83-86
2000 – 2009
- 2008
- [j2]Daniel Simson, Mariusz Wojewódzki:
An Algorithmic Solution of a Birkhoff Type Problem. Fundam. Informaticae 83(4): 389-410 (2008) - 2006
- [j1]Daniel Simson:
Irreducible morphisms, the Gabriel-valued quiver and colocalizations for coalgebras. Int. J. Math. Math. Sci. 2006: 47146:1-47146:16 (2006)
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-04-24 23:13 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:
