An Algorithm for the Chromatic Number of a Graph. - Nicos Christofides (Comput. J., 1971)

Zero-One Programming Using Non-Binary Tree-Search. - Nicos Christofides (Comput. J., 1971)

Technical Note - Bounds for the Travelling-Salesman Problem. - Nicos Christofides (Oper. Res., 1972)

Large Scheduling Problems with Bivalent Costs. - Nicos Christofides (Comput. J., 1973)

The Rearrangement of Items in a Warehouse. - Nicos Christofides; I. Colloff (Oper. Res., 1973)

Errata. - Nicos Christofides (Oper. Res., 1974)

Optimal expansion of an existing network. - Nicos Christofides; P. Brooker (Math. Program., 1974)

An Algorithm for Two-Dimensional Cutting Problems. - Nicos Christofides; Charles Whitlock (Oper. Res., 1977)

Dynamic Loading and Unloading of Liquids into Tanks. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Oper. Res., 1980)

Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs. - Ahmed Ainouche; Nicos Christofides (J. Comb. Theory B, 1981)

A restricted Lagrangean approach to the traveling salesman problem. - Egon Balas; Nicos Christofides (Math. Program., 1981)

Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Math. Program., 1981)

State-space relaxation procedures for the computation of bounds to routing problems. - Nicos Christofides; Aristide Mingozzi; Paolo Toth (Networks, 1981)

The period routing problem. - Nicos Christofides; John E. Beasley (Networks, 1984)

Semi-independence number of a graph and the existence of Hamiltonian circuits. - Ahmed Ainouche; Nicos Christofides (Discret. Appl. Math., 1987)

An Exact Algorithm for the Quadratic Assignment Problem on a Tree. - Nicos Christofides; Enrique Benavent (Oper. Res., 1989)

An algorithm for the resource constrained shortest path problem. - John E. Beasley; Nicos Christofides (Networks, 1989)

Algorithms for large scale set covering problems. - Nicos Christofides; José M. P. Paixão (Ann. Oper. Res., 1993)

An Optimal Algorithm for the Straight Segment Approximation of Digital Arcs. - Yazid M. Sharaiha; Nicos Christofides (CVGIP Graph. Model. Image Process., 1993)

A graph-theoretic approach to distance transformations. - Yazid M. Sharaiha; Nicos Christofides (Pattern Recognit. Lett., 1994)

A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. - Eleni Hadjiconstantinou; Nicos Christofides; Aristide Mingozzi (Ann. Oper. Res., 1995)

Heuristic techniques in tax structuring for multinationals. - D. Fatouros; Gerry Salkin; Nicos Christofides (CIFEr, 1996)

Data structures for topological and geometric operations on networks. - Nicos Christofides; H. O. Badra; Yazid M. Sharaiha (Ann. Oper. Res., 1997)

An efficient implementation of an algorithm for finding K shortest simple paths. - Eleni Hadjiconstantinou; Nicos Christofides (Networks, 1999)

Capital Budgeting Under Uncertainty - An Integrated Approach Using Contingent Claims Analysis and Integer Programming. - Helga Meier; Nicos Christofides; Gerry Salkin (Oper. Res., 2001)

The design of corporate tax structures. - Simon Christofides; Alexander Christofides; Nicos Christofides (Math. Program., 2003)

Upper bounds for single-source uncapacitated concave minimum-cost network flow problems. - Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides (Networks, 2003)

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems. - Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides (Eur. J. Oper. Res., 2006)

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems. - Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides (J. Glob. Optim., 2006)

A Branch-and-Bound Algorithm for Concave Network Flow Problems. - Dalila B. M. M. Fontes; Eleni Hadjiconstantinou; Nicos Christofides (J. Glob. Optim., 2006)

An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. - Roberto Baldacci; Nicos Christofides; Aristide Mingozzi (Math. Program., 2008)

Exact methods for large-scale multi-period financial planning problems. - Roberto Baldacci; Marco A. Boschetti; Nicos Christofides; Simon Christofides (Comput. Manag. Sci., 2009)

Worst-case robust Omega ratio. - Michalis Kapsos; Nicos Christofides; Berç Rustem (Eur. J. Oper. Res., 2014)

Robust risk budgeting. - Michalis Kapsos; Nicos Christofides; Berç Rustem (Ann. Oper. Res., 2018)

Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. - Nicos Christofides (Oper. Res. Forum, 2022)