Welcome!

• I've served as the Chairman of Communication Systems Engineering Department at Ben-Gurion University of the Negev, Israel between 2005-2010. In my past life I've finished Ph.D in Computer Science at the Department of Computer Science, Ben-Gurion University of the Negev, Israel and moved for postdoc to the University of British Columbia, Canada. For more (not so updated) information about me, please, go to here.

How to Reach Me

Prof. Michael Segal
Communication Systems Engineering Department
Ben-Gurion University of the Negev
Beer-Sheva 84105, POB 653, Israel

e-mail: segal "at" cse.bgu.ac.il or michael99segal "at" gmail.com

phone (+972) 8-6477234 (office)

fax (+972) 8-6472883

• I just LOVE this game. I'm also playing in Israel competitions for championship. For more information, see Table Tennis.

• Ministry of Justice Post-doctoral award, 1999, Israel

• Pacific Institute of the Mathematical Studies Post-doctoral Fellowship, 1999, Canada

• Kreitman Prize for Distinguished Ph.D studies, 1999

• New York Federation Award, 1998

• Otto Schwartz Prize "For Excellent Studies, Ph.D", 1997

• Intel Prize "For Outstanding M.Sc work", 1996

• Achievement Award "The Big Ten of the University", 1995

• First place in Table Tennis Israelian competions, 1994

• Gold Medal "For Excellent Achievements in the Studies" ,1989

• Prizes in the finals of Soviet Union and Moldavian National Contests for high school students in math, physics and computer science.

---

List of my publications

Ohad Ben-Shahar, Shlomi Dolev, Andrey Dolgin, Michael Segal: Direction election in flocking swarms. DIALM-PODC 2010: 73-80

Michael Segal, Hanan Shpungin: Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics. INFOCOM 2010: 6-10

Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir: Centdian Computation for Sensor Networks. TAMC 2010: 187-198

Liron Levin, Michael Segal, Hanan Shpungin: Optimizing performance of ad-hoc networks under energy and scheduling constraints. WiOpt 2010: 11-20

Shlomi Dolev, Michael Segal, Hanan Shpungin: Bounded-hop strong connectivity for flocking swarms. WiOpt 2010: 177-185

Daniel Berend, Michael Segal, Hanan Shpungin: Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. Ad Hoc & Sensor Wireless Networks 10(1): 61-87 (2010)

Shimon Abravaya, Michael Segal: Maximizing the number of obnoxious facilities to locate within a bounded region. Computers & OR 37(1): 163-171 (2010)

Yoram Revah, Michael Segal, Liron Yedidsion: Real-time data gathering in sensor networks. Discrete Applied Mathematics 158(5): 543-550 (2010)

Alexander Kesselman, Kirill Kogan, Michael Segal: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distributed Computing 23(3): 163-175 (2010)

Amit Dvir, Michael Segal: Placing and maintaining a core node in wirelessad hoc networks. Wireless Communications and Mobile Computing 10(6): 826-842 (2010)

Hanan Shpungin, Michael Segal: On minimizing the total power of k-strongly connected wireless networks. Wireless Networks 16(4): 1075-1089 (2010)

Zeev Nutov, Michael Segal: Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. ALGOSENSORS 2009: 41-51

Hanan Shpungin, Michael Segal: Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks. INFOCOM 2009: 163-171

Yoann Dieudonn, Shlomi Dolev, Franck Petit, Michael Segal: Deaf, Dumb, and Chatting Asynchronous Robots. OPODIS 2009: 71-85

Michael Segal, Hanan Shpungin: On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks 7(2): 363-373 (2009)

Shimon Abravaya, Michael Segal: Low complexity algorithms for optimal consumer push-pull partial covering in the plane. European Journal of Operational Research 197(2): 456-464 (2009)

Hanan Shpungin, Michael Segal: Low-energy fault-tolerant bounded-hop broadcast in wireless networks. IEEE/ACM Trans. Netw. 17(2): 582-590 (2009)

Michael Segal, Alexander Kesselman: Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008 ACM 2008

Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin: Novel Algorithms for the Network Lifetime Problem in Wireless Settings. ADHOC-NOW 2008: 425-438

Alexander Kesselman, Kirill Kogan, Michael Segal: Improved Competitive Performance Bounds for CIOQ Switches. ESA 2008: 577-588

Daniel Berend, Michael Segal, Hanan Shpungin: Power efficient resilience and lifetime in wireless ad-hoc networks. FOWANC 2008: 17-24

Amit Dvir, Michael Segal: The (k, l) Coredian Tree for Ad Hoc Networks. ICDCS Workshops 2008: 267-272

Alexander Kesselman, Kirill Kogan, Michael Segal: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. PODC 2008: 335-344

Alexander Kesselman, Kirill Kogan, Michael Segal: Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. SIROCCO 2008: 170-184

Amit Dvir, Michael Segal: The (k, l) Coredian Tree for Ad Hoc Networks. Ad Hoc & Sensor Wireless Networks 6(1-2): 123-144 (2008)

Yoram Revah, Michael Segal: Improved bounds for data-gathering time in sensor networks. Computer Communications 31(17): pp. 4026--4034 (2008)

Michael Segal: Fast algorithm for multicast and data gathering in wireless networks. Inf. Process. Lett. 107(1): 29-33 (2008)

Ofer Hadar, Shlomo Greenberg, Michael Segal: EPCRTT-based smoothing and multiplexing of VBR video traffic. Multimedia Tools Appl. 36(3): 203-219 (2008)

Michael Segal, Eli Zeitlin: Computing closest and farthest points for a query segment. Theor. Comput. Sci. 393(1-3): 294-300 (2008)

Hanan Shpungin, Michael Segal: Low Energy Construction of Fault Tolerant Topologies in Wireless Networks. DIALM-POMC 2007

Yoram Revah, Michael Segal: Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies. ICNS 2007: 46

Yoram Revah, Michael Segal: Improved Lower Bounds for Data-Gathering Time in Sensor Networks. ICNS 2007: 76

Amit Dvir, Michael Segal: Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks. Networking 2007: 13-24

Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc & Sensor Wireless Networks 4(4): 355-366 (2007)

Liam Roditty, Michael Segal: On bounded leg shortest paths problems. SODA 2007: 775-784

Yehuda Ben-Shimol, Boaz Ben-Moshe, Yoav Ben-Yehezkel, Amit Dvir, Michael Segal: Automated antenna positioning algorithms for wireless fixed-access networks. J. Heuristics 13(3): 243-263 (2007)

Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal: Improved approximation algorithms for connected sensor cover. Wireless Networks 13(2): 153-164 (2007)

Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84

Sergey Bereg, Binay K. Bhattacharya, David Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)

Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal: A simple improved distributed algorithm for minimum CDS in unit disk graphs. TOSN 2(3): 444-453 (2006)

Hanan Shpungin, Michael Segal: k-fault resistance in wireless ad-hoc networks. DIALM-POMC 2005: 89-96

Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)

Hai Huang, Andra W. Richa, Michael Segal: Dynamic Coverage in Ad-Hoc Sensor Networks. MONET 10(1-2): 9-17 (2005)

Alexander Kesselman, Dariusz R. Kowalski, Michael Segal: Energy efficient communication in ad hoc networks from user's and designer's perspective. Mobile Computing and Communications Review 9(1): 15-26 (2005)

Stefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal: Improved Approximation Algorithms for Connected Sensor Cover. ADHOC-NOW 2004: 56-69

Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004)

Sergei Bespamyatnikh, Michael Segal: Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2(3): 333-345 (2004)

Hai Huang, Andra W. Richa, Michael Segal: Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks. MONET 9(2): 151-161 (2004)

Sergey Bereg, Michael Segal: Dynamic Algorithms for Approximating Interdistances. Nord. J. Comput. 11(4): 344-355 (2004)

Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink: Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42

Sergei Bespamyatnikh, Michael Segal: Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180

Matthew J. Katz, Frank Nielsen, Michael Segal: Maintenance of a Piercing Set for Intervals with Applications. Algorithmica 36(1): 59-73 (2003)

Michael Segal: Placing an Obnoxious Facility in Geometric Networks. Nord. J. Comput. 10(3): 224-237 (2003)

Hai Huang, Andra W. Richa, Michael Segal: Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks. DIAL-M 2002: 52-61

Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58

Sergei Bespamyatnikh, Michael Segal: Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002)

Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. Computers & OR 29(13): 1859-1872 (2002)

Michael Segal: Lower Bounds for Covering Problems. J. Math. Model. Algorithms 1(1): 17-29 (2002)

Sergei Bespamyatnikh, Binay K. Bhattacharya, Mark Keil, J. David Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)

Ofer Hadar, Michael Segal: Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System. ITCC 2001: 148-152

Sergei Bespamyatnikh, Michael Segal: Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639

Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53

Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111

Matthew J. Katz, Frank Nielsen, Michael Segal: Shooter Location through Piercing Sets. EWCG 2000: 55-58

Matthew J. Katz, Frank Nielsen, Michael Segal: Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563

Matthew J. Katz, Klara Kedem, Michael Segal: Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000)

Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000)

Sergei Bespamyatnikh, Michael Segal: Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2): 7-11 (2000)

Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir: Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geometry Appl. 10(5): 523-534 (2000)

Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious Facility Location: Complete Service with Minimal Harm. Int. J. Comput. Geometry Appl. 10(6): 581-592 (2000)

Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. CCCG 1999

EE Boaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious facility location: Complete service with minimal harm. CCCG 1999

Sergei Bespamyatnikh, Michael Segal: Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287

Sergei Bespamyatnikh, Klara Kedem, Michael Segal: Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329

Michael Segal: On Piercing Sets of Axis-Parallel Rectangles and Rings. Int. J. Comput. Geometry Appl. 9(3): 219- (1999)

Matthew J. Katz, Klara Kedem, Michael Segal: Constrained Square-Center Problems. SWAT 1998: 95-106

Michael Segal, Klara Kedem: Geometric applications of posets. Comput. Geom. 11(3-4): 143-156 (1998)

Michael Segal, Klara Kedem: Enclosing k Points in the Smallest Axis Parallel Rectangle. Inf. Process. Lett. 65(2): 95-99 (1998)

Sergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. CCCG 1997

Michael Segal: On Piercing Sets of Axis-Parallel Rectangles and Rings. ESA 1997: 430-442

Michael Segal, Klara Kedem: Geometric Applications Of Posets. WADS 1997: 402-415

Michael Segal, Klara Kedem: Enclosing K Points in the Smallest Axis Parallel Rectangle. CCCG 1996: 20-25

---

My research

My major research deals with the topics related to the fields of Algorithms Design, Data communication and Data Structures. I'm interested in determining computational difficulty of solving certain specific problem or families of problems. The problems that I am concerned with are fundamental optimization problems that have applications in transportation, station placement, communication, facility location, graph theory, statistics, selection, geometric pattern matching, layout of VLSI circuits and enumeration. While a part my research is based on a standard sequential deterministic model of computation, I am also interested in both parallel and distributed models of computation and the use of probabilistic algorithms. Last several years, I am working in the area of mobile wireless networks and security. My main interests there are to discover the topological nature and combinatorial properties of the networks problems that deal with routing, switching, scheduling, location tracking, distributed computation, sending messages and connectivity of the users.

---

My PhD students

Mr. Yair Allouche

Mr. Liron Levin

Mr. Hanan Shpungin

Mr. Vitaly Milyekovsky

Mr. Yoram Revah

Mr. Itzik Kitroser

Mr. Amit Dvir

Mr. Shimon Abravya

Mr. Marat Tugushev

---

My credo

No pain - no gain!!!

---