- CSB - MetaPress - Google - Bing - Yahoo
 | 2006 | |
|---|---|---|
| c7 |      | Daniel Lucraft, Andrew Eremin, Farid Ajili: Enforcing path uniqueness in internet routing. SAC 2006: 399-403 |
| 2005 | ||
| c6 | | Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi: On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price. CPAIOR 2005: 125-139 |
| c5 | | Farid Ajili, Robert Rodosek, Andrew Eremin: A branch-price-and-propagate approach for optimizing IGP weight setting subject to unique shortest paths. SAC 2005: 366-370 |
| 2004 | ||
| c4 | | Wilhelm Cronholm, Farid Ajili: Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design. CP 2004: 726-730 |
| 2003 | ||
| j2 | | Farid Ajili, Hani El Sakkout: A Probe-Based Algorithm for Piecewise Linear Optimization in Scheduling. Annals OR 118(1-4): 35-48 (2003) |
| 1998 | ||
| c3 | | Farid Ajili, Hendrik C. R. Lock: Integrating Constraint Propagation in Complete Solving of Linear Diophantine Systems. PLILP/ALP 1998: 463-480 |
| 1997 | ||
| j1 | | Farid Ajili, Evelyne Contejean: Avoiding Slack Variables in the Solving of Linear Diophantine Equations and Inequations. Theor. Comput. Sci. 173(1): 183-208 (1997) |
| c2 |  | Farid Ajili, Claude Kirchner: A Modular Framework for the Combination of Unification and Built-In Constraints. ICLP 1997: 331-345 |
| 1995 | ||
| c1 | | Farid Ajili, Evelyne Contejean: Complete Solving of Linear Diophantine Equations and Inequations without Adding Variables. CP 1995: 1-17 |
| 1 | Evelyne Contejean | |
| 2 | Wilhelm Cronholm | |
| 3 | Andrew Eremin | |
| 4 | Claude Kirchner | |
| 5 | Hendrik C. R. Lock | |
| 6 | Daniel Lucraft | |
| 7 | Sofia Panagiotidi | |
| 8 | Robert Rodosek | |
| 9 | Hani El Sakkout |
Colors in the list of coauthors
Last update Sun May 19 04:38:31 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page