default search action
Eduardo Rivera-Campo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j40]Juan José Montellano-Ballesteros
, Eduardo Rivera-Campo, Ricardo Strausz:
On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs. Graphs Comb. 38(1): 12 (2022) - [j39]Bernardo M. Ábrego, Silvia Fernández-Merchant
The Crossing Number of Twisted Graphs. Graphs Comb. 38(5): 134 (2022)
2010 – 2019
- 2019
- [j38]Magdalena Lemanska, Eduardo Rivera-Campo, Radoslaw Ziemann, Rita Zuazua, Pawel Zylinski
Convex dominating sets in maximal outerplanar graphs. Discret. Appl. Math. 265: 142-157 (2019) - 2017
- [j37]Ferran Hurtado, Mercè Mora
Distance 2-domination in prisms of graphs. Discuss. Math. Graph Theory 37(2): 383-397 (2017) - [j36]Ferran Hurtado, Eduardo Rivera-Campo:
On Contractible Edges in Convex Decompositions. J. Inf. Process. 25: 537-541 (2017) - [j35]Julián Fresán-Figueroa, Eduardo Rivera-Campo:
On the Fixed Degree Tree Graph. J. Inf. Process. 25: 616-620 (2017) - [j34]Diego González-Moreno
A Note on the Feedback Arc Set Problem and Acyclic Subdigraphs in Bipartite Tournaments. J. Interconnect. Networks 17(3-4): 1741004:1-1741004:9 (2017) - 2016
- [j33]Juan José Montellano-Ballesteros
On Heterochromatic Out-directed Spanning Trees in Tournaments. Graphs Comb. 32(1): 323-332 (2016) - 2015
- [j32]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) - 2013
- [j31]Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A sufficient condition for the existence of plane spanning trees on geometric graphs. Comput. Geom. 46(1): 1-6 (2013) - [j30]Juan José Montellano-Ballesteros
On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids. Graphs Comb. 29(5): 1517-1522 (2013) - 2012
- [j29]Eduardo Rivera-Campo:
Spanning trees with small degrees and few leaves. Appl. Math. Lett. 25(10): 1444-1446 (2012) - [j28]Ana Paulina Figueroa
On the acyclic disconnection of multipartite tournaments. Discret. Appl. Math. 160(10-11): 1524-1531 (2012) - [j27]Ana Paulina Figueroa
The basis graph of a bicolored matroid. Discret. Appl. Math. 160(18): 2694-2697 (2012) - [i1]Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A sufficient condition for the existence of plane spanning trees on geometric graphs. CoRR abs/1202.3385 (2012) - 2011
- [c12]Elsa Omaña-Pulido, Eduardo Rivera-Campo:
Notes on the Twisted Graph. EGC 2011: 119-125
2000 – 2009
- 2009
- [j26]Ana Paulina Figueroa
On the basis graph of a bicolored matroid. Electron. Notes Discret. Math. 35: 269-273 (2009) - 2008
- [j25]Manuel Abellanas, Prosenjit Bose
On local transformations in plane geometric graphs embedded on small grids. Comput. Geom. 39(2): 65-77 (2008) - [j24]Juan José Montellano-Ballesteros
On a heterochromatic number for hypercubes. Discret. Math. 308(16): 3441-3448 (2008) - [j23]Ana Paulina Figueroa, Eduardo Rivera-Campo:
On the tree graph of a connected graph. Discuss. Math. Graph Theory 28(3): 501-510 (2008) - [j22]Bernardo Llano, Juan José Montellano-Ballesteros
On conjectures of Frankl and El-Zahar. J. Graph Theory 57(4): 344-352 (2008) - 2006
- [j21]Prosenjit Bose
Partitions of complete geometric graphs into plane trees. Comput. Geom. 34(2): 116-125 (2006) - 2005
- [j20]Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph. Ars Comb. 75 (2005) - [j19]Michael E. Houle, Ferran Hurtado, Marc Noy, Eduardo Rivera-Campo:
Graphs of Triangulations and Perfect Matchings. Graphs Comb. 21(3): 325-331 (2005) - 2004
- [j18]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A note on minimally 3-connected graphs. Discuss. Math. Graph Theory 24(1): 115-123 (2004) - [j17]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A Note on Convex Decompositions of a Set of Points in the Plane. Graphs Comb. 20(2): 223-231 (2004) - [c11]Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
Partitions of Complete Geometric Graphs into Plane Trees. GD 2004: 71-81 - [c10]Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro A. Ramos, Eduardo Rivera-Campo, Javier Tejel:
On Local Transformations in Plane Geometric Graphs Embedded on Small Grids. ICCSA (3) 2004: 22-31 - 2003
- [j16]Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
On a tree graph defined by a set of cycles. Discret. Math. 271(1-3): 303-310 (2003) - 2001
- [j15]Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
Hamilton cycles in the path graph of a set of points in convex position. Comput. Geom. 18(2): 65-72 (2001)
1990 – 1999
- 1999
- [j14]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A note on covering the edges of a graph with bonds. Discret. Math. 197-198: 633-636 (1999) - [c9]Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A note on the path graph of a set of points in convex position in the plane. CCCG 1999 - 1998
- [j13]János Pach, Eduardo Rivera-Campo:
On circumscribing polygons for line segments. Comput. Geom. 10(2): 121-124 (1998) - [c8]Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia:
Perfect divisions of a cake. CCCG 1998 - [c7]Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages. SCG 1998: 409-410 - [c6]Jin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane. JCDCG 1998: 1-13 - [c5]Eduardo Rivera-Campo:
A Note on the Existence of Plane Spanning Trees of Geometric Graphs. JCDCG 1998: 274-277 - 1997
- [j12]Hazel Everett, Eduardo Rivera-Campo:
Edge Guarding Polyhedral Terrains. Comput. Geom. 7: 201-203 (1997) - [j11]Victor Neumann-Lara, Eduardo Rivera-Campo:
Euler tours and a game with dominoes. Discret. Math. 167-168: 511-517 (1997) - [j10]Eduardo Rivera-Campo:
A Note on Matchings and Spanning Trees with Bounded Degrees. Graphs Comb. 13(2): 159-165 (1997) - [c4]Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A note on the tree graph of a set of points in the plane. CCCG 1997 - 1995
- [j9]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
On illuminating line segments in the plane. Discret. Math. 137(1-3): 147-153 (1995) - [j8]Eduardo Rivera-Campo:
A note on coverings of plane graphs. J. Graph Theory 20(4): 441-445 (1995) - 1994
- [j7]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro
Guarding rectangular art galleries. Discret. Appl. Math. 50(2): 149-157 (1994) - [j6]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Separation of Convex Sets. Discret. Appl. Math. 51(3): 325-328 (1994) - [j5]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Protecting convex sets. Graphs Comb. 10(2-4): 311-321 (1994) - [c3]Hazel Everett, Eduardo Rivera-Campo:
Edge Guarding a Triangulated Polyhedral Terrain. CCCG 1994: 293-295 - 1993
- [j4]Eduardo Rivera-Campo, Jenö Töröcsik:
On Separation of Plane Convex Sets. Eur. J. Comb. 14(2): 113-116 (1993) - [j3]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Illuminating Rectangles and Triangles in the Plane. J. Comb. Theory B 57(1): 1-17 (1993) - [c2]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia:
Optimal Floodlight Illumination of Stages. CCCG 1993: 393-398 - 1992
- [j2]Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks:
Separating Convex Sets in the Plane. Discret. Comput. Geom. 7: 189-195 (1992) - 1991
- [j1]Victor Neumann-Lara, Eduardo Rivera-Campo:
Spanning trees with bounded degrees. Comb. 11(1): 55-61 (1991) - [c1]Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro
Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112
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-07-03 20:41 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: