Results 51 to 60 of about 2,459 (116)
Seymour’s Conjecture on 2-Connected Graphs of Large Pathwidth [PDF]
, 2020 Tony Huynh +7 more
openalex +1 more source
Minor-Closed Graph Classes with Bounded Layered Pathwidth [PDF]
, 2020 Vida Dujmović +4 more
openalex +1 more source
Parameterized Compilation Lower Bounds for Restricted CNF-formulas
, 2016 We show unconditional parameterized lower bounds in the area of knowledge compilation, more specifically on the size of circuits in decomposable negation normal form (DNNF) that encode CNF-formulas restricted by several graph width measures.
A Darwiche +12 more
core +1 more source
The treewidth and pathwidth of graph unions [PDF]
, 2022 Bogdan Alecu +5 more
openalex +1 more source
On the complexity of freezing automata networks of bounded pathwidth
, 2023 Eric Goles +3 more
openalex +1 more source
TREEWIDTH and PATHWIDTH parameterized by vertex cover [PDF]
, 2022 Mathieu Chapelle +3 more
openalex +1 more source
, 2017 An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al.
Wilson, Tim E., Wood, David R.
core
$2$-Layer $k$-Planar Graphs: Density, Crossing Lemma, Relationships, and Pathwidth [PDF]
, 2022 Patrizio Angelini +3 more
openalex +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Algorithmica, 2022 Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source