Reza Naserasr
Publications
Publications
|
|
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-ReductionTCC 2024, Dec 2024, Milan (Italie), Italy |
|
|
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-ReductionTCC 2024, Dec 2024, Milan, Italy |
|
|
Cliques in exact distance powers of graphs of given maximum degreeLAGOS 2021 - 11th Latin and American Algorithms, Graphs and Optimisation Symposium, May 2021, Sao Paulo, Brazil. pp.427-436, ⟨10.1016/j.procs.2021.11.052⟩ |
|
|
Smallest $C_{2l+1}$-Critical Graphs of Odd-Girth $2k+1$6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.184-196, ⟨10.1007/978-3-030-39219-2_16⟩ |
|
|
A New Graph Parameter to Measure LinearityCOCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.154-168, ⟨10.1007/978-3-319-71147-8_11⟩ |
|
|
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation GraphsInternational Workshop on Graph-Theoretic Concepts in Computer Science WG 2015, Jun 2015, Munich, Germany. pp.175 - 471, ⟨10.1007/978-3-662-53174-7_32⟩ |
|
|
Safe Sets in Graphs: Graph Classes and Structural ParametersCOCOA 2016 - 10th International Conference Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.241-253, ⟨10.1007/978-3-319-48749-6_18⟩ |
|
|
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint SatisfactionProceedings of the 11th Latin American Symposium on Theoretical Informatics (LATIN 2014), Mar 2014, Montevideo, Uruguay. pp.526-537, ⟨10.1007/978-3-642-54423-1_46⟩ |
Homomorphisms of signed bipartite graphsEuropean Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 |
|
On homomorphisms of planar signed graphs to signed projective cubesEuropean Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 |
|
|
|
Edge identifying codesEuropean Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Aug 2011, Budapest, Hungary. pp.343-348, ⟨10.1016/j.endm.2011.09.056⟩ |