Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Udi Rotics
2010 – today
- 2012
[j16]Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics 160(6): 834-865 (2012)- 2011
- [c11]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: 233-246
- 2010
- [c10]Pinar Heggernes, Daniel Meister, Udi Rotics: Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295
2000 – 2009
- 2009
- [j15]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-Width is NP-Complete. SIAM J. Discrete Math. 23(2): 909-939 (2009)
- 2008
- [j14]Ephraim Korach, Uri N. Peled, Udi Rotics: Equistable distance-hereditary graphs. Discrete Applied Mathematics 156(4): 462-477 (2008)
- [j13]Martin Charles Golumbic, Aviad Mintz, Udi Rotics: An improvement on the complexity of factoring read-once Boolean functions. Discrete Applied Mathematics 156(10): 1633-1636 (2008)
- 2006
- [j12]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. Discrete Applied Mathematics 154(10): 1465-1477 (2006)
- [c9]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
- [c8]Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin: Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG 2006: 191-204
- 2005
- [j11]Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electronic Notes in Discrete Mathematics 22: 357-361 (2005)
- [j10]Derek G. Corneil, Udi Rotics: On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005)
- [i2]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electronic Colloquium on Computational Complexity (ECCC)(080) (2005)
- [i1]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width II: non-approximability of clique-width. Electronic Colloquium on Computational Complexity (ECCC)(081) (2005)
- 2003
- [j9]Hans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003)
- [j8]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): 327-346 (2003)
- [j7]Daniel Kobler, Udi Rotics: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126(2-3): 197-221 (2003)
- [j6]Uri N. Peled, Udi Rotics: Equistable chordal graphs. Discrete Applied Mathematics 132(1-3): 203-210 (2003)
- 2002
- [c7]Hans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397
- 2001
- [j5]Bruno Courcelle, Johann A. Makowsky, Udi Rotics: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108(1-2): 23-52 (2001)
- [c6]Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114
- [c5]Daniel Kobler, Udi Rotics: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). SODA 2001: 468-476
- [c4]Derek G. Corneil, Udi Rotics: On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90
- 2000
- [j4]Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000)
- [j3]Bruno Courcelle, Johann A. Makowsky, Udi Rotics: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst. 33(2): 125-150 (2000)
- [c3]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: 126-134
1990 – 1999
- 1999
- [j2]Johann A. Makowsky, Udi Rotics: On the Clique-Width of Graphs with Few P4's. Int. J. Found. Comput. Sci. 10(3): 329-348 (1999)
- [c2]
- 1998
- [c1]Bruno Courcelle, Johann A. Makowsky, Udi Rotics: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG 1998: 1-16
- 1997
- [j1]G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan: Restrictions of Minimum Spanner Problems. Inf. Comput. 136(2): 143-164 (1997)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-08 21:05 CET by the dblp team