default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Segal 0001
Person information
- affiliation: Ben-Gurion University, Beersheba, Israel
Other persons with the same name
- Michael Segal 0002 (aka: Michael M. Segal) — SimulConsult Inc., Chestnut Hill, MA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j97]Guy Rozenberg, Michael Segal:
Using spanners to improve network performance. Comput. Networks 257: 110976 (2025)- 2024
- [c99]David Denisov, Dan Feldman, Shlomi Dolev, Michael Segal:
Provable Imbalanced Point Clustering. CSCML 2024: 79-91 - [c98]Alon Marzin, Moshe Schwartz, Michael Segal:
Covert Communication by Exploiting Error-Correcting Codes. DRCN 2024: 143-150 - [d1]Alon Marzin, Moshe Schwartz, Michael Segal:
Covert Channels Data. IEEE DataPort, 2024
- [i14]David Denisov, Dan Feldman, Shlomi Dolev, Michael Segal:
Provable Imbalanced Point Clustering. CoRR abs/2408.14225 (2024) - 2023
- [j96]Eyal Nussbaum, Michael Segal
, Oles Holembovskyy:
Finding Geometric Facilities with Location Privacy. Algorithmica 85(12): 3572-3601 (2023) - [j95]Oren Markovitz, Michael Segal:
Demand Island Routing for LEO satellite constellations. Comput. Networks 225: 109655 (2023) - [j94]Kiril Danilchenko, Zeev Nutov, Michael Segal:
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments. IEEE/ACM Trans. Netw. 31(6): 2483-2498 (2023) - [j93]Kiril Danilchenko, Zeev Nutov, Michael Segal:
Doing their best: How to provide service by limited number of drones? Wirel. Networks 29(1): 209-220 (2023) - [c97]Kiril Danilchenko, Nir Lazmi, Michael Segal:
Online Learning Framework for Radio Link Failure Prediction in FANETs. FedCSIS 2023: 41-48 - [c96]Alon Freund, Rami Puzis, Michael Segal:
Link2speed: VANET speed assessment via link-state analysis. WCNC 2023: 1-6 - [c95]Kiril Danilchenko, Gil Kedar, Michael Segal:
Reinforcement Learning Based Routing For Deadline-Driven Wireless Communication. WiMob 2023: 30-35 - 2022
- [j92]Oren Markovitz, Michael Segal:
LEO satellite beam management algorithms. Comput. Networks 214: 109160 (2022) - [j91]Oren Markovitz, Michael Segal:
Asymmetric Differential Routing for low orbit satellite constellations. Comput. Commun. 194: 15-28 (2022) - [j90]Michael Segal, Oren Tzfaty:
Finding bounded diameter minimum spanning tree in general graphs. Comput. Oper. Res. 144: 105822 (2022) - [j89]Muhammad Ibrar, Lei Wang, Aamir Akbar, Mian Ahmad Jan, Nadir Shah, Shahbaz Akhtar Abid, Michael Segal:
3-D-SIS: A 3-D-Social Identifier Structure for Collaborative Edge Computing Based Social IoT. IEEE Trans. Comput. Soc. Syst. 9(1): 313-323 (2022) - [j88]Eyal Nussbaum, Michael Segal:
Privacy Analysis of Query-Set-Size Control. ACM Trans. Priv. Secur. 25(4): 31:1-31:19 (2022) - [c94]Oren Markovitz, Michael Segal:
Asymmetric Differential Routing for Low Orbit Satellite Constellations. ICC 2022: 1118-1123 - [c93]Kiril Danilchenko, Michael Segal, Dan Vilenchik:
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. ICWSM 2022: 125-134 - [c92]Kiril Danilchenko, Michael Segal:
TDMA Frame Length Minimization by Deep Learning for Swarm Communication. IWCMC 2022: 617-622 - [c91]Oren Markovitz, Michael Segal:
Distributed LEO Satellite Virtual Swarm. IWCMC 2022: 1347-1352 - [c90]Shlomi Dolev, Alexander Fok, Michael Segal:
Swarming with (Visual) Secret (Shared) Mission. NCA 2022: 269-276 - [e7]Thomas Erlebach, Michael Segal:
Algorithmics of Wireless Networks - 18th International Symposium on Algorithmics of Wireless Networks, ALGOSENSORS 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Lecture Notes in Computer Science 13707, Springer 2022, ISBN 978-3-031-22049-4 [contents] - [e6]Lei Wang, Michael Segal, Jenhui Chen, Tie Qiu:
Wireless Algorithms, Systems, and Applications - 17th International Conference, WASA 2022, Dalian, China, November 24-26, 2022, Proceedings, Part I. Lecture Notes in Computer Science 13471, Springer 2022, ISBN 978-3-031-19207-4 [contents] - [e5]Lei Wang, Michael Segal, Jenhui Chen, Tie Qiu:
Wireless Algorithms, Systems, and Applications - 17th International Conference, WASA 2022, Dalian, China, November 24-26, 2022, Proceedings, Part II. Lecture Notes in Computer Science 13472, Springer 2022, ISBN 978-3-031-19213-5 [contents] - [e4]Lei Wang, Michael Segal, Jenhui Chen, Tie Qiu:
Wireless Algorithms, Systems, and Applications - 17th International Conference, WASA 2022, Dalian, China, November 24-26, 2022, Proceedings, Part III. Lecture Notes in Computer Science 13473, Springer 2022, ISBN 978-3-031-19210-4 [contents] - [i13]Kiril Danilchenko, Michael Segal, Dan Vilenchik:
Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. CoRR abs/2205.13422 (2022) - 2021
- [j87]Harel Yedidsion, Danny Hermelin, Michael Segal:
Collective multi agent deployment for wireless sensor network maintenance. Eng. Appl. Artif. Intell. 102: 104265 (2021) - [j86]Roni Mateless, Michael Segal, Robert Moskovitch:
THAAD: Efficient matching queries under temporal abstraction for anomaly detection. Perform. Evaluation 149-150: 102219 (2021) - [j85]Chen Levi, Michael Segal:
Avoiding bottlenecks in networks by short paths. Telecommun. Syst. 76(4): 491-503 (2021) - [j84]Roni Mateless, Haim Zlatokrilov, Liran Orevi, Michael Segal, Robert Moskovitch:
IPvest: Clustering the IP Traffic of Network Entities Hidden Behind a Single IP Address Using Machine Learning. IEEE Trans. Netw. Serv. Manag. 18(3): 3647-3661 (2021) - [c89]Eyal Nussbaum, Michael Segal:
Privacy Vulnerability of NeNDS Collaborative Filtering. CSCML 2021: 145-152 - [c88]Ron Posti, Michael Segal:
Improved Routing in Networks through Load Prediction Strategy. DRCN 2021: 1-6 - [c87]Kiril Danilchenko, Michael Segal:
An Efficient Connected Swarm Deployment via Deep Learning. FedCSIS 2021: 1-7 - [c86]Oren Markovitz, Michael Segal:
Advanced Routing Algorithms for Low Orbit Satellite Constellations. ICC 2021: 1-6 - [c85]Guy Rozenberg, Michael Segal:
Poster: Network Performance Upgrade by Cut Spanners. Networking 2021: 1-3 - [c84]Oren Markovitz, Michael Segal:
LEO Satellite Beam Management Algorithms. WiMob 2021: 115-120 - [c83]Oren Markovitz, Michael Segal:
Seam-Aware Location-Based Random Walk Routing Algorithms for Low Orbit Satellite Constellations. WiMob 2021: 351-356 - 2020
- [j83]Harel Yedidsion, Stav Ashur, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal:
Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. Algorithmica 82(10): 2784-2808 (2020) - [j82]Yoad Zur, Michael Segal:
Improved Solution to Data Gathering with Mobile Mule. Algorithmica 82(11): 3125-3164 (2020) - [c82]Kiril Danilchenko, Michael Segal, Zeev Nutov:
Covering Users by a Connected Swarm Efficiently. ALGOSENSORS 2020: 32-44 - [c81]Kiril Danilchenko, Michael Segal:
Connected Ad-Hoc swarm of drones. DroNet@MobiSys 2020: 4:1-4:6 - [c80]Eyal Nussbaum, Michael Segal:
Privacy Analysis of Query-Set-Size Control. PSD 2020: 183-194 - [c79]Ilia Odeski, Michael Segal:
Anomaly Detection in CAN-BUS Using Pattern Matching Algorithm. SSCC 2020: 180-196 - [c78]Eyal Nussbaum, Michael Segal:
Finding Geometric Medians with Location Privacy. TrustCom 2020: 1874-1881
2010 – 2019
- 2019
- [j81]Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal:
Locating battery charging stations to facilitate almost shortest paths. Discret. Appl. Math. 254: 10-16 (2019) - [j80]Joshua Carlson, Leslie Hogben, Jürgen Kritschgau, Kate J. Lorenzen, Michael Segal, Seth Selken, Vicente Valle Martinez:
Throttling positive semidefinite zero forcing propagation time on graphs. Discret. Appl. Math. 254: 33-46 (2019) - [j79]Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal:
Explicit Communication Among Stigmergic Robots. Int. J. Found. Comput. Sci. 30(2): 315-332 (2019) - [j78]Vladimir Kaplun, Michael Segal:
Breaching the privacy of connected vehicles network. Telecommun. Syst. 70(4): 541-555 (2019) - [c77]Eyal Nussbaum, Michael Segal:
Skiplist Timing Attack Vulnerability. DPM/CBT@ESORICS 2019: 49-58 - [c76]Roni Mateless, Michael Segal:
Approximate String Matching for DNS Anomaly Detection. SpaCCS 2019: 490-504 - [i12]Vladimir Kaplun, Michael Segal:
Breaching the privacy of connected vehicles network. CoRR abs/1901.01070 (2019) - [i11]Roni Mateless, Michael Segal:
Approximate String Matching for DNS Anomaly Detection. CoRR abs/1905.09455 (2019) - [i10]Eyal Nussbaum, Michael Segal:
Privacy Vulnerabilities of Dataset Anonymization Techniques. CoRR abs/1905.11694 (2019) - [i9]Yoad Zur, Michael Segal:
Improved solution to data gathering with mobile mule. CoRR abs/1910.09011 (2019) - [i8]Roni Mateless, Michael Segal, Robert Moskovitch:
THAAD: Efficient Matching Queries under Temporal Abstraction for Anomaly Detection. CoRR abs/1911.00336 (2019) - [i7]Kiril Danilchenko, Michael Segal:
Construction and Maintenance of Swarm Drones. CoRR abs/1912.06360 (2019) - 2018
- [j77]Michael Segal:
Journal of Computer and System Science: 50 years of celebration. In memory of Professor Edward Blum. J. Comput. Syst. Sci. 94: 1 (2018) - [c75]Michael Segal:
Privacy Aspects in Data Querying. COCOON 2018: x - 2017
- [j76]Yair Allouche, Esther M. Arkin, Yuval Cassuto, Alon Efrat, Guy Grebla, Joseph S. B. Mitchell, Swaminathan Sankararaman, Michael Segal:
Secure communication through jammers jointly optimized in geography and time. Pervasive Mob. Comput. 41: 83-105 (2017) - [j75]Joel Lanir, Tsvi Kuflik, Julia Sheidin, Nisan Yavin, Kate Leiderman, Michael Segal:
Visualizing museum visitors' behavior: Where do they go and what do they do there? Pers. Ubiquitous Comput. 21(2): 313-326 (2017) - [j74]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Dynamic attribute based vehicle authentication. Wirel. Networks 23(4): 1045-1062 (2017) - [c74]Danny Hermelin, Michael Segal, Harel Yedidsion:
Coordination of Mobile Mules via Facility Location Strategies. PAAMS 2017: 107-119 - [c73]Harel Yedidsion, Aritra Banik, Paz Carmi, Matthew J. Katz, Michael Segal:
Efficient data retrieval in faulty sensor networks using a mobile mule. WiOpt 2017: 1-8 - [i6]Danny Hermelin, Michael Segal, Harel Yedidsion:
Coordination of Mobile Mules via Facility Location Strategies. CoRR abs/1702.04142 (2017) - 2016
- [j73]Jon Crowcroft, Liron Levin, Michael Segal:
Using data mules for sensor network data recovery. Ad Hoc Networks 40: 26-36 (2016) - [j72]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Optical PUF for Non-Forwardable Vehicle Authentication. Comput. Commun. 93: 52-67 (2016) - [j71]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal:
Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. J. Netw. Comput. Appl. 74: 31-43 (2016) - [j70]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Vehicle authentication via monolithically certified public key and attributes. Wirel. Networks 22(3): 879-896 (2016) - [c72]Joel Lanir, Tsvi Kuflik, Nisan Yavin, Kate Leiderman, Michael Segal:
Visualizing Museum Visitors' Behavior. AVI*CH 2016: 44-47 - [c71]Michael Segal:
Location always matters: how to improve performance of dynamic networks? FedCSIS 2016: 5 - [c70]Bingxian Lu, Zhicheng Zeng, Lei Wang, Brian Peck, Daji Qiao, Michael Segal:
Confining Wi-Fi Coverage: A Crowdsourced Method Using Physical Layer Information. SECON 2016: 1-9 - 2015
- [j69]Vitaly Milyeykovski, Michael Segal, Vladimir Katz:
Using central nodes for efficient data collection in wireless sensor networks. Comput. Networks 91: 425-437 (2015) - [j68]Jon Crowcroft, Michael Segal, Liron Levin:
Improved structures for data collection in static and mobile wireless sensor networks. J. Heuristics 21(2): 233-256 (2015) - [j67]Liron Levin, Dariusz R. Kowalski, Michael Segal:
Message and time efficient multi-broadcast schemes. Theor. Comput. Sci. 569: 13-23 (2015) - [j66]Dmitry Zelikman, Michael Segal:
Reducing Interferences in VANETs. IEEE Trans. Intell. Transp. Syst. 16(3): 1582-1587 (2015) - [j65]Yair Allouche, Michael Segal:
Cluster-Based Beaconing Process for VANET. Veh. Commun. 2(2): 80-94 (2015) - [c69]Esther M. Arkin, Yuval Cassuto, Alon Efrat, Guy Grebla, Joseph S. B. Mitchell, Swaminathan Sankararaman, Michael Segal:
Optimal placement of protective jammers for securing wireless transmissions in a geographic domain. IPSN 2015: 37-46 - [c68]Yair Allouche, Yuval Cassuto, Alon Efrat, Michael Segal, Esther M. Arkin, Guy Grebla, Joseph S. B. Mitchell, Swaminathan Sankararaman:
Secure Communication through Jammers Jointly Optimized in Geography and Time. MobiHoc 2015: 227-236 - [c67]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Optical PUF for Non Forwardable Vehicle Authentication. NCA 2015: 204-207 - [c66]Jon Crowcroft, Liron Levin, Michael Segal:
Using data mules for sensor network resiliency. WiOpt 2015: 427-434 - [i5]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Vehicle Authentication via Monolithically Certified Public Key and Attributes. CoRR abs/1507.04491 (2015) - [i4]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Vehicle to Vehicle Authentication. CoRR abs/1508.01324 (2015) - 2014
- [j64]Ohad Ben-Shahar, Shlomi Dolev, Andrey Dolgin, Michael Segal:
Direction election in flocking swarms. Ad Hoc Networks 12: 250-258 (2014) - [j63]Liron Levin, Alon Efrat, Michael Segal:
Collecting data in ad-hoc networks with reduced uncertainty. Ad Hoc Networks 17: 71-81 (2014) - [j62]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal:
The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. Discret. Comput. Geom. 51(1): 1-23 (2014) - [j61]Swaminathan Sankararaman, A. Karim Abu-Affash, Alon Efrat, Sylvester David Eriksson-Bique, Valentin Polishchuk, Srinivasan Ramasubramanian, Michael Segal:
Optimization Schemes for Protective Jamming. Mob. Networks Appl. 19(1): 45-60 (2014) - [j60]Dariusz R. Kowalski, Eyal Nussbaum, Michael Segal, Vitaly Milyeykovski:
Scheduling problems in transportation networks of line topology. Optim. Lett. 8(2): 777-799 (2014) - [c65]Nathan C. Hulse, Grant M. Wood, Siew Lam, Michael Segal:
Integrating a Diagnostic Decision Support Tool into an Electronic Health Record and Relevant Clinical Workflows through Standards-Based Exchange. AMIA 2014 - [c64]Esther M. Arkin, Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell, Michael Segal:
Locating Battery Charging Stations to Facilitate Almost Shortest Paths. ATMOS 2014: 25-33 - [c63]Kirill Kogan, Alejandro López-Ortiz, Sergey I. Nikolenko, Gabriel Scalosub, Michael Segal:
Balancing work and size with bounded buffers. COMSNETS 2014: 1-8 - [c62]Jon Crowcroft, Michael Segal, Liron Levin:
Improved structures for data collection in wireless sensor networks. INFOCOM 2014: 1375-1383 - [c61]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Dynamic Attribute Based Vehicle Authentication. NCA 2014: 1-8 - 2013
- [j59]Liron Levin, Michael Segal, Hanan Shpungin:
Interference-free energy efficient scheduling in wireless ad hoc networks. Ad Hoc Networks 11(1): 201-212 (2013) - [j58]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) - [j57]Yair Allouche, Michael Segal:
A Cluster-Based Beaconing Approach in VANETs: Near Optimal Topology Via Proximity Information. Mob. Networks Appl. 18(6): 766-787 (2013) - [j56]Shlomi Dolev, Michael Segal, Hanan Shpungin:
Bounded-Hop Energy-Efficient Liveness of Flocking Swarms. IEEE Trans. Mob. Comput. 12(3): 516-528 (2013) - [j55]Hanan Shpungin, Michael Segal:
Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics. ACM Trans. Sens. Networks 9(4): 37:1-37:25 (2013) - [j54]Liron Levin, Michael Segal, Hanan Shpungin:
Cooperative data collection in ad hoc networks. Wirel. Networks 19(2): 145-159 (2013) - [c60]Yair Allouche, Michael Segal:
A cluster based beaconing process for VANET. Vehicular Ad Hoc Networks 2013: 87-90 - [c59]Alexander Plutov, Michael Segal:
The delta-betweenness centrality. PIMRC 2013: 3376-3380 - [c58]Shlomi Dolev, Lukasz Krzywiecki, Nisha Panwar, Michael Segal:
Certificating Vehicle Public Key with Vehicle Attributes A (periodical) Licensing Routine, Against Man-in-the-Middle Attacks and Beyond. ASCoMS@SAFECOMP 2013 - [c57]Vitaly Milyeykovski, Michael Segal, Hanan Shpungin:
Location, location, location: Using central nodes for efficient data collection in WSNs. WiOpt 2013: 333-340 - [c56]Liron Levin, Alon Efrat, Michael Segal:
Collecting data in ad-hoc networks with reduced uncertainty. WiOpt 2013: 659-666 - [c55]Liron Levin, Dariusz R. Kowalski, Michael Segal:
Message and time efficient multi-broadcast schemes. FOMC 2013: 21-37 - 2012
- [j53]Alexander Kesselman, Kirill Kogan, Michael Segal:
Improved Competitive Performance Bounds for CIOQ Switches. Algorithmica 63(1-2): 411-424 (2012) - [j52]Alexander Kesselman, Kirill Kogan, Michael Segal:
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. Chic. J. Theor. Comput. Sci. 2012 (2012) - [j51]Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir:
Centdian Computation in Cactus Graphs. J. Graph Algorithms Appl. 16(2): 199-224 (2012) - [j50]Zeev Nutov, Michael Segal:
Improved approximation algorithms for maximum lifetime problems in wireless networks. Theor. Comput. Sci. 453: 88-97 (2012) - [j49]Isaac Keslassy, Kirill Kogan, Gabriel Scalosub, Michael Segal:
Providing performance guarantees in multipass network processors. IEEE/ACM Trans. Netw. 20(6): 1895-1909 (2012) - [c54]Yair Allouche, Michael Segal:
VANET in eyes of hierarchical topology. FOMC 2012: 7 - [c53]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 - [c52]Dariusz R. Kowalski, Zeev Nutov, Michael Segal:
Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains 2012: 124-136 - [i3]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) - 2011
- [j48]Liam Roditty, Michael Segal:
On Bounded Leg Shortest Paths Problems. Algorithmica 59(4): 583-600 (2011) - [j47]Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin:
Novel algorithms for the network lifetime problem in wireless settings. Wirel. Networks 17(2): 397-410 (2011) - [c51]A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal:
The euclidean bottleneck steiner path problem. SCG 2011: 440-447 - [c50]Liron Levin, Michael Segal, Hanan Shpungin:
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks. FOMC 2011: 62-69 - [c49]Isaac Keslassy, Kirill Kogan, Gabriel Scalosub, Michael Segal:
Providing performance guarantees in multipass network processors. INFOCOM 2011: 3191-3199 - [c48]Yair Allouche, Michael Segal:
Near-optimal, reliable and self-organizing hierarchical topology in VANET. Vehicular Ad Hoc Networks 2011: 79-80 - [c47]Liron Levin, Michael Segal, Hanan Shpungin:
Interference-free energy efficient scheduling in wireless ad hoc networks. WiOpt 2011: 41-48 - [e3]Alberto Marchetti-Spaccamela, Michael Segal:
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 [contents] - 2010
- [j46]Daniel Berend, Michael Segal, Hanan Shpungin:
Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. Ad Hoc Sens. Wirel. Networks 10(1): 61-87 (2010) - [j45]Shimon Abravaya, Michael Segal:
Maximizing the number of obnoxious facilities to locate within a bounded region. Comput. Oper. Res. 37(1): 163-171 (2010) - [j44]Yoram Revah, Michael Segal, Liron Yedidsion:
Real-time data gathering in sensor networks. Discret. Appl. Math. 158(5): 543-550 (2010) - [j43]Alexander Kesselman, Kirill Kogan, Michael Segal:
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. Distributed Comput. 23(3): 163-175 (2010) - [j42]Hanan Shpungin, Michael Segal:
Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks. IEEE/ACM Trans. Netw. 18(6): 1963-1976 (2010) - [j41]Amit Dvir, Michael Segal:
Placing and maintaining a core node in wirelessad hoc networks. Wirel. Commun. Mob. Comput. 10(6): 826-842 (2010) - [j40]Hanan Shpungin, Michael Segal:
On minimizing the total power of k-strongly connected wireless networks. Wirel. Networks 16(4): 1075-1089 (2010) - [c46]Ohad Ben-Shahar, Shlomi Dolev, Andrey Dolgin, Michael Segal:
Direction election in flocking swarms. DIALM-PODC 2010: 73-80 - [c45]Michael Segal, Hanan Shpungin:
Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics. INFOCOM 2010: 6-10 - [c44]Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir:
Centdian Computation for Sensor Networks. TAMC 2010: 187-198 - [c43]Liron Levin, Michael Segal, Hanan Shpungin:
Optimizing performance of ad-hoc networks under energy and scheduling constraints. WiOpt 2010: 11-20 - [c42]Shlomi Dolev, Michael Segal, Hanan Shpungin:
Bounded-hop strong connectivity for flocking swarms. WiOpt 2010: 177-185
2000 – 2009
- 2009
- [j39]Michael Segal, Hanan Shpungin:
On construction of minimum energy k-fault resistant topologies. Ad Hoc Networks 7(2): 363-373 (2009) - [j38]Shimon Abravaya, Michael Segal:
Low complexity algorithms for optimal consumer push-pull partial covering in the plane. Eur. J. Oper. Res. 197(2): 456-464 (2009) - [j37]Yoram Revah, Michael Segal:
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies. Int. J. Distributed Sens. Networks 5(5): 463-479 (2009) - [j36]Michael Segal:
Improving lifetime of wireless sensor networks. Netw. Protoc. Algorithms 1(2): 48-60 (2009) - [j35]Hanan Shpungin, Michael Segal:
Low-energy fault-tolerant bounded-hop broadcast in wireless networks. IEEE/ACM Trans. Netw. 17(2): 582-590 (2009) - [c41]Zeev Nutov, Michael Segal:
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. ALGOSENSORS 2009: 41-51 - [c40]Hanan Shpungin, Michael Segal:
Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks. INFOCOM 2009: 163-171 - [c39]Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal:
Deaf, Dumb, and Chatting Asynchronous Robots. OPODIS 2009: 71-85 - [c38]Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal:
Brief announcement: deaf, dumb, and chatting robots. PODC 2009: 308-309 - [i2]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) - 2008
- [j34]Amit Dvir, Michael Segal:
The (k, l) Coredian Tree for Ad Hoc Networks. Ad Hoc Sens. Wirel. Networks 6(1-2): 123-144 (2008) - [j33]Yoram Revah, Michael Segal:
Improved bounds for data-gathering time in sensor networks. Comput. Commun. 31(17): 4026-4034 (2008) - [j32]Michael Segal:
Fast algorithm for multicast and data gathering in wireless networks. Inf. Process. Lett. 107(1): 29-33 (2008) - [j31]Ofer Hadar, Shlomo Greenberg, Michael Segal:
EPCRTT-based smoothing and multiplexing of VBR video traffic. Multim. Tools Appl. 36(3): 203-219 (2008) - [j30]Michael Segal, Eli Zeitlin:
Computing closest and farthest points for a query segment. Theor. Comput. Sci. 393(1-3): 294-300 (2008) - [c37]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 - [c36]Alexander Kesselman, Kirill Kogan, Michael Segal:
Improved Competitive Performance Bounds for CIOQ Switches. ESA 2008: 577-588 - [c35]Amit Dvir, Michael Segal:
The (k, l) Coredian Tree for Ad Hoc Networks. ICDCS Workshops 2008: 267-272 - [c34]Daniel Berend, Michael Segal, Hanan Shpungin:
Power efficient resilience and lifetime in wireless ad-hoc networks. FOWANC 2008: 17-24 - [c33]Alexander Kesselman, Kirill Kogan, Michael Segal:
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. PODC 2008: 335-344 - [c32]Alexander Kesselman, Kirill Kogan, Michael Segal:
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. SIROCCO 2008: 170-184 - [e2]Michael Segal, Alexander Kesselman:
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 [contents] - [e1]Peng-Jun Wan, Michael Segal:
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 [contents] - 2007
- [b1]Michael Segal:
Measurement and control of exciton spin in organic light emitting devices. Massachusetts Institute of Technology, Cambridge, MA, USA, 2007 - [j29]Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. Ad Hoc Sens. Wirel. Networks 4(4): 355-366 (2007) - [j28]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) - [j27]Michele Luglio, Cristiano Monti, Cesare Roseti, Antonio Saitto, Michael Segal:
Interworking between MANET and satellite systems for emergency applications. Int. J. Satell. Commun. Netw. 25(5): 551-558 (2007) - [j26]Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal:
Improved approximation algorithms for connected sensor cover. Wirel. Networks 13(2): 153-164 (2007) - [c31]Hanan Shpungin, Michael Segal:
Low Energy Construction of Fault Tolerant Topologies in Wireless Networks. DIALM-POMC 2007 - [c30]Yoram Revah, Michael Segal:
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies. ICNS 2007: 46 - [c29]Yoram Revah, Michael Segal:
Improved Lower Bounds for Data-Gathering Time in Sensor Networks. ICNS 2007: 76 - [c28]Yoram Revah, Michael Segal, Liron Yedidsion:
On Real Time Data-Gathering in Sensor Networks. MASS 2007: 1-6 - [c27]Amit Dvir, Michael Segal:
Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks. Networking 2007: 13-24 - [c26]Liam Roditty, Michael Segal:
On bounded leg shortest paths problems. SODA 2007: 775-784 - 2006
- [j25]Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Competitive Algorithms for Maintaining a Mobile Center. Mob. Networks Appl. 11(2): 177-186 (2006) - [j24]Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal:
A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Networks 2(3): 444-453 (2006) - [c25]Amit Dvir, Yehuda Ben-Shimol, Yoav Ben-Yehezkel, Michael Segal:
Automated antenna positioning for wireless networks. CCNC 2006: 902-906 - [c24]Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin:
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. PerCom Workshops 2006: 80-84 - 2005
- [j23]Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal:
Geographic Quorum System Approximations. Algorithmica 41(4): 233-244 (2005) - [j22]Hai Huang, Andréa W. Richa, Michael Segal:
Dynamic Coverage in Ad-Hoc Sensor Networks. Mob. Networks Appl. 10(1-2): 9-17 (2005) - [j21]Alexander Kesselman, Dariusz R. Kowalski, Michael Segal:
Energy efficient communication in ad hoc networks from user's and designer's perspective. ACM SIGMOBILE Mob. Comput. Commun. Rev. 9(1): 15-26 (2005) - [c23]Hanan Shpungin, Michael Segal:
k-fault resistance in wireless ad-hoc networks. DIALM-POMC 2005: 89-96 - [c22]Alexander Kesselman, Dariusz R. Kowalski, Michael Segal:
Energy efficient connectivity in ad hoc networks from user's and designer's perspective. ICC 2005: 3161-3165 - [c21]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 - 2004
- [j20]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) - [j19]Sergei Bespamyatnikh, Michael Segal:
Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2(3): 333-345 (2004) - [j18]Michael Segal:
Planar Maximum Box Problem. J. Math. Model. Algorithms 3(1): 31-38 (2004) - [j17]Hai Huang, Andréa W. Richa, Michael Segal:
Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks. Mob. Networks Appl. 9(2): 151-161 (2004) - [j16]Sergey Bereg, Michael Segal:
Dynamic Algorithms for Approximating Interdistances. Nord. J. Comput. 11(4): 344-355 (2004) - [c20]Stefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal:
Improved Approximation Algorithms for Connected Sensor Cover. ADHOC-NOW 2004: 56-69 - [c19]Yehuda Ben-Shimol, Amit Dvir, Michael Segal:
SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks. PIMRC 2004: 1011-1015 - 2003
- [j15]Matthew J. Katz, Frank Nielsen, Michael Segal:
Maintenance of a Piercing Set for Intervals with Applications. Algorithmica 36(1): 59-73 (2003) - [j14]Michael Segal:
Placing an Obnoxious Facility in Geometric Networks. Nord. J. Comput. 10(3): 224-237 (2003) - [c18]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 - [c17]Sergei Bespamyatnikh, Michael Segal:
Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180 - 2002
- [j13]Sergei Bespamyatnikh, Michael Segal:
Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002) - [j12]Matthew J. Katz, Klara Kedem, Michael Segal:
Improved algorithms for placing undesirable facilities. Comput. Oper. Res. 29(13): 1859-1872 (2002) - [j11]Michael Segal:
Lower Bounds for Covering Problems. J. Math. Model. Algorithms 1(1): 17-29 (2002) - [j10]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) - [c16]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 - [c15]Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58 - 2001
- [c14]Sergei Bespamyatnikh, Michael Segal:
Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639 - [c13]Ofer Hadar, Michael Segal:
Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System. ITCC 2001: 148-152 - 2000
- [j9]Matthew J. Katz, Klara Kedem, Michael Segal:
Discrete rectilinear 2-center problems. Comput. Geom. 15(4): 203-214 (2000) - [j8]Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir:
Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. 10(5): 523-534 (2000) - [j7]Boaz Ben-Moshe, Matthew J. Katz, Michael Segal:
Obnoxious Facility Location: Complete Service with Minimal Harm. Int. J. Comput. Geom. Appl. 10(6): 581-592 (2000) - [j6]Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000) - [j5]Sergei Bespamyatnikh, Michael Segal:
Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2): 7-11 (2000) - [j4]Fred N. Trofimenkoff, Michael Segal, Allan Klassen, James W. Haslett:
Characterization of EM downhole-to-surface communication links. IEEE Trans. Geosci. Remote. Sens. 38(6): 2539-2548 (2000) - [c12]Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Mobile facility location. DIAL-M 2000: 46-53 - [c11]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 - [c10]Matthew J. Katz, Frank Nielsen, Michael Segal:
Maintenance of a Percing Set for Intervals with Applications. ISAAC 2000: 552-563 - [i1]Matthew J. Katz, Frank Nielsen, Michael Segal:
Shooter Location through Piercing Sets. EuroCG 2000: 55-58
1990 – 1999
- 1999
- [j3]Michael Segal:
On Piercing Sets of Axis-Parallel Rectangles and Rings. Int. J. Comput. Geom. Appl. 9(3): 219-234 (1999) - [c9]Boaz Ben-Moshe, Matthew J. Katz, Michael Segal:
Obnoxious facility location: Complete service with minimal harm. CCCG 1999 - [c8]Matthew J. Katz, Klara Kedem, Michael Segal:
Improved algorithms for placing undesirable facilities. CCCG 1999 - [c7]Sergei Bespamyatnikh, Michael Segal:
Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287 - [c6]Sergei Bespamyatnikh, Klara Kedem, Michael Segal:
Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329 - 1998
- [j2]Michael Segal, Klara Kedem:
Geometric applications of posets. Comput. Geom. 11(3-4): 143-156 (1998) - [j1]Michael Segal, Klara Kedem:
Enclosing k Points in the Smallest Axis Parallel Rectangle. Inf. Process. Lett. 65(2): 95-99 (1998) - [c5]Matthew J. Katz, Klara Kedem, Michael Segal:
Constrained Square-Center Problems. SWAT 1998: 95-106 - 1997
- [c4]Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes. CCCG 1997 - [c3]Michael Segal:
On Piercing Sets of Axis-Parallel Rectangles and Rings. ESA 1997: 430-442 - [c2]Michael Segal, Klara Kedem:
Geometric Applications Of Posets. WADS 1997: 402-415 - 1996
- [c1]Michael Segal, Klara Kedem:
Enclosing K Points in the Smallest Axis Parallel Rectangle. CCCG 1996: 20-25
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
