28 papers:
ICALP-v1-2015-GrosseGKSS #algorithm #performance- Fast Algorithms for Diameter-Optimally Augmenting Paths (UG, JG, CK, MHMS, FS), pp. 678–688.
- ICALP-v2-2015-FriedrichK #graph #on the #random
- On the Diameter of Hyperbolic Random Graphs (TF, AK), pp. 614–625.
LATA-2015-Panteleev #sequence- Preset Distinguishing Sequences and Diameter of Transformation Semigroups (PP), pp. 353–364.
STOC-2013-RodittyW #algorithm #approximate #graph #performance- Fast approximation algorithms for the diameter and radius of sparse graphs (LR, VVW), pp. 515–524.
- ICALP-v1-2013-WeimannY #approximate #graph #linear
- Approximating the Diameter of Planar Graphs in Near Linear Time (OW, RY), pp. 828–839.
- ICALP-v1-2012-ChanLN #bound #fault tolerance #metric
- Sparse Fault-Tolerant Spanners for Doubling Metrics with Bounded Hop-Diameter or Degree (THHC, ML, LN), pp. 182–193.
- ICALP-v2-2012-PelegRT #algorithm #distributed #network
- Distributed Algorithms for Network Diameter and Girth (DP, LR, ET), pp. 660–672.
ICML-2012-WangC12a #clustering- Clustering to Maximize the Ratio of Split to Diameter (JW, JC), p. 74.
CIKM-2011-TakesK #network- Determining the diameter of small world networks (FWT, WAK), pp. 1191–1196.
HCI-NT-2009-GaoBA #assessment #monitoring- Monitoring and Processing of the Pupil Diameter Signal for Affective Assessment of a Computer User (YG, AB, MA), pp. 49–58.
HPCA-2009-XuDZZZY #3d #design #network- A low-radix and low-diameter 3D interconnection network design (YX, YD, BZ, XZ, YZ, JY), pp. 30–42.
KDD-2005-LeskovecKF #graph- Graphs over time: densification laws, shrinking diameters and possible explanations (JL, JMK, CF), pp. 177–187.
SAT-J-2004-TangYRM05 #algorithm #analysis #problem #quantifier #satisfiability- Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 292–305.
DATE-v1-2004-BaumgartnerK #bound- Enhanced Diameter Bounding via Structural (JB, AK), pp. 36–41.
- ICALP-2004-ArgeMT #algorithm #graph #memory management
- External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs (LA, UM, LT), pp. 146–157.
SAT-2004-TangYRM #algorithm #analysis #problem #quantifier #satisfiability- Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems (DT, YY, DR, SM), pp. 214–223.
SAC-2003-RaidlJ #algorithm #bound #heuristic #problem- Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem (GRR, BAJ), pp. 747–752.
VMCAI-2003-KroeningS #performance- Efficient Computation of Recurrence Diameters (DK, OS), pp. 298–309.
- STOC-2001-CharikarP #clustering
- Clustering to minimize the sum of cluster diameters (MC, RP), pp. 1–10.
- SAC-1999-HarwoodS #low cost #network
- A Method of Trading Diameter for Reduced Degree to Construct Low Cost Interconnection Networks (AH, HS), pp. 474–480.
- SAC-1999-Shen #estimation
- Average Diameter and Its Estimation in Non-Linear Structures (ZS), pp. 489–490.
- SAC-1998-Shen #estimation #network
- Average diameter of network structures and its estimation (ZS), pp. 593–597.
- ICALP-1997-AlstrupHLT
- Minimizing Diameters of Dynamic Trees (SA, JH, KdL, MT), pp. 270–280.
- SAC-1997-Shen
- The average diameter of binary tree structures (ZS), pp. 40–44.
- STOC-1995-KleinbergT #approximate #network #problem
- Approximations for the disjoint paths problem in high-diameter planar networks (JMK, ÉT), pp. 26–35.
- ICALP-1994-ItalianoR #maintenance
- Maintaining Spanning Trees of Small Diameter (GFI, RR), pp. 227–238.
- STOC-1993-MatousekS #3d #algorithm #problem
- A deterministic algorithm for the three-dimensional diameter problem (JM, OS), pp. 478–484.
- STOC-1983-DriscollF #on the #permutation
- On the Diameter of Permutation Groups (JRD, MLF), pp. 152–160.
