Antonios Varvitsiotis

Orcid: 0000-0002-9658-6469

Affiliations:
  • Centrum Wiskunde & Informatica


According to our database1, Antonios Varvitsiotis authored at least 30 papers between 2009 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
No-Regret Learning and Equilibrium Computation in Quantum Games.
CoRR, 2023

The Lovász Theta Function for Recovering Planted Clique Covers and Graph Colorings.
CoRR, 2023

Discovering How Agents Learn Using Few Data.
CoRR, 2023

Multiplicative Updates for Online Convex Optimization over Symmetric Cones.
CoRR, 2023

Quantum Potential Games, Replicator Dynamics, and the Separability Problem.
CoRR, 2023

2021
Analysis of Optimization Algorithms via Sum-of-Squares.
J. Optim. Theory Appl., 2021

Multiplicative updates for symmetric-cone factorizations.
CoRR, 2021

A Non-commutative Extension of Lee-Seung's Algorithm for Positive Semidefinite Factorizations.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

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

Convergence to Second-Order Stationarity for Non-negative Matrix Factorization: Provably and Concurrently.
CoRR, 2020

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

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

Local certification of programmable quantum devices of arbitrary high dimensionality.
CoRR, 2019

2018
Completely positive semidefinite rank.
Math. Program., 2018

Characterising the behaviour of classical-quantum broadcast networks.
CoRR, 2018

2017
The Excluded Minors for Isometric Realizability in the Plane.
SIAM J. Discret. Math., 2017

Linear conic formulations for two-party correlations and values of nonlocal games.
Math. Program., 2017

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

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

2016
Device-independent dimension tests in the prepare-and-measure scenario.
CoRR, 2016

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

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

On the minimum dimension of a Hilbert space needed to generate a quantum correlation.
CoRR, 2015

2014
A new graph parameter related to bounded rank positive semidefinite matrix completions.
Math. Program., 2014

Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope.
J. Comb. Theory, Ser. B, 2014

2013
Mixed Volume and Distance Geometry Techniques for Counting Euclidean Embeddings of Rigid Graphs.
Proceedings of the Distance Geometry: Theory, Methods, and Applications, 2013

2012
On bounded rank positive semidefinite matrix completions of extreme partial correlation matrices
CoRR, 2012

The Gram Dimension of a Graph.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Computing the Grothendieck constant of some graph classes.
Oper. Res. Lett., 2011

2009
Algebraic Methods for Counting Euclidean Embeddings of Rigid Graphs.
Proceedings of the Graph Drawing, 17th International Symposium, 2009


  Loading...