Udi Rotics
According to our database1,
Udi Rotics
authored at least 31 papers
between 1997 and 2016.
Collaborative distances:
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 OtherLinks
Online presence:
On csauthors.net:
Bibliography
2016
2015
Discret. Appl. Math., 2015
2013
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width.
CoRR, 2013
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
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010
2009
2008
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
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, 2006
2005
Electron. Notes Discret. Math., 2005
Electron. Colloquium Comput. Complex., 2005
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width
Electron. Colloquium Comput. Complex., 2005
2003
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
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
Proceedings of the 38th Design Automation Conference, 2001
2000
Theory Comput. Syst., 2000
Proceedings of the LATIN 2000: Theoretical Informatics, 2000
1999
Int. J. Found. Comput. Sci., 1999
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