Heuristics for Improving the Non-oblivious Local Search for MaxSAT. - Guillermo De Ita; David Eduardo Pinto; M. Nuño (IBERAMIA, 1998)

Polynomial Classes of Boolean Formulas for Computing the Degree of Belief. - Guillermo De Ita Luna (IBERAMIA, 2004)

A Polynomial Graphical Reduction to Speed Up the Counting of Models for Boolean Formulas. - Guillermo De Ita Luna; Meliza Contreras González (LoLaCOM, 2006)

A Worst-Case Time Upper Bound for Counting the Number of Independent Sets. - Guillermo De Ita Luna; Aurelio López-López (CAAN, 2007)

Efficient counting of models for boolean formulas represented by embedded cycles. - Guillermo De Ita Luna; Pedro Bello López; Meliza Contreras González (LA-NMR, 2007)

Model Counting for 2SAT Based on Graphs by Matrix Operators. - Carlos Guillén; Aurelio López-López; Guillermo De Ita Luna (Eng. Lett., 2007)

New Polynomial Classes for #2SAT Established Via Graph-Topological Structure. - Guillermo De Ita Luna; Pedro Bello López; Meliza Contreras González (Eng. Lett., 2007)

Efficient computation of the degree of belief in a propositional theory. - Carlos Guillén; Guillermo De Ita Luna; Aurelio López-López (LA-NMR, 2008)

Agents's competition for selecting a representative. - Guillermo De Ita Luna; Mireya Tovar; Meliza Contreras González (LA-NMR, 2008)

Computing #2-SAT of Grids, Grid-Cylinders and Grid-Tori Boolean Formulas. - Carlos Guillén; Aurelio López-López; Guillermo De Ita (RCRA, 2008)

Efficient Computation of the Degree of Belief for a Subclass of Two Conjuctive Forms. - Guillermo De Ita Luna; Carlos Guillén; Ali Khanafer 001 (LA-NMR, 2009)

A Novel Method for Counting Models on Grid Boolean Formulas. - Carlos Guillén; Guillermo De Ita Luna; Aurelio López-López (MCPR, 2010)

Efficient Computation of the Degree of Belief for a Subclass of Two Conjunctive Forms. - Guillermo De Ita Luna; Carlos Guillén (Inteligencia Artif., 2010)

Estimating the relevance on Communication Lines Based on the Number of Edge Covers. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; Héctor A. Montes Venegas (Electron. Notes Discret. Math., 2010)

A Multiagent System for Modeling Democratic Elections. - Guillermo De Ita Luna; Meliza Contreras González; Isaac Chantes Quechol (FLAIRS, 2011)

A Note for Parametric Complexity of #2SAT. - Guillermo De Ita Luna; Fernando Zacarías Flores; Alejandro Rangel-Huerta (LA-NMR, 2011)

Solving 3-Colouring via 2SAT. - Guillermo De Ita Luna; César Bautista; Luis Carlos Altamirano (MCPR, 2011)

A Threshold for a Polynomial Solution of #2SAT. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; José Antonio Hernández Servín (Fundam. Informaticae, 2011)

An Approximate Algorithm for the Chromatic Number of a Graph. - Guillermo De Ita Luna; Fernando Zacarías Flores; José Raymundo Marcial-Romero (CTW, 2012)

Edge covering of acyclic graphs. - José Antonio Hernández Servín; José Raymundo Marcial-Romero; Guillermo De Ita Luna (LA-NMR, 2012)

Job Shop Scheduling via Disjunctive Boolean Formulas. - Guillermo De Ita Luna; Yolanda Moyao; Juan Carlos Pérez; Josúe Pérez (LA-NMR, 2012)

Computing #2SAT and #2UNSAT by Binary Patterns. - Guillermo De Ita Luna; José Raymundo Marcial-Romero (MCPR, 2012)

A Method Based on Congestion Game Theory for Determining Electoral Tendencies. - Guillermo De Ita Luna; Luis Carlos Altamirano; Aurelio López-López; Yolanda Moyao (SocInfo, 2012)

A Logical Database for Geriatric Purposes. - Guillermo De Ita Luna; Josúe Pérez; Juan Carlos Pérez (AMW, 2013)

An Empirical Study of Oversampling and Undersampling Methods for LCMine an Emerging Pattern Based Classifier. - Octavio Loyola-González; Milton García-Borroto; Miguel Angel Medina-Pérez; José Francisco Martínez Trinidad; Jesús Ariel Carrasco-Ochoa; Guillermo De Ita Luna (MCPR, 2013)

Recognizing Structural Patterns on Graphs for the Efficient Computation of #2SAT. - Guillermo De Ita Luna; Pedro Bello 001; Meliza Contreras (MCPR, 2013)

Recognizing 3-colorings cycle-patterns on graphs. - Guillermo De Ita Luna; Javier A. Castillo (Pattern Recognit. Lett., 2013)

Counting Falsifying Assignments of Conjunctive Forms Using Binary Patterns. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; Pilar Pozos Parra (LANMR, 2014)

An Enumerative Algorithm for #2SAT. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; Yolanda Moyao (Electron. Notes Discret. Math., 2014)

An Approximate Algorithm for the Chromatic Number of Graphs. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; Yolanda Moyao (Electron. Notes Discret. Math., 2014)

Using Binary Patterns for Counting Falsifying Assignments of Conjunctive Forms. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; Maria del Pilar Pozos Parra; José Antonio Hernández Servín (LANMR (Selected Papers), 2014)

Predicting Preferences of Voters from Opinion Polls by Machine Learning and Game Theory. - Guillermo De Ita Luna; Aurelio López-López; Josúe Pérez (Res. Comput. Sci., 2014)

An algorithm to approximate the chromatic number of graphs. - Angélica Guzmán Ponce; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Guillermo De Ita Luna (CONIELECOMP, 2015)

Smart Tourism in 1-Click. - Fernando Zacarías Flores; Rosalba Cuapa; Guillermo De Ita Luna; Daniel Torres (FNC/MobiSPC, 2015)

A Parametric Polynomial Deterministic Algorithm for #2SAT. - José Raymundo Marcial-Romero; Guillermo De Ita Luna; José Antonio Hernández Servín; Rosa Maria Valdovinos (MICAI (1), 2015)

Finding Pure Nash Equilibrium for the Resource Constrained Project Scheduling Problem. - Guillermo De Ita Luna; Fernando Zacarías Flores; Luis Carlos Altamirano Robles (Computación y Sistemas, 2015)

Un algoritmo para calcular #2SAT. - Marco A. López Medina; José Raymundo Marcial-Romero; Guillermo De Ita Luna; José Antonio Hernández Servín (Res. Comput. Sci., 2015)

Approximate the chromatic number of a graph using maximal independent sets. - Angélica Guzmán Ponce; José Raymundo Marcial-Romero; Guillermo De Ita Luna; José Antonio Hernández Servín (CONIELECOMP, 2016)

An Optimization Approach to the TWPVD Method for Digital Image Steganography. - Ismael R. Grajeda-Marín; Héctor A. Montes Venegas; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Guillermo De Ita Luna (MCPR, 2016)

Efficient Counting of the Number of Independent Sets on Polygonal Trees. - Guillermo De Ita Luna; Pedro Bello 001; Meliza Contreras; Juan C. Catana-Salazar (MCPR, 2016)

Computing the Clique-Width of Polygonal Tree Graphs. - J. Leonardo González-Ruiz; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Guillermo De Ita Luna (MICAI (2), 2016)

A Polynomial Time Algorithm for Counting the Number of Independent Sets of Cactus Graphs. - José Raymundo Marcial-Romero; Guillermo De Ita Luna; Aurelio López-López; Rosa Maria Valdovinos (MICAI (Special Session), 2016)

The Incremental Satisfiability Problem for a Two Conjunctive Normal Form. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; José Antonio Hernández Servín (LANMR (Selected Papers), 2016)

Applying an Incremental Satisfiability Algorithm to Automatic Test Pattern Generation. - Guillermo De Ita; Meliza Contreras; Pedro Bello 001 (Res. Comput. Sci., 2016)

Extending Extremal Polygonal Arrays for the Merrifield-Simmons Index. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Rosa Maria Valdovinos; Marcelo Romero (MCPR, 2017)

A Fast and Efficient Method for #2SAT via Graph Transformations. - Marco A. López Medina; José Raymundo Marcial-Romero; Guillermo De Ita; Rosa Maria Valdovinos (MICAI (1), 2017)

A Linear Time Algorithm for Solving #2SAT on Cactus Formulas. - M. A. López; José Raymundo Marcial-Romero; Guillermo De Ita Luna; Héctor A. Montes Venegas; Roberto Alejo (CoRR, 2017)

Model-based Algorithm for Belief Revisions between Normal Conjunctive Forms. - Guillermo De Ita Luna; Fernando Zacarías Flores; Alma Delia García (Computación y Sistemas, 2017)

Low-exponential Algorithm for Counting the Number of Edge Cover on Simple Graphs. - José Antonio Hernández Servín; José Raymundo Marcial-Romero; Guillermo De Ita Luna (Computación y Sistemas, 2017)

Knowledge representation of passages type TOEFL. - Meliza Contreras González; Mireya Tovar Vidal; Guillermo De Ita Luna (LANMR, 2018)

The computation of #2SAT by a fixed-parameter tractable algorithm. - Guillermo De Ita; Pedro Bello 001; Miguel Rodríguez 001 (LANMR, 2018)

A novel heuristic for the coloring of planar graphs. - Guillermo De Ita; Cristina López-Ramírez; Adriana C. Luna (LANMR, 2018)

Model counting for #2SAT problem in outerplanar graphs. - Marco A. López Medina; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Guillermo De Ita (LANMR, 2018)

Modelling 3-Coloring of Polygonal Trees via Incremental Satisfiability. - Cristina López-Ramírez; Guillermo De Ita Luna; Alfredo Neri (MCPR, 2018)

A Linear Time Algorithm for Computing #2SAT for Outerplanar 2-CNF Formulas. - Marco A. López Medina; José Raymundo Marcial-Romero; Guillermo De Ita Luna; Yolanda Moyao (MCPR, 2018)

Modelling 3-Coloring of Outerplanar Graphs via Incremental Satisfiability. - Guillermo De Ita Luna; Cristina López-Ramírez; Meliza Contreras González (Electron. Notes Discret. Math., 2018)

A New Optimization Strategy for Solving the Fall-Off Boundary Value Problem in Pixel-Value Differencing Steganography. - Ismael R. Grajeda-Marín; Héctor A. Montes Venegas; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Vianney Muñoz-Jiménez; Guillermo De Ita Luna (Int. J. Pattern Recognit. Artif. Intell., 2018)

Belief revision between conjunctive normal forms. - Guillermo De Ita Luna; José Raymundo Marcial-Romero; Pedro Bello 001; Meliza Contreras (J. Intell. Fuzzy Syst., 2018)

Cognitive relations for argumentative texts. - Meliza Contreras González; Mireya Tovar Vidal; Guillermo De Ita Luna (LANMR, 2019)

Building a Maximal Independent Set for the Vertex-coloring Problem on Planar Graphs. - Cristina López-Ramírez; Jorge Eduardo Gutiérrez-Gómez; Guillermo De Ita Luna (LANMR (Selected Papers), 2019)

A Heuristic for the Coloring of Planar Graphs. - Guillermo De Ita Luna; Cristina López-Ramírez; Ana E. De Ita-Varela; Jorge Eduardo Gutiérrez-Gómez (LANMR (Selected Papers), 2019)

Inference Algorithm with Falsifying Patterns for Belief Revision. - Pedro Bello 001; Guillermo De Ita (MCPR, 2019)

Recognizing 3-colorable Basic Patterns on Planar Graphs. - Guillermo De Ita Luna; Cristina López-Ramírez (MCPR, 2019)

Basic Pattern Graphs for the Efficient Computation of Its Number of Independent Sets. - Guillermo De Ita; Miguel Rodríguez 001; Pedro Bello 001; Meliza Contreras (MCPR, 2020)

A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas. - Marco A. López Medina; José Raymundo Marcial-Romero; Guillermo De Ita Luna; José Antonio Hernández Servín (MICAI (1), 2020)

Knowledge Representation in TOEFL Expository Texts. - Meliza Contreras González; Mireya Tovar Vidal; Guillermo De Ita Luna; Aurelio López-López (Computación y Sistemas, 2020)

A bottom-up algorithm for solving ♯2SAT. - Guillermo De Ita; José Raymundo Marcial-Romero; José Antonio Hernández Servín (Log. J. IGPL, 2020)

Detección automática de zonas de alto riesgo de eventos delictivos a través de noticias periodísticas. - Yadira Laureano de Jésus; Guillermo De Ita Luna; Mireya Tovar Vidal (Res. Comput. Sci., 2020)

Algoritmo para el conteo de modelos en FNC. - Pedro Bello López; Guillermo De Ita Luna; Meliza Contreras González; Miguel Rodríguez Hernández (Res. Comput. Sci., 2020)

Extremal Topologies for the Merrifield-Simmons Index on Dynamic Trees. - Pedro Bello 001; Miguel Rodríguez 001; Guillermo De Ita (MCPR, 2021)

Inferential Rules for Identifying Answers in TOEFL Texts. - Meliza Contreras González; Mireya Tovar Vidal; Guillermo De Ita (MCPR, 2021)

Approximate the Clique-Width of a Graph Using Shortest Paths. - J. Leonardo González-Ruiz; José Raymundo Marcial-Romero; José Antonio Hernández Servín; Guillermo De Ita (MICAI (2), 2021)

Caracterización de complejidad semántica en pasajes tipo TOEFL. - Meliza Contreras González; Mireya Tovar Vidal; Guillermo De Ita Luna (Rev. Colomb. de Computación, 2021)

Extraction of Entities in Health Domain Documents Using Recurrent Neural Networks. - Erick Barrios González; Mireya Tovar Vidal; Guillermo De Ita Luna; José Alejandro Reyes-Ortíz (ICPRAI (2), 2022)

Territorial Design and Vehicle Routing Problem Applied to the Population Census as a Case Study. - Rogelio González-Velázquez; María Beatríz Bernábe-Loranca; Erika Granillo-Martínez; Guillermo De Ita Luna (ISDA (1), 2022)

Model Checking Algorithm for Repairing Inference between Conjunctive Forms. - Guillermo De Ita; Pedro Bello 001 (Computación y Sistemas, 2022)

A method for counting models on grid Boolean formulas. - Marco A. López Medina; José Raymundo Marcial-Romero; Guillermo De Ita Luna; José Antonio Hernández Servín (J. Intell. Fuzzy Syst., 2022)

Building a Network Knowledge Base Based on a Belief Revision Operator. - Reynold Osuna-González; Guillermo De Ita Luna (ICCSA (Workshops 1), 2023)

Extreme Topologies on Bipolygonal Graphs and Dinamic Trees. - Guillermo De Ita; Pedro Bello López; Meliza Contreras González (Int. J. Comb. Optim. Probl. Informatics, 2023)

A Novel Method for Counting Independent Sets in a Grid Graph. - Guillermo De Ita Luna; Mireya Tovar Vidal; María Beatríz Bernábe-Loranca (Int. J. Comb. Optim. Probl. Informatics, 2023)

Branching and Pruning Algorithm for Computing the Merrifield-Simmons Index on Polygonal Grids. - Herlinda González-Vázquez; Cristina López-Ramírez; Pedro Bello López; Guillermo De Ita Luna (Computación y Sistemas (CyS), 2024)

Extremal graphs for the number of independent sets on polygonal chains joined by cutting edges. - Guillermo De Ita Luna; Pedro Bello López; Meliza Contreras González; José Raymundo Marcial-Romero (Int. J. Comb. Optim. Probl. Informatics, 2024)

Extremal Topologies for the Merrifield-Simmon Index on Dendrimers in Drug Delivery. - Guillermo De Ita; Michelle Guerra; Juan Pintor; Cybele Moutinho (MCPR, 2025)