default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJazmín Romero
Person information
- affiliation: David R. Cheriton School of Computer Science, University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2015
[b1]Jazmín Romero:
Generalized Set and Graph Packing Problems. University of Waterloo, Ontario, Canada, 2015
Journal Articles
- 2018
- [j3]Alejandro López-Ortiz, Cynthia B. Pérez, Jazmín Romero:
Arbitrary Overlap Constraints in Graph Packing Problems. Int. J. Found. Comput. Sci. 29(1): 101-122 (2018) - 2015
- [j2]Henning Fernau
, Alejandro López-Ortiz, Jazmín Romero:
Using Parametric Transformations Toward Polynomial Kernels for Packing Problems Allowing Overlaps. ACM Trans. Comput. Theory 7(3): 13:1-13:29 (2015) - 2014
- [j1]Alejandro López-Ortiz, Jazmín Romero:
Parameterized Algorithms for the H-Packing with t-Overlap Problem. J. Graph Algorithms Appl. 18(4): 515-538 (2014)
Conference and Workshop Papers
- 2015
- [c7]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. TAMC 2015: 415-427 - 2014
- [c6]Jazmín Romero, Alejandro López-Ortiz:
A Parameterized Algorithm for Packing Overlapping Subgraphs. CSR 2014: 325-336 - [c5]Jazmín Romero, Alejandro López-Ortiz:
The ${\mathcal{G}}$ -Packing with t-Overlap Problem. WALCOM 2014: 114-124 - 2013
- [c4]Francisco Claude, Reza Dorrigiv, Shahin Kamali, Alejandro López-Ortiz, Pawel Pralat, Jazmín Romero, Alejandro Salinger, Diego Seco:
Broadcasting in Conflict-Aware Multi-channel Networks. WALCOM 2013: 158-169 - 2004
- [c3]Heidi J. Romero, Carlos A. Brizuela, Andrei Tchernykh:
An Experimental Comparison of Approximation Algorithms for the Shortest Common Superstring Problem. ENC 2004: 27-34 - [c2]Carlos A. Brizuela, Luis C. González, Heidi J. Romero:
An Improved Genetic Algorithm for the Sequencing by Hybridization Problem. EvoWorkshops 2004: 11-20 - [c1]Luis C. González, Heidi J. Romero, Carlos A. Brizuela:
A Genetic Algorithm for the Shortest Common Superstring Problem. GECCO (2) 2004: 1305-1306
Informal and Other Publications
- 2016
- [i2]Alejandro López-Ortiz, Jazmín Romero:
Arbitrary Overlap Constraints in Graph Packing Problems. CoRR abs/1601.03676 (2016) - 2014
- [i1]Henning Fernau, Alejandro López-Ortiz, Jazmín Romero:
Kernelization Algorithms for Packing Problems Allowing Overlaps. CoRR abs/1411.6915 (2014)
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-04-24 22:50 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:
