default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnita Pasotti
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Simone Costa, Anita Pasotti:
On the number of non-isomorphic (simple) k-gonal biembeddings of complete multipartite graphs. Ars Math. Contemp. 24(4): 4 (2024)- [j29]Simone Costa, Lorenzo Mella, Anita Pasotti:
Weak Heffter Arrays and Biembedding Graphs on Non-Orientable Surfaces. Electron. J. Comb. 31(1) (2024) - [j28]Mariusz Meszka
, Anita Pasotti, Marco Antonio Pellegrini:
The seating couples problem in the even case. Discret. Math. 347(11): 114182 (2024) - [j27]Marco Buratti, Anita Pasotti:
Heffter spaces. Finite Fields Their Appl. 98: 102464 (2024) - 2022
- [j26]M. A. Ollis, Anita Pasotti, Marco Antonio Pellegrini, John R. Schmitt:
Growable realizations: a powerful approach to the Buratti-Horak-Rosa Conjecture. Ars Math. Contemp. 22(4): 4 (2022) - [j25]Simone Costa, Stefano Della Fiore, Anita Pasotti:
Non-zero sum Heffter arrays and their applications. Discret. Math. 345(9): 112952 (2022) - 2021
- [j24]M. A. Ollis, Anita Pasotti, Marco Antonio Pellegrini, John R. Schmitt:
New methods to attack the Buratti-Horak-Rosa conjecture. Discret. Math. 344(9): 112486 (2021) - [j23]Simone Costa, Anita Pasotti:
On λ-fold relative Heffter arrays and biembedding multigraphs on surfaces. Eur. J. Comb. 97: 103370 (2021) - 2020
- [j22]Simone Costa, Marco Dalai, Anita Pasotti:
A tour problem on a toroidal board. Australas. J Comb. 76: 183-207 (2020) - [j21]Simone Costa, Anita Pasotti, Marco Antonio Pellegrini:
Relative Heffter arrays and biembeddings. Ars Math. Contemp. 18(2): 241-271 (2020)
2010 – 2019
- 2018
- [j20]Simone Costa, Fiorenza Morini, Anita Pasotti, Marco Antonio Pellegrini:
A problem on partial sums in abelian groups. Discret. Math. 341(3): 705-712 (2018) - [j19]Anita Pasotti, Marco Antonio Pellegrini:
Cyclic Uniform 2-Factorizations of the Complete Multipartite Graph. Graphs Comb. 34(5): 901-930 (2018) - 2017
- [j18]Francesca Merola, Anita Pasotti, Marco Antonio Pellegrini:
Cyclic and symmetric hamiltonian cycle systems of the complete multipartite graph: even number of parts. Ars Math. Contemp. 12(2): 219-233 (2017) - 2016
- [j17]Anita Pasotti, Marco Antonio Pellegrini:
A Generalization of the Problem of Mariusz Meszka. Graphs Comb. 32(1): 333-350 (2016) - 2015
- [j16]Anna Benini, Anita Pasotti:
α-labelings of a class of generalized Petersen graphs. Discuss. Math. Graph Theory 35(1): 43-53 (2015) - 2014
- [j15]Anna Benini, Anita Pasotti:
Decompositions of complete multipartite graphs via generalized graceful labelings. Australas. J Comb. 59: 120-143 (2014) - [j14]Anita Pasotti, Marco Antonio Pellegrini:
On the Buratti-Horak-Rosa Conjecture about Hamiltonian Paths in Complete Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j13]Anita Pasotti, Marco Antonio Pellegrini:
A new result on the problem of Buratti, Horak and Rosa. Discret. Math. 319: 1-14 (2014) - 2013
- [j12]Anita Pasotti:
On d-graceful labelings. Ars Comb. 111: 207-223 (2013) - [j11]Marco Buratti, Anita Pasotti, Dianhua Wu:
On optimal (v, 5, 2, 1) optical orthogonal codes. Des. Codes Cryptogr. 68(1-3): 349-371 (2013) - [j10]Anna Benini, Anita Pasotti:
Decompositions of graphs via generalized graceful labelings. Electron. Notes Discret. Math. 40: 39-42 (2013) - [j9]Anita Pasotti, Anna Benini:
Decompositions into generalized Petersen graphs via graceful labelings. Electron. Notes Discret. Math. 40: 295-298 (2013) - 2012
- [j8]Luca Giuzzi, Anita Pasotti:
Sampling complete designs. Discret. Math. 312(3): 488-497 (2012) - 2011
- [j7]Marco Buratti, Koji Momihara, Anita Pasotti:
New results on optimal (v, 4, 2, 1) optical orthogonal codes. Des. Codes Cryptogr. 58(1): 89-109 (2011) - 2010
- [j6]Marco Buratti, Anita Pasotti:
Further progress on difference families with block size 4 or 5. Des. Codes Cryptogr. 56(1): 1-20 (2010) - [j5]Anita Pasotti:
Constructions for cyclic Moebius ladder systems. Discret. Math. 310(22): 3080-3087 (2010) - [j4]Anita Pasotti, Marco Antonio Pellegrini:
Symmetric 1-factorizations of the complete graph. Eur. J. Comb. 31(5): 1410-1418 (2010)
2000 – 2009
- 2009
- [j3]Marco Buratti, Anita Pasotti:
Combinatorial designs and the theorem of Weil on multiplicative character sums. Finite Fields Their Appl. 15(3): 332-344 (2009) - [j2]Anna Benini, Anita Pasotti:
On the Existence of Elementary Abelian Cycle Systems. Graphs Comb. 25(1): 1-14 (2009) - 2008
- [j1]Anita Pasotti:
On equidistance graphs. Australas. J Comb. 42: 229-240 (2008)
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-11-25 23:42 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:
