default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid E. Roberson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j18]Laura Mancinska
, David E. Roberson, Antonios Varvitsiotis:
Graph isomorphism: physical resources, optimization models, and algebraic characterizations. Math. Program. 205(1): 617-660 (2024)- [j17]David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. TheoretiCS 3 (2024) - 2020
- [j16]Laura Mancinska, Irene Pivotto, David E. Roberson, Gordon F. Royle:
Cores of cubelike graphs. Eur. J. Comb. 87: 103092 (2020) - [j15]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Vector coloring the categorical product of graphs. Math. Program. 182(1): 275-314 (2020) - 2019
- [j14]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Graph homomorphisms via vector colorings. Eur. J. Comb. 79: 244-261 (2019) - [j13]Albert Atserias, Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Quantum and non-signalling graph isomorphisms. J. Comb. Theory B 136: 289-328 (2019) - 2017
- [j12]Antonio Acín, Runyao Duan, David E. Roberson, Ana Belén Sainz, Andreas J. Winter:
A new property of the Lovász number and duality relations between graph parameters. Discret. Appl. Math. 216: 489-501 (2017) - [j11]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Universal Completability, Least Eigenvalue Frameworks, and Vector Colorings. Discret. Comput. Geom. 58(2): 265-292 (2017) - 2016
- [j10]Laura Mancinska, David E. Roberson:
Oddities of Quantum Colorings. Balt. J. Mod. Comput. 4(4) (2016) - [j9]Laura Mancinska, David E. Roberson, Antonios Varvitsiotis:
On deciding the existence of perfect entangled strategies for nonlocal games. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j8]Chris D. Godsil, David E. Roberson, Robert Sámal, Simone Severini:
Sabidussi versus Hedetniemi for three variations of the chromatic number. Comb. 36(4): 395-415 (2016) - [j7]Leslie Hogben, Kevin F. Palmowski, David E. Roberson, Michael Young:
Fractional zero forcing via three-color forcing games. Discret. Appl. Math. 213: 114-129 (2016) - [j6]David E. Roberson:
Homomorphisms of Strongly Regular Graphs. Electron. Notes Discret. Math. 54: 271-276 (2016) - [j5]Laura Mancinska, David E. Roberson:
Quantum homomorphisms. J. Comb. Theory B 118: 228-267 (2016) - 2015
- [j4]Chris D. Godsil, David E. Roberson, Brendan Rooney, Robert Sámal, Antonios Varvitsiotis:
Graph Cores via Universal Completability. Electron. Notes Discret. Math. 49: 337-344 (2015) - 2014
- [j3]Toby S. Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas J. Winter:
Bounds on Entanglement-Assisted Source-Channel Coding via the Lovász \(\vartheta \) Number and Its Variants. IEEE Trans. Inf. Theory 60(11): 7330-7344 (2014) - 2013
- [j2]David E. Roberson:
Cores of Vertex Transitive Graphs. Electron. J. Comb. 20(2): 45 (2013) - 2012
- [j1]David E. Roberson:
Häggkvist-Hell graphs: A class of Kneser-colorable graphs. Discret. Math. 312(5): 837-853 (2012)
Conference and Workshop Papers
- 2023
- [c6]David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. ICALP 2023: 101:1-101:18 - 2020
- [c5]Laura Mancinska, David E. Roberson:
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. FOCS 2020: 661-672 - 2019
- [c4]Marcel Kenji de Carli Silva, Gabriel Coutinho, Chris D. Godsil, David E. Roberson:
Algebras, Graphs and Thetas. LAGOS 2019: 275-283 - 2017
- [c3]Laura Mancinska, David E. Roberson, Robert Sámal, Simone Severini, Antonios Varvitsiotis:
Relaxations of Graph Isomorphism. ICALP 2017: 76:1-76:14 - 2014
- [c2]Toby S. Cubitt, Laura Mancinska, David E. Roberson, Simone Severini, Dan Stahlke, Andreas J. Winter:
Bounds on Entanglement Assisted Source-channel Coding Via the Lovász Theta Number and Its Variants. TQC 2014: 48-51 - [c1]Laura Mancinska, David E. Roberson:
Graph Homomorphisms for Quantum Players. TQC 2014: 212-216
Informal and Other Publications
- 2024
- [i4]Prem Nigam Kar, David E. Roberson, Tim Seppelt, Peter Zeman:
NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability. CoRR abs/2407.10635 (2024) - 2023
- [i3]David E. Roberson, Tim Seppelt:
Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability. CoRR abs/2302.10538 (2023) - 2019
- [i2]Laura Mancinska, David E. Roberson:
Quantum isomorphism is equivalent to equality of homomorphism counts from planar graphs. CoRR abs/1910.06958 (2019) - 2015
- [i1]Laura Mancinska, David E. Roberson, Antonios Varvitsiotis:
Deciding the existence of perfect entangled strategies for nonlocal games. CoRR abs/1506.07429 (2015)
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-09-22 00:35 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:
