Udi Rotics

Publication Activity (10 Years)

Years Active: 1997-2016
Publications (10 Years): 1

Top Topics

Graph Isomorphism

Independent Set

Graph Properties

Top Venues

Discret. Appl. Math.

Publications

Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
Clique-width of path powers. Discret. Appl. Math. 205 (2016)
Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187 (2015)
Daniel Meister, Udi Rotics
Clique-width of full bubble model graphs. Discret. Appl. Math. 185 (2015)
Daniel Meister, Udi Rotics
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. CoRR (2013)
Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160 (6) (2012)
Pinar Heggernes, Daniel Meister, Udi Rotics
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR (2011)
Pinar Heggernes, Daniel Meister, Udi Rotics
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC (2010)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Clique-Width is NP-Complete. SIAM J. Discret. Math. 23 (2) (2009)
Ephraim Korach, Uri N. Peled, Udi Rotics
Equistable distance-hereditary graphs. Discret. Appl. Math. 156 (4) (2008)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
An improvement on the complexity of factoring read-once Boolean functions. Discret. Appl. Math. 156 (10) (2008)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Clique-width minimization is NP-hard. STOC (2006)
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. Discret. Appl. Math. 154 (10) (2006)
Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin
Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG (2006)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electron. Colloquium Comput. Complex. (080) (2005)
Derek G. Corneil, Udi Rotics
On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34 (4) (2005)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electron. Notes Discret. Math. 22 (2005)
Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Proving NP-hardness for clique-width II: non-approximability of clique-width Electron. Colloquium Comput. Complex. (081) (2005)
Hans L. Bodlaender, Udi Rotics
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36 (4) (2003)
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. Algorithmica 37 (4) (2003)
Daniel Kobler, Udi Rotics
Edge dominating set and colorings on graphs with fixed clique-width. Discret. Appl. Math. 126 (2-3) (2003)
Uri N. Peled, Udi Rotics
Equistable chordal graphs. Discret. Appl. Math. 132 (1-3) (2003)
Hans L. Bodlaender, Udi Rotics
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT (2002)
Daniel Kobler, Udi Rotics
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). SODA (2001)
Martin Charles Golumbic, Aviad Mintz, Udi Rotics
Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC (2001)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discret. Appl. Math. 108 (1-2) (2001)
Derek G. Corneil, Udi Rotics
On the Relationship between Clique-Width and Treewidth. WG (2001)
Martin Charles Golumbic, Udi Rotics
On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11 (3) (2000)
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). LATIN (2000)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst. 33 (2) (2000)
Martin Charles Golumbic, Udi Rotics
On the Clique-Width of Perfect Graph Classes. WG (1999)
Johann A. Makowsky, Udi Rotics
's. Int. J. Found. Comput. Sci. 10 (3) (1999)
Bruno Courcelle, Johann A. Makowsky, Udi Rotics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG (1998)
G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
Restrictions of Minimum Spanner Problems. Inf. Comput. 136 (2) (1997)