Michael Segal

Orcid: 0000-0001-7606-6522

Affiliations:
  • Ben-Gurion University, Beersheba, Israel


According to our database1, Michael Segal authored at least 165 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Covering Users With QoS by a Connected Swarm of Drones: Graph Theoretical Approach and Experiments.
IEEE/ACM Trans. Netw., December, 2023

Finding Geometric Facilities with Location Privacy.
Algorithmica, December, 2023

Demand Island Routing for LEO satellite constellations.
Comput. Networks, April, 2023

Doing their best: How to provide service by limited number of drones?
Wirel. Networks, 2023

Reinforcement Learning Based Routing For Deadline-Driven Wireless Communication.
Proceedings of the 19th International Conference on Wireless and Mobile Computing, 2023

Link2speed: VANET speed assessment via link-state analysis.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2023

Online Learning Framework for Radio Link Failure Prediction in FANETs.
Proceedings of the 18th Conference on Computer Science and Intelligence Systems, 2023

2022
Privacy Analysis of Query-Set-Size Control.
ACM Trans. Priv. Secur., 2022

3-D-SIS: A 3-D-Social Identifier Structure for Collaborative Edge Computing Based Social IoT.
IEEE Trans. Comput. Soc. Syst., 2022

Finding bounded diameter minimum spanning tree in general graphs.
Comput. Oper. Res., 2022

Asymmetric Differential Routing for low orbit satellite constellations.
Comput. Commun., 2022

LEO satellite beam management algorithms.
Comput. Networks, 2022

Swarming with (Visual) Secret (Shared) Mission.
Proceedings of the 21st IEEE International Symposium on Network Computing and Applications, 2022

Distributed LEO Satellite Virtual Swarm.
Proceedings of the 2022 International Wireless Communications and Mobile Computing, 2022

TDMA Frame Length Minimization by Deep Learning for Swarm Communication.
Proceedings of the 2022 International Wireless Communications and Mobile Computing, 2022

Opinion Spam Detection: A New Approach Using Machine Learning and Network-Based Algorithms.
Proceedings of the Sixteenth International AAAI Conference on Web and Social Media, 2022

2021
IPvest: Clustering the IP Traffic of Network Entities Hidden Behind a Single IP Address Using Machine Learning.
IEEE Trans. Netw. Serv. Manag., 2021

Avoiding bottlenecks in networks by short paths.
Telecommun. Syst., 2021

THAAD: Efficient matching queries under temporal abstraction for anomaly detection.
Perform. Evaluation, 2021

Collective multi agent deployment for wireless sensor network maintenance.
Eng. Appl. Artif. Intell., 2021

Seam-Aware Location-Based Random Walk Routing Algorithms for Low Orbit Satellite Constellations.
Proceedings of the 17th International Conference on Wireless and Mobile Computing, 2021

Poster: Network Performance Upgrade by Cut Spanners.
Proceedings of the IFIP Networking Conference, 2021

Advanced Routing Algorithms for Low Orbit Satellite Constellations.
Proceedings of the ICC 2021, 2021

An Efficient Connected Swarm Deployment via Deep Learning.
Proceedings of the 16th Conference on Computer Science and Intelligence Systems, 2021

Improved Routing in Networks through Load Prediction Strategy.
Proceedings of the 17th International Conference on the Design of Reliable Communication Networks, 2021

Privacy Vulnerability of NeNDS Collaborative Filtering.
Proceedings of the Cyber Security Cryptography and Machine Learning, 2021

2020
Improved Solution to Data Gathering with Mobile Mule.
Algorithmica, 2020

Sensor Network Topology Design and Analysis for Efficient Data Gathering by a Mobile Mule.
Algorithmica, 2020

Finding Geometric Medians with Location Privacy.
Proceedings of the 19th IEEE International Conference on Trust, 2020

Anomaly Detection in CAN-BUS Using Pattern Matching Algorithm.
Proceedings of the Security in Computing and Communications - 8th International Symposium, 2020

Connected Ad-Hoc swarm of drones.
Proceedings of the DroNet@MobiSys 2020: Proceedings of the 6th ACM Workshop on Micro Aerial Vehicle Networks, 2020

Covering Users by a Connected Swarm Efficiently.
Proceedings of the Algorithms for Sensor Systems, 2020

2019
Breaching the privacy of connected vehicles network.
Telecommun. Syst., 2019

Explicit Communication Among Stigmergic Robots.
Int. J. Found. Comput. Sci., 2019

Throttling positive semidefinite zero forcing propagation time on graphs.
Discret. Appl. Math., 2019

Locating battery charging stations to facilitate almost shortest paths.
Discret. Appl. Math., 2019

Construction and Maintenance of Swarm Drones.
CoRR, 2019

Privacy Vulnerabilities of Dataset Anonymization Techniques.
CoRR, 2019

Approximate String Matching for DNS Anomaly Detection.
Proceedings of the Security, Privacy, and Anonymity in Computation, Communication, and Storage, 2019

Skiplist Timing Attack Vulnerability.
Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2019

2018
Journal of Computer and System Science: 50 years of celebration. In memory of Professor Edward Blum.
J. Comput. Syst. Sci., 2018

Privacy Aspects in Data Querying.
Proceedings of the Computing and Combinatorics - 24th International Conference, 2018

2017
Dynamic attribute based vehicle authentication.
Wirel. Networks, 2017

Visualizing museum visitors' behavior: Where do they go and what do they do there?
Pers. Ubiquitous Comput., 2017

Secure communication through jammers jointly optimized in geography and time.
Pervasive Mob. Comput., 2017

Efficient data retrieval in faulty sensor networks using a mobile mule.
Proceedings of the 15th International Symposium on Modeling and Optimization in Mobile, 2017

Coordination of Mobile Mules via Facility Location Strategies.
Proceedings of the Advances in Practical Applications of Cyber-Physical Multi-Agent Systems: The PAAMS Collection, 2017

2016
Vehicle authentication via monolithically certified public key and attributes.
Wirel. Networks, 2016

Large profits or fast gains: A dilemma in maximizing throughput with applications to network processors.
J. Netw. Comput. Appl., 2016

Optical PUF for Non-Forwardable Vehicle Authentication.
Comput. Commun., 2016

Using data mules for sensor network data recovery.
Ad Hoc Networks, 2016

Confining Wi-Fi Coverage: A Crowdsourced Method Using Physical Layer Information.
Proceedings of the 13th Annual IEEE International Conference on Sensing, 2016

Location always matters: how to improve performance of dynamic networks?
Proceedings of the 2016 Federated Conference on Computer Science and Information Systems, 2016

Visualizing Museum Visitors' Behavior.
Proceedings of the 1st Workshop on Advanced Visual Interfaces for Cultural Heritage co-located with the International Working Conference on Advanced Visual Interfaces (AVI 2016), 2016

2015
Cluster-Based Beaconing Process for VANET.
Veh. Commun., 2015

Reducing Interferences in VANETs.
IEEE Trans. Intell. Transp. Syst., 2015

Message and time efficient multi-broadcast schemes.
Theor. Comput. Sci., 2015

Improved structures for data collection in static and mobile wireless sensor networks.
J. Heuristics, 2015

Vehicle to Vehicle Authentication.
CoRR, 2015

Using central nodes for efficient data collection in wireless sensor networks.
Comput. Networks, 2015

Using data mules for sensor network resiliency.
Proceedings of the 13th International Symposium on Modeling and Optimization in Mobile, 2015

Optimal placement of protective jammers for securing wireless transmissions in a geographic domain.
Proceedings of the 14th International Conference on Information Processing in Sensor Networks, 2015

2014
Scheduling problems in transportation networks of line topology.
Optim. Lett., 2014

Optimization Schemes for Protective Jamming.
Mob. Networks Appl., 2014

The Euclidean Bottleneck Steiner Path Problem and Other Applications of (α, β)-Pair Decomposition.
Discret. Comput. Geom., 2014

Collecting data in ad-hoc networks with reduced uncertainty.
Ad Hoc Networks, 2014

Direction election in flocking swarms.
Ad Hoc Networks, 2014

Improved structures for data collection in wireless sensor networks.
Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Balancing work and size with bounded buffers.
Proceedings of the Sixth International Conference on Communication Systems and Networks, 2014

Integrating a Diagnostic Decision Support Tool into an Electronic Health Record and Relevant Clinical Workflows through Standards-Based Exchange.
Proceedings of the AMIA 2014, 2014

2013
Cooperative data collection in ad hoc networks.
Wirel. Networks, 2013

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics.
ACM Trans. Sens. Networks, 2013

Bounded-Hop Energy-Efficient Liveness of Flocking Swarms.
IEEE Trans. Mob. Comput., 2013

A Cluster-Based Beaconing Approach in VANETs: Near Optimal Topology Via Proximity Information.
Mob. Networks Appl., 2013

Space and speed tradeoffs in TCAM hierarchical packet classification.
J. Comput. Syst. Sci., 2013

Interference-free energy efficient scheduling in wireless ad hoc networks.
Ad Hoc Networks, 2013

Location, location, location: Using central nodes for efficient data collection in WSNs.
Proceedings of the 11th International Symposium and Workshops on Modeling and Optimization in Mobile, 2013

Certificating Vehicle Public Key with Vehicle Attributes A (periodical) Licensing Routine, Against Man-in-the-Middle Attacks and Beyond.
Proceedings of the SAFECOMP 2013, 2013

The delta-betweenness centrality.
Proceedings of the 24th IEEE Annual International Symposium on Personal, 2013

2012
Providing performance guarantees in multipass network processors.
IEEE/ACM Trans. Netw., 2012

Improved approximation algorithms for maximum lifetime problems in wireless networks.
Theor. Comput. Sci., 2012

Centdian Computation in Cactus Graphs.
J. Graph Algorithms Appl., 2012

Large Profits or Fast Gains: A Dilemma in Maximizing Throughput with Applications to Network Processors
CoRR, 2012

Best Effort and Priority Queuing Policies for Buffered Crossbar Switches.
Chic. J. Theor. Comput. Sci., 2012

Improved Competitive Performance Bounds for CIOQ Switches.
Algorithmica, 2012

Scheduling of Vehicles in Transportation Networks.
Proceedings of the Communication Technologies for Vehicles - 4th International Workshop, 2012

VANET in eyes of hierarchical topology.
Proceedings of the FOMC'12, 2012

2011
Novel algorithms for the network lifetime problem in wireless settings.
Wirel. Networks, 2011

On Bounded Leg Shortest Paths Problems.
Algorithmica, 2011

Near-optimal, reliable and self-organizing hierarchical topology in VANET.
Proceedings of the Eighth International Workshop on Vehicular Ad Hoc Networks, 2011

Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks.
Proceedings of the FOMC'11, 2011

The euclidean bottleneck steiner path problem.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010
On minimizing the total power of <i>k</i>-strongly connected wireless networks.
Wirel. Networks, 2010

Placing and maintaining a core node in wireless<i>ad hoc</i> networks.
Wirel. Commun. Mob. Comput., 2010

Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks.
IEEE/ACM Trans. Netw., 2010

Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing.
Distributed Comput., 2010

Real-time data gathering in sensor networks.
Discret. Appl. Math., 2010

Maximizing the number of obnoxious facilities to locate within a bounded region.
Comput. Oper. Res., 2010

Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks.
Ad Hoc Sens. Wirel. Networks, 2010

Optimizing performance of ad-hoc networks under energy and scheduling constraints.
Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010

Bounded-hop strong connectivity for flocking swarms.
Proceedings of the 8th International Symposium on Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks (WiOpt 2010), May 31, 2010

Centdian Computation for Sensor Networks.
Proceedings of the Theory and Applications of Models of Computation, 7th Annual Conference, 2010

Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Low-energy fault-tolerant bounded-hop broadcast in wireless networks.
IEEE/ACM Trans. Netw., 2009

Improving lifetime of wireless sensor networks.
Netw. Protoc. Algorithms, 2009

Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies.
Int. J. Distributed Sens. Networks, 2009

Low complexity algorithms for optimal consumer push-pull partial covering in the plane.
Eur. J. Oper. Res., 2009

Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot
CoRR, 2009

On construction of minimum energy k-fault resistant topologies.
Ad Hoc Networks, 2009

Brief announcement: deaf, dumb, and chatting robots.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Deaf, Dumb, and Chatting Asynchronous Robots.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
Computing closest and farthest points for a query segment.
Theor. Comput. Sci., 2008

EPCRTT-based smoothing and multiplexing of VBR video traffic.
Multim. Tools Appl., 2008

Fast algorithm for multicast and data gathering in wireless networks.
Inf. Process. Lett., 2008

Improved bounds for data-gathering time in sensor networks.
Comput. Commun., 2008

The (k, l) Coredian Tree for Ad Hoc Networks.
Ad Hoc Sens. Wirel. Networks, 2008

Power efficient resilience and lifetime in wireless ad-hoc networks.
Proceedings of the 1st ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing, 2008

2007
Measurement and control of exciton spin in organic light emitting devices.
PhD thesis, 2007

Improved approximation algorithms for connected sensor cover.
Wirel. Networks, 2007

Interworking between MANET and satellite systems for emergency applications.
Int. J. Satell. Commun. Netw., 2007

Automated antenna positioning algorithms for wireless fixed-access networks.
J. Heuristics, 2007

Fault-Tolerant Power Assignment and Backbone in Wireless Networks.
Ad Hoc Sens. Wirel. Networks, 2007

Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks.
Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Improved Lower Bounds for Data-Gathering Time in Sensor Networks.
Proceedings of the Third International Conference on Networking and Services (ICNS 2007), 2007

Low Energy Construction of Fault Tolerant Topologies in Wireless Networks.
Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007

2006
A simple improved distributed algorithm for minimum CDS in unit disk graphs.
ACM Trans. Sens. Networks, 2006

Competitive Algorithms for Maintaining a Mobile Center.
Mob. Networks Appl., 2006

Automated antenna positioning for wireless networks.
Proceedings of the 3rd IEEE Consumer Communications and Networking Conference, 2006

2005
Energy efficient communication in ad hoc networks from user's and designer's perspective.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2005

Dynamic Coverage in Ad-Hoc Sensor Networks.
Mob. Networks Appl., 2005

Geographic Quorum System Approximations.
Algorithmica, 2005

Energy efficient connectivity in ad hoc networks from user's and designer's perspective.
Proceedings of IEEE International Conference on Communications, 2005

<i>k</i>-fault resistance in wireless ad-hoc networks.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

2004
Dynamic Algorithms for Approximating Interdistances.
Nord. J. Comput., 2004

Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks.
Mob. Networks Appl., 2004

Planar Maximum Box Problem.
J. Math. Model. Algorithms, 2004

Selecting distances in arrangements of hyperplanes spanned by points.
J. Discrete Algorithms, 2004

Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
Algorithmica, 2004

SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks.
Proceedings of the IEEE 15th International Symposium on Personal, 2004

Improved Approximation Algorithms for Connected Sensor Cover.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003
Placing an Obnoxious Facility in Geometric Networks.
Nord. J. Comput., 2003

Maintenance of a Piercing Set for Intervals with Applications.
Algorithmica, 2003

Approximating the geometric minimum-diameter spanning tree.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Efficient algorithms for centers and medians in interval and circular-arc graphs.
Networks, 2002

Lower Bounds for Covering Problems.
J. Math. Model. Algorithms, 2002

Improved algorithms for placing undesirable facilities.
Comput. Oper. Res., 2002

Fast Algorithms for Approximating Distances.
Algorithmica, 2002

Lower and Upper Bounds for Tracking Mobile Users.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System.
Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

Fast Maintenance of Rectilinear Centers.
Proceedings of the Computational Science - ICCS 2001, 2001

2000
Characterization of EM downhole-to-surface communication links.
IEEE Trans. Geosci. Remote. Sens., 2000

Enumerating longest increasing subsequences and patience sorting.
Inf. Process. Lett., 2000

Covering a set of points by two axis-parallel boxes.
Inf. Process. Lett., 2000

Optimal Facility Location Under Various Distance Functions.
Int. J. Comput. Geom. Appl., 2000

Obnoxious Facility Location: Complete Service with Minimal Harm.
Int. J. Comput. Geom. Appl., 2000

Discrete rectilinear 2-center problems.
Comput. Geom., 2000

Maintenance of a Percing Set for Intervals with Applications.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Shooter Location through Piercing Sets.
EuroCG, 2000

Mobile facility location.
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999
On Piercing Sets of Axis-Parallel Rectangles and Rings.
Int. J. Comput. Geom. Appl., 1999

Rectilinear Static and Dynamic Discrete 2-center Problems.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Optimal Facility Location under Various Distance Functions.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
Enclosing k Points in the Smallest Axis Parallel Rectangle.
Inf. Process. Lett., 1998

Geometric applications of posets.
Comput. Geom., 1998

Constrained Square-Center Problems.
Proceedings of the Algorithm Theory, 1998


  Loading...