dblp.uni-trier.dewww.uni-trier.de

Michael Segal Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
70EEYoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal: Brief announcement: deaf, dumb, and chatting robots. PODC 2009: 308-309
69EEMichael Segal, Hanan Shpungin: On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks 7(2): 363-373 (2009)
68EEYoann 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)
67EEShimon 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)
66EEHanan 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
64EEMichael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin: Novel Algorithms for the Network Lifetime Problem in Wireless Settings. ADHOC-NOW 2008: 425-438
63EEAlexander Kesselman, Kirill Kogan, Michael Segal: Improved Competitive Performance Bounds for CIOQ Switches. ESA 2008: 577-588
62EEDaniel Berend, Michael Segal, Hanan Shpungin: Power efficient resilience and lifetime in wireless ad-hoc networks. FOWANC 2008: 17-24
61EEAmit Dvir, Michael Segal: The (k, l) Coredian Tree for Ad Hoc Networks. ICDCS Workshops 2008: 267-272
60EEAlexander Kesselman, Kirill Kogan, Michael Segal: Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. PODC 2008: 335-344
59EEAlexander 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)
57EEYoram Revah, Michael Segal: Improved bounds for data-gathering time in sensor networks. Computer Communications 31(17): 4026-4034 (2008)
56EEMichael Segal: Fast algorithm for multicast and data gathering in wireless networks. Inf. Process. Lett. 107(1): 29-33 (2008)
55EEOfer Hadar, Shlomo Greenberg, Michael Segal: EPCRTT-based smoothing and multiplexing of VBR video traffic. Multimedia Tools Appl. 36(3): 203-219 (2008)
54EEMichael 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
52EEYoram Revah, Michael Segal: Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies. ICNS 2007: 46
51EEYoram Revah, Michael Segal: Improved Lower Bounds for Data-Gathering Time in Sensor Networks. ICNS 2007: 76
50EEAmit Dvir, Michael Segal: Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks. Networking 2007: 13-24
49EELiam 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)
47EEYehuda 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)
46EEStefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal: Improved approximation algorithms for connected sensor cover. Wireless Networks 13(2): 153-164 (2007)
2006
45EEPaz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin: Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84
44EESergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Competitive Algorithms for Maintaining a Mobile Center. MONET 11(2): 177-186 (2006)
43EEStefan 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
42EEHanan Shpungin, Michael Segal: k-fault resistance in wireless ad-hoc networks. DIALM-POMC 2005: 89-96
41EEPaz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal: Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005)
40EEHai Huang, Andréa W. Richa, Michael Segal: Dynamic Coverage in Ad-Hoc Sensor Networks. MONET 10(1-2): 9-17 (2005)
39EEAlexander 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
38EEStefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal: Improved Approximation Algorithms for Connected Sensor Cover. ADHOC-NOW 2004: 56-69
37EEMichael 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)
36EESergei Bespamyatnikh, Michael Segal: Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2(3): 333-345 (2004)
35EEHai 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
32EESergei Bespamyatnikh, Michael Segal: Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180
31EEMatthew 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
29EEHai 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
27EESergei Bespamyatnikh, Michael Segal: Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002)
26EEMatthew 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)
24EESergei 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
23EEOfer Hadar, Michael Segal: Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System. ITCC 2001: 148-152
22EESergei Bespamyatnikh, Michael Segal: Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639
2000
21EESergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal: Mobile facility location. DIAL-M 2000: 46-53
20EESergei 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
18EEMatthew 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)
16EESergei Bespamyatnikh, Michael Segal: Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000)
15EESergei 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
12EEMatthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. CCCG 1999
11EEBoaz Ben-Moshe, Matthew J. Katz, Michael Segal: Obnoxious facility location: Complete service with minimal harm. CCCG 1999
10EESergei Bespamyatnikh, Michael Segal: Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287
9EESergei 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
7EEMatthew 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)
5EEMichael 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
3EEMichael 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

Coauthor Index

1Shimon Abravaya [67]
2Boaz Ben-Moshe [11] [13] [47]
3Yehuda Ben-Shimol [47]
4Yoav Ben-Yehezkel [47]
5Sergey Bereg (Sergei Bespamyatnikh) [4] [9] [10] [14] [15] [16] [20] [21] [22] [24] [27] [28] [32] [33] [34] [36] [37] [44]
6Daniel Berend [62]
7Binay K. Bhattacharya [20] [21] [24] [28] [44]
8Paz Carmi [41] [45] [48]
9Yoann Dieudonné [68] [70]
10Shlomi Dolev [41] [68] [70]
11Amit Dvir [47] [50] [58] [61]
12Michael Elkin [64]
13Stefan Funke [38] [43] [46]
14Shlomo Greenberg [55]
15Ofer Hadar [23] [55]
16Sariel Har-Peled [41]
17Hai Huang [29] [35] [40]
18Matthew J. Katz (Matya Katz) [7] [11] [12] [13] [17] [18] [19] [26] [31] [41] [45] [48]
19Klara Kedem [1] [2] [5] [6] [7] [9] [12] [14] [17] [26]
20J. Mark Keil [20] [24] [33] [37]
21Alexander Kesselman (Alexander Keizelman) [38] [39] [43] [46] [59] [60] [63] [65]
22David G. Kirkpatrick [20] [21] [28] [44]
23J. David Kirkpatrick [24]
24Kirill Kogan [59] [60] [63]
25Dariusz R. Kowalski [39]
26Fabian Kuhn [46]
27Yuval Lando [64]
28Zvi Lotker [38] [46]
29Ulrich Meyer [43]
30Frank Nielsen [18] [19] [31]
31Zeev Nutov [64]
32Franck Petit [68] [70]
33Yoram Revah [51] [52] [57]
34Andréa W. Richa [29] [35] [40]
35Liam Roditty [49]
36Hanan Shpungin [42] [45] [48] [53] [62] [64] [66] [69]
37Jack Snoeyink [33] [37]
38Michael J. Spriggs [33] [37]
39Arie Tamir [14]
40Eli Zeitlin [54]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)