The following pages link to Udi Rotics (Q266932):
Displaying 31 items.
- (Q169281) (redirect page) (← links)
- Clique-width of path powers (Q266933) (← links)
- Polynomial-time recognition of clique-width \(\leq 3\) graphs (Q415285) (← links)
- An improvement on the complexity of factoring read-once Boolean functions (Q944714) (← links)
- Restrictions of minimum spanner problems (Q1370655) (← links)
- Computing the treewidth and the minimum fill-in with the modular decomposition (Q1402225) (← links)
- Equistable chordal graphs (Q1414594) (← links)
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size (Q1762983) (← links)
- Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
- Linear time solvable optimization problems on graphs of bounded clique-width (Q1974445) (← links)
- Clique-width of full bubble model graphs (Q2341723) (← links)
- A characterisation of clique-width through nested partitions (Q2348055) (← links)
- Equistable distance-hereditary graphs (Q2473043) (← links)
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees (Q2492223) (← links)
- (Q2768335) (← links)
- Clique-width minimization is NP-hard (Q2931399) (← links)
- Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width (Q3007630) (← links)
- Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition (Q3046514) (← links)
- Read-Once Functions Revisited and the Readability Number of a Boolean Function (Q3439365) (← links)
- Computing Graph Polynomials on Graphs of Bounded Clique-Width (Q3522957) (← links)
- Clique-Width is NP-Complete (Q3563951) (← links)
- Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width (Q3569083) (← links)
- (Q4232773) (← links)
- (Q4448749) (← links)
- (Q4508369) (← links)
- (Q4944973) (← links)
- (Q4949812) (← links)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008) (← links)
- ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES (Q5249049) (← links)
- On the Relationship Between Clique-Width and Treewidth (Q5317177) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
