Results 141 to 150 of about 1,532 (205)
Approximating Sparsest Cut in Graphs of Bounded Treewidth [PDF]
Eden Chlamtáč +2 more
openalex +1 more source
Treewidth-Based Algorithms for the Small Parsimony Problem on Networks
Céline Scornavacca, Mathias Weller
openalex +2 more sources
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]
Blažej V +3 more
europepmc +1 more source
A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth
Cabello, Sergio +4 more
openalex +2 more sources
Exact and parameterized algorithms for choosability. [PDF]
Bliznets I, Nederlof J.
europepmc +1 more source
Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts
Anagnostides I +4 more
europepmc +1 more source
Romeo and Juliet Meeting in Forest Like Regions
Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc +1 more source

