| 1659 | -- | 0 | Sonia Cafieri, Ulrich Faigle, Leo Liberti. 8th Cologne/Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009) |
| 1660 | -- | 1665 | Stephan Dominique Andres, Winfried Hochstättler, Christiane Schallück. The game chromatic index of wheels |
| 1666 | -- | 1675 | David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein. On the sizes of graphs and their powers: The undirected case |
| 1676 | -- | 1688 | Rafael Ayala, Desamparados Fernández-Ternero, J. A. Vilches. The number of excellent discrete Morse functions on graphs |
| 1689 | -- | 1698 | Walid Ben-Ameur, José Neto. A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems |
| 1699 | -- | 1706 | Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe. Partial characterizations of circle graphs |
| 1707 | -- | 1716 | Guillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat. Local protein threading by Mixed Integer Programming |
| 1717 | -- | 1725 | Simone Dantas, Celina M. Herrera de Figueiredo, Murilo Vicente Gonçalves da Silva, Rafael B. Teixeira. On the forbidden induced subgraph sandwich problem |
| 1726 | -- | 1735 | Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger. Paths, trees and matchings under disjunctive constraints |
| 1736 | -- | 1750 | Ulrich Faigle, Jan Voss. A system-theoretic model for cooperation, interaction and allocation |
| 1751 | -- | 1758 | Tobias Friedrich, Nils Hebbinghaus. Average update times for fully-dynamic all-pairs shortest paths |
| 1759 | -- | 1774 | Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich. Hamiltonian properties of locally connected graphs with bounded vertex degree |
| 1775 | -- | 1785 | André Luiz Pires Guedes, Lilian Markenzon, Luerbio Faria. Flow hypergraph reducibility |
| 1786 | -- | 1792 | Illés Horváth, Gyula Y. Katona. Extremal P::4::-stable graphs |
| 1793 | -- | 1805 | Bo Jiang, Xuehou Tan. Searching for mobile intruders in circular corridors by two 1-searchers |
| 1806 | -- | 1814 | Ross J. Kang, Tobias Müller. Frugal, acyclic and star colourings of graphs |
| 1815 | -- | 1826 | Etienne de Klerk, Cristian Dobre. A comparison of lower bounds for the symmetric circulant traveling salesman problem |
| 1827 | -- | 1841 | Stefanie Kosuch, Abdel Lisser. On two-stage stochastic knapsack problems |
| 1842 | -- | 1850 | Andrew Lyons. Acyclic and star colorings of cographs |
| 1851 | -- | 1864 | R. C. S. Machado, C. M. H. de Figueiredo. Total chromatic number of unichord-free graphs |
| 1865 | -- | 1877 | Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy. Competitive subset selection with two agents |
| 1878 | -- | 1888 | B. S. Panda, Preeti Goel. L(2, 1)-labeling of perfect elimination bipartite graphs |
| 1889 | -- | 1900 | Petros A. Petrosyan, H. E. Sargsyan. On resistance of graphs |
| 1901 | -- | 1914 | Luidi Simonetti, Yuri Frota, Cid C. de Souza. The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm |