# Udi Rotics

According to our database

^{1}, Udi Rotics## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2016

Clique-width of path powers.

Discrete Applied Mathematics, 2016

2015

Clique-width of full bubble model graphs.

Discrete Applied Mathematics, 2015

A characterisation of clique-width through nested partitions.

Discrete Applied Mathematics, 2015

2013

Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width.

CoRR, 2013

2012

Polynomial-time recognition of clique-width ≤3 graphs.

Discrete Applied Mathematics, 2012

2011

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width.

Proceedings of the Computer Science - Theory and Applications, 2011

2010

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width.

Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

2009

Clique-Width is NP-Complete.

SIAM J. Discrete Math., 2009

2008

Equistable distance-hereditary graphs.

Discrete Applied Mathematics, 2008

An improvement on the complexity of factoring read-once Boolean functions.

Discrete Applied Mathematics, 2008

2006

Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees.

Discrete Applied Mathematics, 2006

Computing Graph Polynomials on Graphs of Bounded Clique-Width.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Clique-width minimization is NP-hard.

Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006

2005

On the Relationship Between Clique-Width and Treewidth.

SIAM J. Comput., 2005

Read-Once Functions Revisited and the Readability Number of a Boolean Function.

Electronic Notes in Discrete Mathematics, 2005

Proving NP-hardness for clique-width II: non-approximability of clique-width

Electronic Colloquium on Computational Complexity (ECCC), 2005

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width

Electronic Colloquium on Computational Complexity (ECCC), 2005

2003

Equistable chordal graphs.

Discrete Applied Mathematics, 2003

Edge dominating set and colorings on graphs with fixed clique-width.

Discrete Applied Mathematics, 2003

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, 2003

Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition.

Algorithmica, 2003

2002

Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition.

Proceedings of the Algorithm Theory, 2002

2001

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic.

Discrete Applied Mathematics, 2001

On the Relationship between Clique-Width and Treewidth.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract).

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

Factoring and Recognition of Read-Once Functions using Cographs and Normality.

Proceedings of the 38th Design Automation Conference, 2001

2000

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.

Theory Comput. Syst., 2000

On the Clique-Width of Some Perfect Graph Classes.

Int. J. Found. Comput. Sci., 2000

Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract).

Proceedings of the LATIN 2000: Theoretical Informatics, 2000

1999

On the Clique-Width of Graphs with Few P

_{4}'s.
Int. J. Found. Comput. Sci., 1999

On the Clique-Width of Perfect Graph Classes.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width.

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997

Restrictions of Minimum Spanner Problems.

Inf. Comput., 1997