Comparison of Two MST Algorithms for Associative Parallel Processors. - A. S. Nepomniaschaya (PaCT, 1995)

An Associative Version of the Prim-Dijkstra Algorithm and Its Application to Some Graph Problems. - A. S. Nepomniaschaya (Ershov Memorial Conference, 1996)

Representation of the Gabow Algorithm for Finding Smallest Trees with a Degree Constraint on Associative Parallel Processors. - A. S. Nepomniaschaya (Euro-Par, Vol. I, 1996)

Representations of the Prim-Dijkstra Algorithm on Associative Parallel Processors. - A. S. Nepomniaschaya (Parcella, 1996)

Solution of Path Problems Using Associative Parallel Processors. - A. S. Nepomniaschaya (ICPADS, 1997)

An Associative Parallel Algorithm for Finding a Critical Cycle in Directed Graphs. - A. S. Nepomniaschaya (ICPADS, 2000)

A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors. - A. S. Nepomniaschaya; Maria A. Dvoskina (Fundam. Informaticae, 2000)

Efficient Implementation of Edmond's Algorithm for Finding Optimum Branchings on Associative Parallel Processors. - A. S. Nepomniaschaya (ICPADS, 2001)

An Associative Version of the Bellman-Ford Algorithm for Finding the Shortest Paths in Directed Graphs. - A. S. Nepomniaschaya (PaCT, 2001)

Representation of Edmonds' Algorithm for Finding Optimum Graph Branching on Associative Parallel Processors. - A. S. Nepomniaschaya (Program. Comput. Softw., 2001)

Associative Parallel Algorithms for Computing Functions Defined on Paths in Trees. - A. S. Nepomniaschaya (PARELEC, 2002)

Associative Parallel Algorithms for Dynamic Edge Update of Minimum Spanning Trees. - A. S. Nepomniaschaya (PaCT, 2003)

Associative Graph Processor and Its Properties. - A. S. Nepomniaschaya; Zbigniew Kokosinski (PARELEC, 2004)

Associative Parallel Algorithm for Dynamic Reconstruction of a Minimum Spanning Tree After Deletion of a Vertex. - A. S. Nepomniaschaya (PaCT, 2005)

Associative Version of Italiano's Decremental Algorithm for the Transitive Closure Problem. - Anna Nepomniaschaya (PaCT, 2007)

Efficient Implementation of the Italiano Algorithms for Updating the Transitive Closure on Associative Parallel Processors. - Anna Nepomniaschaya (Fundam. Informaticae, 2008)

Associative Version of the Ramalingam Decremental Algorithm for Dynamic Updating the Single-Sink Shortest-Paths Subgraph. - Anna Nepomniaschaya (PaCT, 2009)

Efficient Associative Algorithm for Finding the Second Simple Shortest Paths in a Digraph. - Anna Nepomniaschaya (PaCT, 2011)

Efficient Parallel Implementation of the Ramalingam Decremental Algorithm for Updating the Shortest Paths Subgraph. - Anna Nepomniaschaya (Comput. Informatics, 2013)

Constructions Used in Associative Parallel Algorithms for Directed Graphs. - Anna Nepomniaschaya (PaCT, 2015)