Complexity of the Mixed Postman Problem with Restrictions on the Edges. - Francisco Javier Zaragoza Martínez (ENC, 2006)

Feasibility of the Mixed Postman Problem with Restrictions on the Edges. - Francisco Javier Zaragoza Martínez (Electron. Notes Discret. Math., 2007)

Series-parallel graphs are windy postman perfect. - Francisco Javier Zaragoza Martínez (Discret. Math., 2008)

Every four-colorable graph is isomorphic to a subgraph of the Visibility Graph of the Integer Lattice. - David Flores-Peñaloza; Francisco Javier Zaragoza Martínez (CCCG, 2009)

Incompressibility and Lossless Data Compression: An Approach by Pattern Discovery. - Oscar Herrera-Alcántara; Francisco Javier Zaragoza Martínez (Computación y Sistemas, 2009)

Huffman Coding-Based Compression Unit for Embedded Systems. - Marco Antonio Soto Hernandez; Oscar Alvarado Nava; Francisco Javier Zaragoza Martínez (ReConFig, 2010)

Solving the Lookup Problem for Non-Member Functions in Presence of Namespaces. - Francisco Zaragoza 001; Germán Téllez-Castillo; Rodrigo Alexander Castro Campos (Res. Comput. Sci., 2011)

Batch source-code plagiarism detection using an algorithm for the bounded longest common subsequence problem. - Rodrigo Alexander Castro Campos; Francisco Javier Zaragoza Martínez (CCE, 2012)

Tree-less Huffman coding algorithm for embedded systems. - Marco Antonio Soto Hernandez; Oscar Alvarado Nava; Eduardo Rodríguez-Martínez; Francisco Javier Zaragoza Martínez (ReConFig, 2013)

The Erdős-Sós Conjecture for Geometric Graphs. - Ruy Fabila-Monroy; Luis Felipe Barba Flores; Dolores Lara; Jesús Leaños; Cynthia A. Rodríguez Villalobos; Gelasio Salazar; Francisco Zaragoza 001 (Discret. Math. Theor. Comput. Sci., 2013)

Smallest primitive embeddings of planar graphs. - Sergio Luis Pérez-Pérez; Gloria Aguilar Cruz; Celene Dorali Alfaro Quintero; Jorge Arturo Pérez Arcos; Francisco Javier Zaragoza Martínez (CCE, 2014)

A fast 4-approximation algorithm for the traveling repairman problem on a line. - Sergio Luis Pérez-Pérez; Luis Eduardo Urbán Rivero; Rafael López-Bracho; Francisco Javier Zaragoza Martínez (CCE, 2014)

Approximation algorithms for the Street sweeping problem. - Luis Francisco Hernández Sánchez; Laura Chávez-Lomelí; Francisco Javier Zaragoza Martínez (CCE, 2014)

A cache-aware data structure for representing boolean polynomials. - Rodrigo Alexander Castro Campos; Féliu D. Sagols Troncoso; Francisco Javier Zaragoza Martínez (CCE, 2015)

A triplet integer programming model for the Euclidean 3-matching problem. - Gualberto Vazquez Casas; Rodrigo Alexander Castro Campos; Marco A. Heredia; Francisco Javier Zaragoza Martínez (CCE, 2015)

An ILP approach for the traveling repairman problem with unit time windows. - Yani Miguel-Pilar; Guillermo Morales-Luna; Féliu D. Sagols Troncoso; Francisco Javier Zaragoza Martínez (CCE, 2015)

Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs. - Francisco Javier Zaragoza Martínez (NEO, 2015)

3-approximation Algorithm for the Travelling Repairman Problem with Unit Time-windows. - Luis Eduardo Urbán Rivero; Cynthia A. Rodríguez Villalobos; Rafael López-Bracho; Francisco Javier Zaragoza Martínez (Res. Comput. Sci., 2015)

An Efficient Implementation of Boolean Gröbner Basis Computation. - Rodrigo Alexander Castro Campos; Feliu Davino Sagols Troncoso; Francisco Javier Zaragoza Martínez (CARLA, 2016)

A simple but effective memetic algorithm for the multidimensional assignment problem. - Carlos E. Valencia; Francisco Javier Zaragoza Martínez; Sergio Luis Pérez-Pérez (CCE, 2017)

A Step Towards Yuzvinsky's Conjecture. - Isidoro Gitler; Enrique Reyes; Francisco Javier Zaragoza Martínez (Electron. J. Comb., 2017)

Outperforming Several Heuristics for the Multidimensional Assignment Problem. - Carlos E. Valencia; Carlos A. Alfaro; Francisco Javier Zaragoza Martínez; Marcos Cesar Vargas Magana; Sergio Luis Pérez-Pérez (CCE, 2018)

On the 2-Colored Crossing Number. - Oswin Aichholzer; Ruy Fabila-Monroy; Adrian Fuchs; Carlos Hidalgo-Toscano; Irene Parada; Birgit Vogtenhuber; Francisco Zaragoza 001 (GD, 2019)

Plowing with precedence in polynomial time. - Rodrigo Alexander Castro Campos; Cynthia A. Rodríguez Villalobos; Francisco Javier Zaragoza Martínez (Networks, 2020)

Postman problems on series-parallel mixed graphs. - Francisco Javier Zaragoza Martínez (Oper. Res. Lett., 2020)

Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. - Andreas Bärmann; Patrick Gemander; Maximilian Merkert; Ann-Kathrin Wiertz; Francisco Javier Zaragoza Martínez (Discret. Appl. Math., 2023)

The non-stop disjoint trajectories problem. - Benno Hoch; Frauke Liers; Sarah Neumann; Francisco Javier Zaragoza Martínez (Discret. Optim., 2024)

Constrained many-to-many point matching in two dimensions. - Luis Evaristo Caraballo; Rodrigo Alexander Castro Campos; José Miguel Díaz-Báñez; Marco A. Heredia; Jorge Urrutia; Inmaculada Ventura; Francisco Javier Zaragoza Martínez (Optim. Lett., 2024)

On Grundy indices for complete geometric graphs. - Dolores Lara; Christian Rubio-Montiel; Francisco Zaragoza 001 (CoRR, 2025)