- Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ICALP 2018: 109:1-109:4 - Taiga Kawaguchi, Takuya Yoshino, Kouichi Hirata:
Earth Mover's Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees. ICPRAM (Revised Selected Papers) 2018: 65-88 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
Complete Axiomatization for the Total Variation Distance of Markov Chains. MFPS 2018: 27-39 - 2017
- Alfredo Donno:
Spectrum, distance spectrum, and Wiener index of wreath products of complete graphs. Ars Math. Contemp. 13(1): 207-225 (2017) - Josep Rifà, Victor A. Zinoviev:
Completely regular codes with different parameters giving the same distance-regular coset graphs. Discret. Math. 340(7): 1649-1656 (2017) - Ludmila Yu. Tsiovkina:
Arc-transitive antipodal distance-regular covers of complete graphs related to SU3(q). Discret. Math. 340(2): 63-71 (2017) - Avishek Choudhury, Biplab K. Sikdar:
CIFR: A complete in-place fault remapping strategy for CMP cache using dynamic reuse distance. ISED 2017: 1-5 - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
A Complete Quantitative Deduction System for the Bisimilarity Distance on Markov Chains. CoRR abs/1702.02528 (2017) - Daniel Graf, Karim Labib, Przemyslaw Uznanski:
Hamming distance completeness and sparse matrix multiplication. CoRR abs/1711.03887 (2017) - 2016
- Jinyan Fan, Anwa Zhou:
Computing the distance between the linear matrix pencil and the completely positive cone. Comput. Optim. Appl. 64(3): 647-670 (2016) - Severino Villanueva Gervacio:
Resistance distance in complete n-partite graphs. Discret. Appl. Math. 203: 53-61 (2016) - Daniel Kotlar:
Distance Magic Labeling in Complete 4-partite Graphs. Graphs Comb. 32(3): 1027-1038 (2016) - Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare:
Complete Axiomatization for the Bisimilarity Distance on Markov Chains. CONCUR 2016: 21:1-21:14 - 2015
- Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
Families of nested completely regular codes and distance-regular graphs. Adv. Math. Commun. 9(2): 233-246 (2015) - Anna Lubiw, Vinayak Pathak:
Flip distance between two triangulations of a point set is NP-complete. Comput. Geom. 49: 17-23 (2015) - Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. Discret. Comput. Geom. 54(2): 368-389 (2015) - Veronika Halász, Zsolt Tuza:
Distance-constrained labeling of complete trees. Discret. Math. 338(8): 1398-1406 (2015) - Richard Altendorfer, Sebastian J. Wirkert:
A Complete Derivation Of The Association Log-Likelihood Distance For Multi-Object Tracking. CoRR abs/1508.04124 (2015) - 2014
- Nathaniel J. Karst, Jessica Oehrlein, Denise Sakai Troxell, Junjie Zhu:
Labeling amalgamations of Cartesian products of complete graphs with a condition at distance two. Discret. Appl. Math. 178: 101-108 (2014) - Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
New families of completely regular codes and their corresponding distance regular coset graphs. Des. Codes Cryptogr. 70(1-2): 139-148 (2014) - Joaquim Borges, Josep Rifà, Victor A. Zinoviev:
Families of completely transitive codes and distance transitive graphs. Discret. Math. 324: 68-71 (2014) - 2013
- Neil I. Gillespie:
A note on binary completely regular codes with large minimum distance. Discret. Math. 313(14): 1532-1534 (2013) - Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance between Triangulations of a Simple Polygon is NP-Complete. ESA 2013: 13-24 - 2012
- Damei Lu, Wensong Lin, Zengmin Song:
Distance two labelings of Cartesian products of complete graphs. Ars Comb. 104: 33-40 (2012) - Hemant Kumar Nashine, Zoran Kadelburg, Zorana Golubovic:
Common Fixed Point Results Using Generalized Altering Distances on Orbitally Complete Ordered Metric Spaces. J. Appl. Math. 2012: 382094:1-382094:12 (2012) - Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point Set is NP-complete. CCCG 2012: 119-124 - Anna Lubiw, Vinayak Pathak:
Flip Distance Between Two Triangulations of a Point-Set is NP-complete. CoRR abs/1205.2425 (2012) - Alexander Pilz:
Flip Distance Between Triangulations of a Planar Point Set is NP-Complete. CoRR abs/1206.3179 (2012) - Oswin Aichholzer, Wolfgang Mulzer, Alexander Pilz:
Flip Distance Between Triangulations of a Simple Polygon is NP-Complete. CoRR abs/1209.0579 (2012) - Neil I. Gillespie:
A note on binary completely regular codes with large minimum distance. CoRR abs/1210.6459 (2012)