ללא כותרת [1]

 
search

חיפוש מרצים

טקסט חופשי:

בית הספר:

בחר תואר:



 פרופ' אודי רוטיץ'

תפקיד

חדר:

 -

שעות קבלה:

 -

דוא"ל:

 rotics@netanya.ac.il

טלפון:

 -

להורדת קו"ח

 לחץ כאן

 

בתי ספר

  • מדעי המחשב
  •  
  •  
  •  

תחומי התמחות

  •  
  •  
  •  
 

 פעילות מקצועית

 
ACADEMIC DEGREES
 
1998  Ph.D.,  Computer Science, Computer Science Department, Technion, Haifa,
                       Israel.
 
1985  M.Sc.,  Computer Science, Computer Science Department, Technion, Haifa,
                       Israel.
 
1983  B.Sc.,  Computer Science, Computer Science Department, Technion, Haifa,
                       Israel.
 
 
ACADEMIC APPOINTMENTS
 
2010-present  Associate Professor, School of Computer Science and Mathematics,
                        Netanya Academic College, Netanya, Israel.
 
2000-2009       Senior Lecturer, School of Computer Science and Mathematics,
                        Netanya Academic College, Netanya, Israel.
 
2008                Acting Dean, School of Computer Science and Mathematics, Netanya
                        Academic College, Netanya, Israel.
 
1999-2000        Post-Doctoral Fellow, University of Toronto, Canada.
 
1998                 Post-Doctoral Fellow, Bar-Ilan University, Ramat Gan, Israel.
 
1994-1998:    Graduate Teaching Assistant, Computer Science Department,
                         Technion, Haifa, Israel.
 
 
PROFESSIONAL EXPERIENCE
 
1989-1994       Software Developer, IBM Haifa Research Laboratory, Haifa, Israel.
 
1986-1988       Software Developer, Paz Engineering, Kiryat Bialik, Israel.
 
 
 
RESEARCH INTERESTS
 
Algorithms and graph theory.  
 
 
TEACHING EXPERIENCE
 
Basics of open systems,  School of Computer Science and Mathematics,
Netanya Academic College, Netanya, Israel.
 
Data structures,  School of Computer Science and Mathematics,
Netanya Academic College, Netanya, Israel.
 
Scripting languages,  School of Computer Science and Mathematics,
Netanya Academic College, Netanya, Israel.
 
Seminar in computer science,  School of Computer Science and Mathematics,
Netanya Academic College, Netanya, Israel.
 
Design and analysis of algorithms, Computer Science Department, University of Haifa, Israel.
 
Algorithms in Graph Theory, University of Toronto, Canada.
 
Introduction to System Programming, Computer Science Department, Technion,  Haifa, Israel.
 
NETANYA ACADEMIC COLLEGE ACTIVITIES
 
2010-present  Member of the Academic Council, Netanya Academic College,
                        Netanya, Israel.
 
DEPARTMENTAL ACTIVITIES
 
2000-present  Member of the Student Academic Committee.
 
2004-present  Member of the Academic Program Committee.
 
2008-present  Head of the Haznek program. .
 
2011-present  Head of the B.Sc. program for high school students.
 
 
 
PUBLIC PROFESSIONAL ACTIVITIES
 
Referee for:
 
SIAM Journal on Computing.
 
Journal of Combinatorial Theory, Series B.
 
Theory of Computing Systems.
 
Algorithmica.
 
Discrete Mathematics.
 
Discrete Applied mathematics.
 
Journal of Discrete Algorithms.
 
Networks.
 
 
HONORS
 
1994  IBM Outstanding Technical Achievement Award, in appreciation for
          Concurrent Copy.
 
1993 IBM First Patent Application Invention Achievement Award for:
         Concurrent Copy.
 
1993 IBM Market-Driven quality Award, In recognition of outstanding
         contribution in Market-Driven Quality initiatives on the Concurrent Copy
         Function of 3990 Cached DASD Microcode.
 
 
SIGNIFICANT PROFESSIONAL PROJECTS
 
1986-1988  Expert system for growing shrimps in ponds, Paz Engineering, project
                  manager: Udi Rotics
 
1990-1993  Concurrent Copy, IBM Haifa Research Laboratory, project manager:
                   Alex Winokur
 
 
 
 

 כנסים

 
CONFERENCES
 
Refereed papers in conference proceedings
 
J.A. Makowsky, V.M. Markovitz and U. Rotics (N. Rotitz), Entity Relationship Consistency for Relational Schemas, Proceedings of ICDT’86, Rome, Lecture Notes in Computer Science 243: 306-322 (1986).
 
B. Courcelle, J.A. Makowsky and U. Rotics, Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width, (Extended Abstract). Graph Theoretic Concepts in Computer Science, 24th In ternational Workshop, WG’98, Lecture Notes in Computer Science,volume 1517: 1-16 (1998).
 
M. C. Golumbic and U. Rotics, On the Clique–Width of Perfect Graph Classes, Graph Theoretic Concepts in Computer Science, 25th International Workshop, WG’99, Lecture Notes in Computer Science 1665: 135-147 (1999).
 
D. G. Corneil, M. Habib, J. M. Lanlignel, B. Reed and U. Rotics, Polynomial time recognition of clique-width _ 3 graphs (Extended Abstract), in Proc. Latin American Theoretical INformatic, LATIN’2000, Lecture Notes in Computer Science 1776: 126-134 (2000).
 
D. Kobler and U. Rotics, Polynomial algorithms for partitioning problems on graphs with fixed clique-width (Extended Abstract), in Proc.12th Annual ACM-SIAM Symp. on Discrete Algorithms, SODA’2001: 468-476 (2001).
 
M.C. Golumbic, A. Mintz and U. Rotics, Factoring and Recognition of Read-Once Functions Using Cographs and Normality, in Proc. the 38th Design Automation Conference DAC 2001: 109-114 (2001).
 
D. G. Corneil and U. Rotics, On the relationship between clique-width and treewidth (Extended Abstract). In Proc. Graph Theoretic Concepts in Computer Science, 27th International Workshop, WG’2001, Lecture Notes in Computer Science 2204: 78-90 (2001).
 
H. L. Bodlaender and U. Rotics, Computing the treewidth and the minimum fill-in with the modular decomposition (Extended Abstract), in Proc. Eighth Scandinavian Workshop on Algorithm Theory, SWAT 2002, Lecture Notes in Computer Science 2368: 388-397 (2002).
 
M.C. Golumbic, A. Mintz and U. Rotics, Read-Once Functions Revisited and the Readability Number of a Boolean Function, 7th International Colloquium on Graph Theory ICGT ’05 (2005), Electronic Notes in Discrete Mathematics 22: 357-361 (2005).
 
 Michael R. Fellows, Frances A. Rosamond, Udi Rotics and Stefan Szeider, Clique-width minimization is NP-hard (Extended Abstract), 38th ACM Symposium on Theory of Computing, STOC 2006: 354-362 (2006).
 
 Johann A. Makowsky, Udi Rotics, Ilya Averbouch, and Benny Godlin, Computing Graph Polynomials on Graphs of Bounded Clique-Width. In Proc. 32nd International Workshop on Graph Theoretic Concepts in Computer Science, WG’2006, Lecture Notes in Computer Science 4271: 388-397 (2006).
 
 Pinar Heggernes, Daniel Meister and Udi Rotics, Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. In Proc. Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Lecture Notes in Computer Science 6108: 284-295 (2010).
 
Pinar Heggernes, Daniel Meister and Udi Rotics, Computing the Clique-Width of Large Path Powers in Linear Time via a New Characterization of Clique-Width. In Proc. 6th International Computer Science Symposium in Russia, CSR 2011, Lecture Notes in Computer Science 6651: 233-246 (2011).
 
Participation in organizing conferences
 
The 10th Haifa Workshop on Interdisciplinary Applications of Graphs, Combinatorics and Algorithms, Haifa, Israel, 2010, Program co-chair.
 
The 11th Haifa Workshop on Interdisciplinary Applications of Graphs, Combinatorics and Algorithms, Haifa, Israel, 2011, Program Committee.
 
 
 
 

 פרסומים

 
Theses
 
Udi  Rotics: A Unifying Approach to the Entity-Relationship and the Relational Models of Data Bases, M.Sc. thesis, Computer Science Department, Technion, Haifa, Israel, 1985. Thesis Advisor: Johann Makowsky.
 
Udi Rotics: Efficient Algorithms for Generally Intractable Graph problems Restricted to Specific Classes of Graphs, Ph.D. thesis, Computer Science Department, Technion, Haifa, Israel, 1998. Thesis Advisor: Johann Makowsky.
 
 
 
 
Refereed papers in professional journals
 
Published papers
 
G. Venkatesan, U. Rotics, M.S. Madanlal, J.A. Makowsky and C. Pandu Rangan, Restrictions of minimum spanner problems, Information and Computation 136: 143-164 (1997).
 
B. Courcelle, J.A. Makowsky and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width. Theory of or Computing Systems 33: 125-150 (2000).
 
B. Courcelle, J.A. Makowsky and U. Rotics, On the fixed parameter problems complexity of graph enumeration problems definable in monadic second order logic. Discrete Applied mathematics 108: 23-52 (2001).
 
J. A. Makowsky and U. Rotics, On the clique-width of graphs with few P4’s, International Journal of Foundations of Computer Science 10: 329-348 (1999).
 
M. C. Golumbic and U. Rotics, The clique-width of unit interval graphs is unbounded. Congressus Numerantium 140:  5-17 (1999), special issue of papers selected from the 30th Southeastern Conf. on Combinatorics, Graph Theory and Computing, Boca Raton, 1999
 
M. C. Golumbic and U. Rotics, On the Clique–Width of Some Perfect Graph Classes, International J. of Foundations of Computer Science 11: 423-443 (2000).
 
D. Kobler and U. Rotics, Edge dominating set and colorings on graphs with fixed clique-width, Discrete Applied Mathematics 126: 197-221 (2003).
 
U. Peled and U. Rotics, Equistable chordal graphs, Discrete Applied Mathematics 132: 203-210 (2003).
 
H. L. Bodlaender and U. Rotics, Computing the treewidth and the minimum fill-in with the modular decomposition, Algorithmica 36: 375-408 (2003).
 
D. Kobler and U. Rotics, Finding maximum induced matchings in subclasses of claw-free and P5-free graphs, and in graphs with matching and induced matching of equal maximum size, Algorithmica 37: 327-346 (2003).
 
D. G. Corneil and U. Rotics, On the relationship between clique-width and treewidth, SIAM Journal on Computing 34: 825-847 (2005).
 
Martin Charles Golumbic, Aviad Mintz and 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: 1465-1477 (2006).
 
E. Korach, U. N. Peled and U. Rotics, Equistable distance-hereditary graphs. Discrete Applied Mathematics 156: 462-47 (2008).
 
Martin Charles Golumbic, Aviad Mintz and Udi Rotics, An improvement on the complexity of factoring read-once Boolean functions, Discrete Applied mathematics 156: 1633-1636 (2008).
 
Michael R. Fellows, Frances A. Rosamond, Udi Rotics and Stefan Szeider, Clique-width minimization is NP-Complete., SIAM Journal on Discrete Mathematics 23: 909-939 (2009).
 
D. G. Corneil, M. Habib, J. M. Lanlignel, B. Reed and U. Rotics, Polynomial time recognition of clique-width ≤ 3 graphs, Discrete Applied Mathematics 160: 834-865 (2012).
 
Submitted papers
 
Pinar Heggernes, Daniel Meister, Charis Papadopoulos and Udi Rotics, Clique-width of path powers in linear time: a new characterisation of clique-width.
 
 
Patents
 
O. Cohn, M. H. Hartung, W. F. Micka, K. M. Nagin, Y. Novick, U. Rotics, A.Winokur and E. Zeidner, Method and system for non-specific address data retrieval in a data storage subsystem which includes multiple datasets stored at specific addresses, U.S. patent no. 5408656, filed at Sep. 23 1992, issued at Apr. 18 1995.
 
O. Cohn, W. F. Micka, K. M. Nagin, Y. Novick, U. Rotics, A. Winokur and E. Zeidner, Locking a non-busy device for accessing a data record stored on another device, U.S. patent no. 5493724, filed at Apr. 1 1993, issued at Feb. 20 1996.
 
 
Research reports
 
J. A. Makowsky and U. Rotics: Optimal Spanners in Partial k-Trees. Technical Report, Department of Computer Science, Technion - Israel Institute of Technology, 10 pp., October 1993, TR# 784.
 
J.A.Makowsky and U. Rotics, Spanners in Interval and Chordal Graphs. Technical Report, Department of Computer Science, Technion - Israel Institute of Technology, 17 pp. April 1996.
 
 
 
שלח לחבר   להדפסה