default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiquel Rius-Font
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2015
[j11]Rikio Ichishima, Francesc A. Muntaner-Batle, Miquel Rius-Font:
Bounds on the size of super edge-magic graphs depending on the girth. Ars Comb. 119: 129-133 (2015)- 2014
- [j10]Ali Ahmad, Francesc A. Muntaner-Batle, Miquel Rius-Font:
On the product Cmxh {Cn, Cn} and other related topics. Ars Comb. 117: 303-310 (2014) - 2013
- [j9]Susana-Clara López
, Francesc A. Muntaner-Batle, Miquel Rius-Font:
Labeling constructions using digraph products. Discret. Appl. Math. 161(18): 3005-3016 (2013) - [j8]Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miquel Rius-Font, Francisco José Romero-Campero:
A polynomial alternative to unbounded environment for tissue P systems with cell division. Int. J. Comput. Math. 90(4): 760-775 (2013) - 2012
- [j7]Rikio Ichishima, Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
The power of digraph products applied to labelings. Discret. Math. 312(2): 221-228 (2012) - 2011
- [j6]Yunyun Niu, Linqiang Pan, Mario J. Pérez-Jiménez, Miquel Rius-Font:
A Tissue P Systems Based Uniform Solution to Tripartite Matching Problem. Fundam. Informaticae 109(2): 179-188 (2011) - [j5]Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miquel Rius-Font, Francisco José Romero-Campero:
Looking for Small Efficient P Systems. Fundam. Informaticae 110(1-4): 295-308 (2011) - [j4]Ignacio Pérez-Hurtado, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miguel Angel Gutiérrez-Naranjo, Miquel Rius-Font:
On a Partial Affirmative Answer for a Păun's Conjecture. Int. J. Found. Comput. Sci. 22(1): 55-64 (2011) - [j3]Susana-Clara López, Francesc A. Muntaner-Batle, Miquel Rius-Font:
Super Edge-Magic Models. Math. Comput. Sci. 5(1): 63-68 (2011) - 2009
- [j2]Mónica Cardona-Roca, M. Àngels Colomer, Agustín Riscos-Núñez, Miquel Rius-Font:
P Systems Computing the Period of Irreducible Markov Chains. Int. J. Comput. Commun. Control 4(3): 291-300 (2009) - 2008
- [j1]Francesc A. Muntaner-Batle, Miquel Rius-Font:
On the structure of paths-like trees. Discuss. Math. Graph Theory 28(2): 249-265 (2008)
Conference and Workshop Papers
- 2013
- [c3]Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miquel Rius-Font, Luis Valencia-Cabrera:
The Relevance of the Environment on the Efficiency of Tissue P Systems. Int. Conf. on Membrane Computing 2013: 308-321 - 2012
- [c2]Luis F. Macías-Ramos, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez, Miquel Rius-Font, Luis Valencia-Cabrera:
The Efficiency of Tissue P Systems with Cell Separation Relies on the Environment. Int. Conf. on Membrane Computing 2012: 243-256 - 2009
- [c1]Rosa Gutiérrez-Escudero, Mario J. Pérez-Jiménez, Miquel Rius-Font:
Characterizing Tractability by Tissue-Like P Systems. Workshop on Membrane Computing 2009: 289-300
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-01-09 13:07 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:
