Murilo V. G. da Silva

Orcid: 0000-0002-3392-714X

Affiliations:
  • Federal University of Technology Parana (UFPR), DAINF, Curitiba, Brazil


According to our database1, Murilo V. G. da Silva authored at least 28 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs.
J. Graph Algorithms Appl., 2023

2022
Percolation centrality via Rademacher Complexity.
Discret. Appl. Math., 2022

Estimating the Clustering Coefficient Using Sample Complexity Analysis.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021
The generalized influence blocking maximization problem.
Soc. Netw. Anal. Min., 2021

FPT and Kernelization Algorithms for the Induced Tree Problem.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
FPT and kernelization algorithms for the k-in-a-tree problem.
CoRR, 2020

A cascade perceptron and Kohonen network approach to fault location in rural distribution feeders.
Appl. Soft Comput., 2020

Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Blocking the Spread of Misinformation in a Network under Distinct Cost Models.
Proceedings of the IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2020

2019
The Hidden Subgroup Problem and MKTP.
Theor. Comput. Sci., 2019

The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity.
CoRR, 2019

Approximating the Percolation Centrality through Sampling and Pseudo-dimension.
CoRR, 2019

2018
Structure and algorithms for (cap, even hole)-free graphs.
Discret. Math., 2018

An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm.
CoRR, 2018

2017
An optimal algorithm for 3D triangle mesh slicing.
Comput. Aided Des., 2017

2016
Minimum vertex cover in generalized random graphs with power law degree distribution.
Theor. Comput. Sci., 2016

2015
A note on coloring (even-hole, cap)-free graphs.
CoRR, 2015

Polynomial time algorithm for the k-in-a-tree problem on chordal graphs.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Slicing Triangle Meshes: An Asymptotically Optimal Algorithm.
Proceedings of the 2014 14th International Conference on Computational Science and Its Applications, Guimaraes, Portugal, June 30, 2014

2013
Decomposition of even-hole-free graphs with star cutsets and 2-joins.
J. Comb. Theory B, 2013

2011
On the forbidden induced subgraph sandwich problem.
Discret. Appl. Math., 2011

2007
Triangulated neighborhoods in even-hole-free graphs.
Discret. Math., 2007

2005
Perfect subgraph/supergraph.
Electron. Notes Discret. Math., 2005

2004
Efficient Generation of Triangle Strips from Triangulated Meshes.
Proceedings of the 12-th International Conference in Central Europe on Computer Graphics, 2004

2002
Fast Mesh Rendering Through Efficient Triangle Strip Generation.
Proceedings of the 10-th International Conference in Central Europe on Computer Graphics, 2002

A Hough Transform based Method to Improve Edge Map from Range Images.
Proceedings of the 6th Joint Conference on Information Science, 2002

Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation.
Proceedings of the 2002 International Conference on Image Processing, 2002


  Loading...