Pages that link to "Item:Q2827797"
From MaRDI portal
The following pages link to Graph-Theoretic Concepts in Computer Science (Q2827797):
Displaying 50 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- Unsplittable coverings in the plane (Q317324) (← links)
- Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs (Q497674) (← links)
- Approximate association via dissociation (Q505447) (← links)
- Certifying 3-edge-connectivity (Q513265) (← links)
- Induced minor free graphs: isomorphism and clique-width (Q1702118) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Parameterized two-player Nash equilibrium (Q1949741) (← links)
- Parameterized complexity of the MinCCA problem on graphs of bounded decomposability (Q2399617) (← links)
- Parameterized algorithms for graph partitioning problems (Q2408556) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- On the Complexity of Approximation and Online Scheduling Problems with Applications to Optical Networks (Q2827800) (← links)
- The Stable Fixtures Problem with Payments (Q2827801) (← links)
- Complexity of Secure Sets (Q2827802) (← links)
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks (Q2827807) (← links)
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
- Finding Paths in Grids with Forbidden Transitions (Q2827809) (← links)
- The Maximum Time of 2-neighbour Bootstrap Percolation in Grid Graphs and Parametrized Results (Q2827810) (← links)
- Minimum Eccentricity Shortest Paths in Some Structured Graph Classes (Q2827811) (← links)
- Approximating Source Location and Star Survivable Network Problems (Q2827812) (← links)
- On the Complexity of Computing the k-restricted Edge-connectivity of a Graph (Q2827813) (← links)
- Weak Unit Disk and Interval Representation of Graphs (Q2827814) (← links)
- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes (Q2827815) (← links)
- An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes (Q2827816) (← links)
- On the Complexity of Probe and Sandwich Problems for Generalized Threshold Graphs (Q2827819) (← links)
- Colouring and Covering Nowhere Dense Graphs (Q2827820) (← links)
- Parity Linkage and the Erdős-Pósa Property of Odd Cycles Through Prescribed Vertices in Highly Connected Graphs (Q2827821) (← links)
- Well-quasi-ordering Does Not Imply Bounded Clique-width (Q2827822) (← links)
- A Slice Theoretic Approach for Embedding Problems on Digraphs (Q2827823) (← links)
- Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
- Saturated Simple and 2-simple Topological Graphs with Few Edges (Q2827825) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- Triangulating Planar Graphs While Keeping the Pathwidth Small (Q2827827) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Recognizing k-equistable Graphs in FPT Time (Q2827831) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Tree-Like Structures in Graphs: A Metric Point of View (Q2864284) (← links)
- Overview of New Approaches for Approximating TSP (Q2864285) (← links)
- Linear Rank-Width and Linear Clique-Width of Trees (Q2864286) (← links)
- Threshold-Coloring and Unit-Cube Contact Representation of Graphs (Q2864287) (← links)
- Rolling Upward Planarity Testing of Strongly Connected Graphs (Q2864288) (← links)
- Towards a Provably Resilient Scheme for Graph-Based Watermarking (Q2864290) (← links)
