Undergraduate Research Assistant (URA) research publications

Here is a selection of research publications that resulted from undergraduate research projects in the Combinatorics and Optimization department. The student's names are followed by asterisks*.

2022

• Torin Greenwood, Stephen Melczer, Tiadora Ruza*, Mark C. Wilson,
  Asymptotics of coefficients of algebraic series via embedding into rational series (extended abstract),
  accepted to the Proceedings of FPSAC 2022.
• Yongxing (Nick) Zhang, Logan Crew, e-basis Coefficients of Chromatic Symmetric Functions
• Yen-Kang Fu*, Jonathan Chang, David Jao, Optimal Generic Attack Against Basic Boneh-Boyen Signatures

2021

• Shannon Jeffries*, Karen Yeats,
  A degree preserving delta wye transformation with applications to 6-regular graphs and Feynman periods,
  submitted, 2021.
• Xinle Dai*, Jordan Long*, Karen Yeats, 
  Subdivergence-free gluings of trees,
  submitted, 2021.
• Christopher Godsil, Maxwell Levit, Olha Silina*,
  Graph covers with two new eigenvalues,
  European Journal of Combinatorics,
  volume 93, 2021.
• Nina Bindel, Douglas Stebila, Shannon Veitch*,
  Improved Attacks Against Key Reuse in Learning with Errors Key Exchange,
  Progress in Cryptology - LATINCRYPT 2021,
  pp 168-188, 2021.
• Edward Eaton, Douglas Stebila, Roy Stracovsky*,
  Post-Quantum Key-Blinding for Authentication in Anonymity Networks,

  Progress in Cryptology - LATINCRYPT 2021,
  pp 67-87, 2021.

• Jochen Könemann, Justin Toth, Felix Zhou*,
  On the Complexity of Nucleolus Computation for Bipartite b-Matching Games,
  SAGT 2021: Algorithmic Game Theory,
  pp 171-185, 2021.

• William Chan*, Logan Crew,
  A Graph Polynomial from Chromatic Symmetric Functions,
  submitted 2021.

• Joseph Cheriyan, Robert Cummings*, Jack Dippel, Jasper Zhu*,
  An Improved Approximation Algorithm for the Matching Augmentation Problem (PDF),
  International Symposium on Algorithms and Computation 2021.

2020

• Tao Jiang, Stephen Vavasis, Chen Wen Zhai*, 
  Recovery of a Mixture of Gaussians by Sum-of-norms Clustering (PDF), 
  Journal of Machine Learning Research,
  21 (2020) 1-16.
• Pu Gao, Yuval Ohapkin*,
  Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity,
  submitted 2020.

• Sylvia C. Boyd, Joseph Cheriyan, Robert Cummings*, Logan Grout, Sharat Ibrahimpur, Zoltán Szigeti, Lu Wang,
  A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case,
  APPROX/RANDOM 2020.

2019

• Xiu Xu, Chris Leonardi, Anzo Teh*, David Jao, Kunpeng Wang, Wei Yu, Reza Azarderakhsh,
  Improved Digital Signatures Based on Elliptic Curve Endomorphism Rings,
  Lecture Notes in Computer Science,
  volume 11879, 2019.
• Alan Arroyo, Bruce Richter, Matthew Sunohara*,
  Extending drawings of complete graphs into arrangements of pseudocircles (PDF) ,
  SIAM Journal on Discrete Mathematics,
  volume 25, issue 2, 2019.

2018

• Simone Hu*, Oliver Schnetz, Jim Shaw*, Karen Yeats,
  Further investigations into the graph theory of ϕ4-periods and the c2 invariant,
  preprint, 2018.
• Reza Azarderakhsh, Elena Bakos Lang*, David Jao, Brian Koziel, 
  EdSIDH: Supersingular Isogeny Diffie-Hellman Key Exchange on Edwards Curves,
  Lecture Notes in Computer Science,
  volume 11348, 2018.
• Adam Brown*, Peter Nelson,
  Matroids with no U_2,n-minor and many hyperplanes,
  Advances in Applied Mathematics,
  volume 100, pages 143-147, 2018.
• Wenbo Gao*, Luke Postle,
  On the Minimal Edge Density of K4-free 6-critical Graphs,
  preprint 2018.

2017

• Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik*,
  Efficient Compression of SIDH Public Keys,
  Lecture Notes in Computer Science,
  volume 10210, 2017.

2016

• Raymond Cheng*, David M.R. Jackson and Geoffrey Stanley*,
  Combinatorial aspects of the quantized universal enveloping algebra of sl_{n+1}(C),
  preprint, 2016.

2015

• Rutger Campbell*, Jim Geelen and Peter Nelson,
  On the structure of dense triangle-free binary matroids,
  preprint, 2015.​

• Guru Guruganesh*, Laura Sanita and Chaitanya Swamy,
  Improved region-growing and combinatorial algorithms
  for k-route cut problems,
  ACM-SIAM Symposium on Discrete Algorithms (SODA) 2015.​

• Reza Azarderakhsh, David Jao, Hao Lee*, 
  Common Subexpression Algorithms for Space-Complexity Reduction of Gaussian Normal Basis Multiplication,
  IEEE Transactions on Information Theory,
  volume 61, issue 5, 2015.

2014

• Gabriel Coutinho and Henry Liu*,
  No Laplacian perfect state transfer in trees,
  preprint, 2014.​

• Honghao Fu*, Debbie Leung, Laura Mancinska,
  When asymptotic LOCC offers no advantage over finite LOCC,
  Physical Review A,
  Volume 89, 2014.

• Wenbo Gao* and David Wagner,
  Highly symmetric matroids, the strong Rayleigh property, and sums of squares,
  preprint, 2014.​

• Konstantinos Georgiou and Edward Lee*,
  Lift & project systems performing on the partial-vertex-cover polytope,
  34th Annual Conference on Foundations of Software Technology and
  Theoretical Computer Science (FSTTCS) 2014.​

• Debbie Leung and Bingjie Wang*,
  Characteristics of universal umbezzling families,
  Physical Review A,
  Volume 90, 2014.

• Ting Kei Pong, Hao Sun*, Ningchuan Wang and Henry Wolkowicz,
  Eigenvalue, quadratic programming, and semidefinite programming bounds for vertex separators (PDF),
  preprint, 2014.

2013

• Peruvemba Sundaram Ravi, Levent Tuncel and Michael Huang*,
  Worst-case performance analysis of some approximation algorithms for minimizing makespan and flow-time,
  preprint, 2013.

• Shalev Ben-David* and Jim Geelen,
  On Rota's Conjecture and nested separations in matroids,
  preprint, 2013.

• Rutger Campbell* and Peter Nelson,
  Linkages in a directed graph with parity restrictions (PDF),
  preprint, 2013.

• Michael Shantz* and Edlyn Teske
  Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Groebner basis methods - an experimental study,
  Number Theory and Cryptography,
  Lecture Notes in Computer Science, 8260 (2013), 94-107.​

• Gurleen Grewal, Reza Azarderakhsh, Patrick Longa, Shi Hu* and
  David Jao,
  Efficient implementation of bilinear pairings on ARM processors,
  Selected Areas in Cryptography (SAC) 2012,
  Lecture Notes in Computer Science, 7707 (2013), 149-165.

• Lisa Elkin*, Ting Kei Pong and Stephen Vavasis,
  Convex relaxation for finding planted influential nodes in a social network,
  preprint, 2013.

• Ehsan Ebrahimzadeh,Linda Farczadi, Pu Gao, Abbas Mehrabian, Cristiane Sato, Nick Wormald and Jonathan Zung*,
  On the longest paths and the diameter in random Apollonian networks,
  Electronic Notes in Discrete Mathematics,
  43 (2013), 355-365.

2012

• Joseph Cheriyan and Chenglong Zou*,
  On orienting graphs for connectivity: Projective planes and Halin graphs,
  Operations Research Letters,
  40 (2012), 337-341.

• Tor Myklebust, Malcolm Sharpe* and Levent Tuncel,
  Efficient heuristic algorithms for maximum utility product pricing problems (PDF),
  preprint, 2012.

• Ahmad Abdi* and Ricardo Fukasawa,
  On the mixing set with a knapsack constraint,
  preprint, 2012.

• Pu Gao, Yi Su* and Nick Wormald,
  Induced subgraphs in sparse random graphs with given degree sequence,
  European Journal of Combinatorics,
  33 (2012), 1142-1166.

2011

• Wang-Chi Cheung* and Chris Godsil,
  Perfect state transfer in cubelike graphs,
  Linear Algebra and its Applications,
  435 (2011), 2468-2474.

• Romy Shioda, Levent Tuncel and Tor Myklebust*,
  Maximum utility product pricing models and algorithms based on reservation prices,
  Computational Optimization and Applications,
  48 (2011) 157-198.

2010

• Rahul Jain, Ashwin Nayak and Yi Su*,
  A separation between divergence and Holevo information for ensembles,
  Mathematical Structures in Computer Science,
  20 (2010), 977-993.

• Ian Goulden and William Slofstra*,
  Annular embeddings of permutations for arbitrary genus,
  Journal of Combinatorial Theory, Series A,
  117 (2010), 272-288.

• Deeparnab Chakrabarty, Elyot Grant* and Jochen Koenemann,
  On column restricted and priority integer covering programs,
  Integer Programming and Combinatorial Optimization (IPCO) 2010,
  Lecture Notes in Computer Science, 6080 (2010), 355-368.

• Yi Su* and David Wagner,
  The lattice of integer flows of a regular matroid,
  Journal of Combinatorial Theory, Series B,
  100 (2010), 691-703.

• Yichuan Ding, Nathan Krislock, Jiawei Qian* and Henry Wolkowicz,
  Sensor network localization, Euclidean distance matrix completions, and graph realization,
  Optimization and Engineering,
  11 (2010), 45-66.

• David Jao and Vladimir Soukharev*,
  A subexponential algorithm for evaluating large degree isogenies,
  Algorithmic Number Theory,
  Lecture Notes in Computer Science, 6197 (2010), 219-233.

2009

• Qing Cui, Penny Haxell and Will Ma*,
  Packing and covering triangles in planar graphs,
  Graphs and Combinatorics,
  25 (2009), 817-824.

• David Wagner and Yehua Wei*,
  A criterion for the half-plane property,
  Discrete Mathematics,
  309 (2009), 1385-1390.

2008

• Christopher Eagle*, Zhicheng Gao, Mohamed Omar*, Daniel Panario and Bruce Richmond,
  Distribution of the number of encryptions in revocation schemes for stateless receivers,
  Discrete Mathematics and Theoretical Computer Science Proceedings,
  AI (2008), 195-206.

• Jim Geelen, Anjie Guo* and David McKinnon,
  Straight line embeddings of cubic planar graphs with integer edge lengths,
  Journal of Graph Theory,
  58 (2008), 270-274.

• Roberto Avanzi, Nicolas Theriault and Zheng Wang*,
  Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulae,
  Journal of Mathematical Cryptology,
  2 (2008), 227-255.

• Andris Ambainis, Debbie Leung, Laura Mancinska* and Maris Ozols*,
  Quantum random access codes with shared randomness,
  preprint 2008.

• Maurice Cheng* and Chaitanya Swamy,
  Approximation algorithms for single-minded envy-free profit-maximization problems with limited supply (PDF),
  Proceedings of FOCS 2008, 35-44.

• Graeme Kemkes*, Donatella Merlini and Bruce Richmond,

  Maximum Stirling numbers of the second kind,
  Integers: Electronic Journal of Combinatorial Number Theory,
  8 (2008), #A27.

• Romy Shioda, Marcus Shea* and Liping Fu,
  Performance metrics and data mining for assessing schedule qualities in paratransit (PDF),
  Transportation Research Record: Journal of the Transportation Research Board,
  2072 (2008), 139-147.

2007

• David Jackson, Iain Moffatt, and Alejandro Morales*,
  On the group-like behaviour of the Le-Murakami-Ohtsuki invariant,
  Journal of Knot Theory and Its Ramifications,
  16 (2007), 699-718.

2006

• David Jackson and Martha Yip*,
  A symmetric function resolution of the number of permutations with respect to block-stable elements,
  Annals of Combinatorics,
  10 (2006), 463-480.

• Mohammad Omar*, Daniel Panario, Bruce Richmond and Jacki Whitely,
  Asymptotics of largest components in combinatorial structures,
  Algorithmica,
  46 (2006), 493-503.

2004

• Van Anh Truong and Levent Tuncel,
  Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers,
  Mathematical Programming A,
  100 (2004) 295-316.

• Kenny Fong*, Darrel Hankerson, Julio Lopez and Alfred Menezes,
  Field inversion and point halving revisited,
  IEEE Transactions on Computers,
  53 (2004), 1047-1059.

2003

• Graeme Kemkes*, Chiu Fan Lee*, Donatella Merlini and Bruce Richmond,
  Stirling numbers for complex arguments: asymptotics and identities,
  SIAM Journal on Discrete Mathematics,
  16 (2003), 179-191.

• Sabin Cautis* and David Jackson,
  The matrix of chromatic joins and the Temperley-Lieb algebra,
  Journal of Combinatorial Theory, Series B,
  89 (2003), 109-155.

• Ian Goulden and Luis Serrano*,
  Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope,
  Journal of Combinatorial Theory, Series A,
  104 (2003), 317-326.

2002

• Douglas Stebila* and Stefan Wolf,
  Efficient oblivious transfer from any non-trivial binary-symmetric channel,
  Proceedings of the 2002 IEEE International Symposium on Information Theory, 2002.

2001

• Michael Ludkovski* and Guang Gong,
  New families of ideal 2-level autocorrelation ternary sequences from second order DHT,
  Electronic Notes in Discrete Mathematics,
  6 (2001), 375-384.

• Ian Goulden, David Jackson and Frederic Latour*,
  Inequivalent transitive factorizations into transpositions,
  Canadian Journal of Mathematics,
  53 (2001), 758-779.

• Michael Brown*, Darrel Hankerson, Julio Lopez and Alfred Menezes,
  Software implementation of the NIST elliptic curves over prime fields,
  Topics in Cryptology - CT-RSA 2001,
  Lecture Notes in Computer Science, 2020 (2001), 250-265.

2000

• Raju Chelluri*, Bruce Richmond and Nico Temme,
  Asymptotic estimates for generalized Stirling numbers (PDF),
  Analysis,
  20 (2000), 1-13.

• Michael Brown*, Donny Cheung*, Darrel Hankerson, Julio Lopez, Michael Kirkup* and Alfred Menezes,
  PGP in constrained wireless devices,
  9th USENIX Security Symposium, 2000.

1999

• Bill Cunningham and Lawrence Tang*,
  Optimal 3-terminal cuts and linear programming,
  Integer Programming and Combinatorial Optimization (IPCO) 1999,
  Lecture Notes in Computer Science, 1610 (1999), 114-125.

• Tamon Stephen* and Levent Tuncel,
  On a representation of the matching polytope via semidefinite liftings,
  Mathematics of Operations Research,
  24 (1999) 1-7.

1998

• Jason Bell*, Peter Borwein and Bruce Richmond,
  Growth of the product ∏nj=1(1-xaj) (PDF),
  Acta Arithmetica,
  86 (1998), 155-170.