Pierre-Louis Giscard

Théo Karaboghossian

Eur. J. Comb., October, 2023

Exact solutions for the time-evolution of quantum spin systems under arbitrary waveforms using algebraic graph theory.

[BibT_eX]

[DOI]

Mohammadali Foroozandeh

Comput. Phys. Commun., 2023

2021

Counting walks by their last erased self-avoiding polygons using sieves.

[BibT_eX]

[DOI]

Discret. Math., 2021

Python computations of general Heun functions from their integral series representations.

[BibT_eX]

[DOI]

Tolga Birkandan

Aditya Tamar

CoRR, 2021

2019

Lanczos-like algorithm for the time-ordered exponential: The *-inverse problem.

[BibT_eX]

[DOI]

Stefano Pozza

CoRR, 2019

On the solutions of linear Volterra equations of the second kind with sum kernels.

[BibT_eX]

[DOI]

CoRR, 2019

Lanczos-like method for the time-ordered exponential.

[BibT_eX]

[DOI]

Stefano Pozza

CoRR, 2019

Computing Optimal Assignments in Linear Time for Graph Matching.

[BibT_eX]

[DOI]

CoRR, 2019

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length.

[BibT_eX]

[DOI]

Nils M. Kriege

Algorithmica, 2019

Computing Optimal Assignments in Linear Time for Approximate Graph Matching.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Data Mining, 2019

2018

Enumerating Simple Paths from Connected Induced Subgraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2018

A Hopf algebra for counting cycles.

[BibT_eX]

[DOI]

Discret. Math., 2018

A centrality measure for cycles and subgraphs II.

[BibT_eX]

[DOI]

Appl. Netw. Sci., 2018

2017

Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

The All-Paths and Cycles Graph Kernel.

[BibT_eX]

[DOI]

CoRR, 2017

Loop-centrality in complex networks.

[BibT_eX]

[DOI]

CoRR, 2017

Evaluating balance on social networks from their simple cycles.

[BibT_eX]

[DOI]

J. Complex Networks, 2017

Cycle-Centrality in Economic and Biological Networks.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications VI, 2017

2016

Exact Inference on Gaussian Graphical Models of Arbitrary Topology using Path-Sums.

[BibT_eX]

[DOI]

J. Mach. Learn. Res., 2016

On Valid Optimal Assignment Kernels and Applications to Graph Classification.

[BibT_eX]

[DOI]

Nils M. Kriege

Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2013

Evaluating Matrix Functions by Resummations on Graphs: The Method of Path-Sums.

[BibT_eX]

[DOI]

S. J. Thwaite

D. Jaksch

SIAM J. Matrix Anal. Appl., 2013

2012

A basis for the ensemble of walks on digraphs with non-commuting edge weights

[BibT_eX]

[DOI]

S. J. Thwaite