The SCEAS System
| |||||||

## Search the dblp DataBase
Michael Segal:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Stefan Funke, Alexander Kesselman, Zvi Lotker, Michael Segal
**Improved Approximation Algorithms for Connected Sensor Cover.**[Citation Graph (0, 0)][DBLP] ADHOC-NOW, 2004, pp:56-69 [Conf] - Sergei Bespamyatnikh, Michael Segal
**Covering a set of points by two axis-parallel boxes.**[Citation Graph (0, 0)][DBLP] CCCG, 1997, pp:- [Conf] - Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
**Obnoxious facility location: Complete service with minimal harm.**[Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf] - Matthew J. Katz, Klara Kedem, Michael Segal
**Improved algorithms for placing undesirable facilities.**[Citation Graph (0, 0)][DBLP] CCCG, 1999, pp:- [Conf] - Michael Segal, Klara Kedem
**Enclosing K Points in the Smallest Axis Parallel Rectangle.**[Citation Graph (0, 0)][DBLP] CCCG, 1996, pp:20-25 [Conf] - Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
**Approximating the geometric minimum-diameter spanning tree.**[Citation Graph (0, 0)][DBLP] CCCG, 2003, pp:39-42 [Conf] - Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
**Mobile facility location.**[Citation Graph (0, 0)][DBLP] DIAL-M, 2000, pp:46-53 [Conf] - Hai Huang, Andréa W. Richa, Michael Segal
**Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks.**[Citation Graph (0, 0)][DBLP] DIAL-M, 2002, pp:52-61 [Conf] - Hanan Shpungin, Michael Segal
[Citation Graph (0, 0)][DBLP]*k*-fault resistance in wireless ad-hoc networks. DIALM-POMC, 2005, pp:89-96 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ESA, 2000, pp:100-111 [Conf] - Michael Segal
**On Piercing Sets of Axis-Parallel Rectangles and Rings.**[Citation Graph (0, 0)][DBLP] ESA, 1997, pp:430-442 [Conf] - Matthew J. Katz, Frank Nielsen, Michael Segal
**Shooter Location through Piercing Sets.**[Citation Graph (0, 0)][DBLP] EWCG, 2000, pp:55-58 [Conf] - Sergei Bespamyatnikh, Michael Segal
**Dynamic Algorithms for Approximating Interdistances.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:1169-1180 [Conf] - Sergei Bespamyatnikh, Michael Segal
**Fast Maintenance of Rectilinear Centers.**[Citation Graph (0, 0)][DBLP] International Conference on Computational Science (1), 2001, pp:633-639 [Conf] - Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal
**Lower and Upper Bounds for Tracking Mobile Users.**[Citation Graph (0, 0)][DBLP] IFIP TCS, 2002, pp:47-58 [Conf] - Matthew J. Katz, Frank Nielsen, Michael Segal
**Maintenance of a Percing Set for Intervals with Applications.**[Citation Graph (0, 0)][DBLP] ISAAC, 2000, pp:552-563 [Conf] - Ofer Hadar, Michael Segal
**Models and Algorithms for Bandwidth Allocation of CBR Video Streams in a VoD System.**[Citation Graph (0, 0)][DBLP] ITCC, 2001, pp:148-152 [Conf] - Paz Carmi, Michael Segal, Matthew J. Katz, Hanan Shpungin
**Fault-Tolerant Power Assignment and Backbone in Wireless Networks.**[Citation Graph (0, 0)][DBLP] PerCom Workshops, 2006, pp:80-84 [Conf] - Matthew J. Katz, Klara Kedem, Michael Segal
**Constrained Square-Center Problems.**[Citation Graph (0, 0)][DBLP] SWAT, 1998, pp:95-106 [Conf] - Sergei Bespamyatnikh, Klara Kedem, Michael Segal
**Optimal Facility Location under Various Distance Functions.**[Citation Graph (0, 0)][DBLP] WADS, 1999, pp:318-329 [Conf] - Sergei Bespamyatnikh, Michael Segal
**Rectilinear Static and Dynamic Discrete 2-center Problems.**[Citation Graph (0, 0)][DBLP] WADS, 1999, pp:276-287 [Conf] - Michael Segal, Klara Kedem
**Geometric Applications Of Posets.**[Citation Graph (0, 0)][DBLP] WADS, 1997, pp:402-415 [Conf] - Sergei Bespamyatnikh, Michael Segal
**Fast Algorithms for Approximating Distances.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2002, v:33, n:2, pp:263-269 [Journal] - Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew J. Katz, Michael Segal
**Geographic Quorum System Approximations.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2005, v:41, n:4, pp:233-244 [Journal] - Matthew J. Katz, Frank Nielsen, Michael Segal
**Maintenance of a Piercing Set for Intervals with Applications.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:1, pp:59-73 [Journal] - Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink
**Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2004, v:38, n:4, pp:577-589 [Journal] - Matthew J. Katz, Klara Kedem, Michael Segal
**Discrete rectilinear 2-center problems.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 2000, v:15, n:4, pp:203-214 [Journal] - Michael Segal, Klara Kedem
**Geometric applications of posets.**[Citation Graph (0, 0)][DBLP] Comput. Geom., 1998, v:11, n:3-4, pp:143-156 [Journal] - Matthew J. Katz, Klara Kedem, Michael Segal
**Improved algorithms for placing undesirable facilities.**[Citation Graph (0, 0)][DBLP] Computers & OR, 2002, v:29, n:13, pp:1859-1872 [Journal] - Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir
**Optimal Facility Location Under Various Distance Functions.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:5, pp:523-534 [Journal] - Boaz Ben-Moshe, Matthew J. Katz, Michael Segal
**Obnoxious Facility Location: Complete Service with Minimal Harm.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 2000, v:10, n:6, pp:581-592 [Journal] - Michael Segal
**On Piercing Sets of Axis-Parallel Rectangles and Rings.**[Citation Graph (0, 0)][DBLP] Int. J. Comput. Geometry Appl., 1999, v:9, n:3, pp:219-0 [Journal] - Sergei Bespamyatnikh, Michael Segal
**Covering a set of points by two axis-parallel boxes.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:75, n:3, pp:95-100 [Journal] - Sergei Bespamyatnikh, Michael Segal
**Enumerating longest increasing subsequences and patience sorting.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2000, v:76, n:1-2, pp:7-11 [Journal] - Michael Segal, Klara Kedem
**Enclosing k Points in the Smallest Axis Parallel Rectangle.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1998, v:65, n:2, pp:95-99 [Journal] - Sergei Bespamyatnikh, Michael Segal
**Selecting distances in arrangements of hyperplanes spanned by points.**[Citation Graph (0, 0)][DBLP] J. Discrete Algorithms, 2004, v:2, n:3, pp:333-345 [Journal] - Michael Segal
**Lower Bounds for Covering Problems.**[Citation Graph (0, 0)][DBLP] J. Math. Model. Algorithms, 2002, v:1, n:1, pp:17-29 [Journal] - Sergey Bereg, Binay K. Bhattacharya, David Kirkpatrick, Michael Segal
**Competitive Algorithms for Maintaining a Mobile Center.**[Citation Graph (0, 0)][DBLP] MONET, 2006, v:11, n:2, pp:177-186 [Journal] - Hai Huang, Andréa W. Richa, Michael Segal
**Approximation Algorithms for the Mobile Piercing Set Problem with Applications to Clustering in Ad-Hoc Networks.**[Citation Graph (0, 0)][DBLP] MONET, 2004, v:9, n:2, pp:151-161 [Journal] - Hai Huang, Andréa W. Richa, Michael Segal
**Dynamic Coverage in Ad-Hoc Sensor Networks.**[Citation Graph (0, 0)][DBLP] MONET, 2005, v:10, n:1-2, pp:9-17 [Journal] - Sergei Bespamyatnikh, Binay K. Bhattacharya, Mark Keil, J. David Kirkpatrick, Michael Segal
**Efficient algorithms for centers and medians in interval and circular-arc graphs.**[Citation Graph (0, 0)][DBLP] Networks, 2002, v:39, n:3, pp:144-152 [Journal] - Sergey Bereg, Michael Segal
**Dynamic Algorithms for Approximating Interdistances.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 2004, v:11, n:4, pp:344-355 [Journal] - Michael Segal
**Placing an Obnoxious Facility in Geometric Networks.**[Citation Graph (0, 0)][DBLP] Nord. J. Comput., 2003, v:10, n:3, pp:224-237 [Journal] - Alexander Kesselman, Dariusz R. Kowalski, Michael Segal
**Energy efficient communication in ad hoc networks from user's and designer's perspective.**[Citation Graph (0, 0)][DBLP] Mobile Computing and Communications Review, 2005, v:9, n:1, pp:15-26 [Journal] - Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
**A simple improved distributed algorithm for minimum CDS in unit disk graphs.**[Citation Graph (0, 0)][DBLP] TOSN, 2006, v:2, n:3, pp:444-453 [Journal] - Liam Roditty, Michael Segal
**On bounded leg shortest paths problems.**[Citation Graph (0, 0)][DBLP] SODA, 2007, pp:775-784 [Conf] - Yehuda Ben-Shimol, Boaz Ben-Moshe, Yoav Ben-Yehezkel, Amit Dvir, Michael Segal
**Automated antenna positioning algorithms for wireless fixed-access networks.**[Citation Graph (0, 0)][DBLP] J. Heuristics, 2007, v:13, n:3, pp:243-263 [Journal] - Stefan Funke, Alexander Kesselman, Fabian Kuhn, Zvi Lotker, Michael Segal
**Improved approximation algorithms for connected sensor cover.**[Citation Graph (0, 0)][DBLP] Wireless Networks, 2007, v:13, n:2, pp:153-164 [Journal] **Novel Algorithms for the Network Lifetime Problem in Wireless Settings.**[Citation Graph (, )][DBLP]**Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks.**[Citation Graph (, )][DBLP]**Low Energy Construction of Fault Tolerant Topologies in Wireless Networks.**[Citation Graph (, )][DBLP]**Direction election in flocking swarms.**[Citation Graph (, )][DBLP]**Improved Competitive Performance Bounds for CIOQ Switches.**[Citation Graph (, )][DBLP]**The (k, l) Coredian Tree for Ad Hoc Networks.**[Citation Graph (, )][DBLP]**Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks.**[Citation Graph (, )][DBLP]**Improved Multi-criteria Spanners for Ad-Hoc Networks Under Energy and Distance Metrics.**[Citation Graph (, )][DBLP]**Power efficient resilience and lifetime in wireless ad-hoc networks.**[Citation Graph (, )][DBLP]**Placing and Maintaining a Core Node in Wireless Ad Hoc Sensor Networks.**[Citation Graph (, )][DBLP]**Deaf, Dumb, and Chatting Asynchronous Robots.**[Citation Graph (, )][DBLP]**Packet mode and QoS algorithms for buffered crossbar switches with FIFO queuing.**[Citation Graph (, )][DBLP]**Brief announcement: deaf, dumb, and chatting robots.**[Citation Graph (, )][DBLP]**Best Effort and Priority Queuing Policies for Buffered Crossbar Switches.**[Citation Graph (, )][DBLP]**Centdian Computation for Sensor Networks.**[Citation Graph (, )][DBLP]**Bounded-hop strong connectivity for flocking swarms.**[Citation Graph (, )][DBLP]**Optimizing performance of ad-hoc networks under energy and scheduling constraints.**[Citation Graph (, )][DBLP]**Improved Lower Bounds for Data-Gathering Time in Sensor Networks.**[Citation Graph (, )][DBLP]**Improved Algorithms for Data-Gathering Time in Sensor Networks II: Ring, Tree and Grid Topologies.**[Citation Graph (, )][DBLP]**On construction of minimum energy k-fault resistant topologies.**[Citation Graph (, )][DBLP]**Improved bounds for data-gathering time in sensor networks.**[Citation Graph (, )][DBLP]**Maximizing the number of obnoxious facilities to locate within a bounded region.**[Citation Graph (, )][DBLP]**Deaf, Dumb, and Chatting Robots, Enabling Distributed Computation and Fault-Tolerance Among Stigmergic Robot**[Citation Graph (, )][DBLP]**Real-time data gathering in sensor networks.**[Citation Graph (, )][DBLP]
Search in 1.005secs, Finished in 1.008secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |