Results 111 to 120 of about 2,587 (156)

A polynomial bound on the pathwidth of graphs edge-coverable by $k$ shortest paths [PDF]

Julien Baste, Lucas De Meyer, Ugo Giocanti, Etienne Objois, Timothé Picavet   +4 more
openalex   +1 more source

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 [PDF]

, 2017
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma   +4 more
openalex   +1 more source

Maximum-scoring path sets on pangenome graphs of constant treewidth. [PDF]

Front Bioinform
Brejová B, Gagie T, Herencsárová E, Vinař T.   +3 more
europepmc   +1 more source

Algorithms for Outerplanar Graph Roots and Graph Roots of Pathwidth at Most 2 [PDF]

, 2019
Petr A. Golovach, Pinar Heggernes, Dieter Kratsch, Paloma T. Lima, Daniël Paulusma   +4 more
openalex   +1 more source

Smart Accessibility: Design Process of Integrated Geospatial Data Models to Present User-Customized Universal Design Information. [PDF]

Front Psychol, 2019
Han SR, Yoon S, Cho S.
europepmc   +1 more source

Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings [PDF]

, 2013
Thérèse Biedl, Thomas Bläsius, Benjamin Niedermann, Martin Nöllenburg, Roman Prutkin, Ignaz Rutter   +5 more
openalex   +1 more source

All ascents exponential from valued constraint graphs of pathwidth three

Artem Kaznatcheev, Willemijn Volgering
openalex   +1 more source

Exact and parameterized algorithms for choosability. [PDF]

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

Finding Cactus Roots in Polynomial Time. [PDF]

Theory Comput Syst, 2018
Golovach PA, Kratsch D, Paulusma D, Stewart A.   +3 more
europepmc   +1 more source