Udi Rotics

2.5k total citations
26 papers, 1.1k citations indexed

About

Udi Rotics is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Udi Rotics has authored 26 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 8 papers in Geometry and Topology and 4 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Udi Rotics's work include Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (11 papers). Udi Rotics is often cited by papers focused on Advanced Graph Theory Research (21 papers), Complexity and Algorithms in Graphs (15 papers) and Graph Labeling and Dimension Problems (11 papers). Udi Rotics collaborates with scholars based in Israel, Canada and France. Udi Rotics's co-authors include Johann A. Makowsky, B. Courcelle, Martin Charles Golumbic, Daniel Kobler, Derek G. Corneil, Bruno Courcelle, Frances Rosamond, Michael R. Fellows, Stefan Szeider and Uri N. Peled and has published in prestigious journals such as SIAM Journal on Computing, Discrete Applied Mathematics and Algorithmica.

In The Last Decade

Udi Rotics

25 papers receiving 1.0k citations

Peers

Countries citing papers authored by Udi Rotics

Since Specialization

Citations

This map shows the geographic impact of Udi Rotics's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Udi Rotics with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Udi Rotics more than expected).

Fields of papers citing papers by Udi Rotics

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Udi Rotics. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Udi Rotics. The network helps show where Udi Rotics may publish in the future.

Co-authorship network of co-authors of Udi Rotics

This figure shows the co-authorship network connecting the top 25 collaborators of Udi Rotics. A scholar is included among the top collaborators of Udi Rotics based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Udi Rotics. Udi Rotics is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Clique-width of path powers 2016 ·Discrete Applied Mathematics ·Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics	1
2	A characterisation of clique-width through nested partitions 2015 ·Discrete Applied Mathematics ·Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics	7
3	Clique-width of full bubble model graphs 2014 ·Discrete Applied Mathematics ·Daniel Meister, Udi Rotics	2
4	Polynomial-time recognition of clique-width ≤3 graphs 2011 ·Discrete Applied Mathematics ·Derek G. Corneil, Michel Habib, (unknown), Bruce Reed, Udi Rotics	18
5	Computing graph polynomials on graphs of bounded clique-width 2008 ·Johann A. Makowsky, Udi Rotics, (unknown), Benny Godlin	1
6	An improvement on the complexity of factoring read-once Boolean functions 2008 ·Discrete Applied Mathematics ·Martin Charles Golumbic, (unknown), Udi Rotics	25
7	Equistable distance-hereditary graphs 2007 ·Discrete Applied Mathematics ·Ephraim Korach, Uri N. Peled, Udi Rotics	8
8	Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial k-trees 2006 ·Discrete Applied Mathematics ·Martin Charles Golumbic, (unknown), Udi Rotics	24
9	Clique-width minimization is NP-hard 2006 ·Durham Research Online (Durham University) ·Michael R. Fellows, Frances Rosamond, Udi Rotics, Stefan Szeider	28
10	Proving NP-hardness for clique-width II: non-approximability of clique-width 2005 ·Electronic colloquium on computational complexity ·Michael R. Fellows, Frances Rosamond, Udi Rotics, Stefan Szeider	9
11	Proving NP-hardness for clique-width I: non-approximability of sequential clique-width 2005 ·Electronic colloquium on computational complexity ·Michael R. Fellows, Frances Rosamond, Udi Rotics, Stefan Szeider	7
12	Read-Once Functions Revisited and the Readability Number of a Boolean Function 2005 ·Electronic Notes in Discrete Mathematics ·Martin Charles Golumbic, (unknown), Udi Rotics	4
13	On the Relationship Between Clique-Width and Treewidth 2005 ·SIAM Journal on Computing ·Derek G. Corneil, Udi Rotics	77
14	Equistable chordal graphs 2003 ·Discrete Applied Mathematics ·Uri N. Peled, Udi Rotics	9
15	Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition 2003 ·Algorithmica ·Hans L. Bodlaender, Udi Rotics	8
16	Edge dominating set and colorings on graphs with fixed clique-width 2002 ·Discrete Applied Mathematics ·Daniel Kobler, Udi Rotics	78
17	Factoring and recognition of read-once functions using cographs and normality 2002 ·Martin Charles Golumbic, (unknown), Udi Rotics	2
18	On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic 2001 ·Discrete Applied Mathematics ·Bruno Courcelle, Johann A. Makowsky, Udi Rotics	98
19	Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width 2000 ·Theory of Computing Systems ·B. Courcelle, Johann A. Makowsky, Udi Rotics	369
20	Restrictions of Minimum Spanner Problems 1997 ·Information and Computation ·(unknown), Udi Rotics, (unknown), Johann A. Makowsky, C. Pandu Rangan	29

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact