Research Article710.1016/j.jalgor.2009.04.004Intensional dynamic programming. A Rosetta stone for structured dynamic programmingMay 08, 2009Journal of AlgorithmsMartijn Van OtterloCiteListenSave
Research Article1510.1016/j.jalgor.2009.02.006Generating complex ontology instances from documentsJan 01, 2009Journal of AlgorithmsRoxana Danger + 1 more +1CiteListenSave
Research Article3610.1016/j.jalgor.2009.02.002Modeling preferences and conditional preferences on resource consumption and production in ASPJan 01, 2009Journal of AlgorithmsStefania Costantini + 1 more +1CiteListenSave
Research Article10.1016/j.jalgor.2008.10.001Solving necklace constraint problemsOct 14, 2008Journal of AlgorithmsPierre Flener + 1 more +1CiteListenSave
Research Article110.5555/1115481.1712333Estimating all pairs shortest paths in restricted graph familiesSep 01, 2005Journal of AlgorithmsF DraganfeodorCiteListenSave
Front Matter10.1016/s0196-6774(05)00060-xPapers to appear in forthcoming issuesJun 14, 2005Journal of AlgorithmsCiteListenSave
Research Article12710.1016/j.jalgor.2005.01.003Semi-matchings for bipartite graphs and load balancingFeb 19, 2005Journal of AlgorithmsNicholas J.a Harvey + 3 more +3CiteListenSave
Research Article3810.1016/j.jalgor.2004.11.004Virtual logarithmsJan 25, 2005Journal of AlgorithmsOliver SchirokauerCiteListenSave
Research Article2910.1016/j.jalgor.2004.08.003Polynomial time recognition of unit circular-arc graphsOct 12, 2004Journal of AlgorithmsGuillermo Durán + 4 more +4CiteListenSave
Research Article4410.1016/j.jalgor.2004.07.005Computing shortest paths with uncertaintySep 09, 2004Journal of AlgorithmsTomás Feder + 4 more +4CiteListenSave