| A Few Ants Are Enough: ACO with Iteration-Best Update | F. Neumann, D. Sudholt, and C. Witt | Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2010), Portland, Oregon, pp. 63-70 | July 2010 | Algorithms | |
| A fast parallel algorithm for the maximal independent set problem | R. M. Karp and A. Wigderson | Journal of the Association for Computing Machinery, Vol. 32, No. 4, pp. 762-73 | October 1985 | Algorithms | |
| A family of simplex variants solving an m*d linear program in expected number of pivot steps depending on d only | I. Adler, R. M. Karp, and R. Shamir | Mathematics of Operations Research, Vol. 11, No. 4, pp. 570-90 | November 1986 | Algorithms | |
| A Discriminative Model for Identifying Spatial Cis-Regulatory Modules | E. Segal and R. Sharan | Proceedings of RECOMB 2004, pp. 141-149; also submitted to Journal of Computational Biology | January 05 2004 | Algorithms | |
| A Computational Model of Tractable Reasoning -- Taking Inspiration from Cognition | L. Shastri | Proceedings of the 13th International Joint Conference on Artificial Intelligence (IJCAI 93), France, pp. 202-207 | 1993 | Algorithms | |
| A Comparison of Tight Generalization Error Bounds | M. Kaariainen and J. Langford | Proceedings of the 22nd International Conference on Machine Learning (ICML 2005), Bonn, Germany, pp. 409-416 | August 2005 | Algorithms | |
| A Comparison of Phasing Algorithms for Trios and Unrelated Individuals | J. Marchini, D. Cutler, N. Patterson, M. Stephens, E. Eskin, E. Halperin, S. Lin, S. Qin, G. Abecassis, H. Munro, and P. Donnelly | American Journal of Human Genetics, Vol. 78, Issue 3, pp. 437-450 | March 2006 | Algorithms | |
| A Combinatorial Approach to Protein Docking with Flexible Side-Chains | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Proceedings of the Fourth Annual International conference on Computational Molecular Biology (RECOMB-00), Tokyo, Japan, 2000. | 2000 | Algorithms | |
| A Characterization of the Minimum Cycle Mean in a Digraph | R. M. Karp | Discrete Mathematics (Netherlands), Vol. 23, No. 3, pp. 309-11 | September 1978 | Algorithms | |
| A Branch and Cut Algorithm for the Optimal Solution of the Side Chain Placement Problem | E. Althaus, O. Kohlbacher, H.P. Lenhof, and P. Muller | Technical Report Vol.2000-1-001, Max-Planck-Institut fur Informatik: Foschungsbericht, 2000. | 2000 | Algorithms | |
| A 1.5-Approximation Algorithm for Sorting by Transpositions and Transversals | T. Hartman and R. Sharan | Proceedings of WABI | September 05 2004 | Algorithms | |
