| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Alexander Kesselman, Kirill Kogan, Michael Segal |
Improved Competitive Performance Bounds for CIOQ Switches.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2012 |
DBLP BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir |
Centdian Computation in Cactus Graphs. |
J. Graph Algorithms Appl. |
2012 |
DBLP BibTeX RDF |
|
| 1 | Dariusz R. Kowalski, Zeev Nutov, Michael Segal |
Scheduling of Vehicles in Transportation Networks. |
Nets4Cars/Nets4Trains |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Michael Segal |
On Bounded Leg Shortest Paths Problems. |
Algorithmica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin |
Novel algorithms for the network lifetime problem in wireless settings. |
Wireless Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liron Levin, Michael Segal, Hanan Shpungin |
Interference-free energy efficient scheduling in wireless ad hoc networks. |
WiOpt |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | AlloucheYair Yair, Michael Segal |
Near-optimal, reliable and self-organizing hierarchical topology in VANET. |
Vehicular Ad Hoc Networks |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal |
The euclidean bottleneck steiner path problem. |
Symposium on Computational Geometry |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Isaac Keslassy, Kirill Kogan, Gabriel Scalosub, Michael Segal |
Providing performance guarantees in multipass network processors. |
INFOCOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Liron Levin, Michael Segal, Hanan Shpungin |
Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks. |
FOMC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Marchetti-Spaccamela, Michael Segal (eds.) |
Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011. Proceedings |
TAPAS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Dvir, Michael Segal |
Placing and maintaining a core node in wirelessad hoc networks. |
Wireless Communications and Mobile Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanan Shpungin, Michael Segal |
On minimizing the total power of k-strongly connected wireless networks. |
Wireless Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Berend, Michael Segal, Hanan Shpungin |
Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks. |
Ad Hoc & Sensor Wireless Networks |
2010 |
DBLP BibTeX RDF |
|
| 1 | Hanan Shpungin, Michael Segal |
Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks. |
IEEE/ACM Trans. Netw. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Abravaya, Michael Segal |
Maximizing the number of obnoxious facilities to locate within a bounded region. |
Computers & OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Kirill Kogan, Michael Segal |
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. |
Distributed Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Revah, Michael Segal, Liron Yedidsion |
Real-time data gathering in sensor networks. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Liron Levin, Michael Segal, Hanan Shpungin |
Optimizing performance of ad-hoc networks under energy and scheduling constraints. |
WiOpt |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shlomi Dolev, Michael Segal, Hanan Shpungin |
Bounded-hop strong connectivity for flocking swarms. |
WiOpt |
2010 |
DBLP BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir |
Centdian Computation for Sensor Networks. |
TAMC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal, Hanan Shpungin |
Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics. |
INFOCOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ohad Ben-Shahar, Shlomi Dolev, Andrey Dolgin, Michael Segal |
Direction election in flocking swarms. |
DIALM-PODC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shimon Abravaya, Michael Segal |
Low complexity algorithms for optimal consumer push-pull partial covering in the plane. |
European Journal of Operational Research |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanan Shpungin, Michael Segal |
Low-energy fault-tolerant bounded-hop broadcast in wireless networks. |
IEEE/ACM Trans. Netw. |
2009 |
DBLP DOI BibTeX RDF |
minimum-energy control, radio broadcasting, fault tolerance, wireless networks, approximation methods |
| 1 | Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal |
Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Yoram Revah, Michael Segal |
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree, and Grid Topologies. |
IJDSN |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal, Hanan Shpungin |
On construction of minimum energy k-fault resistant topologies. |
Ad Hoc Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal |
Deaf, Dumb, and Chatting Asynchronous Robots. |
OPODIS |
2009 |
DBLP DOI BibTeX RDF |
Explicit Communication, Stigmergy, Mobile Robot Networks |
| 1 | Hanan Shpungin, Michael Segal |
Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks. |
INFOCOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Nutov, Michael Segal |
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks. |
ALGOSENSORS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoann Dieudonné, Shlomi Dolev, Franck Petit, Michael Segal |
Brief announcement: deaf, dumb, and chatting robots. |
PODC |
2009 |
DBLP DOI BibTeX RDF |
swarm of robots, communication, stigmergy |
| 1 | Michael Segal |
Fast algorithm for multicast and data gathering in wireless networks. |
Inf. Process. Lett. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal, Eli Zeitlin |
Computing closest and farthest points for a query segment. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Revah, Michael Segal |
Improved bounds for data-gathering time in sensor networks. |
Computer Communications |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Dvir, Michael Segal |
The (k, l) Coredian Tree for Ad Hoc Networks. |
Ad Hoc & Sensor Wireless Networks |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ofer Hadar, Shlomo Greenberg, Michael Segal |
EPCRTT-based smoothing and multiplexing of VBR video traffic. |
Multimedia Tools Appl. |
2008 |
DBLP DOI BibTeX RDF |
Video rate smoothing, Statistical multiplexing gain, QoS, Admission control, Network utilization |
| 1 | Alexander Kesselman, Kirill Kogan, Michael Segal |
Improved Competitive Performance Bounds for CIOQ Switches. |
ESA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Dvir, Michael Segal |
The (k, l) Coredian Tree for Ad Hoc Networks. |
ICDCS Workshops |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Elkin, Yuval Lando, Zeev Nutov, Michael Segal, Hanan Shpungin |
Novel Algorithms for the Network Lifetime Problem in Wireless Settings. |
ADHOC-NOW |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Kirill Kogan, Michael Segal |
Best Effort and Priority Queuing Policies for Buffered Crossbar Switches. |
SIROCCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Kesselman, Kirill Kogan, Michael Segal |
Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing. |
PODC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal, Alexander Kesselman (eds.) |
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, Toronto, Canada, August 18-21, 2008 |
DIALM-POMC |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel Berend, Michael Segal, Hanan Shpungin |
Power efficient resilience and lifetime in wireless ad-hoc networks. |
FOWANC |
2008 |
DBLP DOI BibTeX RDF |
strong connectivity, fault tolerance, wireless ad-hoc networks, topology control, energy consumption, network lifetime |
| 1 | Michele Luglio, Cristiano Monti, Cesare Roseti, Antonio Saitto, Michael Segal |
Interworking between MANET and satellite systems for emergency applications. |
Int. J. Satellite Communications Networking |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal |
Improved approximation algorithms for connected sensor cover. |
Wireless Networks |
2007 |
DBLP DOI BibTeX RDF |
Sensing connected coverage, Approximation algorithms |
| 1 | Yehuda Ben-Shimol, Boaz Ben-Moshe, Yoav Ben-Yehezkel, Amit Dvir, Michael Segal |
Automated antenna positioning algorithms for wireless fixed-access networks. |
J. Heuristics |
2007 |
DBLP DOI BibTeX RDF |
Fixed-access wireless networks, Automated antenna positioning, Rural areas, Terrain preprocessing |
| 1 | Paz Carmi, Matthew J. Katz, Michael Segal, Hanan Shpungin |
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. |
Ad Hoc & Sensor Wireless Networks |
2007 |
DBLP BibTeX RDF |
|
| 1 | Michael Segal, Liron Yedidsion |
On Real Time Data-Gathering in Sensor Networks. |
MASS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Liam Roditty, Michael Segal |
On bounded leg shortest paths problems. |
SODA |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amit Dvir, Michael Segal |
Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks. |
Networking |
2007 |
DBLP DOI BibTeX RDF |
Core Node, Sensor networks, Wireless Ad hoc Networks, Multicast tree |
| 1 | Hanan Shpungin, Michael Segal |
Low Energy Construction of Fault Tolerant Topologies in Wireless Networks. |
DIALM-POMC |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yoram Revah, Michael Segal |
Improved Lower Bounds for Data-Gathering Time in Sensor Networks. |
ICNS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoram Revah, Michael Segal |
Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies. |
ICNS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal |
Competitive Algorithms for Maintaining a Mobile Center. |
MONET |
2006 |
DBLP DOI BibTeX RDF |
online strategies, approximation algorithms, facility location |
| 1 | Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal |
A simple improved distributed algorithm for minimum CDS in unit disk graphs. |
TOSN |
2006 |
DBLP DOI BibTeX RDF |
algorithms, Connected dominating set, unit disk graphs |
| 1 | Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin |
Fault-Tolerant Power Assignment and Backbone in Wireless Networks. |
PerCom Workshops |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hai Huang, Andréa W. Richa, Michael Segal |
Dynamic Coverage in Ad-Hoc Sensor Networks. |
MONET |
2005 |
DBLP DOI BibTeX RDF |
coverage, kinetic data structure, ad hoc sensor network |
| 1 | Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal |
Geographic Quorum System Approximations. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Clustering, Quorum system, Geometric optimization |
| 1 | Alexander Kesselman, Dariusz R. Kowalski, Michael Segal |
Energy efficient communication in ad hoc networks from user's and designer's perspective. |
Mobile Computing and Communications Review |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanan Shpungin, Michael Segal |
k-fault resistance in wireless ad-hoc networks. |
DIALM-POMC |
2005 |
DBLP DOI BibTeX RDF |
ad hoc networks, connectivity |
| 1 | Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal |
A simple improved distributed algorithm for minimum CDS in unit disk graphs. |
WiMob |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal |
Planar Maximum Box Problem. |
J. Math. Model. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hai Huang, Andréa W. Richa, Michael Segal |
Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks. |
MONET |
2004 |
DBLP DOI BibTeX RDF |
wireless networks, distributed algorithms |
| 1 | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink |
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Minimum diameter spanning tree, Approximation algorithm, Geometric graph |
| 1 | Sergei Bespamyatnikh, Michael Segal |
Selecting distances in arrangements of hyperplanes spanned by points. |
J. Discrete Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergey Bereg, Michael Segal |
Dynamic Algorithms for Approximating Interdistances. |
Nord. J. Comput. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Stefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal |
Improved Approximation Algorithms for Connected Sensor Cover. |
ADHOC-NOW |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Ben-Shimol, Amit Dvir, Michael Segal |
SPLAST: a novel approach for multicasting in mobile wireless ad hoc networks. |
PIMRC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Frank Nielsen, Michael Segal |
Maintenance of a Piercing Set for Intervals with Applications. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
Piercing set, Dynamic algorithms, Geometric optimization |
| 1 | Michael Segal |
Placing an Obnoxious Facility in Geometric Networks. |
Nord. J. Comput. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Michael Segal |
Dynamic Algorithms for Approximating Interdistances. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink |
Approximating the geometric minimum-diameter spanning tree. |
CCCG |
2003 |
DBLP BibTeX RDF |
|
| 1 | Michael Segal |
Lower Bounds for Covering Problems. |
J. Math. Model. Algorithms |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Michael Segal |
Fast Algorithms for Approximating Distances. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Klara Kedem, Michael Segal |
Improved algorithms for placing undesirable facilities. |
Computers & OR |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal |
Lower and Upper Bounds for Tracking Mobile Users. |
IFIP TCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
piercing set, clustering, approximation algorithms, mobile ad-hoc networks, distributed protocols |
| 1 | Sergei Bespamyatnikh, Michael Segal |
Fast Maintenance of Rectilinear Centers. |
International Conference on Computational Science |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ofer Hadar, Michael Segal |
Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System. |
ITCC |
2001 |
DBLP DOI BibTeX RDF |
Constant bit rate transmission, Video rate smoothing, Computational geometry, Video on Demand (VoD), Bandwidth allocation |
| 1 | Sergei Bespamyatnikh, Michael Segal |
Covering a set of points by two axis-parallel boxes. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Michael Segal |
Enumerating longest increasing subsequences and patience sorting. |
Inf. Process. Lett. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Klara Kedem, Michael Segal |
Discrete rectilinear 2-center problems. |
Comput. Geom. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Matthew J. Katz, Michael Segal |
Obnoxious Facility Location: Complete Service with Minimal Harm. |
Int. J. Comput. Geometry Appl. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir |
Optimal Facility Location Under Various Distance Functions. |
Int. J. Comput. Geometry Appl. |
2000 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Frank Nielsen, Michael Segal |
Shooter Location through Piercing Sets. |
EuroCG |
2000 |
DBLP BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal |
Mobile facility location. |
DIAL-M |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Frank Nielsen, Michael Segal |
Maintenance of a Percing Set for Intervals with Applications. |
ISAAC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal |
On Piercing Sets of Axis-Parallel Rectangles and Rings. |
Int. J. Comput. Geometry Appl. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Boaz Ben-Moshe, Matthew J. Katz, Michael Segal |
Obnoxious facility location: Complete service with minimal harm. |
CCCG |
1999 |
DBLP BibTeX RDF |
|
| 1 | Matthew J. Katz, Klara Kedem, Michael Segal |
Improved algorithms for placing undesirable facilities. |
CCCG |
1999 |
DBLP BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Klara Kedem, Michael Segal |
Optimal Facility Location under Various Distance Functions. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergei Bespamyatnikh, Michael Segal |
Rectilinear Static and Dynamic Discrete 2-center Problems. |
WADS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal, Klara Kedem |
Enclosing k Points in the Smallest Axis Parallel Rectangle. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal, Klara Kedem |
Geometric applications of posets. |
Comput. Geom. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Matthew J. Katz, Klara Kedem, Michael Segal |
Constrained Square-Center Problems. |
SWAT |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Segal |
On Piercing Sets of Axis-Parallel Rectangles and Rings. |
ESA |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")