default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAna Paulina Figueroa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Ana Paulina Figueroa, Juan José Montellano-Ballesteros
, Mika Olsen:
Partition of regular balanced c-tournaments into strongly connected c-tournaments. Discret. Math. 346(7): 113459 (2023)- 2022
- [j13]Bernardo M. Ábrego, Silvia Fernández-Merchant, Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Eduardo Rivera-Campo:
The Crossing Number of Twisted Graphs. Graphs Comb. 38(5): 134 (2022)
2010 – 2019
- 2017
- [j12]Ana Paulina Figueroa, César Hernández-Cruz, Mika Olsen:
The minimum feedback arc set problem and the acyclic disconnection for graphs. Discret. Math. 340(7): 1514-1521 (2017) - 2016
- [j11]Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Mika Olsen:
Strong subtournaments and cycles of multipartite tournaments. Discret. Math. 339(11): 2793-2803 (2016) - 2015
- [j10]Ana Paulina Figueroa, Eduardo Rivera-Campo:
A counterexample to a result on the tree graph of a graph. Australas. J Comb. 63: 368-373 (2015) - [j9]Ana Paulina Figueroa, Mika Olsen, Rita Zuazua:
On the vertices of a 3-partite tournament not in triangles. Discret. Math. 338(11): 1982-1988 (2015) - 2012
- [j8]Ana Paulina Figueroa, Mika Olsen:
The tight bound on the number of C_3-free vertices on regular 3-partite tournaments. Australas. J Comb. 52: 209-214 (2012) - [j7]Ana Paulina Figueroa, Bernardo Llano, Mika Olsen, Eduardo Rivera-Campo:
On the acyclic disconnection of multipartite tournaments. Discret. Appl. Math. 160(10-11): 1524-1531 (2012) - [j6]Ana Paulina Figueroa, Eduardo Rivera-Campo:
The basis graph of a bicolored matroid. Discret. Appl. Math. 160(18): 2694-2697 (2012) - 2010
- [j5]Ana Paulina Figueroa, Bernardo Llano:
An infinite family of self-diclique digraphs. Appl. Math. Lett. 23(5): 630-632 (2010) - [j4]Ana Paulina Figueroa, Bernardo Llano, Rita Zuazua:
The number of C3-free vertices on 3-partite tournaments. Discret. Math. 310(19): 2482-2488 (2010)
2000 – 2009
- 2009
- [j3]Ana Paulina Figueroa:
A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs. Comput. Geom. 42(1): 90-91 (2009) - [j2]Ana Paulina Figueroa, Eduardo Rivera-Campo:
On the basis graph of a bicolored matroid. Electron. Notes Discret. Math. 35: 269-273 (2009) - 2008
- [j1]Ana Paulina Figueroa, Eduardo Rivera-Campo:
On the tree graph of a connected graph. Discuss. Math. Graph Theory 28(3): 501-510 (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 2025-01-09 12:52 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:
