Petingi L. GraphTheoretic Partitioning of RNAs and Classification of PseudoknotsII. CUNY Academic Works. Internal Report (July 2021). Also in arXiv:2109.03236 [qbio.BM].

Petingi L., Schlick T. GraphTheoretic Partitioning of RNAs and Classification of Pseudoknots. In: Holmes I., MartínVide C., VegaRodríguez M. (eds) Algorithms for Computational Biology. AlCoB 2019. Lecture Notes in Computer Science (11488) . Springer, Cham

Jain S., Saju S., Petingi L., and Schlick T. An Extended Dual Graph Library and Partitioning Algorithm Applicable to Pseudoknotted RNA Structures , Methods , doi: 10.1016/j.ymeth.2019.03.022 (2019).

Petingi L., Gertsbakh IB., Wojcik S. Applying Parallelism to Calculate the Number of PathSets and CutSets of a Graph with Restricted Diameter Based on ConstructionDestruction Methods. J. Telecommun. Syst. Manage. 7:163 ,(2018).

Jain S., Bayrak C., Petingi L., Schlick T. Dual graph partitioning highlights a small group of pseudoknotcontaining RNA submotifs. Genes 9 (8) , (2018), pp. 371.

Petingi, L. A GraphTheoretical Approach for Partitioning
RNA Secondary Structures into Pseudonotted and
Pseudoknotfree Regions. Proceedings of the World Congress on Engineering and Computer Science 2016 (WCECS 2016) II , October 1921, 2016. Best Paper Award.

Petingi L., A GraphTheoretical Approach for Partitioning RNA Secondary Structures into Pseudonotted and Pseudoknotfree Regions, Lecture Notes in Engineering and Computer Science 2226 (1), pp. 533537.

Lapinski M., Lin H., McHugh M., Petingi L., Monte Carlo Techniques to Estimate the DiameterConstrained Reliability of Networks using Parallelism.
SIAM Undergraduate Research Online 9 (SIURO)  April 2015 (with undergraduates that participated at the NSF REU: Computational Methods in High Performance Computing with Applications to Computer Science, CSI2015).

Petingi L., Diameterrelated Properties of Graphs and Applications to Network Reliability Theory.
WSEAS Transactions on Math. 12(9), Special Issue: Reliability and Vulnerability Models and their Applications, Eds. L. Petingi and C. Suffel, (2013), pp. 884894.

Kim N., Petingi L., and Schlick T., Network Theory Tools for RNA Modeling.
WSEAS Transactions on Math. 12(9), Special Issue: Reliability and Vulnerability Models and their Applications, Eds. L. Petingi and C. Suffel, (2013), pp. 941955.

Petingi L., Efficient Evaluation of a Diameter Constrained Reliability Measure for a Family of Graphs, Graph Theory Notes of New York (LXIV), The Mathematical Association of America (MAA), (2013), pp. 2634.

Cancela H., El Khadiri M., L. Petingi, Polynomialtime Topological Reductions that preserve the Diameter Constrained Reliability of a Communication Network.
IEEE Transactions on Reliability 60(4), (2011), pp. 845851.

Petingi L., Application of the Classical Reliability to Address Optimization Problems in Mesh Networks.
International Journal of Communications 5(1), (2011), pp. 19.

Petingi L., Introduction of a New Network Reliability Model to Evaluate the Performance of Sensor Networks.
International Journal of Mathematical Models and Methods in Applied Sciences (5)3, (2011),pp. 577585.

Petingi L., Talafha, M., Packing the Steiner Trees of a Graph. Networks (54)2 ,
John Wiley & Sons. Special Issue in memory of Frank T. Boesch, 2009, pp. 9095. Invited Paper.

Petingi L., A DiameterConstrained Network Reliability model to determine the Probability that a
Communication Network meets Delay Constraints. WSEAS Transactions on Communications (7)6 , (2008),
pp. 574583. (Extended version of the best papers of the WSEAS Proceedings of Applied Computing Conference (ACC ’08)).

Gordonov A., Petingi L., An Approximation Algorithm for the Problem of Minimally Extending a Communication Network to Meet
an EndtoEnd Delay Constraints. Computing Letters (CoLe), Brill Academic Publishers, the Netherlands, (2008), 10 pages.

Gordonov A., Petingi L., Minimal Extension of a Communication Network to Meet an Endtoend Delay Constraints.
Lecture Series on Computer and Computational Sciences (8) , Brill Academic Publishers, the Netherlands, (2007),
pp. 7679 (ISBN 9789004155923).

Petingi L., Summary on the properties of the Spanning Forests of a Graph. Graph Theory Notes of New York LIII, New York Academy of Sciences (2007), pp. 2125.

Cancela H., Petingi L., Properties of a Generalized Sourcetoallterminal Network
Reliability Model with Diameter Constraints. Omega Journal, Special Issue in Communications (35)6 ,
Elsevier Science (NorthHolland) (2007), pp. 659670.

Cancela H., Petingi L., On the Characterization of the Domination of a Diameter Constraint Network Reliability Model.
Discrete Applied Mathematics (154)13, (2006), pp. 18851896.

Cancela H., Petingi L., Domination Invariant of a Diameter Constrained Network Reliability Model.
Electronic Notes in Discrete Mathematics (18), Elsevier Science (NorthHolland), (2004), pp.5358.

Cancela H., Petingi L.,Reliability of Communication Networks with Delay Constraints: Computational Complexity and Complete Topologies. International Journal of Mathematics and Mathematical Sciences (2004)29, (2004), pp. 15511562.

Petingi L., Rodriguez J., A New Technique for the Characterization of Graphs with Maximum Number of Spanning Trees. Discrete Mathematics (244)13, (2002), pp. 351373.

Hobbs A., Petingi L., The WeightedEdge Case of Strength and Fractional Arboricity in Graphs. Congressus Numerantium (149), (2001), pp. 211222.

Petingi L., Rodriguez J., Reliability of Networks with Delay Contraints.Congressus Numerantium (152), (2001), pp. 117123.

Petingi L., Rodriguez J., A New Proof of the FisherRyan Bounds for the Number of Cliques of a Graph. Congressus Numerantium (146), (2000), pp. 143146.

Petingi L., Rodriguez J., Bounds on the Maximum Number of EdgeDisjoint Steiner Trees of a Graph. Congressus Numerantium (145), (2000), pp. 4352.

Petingi L., Rodriguez J., On the Conjecture that among all Graphs with n nodes and e edges, one with Maximum Number of Spanning Trees must be Almostregular. Congressus Numerantium (136), (1999), pp. 207214.

Petingi L., Boesch F., Suffel C., On the Characterization of Graphs with Maximum Number of Spanning Trees. Discrete Mathematics (179)13, (1998), pp.155166.

Rodriguez J., Petingi L. , A Sharp Upper Bound for the Number of Spanning Trees of a Graph. Congressus Numerantium (126), (1997), pp. 209217.

Rodriguez J., Petingi L., Graphs with Maximum Number of Spanning Trees and Optimally Reliable Graphs. Combinatorial Optimization(1) No 1, (1996), pp. 5768.

Petingi L., Saccoman J., Schoppmann L., Uniformly Least Reliable Graphs. Networks(27)2, John Wiley & Sons, (1996), pp. 125131.

REFEREED PROCEEDINGS

Gertsbakh I. B., L. Petingi L., and Wojcik S., Construction/Destruction Monte Carlo to Estimate the Number of Pathsets for the Reliability Measure of a Network with Diameter Constraints. Proceedings of Int'l Conf. Scientific Computing (CSC'17), (2017), Las Vegas, Nevada, pp. 5761. https://csce.ucmss.com/cr/books/2017/LFS/CSREA2017/CSC3416.pdf

Petingi L., A GraphTheoretical Approach for Partitioning RNA Secondary Structures into Pseudonotted and Pseudoknotfree Regions. Proceedings of the World Congress on Engineering and Computer Science (WCECS’16), (2016), UC BerkeleySan Francisco, CA. pp. 533537.

Petingi L., Addressing Optimization Problems in Sensor Networks via a New Network Reliability Model.
Third International Conference on the Internet and Applications (ITAP'12), Wuhan, China (August 2012). IEEE sponsored conference. Plenary Speaker.

Petingi L., Reliability Study of Mesh Networks Modeled as Random Graphs.
International Conference on Mathematical Models for Engineering Science (IEEEAM/MMES’10), Tenerife, Spain.
In Mathematical Models for Engineering Science, (2010), pp. 8593, ISBN: 9789604742523.

Petingi L., New Reliability Model and its Application to Assess the Performance of Sensor Networks.
International Conference on Mathematical Models for Engineering Science (IEEEAM/MMES’10) , Tenerife, Spain.
In Mathematical Models for Engineering Science, (2010), pp. 259266, ISBN: 9789604742523.

Cancela H., EL Khadiri M., Petingi L., An Exact Method to Evaluate the Sourcetoterminal Diameter Constrained Reliability of a Communication Network.
International Conference on Industrial Logistics (ICIL'10), Rio de Janeiro, Brazil, (2010), pp. 259266.

Petingi L., Combinatorial and Computational Properties of a Diameter Constrained
Network Reliability Model. Proceedings of the WSEAS Applied Computing Conference (ACC ’08),
Istanbul, Turkey, (2008), pp. 337345.

Gordonov A., Petingi L., Minimal Extension of a Communication Network to meet an endtoend delay
constraint,
International eConference of Computer Science 2006 (IeCCS 2006), Greece, 2006.

Burgos P., Cancela H., Godoy A., Petingi L., Sourceterminal reliability maximization with path length constraints.
International Conference on Industrial Logistics (ICIL'2003), Vaasa, Finland, 2003, pp. 7683.

Burgos P., Cancela H., Godoy A., Petingi L., Network Reliability Optimization with Sourceterminal Distance. Proceedings of the International Network Optimization
Conference (INOC'03), Paris, France, 2003, pp. 132137.

Cancela H. , Petingi L., On the Characterization of the Sourcetoallterminal Diameterconstrained reliability domination. Proceedings of the IX Argentine Congress on Computer Science (CACIC 2003), Argentina, 2003, pp. 15691580.

Cancela H., Petingi L., Network Reliability with Pathlength Constraints: Evaluation and Design Problems. Proceedings of the XI LatinIberian American Congress of Operations Research (CLAIO), Chile, 2002, (Proceedings in CDROM).

Cancela H., Petingi L., Polynomial time computation of the reliability of sourceterminal complete networks with path length restrictions. Proceedings of the XXIV LatinAmerican Conference on Informatics (CLEI), Uruguay, 2002, pp.2328.

Burgos P., Cancela H., Godoy A., Petingi L., Reliability maximization for networks with pathlength constraints. Proceedings of the XXXIV Brazilian Conference on Operations Research (SOBRAPO), Brazil, 2002, pp.15361544.

Cancela H., Petingi L., Network Reliability evaluation for delay constrained services. Proceedings of the Seventeenth International Teletraffic Congress. Brazil, 2001, pp. 5260.

Cancela H, Petingi L., Diameter constrained network reliability: exact evaluation by factorization and bounds.
Proceedings of the International Conference on Industrial Logistics, Japan, 2001, pp. 359366.

Petingi L., Rodriguez J., A new Technique for the Characterization of Graphs with Maximum Number of Spanning trees. Proceedings of the Fourth Slovenian Conference on Graph Theory,, Slovenia, June 28, 1999.

Petingi L., Rodriguez J., Generalized EdgeToughness. XVII International Conference of the Chilean Computer Science Society, IEEE Computer Society (1997), pp. 174181.

Petingi L,, Urquhart M., Computation of two Communication Network Vulnerability Indexes. VIII Congreso LatinoIberoamericano de Investigacion Operativa CLAIO (Operations Research), Brasil, (1996), pp. 718727.

Lezcano R., Petingi L., Urquhart M., Viera O., Vehicle Routing Techniques Applied to a Specific Distribution Management Problem. Proceedings of the International Conference On Industrial Logistics, Ouro Preto, Brasil, 1995. University of Southampton, UK, and Naval Monterrey School, USA.
