• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 21 matches

• 2025
• 
  Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth:
  Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. SoCG 2025: 17:1-17:15
• 
  Sujoy Bhore, Timothy M. Chan, Zhengcheng Huang, Shakhar Smorodinsky, Csaba D. Tóth:
  Sparse Bounded Hop-Spanners for Geometric Intersection Graphs. CoRR abs/2504.05861 (2025)
• 2024
• 
  Renzo Gómez, Flávio Keidi Miyazawa, Yoshiko Wakabayashi:
  Polynomial algorithms for sparse spanners on subcubic graphs. J. Comb. Optim. 48(1): 11 (2024)
• 
  Reut Levi, Moti Medina, Omer Tubul:
  Nearly Optimal Local Algorithms for Constructing Sparse Spanners of Clusterable Graphs. APPROX/RANDOM 2024: 60:1-60:21
• 2022
• 
  Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
  Sparse hop spanners for unit disk graphs. Comput. Geom. 100: 101808 (2022)
• 2020
• 
  Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
  Sparse Hop Spanners for Unit Disk Graphs. ISAAC 2020: 57:1-57:17
• 
  Adrian Dumitrescu, Anirban Ghosh, Csaba D. Tóth:
  Sparse Hop Spanners for Unit Disk Graphs. CoRR abs/2002.07840 (2020)
• 2016
• 
  Michael Elkin:
  Sparse Graph Spanners. Encyclopedia of Algorithms 2016: 2041-2043
• 2011
• 
  Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
  Spanners in sparse graphs. J. Comput. Syst. Sci. 77(6): 1108-1119 (2011)
• 
  Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
  Approximation of minimum weight spanners for sparse graphs. Theor. Comput. Sci. 412(8-10): 846-852 (2011)
• 2008
• 
  Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
  Spanners in Sparse Graphs. ICALP (1) 2008: 597-608
• 
  Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach:
  A PTAS for the Sparsest Spanners Problem on Apex-Minor-Free Graphs. MFCS 2008: 290-298
• 
  Michael Elkin:
  Sparse Graph Spanners. Encyclopedia of Algorithms 2008
• 2007
• 
  Surender Baswana, Sandeep Sen:
  A simple and linear time randomized algorithm for computing sparse spanners in weighted graphs. Random Struct. Algorithms 30(4): 532-563 (2007)
• 2005
• 
  Victor Chepoi, Feodor F. Dragan, Chenyu Yan:
  Additive sparse spanners for graphs with bounded length of largest induced cycle. Theor. Comput. Sci. 347(1-2): 54-75 (2005)
• 2004
• 
  Yon Dourisboure, Cyril Gavoille:
  Sparse Additive Spanners for Bounded Tree-Length Graphs. SIROCCO 2004: 123-137
• 1995
• 
  Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
  New sparseness results on graph spanners. Int. J. Comput. Geom. Appl. 5: 125-144 (1995)
• 1994
• 
  Barun Chandra:
  Constructing Sparse Spanners for Most Graphs in Higher Dimensions. Inf. Process. Lett. 51(6): 289-294 (1994)
• 1993
• 
  Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph, José Soares:
  On Sparse Spanners of Weighted Graphs. Discret. Comput. Geom. 9: 81-100 (1993)
• 1992
• 
  Barun Chandra, Gautam Das, Giri Narasimhan, José Soares:
  New Sparseness Results on Graph Spanners. SCG 1992: 192-201
• 1990
• 
  Ingo Althöfer, Gautam Das, David P. Dobkin, Deborah Joseph:
  Generating Sparse Spanners for Weighted Graphs. SWAT 1990: 26-37