PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Versari, Luca"

Author of the publication

copydeleteadd this publication to your clipboard
Listing Maximal Subgraphs Satisfying Strongly Accessible Properties.

, , , and . SIAM J. Discrete Math., 33 (2): 587-613 (2019)

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.

Luca Remke University of Stuttgart

Luca Di Grazia University of Stuttgart

Philipp Luca Reiser University of Stuttgart

Dr. Simone Luca Portalupi University of Stuttgart

Gian-Luca Iglesias Lopez University of Stuttgart

 

Other publications of authors with the same name

Discovering $k$-Trusses in Large-Scale Networks., , , , and . HPEC, page 1-6. IEEE, (2018)Efficient Algorithms for Listing k Disjoint st-Paths in Graphs., , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 544-557. Springer, (2018)Finding Maximal Common Subgraphs via Time-Space Efficient Reverse Search., , , and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 328-340. Springer, (2018)Temporal coding in spiking neural networks with alpha synaptic function., , , , , and . CoRR, (2019)Round-Hashing for Data Storage: Distributed Servers and External-Memory Tables., and . ESA, volume 112 of LIPIcs, page 43:1-43:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Tight Lower Bounds for the Number of Inclusion-Minimal st-Cuts., , , , , and . WG, volume 11159 of Lecture Notes in Computer Science, page 100-110. Springer, (2018)A Fast Algorithm for Large Common Connected Induced Subgraphs., , , , and . AlCoB, volume 10252 of Lecture Notes in Computer Science, page 62-74. Springer, (2017)On-Line Pattern Matching on Similar Texts., , , , , , , , and . CPM, volume 78 of LIPIcs, page 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Listing Subgraphs by Cartesian Decomposition., , , , and . MFCS, volume 117 of LIPIcs, page 84:1-84:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Directing Road Networks by Listing Strong Orientations., , , , and . IWOCA, volume 9843 of Lecture Notes in Computer Science, page 83-95. Springer, (2016)