A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack searchKumlander, DenissProceedings of the Forth International Conference on Engineering Computational Technology2004 / p. 137 A practical algorithm for the maximum clique findingKumlander, DenissProceedings of the IADIS International Conference Applied Computing 2006 : San Sebastian, Spain, 2006, February 25-282006 / p. 266-272 https://www.iadisportal.org/digital-library/a-practical-algorithm-for-the-maximum-clique-finding A simple and efficient algorithm for the maximum clique finding reusing a heuristic vertex colouringKumlander, DenissIADIS international journal on computer science and information system2006 / 2, p. 32-49 https://www.iadisportal.org/ijcsis/papers/2006110203.pdf An algebraic approach to the structure of graphsBuldas, Ahto1999 http://www.ester.ee/record=b1273064*est An extended comparison of the best known algorithms for finding the unweighted maximum cliqueKumlander, DenissModelling, computation and optimization in information systems and management sciences2008 / p. 175-181 https://www.researchgate.net/publication/221451751_An_Extended_Comparison_of_the_Best_Known_Algorithms_for_Finding_the_Unweighted_Maximum_Clique Anwendung der Graphentheorie zur Optimierung von FertigungsprozessenKüttner, Rein; Kochan, D.Technishe Universität Dresden : Als Manuskript gedruckt = Труды ТУ Дрезден, № 14.10.19781978 / S. 1-12 Artificial intelligence in the maximum clique finding problem applicationsKumlander, DenissProceedings of the WSEAS Conference : 7th WSEAS International Conference on Automation & Information (ICAI'06) : Cavtat, Croatia, June 13-15, 20062006 / p. 132-137 https://www.researchgate.net/publication/234778320_Artificial_intelligence_in_the_maximum_clique_finding_problem_applications Automation of chemical plant modellingAarna, OlavAutomatica1980 / p. 649-661 https://www.ester.ee/record=b1199422*est https://doi.org/10.1016/0005-1098(80)90007-2 Beta assertive graphsBellucci, Francesco; Chiffi, Daniele; Pietarinen, Ahti-VeikkoDiagrammatic representation and inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020 : proceedings2020 / p. 525-529 https://doi.org/10.1007/978-3-030-54249-8_49 Conference proceedings at Scopus Article at Scopus Conference proceedings at WOS Article at WOS Beta assertive graphs : proofs of assertions with quantificationBellucci, Francesco; Chiffi, Daniele; Pietarinen, Ahti-VeikkoJournal of applied logics : IfCoLog journal of logics and their applications2021 / 23 p. : ill https://www.collegepublications.co.uk/downloads/ifcolog00044.pdf Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS The BlotPietarinen, Ahti-Veikko; Bellucci, Francesco; Bobrova, Angelina; Haydon, Nathan Joseph; Shafiei, MohammadDiagrammatic representation and inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020 : proceedings2020 / p. 225-238 : ill https://doi.org/10.1007/978-3-030-54249-8_18 Conference proceedings at Scopus Article at Scopus Article at WOS Conference proceedings at WOS Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouringKumlander, DenissProceedings of the WSEAS Conference : 10th WSEAS Conference on Computers : Vouliagmeni, Athens, Greece, July 10-15, 20062006 / p. 932-937 https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=6a835c6002434a8e0985d850356794d9bc74879e Compositional diagrammatic first-order logicHaydon, Nathan Joseph; Sobocinski, Pawel MariaDiagrammatic representation and inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020 : proceedings2020 / p. 402-418 https://doi.org/10.1007/978-3-030-54249-8_32 Conference proceedings at Scopus Article at Scopus Conference proceedings at WOS Article at WOS Diagrammatic algebra of first order logicBonchi, Filippo; Di Giorgio, Alessandro; Haydon, Nathan Joseph; Sobocinski, Pawel MariaLICS '24 : proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science2024 / art. 16, p. 1-15 : ill https://doi.org/10.1145/3661814.3662078 Diagrammatic algebra of first order logic : [preprint]Bonchi, Filippo; Di Giorgio, Alessandro; Haydon, Nathan Joseph; Sobocinski, Pawel MariaarXiv.org2024 / 34 p. : ill https://doi.org/10.48550/arXiv.2401.07055 Diagrammatic Representation and Inference : 10th International Conference, Diagrams 2018, Edinburgh, UK, June 18-22, 2018 : proceedings2018 https://doi.org/10.1007/978-3-319-91376-6 Diagrammatic Representation and Inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020 : proceedings2020 https://doi.org/10.1007/978-3-030-54249-8 Distributed average integral control based energy management modelShaukat, Neelofar; Khan, Bilal; Qureshi, Muhammad Bilal; Jawad, Muhammad; Shabbir, Noman; Daniel, Kamran2023 IEEE International Conference on Energy Technologies for Future Grids (ETFG)2023 / 5 p https://doi.org/10.1109/ETFG55873.2023.10407358 Engineering of an effective automatic dynamic assertion mining platformGhasempouri, Tara; Malburg, Jan; Danese, Alessandro; Pravadelli, Graziano; Fey, Goerschwin; Raik, JaanVLSI-SoC 2019 : 27th IFIP/IEEE International Conference on Very Large Scale Integration : [proceedings]2019 / p. 111-116 : ill https://doi.org/10.1109/VLSI-SoC.2019.8920331 An experimental comparison of heuristic coloring algorithms in terms of found color classes on random graphsKumlander, Deniss; Kulitškov, AlekseiWCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications2020 / p. 365-375 https://doi.org/10.1007/978-3-030-21803-4_37 Conference proceedings at Scopus Article at Scopus Failure consequence evaluation of uncontrollable district heating networkMao, Ding; Wang, Peng; Ju, Yuchen; Ni, LongSustainable cities and society2022 / art. 103593, 16 p. : ill https://doi.org/10.1016/j.scs.2021.103593 Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS Finding the description of structure by counting method : a case studyPeder, Ahti; Tombak, MatiSOFSEM 2011 : Theory and Practice of Computer Science : 37th Conference on Current Trends in Theory and Practice of Computer Science : Nový Smokovec, Slovakia, January 22-28, 2011 : proceedings2011 / p. 455-466 : ill https://link.springer.com/chapter/10.1007/978-3-642-18381-2_38 GraafidBuldas, Ahto; Laud, Peeter; Villemson, Jan2008 https://www.ester.ee/record=b2345899*est GraafidBuldas, Ahto; Laud, Peeter; Villemson, Jan2003 https://www.ester.ee/record=b1804744*est Graafiteooria elemente : loengukonspektPuusemp, Peeter2000 https://www.ester.ee/record=b1462950*est Icons, interrogations, and graphs: On Peirce's integrated notion of abductionPietarinen, Ahti-Veikko; Bellucci, FrancescoTransactions of the Charles S. Peirce Society2020 / p. 43-61 https://doi.org/10.2979/trancharpeirsoc.56.1.03 Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS Improving the maximum clique finding applications by using artificial intelligence principlesKumlander, DenissWSEAS transactions on computers2006 / 8, p. 1726-1732 https://www.researchgate.net/publication/288446461_Improving_the_maximum_clique_finding_applications_by_using_artificial_intelligence_principles Improving the maximum-weight clique algorithm for the dense graphsKumlander, DenissProceedings of the WSEAS Conference : 10th WSEAS Conference on Computers : Vouliagmeni, Athens, Greece, July 10-15, 20062006 / p. 938-943 International Workshop on Graph and Model Transformation : GraMoT 2005 : Tallinn, Estonia, 28 September 2005 : preproceedingsKarsai, Gabor; Taentzer, Gabriele2005 https://www.ester.ee/record=b2074633*est Klassidiagrammide automaatpaigutusKuusik, Ago1994 https://www.ester.ee/record=b2111062*est Logic of the future : writings on existential graphs. Volume 1. History and applicationsPeirce, Charles S.2020 https://doi.org/10.1515/9783110651409 Maailmas toimuvale uut moodi otsavaatamisest (Gray koodist ja XOR-tehtest)Võhandu, LeoA & A2006 / 5, lk. 47-61 https://artiklid.elnet.ee/record=b1019639*est A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack searchKumlander, DenissModelling, Computation and Optimization in Information Systems and Management Sciences : Metz, France2004 / p. 202-208 Notational differencesBellucci, Francesco; Pietarinen, Ahti-VeikkoActa Analytica2020 / p. 289-314 https://doi.org/10.1007/s12136-020-00425-1 Journal metrics at Scopus Article at Scopus Journal metrics at WOS Article at WOS NP-hard graph problems' algorithms testing guidelines : artificial intelligence principles and testing as a serviceKumlander, DenissAdvances in computer and information sciences and engineering2008 / p. 114-118 : ill https://link.springer.com/chapter/10.1007/978-1-4020-8739-4_20 NP-hard graph problems' algorithms testing guidlines : artificial intelligence principles and testing as a serviceKumlander, DenissInnovative techniques in instruction technology, e-learning, e-assessment, and education2008 / p. 112-116 https://link.springer.com/chapter/10.1007/978-1-4020-8739-4_20 On places suitable for applying Al principles in NP-hard graph problem's algorithmsKumlander, DenissProceedings of the IASTED Conference on Artificial Intelligence and Applications as part of the 25th IASTED International Multi-Conference on Applied Informatics : Innsbruck, Austria, 12-14.02.20072007 / p. 284-288 https://dl.acm.org/doi/abs/10.5555/1295303.1295352 Problems of optimization : an exact algorithm for binding a maximum clique optimized for the dense graphsKumlander, DenissISMP2003 : Copenhagen, 2003 : program and abstracts book2003 / p. 114 https://kirj.ee/wp-content/plugins/kirj/pub/phys-2-2005-79-86_20211016172808.pdf Reversed search maximum clique algorithm based on recoloringKumlander, Deniss; Porošin, AleksandrWCGO 2019: Optimization of Complex Systems: Theory, Models, Algorithms and Applications2020 / p. 458-467 https://doi.org/10.1007/978-3-030-21803-4_46 Conference proceedings at Scopus Article at Scopus Self-organizing approach to graph vertex colouring in the applications of ad hoc networksKirt, Toomas; Võhandu, LeoProceedings of the 10th WSEAS Conference on Computers : Vouliagmeni, Athens, Greece, July 10-15, 20062006 / ? p https://www.researchgate.net/publication/262353001_Self-organizing_approach_to_graph_vertex_colouring_in_the_applications_of_ad_hoc_networks Some practical algorithms to solve the maximum clique problemKumlander, Deniss2005 https://www.ester.ee/record=b2097511*est Sümmeetrilise binaarse relatsiooni lähendamisest ekvivalentsusrelatsiooniga : magistritööVeiner, Guido1992 https://www.ester.ee/record=b2630628*est Two implications and dual-process theories of reasoningBobrova, Angelina; Pietarinen, Ahti-VeikkoDiagrammatic representation and inference : 11th International Conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020 : proceedings2020 / p. 239-243 https://doi.org/10.1007/978-3-030-54249-8_19 Conference proceedings at Scopus Article at Scopus Conference proceedings at WOS Article at WOS Using weighted graph coloring heuristics for architecture explorationEllervee, Peeter; Klaar, Tarmo19th NORCHIP Conference, Kista, Sweden, 12-13 November 2001 : proceedings2001 / p. 161-166 : ill Why images cannot be arguments, but moving ones mightChampagne, Marc; Pietarinen, Ahti-VeikkoArgumentation2020 / p. 207–236 https://doi.org/10.1007/s10503-019-09484-0 Вопросы исследования графов, грамматик, функций1976 https://www.ester.ee/record=b1433013*est https://digikogu.taltech.ee/et/Item/ab9b20b3-9208-4a18-88a2-da1e0f43137f О математическом описании и оптимизации химико-технологических комплексовAarna, OlavТруды по электротехнике и автоматике : сборник статей. 91971 / с. 63-72 https://www.ester.ee/record=b2190156*est https://digikogu.taltech.ee/et/Item/945ec07e-d7b0-466e-bc24-6ad904a829e9/ О циклических разложениях обобщенных графовMullat, JossifОчерки по обработке информации и функциональному анализу1971 / с. 31-36 https://www.ester.ee/record=b1356667*est https://digikogu.taltech.ee/et/Item/a431c49f-a972-4e58-916b-947eea59962d Поиск внутренне устойчивого множества на деревеPaluoja, Rein; Kuusik, Rein, inform.Вопросы исследования графов, грамматик, функций1976 / с. 11-22 : илл https://www.ester.ee/record=b1433013*est https://digikogu.taltech.ee/et/Item/ab9b20b3-9208-4a18-88a2-da1e0f43137f Применение теорий многополюсников и сигнальных графов к расчету частотных характеристик объемных гидроприводов на ЭЦВМGrossschmidt, GunnarСборник статей по машиностроению. 121975 / с. 3-16 : илл https://www.ester.ee/record=b2190717*est https://digikogu.taltech.ee/et/Item/7b7310bb-55bb-4584-a47b-63fe4d08b6a9 Соотношение между количеством ребер и вершин в графахKorrovits, HarriТруды экономического факультета. 131974 / с. 3-13 : илл https://www.ester.ee/record=b2190639*est https://digikogu.taltech.ee/et/Item/1a203a6e-07a5-4c4f-9e1b-dd24357eb552