Udi Rotics

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