Constrained Square-Center Problems. - Matthew J. Katz; Klara Kedem; Michael Segal 001 (SWAT, 1998)

Geometric applications of posets. - Michael Segal 001; Klara Kedem (Comput. Geom., 1998)

Enclosing k Points in the Smallest Axis Parallel Rectangle. - Michael Segal 001; Klara Kedem (Inf. Process. Lett., 1998)

Optimal Facility Location under Various Distance Functions. - Sergei Bespamyatnikh; Klara Kedem; Michael Segal 001 (WADS, 1999)

Rectilinear Static and Dynamic Discrete 2-center Problems. - Sergei Bespamyatnikh; Michael Segal 001 (WADS, 1999)

On Piercing Sets of Axis-Parallel Rectangles and Rings. - Michael Segal 001 (Int. J. Comput. Geom. Appl., 1999)

Mobile facility location. - Sergei Bespamyatnikh; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (DIAL-M, 2000)

Shooter Location through Piercing Sets. - Matthew J. Katz; Frank Nielsen; Michael Segal 001 (EuroCG, 2000)

Maintenance of a Percing Set for Intervals with Applications. - Matthew J. Katz; Frank Nielsen; Michael Segal 001 (ISAAC, 2000)

Discrete rectilinear 2-center problems. - Matthew J. Katz; Klara Kedem; Michael Segal 001 (Comput. Geom., 2000)

Obnoxious Facility Location: Complete Service with Minimal Harm. - Boaz Ben-Moshe; Matthew J. Katz; Michael Segal 001 (Int. J. Comput. Geom. Appl., 2000)

Optimal Facility Location Under Various Distance Functions. - Sergei Bespamyatnikh; Klara Kedem; Michael Segal 001; Arie Tamir (Int. J. Comput. Geom. Appl., 2000)

Covering a set of points by two axis-parallel boxes. - Sergei Bespamyatnikh; Michael Segal 001 (Inf. Process. Lett., 2000)

Enumerating longest increasing subsequences and patience sorting. - Sergei Bespamyatnikh; Michael Segal 001 (Inf. Process. Lett., 2000)

Characterization of EM downhole-to-surface communication links. - Fred N. Trofimenkoff; Michael Segal 001; Allan Klassen; James W. Haslett (IEEE Trans. Geosci. Remote. Sens., 2000)

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

Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System. - Ofer Hadar; Michael Segal 001 (ITCC, 2001)

Lower and Upper Bounds for Tracking Mobile Users. - Sergei Bespamyatnikh; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (IFIP TCS, 2002)

Fast Algorithms for Approximating Distances. - Sergei Bespamyatnikh; Michael Segal 001 (Algorithmica, 2002)

Improved algorithms for placing undesirable facilities. - Matthew J. Katz; Klara Kedem; Michael Segal 001 (Comput. Oper. Res., 2002)

Lower Bounds for Covering Problems. - Michael Segal 001 (J. Math. Model. Algorithms, 2002)

Efficient algorithms for centers and medians in interval and circular-arc graphs. - Sergei Bespamyatnikh; Binay K. Bhattacharya; J. Mark Keil; David G. Kirkpatrick; Michael Segal 001 (Networks, 2002)

Approximating the geometric minimum-diameter spanning tree. - Michael J. Spriggs; J. Mark Keil; Sergei Bespamyatnikh; Michael Segal 001; Jack Snoeyink (CCCG, 2003)

Maintenance of a Piercing Set for Intervals with Applications. - Matthew J. Katz; Frank Nielsen; Michael Segal 001 (Algorithmica, 2003)

Placing an Obnoxious Facility in Geometric Networks. - Michael Segal 001 (Nord. J. Comput., 2003)

Improved Approximation Algorithms for Connected Sensor Cover. - Stefan Funke; Alexander Kesselman; Zvi Lotker; Michael Segal 001 (ADHOC-NOW, 2004)

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

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

Selecting distances in arrangements of hyperplanes spanned by points. - Sergei Bespamyatnikh; Michael Segal 001 (J. Discrete Algorithms, 2004)

Planar Maximum Box Problem. - Michael Segal 001 (J. Math. Model. Algorithms, 2004)

Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks. - Hai Huang 011; Andréa W. Richa; Michael Segal 001 (Mob. Networks Appl., 2004)

Dynamic Algorithms for Approximating Interdistances. - Sergey Bereg; Michael Segal 001 (Nord. J. Comput., 2004)

k-fault resistance in wireless ad-hoc networks. - Hanan Shpungin; Michael Segal 001 (DIALM-POMC, 2005)

Energy efficient connectivity in ad hoc networks from user's and designer's perspective. - Alexander Kesselman; Dariusz R. Kowalski; Michael Segal 001 (ICC, 2005)

Geographic Quorum System Approximations. - Paz Carmi; Shlomi Dolev; Sariel Har-Peled; Matthew J. Katz; Michael Segal 001 (Algorithmica, 2005)

Dynamic Coverage in Ad-Hoc Sensor Networks. - Hai Huang 011; Andréa W. Richa; Michael Segal 001 (Mob. Networks Appl., 2005)

Energy efficient communication in ad hoc networks from user's and designer's perspective. - Alexander Kesselman; Dariusz R. Kowalski; Michael Segal 001 (ACM SIGMOBILE Mob. Comput. Commun. Rev., 2005)

Automated antenna positioning for wireless networks. - Amit Dvir; Yehuda Ben-Shimol; Yoav Ben-Yehezkel; Michael Segal 001 (CCNC, 2006)

Competitive Algorithms for Maintaining a Mobile Center. - Sergey Bereg; Binay K. Bhattacharya; David G. Kirkpatrick; Michael Segal 001 (Mob. Networks Appl., 2006)

A simple improved distributed algorithm for minimum CDS in unit disk graphs. - Stefan Funke; Alexander Kesselman; Ulrich Meyer 001; Michael Segal 001 (ACM Trans. Sens. Networks, 2006)

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

Improved Lower Bounds for Data-Gathering Time in Sensor Networks. - Yoram Revah; Michael Segal 001 (ICNS, 2007)

Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks. - Amit Dvir; Michael Segal 001 (Networking, 2007)

Fault-Tolerant Power Assignment and Backbone in Wireless Networks. - Paz Carmi; Matthew J. Katz; Michael Segal 001; Hanan Shpungin (Ad Hoc Sens. Wirel. Networks, 2007)

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

Interworking between MANET and satellite systems for emergency applications. - Michele Luglio; Cristiano Monti; Cesare Roseti; Antonio Saitto; Michael Segal 001 (Int. J. Satell. Commun. Netw., 2007)

Improved approximation algorithms for connected sensor cover. - Stefan Funke; Alexander Kesselman; Fabian Kuhn; Zvi Lotker; Michael Segal 001 (Wirel. Networks, 2007)

Measurement and control of exciton spin in organic light emitting devices. - Michael Segal 001 (2007)

Power efficient resilience and lifetime in wireless ad-hoc networks. - Daniel Berend; Michael Segal 001; Hanan Shpungin (FOWANC, 2008)

The (k, l) Coredian Tree for Ad Hoc Networks. - Amit Dvir; Michael Segal 001 (Ad Hoc Sens. Wirel. Networks, 2008)

Improved bounds for data-gathering time in sensor networks. - Yoram Revah; Michael Segal 001 (Comput. Commun., 2008)

Fast algorithm for multicast and data gathering in wireless networks. - Michael Segal 001 (Inf. Process. Lett., 2008)

EPCRTT-based smoothing and multiplexing of VBR video traffic. - Ofer Hadar; Shlomo Greenberg; Michael Segal 001 (Multim. Tools Appl., 2008)

Computing closest and farthest points for a query segment. - Michael Segal 001; Eli Zeitlin (Theor. Comput. Sci., 2008)

Deaf, Dumb, and Chatting Asynchronous Robots. - Yoann Dieudonné; Shlomi Dolev; Franck Petit; Michael Segal 001 (OPODIS, 2009)

Brief announcement: deaf, dumb, and chatting robots. - Yoann Dieudonné; Shlomi Dolev; Franck Petit; Michael Segal 001 (PODC, 2009)

On construction of minimum energy k-fault resistant topologies. - Michael Segal 001; Hanan Shpungin (Ad Hoc Networks, 2009)

Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot - Yoann Dieudonné; Shlomi Dolev; Franck Petit; Michael Segal 001 (CoRR, 2009)

Low complexity algorithms for optimal consumer push-pull partial covering in the plane. - Shimon Abravaya; Michael Segal 001 (Eur. J. Oper. Res., 2009)

Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies. - Yoram Revah; Michael Segal 001 (Int. J. Distributed Sens. Networks, 2009)

Improving lifetime of wireless sensor networks. - Michael Segal 001 (Netw. Protoc. Algorithms, 2009)

Low-energy fault-tolerant bounded-hop broadcast in wireless networks. - Hanan Shpungin; Michael Segal 001 (IEEE/ACM Trans. Netw., 2009)

Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics. - Michael Segal 001; Hanan Shpungin (INFOCOM, 2010)

Centdian Computation for Sensor Networks. - Boaz Ben-Moshe; Amit Dvir; Michael Segal 001; Arie Tamir (TAMC, 2010)

Bounded-hop strong connectivity for flocking swarms. - Shlomi Dolev; Michael Segal 001; Hanan Shpungin (WiOpt, 2010)

Optimizing performance of ad-hoc networks under energy and scheduling constraints. - Liron Levin; Michael Segal 001; Hanan Shpungin (WiOpt, 2010)

Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. - Daniel Berend; Michael Segal 001; Hanan Shpungin (Ad Hoc Sens. Wirel. Networks, 2010)

Maximizing the number of obnoxious facilities to locate within a bounded region. - Shimon Abravaya; Michael Segal 001 (Comput. Oper. Res., 2010)

Real-time data gathering in sensor networks. - Yoram Revah; Michael Segal 001; Liron Yedidsion (Discret. Appl. Math., 2010)

Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. - Alexander Kesselman; Kirill Kogan; Michael Segal 001 (Distributed Comput., 2010)

Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks. - Hanan Shpungin; Michael Segal 001 (IEEE/ACM Trans. Netw., 2010)

Placing and maintaining a core node in wirelessad hoc networks. - Amit Dvir; Michael Segal 001 (Wirel. Commun. Mob. Comput., 2010)

On minimizing the total power of k-strongly connected wireless networks. - Hanan Shpungin; Michael Segal 001 (Wirel. Networks, 2010)

The euclidean bottleneck steiner path problem. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Michael Segal 001 (SCG, 2011)

Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks. - Liron Levin; Michael Segal 001; Hanan Shpungin (FOMC, 2011)

Near-optimal, reliable and self-organizing hierarchical topology in VANET. - Yair Allouche; Michael Segal 001 (Vehicular Ad Hoc Networks, 2011)

On Bounded Leg Shortest Paths Problems. - Liam Roditty; Michael Segal 001 (Algorithmica, 2011)

Novel algorithms for the network lifetime problem in wireless settings. - Michael Elkin; Yuval Lando; Zeev Nutov; Michael Segal 001; Hanan Shpungin (Wirel. Networks, 2011)

VANET in eyes of hierarchical topology. - Yair Allouche; Michael Segal 001 (FOMC, 2012)

Scheduling of Vehicles in Transportation Networks. - Dariusz R. Kowalski; Zeev Nutov; Michael Segal 001 (Nets4Cars/Nets4Trains, 2012)

Improved Competitive Performance Bounds for CIOQ Switches. - Alexander Kesselman; Kirill Kogan; Michael Segal 001 (Algorithmica, 2012)

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

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

Centdian Computation in Cactus Graphs. - Boaz Ben-Moshe; Amit Dvir; Michael Segal 001; Arie Tamir (J. Graph Algorithms Appl., 2012)

Improved approximation algorithms for maximum lifetime problems in wireless networks. - Zeev Nutov; Michael Segal 001 (Theor. Comput. Sci., 2012)

Providing performance guarantees in multipass network processors. - Isaac Keslassy; Kirill Kogan; Gabriel Scalosub; Michael Segal 001 (IEEE/ACM Trans. Netw., 2012)

The delta-betweenness centrality. - Alexander Plutov; Michael Segal 001 (PIMRC, 2013)

Certificating Vehicle Public Key with Vehicle Attributes A (periodical) Licensing Routine, Against Man-in-the-Middle Attacks and Beyond. - Shlomi Dolev; Lukasz Krzywiecki; Nisha Panwar; Michael Segal 001 (ASCoMS@SAFECOMP, 2013)

Location, location, location: Using central nodes for efficient data collection in WSNs. - Vitaly Milyeykovski; Michael Segal 001; Hanan Shpungin (WiOpt, 2013)

Interference-free energy efficient scheduling in wireless ad hoc networks. - Liron Levin; Michael Segal 001; Hanan Shpungin (Ad Hoc Networks, 2013)

Space and speed tradeoffs in TCAM hierarchical packet classification. - Alexander Kesselman; Kirill Kogan; Sergey Nemzer; Michael Segal 001 (J. Comput. Syst. Sci., 2013)

A Cluster-Based Beaconing Approach in VANETs: Near Optimal Topology Via Proximity Information. - Yair Allouche; Michael Segal 001 (Mob. Networks Appl., 2013)

Bounded-Hop Energy-Efficient Liveness of Flocking Swarms. - Shlomi Dolev; Michael Segal 001; Hanan Shpungin (IEEE Trans. Mob. Comput., 2013)

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics. - Hanan Shpungin; Michael Segal 001 (ACM Trans. Sens. Networks, 2013)

Cooperative data collection in ad hoc networks. - Liron Levin; Michael Segal 001; Hanan Shpungin (Wirel. Networks, 2013)

Integrating a Diagnostic Decision Support Tool into an Electronic Health Record and Relevant Clinical Workflows through Standards-Based Exchange. - Nathan C. Hulse; Grant M. Wood; Siew Lam; Michael Segal 001 (AMIA, 2014)

Balancing work and size with bounded buffers. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Gabriel Scalosub; Michael Segal 001 (COMSNETS, 2014)

Improved structures for data collection in wireless sensor networks. - Jon Crowcroft; Michael Segal 001; Liron Levin (INFOCOM, 2014)

Direction election in flocking swarms. - Ohad Ben-Shahar; Shlomi Dolev; Andrey Dolgin; Michael Segal 001 (Ad Hoc Networks, 2014)

Collecting data in ad-hoc networks with reduced uncertainty. - Liron Levin; Alon Efrat; Michael Segal 001 (Ad Hoc Networks, 2014)

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition. - A. Karim Abu-Affash; Paz Carmi; Matthew J. Katz; Michael Segal 001 (Discret. Comput. Geom., 2014)

Optimization Schemes for Protective Jamming. - Swaminathan Sankararaman; A. Karim Abu-Affash; Alon Efrat; Sylvester David Eriksson-Bique; Valentin Polishchuk; Srinivasan Ramasubramanian; Michael Segal 001 (Mob. Networks Appl., 2014)

Scheduling problems in transportation networks of line topology. - Dariusz R. Kowalski; Eyal Nussbaum; Michael Segal 001; Vitaly Milyeykovski (Optim. Lett., 2014)

Optimal placement of protective jammers for securing wireless transmissions in a geographic domain. - Esther M. Arkin; Yuval Cassuto; Alon Efrat; Guy Grebla; Joseph S. B. Mitchell; Swaminathan Sankararaman; Michael Segal 001 (IPSN, 2015)

Using data mules for sensor network resiliency. - Jon Crowcroft; Liron Levin; Michael Segal 001 (WiOpt, 2015)

Using central nodes for efficient data collection in wireless sensor networks. - Vitaly Milyeykovski; Michael Segal 001; Vladimir Katz (Comput. Networks, 2015)

Vehicle to Vehicle Authentication. - Shlomi Dolev; Lukasz Krzywiecki; Nisha Panwar; Michael Segal 001 (CoRR, 2015)

Improved structures for data collection in static and mobile wireless sensor networks. - Jon Crowcroft; Michael Segal 001; Liron Levin (J. Heuristics, 2015)

Message and time efficient multi-broadcast schemes. - Liron Levin; Dariusz R. Kowalski; Michael Segal 001 (Theor. Comput. Sci., 2015)

Reducing Interferences in VANETs. - Dmitry Zelikman; Michael Segal 001 (IEEE Trans. Intell. Transp. Syst., 2015)

Cluster-Based Beaconing Process for VANET. - Yair Allouche; Michael Segal 001 (Veh. Commun., 2015)

Visualizing Museum Visitors' Behavior. - Joel Lanir; Tsvi Kuflik; Nisan Yavin; Kate Leiderman; Michael Segal 001 (AVI*CH, 2016)

Location always matters: how to improve performance of dynamic networks? - Michael Segal 001 (FedCSIS, 2016)

Confining Wi-Fi Coverage: A Crowdsourced Method Using Physical Layer Information. - Bingxian Lu; Zhicheng Zeng; Lei Wang 005; Brian Peck; Daji Qiao; Michael Segal 001 (SECON, 2016)

Using data mules for sensor network data recovery. - Jon Crowcroft; Liron Levin; Michael Segal 001 (Ad Hoc Networks, 2016)

Optical PUF for Non-Forwardable Vehicle Authentication. - Shlomi Dolev; Lukasz Krzywiecki; Nisha Panwar; Michael Segal 001 (Comput. Commun., 2016)

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors. - Kirill Kogan; Alejandro López-Ortiz; Sergey I. Nikolenko; Gabriel Scalosub; Michael Segal 001 (J. Netw. Comput. Appl., 2016)

Vehicle authentication via monolithically certified public key and attributes. - Shlomi Dolev; Lukasz Krzywiecki; Nisha Panwar; Michael Segal 001 (Wirel. Networks, 2016)

Coordination of Mobile Mules via Facility Location Strategies. - Danny Hermelin; Michael Segal 001; Harel Yedidsion (PAAMS, 2017)

Efficient data retrieval in faulty sensor networks using a mobile mule. - Harel Yedidsion; Aritra Banik; Paz Carmi; Matthew J. Katz; Michael Segal 001 (WiOpt, 2017)

Secure communication through jammers jointly optimized in geography and time. - Yair Allouche; Esther M. Arkin; Yuval Cassuto; Alon Efrat; Guy Grebla; Joseph S. B. Mitchell; Swaminathan Sankararaman; Michael Segal 001 (Pervasive Mob. Comput., 2017)

Visualizing museum visitors' behavior: Where do they go and what do they do there? - Joel Lanir; Tsvi Kuflik; Julia Sheidin; Nisan Yavin; Kate Leiderman; Michael Segal 001 (Pers. Ubiquitous Comput., 2017)

Dynamic attribute based vehicle authentication. - Shlomi Dolev; Lukasz Krzywiecki; Nisha Panwar; Michael Segal 001 (Wirel. Networks, 2017)

Privacy Aspects in Data Querying. - Michael Segal 001 (COCOON, 2018)

Journal of Computer and System Science: 50 years of celebration. In memory of Professor Edward Blum. - Michael Segal 001 (J. Comput. Syst. Sci., 2018)

Skiplist Timing Attack Vulnerability. - Eyal Nussbaum; Michael Segal 001 (DPM/CBT@ESORICS, 2019)

Approximate String Matching for DNS Anomaly Detection. - Roni Mateless; Michael Segal 001 (SpaCCS, 2019)

Privacy Vulnerabilities of Dataset Anonymization Techniques. - Eyal Nussbaum; Michael Segal 001 (CoRR, 2019)

Construction and Maintenance of Swarm Drones. - Kiril Danilchenko; Michael Segal 001 (CoRR, 2019)

Locating battery charging stations to facilitate almost shortest paths. - Esther M. Arkin; Paz Carmi; Matthew J. Katz; Joseph S. B. Mitchell; Michael Segal 001 (Discret. Appl. Math., 2019)

Throttling positive semidefinite zero forcing propagation time on graphs. - Joshua Carlson; Leslie Hogben; Jürgen Kritschgau; Kate J. Lorenzen; Michael Segal 001; Seth Selken; Vicente Valle Martinez (Discret. Appl. Math., 2019)

Explicit Communication Among Stigmergic Robots. - Yoann Dieudonné; Shlomi Dolev; Franck Petit; Michael Segal 001 (Int. J. Found. Comput. Sci., 2019)

Breaching the privacy of connected vehicles network. - Vladimir Kaplun; Michael Segal 001 (Telecommun. Syst., 2019)

Covering Users by a Connected Swarm Efficiently. - Kiril Danilchenko; Michael Segal 001; Zeev Nutov (ALGOSENSORS, 2020)

Connected Ad-Hoc swarm of drones. - Kiril Danilchenko; Michael Segal 001 (DroNet@MobiSys, 2020)

Anomaly Detection in CAN-BUS Using Pattern Matching Algorithm. - Ilia Odeski; Michael Segal 001 (SSCC, 2020)

Finding Geometric Medians with Location Privacy. - Eyal Nussbaum; Michael Segal 001 (TrustCom, 2020)

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule. - Harel Yedidsion; Stav Ashur; Aritra Banik; Paz Carmi; Matthew J. Katz; Michael Segal 001 (Algorithmica, 2020)

Improved Solution to Data Gathering with Mobile Mule. - Yoad Zur; Michael Segal 001 (Algorithmica, 2020)

Privacy Vulnerability of NeNDS Collaborative Filtering. - Eyal Nussbaum; Michael Segal 001 (CSCML, 2021)

Improved Routing in Networks through Load Prediction Strategy. - Ron Posti; Michael Segal 001 (DRCN, 2021)

An Efficient Connected Swarm Deployment via Deep Learning. - Kiril Danilchenko; Michael Segal 001 (FedCSIS, 2021)

Advanced Routing Algorithms for Low Orbit Satellite Constellations. - Oren Markovitz; Michael Segal 001 (ICC, 2021)

Poster: Network Performance Upgrade by Cut Spanners. - Guy Rozenberg; Michael Segal 001 (Networking, 2021)

Seam-Aware Location-Based Random Walk Routing Algorithms for Low Orbit Satellite Constellations. - Oren Markovitz; Michael Segal 001 (WiMob, 2021)

Collective multi agent deployment for wireless sensor network maintenance. - Harel Yedidsion; Danny Hermelin; Michael Segal 001 (Eng. Appl. Artif. Intell., 2021)

THAAD: Efficient matching queries under temporal abstraction for anomaly detection. - Roni Mateless; Michael Segal 001; Robert Moskovitch (Perform. Evaluation, 2021)

Avoiding bottlenecks in networks by short paths. - Chen Levi; Michael Segal 001 (Telecommun. Syst., 2021)

IPvest: Clustering the IP Traffic of Network Entities Hidden Behind a Single IP Address Using Machine Learning. - Roni Mateless; Haim Zlatokrilov; Liran Orevi; Michael Segal 001; Robert Moskovitch (IEEE Trans. Netw. Serv. Manag., 2021)

Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms. - Kiril Danilchenko; Michael Segal 001; Dan Vilenchik (ICWSM, 2022)

TDMA Frame Length Minimization by Deep Learning for Swarm Communication. - Kiril Danilchenko; Michael Segal 001 (IWCMC, 2022)

Distributed LEO Satellite Virtual Swarm. - Oren Markovitz; Michael Segal 001 (IWCMC, 2022)

LEO satellite beam management algorithms. - Oren Markovitz; Michael Segal 001 (Comput. Networks, 2022)

Asymmetric Differential Routing for low orbit satellite constellations. - Oren Markovitz; Michael Segal 001 (Comput. Commun., 2022)

Finding bounded diameter minimum spanning tree in general graphs. - Michael Segal 001; Oren Tzfaty (Comput. Oper. Res., 2022)

3-D-SIS: A 3-D-Social Identifier Structure for Collaborative Edge Computing Based Social IoT. - Muhammad Ibrar; Lei Wang 005; Aamir Akbar; Mian Ahmad Jan; Nadir Shah; Shahbaz Akhtar Abid; Michael Segal 001 (IEEE Trans. Comput. Soc. Syst., 2022)

Privacy Analysis of Query-Set-Size Control. - Eyal Nussbaum; Michael Segal 001 (ACM Trans. Priv. Secur., 2022)

Online Learning Framework for Radio Link Failure Prediction in FANETs. - Kiril Danilchenko; Nir Lazmi; Michael Segal 001 (FedCSIS, 2023)

Link2speed: VANET speed assessment via link-state analysis. - Alon Freund; Rami Puzis; Michael Segal 001 (WCNC, 2023)

Reinforcement Learning Based Routing For Deadline-Driven Wireless Communication. - Kiril Danilchenko; Gil Kedar; Michael Segal 001 (WiMob, 2023)

Doing their best: How to provide service by limited number of drones? - Kiril Danilchenko; Zeev Nutov; Michael Segal 001 (Wirel. Networks, 2023)

Demand Island Routing for LEO satellite constellations. - Oren Markovitz; Michael Segal 001 (Comput. Networks, 2023)

Finding Geometric Facilities with Location Privacy. - Eyal Nussbaum; Michael Segal 001; Oles Holembovskyy (Algorithmica, 2023)

Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments. - Kiril Danilchenko; Zeev Nutov; Michael Segal 001 (IEEE/ACM Trans. Netw., 2023)

Provable Imbalanced Point Clustering. - David Denisov; Dan Feldman; Shlomi Dolev; Michael Segal 001 (CSCML, 2024)

Covert Communication by Exploiting Error-Correcting Codes. - Alon Marzin; Moshe Schwartz 001; Michael Segal 001 (DRCN, 2024)

Byzantine Resilient Waves Interference-based Visual Encryption Scheme. - Shlomi Dolev; Alexander Fok; Michael Segal 001 (NCA, 2024)

Covert Channels Data. - Alon Marzin; Moshe Schwartz 001; Michael Segal 001 (IEEE DataPort, 2024)

Covert channel by exploiting error-correcting codes. - Alon Marzin; Moshe Schwartz 001; Michael Segal 001 (Comput. Networks, 2025)

Using spanners to improve network performance. - Guy Rozenberg; Michael Segal 001 (Comput. Networks, 2025)

Swarming with (visual) secret (shared) mission. - Shlomi Dolev; Alexander Fok; Michael Segal 001 (Wirel. Networks, 2025)

Finding Minimum Cost Data Collection Tree with Aggregation. - Ihor Rusnak; Michael Segal 001 (J. Optim. Theory Appl., 2025)