default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancesc Aguiló
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c4]F. Z. Chriki, E. Simó, Francesc Aguiló, I. Garcia-Milà, X. Masip:
A Deep Learning Framework for Safety Monitoring of a Railway Section. CSR 2024: 1-6- 2023
- [c3]A. Hussain, F. Aguiló-Gost, E. Simó-Mezquita, Eva Marín-Tordera, X. Massip:
An NIDS for Known and Zero-Day Anomalies. DRCN 2023: 1-7 - 2022
- [j24]Pietro Boccaletto
, Filip Stefaniak, Angana Ray, Andrea Cappannini, Sunandan Mukherjee, Elzbieta Purta, Malgorzata Kurkowska, Niloofar Shirvanizadeh, Eliana Destefanis, Paula Groza, Gülben Avsar, Antonia Romitelli, Pinar Pir, Erik Dassi, Silvestro G. Conticello, Francesc Aguiló, Janusz M. Bujnicki:
MODOMICS: a database of RNA modification pathways. 2021 update. Nucleic Acids Res. 50(D1): 2231-235 (2022) - [c2]F. Aguiló-Gost, E. Simó-Mezquita, Eva Marín-Tordera, A. Hussain:
A Machine Learning IDS for Known and Unknown Anomalies. DRCN 2022: 1-5 - 2021
- [j23]Jordi Garcia, Francesc Aguiló, Adrià Asensio, Ester Simó, Marisa Zaragozá, Xavi Masip-Bruin:
Data-flow driven optimal tasks distribution for global heterogeneous systems. Future Gener. Comput. Syst. 125: 792-805 (2021)
2010 – 2019
- 2019
- [c1]Jordi Garcia, Francesc Aguiló, Ester Simó, Marisa Zaragozá, Xavi Masip-Bruin, Yunsong Lu, Andrés Prieto-González, Joan Molinas-Ramón:
A Preliminary Model for Optimal Load Distribution in Heterogeneous Smart Environments. HPSR 2019: 1-6 - 2016
- [j22]Francesc Aguiló, Miguel Angel Fiol, Sonia Pérez:
Abelian Cayley Digraphs with Asymptotically Large Order for Any Given Degree. Electron. J. Comb. 23(2): 2 (2016) - [j21]Francesc Aguiló, Miguel Angel Fiol, Sonia Pérez:
A geometric approach to dense Cayley digraphs of finite Abelian groups. Electron. Notes Discret. Math. 54: 277-282 (2016) - 2015
- [j20]F. Aguiló-Gost, Pedro A. García-Sánchez, David Llena:
On the number of L-shapes in embedding dimension four numerical semigroups. Discret. Math. 338(12): 2168-2178 (2015) - [i1]Francesc Aguiló, Alicia Miralles, Marisa Zaragozá:
Optimal extensions and quotients of 2-Cayley Digraphs. CoRR abs/1505.06010 (2015) - 2014
- [j19]F. Aguiló-Gost, Pedro A. García-Sánchez, David Llena:
Denumerants of 3-numerical semigroups. Electron. Notes Discret. Math. 46: 3-10 (2014) - [j18]F. Aguiló-Gost, Pedro A. García-Sánchez, David Llena:
An algorithm to compute the primitive elements of an embedding dimension three numerical semigroup. Electron. Notes Discret. Math. 46: 185-192 (2014) - 2010
- [j17]F. Aguiló-Gost, Pedro A. García-Sánchez:
Factoring in Embedding Dimension Three Numerical Semigroups. Electron. J. Comb. 17(1) (2010)
2000 – 2009
- 2009
- [j16]F. Aguiló-Gost, Pedro A. García-Sánchez:
Factorization and catenary degree in 3-generated numerical semigroups. Electron. Notes Discret. Math. 34: 157-161 (2009) - 2007
- [j15]F. Aguiló-Gost, Alicia Miralles, Marisa Zaragozá:
Some contributions to the Frobenius' Problem. Electron. Notes Discret. Math. 28: 61-68 (2007) - [j14]F. Aguiló-Gost:
Sets of Gaps in Sequences of Frobenius' Problems with 3 Elements. Electron. Notes Discret. Math. 29: 231-236 (2007) - 2006
- [j13]F. Aguiló-Gost, Alicia Miralles, Marisa Zaragozá:
Using Double-Loop digraphs for solving Frobenius' Problems. Electron. Notes Discret. Math. 24: 17-24 (2006) - 2005
- [j12]Francesc Aguiló, Ester Simó, Marisa Zaragozá:
On Dense Triple-Loop Networks. Ars Comb. 74 (2005) - 2004
- [j11]Francesc Aguiló, D. Arteaga, I. Diego:
A symbolical algorithm on additive basis and double-loop networks. Theor. Comput. Sci. 319(1-3): 423-439 (2004) - 2003
- [j10]Francesc Aguiló, Ester Simó, Marisa Zaragozá:
Optimal Double-Loop Networks with Non-Unit Steps. Electron. J. Comb. 10 (2003) - 2002
- [j9]F. Aguiló-Gost:
A C.A.S. treatment of optimal-diameter double-loop digraphs families. Electron. Notes Discret. Math. 11: 1-11 (2002) - 2001
- [j8]Francesc Aguiló, I. Diego:
Discrete dynamics over double commutative-step digraphs. Discret. Math. 231(1-3): 57-72 (2001) - [j7]Francesc Aguiló, Ester Simó, Marisa Zaragozá:
On Dense Triple-Loop Networks. Electron. Notes Discret. Math. 10: 261-264 (2001) - 2000
- [j6]Francesc Aguiló, J. Gonzalez, Ester Simó, Marisa Zaragozá:
Broadcasting in Odd Graphs. Ars Comb. 56 (2000) - [j5]Francesc Aguiló, Miguel Angel Fiol, Maria Lluisa Fiol:
Periodic Tilings as a Dissection Method. Am. Math. Mon. 107(4): 341-352 (2000)
1990 – 1999
- 1999
- [j4]F. Aguiló-Gost:
New dense families of triple loop networks. Discret. Math. 197-198: 15-27 (1999) - 1997
- [j3]Francesc Aguiló, Miguel Angel Fiol, C. Garcia:
Triple loop networks with small transmission delay. Discret. Math. 167-168: 3-16 (1997) - 1995
- [j2]Francesc Aguiló, Miguel Angel Fiol:
An efficient algorithm to find optimal double loop networks. Discret. Math. 138(1-3): 15-29 (1995) - 1993
- [j1]Pilar Esqué, Francesc Aguiló, Miguel Angel Fiol:
Double commutative-step digraphs with minimum diameters. Discret. Math. 114(1-3): 147-157 (1993)
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-10-02 21:36 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:
