| Limits in Modeling Power Grid Topology B Cloteaux IEEE 2nd International Workshop on Network Science, 16 - 22, 2013 | 21 | 2013 |
| Fast Sequential Creation of Random Realizations of Degree Sequences B Cloteaux Internet Mathematics 12 (3), 205-219, 2016 | 18 | 2016 |
| An Approximation Algorithm for the Coefficients of the Reliability Polynomial I Beichl, B Cloteaux, F Sullivan Congressus Numerantium 197, 143-151, 2009 | 13 | 2009 |
| Measuring the effectiveness of the s-metric to produce better network models I Beichl, B Cloteaux Winter Simulation Conference (WSC), 1020-1028, 2008 | 13 | 2008 |
| Some separation results between classes of pointer algorithms B Cloteaux, D Ranjan Workshop on Descriptional Complexity of Formal Systems (DCFS) 6, 232-240, 2006 | 8 | 2006 |
| Threshold Digraphs B Cloteaux, MD LaMar, E Moseman, J Shook Journal of Research of NIST 119, 227-234, 2014 | 7 | 2014 |
| Approximating the Number of Bases for Almost All Matroids B Cloteaux Congressus Numerantium 202, 149-153, 2010 | 7 | 2010 |
| From ordered beliefs to numbers: How to elicit numbers without asking for them(doable but computationally difficult) B Cloteaux, C Eick, B Bouchon-Meunier, V Kreinovich International Journal of Intelligent Systems 13 (9), 801-820, 1998 | 7 | 1998 |
| Generating Network Models Using the S-Metric. I Beichl, B Cloteaux MSV, 159-164, 2008 | 6 | 2008 |
| Extracting Hierarchies With Overlapping Structure From Network Data B Cloteaux Winter Simulation Conference (WSC), 3335-3343, 2011 | 5 | 2011 |
| Modeling affiliations in networks B Cloteaux Winter Simulation Conference (WSC), 2958-2967, 2010 | 5 | 2010 |
| Counting the Leaves of Trees B Cloteaux, LA Valentin Congressus Numerantium 207, 129-139, 2011 | 3 | 2011 |
| Is this for real? Fast graphicality testing B Cloteaux Computing in Science & Engineering 17 (6), 91-95, 2015 | 2 | 2015 |
| On the Performance of Automatic Exposure Determination Using Bluetooth-based Proximity Estimation K Sayrafian, B Cloteaux, V Marbukh ICC 2022-IEEE International Conference on Communications, 3052-3057, 2022 | 1 | 2022 |
| Forced Edges and Graph Structure B Cloteaux Journal of Research of NIST 124, paper 22, 2019 | 1 | 2019 |
| SIS Contagion Avoidance on a Network Growing by Preferential Attachment B Cloteaux, V Marbukh GRADES-NDA 2019, Paper 11, 2019 | 1 | 2019 |
| A Sufficient Condition for Graphic Sequences with Given Largest and Smallest Entries, Length, and Sum B Cloteaux Discrete Mathematics and Theoretical Computer Science 20 (1), Paper 25, 2018 | 1 | 2018 |
| Impact of Using Soft Exposure Thresholds in Automatic Contact Tracing K Sayrafian, B Cloteaux, V Marbukh 2022 IEEE International Conference on E-health Networking, Application …, 2022 | | 2022 |
| Evaluation of the Bluetooth-based Proximity Estimation for Automatic Exposure Determination K Sayrafian, B Cloteaux, V Marbukh, C Emiyah 2022 IEEE 19th Annual Consumer Communications & Networking Conference (CCNC …, 2022 | | 2022 |
| How Much Regularity Forces a Sequence to be Graphic? B Cloteaux arXiv preprint arXiv:2009.07135, 2020 | | 2020 |
Francis SullivanIDA Center for Computing SciencesVerified email at super.org
