Search the dblp DataBase
Udi Rotics :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Martin Charles Golumbic , Aviad Mintz , Udi Rotics Factoring and Recognition of Read-Once Functions using Cographs and Normality. [Citation Graph (0, 0)][DBLP ] DAC, 2001, pp:109-114 [Conf ] Derek G. Corneil , Michel Habib , Jean-Marc Lanlignel , Bruce A. Reed , Udi Rotics Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP ] LATIN, 2000, pp:126-134 [Conf ] Daniel Kobler , Udi Rotics Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). [Citation Graph (0, 0)][DBLP ] SODA, 2001, pp:468-476 [Conf ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Clique-width minimization is NP-hard. [Citation Graph (0, 0)][DBLP ] STOC, 2006, pp:354-362 [Conf ] Hans L. Bodlaender , Udi Rotics Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. [Citation Graph (0, 0)][DBLP ] SWAT, 2002, pp:388-397 [Conf ] Derek G. Corneil , Udi Rotics On the Relationship between Clique-Width and Treewidth. [Citation Graph (0, 0)][DBLP ] WG, 2001, pp:78-90 [Conf ] Bruno Courcelle , Johann A. Makowsky , Udi Rotics Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. [Citation Graph (0, 0)][DBLP ] WG, 1998, pp:1-16 [Conf ] Martin Charles Golumbic , Udi Rotics On the Clique-Width of Perfect Graph Classes. [Citation Graph (0, 0)][DBLP ] WG, 1999, pp:135-147 [Conf ] Johann A. Makowsky , Udi Rotics , Ilya Averbouch , Benny Godlin Computing Graph Polynomials on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP ] WG, 2006, pp:191-204 [Conf ] Hans L. Bodlaender , Udi Rotics Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:36, n:4, pp:375-408 [Journal ] Daniel Kobler , Udi Rotics 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. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2003, v:37, n:4, pp:327-346 [Journal ] Bruno Courcelle , Johann A. Makowsky , Udi Rotics On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:23-52 [Journal ] Daniel Kobler , Udi Rotics Edge dominating set and colorings on graphs with fixed clique-width. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:126, n:2-3, pp:197-221 [Journal ] Uri N. Peled , Udi Rotics Equistable chordal graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:203-210 [Journal ] Martin Charles Golumbic , Aviad Mintz , Udi Rotics Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2006, v:154, n:10, pp:1465-1477 [Journal ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Proving NP-hardness for clique-width I: non-approximability of sequential clique-width [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:080, pp:- [Journal ] Michael R. Fellows , Frances A. Rosamond , Udi Rotics , Stefan Szeider Proving NP-hardness for clique-width II: non-approximability of clique-width [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:081, pp:- [Journal ] G. Venkatesan , Udi Rotics , M. S. Madanlal , Johann A. Makowsky , C. Pandu Rangan Restrictions of Minimum Spanner Problems. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1997, v:136, n:2, pp:143-164 [Journal ] Martin Charles Golumbic , Udi Rotics On the Clique-Width of Some Perfect Graph Classes. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 2000, v:11, n:3, pp:423-443 [Journal ] Johann A. Makowsky , Udi Rotics On the Clique-Width of Graphs with Few P4 's. [Citation Graph (0, 0)][DBLP ] Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:329-348 [Journal ] Bruno Courcelle , Johann A. Makowsky , Udi Rotics Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2000, v:33, n:2, pp:125-150 [Journal ] Derek G. Corneil , Udi Rotics On the Relationship Between Clique-Width and Treewidth. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:34, n:4, pp:825-847 [Journal ] Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. [Citation Graph (, )][DBLP ] Equistable distance-hereditary graphs. [Citation Graph (, )][DBLP ] An improvement on the complexity of factoring read-once Boolean functions. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.302secs