David E. Roberson

Orcid: 0000-0002-4463-8095

According to our database1, David E. Roberson authored at least 23 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Graph isomorphism: physical resources, optimization models, and algebraic characterizations.
Math. Program., May, 2024

2023
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2020
Vector coloring the categorical product of graphs.
Math. Program., 2020

Cores of cubelike graphs.
Eur. J. Comb., 2020

Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019
Quantum and non-signalling graph isomorphisms.
J. Comb. Theory, Ser. B, 2019

Algebras, Graphs and Thetas.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Graph homomorphisms via vector colorings.
Eur. J. Comb., 2019

2017
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings.
Discret. Comput. Geom., 2017

A new property of the Lovász number and duality relations between graph parameters.
Discret. Appl. Math., 2017

Relaxations of Graph Isomorphism.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Quantum homomorphisms.
J. Comb. Theory, Ser. B, 2016

Homomorphisms of Strongly Regular Graphs.
Electron. Notes Discret. Math., 2016

Fractional zero forcing via three-color forcing games.
Discret. Appl. Math., 2016

Sabidussi versus Hedetniemi for three variations of the chromatic number.
Comb., 2016

On deciding the existence of perfect entangled strategies for nonlocal games.
Chic. J. Theor. Comput. Sci., 2016

Oddities of Quantum Colorings.
Balt. J. Mod. Comput., 2016

2015
Graph Cores via Universal Completability.
Electron. Notes Discret. Math., 2015

2014
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants.
IEEE Trans. Inf. Theory, 2014

Graph Homomorphisms for Quantum Players.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants.
Proceedings of the 9th Conference on the Theory of Quantum Computation, 2014

2013
Cores of Vertex Transitive Graphs.
Electron. J. Comb., 2013

2012
Häggkvist-Hell graphs: A class of Kneser-colorable graphs.
Discret. Math., 2012


  Loading...