Marko Djukanovic | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/marko-djukanovic/Marko DjukanovicHugo Blox Builder (https://hugoblox.com)en-usMon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/media/logo_hu10234977157890132473.pngMarko Djukanovichttps://ac.tuwien.ac.at/team/marko-djukanovic/Signed Double Roman Domination on Cubic Graphshttps://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/signed-double-roman-domination-on-cubic-graphs/Graph Search and Variable Neighborhood Search for Finding Constrained Longest Common Subsequences in Artificial and Real Gene Sequenceshttps://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/graph-search-and-variable-neighborhood-search-for-finding-constrained-longest-common-subsequences-in-artificial-and-real-gene-sequences/Exact and heuristic approaches for solving string problems from bioinformaticshttps://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-string-problems-from-bioinformatics/Wed, 01 Dec 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-solving-string-problems-from-bioinformatics/Solving the Generalized Constrained Longest Common Subsequence Problem with Many Pattern Stringshttps://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-generalized-constrained-longest-common-subsequence-problem-with-many-pattern-strings/Solving the Longest Common Subsequence Problem Concerning Non-uniform Distributions of Letters in Input Stringshttps://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings/Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Stringshttps://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-the-longest-common-subsequence-problem-concerning-non-uniform-distributions-of-letters-in-input-strings-2/Two new Mixed-Integer Linear Programming Models for Solving the Multidimensional Multi-Way Number Partitioning Problemhttps://ac.tuwien.ac.at/publication/two-new-mixed-integer-linear-programming-models-for-solving-the-multidimensional-multi-way-number-partitioning-problem/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/two-new-mixed-integer-linear-programming-models-for-solving-the-multidimensional-multi-way-number-partitioning-problem/A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculationhttps://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-beam-search-for-the-longest-common-subsequence-problem-guided-by-a-novel-approximate-expected-length-calculation/An A* Search Algorithm for the Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem-2/An A* Search Algorithm for the Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/an-a-search-algorithm-for-the-constrained-longest-common-subsequence-problem/Anytime Algorithms for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem/Finding Longest Common Subsequences: New anytime A$^*$ Search Resultshttps://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-anytime-a-search-results/On Solving a Generalized Constrained Longest Common Subsequence Problemhttps://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-solving-a-generalized-constrained-longest-common-subsequence-problem/On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequenceshttps://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/on-the-use-of-decision-diagrams-for-finding-repetition-free-longest-common-subsequences/Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problemhttps://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem-2/Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problemhttps://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/solving-longest-common-subsequence-problems-via-a-transformation-to-the-maximum-clique-problem/A Heuristic Approach for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem-2/A Heuristic Approach for Solving the Longest Common Square Subsequence Problemhttps://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-heuristic-approach-for-solving-the-longest-common-square-subsequence-problem/Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/exact-and-heuristic-approaches-for-the-longest-common-palindromic-subsequence-problem/Finding Longest Common Subsequences: New A* Anytime Resultshttps://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/finding-longest-common-subsequences-new-a-anytime-results/Anytime Algorithms for the Longest Common Palindromic Subsequence Problemhttps://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/anytime-algorithms-for-the-longest-common-palindromic-subsequence-problem-2/