Udi Rotics

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Clique-width of path powers	2016-04-07	Paper
A characterisation of clique-width through nested partitions	2015-06-10	Paper
ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P₄'S	2015-04-29	Paper
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES	2015-04-29	Paper
Clique-width of full bubble model graphs	2015-04-28	Paper
Clique-width minimization is NP-hard	2014-11-25	Paper
Polynomial-time recognition of clique-width \(\leq 3\) graphs	2012-05-11	Paper
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width	2011-06-17	Paper
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width	2010-06-17	Paper
Clique-Width is NP-Complete	2010-06-01	Paper
An improvement on the complexity of factoring read-once Boolean functions	2008-09-10	Paper
Computing Graph Polynomials on Graphs of Bounded Clique-Width	2008-09-04	Paper
Equistable distance-hereditary graphs	2008-02-26	Paper
Read-Once Functions Revisited and the Readability Number of a Boolean Function	2007-05-29	Paper
Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees	2006-06-09	Paper
On the Relationship Between Clique-Width and Treewidth	2005-09-16	Paper
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	2005-02-11	Paper
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition	2004-08-12	Paper
https://portal.mardi4nfdi.de/entity/Q4448749	2004-02-18	Paper
Equistable chordal graphs	2003-12-04	Paper
Computing the treewidth and the minimum fill-in with the modular decomposition	2003-08-19	Paper
Linear time solvable optimization problems on graphs of bounded clique-width	2003-03-18	Paper
Edge dominating set and colorings on graphs with fixed clique-width	2003-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q2768335	2002-03-14	Paper
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic	2001-11-09	Paper
https://portal.mardi4nfdi.de/entity/Q4949812	2001-05-17	Paper
https://portal.mardi4nfdi.de/entity/Q4508369	2001-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q4944973	2000-05-22	Paper
https://portal.mardi4nfdi.de/entity/Q4232773	1999-12-13	Paper
Restrictions of minimum spanner problems	1997-12-14	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Udi Rotics