1![Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Discrete Applied Mathematics–399 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam](https://www.pdfsearch.io/img/397d9f39cb137952a55b804895531a23.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2014-01-31 12:40:59
|
---|
2![The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2 The Longest Path Problem is Polynomial on Interval Graphs Kyriaki Ioannidou1? , George B. Mertzios2?? , and Stavros D. Nikolopoulos1? 1 2](https://www.pdfsearch.io/img/9121a53d36b14239c275013a2a6c27ec.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2009-06-12 14:16:54
|
---|
3![SIAM J. DISCRETE MATH. Vol. 26, No. 3, pp. 940–963 c 2012 Society for Industrial and Applied Mathematics SIAM J. DISCRETE MATH. Vol. 26, No. 3, pp. 940–963 c 2012 Society for Industrial and Applied Mathematics ](https://www.pdfsearch.io/img/235485dd7102f160345d497e18a8c255.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2012-10-09 12:22:03
|
---|
4![Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios · Algorithmica:320–341 DOIs00453The Longest Path Problem has a Polynomial Solution on Interval Graphs Kyriaki Ioannidou · George B. Mertzios ·](https://www.pdfsearch.io/img/65abf656b7a95699c7606b0527b4b17f.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2011-12-14 14:10:08
|
---|
5![New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière New results for the 2-interval pattern problem Guillaume Blin1 , Guillaume Fertin1 , and Stéphane Vialette2 1 LINA, FRE CNRS 2729 Université de Nantes, 2 rue de la Houssinière](https://www.pdfsearch.io/img/6f8396dfe58ca90816c4241dbdbab2b6.jpg) | Add to Reading ListSource URL: pagesperso.lina.univ-nantes.frLanguage: English - Date: 2011-04-27 05:28:57
|
---|
6![0 AHLIN and REITER PROBLEM DEPARTMENT ASHLEY AHLIN 0 AHLIN and REITER PROBLEM DEPARTMENT ASHLEY AHLIN](https://www.pdfsearch.io/img/7ec7baeb60c49240857290e382ec3ce3.jpg) | Add to Reading ListSource URL: www.pme-math.orgLanguage: English - Date: 2013-10-17 15:53:04
|
---|
7![Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1 Parameterized Complexity of the Weighted Independent Set Problem beyond Graphs of Bounded Clique Number∗† Konrad Dabrowski1 , Vadim Lozin1‡, Haiko M¨ uller2 , and Dieter Rautenbach3 1](https://www.pdfsearch.io/img/4934048183c724f99f20c0f506718e3e.jpg) | Add to Reading ListSource URL: community.dur.ac.ukLanguage: English - Date: 2012-04-30 01:44:46
|
---|
8![An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2 An Optimal Probabilistic Graphical Model for Point Set Matching Tib´erio S. Caetano1,2 , Terry Caelli1 , and Dante A. C. Barone2 1 2](https://www.pdfsearch.io/img/c8864e4cb9fdda580cde4bbd2effa4de.jpg) | Add to Reading ListSource URL: www.tiberiocaetano.comLanguage: English - Date: 2008-05-10 06:35:04
|
---|
9![Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth Journal of Artificial Intelligence Research–388 Submitted 10/11; publishedComputing All-Pairs Shortest Paths by Leveraging Low Treewidth](https://www.pdfsearch.io/img/8934c85e03b0b83af6c9541da5e9de11.jpg) | Add to Reading ListSource URL: jair.orgLanguage: English - Date: 2012-03-19 16:09:33
|
---|