The following pages link to (Q3686754):
Displaying 50 items.
- A new LBFS-based algorithm for cocomparability graph recognition (Q344849) (← links)
- Aggregation of monotone reciprocal relations with application to group decision making (Q429412) (← links)
- Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
- Peakless functions on graphs (Q678883) (← links)
- Bipartite bithreshold graphs (Q688258) (← links)
- On transitive orientations with restricted covering graphs (Q845912) (← links)
- Scheduling of project networks (Q908839) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- On probe permutation graphs (Q967305) (← links)
- A polynomial algorithm for recognizing the \(\mathcal A\)-order class (Q1043599) (← links)
- Characterizations and recognition of circular-arc graphs and subclasses: a survey (Q1045049) (← links)
- Schedule-induced posets (Q1081529) (← links)
- On some complexity properties of N-free posets and posets with bounded decomposition diameter (Q1086264) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- Greedy posets for the bump-minimizing problem (Q1097902) (← links)
- An algorithm for solving the jump number problem (Q1113927) (← links)
- Unit disk graphs (Q1174134) (← links)
- Graphs and topologies on discrete sets (Q1197054) (← links)
- \(P_ 4\)-trees and substitution decomposition (Q1201812) (← links)
- Triangulating graphs with few \(P_4\)'s (Q1281383) (← links)
- Modular decomposition and transitive orientation (Q1301738) (← links)
- On the pathwidth of chordal graphs (Q1309811) (← links)
- The number of nonisomorphic posets having 12 elements (Q1314405) (← links)
- The smallest graphs with niche number three (Q1324325) (← links)
- A \(k\)-structure generalization of the theory of 2-structures (Q1334662) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- The order-interval hypergraph of a finite poset and the König property (Q1363653) (← links)
- On the closure of graphs under substitution (Q1377871) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- The mutual exclusion scheduling problem for permutation and comparability graphs. (Q1401918) (← links)
- Weak order polytopes. (Q1420590) (← links)
- Topological adjacency relations on \(Z^{n}\) (Q1603637) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- On the generation of circuits and minimal forbidden sets (Q1769072) (← links)
- Achromatic number is NP-complete for cographs and interval graphs (Q1825646) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Another note on Dilworth's decomposition theorem. (Q2249932) (← links)
- Independent domination in finitely defined classes of graphs: polynomial algorithms (Q2255037) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- Parameterized Algorithms for the Independent Set Problem in Some Hereditary Graph Classes (Q3000488) (← links)
- Introduction à l'algorithmique des objets partagés (Q4349778) (← links)
- A tight lower bound for primitivity in k-structures (Q4632456) (← links)
- How to use the minimal separators of a graph for its chordal triangulation (Q4645172) (← links)
- Optimal pricing of capacitated networks (Q5191131) (← links)
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph (Q5901434) (← links)