dblp.uni-trier.dewww.uni-trier.de

Udi Rotics Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2008
25EEMartin 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)
24EEEphraim Korach, Uri N. Peled, Udi Rotics: Equistable distance-hereditary graphs. Discrete Applied Mathematics 156(4): 462-477 (2008)
2006
23EEMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider: Clique-width minimization is NP-hard. STOC 2006: 354-362
22EEJohann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin: Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG 2006: 191-204
21EEMartin 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
20EEMichael 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)
19EEMichael 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)
18EEMartin 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)
17EEDerek G. Corneil, Udi Rotics: On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005)
2003
16EEHans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003)
15EEDaniel 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)
13EEUri N. Peled, Udi Rotics: Equistable chordal graphs. Discrete Applied Mathematics 132(1-3): 203-210 (2003)
2002
12EEHans L. Bodlaender, Udi Rotics: Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397
2001
11EEMartin Charles Golumbic, Aviad Mintz, Udi Rotics: Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114
10EEDaniel Kobler, Udi Rotics: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). SODA 2001: 468-476
9EEDerek 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)
5EEBruno 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
4EEMartin 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
2EEBruno 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

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)