Michael Segal

Veh. Commun., 2015

Reducing Interferences in VANETs.

[BibT_eX]

[DOI]

Dmitry Zelikman

IEEE Trans. Intell. Transp. Syst., 2015

Message and time efficient multi-broadcast schemes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Improved structures for data collection in static and mobile wireless sensor networks.

[BibT_eX]

[DOI]

Jon Crowcroft

J. Heuristics, 2015

Vehicle to Vehicle Authentication.

[BibT_eX]

[DOI]

CoRR, 2015

Using central nodes for efficient data collection in wireless sensor networks.

[BibT_eX]

[DOI]

Vitaly Milyeykovski

Vladimir Katz

Comput. Networks, 2015

Using data mules for sensor network resiliency.

[BibT_eX]

[DOI]

Jon Crowcroft

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.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

Swaminathan Sankararaman

Sylvester David Eriksson-Bique

Proceedings of the 14th International Conference on Information Processing in Sensor Networks, 2015

2014

Scheduling problems in transportation networks of line topology.

[BibT_eX]

[DOI]

Optim. Lett., 2014

Optimization Schemes for Protective Jamming.

[BibT_eX]

[DOI]

Swaminathan Sankararaman

A. Karim Abu-Affash

Alon Efrat

Valentin Polishchuk

Srinivasan Ramasubramanian

Mob. Networks Appl., 2014

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

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Collecting data in ad-hoc networks with reduced uncertainty.

[BibT_eX]

[DOI]

Alon Efrat

Ad Hoc Networks, 2014

Direction election in flocking swarms.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2014

Improved structures for data collection in wireless sensor networks.

[BibT_eX]

[DOI]

Jon Crowcroft

Proceedings of the 2014 IEEE Conference on Computer Communications, 2014

Balancing work and size with bounded buffers.

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Sergey I. Nikolenko

Gabriel Scalosub

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.

[BibT_eX]

[DOI]

Proceedings of the AMIA 2014, 2014

2013

Cooperative data collection in ad hoc networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2013

Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2013

Bounded-Hop Energy-Efficient Liveness of Flocking Swarms.

[BibT_eX]

[DOI]

Shlomi Dolev

IEEE Trans. Mob. Comput., 2013

A Cluster-Based Beaconing Approach in VANETs: Near Optimal Topology Via Proximity Information.

[BibT_eX]

[DOI]

Mob. Networks Appl., 2013

Space and speed tradeoffs in TCAM hierarchical packet classification.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2013

Interference-free energy efficient scheduling in wireless ad hoc networks.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2013

Location, location, location: Using central nodes for efficient data collection in WSNs.

[BibT_eX]

[DOI]

Vitaly Milyeykovski

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.

[BibT_eX]

[DOI]

Proceedings of the SAFECOMP 2013, 2013

The delta-betweenness centrality.

[BibT_eX]

[DOI]

Alexander Plutov

Proceedings of the 24th IEEE Annual International Symposium on Personal, 2013

2012

Providing performance guarantees in multipass network processors.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2012

Improved approximation algorithms for maximum lifetime problems in wireless networks.

[BibT_eX]

[DOI]

Zeev Nutov

Theor. Comput. Sci., 2012

Centdian Computation in Cactus Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

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

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Gabriel Scalosub

CoRR, 2012

Best Effort and Priority Queuing Policies for Buffered Crossbar Switches.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2012

Improved Competitive Performance Bounds for CIOQ Switches.

[BibT_eX]

[DOI]

Algorithmica, 2012

Scheduling of Vehicles in Transportation Networks.

[BibT_eX]

[DOI]

Zeev Nutov

Proceedings of the Communication Technologies for Vehicles - 4th International Workshop, 2012

VANET in eyes of hierarchical topology.

[BibT_eX]

[DOI]

Proceedings of the FOMC'12, 2012

2011

Novel algorithms for the network lifetime problem in wireless settings.

[BibT_eX]

[DOI]

Wirel. Networks, 2011

On Bounded Leg Shortest Paths Problems.

[BibT_eX]

[DOI]

Liam Roditty

Algorithmica, 2011

Near-optimal, reliable and self-organizing hierarchical topology in VANET.

[BibT_eX]

[DOI]

Proceedings of the Eighth International Workshop on Vehicular Ad Hoc Networks, 2011

Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks.

[BibT_eX]

[DOI]

Proceedings of the FOMC'11, 2011

The euclidean bottleneck steiner path problem.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

2010

On minimizing the total power of k-strongly connected wireless networks.

[BibT_eX]

[DOI]

Wirel. Networks, 2010

Placing and maintaining a core node in wirelessad hoc networks.

[BibT_eX]

[DOI]

Wirel. Commun. Mob. Comput., 2010

Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2010

Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing.

[BibT_eX]

[DOI]

Distributed Comput., 2010

Real-time data gathering in sensor networks.

[BibT_eX]

[DOI]

Liron Yedidsion

Discret. Appl. Math., 2010

Maximizing the number of obnoxious facilities to locate within a bounded region.

[BibT_eX]

[DOI]

Shimon Abravaya

Comput. Oper. Res., 2010

Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks.

[BibT_eX]

[DOI]

Daniel Berend

Ad Hoc Sens. Wirel. Networks, 2010

Optimizing performance of ad-hoc networks under energy and scheduling constraints.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Shlomi Dolev

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.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009

Low-energy fault-tolerant bounded-hop broadcast in wireless networks.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2009

Improving lifetime of wireless sensor networks.

[BibT_eX]

[DOI]

Netw. Protoc. Algorithms, 2009

Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies.

[BibT_eX]

[DOI]

Int. J. Distributed Sens. Networks, 2009

Low complexity algorithms for optimal consumer push-pull partial covering in the plane.

[BibT_eX]

[DOI]

Shimon Abravaya

Eur. J. Oper. Res., 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

On construction of minimum energy k-fault resistant topologies.

[BibT_eX]

[DOI]

Ad Hoc Networks, 2009

Brief announcement: deaf, dumb, and chatting robots.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Deaf, Dumb, and Chatting Asynchronous Robots.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008

Computing closest and farthest points for a query segment.

[BibT_eX]

[DOI]

Eli Zeitlin

Theor. Comput. Sci., 2008

EPCRTT-based smoothing and multiplexing of VBR video traffic.

[BibT_eX]

[DOI]

Ofer Hadar

Shlomo Greenberg

Multim. Tools Appl., 2008

Fast algorithm for multicast and data gathering in wireless networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Improved bounds for data-gathering time in sensor networks.

[BibT_eX]

[DOI]

Comput. Commun., 2008

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

[BibT_eX]

[DOI]

Ad Hoc Sens. Wirel. Networks, 2008

Power efficient resilience and lifetime in wireless ad-hoc networks.

[BibT_eX]

[DOI]

Daniel Berend

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.

[BibT_eX]

[DOI]

PhD thesis, 2007

Improved approximation algorithms for connected sensor cover.

[BibT_eX]

[DOI]

Wirel. Networks, 2007

Interworking between MANET and satellite systems for emergency applications.

[BibT_eX]

[DOI]

Int. J. Satell. Commun. Netw., 2007

Automated antenna positioning algorithms for wireless fixed-access networks.

[BibT_eX]

[DOI]

J. Heuristics, 2007

Fault-Tolerant Power Assignment and Backbone in Wireless Networks.

[BibT_eX]

[DOI]

Ad Hoc Sens. Wirel. Networks, 2007

Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

Improved Lower Bounds for Data-Gathering Time in Sensor Networks.

[BibT_eX]

[DOI]

Proceedings of the Third International Conference on Networking and Services (ICNS 2007), 2007

Low Energy Construction of Fault Tolerant Topologies in Wireless Networks.

[BibT_eX]

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.

[BibT_eX]

[DOI]

ACM Trans. Sens. Networks, 2006

Competitive Algorithms for Maintaining a Mobile Center.

[BibT_eX]

[DOI]

Sergey Bereg

Mob. Networks Appl., 2006

Automated antenna positioning for wireless networks.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

ACM SIGMOBILE Mob. Comput. Commun. Rev., 2005

Dynamic Coverage in Ad-Hoc Sensor Networks.

[BibT_eX]

[DOI]

Hai Huang

Andréa W. Richa

Mob. Networks Appl., 2005

Geographic Quorum System Approximations.

[BibT_eX]

[DOI]

Algorithmica, 2005

Energy efficient connectivity in ad hoc networks from user's and designer's perspective.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2005

k-fault resistance in wireless ad-hoc networks.

[BibT_eX]

[DOI]

Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

2004

Dynamic Algorithms for Approximating Interdistances.

[BibT_eX]

Sergey Bereg

Nord. J. Comput., 2004

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

[BibT_eX]

[DOI]

Hai Huang

Andréa W. Richa

Mob. Networks Appl., 2004

Planar Maximum Box Problem.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2004

Selecting distances in arrangements of hyperplanes spanned by points.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2004

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

[BibT_eX]

[DOI]

Algorithmica, 2004

SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks.

[BibT_eX]

[DOI]

Yehuda Ben-Shimol

Proceedings of the IEEE 15th International Symposium on Personal, 2004

Improved Approximation Algorithms for Connected Sensor Cover.

[BibT_eX]

[DOI]

Proceedings of the Ad-Hoc, Mobile, and Wireless Networks: Third International Conference, 2004

2003

Placing an Obnoxious Facility in Geometric Networks.

[BibT_eX]

Nord. J. Comput., 2003

Maintenance of a Piercing Set for Intervals with Applications.

[BibT_eX]

[DOI]

Frank Nielsen

Algorithmica, 2003

Approximating the geometric minimum-diameter spanning tree.

[BibT_eX]

[DOI]

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

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

[BibT_eX]

[DOI]

J. Mark Keil

Networks, 2002

Lower Bounds for Covering Problems.

[BibT_eX]

[DOI]

J. Math. Model. Algorithms, 2002

Improved algorithms for placing undesirable facilities.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2002

Fast Algorithms for Approximating Distances.

[BibT_eX]

[DOI]

Algorithmica, 2002

Lower and Upper Bounds for Tracking Mobile Users.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Ofer Hadar

Proceedings of the 2001 International Symposium on Information Technology (ITCC 2001), 2001

Fast Maintenance of Rectilinear Centers.

[BibT_eX]

[DOI]

Proceedings of the Computational Science - ICCS 2001, 2001

2000

Characterization of EM downhole-to-surface communication links.

[BibT_eX]

[DOI]

IEEE Trans. Geosci. Remote. Sens., 2000

Enumerating longest increasing subsequences and patience sorting.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Covering a set of points by two axis-parallel boxes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

Optimal Facility Location Under Various Distance Functions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2000

Obnoxious Facility Location: Complete Service with Minimal Harm.

[BibT_eX]

[DOI]

Boaz Ben-Moshe

Int. J. Comput. Geom. Appl., 2000

Discrete rectilinear 2-center problems.

[BibT_eX]

[DOI]

Comput. Geom., 2000

Maintenance of a Percing Set for Intervals with Applications.

[BibT_eX]

[DOI]

Frank Nielsen

Proceedings of the Algorithms and Computation, 11th International Conference, 2000

Shooter Location through Piercing Sets.

[BibT_eX]

Frank Nielsen

EuroCG, 2000

Mobile facility location.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 1999

Rectilinear Static and Dynamic Discrete 2-center Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Optimal Facility Location under Various Distance Functions.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998

Enclosing k Points in the Smallest Axis Parallel Rectangle.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1998

Geometric applications of posets.

[BibT_eX]

[DOI]

Comput. Geom., 1998

Constrained Square-Center Problems.

[BibT_eX]

[DOI]