default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLorenzo Traldi
Person information
- affiliation: Lafayette College, Department of Mathematics, Easton, PA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j35]Lorenzo Traldi:
A note on geometric duality in matroid theory and knot theory. Discret. Appl. Math. 320: 184-190 (2022)- [j34]Robert Brijder, Lorenzo Traldi:
A characterization of circle graphs in terms of total unimodularity. Eur. J. Comb. 102: 103455 (2022) - 2020
- [j33]Robert Brijder, Lorenzo Traldi:
A Characterization of Circle Graphs in Terms of Multimatroid Representations. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2018
- [j32]Spencer Backman, Sam Hopkins
, Lorenzo Traldi:
Fourientation activities and the Tutte polynomial. Eur. J. Comb. 67: 40-60 (2018) - 2017
- [j31]Robert Brijder, Lorenzo Traldi:
Isotropic Matroids III: Connectivity. Electron. J. Comb. 24(2): 2 (2017) - [j30]Lorenzo Traldi:
Notes on a theorem of Naji. Discret. Math. 340(1): 3217-3234 (2017) - 2016
- [j29]Robert Brijder, Lorenzo Traldi:
Isotropic Matroids I: Multimatroids and Neighborhoods. Electron. J. Comb. 23(4): 4 (2016) - [j28]Robert Brijder, Lorenzo Traldi:
Isotropic Matroids II: Circle Graphs. Electron. J. Comb. 23(4): 4 (2016) - [j27]Lorenzo Traldi:
Splitting cubic circle graphs. Discuss. Math. Graph Theory 36(3): 723-741 (2016) - 2015
- [j26]Lorenzo Traldi:
Binary matroids and local complementation. Eur. J. Comb. 45: 21-40 (2015) - [j25]Lorenzo Traldi:
The transition matroid of a 4-regular graph: An introduction. Eur. J. Comb. 50: 180-207 (2015) - 2014
- [j24]Lorenzo Traldi:
Interlacement in 4-regular graphs: a new approach using nonsymmetric matrices. Contributions Discret. Math. 9(1) (2014) - 2013
- [j23]Lorenzo Traldi, Robert Brijder, Hendrik Jan Hoogeboom:
The Adjacency Matroid of a Graph. Electron. J. Comb. 20(3): 27 (2013) - [j22]Lorenzo Traldi:
On the interlace polynomials. J. Comb. Theory B 103(1): 184-208 (2013) - 2012
- [j21]Eric Gilson, Chelsey Cooley, William Ella, Michael Follett, Lorenzo Traldi:
The Efron dice voting system. Soc. Choice Welf. 39(4): 931-959 (2012) - 2011
- [j20]Lorenzo Traldi:
Binary nullity, Euler circuits and interlace polynomials. Eur. J. Comb. 32(6): 944-950 (2011) - 2010
- [j19]Michael Dinitz, Jonah M. Gold, Thomas C. Sharkey, Lorenzo Traldi:
Graphical representations of clutters. Ars Comb. 94 (2010) - [j18]Lorenzo Traldi:
Weighted Interlace Polynomials. Comb. Probab. Comput. 19(1): 133-157 (2010) - [j17]C. Anderson, Jonathan Cutler, A. J. Radcliffe, Lorenzo Traldi:
On the interlace polynomials of forests. Discret. Math. 310(1): 31-36 (2010)
2000 – 2009
- 2009
- [j16]Blerta Shtylla, Lorenzo Traldi, Louis Zulli:
On the realization of double occurrence words. Discret. Math. 309(6): 1769-1773 (2009) - 2006
- [j15]Joanna A. Ellis-Monaghan, Lorenzo Traldi:
Parametrized Tutte Polynomials of Graphs and Matroids. Comb. Probab. Comput. 15(6): 835-854 (2006) - [j14]Lorenzo Traldi:
On the colored Tutte polynomial of a graph of bounded treewidth. Discret. Appl. Math. 154(6): 1032-1036 (2006) - [j13]Lorenzo Traldi:
Non-minimal sums of disjoint products. Reliab. Eng. Syst. Saf. 91(5): 533-538 (2006) - 2005
- [j12]Jonah Blasiak, Jennifer M. Rowe, Lorenzo Traldi, Oded Yacobi:
Several definitions of matroids. Ars Comb. 77 (2005) - [j11]Lorenzo Traldi:
Parallel connections and coloured Tutte polynomials. Discret. Math. 290(2/3): 291-299 (2005) - 2004
- [j10]Lorenzo Traldi:
A Subset Expansion of the Coloured Tutte Polynomial. Comb. Probab. Comput. 13(2): 269-275 (2004) - 2003
- [j9]Alexandru O. Balan, Lorenzo Traldi:
Preprocessing minpaths for sum of disjoint products. IEEE Trans. Reliab. 52(3): 289-295 (2003) - 2002
- [j8]Lorenzo Traldi:
Chain polynomials and Tutte polynomials. Discret. Math. 248(1-3): 279-282 (2002) - 2000
- [j7]Lorenzo Traldi:
Series and parallel reductions for the Tutte polynomial. Discret. Math. 220(1-3): 291-297 (2000) - [j6]Lorenzo Traldi:
Commentary on: reliability polynomials and link importance in networks. IEEE Trans. Reliab. 49(3): 322 (2000)
1990 – 1999
- 1997
- [j5]José Rodríguez, Lorenzo Traldi:
(K, j)-domination and (K, j)-reliability. Networks 30(4): 293-306 (1997) - 1994
- [j4]Lorenzo Traldi:
Generalized activities and K-terminal reliability. II. Discret. Math. 135(1-3): 381-385 (1994) - 1993
- [j3]Lorenzo Traldi:
On the star - delta transformation in network reliability. Networks 23(3): 151-157 (1993) - 1991
- [j2]Lorenzo Traldi:
Generalized activities and K-terminal reliability. Discret. Math. 96(2): 131-149 (1991) - 1990
- [j1]Gary Gordon, Lorenzo Traldi:
Generalized activities and the tutte polynomial. Discret. Math. 85(2): 167-176 (1990)
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 2025-03-22 00:06 CET 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:
