default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPierre-Louis Giscard
Person information
- affiliation: University of York, UK
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Loïc Foissy, Pierre-Louis Giscard, Cécile Mammez:
A co-preLie structure from chronological loop erasure in graph walks. Eur. J. Comb. 120: 103967 (2024)- 2023
- [j11]Pierre-Louis Giscard
, Mohammadali Foroozandeh:
Exact solutions for the time-evolution of quantum spin systems under arbitrary waveforms using algebraic graph theory. Comput. Phys. Commun. 282: 108561 (2023) - [j10]Jean Fromentin, Pierre-Louis Giscard, Théo Karaboghossian:
Realizable cycle structures in digraphs. Eur. J. Comb. 113: 103748 (2023) - 2021
- [j9]Pierre-Louis Giscard:
Counting walks by their last erased self-avoiding polygons using sieves. Discret. Math. 344(4): 112305 (2021) - [i12]Tolga Birkandan, Pierre-Louis Giscard, Aditya Tamar:
Python computations of general Heun functions from their integral series representations. CoRR abs/2106.13729 (2021)
2010 – 2019
- 2019
- [j8]Pierre-Louis Giscard, Nils M. Kriege, Richard C. Wilson:
A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length. Algorithmica 81(7): 2716-2737 (2019) - [c3]Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson:
Computing Optimal Assignments in Linear Time for Approximate Graph Matching. ICDM 2019: 349-358 - [i11]Nils M. Kriege, Pierre-Louis Giscard, Franka Bause, Richard C. Wilson:
Computing Optimal Assignments in Linear Time for Graph Matching. CoRR abs/1901.10356 (2019) - [i10]Pierre-Louis Giscard, Stefano Pozza:
Lanczos-like method for the time-ordered exponential. CoRR abs/1909.03437 (2019) - [i9]Pierre-Louis Giscard:
On the solutions of linear Volterra equations of the second kind with sum kernels. CoRR abs/1909.04033 (2019) - [i8]Pierre-Louis Giscard, Stefano Pozza:
Lanczos-like algorithm for the time-ordered exponential: The *-inverse problem. CoRR abs/1910.05143 (2019) - 2018
- [j7]Pierre-Louis Giscard, Richard C. Wilson:
A centrality measure for cycles and subgraphs II. Appl. Netw. Sci. 3(1): 9:1-9:15 (2018) - [j6]Pierre-Louis Giscard, Paul Rochet, Richard C. Wilson:
A Hopf algebra for counting cycles. Discret. Math. 341(5): 1439-1448 (2018) - [j5]Pierre-Louis Giscard, Paul Rochet:
Enumerating Simple Paths from Connected Induced Subgraphs. Graphs Comb. 34(6): 1197-1202 (2018) - [i7]Pierre-Louis Giscard, Richard C. Wilson:
A Centrality Measure for Cycles and Subgraphs II. CoRR abs/1802.06065 (2018) - 2017
- [j4]Pierre-Louis Giscard, Paul Rochet, Richard C. Wilson:
Evaluating balance on social networks from their simple cycles. J. Complex Networks 5(5): 750-775 (2017) - [j3]Pierre-Louis Giscard, Paul Rochet:
Algebraic Combinatorics on Trace Monoids: Extending Number Theory to Walks on Graphs. SIAM J. Discret. Math. 31(2): 1428-1453 (2017) - [c2]Pierre-Louis Giscard, Richard C. Wilson:
Cycle-Centrality in Economic and Biological Networks. COMPLEX NETWORKS 2017: 14-28 - [i6]Pierre-Louis Giscard, Richard C. Wilson:
Loop-centrality in complex networks. CoRR abs/1707.00890 (2017) - [i5]Pierre-Louis Giscard, Richard C. Wilson:
The All-Paths and Cycles Graph Kernel. CoRR abs/1708.01410 (2017) - 2016
- [j2]Pierre-Louis Giscard, Z. Choo, S. J. Thwaite, D. Jaksch:
Exact Inference on Gaussian Graphical Models of Arbitrary Topology using Path-Sums. J. Mach. Learn. Res. 17: 71:1-71:19 (2016) - [c1]Nils M. Kriege, Pierre-Louis Giscard, Richard C. Wilson:
On Valid Optimal Assignment Kernels and Applications to Graph Classification. NIPS 2016: 1615-1623 - [i4]Nils M. Kriege, Pierre-Louis Giscard, Richard C. Wilson:
On Valid Optimal Assignment Kernels and Applications to Graph Classification. CoRR abs/1606.01141 (2016) - [i3]Pierre-Louis Giscard, Paul Rochet, Richard C. Wilson:
Evaluating balance on social networks from their simple cycles. CoRR abs/1606.03347 (2016) - [i2]Pierre-Louis Giscard, Nils M. Kriege, Richard C. Wilson:
A general purpose algorithm for counting simple cycles and simple paths of any length. CoRR abs/1612.05531 (2016) - 2013
- [j1]Pierre-Louis Giscard, S. J. Thwaite, D. Jaksch:
Evaluating Matrix Functions by Resummations on Graphs: The Method of Path-Sums. SIAM J. Matrix Anal. Appl. 34(2): 445-469 (2013) - 2012
- [i1]S. J. Thwaite, Pierre-Louis Giscard, D. Jaksch:
A basis for the ensemble of walks on digraphs with non-commuting edge weights. CoRR abs/1202.5523 (2012)
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-09-13 00:41 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:
