A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. - Alexander Golynski; Joseph Douglas Horton (SWAT, 2002)

Curves of width one and the river shore problem. - Timothy M. Chan; Alexander Golynski; Alejandro López-Ortiz; Claude-Guy Quimper (CCCG, 2003)

Sufficiently Fat Polyhedra are Not 2-Castable. - Alexander Golynski; David Bremner (CCCG, 2003)

the asteroid surveying problem and other puzzles. - Timothy M. Chan; Alexander Golynski; Alejandro López-Ortiz; Claude-Guy Quimper (SCG, 2003)

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. - Claude-Guy Quimper; Peter van Beek; Alejandro López-Ortiz; Alexander Golynski; Sayyed Bashir Sadjad (CP, 2003)

Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. - Therese Biedl; Erik D. Demaine; Alexander Golynski; Joseph Douglas Horton; Alejandro López-Ortiz; Guillaume Poirier; Claude-Guy Quimper (ESA, 2003)

Improved Algorithms for the Global Cardinality Constraint. - Claude-Guy Quimper; Alejandro López-Ortiz; Peter van Beek; Alexander Golynski (CP, 2004)

Longest increasing subsequences in sliding windows. - Michael H. Albert; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; S. Srinivasa Rao 001; Mohammad Ali Safari (Theor. Comput. Sci., 2004)

An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint. - Claude-Guy Quimper; Alexander Golynski; Alejandro López-Ortiz; Peter van Beek (Constraints An Int. J., 2005)

Rank/select operations on large alphabets: a tool for text indexing. - Alexander Golynski; J. Ian Munro; S. Srinivasa Rao 001 (SODA, 2006)

On the Size of Succinct Indices. - Alexander Golynski; Roberto Grossi; Ankur Gupta 003; Rajeev Raman; S. Srinivasa Rao 001 (ESA, 2007)

Adaptive searching in succinctly encoded binary relations and tree-structured documents. - Jérémy Barbay; Alexander Golynski; J. Ian Munro; S. Srinivasa Rao 001 (Theor. Comput. Sci., 2007)

Optimal lower bounds for rank and select indexes. - Alexander Golynski (Theor. Comput. Sci., 2007)

Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures. - Alexander Golynski (2007)

On the Redundancy of Succinct Data Structures. - Alexander Golynski; Rajeev Raman; S. Srinivasa Rao 001 (SWAT, 2008)

Cell probe lower bounds for succinct data structures. - Alexander Golynski (SODA, 2009)

Sorting with networks of data structures. - Therese Biedl; Alexander Golynski; Angèle M. Hamel; Alejandro López-Ortiz; J. Ian Munro (Discret. Appl. Math., 2010)

On the complexity of routing in wireless multihop network. - Sonia Waharte; Alexander Golynski; Raouf Boutaba (IWCMC, 2012)

Optimal strategies for the list update problem under the MRM alternative cost model. - Alexander Golynski; Alejandro López-Ortiz (Inf. Process. Lett., 2012)

Optimal Indexes for Sparse Bit Vectors. - Alexander Golynski; Alessio Orlandi; Rajeev Raman; S. Srinivasa Rao 001 (Algorithmica, 2014)

Zanzibar: Google's Consistent, Global Authorization System. - Ruoming Pang; Ramón Cáceres; Mike Burrows; Zhifeng Chen; Pratik Dave; Nathan Germer; Alexander Golynski; Kevin Graney; Nina Kang; Lea Kissner; Jeffrey L. Korn; Abhishek Parmar; et al. (USENIX ATC, 2019)