Udi Rotics - Concepedia

Author

Udi Rotics

Netanya Academic College

Also Known As

Rotics, Udi, U. ROTICS, U. Rotics, UDI ROTICS, Udi Rotics

Publications

2.5K

Citations

H-Index

Concepts

All Affiliations

Netanya Academic College University of Toronto Technion – Israel Institute of Technology University of Bergen University of Illinois Chicago

About

Udi Rotics is an author at Netanya Academic College specializing in discrete mathematics, engineering, and graph theory.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	15	16	2K
2	Computer Science	12	12	1.7K
3	Business	5	5	288
4	Education	3	3	1.1K
5	Computer Engineering	1	1	21

Udi Rotics

Publications

2.2K

Citations

H-Index

Page 1

	Year	Citations
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width B. Courcelle, Johann A. Makowsky, Udi Rotics Theory of Computing Systems Mathematical ProgrammingEngineeringGraph TheoryExtremal Graph TheoryStructural Graph Theory	2000	779
ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES Martin Charles Golumbic, Udi Rotics International Journal of Foundations of Computer Science Network ScienceGraph TheoryEngineeringAlgebraic Graph TheoryStructural Graph Theory	2000	231
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic Bruno Courcelle, Johann A. Makowsky, Udi Rotics Discrete Applied Mathematics Fixed Parameter ComplexityMonadic Second-order LogicGraph TheoryEngineeringParameterized Complexity	2001	204
On the Relationship Between Clique-Width and Treewidth Derek G. Corneil, Udi Rotics SIAM Journal on Computing Bounded TreewidthEngineeringPlanar GraphComputational ComplexityStructural Graph Theory	2005	172
Edge dominating set and colorings on graphs with fixed clique-width Daniel Kobler, Udi Rotics Discrete Applied Mathematics Graph TheoryStructural Graph TheoryTopological Graph TheoryEdge Dominating SetPlanar Graph	2002	148
Clique-Width is NP-Complete Michael R. Fellows, Frances Rosamond, Udi Rotics, SIAM Journal on Discrete Mathematics EngineeringGraph TheoryGraph ParameterExtremal Graph TheoryAutomated Reasoning	2009	113
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 Daniel Kobler, Udi Rotics Algorithmica EngineeringGraph TheoryAlgebraic Graph TheoryStructural Graph TheoryExtremal Graph Theory	2003	99
ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S Janos A. Makowsky, Udi Rotics International Journal of Foundations of Computer Science Graph OperationsNetwork ScienceGraph TheoryEngineeringAlgebraic Graph Theory	1999	85
Clique-width minimization is NP-hard Michael R. Fellows, Frances Rosamond, Udi Rotics, EngineeringGraph TheoryGraph ParameterExtremal Graph TheoryAutomated Reasoning	2006	63
Restrictions of Minimum Spanner Problems G. Venkatesan, Udi Rotics, M.S. Madanlal, Information and Computation Mathematical ProgrammingEngineeringOptimization ProblemConstrained OptimizationDiscrete Mathematics	1997	63

Page 1