| Reconstructing binary trees in parallel R Afshar, MT Goodrich, P Matias, MC Osegueda Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 10 | 2020 |
| Reconstructing biological and digital phylogenetic trees in parallel R Afshar, MT Goodrich, P Matias, MC Osegueda arXiv preprint arXiv:2006.15259, 2020 | 10 | 2020 |
| How to transform partial order between degrees into numerical values O Kosheleva, V Kreinovich, J Lorkowski, M Osegueda 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC …, 2016 | 10 | 2016 |
| Towards the most robust way of assigning numerical degrees to ordered labels, with possible applications to dark matter and dark energy O Kosheleva, V Kreinovich, MO Escobar, K Kato 2016 Annual Conference of the North American Fuzzy Information Processing …, 2016 | 8 | 2016 |
| Parallel network mapping algorithms R Afshar, MT Goodrich, P Matias, MC Osegueda Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 6 | 2021 |
| Angles of arc-polygons and Lombardi drawings of cacti D Eppstein, D Frishberg, MC Osegueda Computational Geometry 112, 101982, 2023 | 5 | 2023 |
| Mapping networks via parallel kth-hop traceroute queries R Afshar, MT Goodrich, P Matias, MC Osegueda 39th International Symposium on Theoretical Aspects of Computer Science …, 2022 | 4 | 2022 |
| Concatenation arguments and their applications to polyominoes and polycubes G Barequet, G Ben-Shachar, MC Osegueda Computational Geometry 98, 101790, 2021 | 4 | 2021 |
| Minimum-width drawings of phylogenetic trees JJ Besa, MT Goodrich, T Johnson, MC Osegueda Combinatorial Optimization and Applications: 13th International Conference …, 2019 | 3 | 2019 |
| On the number of compositions of two polycubes A Asinowski, G Barequet, G Ben-Shachar, MC Osegueda, G Rote Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021 | 1 | 2021 |
| Is It Legitimate Statistics or Is It Sexism: Why Discrimination Is Not Rational MO Escobar, V Kreinovich, TN Nguyen Econometrics for Financial Applications, 235-242, 2018 | 1 | 2018 |
| How to compute von Neumann-Morgenstern solutions EM Osegueda, K Vladik Математические структуры и моделирование, 68-73, 2016 | 1 | 2016 |
| Diamonds are Forever in the Blockchain: Geometric Polyhedral Point-Set Pattern Matching G Barequet, S Fukuzawa, MT Goodrich, DM Mount, MC Osegueda, E Ozel arXiv preprint arXiv:2208.05597, 2022 | | 2022 |
| Taming the knight's tour: Minimizing turns and crossings JJ Besa, T Johnson, N Mamano, MC Osegueda, P Williams Theoretical Computer Science 902, 1-20, 2022 | | 2022 |
| On the Number of Compositions of Two Polycubes MC Osegueda, G Rote Extended, 71, 2021 | | 2021 |
| HOW TO TEACH IMPLICATION EM Osegueda, O Kosheleva, V Kreinovich НИ Лобачевский и математическое образование в России, 193-195, 2017 | | 2017 |
| Fuzzy-inspired hierarchical version of the von Neumann-Morgenstern solutions as a natural way to resolve collaboration-related conflicts O Kosheleva, V Kreinovich, MO Escobar 2016 IEEE International Conference on Systems, Man, and Cybernetics (SMC …, 2016 | | 2016 |
| Von Neumann-Morgenstern Solutions, Quantum Physics, and Stored Programs vs. Data: Unity of Von Neumann's Legacy O Kosheleva, MO Escobar, V Kreinovich | | 2016 |
| Applications of Concatenation Arguments to Polyominoes and Polycubes G Barequet, G Ben-Shachar, MC Osegueda | | |
