Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Home Page

* | 2009 | |
---|---|---|

70 | EE | Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal: Brief announcement: deaf, dumb, and chatting robots. PODC 2009: 308-309 |

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

68 | EE | Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal: Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot CoRR abs/0902.3549: (2009) |

67 | EE | 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) |

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

2008 | ||

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

64 | EE | 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 |

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

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

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

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

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

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

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

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

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

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

2007 | ||

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

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

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

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

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

48 | 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) | |

47 | EE | 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) |

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

2006 | ||

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

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

43 | EE | 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) |

2005 | ||

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

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

40 | EE | Hai Huang, Andréa W. Richa, Michael Segal: Dynamic Coverage in Ad-Hoc Sensor Networks. MONET 10(1-2): 9-17 (2005) |

39 | EE | 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) |

2004 | ||

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

37 | EE | 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) |

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

35 | EE | Hai Huang, Andréa 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) |

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

2003 | ||

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

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

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

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

2002 | ||

29 | EE | Hai Huang, Andréa 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 |

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

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

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

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

24 | EE | Sergei Bespamyatnikh, Binay K. Bhattacharya, J. 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) |

2001 | ||

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

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

2000 | ||

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

20 | EE | 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 |

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

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

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

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

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

14 | 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) | |

13 | 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) | |

1999 | ||

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

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

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

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

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

1998 | ||

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

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

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

1997 | ||

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

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

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

1996 | ||

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