The following pages link to (Q3683903):
Displaying 50 items.
- Stability number of bull- and chair-free graphs revisited (Q1408811) (← links)
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs (Q1414581) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time (Q1693130) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- An efficient exact algorithm for triangle listing in large graphs (Q1741284) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- Single machine scheduling with precedence constraints and positionally dependent processing times (Q1762097) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width (Q1764808) (← links)
- Network decomposition-based benchmark results for the discrete time-cost tradeoff problem (Q1772839) (← links)
- Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- Recognition of some perfectly orderable graph classes (Q1811119) (← links)
- Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time. (Q1853148) (← links)
- An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures (Q1897475) (← links)
- \(N\)-extendible posets, and how to minimize total weighted completion time (Q1962041) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- The mathematics of xenology: di-cographs, symbolic ultrametrics, 2-structures and tree-representable systems of binary relations (Q2014353) (← links)
- Maximum weight independent sets for (\(S_{1,2,4}\),triangle)-free graphs in polynomial time (Q2043008) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Modular decomposition of graphs and the distance preserving property (Q2312661) (← links)
- Some observations on maximum weight stable sets in certain \(P_{5}\)-free graphs (Q2384837) (← links)
- The complexity of modular decomposition of Boolean functions (Q2387426) (← links)
- More results on weighted independent domination (Q2410364) (← links)
- Simple permutations and algebraic generating functions (Q2426423) (← links)
- Counting spanning trees using modular decomposition (Q2437761) (← links)
- Recognition of prime graphs from a prime subgraph (Q2449165) (← links)
- Stable sets of maximum weight in (\(P_{7}\), banner)-free graphs (Q2463465) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic (Q2481975) (← links)
- The monadic second-order logic of graphs. XV: On a conjecture by D. Seese (Q2494727) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Resolutions of convex geometries (Q2665967) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Complete edge-colored permutation graphs (Q2672966) (← links)
- Unifying the representation of symmetric crossing families and weakly partitive families (Q2851484) (← links)
- Arc-disjoint paths in decomposable digraphs (Q2922218) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Miscellaneous Digraph Classes (Q3120443) (← links)
- On -sparse graphs and other families (Q3439147) (← links)
- Graph decompositions definable in monadic second-order logic (Q3439302) (← links)
- The bi-join decomposition (Q3439330) (← links)
- Probe Ptolemaic Graphs (Q3511358) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- O(m logn) Split Decomposition of Strongly Connected Graphs (Q3655150) (← links)
