The Status of the P versus NP ProblemFORTNOW, Lance.Communications of the ACM. 2009, Vol 52, Num 9, pp 78-86, issn 0001-0782, 9 p.Article

Approximation algorithms for spreading pointsCABELLO, Sergio.Journal of algorithms (Print). 2007, Vol 62, Num 2, pp 49-73, issn 0196-6774, 25 p.Article

Un algorithme à un million de dollars ? = An algorithm of a million of dollars ?DELAHAYE, Jean-Paul.Pour la science. 2005, Num 334, pp 90-95, issn 0153-4092, 6 p.Article

Approximation algorithms for some clustering and classification problemsTARDOS, E.Lecture notes in computer science. 1999, issn 0302-9743, isbn 3-540-66916-7, p. 183Conference Paper

Matching points with rectangles and squaresBEREG, Sergey; MUTSANAS, Nikolaus; WOLFF, Alexander et al.Lecture notes in computer science. 2006, pp 177-186, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 10 p.Conference Paper

Approximation schemes for geometric NP-hard problems: A surveyARORA, Sanjeev.Lecture notes in computer science. 2001, pp 16-17, issn 0302-9743, isbn 3-540-43002-4Conference Paper

Complexity of the min-max (regret) versions of cut problemsAISSI, Hassene; BAZGAN, Cristina; VANDERPOOTEN, Daniel et al.Lecture notes in computer science. 2005, pp 789-798, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Rounding to an integral programHASSIN, Refael; SEGEV, Danny.Lecture notes in computer science. 2005, pp 44-54, issn 0302-9743, isbn 3-540-25920-1, 11 p.Conference Paper

Exact Exponential AlgorithmsFOMIN, Fedor V; KASKI, Petteri.Communications of the ACM. 2013, Vol 56, Num 3, pp 80-88, issn 0001-0782, 9 p.Article

Easy and difficult objective functions for max cutMCCORMICK, S. Thomas; RAO, M. R; RINALDI, Giovanni et al.Mathematical programming. 2003, Vol 94, Num 2-3, pp 459-466, issn 0025-5610, 8 p.Conference Paper

Tetris is hard, even to approximateDEMAINE, Erik D; HOHENBERGER, Susan; LIBEN-NOWELL, David et al.Lecture notes in computer science. 2003, pp 351-363, issn 0302-9743, isbn 3-540-40534-8, 13 p.Conference Paper

An Efficient Algorithm for Mobile Guarded Guards in Simple GridsKOSOWSKI, Adrian; MALAFIEJSKI, Michal; ZYLINSKI, Pawee et al.Lecture notes in computer science. 2006, pp 141-150, issn 0302-9743, isbn 3-540-34070-X, 10 p.Conference Paper

Approximating the distortionHALL, Alexander; PAPADIMITRIOU, Christos.Lecture notes in computer science. 2005, pp 111-122, issn 0302-9743, isbn 3-540-28239-4, 12 p.Conference Paper

The shrinkage exponent of de morgan formulas is 2HASTAD, J.SIAM journal on computing (Print). 1998, Vol 27, Num 1, pp 48-64, issn 0097-5397Article

Two-Server Network Disconnection ProblemCHOI, Byung-Cheon; HONG, Sung-Pil.Lecture notes in computer science. 2006, pp 785-792, issn 0302-9743, isbn 3-540-34070-X, 8 p.Conference Paper

New tractable classes from oldCOHEN, David; JEAVONS, Peter; GAULT, Richard et al.Constraints (Dordrecht). 2003, Vol 8, Num 3, pp 263-282, issn 1383-7133, 20 p.Conference Paper

Higher-order matching in the linear lambda calculus in the absence of constants is NP-completeYOSHINAKA, Ryo.Lecture notes in computer science. 2005, pp 235-249, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Improved exact algorithms for MAX-SATJIANER CHEN; KANJ, Iyad A.Lecture notes in computer science. 2002, pp 341-355, issn 0302-9743, isbn 3-540-43400-3Conference Paper

Structure in approximation classesCRESCENZI, P; KANN, V; SILVESTRI, R et al.SIAM journal on computing (Print). 1999, Vol 28, Num 5, pp 1759-1782, issn 0097-5397Article

On the hardness of range assignment problemsFUCHS, Bernhard.Lecture notes in computer science. 2006, pp 127-138, issn 0302-9743, isbn 3-540-34375-X, 1Vol, 12 p.Conference Paper

A new enhancement of the Clarke and wright savings heuristic for the capacitated vehicle routing problemALTINEL, I. K; ÖNCAN, T.The Journal of the Operational Research Society. 2005, Vol 56, Num 8, pp 954-961, issn 0160-5682, 8 p.Article

Grasp with path-relinking for the maximum diversity problemDE ANDRADE, Marcos R. Q; DE ANDRADE, Paulo M. F; MARTINS, Simone L et al.Lecture notes in computer science. 2005, pp 558-569, issn 0302-9743, isbn 3-540-25920-1, 12 p.Conference Paper

An approximation algorithm for the minimum latency set cover problemHASSIN, Refael; LEVIN, Asaf.Lecture notes in computer science. 2005, pp 726-733, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 8 p.Conference Paper

k-recombination haplotype inference in pedigreesCHIN, Francis Y. L; QIANGFENG ZHANG; HONG SHEN et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part II, 985-993Conference Paper

A new algorithm for optimal constraint satisfaction and its implicationsWILLIAMS, Ryan.Lecture notes in computer science. 2004, pp 1227-1237, issn 0302-9743, isbn 3-540-22849-7, 11 p.Conference Paper