Raphael Machado

According to our database1, Raphael Machado authored at least 63 papers between 2008 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Even-power of Cycles With Many Vertices are Type 1 Total Colorable.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On the embedding of cone graphs in the line with distinct distances between neighbors.
Discret. Appl. Math., 2019

Dijkstra graphs.
Discret. Appl. Math., 2019

Full Characterization of a Class of Graphs Tailored for Software Watermarking.
Algorithmica, 2019

Countermeasure for Identification of Controlled Data Injection Attacks in Networked Control Systems.
Proceedings of the 2nd Workshop on Metrology for Industry 4.0 and IoT MetroInd4.0&IoT 2019, 2019

Measuring randomness in IoT products.
Proceedings of the 2nd Workshop on Metrology for Industry 4.0 and IoT MetroInd4.0&IoT 2019, 2019

Bio-inspired System Identification Attacks in Noisy Networked Control Systems.
Proceedings of the Bio-inspired Information and Communication Technologies, 2019

2018
Using Physical Context-Based Authentication against External Attacks: Models and Protocols.
Security and Communication Networks, 2018

A controller design for mitigation of passive system identification attacks in networked control systems.
J. Internet Services and Applications, 2018

Using SPQR-trees to speed up recognition algorithms based on 2-cutsets.
Discret. Appl. Math., 2018

On the resilience of canonical reducible permutation graphs.
Discret. Appl. Math., 2018

Evaluation on Passive System Identification and Covert Misappropriation Attacks in Large Pressurized Heavy Water Reactors.
Proceedings of the 2018 Workshop on Metrology for Industry 4.0 and IoT, 2018

True Random Number Generators for Batch Control Sampling in Smart Factories.
Proceedings of the 2018 Workshop on Metrology for Industry 4.0 and IoT, 2018

Implementation of Cybersecurity Procedures in Remote Calibration for PNT Services.
Proceedings of the 2018 Workshop on Metrology for Industry 4.0 and IoT, 2018

Building Reference Datasets to Support Socialbots Detection.
Proceedings of the 2018 Workshop on Metrology for Industry 4.0 and IoT, 2018

2017
Covert Attacks in Cyber-Physical Control Systems.
IEEE Trans. Industrial Informatics, 2017

Genomic Distance with High Indel Costs.
IEEE/ACM Trans. Comput. Biology Bioinform., 2017

On star and biclique edge-colorings.
ITOR, 2017

Efficient Algorithms for Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.
Algorithmica, 2017

Use of Switching Controllers for Mitigation of Active Identification Attacks in Networked Control Systems.
Proceedings of the 15th IEEE Intl Conf on Dependable, 2017

2016
Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3.
Theor. Comput. Sci., 2016

Linear-time graph distance and diameter approximation.
ITOR, 2016

Software control and intellectual property protection in cyber-physical systems.
EURASIP J. Information Security, 2016

Dijkstra Graphs.
CoRR, 2016

2015
Using SPQR-trees to speed up algorithms based on 2-cutset decompositions.
Electron. Notes Discret. Math., 2015

On the recognition of unit disk graphs and the Distance Geometry Problem with Ranges.
Discret. Appl. Math., 2015

Biclique-colouring verification complexity and biclique-colouring power graphs.
Discret. Appl. Math., 2015

The Graphs of Structured Programming.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

Fair Fingerprinting Protocol for Attesting Software Misuses.
Proceedings of the 10th International Conference on Availability, Reliability and Security, 2015

2014
Efficient sub-5 approximations for minimum dominating sets in unit disk graphs.
Theor. Comput. Sci., 2014

Complexity of colouring problems restricted to unichord-free and { square, unichord }-free graphs.
Discret. Appl. Math., 2014

Software validation of medical instruments.
Proceedings of the 2014 IEEE International Symposium on Medical Measurements and Applications, 2014

2013
A tight bound for exhaustive key search attacks against Message Authentication Codes.
RAIRO - Theor. Inf. and Applic., 2013

Edge-colouring and total-colouring chordless graphs.
Discret. Math., 2013

Towards a provably robust graph-based watermarking scheme
CoRR, 2013

Energy footprint framework: A pathway toward smart grid sustainability.
IEEE Communications Magazine, 2013

DCJ-indel and DCJ-substitution distances with distinct operation costs.
Algorithms for Molecular Biology, 2013

Towards a Provably Resilient Scheme for Graph-Based Watermarking.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

Information security aspects of public software.
Proceedings of the Fifth International Conference on Management of Emergent Digital EcoSystems, 2013

2012
Program Matching through Code Analysis and Artificial Neural Networks.
International Journal of Software Engineering and Knowledge Engineering, 2012

The total chromatic number of split-indifference graphs.
Discret. Math., 2012

Restricted DCJ-indel model: sorting linear genomes with DCJ and indels.
BMC Bioinformatics, 2012

Linear Time Approximation for Dominating Sets and Independent Dominating Sets in Unit Disk Graphs.
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012

DCJ-indel Distance with Distinct Operation Costs.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

Clique-Colouring and Biclique-Colouring Unichord-Free Graphs.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Biclique-colouring - Powers of Paths and Powers of Cycles.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
Complexity dichotomy on partial grid recognition.
Theor. Comput. Sci., 2011

A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs.
Networks, 2011

Complexity separating classes for edge-colouring and total-colouring.
J. Braz. Comp. Soc., 2011

Total chromatic number of unichord-free graphs.
Discret. Appl. Math., 2011

On the weight of indels in genomic distances.
BMC Bioinformatics, 2011

Genomic distance under gene substitutions.
BMC Bioinformatics, 2011

2010
Chromatic index of graphs with no cycle with a unique chord.
Theor. Comput. Sci., 2010

Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges.
Electron. Notes Discret. Math., 2010

Total chromatic number of {square, unichord}-free graphs.
Electron. Notes Discret. Math., 2010

Decompositions for edge-coloring join graphs and cobipartite graphs.
Discret. Appl. Math., 2010

Traceability of Executable Codes Using Neural Networks.
Proceedings of the Information Security - 13th International Conference, 2010

Software evaluation of smart meters within a Legal Metrology perspective: A Brazilian case.
Proceedings of the IEEE PES Conference on Innovative Smart Grid Technologies, 2010

Chromatic Index of Chordless Graphs.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Program Equivalence Using Neural Networks.
Proceedings of the Bio-Inspired Models of Network, Information, and Computing Systems, 2010

2009
NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Sufficient conditions for a graph to be edge-colorable with maximum degree colors.
Electron. Notes Discret. Math., 2008

A decomposition for total-coloring graphs of maximum degree 3.
Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008


  Loading...