Michael Segal

Liron Levin, Michael Segal, Hanan Shpungin: Interference-free energy efficient scheduling in wireless ad hoc networks. Ad Hoc Networks 11(1): 201-212 (2013)

Alexander Kesselman, Kirill Kogan, Sergey Nemzer, Michael Segal: Space and speed tradeoffs in TCAM hierarchical packet classification. J. Comput. Syst. Sci. 79(1): 111-121 (2013)

Shlomi Dolev, Michael Segal, Hanan Shpungin: Bounded-Hop Energy-Efficient Liveness of Flocking Swarms. IEEE Trans. Mob. Comput. 12(3): 516-528 (2013)

Liron Levin, Michael Segal, Hanan Shpungin: Cooperative data collection in ad hoc networks. Wireless Networks 19(2): 145-159 (2013)

Alexander Kesselman, Kirill Kogan, Michael Segal: Improved Competitive Performance Bounds for CIOQ Switches. Algorithmica 63(1-2): 411-424 (2012)

Alexander Kesselman, Kirill Kogan, Michael Segal: Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. Chicago J. Theor. Comput. Sci. 2012 (2012)

Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir: Centdian Computation in Cactus Graphs. J. Graph Algorithms Appl. 16(2): 199-224 (2012)

Zeev Nutov, Michael Segal: Improved approximation algorithms for maximum lifetime problems in wireless networks. Theor. Comput. Sci. 453: 88-97 (2012)

Isaac Keslassy, Kirill Kogan, Gabriel Scalosub, Michael Segal: Providing performance guarantees in multipass network processors. IEEE/ACM Trans. Netw. 20(6): 1895-1909 (2012)

Yair Allouche, Michael Segal: VANET in eyes of hierarchical topology. FOMC 2012: 7

Swaminathan Sankararaman, A. Karim Abu-Affash, Alon Efrat, Sylvester David Eriksson-Bique, Valentin Polishchuk, Srinivasan Ramasubramanian, Michael Segal: Optimization schemes for protective jamming. MobiHoc 2012: 65-74

Dariusz R. Kowalski, Zeev Nutov, Michael Segal: Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains 2012: 124-136

Kirill Kogan, Alejandro López-Ortiz, Gabriel Scalosub, Michael Segal: Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors. CoRR abs/1202.5755 (2012)

Liam Roditty, Michael Segal: On Bounded Leg Shortest Paths Problems. Algorithmica 59(4): 583-600 (2011)

Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin: Novel algorithms for the network lifetime problem in wireless settings. Wireless Networks 17(2): 397-410 (2011)

A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal: The euclidean bottleneck steiner path problem. Symposium on Computational Geometry 2011: 440-447

Liron Levin, Michael Segal, Hanan Shpungin: Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks. FOMC 2011: 62-69

Isaac Keslassy, Kirill Kogan, Gabriel Scalosub, Michael Segal: Providing performance guarantees in multipass network processors. INFOCOM 2011: 3191-3199

Yair Allouche, Michael Segal: Near-optimal, reliable and self-organizing hierarchical topology in VANET. Vehicular Ad Hoc Networks 2011: 79-80

Liron Levin, Michael Segal, Hanan Shpungin: Interference-free energy efficient scheduling in wireless ad hoc networks. WiOpt 2011: 41-48

Alberto Marchetti-Spaccamela, Michael Segal (Eds.): Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings. Lecture Notes in Computer Science 6595, Springer 2011, isbn 978-3-642-19753-6

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)

Hanan Shpungin, Michael Segal: Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks. IEEE/ACM Trans. Netw. 18(6): 1963-1976 (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)

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

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)

Yoram Revah, Michael Segal: Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies. IJDSN 5(5): 463-479 (2009)

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

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

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

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)

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

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

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

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

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

Michael Segal, Alexander Kesselman (Eds.): Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008. ACM 2008, isbn 978-1-60558-244-3

Peng-Jun Wan, Michael Segal (Eds.): MSN 2008, The 4th International Conference on Mobile Ad-hoc and Sensor Networks, Wuhan, China, December 10-12, 2008. IEEE Computer Society 2008, isbn 978-0-7695-3457-2

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)

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)

Michele Luglio, Cristiano Monti, Cesare Roseti, Antonio Saitto, Michael Segal: Interworking between MANET and satellite systems for emergency applications. Int. J. Satellite Communications Networking 25(5): 551-558 (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)

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

Yoram Revah, Michael Segal, Liron Yedidsion: On Real Time Data-Gathering in Sensor Networks. MASS 2007: 1-6

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

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

Sergey Bereg, Binay K. Bhattacharya, David G. 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)

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

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

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

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

Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal: A simple improved distributed algorithm for minimum CDS in unit disk graphs. WiMob (2) 2005: 220-223

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)

Michael Segal: Planar Maximum Box Problem. J. Math. Model. Algorithms 3(1): 31-38 (2004)

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)

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

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

Yehuda Ben-Shimol, Amit Dvir, Michael Segal: SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks. PIMRC 2004: 1011-1015

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)

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

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, J. Mark Keil, David G. Kirkpatrick, Michael Segal: Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002)

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

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 Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639

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

Matthew J. Katz, Klara Kedem, Michael Segal: Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (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)

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)

F. N. Trofimenkoff, Michael Segal, Allan Klassen, J. W. Haslett: Characterization of EM downhole-to-surface communication links. IEEE T. Geoscience and Remote Sensing 38(6): 2539-2548 (2000)

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: Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563

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

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

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

Matthew J. Katz, Klara Kedem, Michael Segal: Improved algorithms for placing undesirable facilities. 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, 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)

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

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