PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Protti, Fábio"

Author of the publication

copydeleteadd this publication to your clipboard
Clique-inverse graphs of K3-free and K4-free graphs.

, and . Journal of Graph Theory, 35 (4): 257-272 (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Fabio Musco University of Stuttgart

Fabio Magnago Lampugnani University of Stuttgart

 

Other publications of authors with the same name

Structured construction and simulation of nondeterministic stochastic activity networks., , , , , and . European Journal of Operational Research, 198 (1): 266-274 (2009)Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs., and . Discrete Mathematics & Theoretical Computer Science, (2018)Optimal grid representations., , , and . Networks, 44 (3): 187-193 (2004)Towards a Novel Statistical Method for Generating Test Sets with a Given Coverage Probability., , , and . SEKE, page 06-07. Knowledge Systems Institute Graduate School, (2011)A Novel Distributed Scheduling Algorithm for Resource Sharing Under Near-Heavy Load., , , and . OPODIS, volume 3544 of Lecture Notes in Computer Science, page 431-442. Springer, (2004)Algorithmic aspects of Steiner convexity and enumeration of Steiner trees., , and . Annals OR, 223 (1): 155-171 (2014)On the geodetic iteration number of distance-hereditary graphs., , , and . Discrete Mathematics, 339 (2): 489-498 (2016)An energy function and its application to the periodic behavior of k-reversible processes., , and . CoRR, (2013)V Latin-American Algorithms, Graphs, and Optimization Symposium - Gramado, Brazil, 2009., , and . Discrete Applied Mathematics, 160 (18): 2499-2501 (2012)SUTIL - Network selection based on utility function and integer linear programming., , , , , , and . Computer Networks, 54 (13): 2117-2136 (2010)