| 2011 | CSR | Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2010 | TAMC | Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. | Pinar Heggernes, Daniel Meister, Udi Rotics |
| 2006 | STOC | Clique-width minimization is NP-hard. | Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider |
| 2006 | WG | Computing Graph Polynomials on Graphs of Bounded Clique-Width. | Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin |
| 2001 | DAC | Factoring and Recognition of Read-Once Functions using Cographs and Normality. | Martin Charles Golumbic, Aviad Mintz, Udi Rotics |
| 2001 | SODA | Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). | Daniel Kobler, Udi Rotics |
| 2001 | WG | On the Relationship between Clique-Width and Treewidth. | Derek G. Corneil, Udi Rotics |
| 2000 | LATIN | 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 |
| 1999 | WG | On the Clique-Width of Perfect Graph Classes. | Martin Charles Golumbic, Udi Rotics |
| 1998 | WG | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |