Hjem
Fahad Panolans bilde

Fahad Panolan

Postdoktor
  • E-postFahad.Panolan@uib.no
  • Besøksadresse
    HIB - Thormøhlensgt. 55
  • Postadresse
    Postboks 7803
    5020 Bergen
Tidsskriftartikler
  • Agrawal, Akanksha; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2016. Simultaneous feedback edge set: A parameterized perspective. Leibniz International Proceedings in Informatics. 64: 5.1-5.13. doi: 10.4230/LIPIcs.ISAAC.2016.5
  • Banik, Aritra; Panolan, Fahad; Raman, Venkatesh; Sahlot, Vibha. 2016. Frechet distance between a line and avatar point set. Leibniz International Proceedings in Informatics. 65: 32.1-32.14. doi: 10.4230/LIPIcs.FSTTCS.2016.32
  • Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Saurabh, Saket. 2016. Editing to connected f-degree graph. Leibniz International Proceedings in Informatics. 47:36: 1-15. doi: 10.4230/LIPIcs.STACS.2016.36
  • Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2016. Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Leibniz International Proceedings in Informatics. 51: 39.1-39.15. doi: 10.4230/LIPIcs.SoCG.2016.39
  • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2016. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM. 63:29. doi: 10.1145/2886094
  • Kolay, Sudeshna; Pandurangan, Ragukumar; Panolan, Fahad; Raman, Venkatesh; Tale, Prafullkumar. 2016. Harmonious coloring: Parameterized algorithms and upper bounds. Lecture Notes in Computer Science. 9941 LNCS: 245-256. doi: 10.1007/978-3-662-53536-3_21
  • Kolay, Sudeshna; Panolan, Fahad; Raman, Venkatesh; Saurabh, Saket. 2016. Parameterized algorithms on perfect graphs for deletion to (r,l)-Graphs. Leibniz International Proceedings in Informatics. 58:75: 1-13. doi: 10.4230/LIPIcs.MFCS.2016.75
  • Panolan, Fahad. 2016. Parameterized algorithms for list K-Cycle. Leibniz International Proceedings in Informatics. 65: 22.1-22.15. doi: 10.4230/LIPIcs.FSTTCS.2016.22
  • Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2015. Parameterized single-exponential time polynomial space algorithm for steiner tree. Lecture Notes in Computer Science. 9134: 494-505. doi: 10.1007/978-3-662-47672-7_40
  • Goyal, Prachi; Misra, Pranabendu; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2015. Finding even subgraphs even faster. Leibniz International Proceedings in Informatics. 45: 434-447. doi: 10.4230/LIPIcs.FSTTCS.2015.434
  • Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2015. Quick but odd growth of cacti. Leibniz International Proceedings in Informatics. 43: 258-269. doi: 10.4230/LIPIcs.IPEC.2015.258
  • Lokshtanov, Daniel; Misra, Pranabendu; Panolan, Fahad; Saurabh, Saket. 2015. Deterministic truncation of linear matroids. Lecture Notes in Computer Science. 9134: 922-934. doi: 10.1007/978-3-662-47672-7_75
  • Lokshtanov, Daniel; Mouawad, Amer E.; Panolan, Fahad; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2015. Reconfiguration on sparse graphs. Lecture Notes in Computer Science. 9214: 506-517. doi: 10.1007/978-3-319-21840-3_42
  • Panolan, Fahad; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2015. On the parameterized complexity of GIRTH and CONNECTIVITY problems on linear matroids. Lecture Notes in Computer Science. 9214: 566-577. doi: 10.1007/978-3-319-21840-3_47
  • Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket. 2015. B-chromatic number: Beyond NP-hardness. Leibniz International Proceedings in Informatics. 43: 389-401. doi: 10.4230/LIPIcs.IPEC.2015.389
  • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2014. Representative sets of product families. Lecture Notes in Computer Science. 8737 LNCS: 443-454. doi: 10.1007/978-3-662-44777-2_37

Se fullstendig oversikt over publikasjoner i CRIStin.