List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Building a maximal independent set for the vertex-coloring problem on planar graphs | 2022-04-29 | Paper |
| A heuristic for the coloring of planar graphs | 2022-04-29 | Paper |
| Linear-time algorithms for computing the Merrifield-Simmons index on polygonal trees | 2021-10-15 | Paper |
| The incremental satisfiability problem for a two conjunctive normal form | 2018-04-23 | Paper |
| Using binary patterns for counting falsifying assignments of conjunctive forms | 2016-12-16 | Paper |
| An enumerative algorithm for \#2SAT | 2016-05-13 | Paper |
| An approximate algorithm for the chromatic number of graphs | 2016-05-13 | Paper |
| scientific article; zbMATH DE number 1552232 (Why is no real title available?) | 2001-01-15 | Paper |
| scientific article; zbMATH DE number 1258327 (Why is no real title available?) | 1999-03-09 | Paper |
Research outcomes over time
This page was built for person: Guillermo de Ita Luna
