Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
212 | Christian Schindelhauer, Klaus Volbert, Martin Ziegler 0001 |
Spanners, Weak Spanners, and Power Spanners for Wireless Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 15th International Symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings, pp. 805-821, 2004, Springer, 3-540-24131-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
140 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 583-592, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
126 | Philippe Jacquet, Laurent Viennot |
Remote-spanners: What to know beyond neighbors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPDPS ![In: 23rd IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2009, Rome, Italy, May 23-29, 2009, pp. 1-10, 2009, IEEE. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
112 | Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff |
Transitive-closure spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 932-941, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
112 | Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang |
Additive Spanners for Circle Graphs and Polygonal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 110-121, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
112 | Artur Czumaj, Hairong Zhao |
Fault-tolerant geometric spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 19th ACM Symposium on Computational Geometry, San Diego, CA, USA, June 8-10, 2003, pp. 1-10, 2003, ACM, 1-58113-663-3. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
fault-tolerant spanners, computational geometry, greedy algorithms, spanners |
105 | Shiri Chechik, Michael Langberg, David Peleg, Liam Roditty |
Fault-tolerant spanners for general graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 435-444, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
fault-tolerance, graphs, spanners |
100 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
New constructions of (alpha, beta)-spanners and purely additive spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 672-681, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
98 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson, Michiel H. M. Smid |
Geometric Spanners for Weighted Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 190-202, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
98 | Seth Pettie |
Low Distortion Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 78-89, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
98 | Feodor F. Dragan, Chenyu Yan, Irina Lomonosov |
Collective Tree Spanners of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings, pp. 64-76, 2004, Springer, 3-540-22339-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
98 | Dagmar Handke |
Independent Tree Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 203-214, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
91 | Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini |
Graph Spanners in the Streaming Model: An Experimental Study. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 55(2), pp. 346-374, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Graph spanners, Data streams, Graph algorithms, Algorithm engineering, Experimental algorithmics |
91 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson |
Region-Fault Tolerant Geometric Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(4), pp. 556-582, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Fault-tolerance, Geometric spanners, Geometric networks |
85 | Feodor F. Dragan, Chenyu Yan, Yang Xiang |
Collective Additive Tree Spanners of Homogeneously Orderable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008, Proceedings, pp. 555-567, 2008, Springer, 978-3-540-78772-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
85 | T.-H. Hubert Chan, Michael Dinitz, Anupam Gupta 0001 |
Spanners with Slack. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 196-207, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
85 | Feodor F. Dragan, Chenyu Yan, Derek G. Corneil |
Collective Tree Spanners and Routing in AT-free Related Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 30th International Workshop,WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers, pp. 68-80, 2004, Springer, 3-540-24132-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
85 | Michael Elkin, Jian Zhang 0004 |
Efficient algorithms for constructing (1+, varepsilon;, beta)-spanners in the distributed and streaming models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, July 25-28, 2004, pp. 160-168, 2004, ACM, 1-58113-802-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
almost shortest paths, streaming model, spanner |
85 | Barun Chandra, Gautam Das 0001, Giri Narasimhan, José Soares |
New Sparseness Results on Graph Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Eighth Annual Symposium on Computational Geometry, Berlin, Germany, June 10-12, 1992, pp. 192-201, 1992, ACM, 0-89791-517-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
71 | Mohammad Ali Abam, Mark de Berg, Mohammad Farshi, Joachim Gudmundsson |
Region-fault tolerant geometric spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, New Orleans, Louisiana, USA, January 7-9, 2007, pp. 1-10, 2007, SIAM, 978-0-898716-24-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP BibTeX RDF |
|
71 | Martin Fürer, Shiva Prasad Kasiviswanathan |
Spanners for Geometric Intersection Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 312-324, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
71 | Artur Czumaj, Hairong Zhao |
Fault-Tolerant Geometric Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 32(2), pp. 207-230, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
71 | Mikkel Sigurd, Martin Zachariasen |
Construction of Minimum-Weight Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2004, 12th Annual European Symposium, Bergen, Norway, September 14-17, 2004, Proceedings, pp. 797-808, 2004, Springer, 3-540-23025-4. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
64 | Liam Roditty, Mikkel Thorup, Uri Zwick |
Roundtrip spanners and roundtrip routing in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(3), pp. 29:1-29:17, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
roundtrip, Routing, shortest paths, distances, spanners |
57 | Iyad A. Kanj, Ge Xia, Fenghui Zhang |
Local Construction of Spanners in the 3-D Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DCOSS ![In: Distributed Computing in Sensor Systems, 5th IEEE International Conference, DCOSS 2009, Marina del Rey, CA, USA, June 8-10, 2009. Proceedings, pp. 315-328, 2009, Springer, 978-3-642-02084-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
57 | Andreas Wiese, Evangelos Kranakis |
Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 372-383, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
57 | Michael Elkin |
Streaming and Fully Dynamic Centralized Algorithms for Constructing and Maintaining Sparse Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 34th International Colloquium, ICALP 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings, pp. 716-727, 2007, Springer, 978-3-540-73419-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
57 | Surender Baswana |
Dynamic Algorithms for Graph Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2006, 14th Annual European Symposium, Zurich, Switzerland, September 11-13, 2006, Proceedings, pp. 76-87, 2006, Springer, 3-540-38875-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
57 | Bilel Derbel, Cyril Gavoille |
Fast Deterministic Distributed Algorithms for Sparse Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 13th International Colloquium, SIROCCO 2006, Chester, UK, July 2-5, 2006, Proceedings, pp. 100-114, 2006, Springer, 3-540-35474-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
57 | Mohammad Farshi, Joachim Gudmundsson |
Experimental Study of Geometric t-Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 556-567, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
57 | Liam Roditty, Mikkel Thorup, Uri Zwick |
Deterministic Constructions of Approximate Distance Oracles and Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, pp. 261-272, 2005, Springer, 3-540-27580-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
57 | Yon Dourisboure, Cyril Gavoille |
Sparse Additive Spanners for Bounded Tree-Length Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIROCCO ![In: Structural Information and Communication Complexity, 11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slovakia, June 21-23, 2004, Proceedings, pp. 123-137, 2004, Springer, 3-540-22230-8. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
57 | Béla Bollobás, Don Coppersmith, Michael Elkin |
Sparse distance preservers and additive spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 414-423, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
|
57 | Victor Chepoi, Feodor F. Dragan, Chenyu Yan |
Additive Spanners for k-Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAC ![In: Algorithms and Complexity, 5th Italian Conference, CIAC 2003, Rome, Italy, May 28-30, 2003, Proceedings, pp. 96-107, 2003, Springer, 3-540-40176-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
50 | T.-H. Hubert Chan, Anupam Gupta 0001 |
Small Hop-diameter Sparse Spanners for Doubling Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 41(1), pp. 28-44, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hop diameter, Algorithms, Doubling metrics, Sparse spanners |
50 | Mirela Damian, Nagesh Javali |
Distributed construction of bounded-degree low-interference spanners of low weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MobiHoc ![In: Proceedings of the 9th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2008, Hong Kong, China, May 26-30, 2008, pp. 101-110, 2008, ACM, 978-1-60558-073-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
quasi unit disk graphs, wireless ad-hoc networks, interference, topology control, spanners |
50 | Bilel Derbel, Cyril Gavoille, David Peleg |
Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 21st International Symposium, DISC 2007, Lemesos, Cyprus, September 24-26, 2007, Proceedings, pp. 179-192, 2007, Springer, 978-3-540-75141-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
graph spanners, distributed algorithms, time complexity |
50 | Michael Elkin |
A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007, pp. 185-194, 2007, ACM, 978-1-59593-616-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
distributed dynamic algorithms, spanners |
50 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 42(3-4), pp. 249-264, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Low weight graphs, Computational geometry, Planar graphs, Spanners, Bounded degree graphs |
50 | Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Improved Algorithms for Constructing Fault-Tolerant Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 32(1), pp. 144-156, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Well-separated pairs, Fault-tolerance, Computational geometry, Spanners |
48 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 1(2), pp. 283-323, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
almost shortest paths, Graph algorithms, spanners |
43 | Sanjiv Kapoor, Xiang-Yang Li 0001 |
Geodesic Spanners on Polyhedral Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 20th International Symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings, pp. 213-223, 2009, Springer, 978-3-642-10630-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
43 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
Computing Lightweight Spanners Locally. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings, pp. 365-378, 2008, Springer, 978-3-540-87778-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
43 | Mohammad Farshi, Joachim Gudmundsson |
Experimental Study of Geometric t-Spanners: A Running Time Comparison. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WEA ![In: Experimental Algorithms, 6th International Workshop, WEA 2007, Rome, Italy, June 6-8, 2007, Proceedings, pp. 270-284, 2007, Springer, 978-3-540-72844-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Giorgio Ausiello, Camil Demetrescu, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini |
Small Stretch Spanners in the Streaming Model: New Algorithms and Experiments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings, pp. 605-617, 2007, Springer, 978-3-540-75519-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | Prosenjit Bose, Paz Carmi, Mathieu Couture, Michiel H. M. Smid, Daming Xu |
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 300-311, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
43 | David P. Woodruff |
Lower Bounds for Additive Spanners, Emulators, and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 21-24 October 2006, Berkeley, California, USA, Proceedings, pp. 389-398, 2006, IEEE Computer Society, 0-7695-2720-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
43 | Liam Roditty, Mikkel Thorup, Uri Zwick |
Roundtrip spanners and roundtrip routing in directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, USA., pp. 844-851, 2002, ACM/SIAM, 0-89871-513-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
43 | Gonzalo Navarro 0001, Rodrigo Paredes, Edgar Chávez |
t-Spanners as a Data Structure for Metric Space Searching. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPIRE ![In: String Processing and Information Retrieval, 9th International Symposium, SPIRE 2002, Lisbon, Portugal, September 11-13, 2002, Proceedings, pp. 298-309, 2002, Springer, 3-540-44158-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
43 | Tamás Lukovszki |
New Results of Fault Tolerant Geometric Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 6th International Workshop, WADS '99, Vancouver, British Columbia, Canada, August 11-14, 1999, Proceedings, pp. 193-204, 1999, Springer, 3-540-66279-0. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
43 | Ulrik Brandes, Dagmar Handke |
NP-Completness Results for Minimum Planar Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 85-99, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
43 | Gautam Das 0001, Giri Narasimhan |
A Fast Algorithm for Constructing Sparse Euclidean Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook, New York, USA, June 6-8, 1994, pp. 132-139, 1994, ACM, 0-89791-648-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
43 | Shuichi Ueno, Michihiro Yamazaki |
Graph Spanners and Connectivity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings, pp. 126-134, 1992, Springer, 3-540-56279-6. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
42 | Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Michiel H. M. Smid |
On the Power of the Semi-Separated Pair Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings, pp. 1-12, 2009, Springer, 978-3-642-03366-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
42 | David Peleg, Liam Roditty |
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ADHOC-NOW ![In: Ad-hoc, Mobile and Wireless Networks, 7th International Conference, ADHOC-NOW 2008, Sophia-Antipolis, France, September 10-12, 2008, Proceedings, pp. 135-147, 2008, Springer, 978-3-540-85208-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
42 | Natalia Levina, Emmanuelle Vaast |
Turning Collaboration into Transaction: A Case of Intranet Use in Boundary-Spanning Practices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS ![In: 38th Hawaii International Conference on System Sciences (HICSS-38 2005), CD-ROM / Abstracts Proceedings, 3-6 January 2005, Big Island, HI, USA, 2005, IEEE Computer Society, 0-7695-2268-8. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
42 | Shien-Ching Hwang, Gen-Huey Chen |
The Minimum Spanner Problem on Butterfly Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISPAN ![In: 5th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN 2000), 7-10 December 2000, Dallas / Richardson, TX, USA, pp. 210-215, 2000, IEEE Computer Society, 0-7695-0936-3. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
36 | Mohammad Ali Abam, Mark de Berg |
Kinetic spanners in Rd. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 25th ACM Symposium on Computational Geometry, Aarhus, Denmark, June 8-10, 2009, pp. 43-50, 2009, ACM, 978-1-60558-501-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
kinetic data structures, geometric spanners |
36 | Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid |
Approximate distance oracles for geometric spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 4(1), pp. 10:1-10:34, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
approximation algorithm, computational geometry, Shortest paths, spanners, geometric graphs |
36 | Liam Roditty |
Fully dynamic geometric spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 23rd ACM Symposium on Computational Geometry, Gyeongju, South Korea, June 6-8, 2007, pp. 373-380, 2007, ACM, 978-1-59593-705-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
algorithms, dynamic, geometry, spanners |
36 | Sunil Arya, David M. Mount, Michiel H. M. Smid |
Randomized and deterministic algorithms for geometric spanners of small diameter ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, 20-22 November 1994, pp. 703-712, 1994, IEEE Computer Society, 0-8186-6580-7. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
randomized algorithms, directed graph, deterministic algorithms, insertions, deletions, geometric spanners |
36 | Edith Cohen |
Fast algorithms for constructing t-spanners and paths with stretch t ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, pp. 648-658, 1993, IEEE Computer Society, 0-8186-4370-6. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
pairwise-covers, t-spanners constructions, paths with stretch, minimum-weight path, weighted undirected graph, exact shortest paths algorithms, randomized algorithm, deterministic algorithm, vertices, weighted graph |
34 | Mikkel Thorup, Uri Zwick |
Approximate distance oracles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 52(1), pp. 1-24, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Approximate distance oracles, distance queries, shortest paths, distances, spanners, distance labelings |
34 | Reuven Bar-Yehuda, Dror Rawitz |
Efficient Algorithms for Integer Programs with Two Variables per Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 29(4), pp. 595-609, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Well-separated pairs, Fault-tolerance, Computational geometry, Spanners |
31 | Glencora Borradaile, Hung Le 0001 |
Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.10633, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
31 | Shiri Chechik, Quentin Godfroy, David Peleg |
Multipath Spanners via Fault-Tolerant Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MedAlg ![In: Design and Analysis of Algorithms - First Mediterranean Conference on Algorithms, MedAlg 2012, Kibbutz Ein Gedi, Israel, December 3-5, 2012. Proceedings, pp. 108-119, 2012, Springer, 978-3-642-34861-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
31 | Quentin Godfroy |
From spanners to multipath spanners. (Des spanneurs aux spanneurs multichemins). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2012 |
RDF |
|
31 | Cyril Gavoille, Quentin Godfroy, Laurent Viennot |
Node-Disjoint Multipath Spanners and their Relationship with Fault-Tolerant Spanners ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1109.2696, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
31 | Cyril Gavoille, Quentin Godfroy, Laurent Viennot |
Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
OPODIS ![In: Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings, pp. 143-158, 2011, Springer, 978-3-642-25872-5. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
31 | Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie |
Additive spanners and (alpha, beta)-spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 7(1), pp. 5:1-5:26, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
31 | Iyad A. Kanj, Ljubomir Perkovic, Ge Xia |
On Spanners and Lightweight Spanners of Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 39(6), pp. 2132-2161, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
29 | Mirela Damian, Nagesh Javali |
Distributed construction of low-interference spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 22(1), pp. 15-28, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Topology, Wireless ad hoc network, Interference, Spanner, Unit disk graph |
29 | Iyad A. Kanj |
On Spanners of Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAMC ![In: Theory and Applications of Models of Computation, 6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings, pp. 49-58, 2009, Springer, 978-3-642-02016-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
29 | Surender Baswana, Soumojit Sarkar |
Fully dynamic algorithm for graph spanners with poly-logarithmic update time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 1125-1134, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
29 | Prosenjit Bose, Paz Carmi, Mathieu Couture |
Spanners of Additively Weighted Point Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 367-377, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
29 | Michael Elkin, Jian Zhang 0004 |
Efficient algorithms for constructing (1+epsilon, beta)-spanners in the distributed and streaming models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Distributed Comput. ![In: Distributed Comput. 18(5), pp. 375-385, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Almost shortest paths, Streaming model, Spanner |
29 | T.-H. Hubert Chan, Anupam Gupta 0001 |
Small hop-diameter sparse spanners for doubling metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 70-78, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Feodor F. Dragan, Chenyu Yan |
Network Flow Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 410-422, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
29 | Giorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano |
Small Stretch Spanners on Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2005, 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 532-543, 2005, Springer, 3-540-29118-0. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Derek G. Corneil, Feodor F. Dragan, Ekkehard Köhler, Chenyu Yan |
Collective Tree 1-Spanners for Interval Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 151-162, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Prosenjit Bose, Joachim Gudmundsson, Michiel H. M. Smid |
Constructing Plane Spanners of Bounded Degree and Low Weight. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2002, 10th Annual European Symposium, Rome, Italy, September 17-21, 2002, Proceedings, pp. 234-246, 2002, Springer, 3-540-44180-8. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Guy Kortsarz |
On the Hardness of Approximating Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 30(3), pp. 432-450, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Menelaos I. Karavelas, Leonidas J. Guibas |
Static and kinetic geometric spanners with applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 168-176, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
29 | Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh |
I/O-Efficient Shortest Path Queries in Geometric Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 287-299, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Dagmar Handke, Guy Kortsarz |
Tree Spanners for Subgraphs and Related Tree Covering Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 206-217, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
29 | Matthias Fischer 0001, Tamás Lukovszki, Martin Ziegler 0001 |
Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA '98, 6th Annual European Symposium, Venice, Italy, August 24-26, 1998, Proceedings, pp. 163-174, 1998, Springer, 3-540-64848-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Sándor P. Fekete, Jana Kremer |
Tree Spanners in Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 298-309, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Guy Kortsarz |
On the Hardness of Approximation Spanners. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX ![In: Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings, pp. 135-146, 1998, Springer, 3-540-64736-8. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Christian Laforest, Arthur L. Liestman, Thomas C. Shermer, Dominique Sotteau |
Edge Disjoint Graph Spanners of Complete Graphs and Complete Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HICSS (1) ![In: 30th Annual Hawaii International Conference on System Sciences (HICSS-30), 7-10 January 1997, Maui, Hawaii, USA, pp. 191-199, 1997, IEEE Computer Society, 0-8186-7734-1. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Weifa Liang, Richard P. Brent |
Constructing the Spanners of Graphs in Parallel. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPPS ![In: Proceedings of IPPS '96, The 10th International Parallel Processing Symposium, April 15-19, 1996, Honolulu, Hawaii, USA, pp. 206-210, 1996, IEEE Computer Society, 0-8186-7255-2. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
29 | Ingo Althöfer, Gautam Das 0001, David P. Dobkin, Deborah Joseph |
Generating Sparse Spanners for Weighted Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 90, 2nd Scandinavian Workshop on Algorithm Theory, Bergen, Norway, July 11-14, 1990, Proceedings, pp. 26-37, 1990, Springer, 3-540-52846-6. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid |
Computing the Greedy Spanner in Near-Quadratic Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2008, 11th Scandinavian Workshop on Algorithm Theory, Gothenburg, Sweden, July 2-4, 2008, Proceedings, pp. 390-401, 2008, Springer, 978-3-540-69900-2. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
28 | Jörg Derungs, Riko Jacob, Peter Widmayer |
Approximate Shortest Paths Guided by a Small Index. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 10th International Workshop, WADS 2007, Halifax, Canada, August 15-17, 2007, Proceedings, pp. 553-564, 2007, Springer, 978-3-540-73948-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Hubert Tsz-Hong Chan, Anupam Gupta 0001, Bruce M. Maggs, Shuheng Zhou |
On hierarchical routing in doubling metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005, Vancouver, British Columbia, Canada, January 23-25, 2005, pp. 762-771, 2005, SIAM, 0-89871-585-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
28 | Michael Elkin |
Computing almost shortest paths. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, PODC 2001, Newport, Rhode Island, USA, August 26-29, 2001, pp. 53-62, 2001, ACM, 1-58113-383-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Mohammad Ali Abam, Sariel Har-Peled |
New constructions of SSPDs and their applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010, pp. 192-200, 2010, ACM, 978-1-4503-0016-2. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
separated pair decomposition, separators, geometric spanners |
20 | Pascal von Rickenbach, Roger Wattenhofer, Aaron Zollinger |
Algorithmic models of interference in wireless ad hoc and sensor networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE/ACM Trans. Netw. ![In: IEEE/ACM Trans. Netw. 17(1), pp. 172-185, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
network spanners, modeling, interference, topology control, network connectivity, algorithmic analysis |
20 | Mohammad Ali Abam, Mark de Berg, Joachim Gudmundsson |
A simple and efficient kinetic spanner. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 306-310, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
kinetic data structures, geometric spanners |
20 | Surender Baswana, Sandeep Sen |
Approximate distance oracles for unweighted graphs in expected O(n2) time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 2(4), pp. 557-577, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Approximate distance oracles, distance queries, shortest paths, distances, spanners |
20 | Mirela Damian, Saurav Pandit, Sriram V. Pemmaraju |
Local approximation schemes for topology control. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, Denver, CO, USA, July 23-26, 2006, pp. 208-217, 2006, ACM, 1-59593-384-0. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
wireless ad-hoc networks, topology control, spanners, unit ball graphs |