A basis for the ensemble of walks on digraphs with non-commuting edge weights - S. J. Thwaite; Pierre-Louis Giscard; D. Jaksch (CoRR, 2012)

Evaluating Matrix Functions by Resummations on Graphs: The Method of Path-Sums. - Pierre-Louis Giscard; S. J. Thwaite; D. Jaksch (SIAM J. Matrix Anal. Appl., 2013)

On Valid Optimal Assignment Kernels and Applications to Graph Classification. - Nils M. Kriege; Pierre-Louis Giscard; Richard C. Wilson 001 (NIPS, 2016)

Exact Inference on Gaussian Graphical Models of Arbitrary Topology using Path-Sums. - Pierre-Louis Giscard; Z. Choo; S. J. Thwaite; D. Jaksch (J. Mach. Learn. Res., 2016)

Cycle-Centrality in Economic and Biological Networks. - Pierre-Louis Giscard; Richard C. Wilson 001 (COMPLEX NETWORKS, 2017)

Evaluating balance on social networks from their simple cycles. - Pierre-Louis Giscard; Paul Rochet; Richard C. Wilson 001 (J. Complex Networks, 2017)

Loop-centrality in complex networks. - Pierre-Louis Giscard; Richard C. Wilson 001 (CoRR, 2017)

The All-Paths and Cycles Graph Kernel. - Pierre-Louis Giscard; Richard C. Wilson 001 (CoRR, 2017)

Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs. - Pierre-Louis Giscard; Paul Rochet (SIAM J. Discret. Math., 2017)

A centrality measure for cycles and subgraphs II. - Pierre-Louis Giscard; Richard C. Wilson 001 (Appl. Netw. Sci., 2018)

A Hopf algebra for counting cycles. - Pierre-Louis Giscard; Paul Rochet; Richard C. Wilson 001 (Discret. Math., 2018)

Enumerating Simple Paths from Connected Induced Subgraphs. - Pierre-Louis Giscard; Paul Rochet (Graphs Comb., 2018)

Computing Optimal Assignments in Linear Time for Approximate Graph Matching. - Nils M. Kriege; Pierre-Louis Giscard; Franka Bause; Richard C. Wilson 001 (ICDM, 2019)

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. - Pierre-Louis Giscard; Nils M. Kriege; Richard C. Wilson 001 (Algorithmica, 2019)

Computing Optimal Assignments in Linear Time for Graph Matching. - Nils M. Kriege; Pierre-Louis Giscard; Franka Bause; Richard C. Wilson 001 (CoRR, 2019)

Lanczos-like method for the time-ordered exponential. - Pierre-Louis Giscard; Stefano Pozza (CoRR, 2019)

On the solutions of linear Volterra equations of the second kind with sum kernels. - Pierre-Louis Giscard (CoRR, 2019)

Lanczos-like algorithm for the time-ordered exponential: The *-inverse problem. - Pierre-Louis Giscard; Stefano Pozza (CoRR, 2019)

Python computations of general Heun functions from their integral series representations. - Tolga Birkandan; Pierre-Louis Giscard; Aditya Tamar (CoRR, 2021)

Counting walks by their last erased self-avoiding polygons using sieves. - Pierre-Louis Giscard (Discret. Math., 2021)

Exact solutions for the time-evolution of quantum spin systems under arbitrary waveforms using algebraic graph theory. - Pierre-Louis Giscard; Mohammadali Foroozandeh (Comput. Phys. Commun., 2023)

Realizable cycle structures in digraphs. - Jean Fromentin; Pierre-Louis Giscard; Théo Karaboghossian (Eur. J. Comb., 2023)

A co-preLie structure from chronological loop erasure in graph walks. - Loïc Foissy; Pierre-Louis Giscard; Cécile Mammez (Eur. J. Comb., 2024)

A ⋆-Product Approach for Analytical and Numerical Solutions of Nonautonomous Linear Fractional Differential Equations. - Fabio Durastante; Pierre-Louis Giscard; Stefano Pozza (CoRR, 2025)