2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 | 2009 | 2008 | 2007 | 2006 | 2005
2022
-
Joan
Arrow
Assessing the Trainability of Variational Quantum State Diagonalization Algorithm at Scale
(J. Yard) -
Matthew
Gerstbrein
Vertex Stabilizers for Network Bargaining Games
(L. Sanita and J. Koenemann) -
Valerie
Gilchrist
An Isogeny-Based Adaptor Signature Using SQISign
(D. Jao) -
Simone
Hu
A Combinatorial Tale of Two Scattering Amplitudes: See Two Bijections
(K. Yeats) -
Yanjia
Li
Coloring Algorithms for Graphs and Hypergraphs with Forbidden Substructures
(S. Spirkl) -
Yinchen
Liu
Moments of Random Quantum Circuits and Applications in Random Circuit Sampling
(D. Gosset) -
Angus
Lowe
Learning Quantum States Without Entangled Measurements
(A. Nayak) -
Colter
MacDonald
On Finding Large Cliques when the Chromatic Number is close to the Maximum Degree
(P. Haxell) -
Steven
Santoli
Minimum Number of Trangles of K5 Descendants
(K. Yeats)
2021
-
Marina
Drygala
Craniosynostosis Surgery: A Study of Rearrangement
(J. Koenemann) -
Zouhaier
Ferchiou
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
(B. Guenin) -
Naomi
Graham
Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMMa>
(H. Wolkowicz) -
Joshua
Gunter
The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands
(R. Fukasawa) -
Philip
Hodges
Algorithm Substitution Attacks: Detecting ASAs Using State Reset and Making ASAs Asymmetric
(D. Stebila) -
Alexander
Kerzner
Clifford Simulation: Techniques and Applications
(D. Gosset) -
Timothy
Miller
On Combinatorics, Integrability and Puzzles
(K. Purbhoo) -
Rian
Neogi
Decomposition-based methods for Connectivity Augmentation Problems
(J. Cheriyan) -
Alexander
Stoll
Tolls For Atomic Congestion Games
(C. Swamy) -
Lanlan
Yu
Comparing Classical Portfolio Optimization and Robust Portfolio Optimization on Black Swan Events
(H. Wolkowicz)
2020
-
Ishan
Bansal
Capacitated Network Design on Outerplanar Graphs
(C. Swamy, J. Koenemann) -
Adam
Brown
Counting Pentagons in Triangle-free Binary Matroids
(P. Nelson) -
Logan
Grout
Augmenting Trees to Achieve 2-Node-Connectivity
(J. Cheriyan) -
Courtney
Horrocks
A Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas
(B. Guenin) -
Tao
Jiang
Sum-of-norms clustering: theoretical guarantee and post-processing
(S. Vavasis) -
Matthew
Kroeker
Sparsity in Critical Graphs with Small Clique Number
(L. Postle) -
Natig
Tofigzade
An Algorithm for Stable Matching with Approximation up to the Integrality Gap
(J. Koenemann) -
Samuel
Winnick
Real equiangular lines and related codes
(J. Yard)
2019
-
Elena
Bakos
Lang
Worst-Case to Average-Case Reductions for the SIS Problem: Tightness and Security
(A. Menezes) -
Qiuting
Chen
Edge State Transfer
(C. Godsil) -
Jack
Dippel
The Matching Augmentation Problem: A 7/4-Approximation Algorithm
(J. Cheriyan) -
William
Dugan
Sequences of Trees and Higher-Order Renormalization Group Equations
(K. Yeats) -
Samuel
Jaques
Quantum Cost Models for Cryptanalysis of Isogenies
(A. Menezes) -
Andrew
Jena
Partitioning Pauli Operators: in Theory and in Practice
(M. Mosca) -
Sabrina
Lato
Sabrina Lato
(C. Godsil) -
Dariusz
Lasecki
Noisy Embezzlement of Entanglement and Applications to Entanglement Dilution
(D. Leung) -
Connor
Paul-Paddock
Algebraic and combinatorial aspects of incidence groups and linear system non-local games arising from graphs
(J. Yard) -
Matthew
Slavin
Applications of Stochastic Gradient Descent to Nonnegative Matrix Factorization
(S. Vavasis) -
Mariia
Sobchuk
Quantum indpendence and chromatic numbers
(C. Godsil) -
Zachariah
Stevenson
A computational study of practical issues arising in short-term scheduling of a multipurpose facility
(R. Fukasawa, L. Ricardez-Sandoval) -
Alan
Wong
On the Excluded Minors for Dyadic Matroids
(J. Geelen) -
Shenghao
Yang
Split Cuts From Sparse Disjunctions
(R. Fukasawa, L. Poirrier)
2018
-
Matthew
Buckley
A Primal Dual Algorithm on 2-Steiner Graphs
(L. Sanita) -
Kelvin
Chan
Induction Relations in the Symmetric Groups and Jucys-Murphy Elements
(I. Goulden) -
Owen
Hill
Linearly-dense classes of matroids with bounded branch-width
(J. Geelen) -
Florian
Hoersch
Extending Pappus' Theorem
(J. Geelen) -
Jiyoung
Im
Sensitivity Analysis and Robust Optimization: A Geometric Approach for the Special Case of Linear Optimization
(H. Wolkowicz) -
Sean
Kafer
On The Circuit Diameters of Some Combinatorial Polytopes
(L. Sanita) -
Sanchit
Kalhan
The Capacitated Matroid Median Problem
(C. Swamy) -
Maxwell
Levit
Extensions of Galvin's Theorem
(J. Cheriyan) -
Amena
Mahmoud
5-Choosability of Planar-plus-two-edge Graphs
(B. Richter) -
Nicholas
Olson-Harris
Ordinary and Generalized Circulation Algebras for Regular Matroids
(D. Wagner) -
Sifat
Rahman
Action of degenerate Bethe operators on representations of the symmetric group
(K. Purbhoo) -
Shayla
Redlin
Acyclic Colouring of Graphs on Surfaces
(L. Postle) -
Seyyed
Mousavi
Haji
Thin Trees in Some Families of Graphs
(J. Cheriyan) -
Kris
Siy
The Erdős Pentagon Problem
(P. Haxell) -
Evelyne
Smith-Roberge
Density and Structure of Homomorphism-Critical Graphs
(L. Postle) -
Youngho
Yoo
A post-quantum digital signature scheme based on supersingular isogenies
(D. Jao)
2017
-
Edward
Eaton
Signature Schemes in the Quantum Random-Oracle Model
(A. Menezes) -
Philip
Lafrance
Digital Signature Schemes Based on Hash Functions
(A. Menezes) -
Xingliang
Lou
Efficient Composition of Discrete Time Quantum Walks
(A. Nayak) -
Vishnu
Narayan
Approximating Minimum-Size 2-Edge-Connected and 2-Vertex-Connected Spanning Subgraphs
(J. Cheriyan) -
Christos
Stratopoulos
Primal Cutting Plane Methods for the Traveling Salesman Problem
(B. Cook)
2016
-
Da
Qi
Chen
Cyclically 5-Connected Graphs
(L. Postle) -
Patrick
Dornian
Subdividing the cd-index
(E. Katz) -
Alessandra
Graf
On the Strongly Connected Components of Random Directed Graphs with Given Degree Sequences
(J. Gao) -
Cheolwon
Heo
Recognizing Even-Cycle and Even-Cut Matroids
(B. Guenin) -
Sharat
Ibrahimpur
Packing and Covering Odd (u,v)-trails in a Graph
(C. Swamy) -
Saman
Lagzi
A Study of Time Representation in a Class of Short Term Scheduling Problems
(R. Fukasawa -
Jason
LeGrow
Post-Quantum Security of Authenticated Key Establishment Protocols
(D. Jao) -
Christopher
Leonardi
Key Compression for Isogeny-Based Cryptosystems
(D. Jao) -
Fahimeh
Rahimi
Covering Graphs and Equiangular Tight Frames
(C. Godsil) -
Julian
Romero
Barbosa
Applied Hilbert's Nullstellensatz for Combinatorial Problems
(L. Tuncel) -
Abhinav
Shantanam
Unavoidable Minors of Large 5-Connected Graphs
(J. Geelen) -
Pavel
Shuldiner
Computing the Residue Class of Partition Numbers
(I. Goulden) -
Matthew
Sullivan
Planar graphs without 3-cycles and with 4-cycles far apart are 3-choosable
(B. Richter) -
Hao
Sun
ADMM for SDP Relaxation of GP
(B. Cook) -
William
Justin
Toth
Structure in Stable Matching Problems
(J. Koenemann) -
Zachary
Walsh
On The Density of Binary Matroids Without a Given Minor
(P. Nelson) -
Miaolan
Xie
Inner approximation of convex cones via primal-dual ellipsoidal norms
(L. Tuncel) -
Randy
Yee
On the effectiveness of isogeny walks for extending cover attacks on elliptic curves
(A. Menezes) -
Shuxin
Zhang
On Polynomial-time Path-following Interior-point Methods with Local Superlinear Convergence
(L. Tuncel)
2015
-
Max
Bennett
Combinatorial aspects of braids with applications to cryptography
(I. Goulden) -
Arash
Haddadan
Finding a Second Hamiltonian cycle in Barnette Graphs
(L. Sanita) -
Alexis
Hunt
Establishing a Connection Between Graph Structure, Logic, and Language Theory
(B. Richter) -
Alexander
Lange
Approximation Algorithms for Graph Protection Problems
(C. Swamy) -
Cameron
Marcott
Partition Algebras and Kronecker Coefficients
(K. Purbhoo) -
Christopher
Price
Combinatorial Algorithms for Submodular Function Minimization and Related Problems
(J. Cheriyan) -
Luis
Ruiz-Lopez
Fast Bootstrapping in Z_q
(D. Jao) -
Michael
Shantz
The Number Field Sieve for Barreto-Naehrig Curves: Smoothness of Norms
(E. Teske-Wilson) -
Ala
Shayeghi
Quantum Rejection Sampling
(A. Nayak) -
Ricci
Tam
Erhart Theory and Unimodular Decompositions of Lattice Polytopes
(E. Katz) -
Xiaojing
Wang
The Master Equality Polyhedron: Two-Slope Facets and Separation Algorithm
(R. Fukasawa) -
Michael
Wesolowski
Batch Verification of Elliptic Curve Digital Signatures
(A. Menezes)
2014
-
Alan
Arroyo
Guevara
On 2-crossing-critical graphs with a V8-minor
(B. Richter) -
Srinivasan
Arunachalam
Quantum Speed-ups for Boolean Satisfiability and Derivative-Free Optimization
(M. Mosca) -
Shima
Bab
Hadiashar
Communication Complexity of Remote State Preparation
(A. Nayak) -
Samuel
Embaye
The determination of structured Hessian matrices via automatic differentiation
(T. Coleman) -
Dieter
Fishbein
Machine-Level Software Optimization of Cryptographic Protocols
(D. Jao) -
Marie-Sarah
Lacharite
Revisiting the security model for aggregate signature schemes
(A. Menezes) -
Jiaxin
Liu
An Optimization Problem of Internet Routing
(L. Sanita) -
Venus
Lo
On Vegh's Strongly Polynomial Algorithm for Generalized Flows
(J. Cheriyan) -
Katherine
Naismith
Extensions of Signed Graphs
(B.Guenin) -
Mohammad
Shadravan
On the Integrality Gap of Directed Steiner Tree Problem
(J. Koenemann) -
Ningchuan
Wang
Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems
(H. Wolkowicz) -
Hanmeng
Zhan
Uniform Mixing on Caley Graphs over Z_3^d
(C. Godsil)
2013
-
Ahmad
Abdi
The Cycling Property for the Clutter of Odd st-Walks
(B. Guenin) -
Khodakhast
Bibak
Contributions at the Interface Between Algebra and Graph Theory
(N. Wormald) -
Mehdi
Karimi
A Quick-and-Dirty Approach to Robustness in Linear Optimization
(L. Tuncel) -
Yik-Siong
Kok
Implementing the Schoof-Elkies-Atkin Algorithm with NTL
(D. Jao) -
Zuzana
Masarova
Signing with Codes
(E. Teske-Wilson) -
Georg
Osang
The Local Chromatic Number
(P. Haxell) -
David
Qian
Dynamic Programming: Salesman to Surgeon
(R. Fukasawa) -
Seyed
Saeed
Changiz
Rezaei
Entropy and Graphs
(C.Godsil) -
David
Rhee
Cyclic Sieving Phenomenon of Promotion on Rectangular Tableaux
(K. Purbhoo) -
Sina
Sadghian
Sadeghabad
Node-Weighted Prize Collecting Steiner Tree and Applications
(J. Koenemann, L. Sanita) -
Leanne
Stuive
Single Commodity Flow Algorithms for Lifts of Graphic and Cographic Matroids
(B. Guenin) -
Rebecca
Tessier
Path Tableaux and the Combinatorics of the Immanant Function
(D. Jackson) -
Brandon
Weir
Homomorphic Encryption
(E. Teske-Wilson) -
Xin
Xiong
Efficient Jacobian Determination by Structure-Revealing Automatic Differentiation
(T. Coleman)
2012
-
Beth
Ann
Austin
2-Crossing Critical Graphs with a V8 Minor
(B. Richter) -
Marco
Blanco
Sandoval
LP-based Approximation Algorithms for the Capacitated Facility Location Problem
(R. Fukasawa) -
Dale
Brydon
On the Security of Leakage Resilient Public Key Cryptography
(A. Menezes) -
Elyot
Grant
Covering Problems via Structural Approaches
(T. Chan, J. Koenemann) -
Gurleen
Grewal
Efficient Pairings on Various Platforms
(D. Jao) -
Andrew
McConvey
Highly Non-Convex Crossing Sequences
(B. Richter) -
Heng
Ye
Efficient Trust Region Subproblem Algorithms
(H. Wolkowicz)
2011
-
Sara
Ahmadian
Improved Approximation Guarantees for Lower-Bounded Facility Location Problem
(C. Swamy) -
Shubham
Gupta
Building Networks in the Face of Uncertainty
(C. Swamy) -
Stacey
Jeffery
Collision Finding with Many Classical or Quantum Processors
(M. Mosca) -
Abbas
Mehrabian
Cops and Robber Game with a Fast Robber
(N. Wormald) -
Peruvemba
Sundaram
Ravi
Techniques for Proving Approximation Ratios in Scheduling
(L. Tuncel) -
Andres
Ruiz-Vargas
On the Orientation of Hypergraphs
(J. Cheriyan) -
Vladimir
Soukharev
Evaluating Large Degree Isogenies between Elliptic Curves
(D. Jao) -
Michael
Szestopalow
Properties of Stable Matchings
(P. Haxell) -
John
White
A New Class of Cycle Inequality for the Time-Dependent Traveling Salesman Problem
(R. Fukasawa) -
Kewei
Yu
Optimal Pairings on BN Curves
(A. Menezes)
2010
-
Fidel
Barrera-Cruz
On Schnyder's Theorem
(P. Haxell) -
Andrew
Brown
A Puzzle-Based Synthesis Algorithm For a Triple Intersection of Schubert Varieties
(K. Purbhoo) -
Sean
Carrell
Combinatorics and the KP Hierarchy
(I. Goulden, K. Purbhoo) -
Krystal
Guo
Quantum Walks on Strongly Regular Graphs
(C. Godsil) -
Bundit
Laekhanukit
Approximation Algorithms for (S,T)-Connectivity Problems
(J. Cheriyan) -
Marcus
Shea
Iterative Rounding Approximation Algorithms in Network Design
(J. Koenemann)
2009
-
Aleksandrs
Belovs
Welch Bounds and Quantum State Tomography
(A. Nayak) -
Alejandro
Erickson
Negative Correlation Properties for Matroids
(D. Wagner) -
Junbo
Huang
A Characterization of LYM and Rank Logarithmically Concave Partially Ordered Sets and Its Applications
(D. Wagner) -
Edward
Knapp
On Pairing-Based Signature and Aggregate Signature Schemes
(A. Menezes) -
Laura
Mancinska
Characterization of Non-Universal Two-Qubit Hamiltonians
(D. Leung) -
Natalie
Mullin
Self-Complementary Arc-Transitive Graphs and Their Imposters
(C. Godsil) -
Yingkai
Ouyang
A More Accurate Measurement Model for Fault-Tolerant Quantum Computing
(D. Leung) -
Maris
Ozols
Quantum Random Access Codes with Shared Randomness
(A. Childs) -
James
Pearson
Exact, Approximate, and Online Algorithms for Optimization Problems Arising in DVD Assignment
(J. Koenemann) -
David
Roberson
The Graphs of Haggkvist and Hell
(C. Godsil) -
Colleen
Swanson
Security in Key Agreement: Two-Party Certificateless Schemes
(D. Jao) -
Kayo
Yoshida
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
(D. Jao)
2008
-
Yu-Hin
(Gary)
Au
On the Polyhedral Lift-and-Project Rank Conjecture for the Fractional Stable Set Polytope
(L. Tuncel) -
Stephanie
Phillips
The Search for an Excluded Minor Characterization of Ternary Rayleigh Matroids
(D. Wagner) -
Louis-Francois
Preville-Ratelle
A Combinatorial Interpretation of Minimal Transitive Factorizations into Transpositions for Permutations with two Disjoint Cycles
(I. Goulden) -
Tor Myklebust
Geometry of Convex Sets Arising from Hyperbolic Polynomials
(L. Tuncel) -
Brendan
Rooney
MacLane's Theorem for Graph-Like Spaces
(B. Richter)
2007
-
Yichun
Ding
On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
(H. Wolkowicz) -
Igor
Gorodezky
Dominating Sets in Kneser Graphs
(C. Godsil) -
Betsy
Hui
Probabilistic Choice Models for Product Pricing Using Reservation Prices
(R. Shioda) -
Koray
Karabina
On Prime-Order Elliptic Curves with Embedding Degrees 3, 4 and 6
(E. Teske-Wilson) -
Zhentao
Li
Algebraic Methods for Reducibility in Nowhere-Zero Flows
(B. Guenin) -
Avradip
Mandal
MAC Constructions: Security Bounds and Distinguishing Attacks
(A. Ambainis) -
Mohamed
Omar
Combinatorial Approaches To The Jacobian Conjecture
(I. Goulden) -
Irene
Pivotto
On Excluded Minors for Even Cut Matroids
(B. Guenin) -
Caroline
Rioux
Scarf's Theorem and Applications in Combinatorics
(P. Haxell) -
Patrick
Roh
Minimum Crossing Problems on Graphs
(J. Koenemann) -
Jamie
Sikora
Applications of Semidefinite Programming in Quantum Cryptography
(A. Nayak, L. Tuncel) -
David
Wheatley
Cross-monotonic Cost-Sharing Methods for Network Design Games
(J. Koenemann) -
Margarita
Zvereva
Mathematical Programming Formulations of the Planar Facility Location Problem
(R. Shioda)
2006
-
Karel
Casteels
The Cycle Spaces of an Infinite Graph
(P. Haxell, B. Richter) -
David
Clark
Algebraic Analysis of Vertex-Distinguishing Edge-Colorings
(I. Goulden, B. Richter) -
Paul
Dickinson
Approximate Private Quantum Channels
(A. Nayak) -
Adam
Feldmann
A Survey of Attacks on Multivariate Cryptosystems
(E. Teske-Wilson) -
Shen
Luo
Interior-Point Algorithms Based on Primal-Dual Entropy
(L. Tuncel) -
Shengjun
Pan
On the Crossing Numbers of Complete Graphs
(B. Richter) -
Daniel
Redelmeier
Hyperpfaffians in Algebraic Combinatorics
(I. Goulden) -
Kunlun
Tan
On the Role of Partition Inequalities in Classical Algorithms for Steiner Problems in Graphs
(J. Koenemann) -
Martha
Yip
Genus One Partitions
(D. Jackson)
2005
-
Nick
Alexander
Algebraic Tori in Cryptography
(A. Menezes, E. Teske-Wilson) -
Ameerah
Chowdhury
Colouring Subspaces
(C. Godsil) -
Lei
Chu
Colouring Cayley Graphs
(C. Godsil) -
Oleg
Grodzevich
Regularization Using a Parameterized Trust Region Subproblem
(H. Wolkowicz) -
Matthew
McKague
Design and Analysis of RC4-like Stream Ciphers
(A. Menezes) -
Eddie
Ng
Security Models and Proofs for Key Establishment Protocols
(A. Menezes) -
Timothy
Reid
On the Evolutionary Design of Quantum Circuits
(R. Laflamme) -
Luis
Serrano
Transitive Factorizations of Permutations and Eulerian Maps in the Plane
(I. Goulden) -
Craig
Sloss
Enumeration of Walks on Generalized Differential Posets
(D. Jackson) -
Clayton
Smith
Digital Signcryption
(E. Teske-Wilson)