Restrictions of Minimum Spanner Problems. - G. Venkatesan; Udi Rotics; M. S. Madanlal; Johann A. Makowsky; C. Pandu Rangan (Inf. Comput., 1997)

Efficient algorithms for generally intractable graph problems restricted to specific classes of graphs. - Udi Rotics (1998)

On the Clique-Width of Perfect Graph Classes. - Martin Charles Golumbic; Udi Rotics (WG, 1999)

On the Clique-Width of Graphs with Few P4's. - Johann A. Makowsky; Udi Rotics (Int. J. Found. Comput. Sci., 1999)

Polynomial Time Recognition of Clique-Width le leq 3 Graphs (Extended Abstract). - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (LATIN, 2000)

On the Clique-Width of Some Perfect Graph Classes. - Martin Charles Golumbic; Udi Rotics (Int. J. Found. Comput. Sci., 2000)

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. - Bruno Courcelle; Johann A. Makowsky; Udi Rotics (Theory Comput. Syst., 2000)

Factoring and Recognition of Read-Once Functions using Cographs and Normality. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (DAC, 2001)

Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). - Daniel Kobler; Udi Rotics (SODA, 2001)

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. - Bruno Courcelle; Johann A. Makowsky; Udi Rotics (Discret. Appl. Math., 2001)

Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. - Hans L. Bodlaender; Udi Rotics (Algorithmica, 2003)

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. - Daniel Kobler; Udi Rotics (Algorithmica, 2003)

Edge dominating set and colorings on graphs with fixed clique-width. - Daniel Kobler; Udi Rotics (Discret. Appl. Math., 2003)

Equistable chordal graphs. - Uri N. Peled; Udi Rotics (Discret. Appl. Math., 2003)

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (Electron. Colloquium Comput. Complex., 2005)

Proving NP-hardness for clique-width II: non-approximability of clique-width - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (Electron. Colloquium Comput. Complex., 2005)

Read-Once Functions Revisited and the Readability Number of a Boolean Function. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (Electron. Notes Discret. Math., 2005)

On the Relationship Between Clique-Width and Treewidth. - Derek G. Corneil; Udi Rotics (SIAM J. Comput., 2005)

Clique-width minimization is NP-hard. - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (STOC, 2006)

Computing Graph Polynomials on Graphs of Bounded Clique-Width. - Johann A. Makowsky; Udi Rotics; Ilya Averbouch; Benny Godlin (WG, 2006)

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (Discret. Appl. Math., 2006)

An improvement on the complexity of factoring read-once Boolean functions. - Martin Charles Golumbic; Aviad Mintz; Udi Rotics (Discret. Appl. Math., 2008)

Equistable distance-hereditary graphs. - Ephraim Korach; Uri N. Peled; Udi Rotics (Discret. Appl. Math., 2008)

Clique-Width is NP-Complete. - Michael R. Fellows; Frances A. Rosamond; Udi Rotics; Stefan Szeider (SIAM J. Discret. Math., 2009)

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. - Pinar Heggernes; Daniel Meister 001; Udi Rotics (TAMC, 2010)

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. - Pinar Heggernes; Daniel Meister 001; Udi Rotics (CSR, 2011)

Polynomial-time recognition of clique-width ≤3 graphs. - Derek G. Corneil; Michel Habib; Jean-Marc Lanlignel; Bruce A. Reed; Udi Rotics (Discret. Appl. Math., 2012)

Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. - Daniel Meister 001; Udi Rotics (CoRR, 2013)

A characterisation of clique-width through nested partitions. - Bruno Courcelle; Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos; Udi Rotics (Discret. Appl. Math., 2015)

Clique-width of full bubble model graphs. - Daniel Meister 001; Udi Rotics (Discret. Appl. Math., 2015)

Clique-width of path powers. - Pinar Heggernes; Daniel Meister 001; Charis Papadopoulos; Udi Rotics (Discret. Appl. Math., 2016)