Francisco Javier Zaragoza Martínez

Orcid: 0000-0001-7570-1483

According to our database1, Francisco Javier Zaragoza Martínez authored at least 25 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Constrained many-to-many point matching in two dimensions.
Optim. Lett., November, 2024

The non-stop disjoint trajectories problem.
Discret. Optim., 2024

2023
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph.
Discret. Appl. Math., 2023

2020
Postman problems on series-parallel mixed graphs.
Oper. Res. Lett., 2020

Plowing with precedence in polynomial time.
Networks, 2020

2018
Outperforming Several Heuristics for the Multidimensional Assignment Problem.
Proceedings of the 15th International Conference on Electrical Engineering, 2018

2017
A Step Towards Yuzvinsky's Conjecture.
Electron. J. Comb., 2017

A simple but effective memetic algorithm for the multidimensional assignment problem.
Proceedings of the 14th International Conference on Electrical Engineering, 2017

2016
An Efficient Implementation of Boolean Gröbner Basis Computation.
Proceedings of the High Performance Computing - Third Latin American Conference, 2016

2015
3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows.
Res. Comput. Sci., 2015

Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs.
Proceedings of the NEO 2015, 2015

An ILP approach for the traveling repairman problem with unit time windows.
Proceedings of the 12th International Conference on Electrical Engineering, 2015

A triplet integer programming model for the Euclidean 3-matching problem.
Proceedings of the 12th International Conference on Electrical Engineering, 2015

A cache-aware data structure for representing boolean polynomials.
Proceedings of the 12th International Conference on Electrical Engineering, 2015

2014
Approximation algorithms for the Street sweeping problem.
Proceedings of the 11th International Conference on Electrical Engineering, 2014

A fast 4-approximation algorithm for the traveling repairman problem on a line.
Proceedings of the 11th International Conference on Electrical Engineering, 2014

Smallest primitive embeddings of planar graphs.
Proceedings of the 11th International Conference on Electrical Engineering, 2014

2013
Tree-less Huffman coding algorithm for embedded systems.
Proceedings of the 2012 International Conference on Reconfigurable Computing and FPGAs, 2013

2012
Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem.
Proceedings of the 9th International Conference on Electrical Engineering, 2012

2010
Huffman Coding-Based Compression Unit for Embedded Systems.
Proceedings of the ReConFig'10: 2010 International Conference on Reconfigurable Computing and FPGAs, 2010

2009
Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery.
Computación y Sistemas, 2009

Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice.
Proceedings of the 21st Annual Canadian Conference on Computational Geometry, 2009

2008
Series-parallel graphs are windy postman perfect.
Discret. Math., 2008

2007
Feasibility of the Mixed Postman Problem with Restrictions on the Edges.
Electron. Notes Discret. Math., 2007

2006
Complexity of the Mixed Postman Problem with Restrictions on the Edges.
Proceedings of the Seventh Mexican International Conference on Computer Science, 2006


  Loading...