Work

An Exponential Time Parameterized Algorithm for Planar Disjoint Paths

Year: 2025

Type: article

Source: SIAM Journal on Computing

DOI: 10.1137/20m1355902

Authors: Daniel Lokshtanov, Pranabendu Misra, Michal Pilipczuk, Saket Saurabh, Meirav Zehavi

Institutions: University of California, Santa Barbara, Chennai Mathematical Institute, University of Warsaw, Research Lab in Computer Science, University of Bergen, Institute of Mathematical Sciences, Ben-Gurion University of the Negev

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

Funders: United States-Israel Binational Science Foundation, Israel Science Foundation, Fundamental Research Funds for the Central Universities

Awards: G5082504313, G5730270640, G6623332439, G7225649516, G7702557058, G7996078985, G8190667764

OpenAlex ID: W3149994998

FWCI: 0.48

Cites: 37

Cited by: 1

Related to: 10