default search action
Udi Rotics
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j19]Pinar Heggernes
, Daniel Meister, Charis Papadopoulos
Clique-width of path powers. Discret. Appl. Math. 205: 62-72 (2016) - 2015
- [j18]Daniel Meister, Udi Rotics:
Clique-width of full bubble model graphs. Discret. Appl. Math. 185: 138-167 (2015) - [j17]Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187: 70-81 (2015) - 2013
- [i3]Daniel Meister, Udi Rotics:
Minimal forbidden induced subgraphs of graphs of bounded clique-width and bounded linear clique-width. CoRR abs/1306.2114 (2013) - 2012
- [j16]Derek G. Corneil, Michel Habib
Polynomial-time recognition of clique-width ≤3 graphs. Discret. Appl. Math. 160(6): 834-865 (2012) - 2011
- [c11]Pinar Heggernes
Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-Width. CSR 2011: 233-246 - 2010
- [c10]Pinar Heggernes
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. TAMC 2010: 284-295
2000 – 2009
- 2009
- [j15]Michael R. Fellows
Clique-Width is NP-Complete. SIAM J. Discret. Math. 23(2): 909-939 (2009) - 2008
- [j14]Ephraim Korach, Uri N. Peled, Udi Rotics:
Equistable distance-hereditary graphs. Discret. Appl. Math. 156(4): 462-477 (2008) - [j13]Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
An improvement on the complexity of factoring read-once Boolean functions. Discret. Appl. Math. 156(10): 1633-1636 (2008) - 2006
- [j12]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. Discret. Appl. Math. 154(10): 1465-1477 (2006) - [c9]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider
Clique-width minimization is NP-hard. STOC 2006: 354-362 - [c8]Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin:
Computing Graph Polynomials on Graphs of Bounded Clique-Width. WG 2006: 191-204 - 2005
- [j11]Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
Read-Once Functions Revisited and the Readability Number of a Boolean Function. Electron. Notes Discret. Math. 22: 357-361 (2005) - [j10]Derek G. Corneil, Udi Rotics:
On the Relationship Between Clique-Width and Treewidth. SIAM J. Comput. 34(4): 825-847 (2005) - [i2]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Proving NP-hardness for clique-width I: non-approximability of sequential clique-width. Electron. Colloquium Comput. Complex. TR05 (2005) - [i1]Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider:
Proving NP-hardness for clique-width II: non-approximability of clique-width. Electron. Colloquium Comput. Complex. TR05 (2005) - 2003
- [j9]Hans L. Bodlaender
Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Algorithmica 36(4): 375-408 (2003) - [j8]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) - [j7]Daniel Kobler, Udi Rotics:
Edge dominating set and colorings on graphs with fixed clique-width. Discret. Appl. Math. 126(2-3): 197-221 (2003) - [j6]Uri N. Peled, Udi Rotics:
Equistable chordal graphs. Discret. Appl. Math. 132(1-3): 203-210 (2003) - 2002
- [c7]Hans L. Bodlaender, Udi Rotics:
Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. SWAT 2002: 388-397 - 2001
- [j5]Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discret. Appl. Math. 108(1-2): 23-52 (2001) - [c6]Martin Charles Golumbic, Aviad Mintz, Udi Rotics:
Factoring and Recognition of Read-Once Functions using Cographs and Normality. DAC 2001: 109-114 - [c5]Daniel Kobler, Udi Rotics:
Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). SODA 2001: 468-476 - [c4]Derek G. Corneil, Udi Rotics:
On the Relationship between Clique-Width and Treewidth. WG 2001: 78-90 - 2000
- [j4]Martin Charles Golumbic, Udi Rotics:
On the Clique-Width of Some Perfect Graph Classes. Int. J. Found. Comput. Sci. 11(3): 423-443 (2000) - [j3]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) - [c3]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
1990 – 1999
- 1999
- [j2]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) - [c2]Martin Charles Golumbic, Udi Rotics:
On the Clique-Width of Perfect Graph Classes. WG 1999: 135-147 - 1998
- [b1]Udi Rotics:
Efficient algorithms for generally intractable graph problems restricted to specific classes of graphs. Technion - Israel Institute of Technology, Israel, 1998 - [c1]Bruno Courcelle, Johann A. Makowsky, Udi Rotics:
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. WG 1998: 1-16 - 1997
- [j1]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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:10 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: