Udi Rotics

According to our database1, Udi Rotics authored at least 31 papers between 1997 and 2016.

Collaborative distances:

Timeline

1998
2000
2002
2004
2006
2008
2010
2012
2014
2016
0
1
2
3
4
5
1
2
1
1
1
2
1
4
4
1
2
1
1
1
1
2
2
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2016
Clique-width of path powers.
Discret. Appl. Math., 2016

2015
Clique-width of full bubble model graphs.
Discret. Appl. Math., 2015

A characterisation of clique-width through nested partitions.
Discret. Appl. Math., 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.
Discret. Appl. Math., 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. Discret. Math., 2009

2008
Equistable distance-hereditary graphs.
Discret. Appl. Math., 2008

An improvement on the complexity of factoring read-once Boolean functions.
Discret. Appl. Math., 2008

2006
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees.
Discret. Appl. Math., 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.
Electron. Notes Discret. Math., 2005

Proving NP-hardness for clique-width II: non-approximability of clique-width
Electron. Colloquium Comput. Complex., 2005

Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex., 2005

2003
Equistable chordal graphs.
Discret. Appl. Math., 2003

Edge dominating set and colorings on graphs with fixed clique-width.
Discret. Appl. Math., 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

2001
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic.
Discret. Appl. Math., 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<sub>4</sub>'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
Efficient algorithms for generally intractable graph problems restricted to specific classes of graphs.
PhD thesis, 1998

1997
Restrictions of Minimum Spanner Problems.
Inf. Comput., 1997


  Loading...