|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 149 occurrences of 81 keywords
|
|
|
Results
Found 845 publication records. Showing 845 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Srinivasa Rao Arikati, Danny Z. Chen, L. Paul Chew, Gautam Das 0001, Michiel H. M. Smid, Christos D. Zaroliagis |
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane. |
ESA |
1996 |
DBLP DOI BibTeX RDF |
|
15 | Danny Z. Chen, Gautam Das 0001, Michiel H. M. Smid |
Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths. |
CCCG |
1996 |
DBLP BibTeX RDF |
|
15 | Rabah Harbane, Carles Padró |
Spanners of Underlying Graphs of Iterated Line Digraphs. |
SIROCCO |
1996 |
DBLP BibTeX RDF |
|
15 | Leizhen Cai, Derek G. Corneil |
Tree Spanners. |
SIAM J. Discret. Math. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Arthur L. Liestman, Thomas C. Shermer |
Degree-Constrained Network Spanners with Nonconstant Delay. |
SIAM J. Discret. Math. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Dana S. Richards, Arthur L. Liestman |
Degree-Constrained Pyramid Spanners. |
J. Parallel Distributed Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Barun Chandra, Gautam Das 0001, Giri Narasimhan, José Soares |
New sparseness results on graph spanners. |
Int. J. Comput. Geom. Appl. |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Sunil Arya, Gautam Das 0001, David M. Mount, Jeffrey S. Salowe, Michiel H. M. Smid |
Euclidean spanners: short, thin, and lanky. |
STOC |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Barun Chandra |
Constructing Sparse Spanners for Most Graphs in Higher Dimensions. |
Inf. Process. Lett. |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Leizhen Cai, J. Mark Keil |
Spanners in graphs of bounded degree. |
Networks |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Guy Kortsarz, David Peleg |
Generating Sparse 2-Spanners. |
J. Algorithms |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Guy Kortsarz, David Peleg |
Generating Low-Degree 2-Spanners. |
SODA |
1994 |
DBLP DOI BibTeX RDF |
|
15 | Leizhen Cai, J. Mark Keil |
Degree-Bounded Spanners. |
Parallel Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Ingo Althöfer, Gautam Das 0001, David P. Dobkin, Deborah Joseph, José Soares |
On Sparse Spanners of Weighted Graphs. |
Discret. Comput. Geom. |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Arthur L. Liestman, Thomas C. Shermer |
Grid spanners. |
Networks |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Arthur L. Liestman, Thomas C. Shermer |
Additive graph spanners. |
Networks |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Gautam Das 0001, Paul J. Heffernan |
Constructing Degree-3 Spanners with Other Sparseness Properties. |
ISAAC |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Gautam Das 0001, Paul J. Heffernan, Giri Narasimhan |
Optimally Sparse Spanners in 3-Dimensional Euclidean Space. |
SCG |
1993 |
DBLP DOI BibTeX RDF |
|
15 | Guy Kortsarz, David Peleg |
Generating Sparse 2-spanners. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
15 | Leizhen Cai |
Tree spanners, spanning trees that approximate distances. |
|
1992 |
RDF |
|
15 | Arthur L. Liestman, Thomas C. Shermer |
Additive Spanners for Hypercubes. |
Parallel Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
15 | David Peleg, Alejandro A. Schäffer |
Graph spanners. |
J. Graph Theory |
1989 |
DBLP DOI BibTeX RDF |
|
14 | Pegah Kamousi, Timothy M. Chan, Subhash Suri |
Stochastic minimum spanning trees in euclidean spaces. |
SCG |
2011 |
DBLP DOI BibTeX RDF |
|
14 | A. Karim Abu-Affash, Paz Carmi, Matthew J. Katz, Michael Segal 0001 |
The euclidean bottleneck steiner path problem. |
SCG |
2011 |
DBLP DOI BibTeX RDF |
|
14 | Sandeep Sen |
Approximating Shortest Paths in Graphs. |
WALCOM |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Quansheng Guan, Quanlong Ding, Shengming Jiang |
A minimum energy path topology control algorithm for wireless multihop networks. |
IWCMC |
2009 |
DBLP DOI BibTeX RDF |
minimum energy path, topology control, energy-saving |
14 | Michiel H. M. Smid |
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension. |
Efficient Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
14 | Liam Roditty, Michael Segal 0001 |
On bounded leg shortest paths problems. |
SODA |
2007 |
DBLP BibTeX RDF |
|
14 | Flore Barcellini, Françoise Détienne, Jean-Marie Burkhardt |
Cross-participants: fostering design-use mediation in an open source software community. |
ECCE |
2007 |
DBLP DOI BibTeX RDF |
design-use mediation, distributed participatory design, open source, online community |
14 | C. N. Kanthi, Bijendra N. Jain |
Spanner Based Distributed Channel Assignment in Wireless Mesh Networks. |
COMSWARE |
2007 |
DBLP DOI BibTeX RDF |
|
14 | Bilel Derbel, Mohamed Mosbah 0001, Akka Zemmari |
Fast distributed graph partition and application. |
IPDPS |
2006 |
DBLP DOI BibTeX RDF |
|
14 | Don Coppersmith, Michael Elkin |
Sparse source-wise and pair-wise distance preservers. |
SODA |
2005 |
DBLP BibTeX RDF |
|
14 | Mattias Andersson 0002, Joachim Gudmundsson, Christos Levcopoulos |
Approximate Distance Oracles for Graphs with Dense Clusters. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
14 | Marc Benkert, Alexander Wolff 0001, Florian Widmann |
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation. |
JCDCG |
2004 |
DBLP DOI BibTeX RDF |
|
14 | Filipe Araújo, Luís E. T. Rodrigues |
Fast Localized Delaunay Triangulation. |
OPODIS |
2004 |
DBLP DOI BibTeX RDF |
Location-based routing schemes, Wireless ad hoc networks, Delaunay triangulation |
14 | Surender Baswana, Sandeep Sen |
A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n1+1/k) Size in Weighted Graphs. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
Randomized algorithms, Shortest path, Graph algorithms |
14 | Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh |
Approximating Geometric Bottleneck Shortest Paths. |
STACS |
2003 |
DBLP DOI BibTeX RDF |
|
14 | Christian Schindelhauer, Tamás Lukovszki, Stefan Rührup, Klaus Volbert |
Worst case mobility in ad hoc networks. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
mobility, wireless networks, network topologies |
14 | Mark Lanthier, Anil Maheshwari, Jörg-Rüdiger Sack |
Approximating Shortest Paths on Weighted Polyhedral Surfaces. |
Algorithmica |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Michael Elkin, David Peleg |
Approximating k-Spanner Problems for k>2. |
IPCO |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Mikkel Thorup, Uri Zwick |
Approximate distance oracles. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Tamás Lukovszki, Anil Maheshwari, Norbert Zeh |
I/O-Efficient Batched Range Counting and Its Applications to Proximity Problems. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
14 | Artur Czumaj, Andrzej Lingas |
Fast Approximation Schemes for Euclidean Multi-connectivity Problems. |
ICALP |
2000 |
DBLP DOI BibTeX RDF |
|
14 | Serafino Cicerone, Gabriele Di Stefano, Dagmar Handke |
Survivable Networks with Bounded Delay: The Edge Failure Case. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
14 | Yuri Rabinovich, Ran Raz |
Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. |
Discret. Comput. Geom. |
1998 |
DBLP DOI BibTeX RDF |
|
Displaying result #801 - #845 of 845 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9] |
|