Showing 1 - 9 of 9

1

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; et al.
27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010. :251-262

Nancy, France Parameterized Subexponen... Directed Graphs Out-Branching Internal Out-Branching ACM: G.: Mathematics of...
Conference
Save to List
2

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs
Marx, Dániel ; Misra, Pranabendu ; Neuen, Daniel ; et al.

Computer Science - Data... Computer Science - Compu...
Report
Save to List
4

Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs
Dorn, Frederic ; Fomin, Fedor V. ; Lokshtanov, Daniel ; et al.
Information and Computation. 233:60-70

FOS: Computer and inform... F.2.2 G.2.2 Discrete Mathematics (cs... Directed Graphs [INFO.INFO-DS] Computer...
Academic journal
Save to List
5

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs.
Dániel Marx ; Pranabendu Misra ; Daniel Neuen ; et al.
CoRR. abs/2110.15098

Academic journal
Save to List
6

Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.
Frederic Dorn ; Fedor V. Fomin ; Daniel Lokshtanov ; et al.
STACS. :251-262

Conference
Save to List
8

Subexponential algorithms for partial cover problems
Fomin, Fedor V. ; Lokshtanov, Daniel ; Raman, Venkatesh ; et al.
In Information Processing Letters 2011 111(16):814-818

Academic journal
Save to List

Filter