default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancisco Javier Zaragoza Martínez
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Benno Hoch
, Frauke Liers, Sarah Neumann, Francisco Javier Zaragoza Martínez:
The non-stop disjoint trajectories problem. Discret. Optim. 52: 100837 (2024)- [j9]Luis Evaristo Caraballo, R. A. Castro, José Miguel Díaz-Báñez, Marco A. Heredia, Jorge Urrutia, Inmaculada Ventura, Francisco Javier Zaragoza Martínez:
Constrained many-to-many point matching in two dimensions. Optim. Lett. 18(8): 1837-1854 (2024) - 2023
- [j8]Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez:
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. Discret. Appl. Math. 324: 145-166 (2023) - 2020
- [j7]Rodrigo Alexander Castro Campos, Cynthia A. Rodríguez Villalobos, Francisco Javier Zaragoza Martínez:
Plowing with precedence in polynomial time. Networks 76(4): 451-466 (2020) - [j6]Francisco Javier Zaragoza Martínez:
Postman problems on series-parallel mixed graphs. Oper. Res. Lett. 48(3): 266-270 (2020)
2010 – 2019
- 2018
- [c15]Carlos E. Valencia, Carlos A. Alfaro, Francisco Javier Zaragoza Martínez, Marcos Cesar Vargas Magana, Sergio Luis Pérez-Pérez:
Outperforming Several Heuristics for the Multidimensional Assignment Problem. CCE 2018: 1-6 - 2017
- [j5]Isidoro Gitler, Enrique Reyes, Francisco Javier Zaragoza Martínez:
A Step Towards Yuzvinsky's Conjecture. Electron. J. Comb. 24(4): 4 (2017) - [c14]Carlos E. Valencia, Francisco Javier Zaragoza Martínez, Sergio Luis Pérez-Pérez:
A simple but effective memetic algorithm for the multidimensional assignment problem. CCE 2017: 1-6 - 2016
- [c13]Rodrigo Alexander Castro Campos, Feliu Davino Sagols Troncoso, Francisco Javier Zaragoza Martínez:
An Efficient Implementation of Boolean Gröbner Basis Computation. CARLA 2016: 116-130 - 2015
- [j4]Luis Eduardo Urbán Rivero, Cynthia A. Rodríguez Villalobos, Rafael López-Bracho, Francisco Javier Zaragoza Martínez:
3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows. Res. Comput. Sci. 107: 167-173 (2015) - [c12]Rodrigo Alexander Castro Campos, Féliu D. Sagols Troncoso, Francisco Javier Zaragoza Martínez:
A cache-aware data structure for representing boolean polynomials. CCE 2015: 1-5 - [c11]Gualberto Vazquez Casas, Rodrigo Alexander Castro Campos, Marco A. Heredia, Francisco Javier Zaragoza Martínez:
A triplet integer programming model for the Euclidean 3-matching problem. CCE 2015: 1-4 - [c10]Yani Miguel-Pilar, Guillermo Morales-Luna, Féliu D. Sagols Troncoso, Francisco Javier Zaragoza Martínez:
An ILP approach for the traveling repairman problem with unit time windows. CCE 2015: 1-5 - [c9]Francisco Javier Zaragoza Martínez:
Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs. NEO 2015: 107-120 - 2014
- [c8]Sergio Luis Pérez-Pérez, Gloria Aguilar Cruz, Celene Dorali Alfaro Quintero, Jorge Arturo Pérez Arcos, Francisco Javier Zaragoza Martínez:
Smallest primitive embeddings of planar graphs. CCE 2014: 1-4 - [c7]Sergio Luis Pérez-Pérez, Luis Eduardo Urbán Rivero, Rafael López-Bracho, Francisco Javier Zaragoza Martínez:
A fast 4-approximation algorithm for the traveling repairman problem on a line. CCE 2014: 1-4 - [c6]Luis Francisco Hernández Sánchez, Laura Chávez-Lomelí, Francisco Javier Zaragoza Martínez:
Approximation algorithms for the Street sweeping problem. CCE 2014: 1-4 - 2013
- [c5]Marco Antonio Soto Hernandez, Oscar Alvarado Nava, Eduardo Rodriguez-Martinez, Francisco Javier Zaragoza Martínez:
Tree-less Huffman coding algorithm for embedded systems. ReConFig 2013: 1-6 - 2012
- [c4]Rodrigo Alexander Castro Campos, Francisco Javier Zaragoza Martínez:
Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem. CCE 2012: 1-4 - 2010
- [c3]Marco Antonio Soto Hernandez, Oscar Alvarado Nava, Francisco Javier Zaragoza Martínez:
Huffman Coding-Based Compression Unit for Embedded Systems. ReConFig 2010: 238-243
2000 – 2009
- 2009
- [j3]Oscar Herrera-Alcántara, Francisco Javier Zaragoza Martínez:
Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery. Computación y Sistemas 13(1) (2009) - [c2]David Flores-Peñaloza, Francisco Javier Zaragoza Martínez:
Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. CCCG 2009: 91-94 - 2008
- [j2]Francisco Javier Zaragoza Martínez:
Series-parallel graphs are windy postman perfect. Discret. Math. 308(8): 1366-1374 (2008) - 2007
- [j1]Francisco Javier Zaragoza Martínez:
Feasibility of the Mixed Postman Problem with Restrictions on the Edges. Electron. Notes Discret. Math. 29: 79-83 (2007) - 2006
- [c1]Francisco Javier Zaragoza Martínez:
Complexity of the Mixed Postman Problem with Restrictions on the Edges. ENC 2006: 3-10
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-11-07 21:34 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:
