Disretācijas

Ķikusts P.B. Parastu grafu lokāli-globāla analīze, 1977, (krieviski).

Zinatniskās publikācijas

Grafu teorija

Ķikusts P.B. Neorientēta unigrafa pilno apakšgrafu atrašana, PSRS Valsts Algoritmu un programmu fonds (GosFAP), 1971, inv.N P000127 (krieviski).

Ķikusts P.B. Par grafu struktūru pie izomorfam visu virsotņu apkaimem, deponēts PSRS Vissavienibas zinātniskas un tehniskas informācijas institūta (VINITI), 1972, N 4817-72 Dep (krieviski).

Ķikusts P.B. Hamiltona cikls regulārā grafa ar pakāpi 5, deponēts PSRS Vissavienibas zinātniskās un tehniskās informācijas instituta (VINITI), 1972, N 4872-72 Dep (krieviski).

Ķikusts P.B. Hamiltona cikls regulārā grafa, deponēts PSRS Vissavienibas zinātniskās un tehniskās informācijas instituta (VINITI), 1973, N 5666-73 Dep (krieviski).

Ķikusts P.B. Par cirkularu grafu uzbūvi, LVU Zinātniskie raksti, 242. sējums, 1975, lpp.120-127. (krieviski).

Ķikusts P.B. Par Hamiltona cikla eksistenci regulārā grafā ar pakāpi 5, Latvijas Matemātikas gadagramāta 16, "Zinātne", Rīga, 1975, lpp.33-38. (krieviski).

Ķikusts P.B. Sadalamiba grafu klases, Latvijas Matematikas gadagramata 20, "Zinatne", Rīga, 1976, lpp.180-189. (krieviski).

Ķikusts P.B. Parlases organizēšana grafa lielakās kliķes meklēšanai, Latvijas Matemātikas gadagrāmata 23, "Zinātne", Rīga, 1979, lpp.147-150. (krieviski).

Ķikusts P.B. Grafu izomorfisma noteikšanas algoritms un tā pielietošana logisko tīklu identificēšana, Automātika un skaitļošanas tehnika, N 4, 1979, lpp.21-27. (krieviski).

Ķikusts P.B. Parastu neorientētu grafu izomorfisma noteikšana, PSRS Valsts Algoritmu un programmu fonds (GosFAP), 1979, inv.N P004130 (krieviski).

Ķikusts P.B. Par pieredzi grafu-teoretisku eksperimentu veikšanā ar ESM, Grafu un tiklu otimizācijas uzdevumu risināšanas metodes un programmas, PSRS ZA, Novosibirska, 1980 (krieviski).

Ķikusts P.B. Regulāru gadījuma grafu ģenerators, PSRS Valsts Algoritmu un programmu fonds (GosFAP), 1982, inv.N P005605 (krieviski).

P.Ķikusts, Another algorithm determining the independence number of a graph, EIK, 22, 1986, pp.157-166.

Ķikusts P.B., Ručevskis P.B. Grafu izomorfisma noteikšanas algoritms, Republikāniskā zinātniski-tehniskā konference, RPI, Rīga, 1987, lpp.21-21. (krieviski).

D.Zeps, P.Ķikusts. Graphs on surfaces as combinatorial rotations, Acta. Soc. Math. Latviensis, No. 95.01, Rīga, 1995, pp.5455.

I.Etmane, P.Ķikusts, P.Ručevskis. Basic principles and layout algorithms of GRADE Windows graphic editors, Proc. of Int. Workshop on Constraints for Graphics and Visualization, Marseille, France, September 18, 1995.

P.Ķikusts, P.Ručevskis. Layout algorithms of graph-like diagrams for GRADE Windows graphic editors, - Proc. of Symposium Graph Drawing '95, Lecture Notes in Computer Science, Vol. 1027, 1996, pp.361-364.

P.Ķikusts, P.Ručevskis. Godalgotie grafu zimejumi, - Fig. 3, 9 in P.Eades and J.Marks, Graph-drawing contest report, - Proc. of Symposium Graph Drawing '95, Lecture Notes in Computer Science, Vol. 1027, 1996, pp. 227, 232.

P. Ķikusts. Grafi un attēli apbrīnojama simbioze, Acta. Soc. Math. Latviensis, No. 97.02, Rīga, 1997, pp.4243.

A.Brāzma, P.Ķikusts, P.Ručevskis. Drawing methabolic pathways by GRADE graphic editor, - Proc. Int. Workshop Frontiers In Visualisation and Human-Computer Interaction '97, Eropean Bioinformatics Institute, Cambridge, UK, 1011 Dec, 1997.

K.Freivalds, P.Ķikusts. Godalgotie grafu zimējumi, - Fig. 2. 6 in F.J.Brandenburg et al., Graph-drawing contest report, Proc. of 1999 Graph Drawing Symposium, Lecture Notes in Computer Science, Vol. 1731, 1999, pp. 402, 406.

P.Ķikusts. Mathematical principles of graph-like diagram drawing tool. Acta Societatis Mathematicae Latviensis, No 3, 2000, 4748.

K.Freivalds, P.Ķikusts. Optimum layout adjustment supporting ordering constraints in graph-like diagram drawing. Proc. of the Latvian Academy of Sciences, Section B, Vol. 55, No 1, 2001, pp. 43-51.

K.Freivalds, U.Dogrusoz, P.Ķikusts. Disconnected graph layout and the polyomino packing approach. Proc. of Symposium Graph Drawing 2001, Lecture Notes in Computer Science, vol. 2265, 2002, pp. 378-391.

D.Zeps. Testing of the algorithm to find a planar part in the graph, Vilnius, 1982, 5pp.

D.Zeps. Exhaustive search algorithm to find Hamiltonian Cycle in Graphs, EIK, 16, 1-3, Berlin, Akademie-Verlag, 1982, 69 - 75.

D.Zeps. Packet of Programs of graph theoretical algorithms: planarity and implementation of the graph, Novosibirsk, 1982, 4pp.

D.Zeps. On the Dynamic Partitioning of the Graph in Three connected Components, Republican Fund of Algorithms and Programs, Inv. N. UA0003Rīga, 1984, 16pp.

D.Zeps, J.Kratochvil. On the Minimum Number of Hamiltonian Cycles in Triangulations, KAM MFF UK, N15, Prague, 1987., 8pp.

D.Zeps, J.Kratochvil. On Hamiltonian cycles in Two Triangle graphs, Acta Universitatis Carolinae, Vol.28, Prague, 1987, 73-78.

D.Zeps.Another Theory of Triconnectivity. Prague, KAM MFF UK, N 90-168, Prague, 1992., 6pp.

D.Zeps, J.Dambitis. An Overview of Three Works of E. Grinbergs in Graph theory and Combinatorics, Acta Universitatis Latviensis, 588, Mathematics, 1993, 7-14.

D.Zeps, P. Ķikusts. Graphs on surfaces, Conf. LMS, Rīga, 1994.

D.Zeps.Graphs with rotation in permutation technique, KAM Series, N 94-274, 1994, Prague, Charles University, 8pp.

D.Zeps.Graphs as rotations, KAM Series, 96-327, Prague, 1996, 9pp.

D.Zeps.Graphs with rotations II: partial maps, unpublished, 1996, 11pp

D.Zeps.Graphs with rotations: partial maps, KAM Series, DIMATIA, 97-365, 1996, 12pp.

D.Zeps.The use of the combinatorial map theory in graph topological computations , KAM Series, DIMATIA, 97-364, Prague, 1997, 8pp.

D.Zeps.Free minor closed classes and the Kuratowski theorem, KAM Series DIMATIA, 98-409, Prague, 1998, pp.

D.Zeps.Using Combinatorial Maps in Graph topological Computations , KAM Series, DIMATIA, 99-438, Prague, 1999, 11pp.

D.Zeps.Kuratowski theorem from below, in Acta Societatis Mathematicae Latviensis, No3, 2000, pp. 69-70.

D.Zeps.Trying to Prove Kuratowski Theorem from Below, KAM Series, DIMATIA, 2000-489, Prague, 2000, 11pp.

D.Zeps.On Free Minor Closed Classes of Graphs Outside Planarity, KAM Series, DIMATIA, 2001-543, Prague, 2001, 11pp.

D.Zeps.Latin Dictionary Tools in Internet, Human Language technologies, the Baltic Perspective, 1st Baltic conference, Rīga, April 2004, pp179-182.

D.Zeps.Free Planar Graphs on Torus, in Acta Societatis Mathematicae Latviensis, No6, 2004, pp. ..-...

D.Zeps.Free Planar Graphs on Torus: examining triconnected graphs for unbounded augmentability, KAM Series, DIMATIA, 2004-699, Prague, 2004, 8pp.

K.Freivalds Nondifferentiable optimization based algorithm for graph ratio-cut partitioning, Scientific Papers University of Latvia, vol. 669, pp. 61–79. University of Latvia, 2004.

K. Freivalds, A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning, Workshop on Experimental and Efficient Algorithms (WEA 2003), Lecture Notes in Computer Science vol. 2647,  pp. 134–147. Springer-Verlag, 2003.

J. Rung, T. Schlitt, A. Brāzma, K. Freivalds, J. Vilo Building and analysing genome-wide gene disruption networks. Bioinformatics 2002 Oct;18 Suppl 2:S202-210. European Conference on Computational Biology (ECCB 2002)

K. Freivalds, U. Dogrusoz, and P. Ķikusts, Disconnected Graph Layout and the Polyomino Packing Approach, Proc. of Graph Drawing 2001, Lecture Notes in Computer Science, vol. 2265, pp. 378-391, Springer-Verlag, 2002.

K. Freivalds, Curved Edge Routing, Proc. of the Symposium on Fundamentals of Computation Theory 2001, LNCS vol. 2138, pp. 126–137.

K. Freivalds, P. Ķikusts  Optimum Layout Adjustment Supporting Ordering Constraints in Graph-Like Diagram Drawing. Proc. of the Latvian Academy of Sciences, Section B, Vol. 55 (2001), No. 1, pp. 43–51.

K. Freivalds Basic Algorithms for Graph-Like Diagram Layout  Masters thesis, University of Latvia 1999.

P. Ķikusts, P. Ručevskis  Layout Algorithms of Graph-Like Diagrams for GRADE Windows Graphic Editors. Proc. of Graph Drawing ’95, Lecture Notes in Computer Science, vol. 1027, 1996, pp. 361–364.