Udi Rotics - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2016

Clique-width of path powersPinar Heggernes, Daniel Meister 0001, Charis Papadopoulos, Udi Rotics. DAM, 205:62-72, 2016. [doi]

2015

A characterisation of clique-width through nested partitionsBruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics. DAM, 187:70-81, 2015. [doi]

Clique-width of full bubble model graphsDaniel Meister, Udi Rotics. DAM, 185:138-167, 2015. [doi]

2012

Polynomial-time recognition of clique-width ≤3 graphsDerek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics. DAM, 160(6):834-865, 2012. [doi]

2011

Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterisation of Clique-WidthPinar Heggernes, Daniel Meister, Udi Rotics. csr 2011: 233-246 [doi]

2010

Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-WidthPinar Heggernes, Daniel Meister, Udi Rotics. tamc 2010: 284-295 [doi]

2009

Clique-Width is NP-CompleteMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. siamdm, 23(2):909-939, 2009. [doi]

2008

An improvement on the complexity of factoring read-once Boolean functionsMartin Charles Golumbic, Aviad Mintz, Udi Rotics. DAM, 156(10):1633-1636, 2008. [doi]

Equistable distance-hereditary graphsEphraim Korach, Uri N. Peled, Udi Rotics. DAM, 156(4):462-477, 2008. [doi]

2006

2005

2003

Computing the Treewidth and the Minimum Fill-In with the Modular DecompositionHans Leo Bodlaender, Udi Rotics. algorithmica, 36(4):375-408, 2003. [doi]

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 SizeDaniel Kobler, Udi Rotics. algorithmica, 37(4):327-346, 2003. [doi]

Edge dominating set and colorings on graphs with fixed clique-widthDaniel Kobler, Udi Rotics. DAM, 126(2-3):197-221, 2003.

Equistable chordal graphsUri N. Peled, Udi Rotics. DAM, 132(1-3):203-210, 2003. [doi]

2002

Computing the Treewidth and the Minimum Fill-in with the Modular DecompositionHans Leo Bodlaender, Udi Rotics. swat 2002: 388-397 [doi]

2001

2000

Polynomial Time Recognition of Clique-Width /le /leq 3 Graphs (Extended Abstract)Derek G. Corneil, Michel Habib, Jean-Marc Lanlignel, Bruce A. Reed, Udi Rotics. latin 2000: 126-134

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-WidthBruno Courcelle, Johann A. Makowsky, Udi Rotics. mst, 33(2):125-150, 2000. [doi]

On the Clique-Width of Some Perfect Graph ClassesMartin Charles Golumbic, Udi Rotics. ijfcs, 11(3):423-443, 2000.

1999

On the Clique-Width of Perfect Graph ClassesMartin Charles Golumbic, Udi Rotics. criwg 1999: 135-147 [doi]

On the Clique-Width of Graphs with Few P::4:: sJohann A. Makowsky, Udi Rotics. ijfcs, 10(3):329-348, 1999.

1998

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique WidthBruno Courcelle, Johann A. Makowsky, Udi Rotics. criwg 1998: 1-16

Efficient algorithms for generally intractable graph problems restricted to specific classes of graphsUdi Rotics. PhD thesis, Technion - Israel Institute of Technology, Israel, 1998. [doi]

1997

Restrictions of Minimum Spanner ProblemsG. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan. iandc, 136(2):143-164, 1997.

Sign in or sign up to see more results.

runs on WebDSL