Pages that link to "Item:Q2641288"
From MaRDI portal
The following pages link to The monadic second-order logic of graphs. I: Recognizable sets of finite graphs (Q2641288):
Displayed 50 items.
- Computing partial hypergraphs of bounded width (Q2686128) (← links)
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) (Q2692778) (← links)
- Grid induced minor theorem for graphs of small degree (Q2692786) (← links)
- Fixed parameterized algorithms for generalized feedback vertex set problems (Q2693637) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- A $c^k n$ 5-Approximation Algorithm for Treewidth (Q2799353) (← links)
- Causality in Bounded Petri Nets is MSO Definable (Q2820695) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Parameterized Complexity of Discrete Morse Theory (Q2828168) (← links)
- A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata (Q2830211) (← links)
- Integrating and Sampling Cuts in Bounded Treewidth Graphs (Q2833051) (← links)
- Finding good tree decompositions by local search (Q2839209) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Between Treewidth and Clique-Width (Q2945207) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- Exact Exponential Algorithms to Find a Tropical Connected Set of Minimum Size (Q2946015) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- Approximability of the Distance Independent Set Problem on Regular Graphs and Planar Graphs (Q2958319) (← links)
- Convex Independence in Permutation Graphs (Q2958358) (← links)
- Navigational and Rule-Based Languages for Graph Databases (Q2970302) (← links)
- Parameterized and Exact Algorithms for Class Domination Coloring (Q2971145) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- On Guarding Orthogonal Polygons with Sliding Cameras (Q2980898) (← links)
- Computing Role Assignments of Proper Interval Graphs in Polynomial Time (Q3000505) (← links)
- Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory (Q3010429) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- Euler Digraphs (Q3120436) (← links)
- (Q3121527) (← links)
- Kernelization of Cycle Packing with Relaxed Disjointness Constraints (Q3174716) (← links)
- Ensuring Correctness of Model Transformations While Remaining Decidable (Q3179408) (← links)
- On the Satisfiability of Quantum Circuits of Small Treewidth (Q3194714) (← links)
- Subexponential Fixed-Parameter Algorithms for Partial Vector Domination (Q3195339) (← links)
- A geometrical view of the determinization and minimization of finite-state automata (Q3210193) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- (Q3305348) (← links)
- (Q3386630) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Graph decompositions for cartesian products (Q3439368) (← links)
- Efficient Problem Solving on Tree Decompositions Using Binary Decision Diagrams (Q3449205) (← links)
- Provenance Circuits for Trees and Treelike Instances (Q3449465) (← links)
- A New Approach for Contact Graph Representations and Its Applications (Q3449814) (← links)