Louis Petingi

According to our database1, Louis Petingi authored at least 10 papers between 1996 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Graph-Theoretic Partitioning of RNAs and Classification of Pseudoknots.
Proceedings of the Algorithms for Computational Biology - 6th International Conference, 2019

2011
Polynomial-Time Topological Reductions That Preserve the Diameter Constrained Reliability of a Communication Network.
IEEE Trans. Reliab., 2011

2009
Packing the Steiner trees of a graph.
Networks, 2009

2006
On the characterization of the domination of a diameter-constrained network reliability model.
Discret. Appl. Math., 2006

2004
Reliability of communication networks with delay constraints: computational complexity and complete topologies.
Int. J. Math. Math. Sci., 2004

Domination Invariant of a Diameter Constrained Network Reliability Model.
Electron. Notes Discret. Math., 2004

2002
A new technique for the characterization of graphs with a maximum number of spanning trees.
Discret. Math., 2002

1998
On the characterization of graphs with maximum number of spanning trees.
Discret. Math., 1998

1997
Generalized Edge-Toughness.
Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997

1996
Uniformly least reliable graphs.
Networks, 1996


  Loading...