Items where authors include "Panolan, F."

Article

Aute, S. orcid.org/0009-0000-2964-0368 and Panolan, F. orcid.org/0000-0001-6213-8687 (2025) Parameterized algorithms for minimum sum vertex cover. Theoretical Computer Science, 1029. 115032. ISSN 0304-3975

Panolan, F. orcid.org/0000-0001-6213-8687 and Yaghoubizade, H. (2025) On MAX–SAT with cardinality constraint. Theoretical Computer Science, 1025. 114971. ISSN 0304-3975

Gowda, K.N., Lonkar, A., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (2 more authors) (2024) Improved FPT Algorithms for Deletion to Forest-Like Structures. Algorithmica, 86. pp. 1657-1699. ISSN 0178-4617

Proceedings Paper

Panolan, F. orcid.org/0000-0001-6213-8687 and Yaghoubizade, H. (2025) On MAX–SAT with Cardinality Constraint. In: Uehara, R., Yamanaka, K. and Yen, H.C., (eds.) WALCOM: Algorithms and Computation. 18th International Conference and Workshops on Algorithms and Computation (WALCOM 2024), 18-20 Mar 2024, Kanazawa, Japan. Lecture Notes in Computer Science, 14549 . Springer , pp. 118-133. ISBN 978-981-97-0566-5

Agrawal, A., Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687 et al. (2 more authors) (2025) Parameterized Saga of First-Fit and Last-Fit Coloring. In: Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025). The 42nd International Symposium on Theoretical Aspects of Computer Science (STACS 2025), 04-07 Mar 2025, Jena, Germany. Leibniz International Proceedings in Informatics (LIPIcs), 327 (5). Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 5:1-5:21.

Aute, S., Panolan, F. orcid.org/0000-0001-6213-8687, Saha, S. et al. (2 more authors) (2025) Parameterized Complexity of Generalizations of Edge Dominating Set. In: 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025). 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025), 20-23 Jan 2025, Bratislava, Slovakia. Lecture Notes in Computer Science, 15538 . Springer , Cham, Switzerland , pp. 65-79. ISBN 978-3-031-82669-6

Ghasemi Nezhad, S., Moghaddas, M. and Panolan, F. orcid.org/0000-0001-6213-8687 (2025) Fast FPT Algorithms for Grundy Number on Dense Graphs. In: Algorithms and Discrete Applied Mathematics 11th International Conference, CALDAM 2025, Coimbatore, India, February 13–15, 2025, Proceedings. 11th Annual International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2025), 13-15 Feb 2025, Coimbatore, Tamilnadu, India. Lecture Notes in Computer Science . Springer , Cham, Switzerland , pp. 160-172. ISBN 978-3-031-83437-0

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (3 more authors) (2025) Crossing Number in Slightly Superexponential Time (Extended Abstract). In: Azar, Y. and Panigrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1412-1424. ISBN 978-1-61197-832-2

Bentert, M., Fomin, F.V., Golovach, P.A. et al. (6 more authors) (2025) Packing Short Cycles. In: Azar, Y. and Pangrahi, D., (eds.) Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM-SIAM Symposium on Discrete Algorithms (SODA25), 12-15 Jan 2025, New Orleans, Louisiana, U.S.A.. SIAM , pp. 1425-1463. ISBN 978-1-61197-832-2

Panolan, F. orcid.org/0000-0001-6213-8687, Mathew, R. and Seshikanth (2024) Parameterized Algorithms and Hardness for the Maximum Edge q-Coloring Problem. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024), 16-18 Dec 2024, Gandhinagar, India. Leibniz International Proceedings in Informatics (LIPIcs), 323 . LIPIcs , Wadern, Germany , 31:1-31:12. ISBN 978-3-95977-355-3

Gupta, S., Inamdar, T., Jain, P. et al. (3 more authors) (2024) When far is better: The Chamberlin-Courant approach to obnoxious committee selection. In: 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024). 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024), 16-18 Dec 2024, Gandhinagar, India. Leibniz International Proceedings in Informatics (LIPIcs), 323 . LIPIcs , Wadern, Germany , 24:1-24:21. ISBN 978-3-95977-355-3

Bandopadhyay, S., Banerjee, S., Majumdar, D. et al. (1 more author) (2024) Parameterized Complexity of Shortest Path with Positive Disjunctive Constraints. In: Proceedings of the 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024). 17th International Conference on Combinatorial Optimization and Applications (COCOA 2024), 06-08 Dec 2024, Beijing, China. Lecture Notes in Computer Science . Springer . (In Press)

Lokshtanov, D., Panolan, F. orcid.org/0000-0001-6213-8687, Saurabh, S. et al. (2 more authors) (2024) Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3. In: In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2024). APPROX/RANDOM 2024, 28-30 Aug 2024, London. Leibniz International Proceedings in Informatics (LIPIcs), 317 . LIPIcs , Wadern, Germany , 6:1-6:14. ISBN 978-3-95977-348-5

Chakraborty, D., Müller, H., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (2 more authors) (2024) Covering and Partitioning of Split, Chain and Cographs with Isometric Paths. In: Proceedings of 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024). 49th International Symposium on Mathematical Foundations of Computer Science, 26-30 Aug 2024, Bratislava, Slovakia. Leibniz International Proceedings in Informatics (LIPIcs) . Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 39:1-39:14.

Eriksson, L., Lagerkvist, V., Ordyniak, S. orcid.org/0000-0003-1935-651X et al. (3 more authors) (2024) Solving Quantified Boolean Formulas with Few Existential Variables. In: Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence. IJCAI 2024, 03-09 Aug 2024, Jeju Island, South Korea. IJCAI , California, USA , pp. 1889-1897. ISBN 978-1-956792-04-1

Kanesh, L., Panolan, F. orcid.org/0000-0001-6213-8687, Ramanujan, M.S. et al. (1 more author) (2024) Decremental Sensitivity Oracles for Covering and Packing Minors. In: Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), 12-14 Mar 2024, Clermont-Ferrand, France. Leibniz International Proceedings in Informatics (LIPIcs), 289 . Schloss Dagstuhl – Leibniz-Zentrum für Informatik . ISBN 978-3-95977-311-9

Aute, S. and Panolan, F. orcid.org/0000-0001-6213-8687 (2024) Parameterized Algorithms for Minimum Sum Vertex Cover. In: Soto, J.A. and Wiese, A., (eds.) LATIN 2024: Theoretical Informatics 16th Latin American Symposium, Puerto Varas, Chile, March 18–22, 2024, Proceedings, Part II. LATIN 2024: Latin American Symposium on Theoretical Informatics, 18-22 Mar 2024, Puerto Varas, Chile. Lecture Notes in Computer Science, 14579 . Springer , pp. 193-207. ISBN 978-3-031-55601-2

Lokshtanov, D., Misra, P., Panolan, F. et al. (3 more authors) (2024) Meta-theorems for Parameterized Streaming Algorithms. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (SODA24). ACM-SIAM Symposium on Discrete Algorithms (SODA24), 07-10 Jan 2024, Alexandria, Virginia, USA. Society for Industrial and Applied Mathematics (SIAM) , Philadelphia, PA , pp. 712-739. ISBN 978-1-61197-791-2