## Stem treewidth$ (all stems)

### 34 papers:

- ICALP-v1-2015-FeldmannFKP #bound #graph
- A (1+ε ) ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (AEF, WSF, JK, IP), pp. 469–480.
- POPL-2015-ChatterjeeIPG #algebra #algorithm #constant #performance #recursion #state machine
- Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth (KC, RIJ, AP, PG), pp. 97–109.
- CAV-2015-ChatterjeeIP #algorithm #constant #graph #performance #verification
- Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs (KC, RIJ, AP), pp. 140–157.
- KR-2014-Razgon #bound #on the
- On OBDDs for CNFs of Bounded Treewidth (IR).
- STOC-2013-ChekuriC #graph
- Large-treewidth graph decompositions and applications (CC, JC), pp. 291–300.
- STOC-2013-GuptaTW #algorithm #bound #graph
- Sparsest cut on bounded treewidth graphs: algorithms and hardness results (AG, KT, DW), pp. 281–290.
- ICALP-v1-2013-BodlaenderCKN #algorithm #exponential #problem
- Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth (HLB, MC, SK, JN), pp. 196–207.
- ICML-c1-2013-KumarB #bound #graph #learning
- Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs (KSSK, FRB), pp. 525–533.
- CAV-2013-ChatterjeeL #algorithm #markov #performance #process
- Faster Algorithms for Markov Decision Processes with Low Treewidth (KC, JL), pp. 543–558.
- ICALP-v2-2012-FearnleyS #bound #game studies
- Time and Parallelizability Results for Parity Games with Bounded Treewidth (JF, SS), pp. 189–200.
- ICALP-v2-2012-KosowskiLNS #graph
- k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth (AK, BL, NN, KS), pp. 610–622.
- LATA-2012-ReidenbachS #bound
- Patterns with Bounded Treewidth (DR, MLS), pp. 468–479.
- ICALP-v1-2011-BodlaenderJK #analysis #combinator #kernel #preprocessor
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (HLB, BMPJ, SK), pp. 437–448.
- ICALP-v1-2011-FarzanK #distance #graph #navigation
- Compact Navigation and Distance Oracles for Graphs with Small Treewidth (AF, SK), pp. 268–280.
- GT-VMT-2011-BlumeBFK
- Treewidth, Pathwidth and Cospan Decompositions (CB, HJSB, MF, BK).
- STOC-2010-BateniHM #approximate #bound #graph
- Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth (MB, MH, DM), pp. 211–220.
- KR-2010-PichlerRSW #bound #constraints #programming
- Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough (RP, SR, SS, SW).
- PODS-2009-GottlobLV #bound #query
- Size and treewidth bounds for conjunctive queries (GG, STL, GV), pp. 45–54.
- SAT-2009-SamerV #encoding #satisfiability
- Encoding Treewidth into SAT (MS, HV), pp. 45–50.
- ICALP-A-2008-FominV #combinator
- Treewidth Computation and Extremal Combinatorics (FVF, YV), pp. 210–221.
- PODS-2007-GottlobPW #bound #datalog #finite #monad
- Monadic datalog over finite structures with bounded treewidth (GG, RP, FW), pp. 165–174.
- PODS-2006-GottlobPW #bound #database #design
- Tractable database design through bounded treewidth (GG, RP, FW), pp. 124–133.
- SAT-2006-ZabiyakaD #bound #complexity #dependence #functional
- Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies (YZ, AD), pp. 116–129.
- ICALP-2005-FialaGK #bound #distance #graph
- Distance Constrained Labelings of Graphs of Bounded Treewidth (JF, PAG, JK), pp. 360–372.
- LICS-2005-Atserias #on the #problem
- On Digraph Coloring Problems and Treewidth Duality (AA), pp. 106–115.
- ICALP-2004-FominKT #algorithm #exponential
- Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In (FVF, DK, IT), pp. 568–580.
- ICALP-1997-Hagerup #algorithm #bound #graph
- Dynamic Algorithms for Graphs of Bounded Treewidth (TH), pp. 292–302.
- ICALP-1995-BodlaenderH #algorithm #bound #parallel
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth (HLB, TH), pp. 268–279.
- ICALP-1995-ChaudhuriZ #graph #query
- Shortest Path Queries in Digraphs of Small Treewidth (SC, CDZ), pp. 244–255.
- TAGT-1994-ArnborgP #bound #graph #subclass
- A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths (SA, AP), pp. 469–486.
- STOC-1993-Bodlaender #algorithm #linear
- A linear time algorithm for finding tree-decompositions of small treewidth (HLB), pp. 226–234.
- ICALP-1993-BodlaenderKK #graph #permutation
- Treewidth and Pathwidth of Permutation Graphs (HLB, TK, DK), pp. 114–125.
- ICALP-1991-BodlaenderK #algorithm #graph
- Better Algorithms for the Pathwidth and Treewidth of Graphs (HLB, TK), pp. 544–555.
- ICALP-1988-Bodlaender #bound #graph #programming
- Dynamic Programming on Graphs with Bounded Treewidth (HLB), pp. 105–118.