Results 141 to 150 of about 1,532 (205)

Approximating Sparsest Cut in Graphs of Bounded Treewidth [PDF]

, 2010
Eden Chlamtáč, Robert Krauthgamer, Prasad Raghavendra   +2 more
openalex   +1 more source

Treewidth-Based Algorithms for the Small Parsimony Problem on Networks

, 2021
Céline Scornavacca, Mathias Weller
openalex   +2 more sources

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion. [PDF]

Algorithmica
Blažej V, Jana S, Ramanujan MS, Strulo P.   +3 more
europepmc   +1 more source

A Dichotomy for 1-Planarity with Restricted Crossing Types Parameterized by Treewidth

Cabello, Sergio, Dobler, Alexander, Fijavž, Gašper, Hamm, Thekla, Wagner, Mirko H.   +4 more
openalex   +2 more sources

Exact and parameterized algorithms for choosability. [PDF]

Acta Inform
Bliznets I, Nederlof J.
europepmc   +1 more source

Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts

, 2023
Anagnostides I, Lenzen C, Haeupler B, Zuzic G, Gouleakis T.   +4 more
europepmc   +1 more source

Counting Temporal Paths. [PDF]

Algorithmica
Enright J, Meeks K, Molter H.
europepmc   +1 more source

Romeo and Juliet Meeting in Forest Like Regions

, 2023
Misra N, Mulpuri M, Tale P, Viramgami G.
europepmc   +1 more source

Treewidth of Outer k-Planar Graphs

Pyzik, Rafał
openalex   +1 more source

Slim Tree-Cut Width. [PDF]

Algorithmica
Ganian R, Korchemna V.
europepmc   +1 more source