| 1771 | -- | 1772 | Guillermo Durán, Thomas M. Liebling, Martín Matamala. Traces of the Latin American Conference on Combinatorics, Graphs and Applications: A selection of papers from LACGA 2004, Santiago, Chile |
| 1774 | -- | 1782 | Luerbio Faria, Celina M. Herrera de Figueiredo, Sylvain Gravier, Candido Ferreira Xavier de Mendonça Neto, Jorge Stolfi. On maximum planar induced subgraphs |
| 1783 | -- | 1790 | Guillermo Durán, Min Chih Lin, Sergio Mera, Jayme Luiz Szwarcfiter. Algorithms for clique-independent sets on subclasses of circular-arc graphs |
| 1791 | -- | 1798 | Rafael B. Teixeira, Celina M. Herrera de Figueiredo. The sandwich problem for cutsets: Clique cutset, k-star cutset |
| 1799 | -- | 1802 | Liliana Alcón. Clique-critical graphs: Maximum size and recognition |
| 1803 | -- | 1815 | Hans L. Fetter. Some basic properties of multiple Hamiltonian covers |
| 1816 | -- | 1823 | Marcos A. Kiwi. A concentration bound for the longest increasing subsequence of a randomly chosen involution |
| 1824 | -- | 1844 | Pablo Burzyn, Flavia Bonomo, Guillermo Durán. NP-completeness results for edge modification problems |
| 1845 | -- | 1853 | Mariana S. Escalante, Graciela L. Nasini, M. C. Varaldo. On the commutativity of antiblocker diagrams under lift-and-project operators |
| 1854 | -- | 1864 | Gabriela R. Argiroffo, Silvia M. Bianchi, Graciela L. Nasini. On a certain class of nonideal clutters |
| 1865 | -- | 1876 | Javier Marenco, Annegret Wagler. On the combinatorial structure of chromatic scheduling polytopes |
| 1877 | -- | 1884 | Carlos Eduardo Ferreira, Fernando M. de Oliveira Filho. Some formulations for the group steiner tree problem |
| 1885 | -- | 1896 | Héctor Cancela, Louis Petingi. On the characterization of the domination of a diameter-constrained network reliability model |
| 1897 | -- | 1907 | Benjamin Hiller, Sven Oliver Krumke, Jörg Rambau. Reoptimization gaps versus model errors in online-dispatching of service units for ADAC |
| 1908 | -- | 1931 | Philipp Friese, Jörg Rambau. Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models |
| 1932 | -- | 1938 | Sebastián Urrutia, Celso C. Ribeiro. Maximizing breaks and bounding solutions to the mirrored traveling tournament problem |