The following pages link to (Q4291429):
Displaying 50 items.
- On the complexity of the FIFO stack-up problem (Q261535) (← links)
- Improving robustness of next-hop routing (Q266050) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Approximate tree decompositions of planar graphs in linear time (Q306256) (← links)
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Optimization problems in dotted interval graphs (Q400519) (← links)
- Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem (Q405143) (← links)
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Treewidth of Erdős-Rényi random graphs, random intersection graphs, and scale-free random graphs (Q412366) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- Satisfiability, branch-width and Tseitin tautologies (Q430830) (← links)
- Treewidth governs the complexity of target set selection (Q456700) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- A fast and simple subexponential fixed parameter algorithm for one-sided crossing minimization (Q494803) (← links)
- On the advice complexity of the \(k\)-server problem under sparse metrics (Q503460) (← links)
- On the path-width of integer linear programming (Q515665) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Constant-factor approximations of branch-decomposition and largest grid minor of planar graphs in \(O(n^{1+\epsilon})\) time (Q553343) (← links)
- Scale free properties of random \(k\)-trees (Q626908) (← links)
- On the complexity of some colorful problems parameterized by treewidth (Q627124) (← links)
- Minesweeper on graphs (Q632908) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- A simple linear-time algorithm for finding path-decompositions of small width (Q672094) (← links)
- Girth and treewidth (Q707020) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Complexity of secure sets (Q722534) (← links)
- The treewidth of line graphs (Q723884) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows (Q827589) (← links)
- Geometric representation of graphs in low dimension using axis parallel boxes (Q848956) (← links)
- Matroid tree-width (Q852702) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- A new probabilistic constraint logic programming language based on a generalised distribution semantics (Q896427) (← links)
- Practical algorithms for branch-decompositions of planar graphs (Q896665) (← links)
- A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs (Q938338) (← links)
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On the complexity of some subgraph problems (Q967414) (← links)
- A graph search algorithm for indoor pursuit/evasion (Q970034) (← links)
- Bijective linear time coding and decoding for \(k\)-trees (Q970106) (← links)
- Independence polynomials of \(k\)-tree related graphs (Q972329) (← links)
