default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMurilo V. G. da Silva
Person information
- affiliation: Federal University of Technology Parana (UFPR), DAINF, Curitiba, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
A Range Space with Constant VC Dimension for All-pairs Shortest Paths in Graphs. J. Graph Algorithms Appl. 27(7): 603-619 (2023)- 2022
- [j11]Alane M. de Lima
, Murilo V. G. da Silva, André Luís Vignatti:
Percolation centrality via Rademacher Complexity. Discret. Appl. Math. 323: 201-216 (2022) - [c10]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Estimating the Clustering Coefficient Using Sample Complexity Analysis. LATIN 2022: 328-341 - 2021
- [j10]Fernando C. Erd, André Luís Vignatti, Murilo V. G. da Silva:
The generalized influence blocking maximization problem. Soc. Netw. Anal. Min. 11(1): 55 (2021) - [c9]Guilherme de Castro Mendes Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
FPT and Kernelization Algorithms for the Induced Tree Problem. CIAC 2021: 158-172 - 2020
- [j9]Fabrício Augusto de Souza, Marcelo Favoretto Castoldi, Alessandro Goedtel, Murilo V. G. da Silva:
A cascade perceptron and Kohonen network approach to fault location in rural distribution feeders. Appl. Soft Comput. 96: 106627 (2020) - [c8]Fernando C. Erd, André Luís Vignatti, Murilo V. G. da Silva:
Blocking the Spread of Misinformation in a Network under Distinct Cost Models. ASONAM 2020: 232-236 - [c7]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Estimating the Percolation Centrality of Large Networks through Pseudo-dimension Theory. KDD 2020: 1839-1847 - [i8]Guilherme de C. M. Gomes, Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
FPT and kernelization algorithms for the k-in-a-tree problem. CoRR abs/2007.04468 (2020)
2010 – 2019
- 2019
- [j8]Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti:
The Hidden Subgroup Problem and MKTP. Theor. Comput. Sci. 795: 204-212 (2019) - [c6]João Pedro W. Bernardi, Murilo V. G. da Silva, André Luiz Pires Guedes, Leandro M. Zatesko:
The Chromatic Index of Proper Circular-arc Graphs of Odd Maximum Degree which are Chordal. LAGOS 2019: 125-133 - [i7]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Approximating the Percolation Centrality through Sampling and Pseudo-dimension. CoRR abs/1910.00494 (2019) - [i6]Alane M. de Lima, Murilo V. G. da Silva, André Luís Vignatti:
Shortest Path Centrality and the All-pairs Shortest Paths Problem via Sample Complexity. CoRR abs/1911.13144 (2019) - 2018
- [j7]Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. Discret. Math. 341(2): 463-473 (2018) - [i5]Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti:
An Indexing for Quadratic Residues Modulo N and a Non-uniform Efficient Decoding Algorithm. CoRR abs/1805.04731 (2018) - [i4]Nicollas M. Sdroievski, Murilo V. G. da Silva, André Luís Vignatti:
The Hidden Subgroup Problem and MKTP. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j6]Rodrigo Minetto, Neri Volpato, Jorge Stolfi, Rodrigo M. M. H. Gregori, Murilo V. G. da Silva:
An optimal algorithm for 3D triangle mesh slicing. Comput. Aided Des. 92: 1-10 (2017) - 2016
- [j5]André Luís Vignatti, Murilo Vicente Gonçalves da Silva:
Minimum vertex cover in generalized random graphs with power law degree distribution. Theor. Comput. Sci. 647: 101-111 (2016) - [i3]Kathie Cameron, Murilo Vicente Gonçalves da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. CoRR abs/1611.08066 (2016) - 2015
- [i2]Vinícius Fernandes dos Santos, Murilo V. G. da Silva, Jayme Luiz Szwarcfiter:
Polynomial time algorithm for the k-in-a-tree problem on chordal graphs. CTW 2015: 242-245 - [i1]Shenwei Huang, Murilo V. G. da Silva:
A note on coloring (even-hole, cap)-free graphs. CoRR abs/1510.09192 (2015) - 2014
- [c5]Rodrigo M. M. H. Gregori, Neri Volpato, Rodrigo Minetto, Murilo Vicente Gonçalves da Silva:
Slicing Triangle Meshes: An Asymptotically Optimal Algorithm. ICCSA (Workshops/Short Papers/Posters) 2014: 252-255 - 2013
- [j4]Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
Decomposition of even-hole-free graphs with star cutsets and 2-joins. J. Comb. Theory B 103(1): 144-183 (2013) - 2011
- [j3]Simone Dantas, Celina M. H. de Figueiredo, Murilo Vicente Gonçalves da Silva, Rafael B. Teixeira:
On the forbidden induced subgraph sandwich problem. Discret. Appl. Math. 159(16): 1717-1725 (2011)
2000 – 2009
- 2007
- [j2]Murilo Vicente Gonçalves da Silva, Kristina Vuskovic:
Triangulated neighborhoods in even-hole-free graphs. Discret. Math. 307(9-10): 1065-1073 (2007) - 2005
- [j1]Murilo Vicente Gonçalves da Silva, André Luiz Pires Guedes:
Perfect subgraph/supergraph. Electron. Notes Discret. Math. 19: 411-416 (2005) - 2004
- [c4]Oliver Matias van Kaick, Murilo Vicente Gonçalves da Silva, Hélio Pedrini:
Efficient Generation of Triangle Strips from Triangulated Meshes. WSCG 2004: 475-482 - 2002
- [c3]Oliver Matias van Kaick, Murilo Vicente Gonçalves da Silva, Hélio Pedrini, William Robson Schwartz:
Fitting smooth surfaces to scattered 3D data using piecewise quadratic approximation. ICIP (1) 2002: 493-496 - [c2]Luciano Silva, Olga Regina Pereira Bellon, Murilo Vicente Gonçalves da Silva, Oliver Matias van Kaick:
A Hough Transform based Method to Improve Edge Map from Range Images. JCIS 2002: 720-723 - [c1]Murilo Vicente Gonçalves da Silva, Oliver Matias van Kaick, Hélio Pedrini:
Fast Mesh Rendering Through Efficient Triangle Strip Generation. WSCG 2002: 127-134
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
