Udi Rotics

	2012
29		Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial-time recognition of clique-width ≤3 graphs. Discrete Applied Mathematics 160(6): 834-865 (2012)
	2011
28		Pinar Heggernes, Daniel Meister, Udi Rotics: Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR 2011: 233-246
	2010
27		Pinar Heggernes, Daniel Meister, Udi Rotics: Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295
	2009
26		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-Width is NP-Complete. SIAM J. Discrete Math. 23(2): 909-939 (2009)
	2008
25		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: An improvement on the complexity of factoring read-once Boolean functions. Discrete Applied Mathematics 156(10): 1633-1636 (2008)
24		Ephraim Korach, Uri N. Peled, Udi Rotics: Equistable distance-hereditary graphs. Discrete Applied Mathematics 156(4): 462-477 (2008)
	2006
23		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
22		Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin: Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG 2006: 191-204
21		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees. Discrete Applied Mathematics 154(10): 1465-1477 (2006)
	2005
20		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width I: non-approximability of sequential clique-width Electronic Colloquium on Computational Complexity (ECCC)(080): (2005)
19		Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Proving NP-hardness for clique-width II: non-approximability of clique-width Electronic Colloquium on Computational Complexity (ECCC)(081): (2005)
18		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electronic Notes in Discrete Mathematics 22: 357-361 (2005)
17		Derek G. Corneil, Udi Rotics: On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005)
	2003
16		Hans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003)
15		Daniel Kobler, Udi Rotics: 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 37(4): 327-346 (2003)
14		Daniel Kobler, Udi Rotics: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics 126(2-3): 197-221 (2003)
13		Uri N. Peled, Udi Rotics: Equistable chordal graphs. Discrete Applied Mathematics 132(1-3): 203-210 (2003)
	2002
12		Hans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397
	2001
11		Martin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114
10		Daniel Kobler, Udi Rotics: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). SODA 2001: 468-476
9		Derek G. Corneil, Udi Rotics: On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90
8		Bruno Courcelle, Johann A. Makowsky, Udi Rotics: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108(1-2): 23-52 (2001)
	2000
7		Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics: Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract). LATIN 2000: 126-134
6		Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000)
5		Bruno Courcelle, Johann A. Makowsky, Udi Rotics: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst. 33(2): 125-150 (2000)
	1999
4		Martin Charles Golumbic, Udi Rotics: On the Clique-Width of Perfect Graph Classes. WG 1999: 135-147
3		Johann A. Makowsky, Udi Rotics: On the Clique-Width of Graphs with Few P4's. Int. J. Found. Comput. Sci. 10(3): 329-348 (1999)
	1998
2		Bruno Courcelle, Johann A. Makowsky, Udi Rotics: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG 1998: 1-16
	1997
1		G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan: Restrictions of Minimum Spanner Problems. Inf. Comput. 136(2): 143-164 (1997)

Coauthor Index

1	Ilya Averbouch	[22]
2	Hans L. Bodlaender	[12] [16]
3	Derek G. Corneil	[7] [9] [17] [29]
4	Bruno Courcelle	[2] [5] [8]
5	Michael R. Fellows (Mike Fellows)	[19] [20] [23] [26]
6	Benny Godlin	[22]
7	Martin Charles Golumbic	[4] [6] [11] [18] [21] [25]
8	Michel Habib	[7] [29]
9	Pinar Heggernes	[27] [28]
10	Daniel Kobler	[10] [14] [15]
11	Ephraim Korach	[24]
12	Jean-Marc Lanlignel	[7] [29]
13	M. S. Madanlal	[1]
14	Johann A. Makowsky (Janos Makowsky)	[1] [2] [3] [5] [8] [22]
15	Daniel Meister	[27] [28]
16	Aviad Mintz	[11] [18] [21] [25]
17	Uri N. Peled	[13] [24]
18	C. Pandu Rangan (Chandrasekaran Pandu Rangan)	[1]
19	Bruce A. Reed	[7] [29]
20	Frances A. Rosamond	[19] [20] [23] [26]
21	Stefan Szeider	[19] [20] [23] [26]
22	G. Venkatesan	[1]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page