Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.1
1.8
Journals
Algorithms
Special Issues
Selected Algorithmic Papers from IWOCA 2024
share announcement

Selected Algorithmic Papers from IWOCA 2024

A special issue of Algorithms (ISSN 1999-4893). This special issue belongs to the section "Combinatorial Optimization, Graph, and Network Algorithms".

Deadline for manuscript submissions: closed (1 December 2024) | Viewed by 5511

Special Issue Editor

Dr. Adele Anna Rescigno

E-Mail Website
Guest Editor
Department of Computer Science, University of Salerno, 84084 Fisciano, Salerno, Italy
Interests: design and analysis of algorithms; network algorithms; social network analysis; parameterized algorithms and complexity; combinatorial structures
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The 35th International Workshop on Combinatorial Algorithms IWOCA 2024 is an annual international conference held in Italy. IWOCA 2024 is designed to cover a broad range of topics in Algorithmics and Combinatorial Structures. Further details can be found here: http://iwoca2024.di.unisa.it/.

Several extended conference papers regarding algorithms will be invited to this Special Issue of the Algorithms journal to be published in open access form. The Special Issue is also open for papers not presented at the Workshop, whose topics fit that of IWOCA 2024.

Dr. Adele Anna Rescigno
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Algorithms is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • ad hoc, dynamic and evolving networks
  • algorithms and data structures
  • algorithms on strings and graphs
  • algorithms for big data and networks analytics
  • algorithmic game theory
  • approximation algorithms
  • circuits and boolean functions
  • combinatorial generation, enumeration, and counting
  • combinatorial optimization
  • complexity theory
  • combinatorics of words
  • computational algebra and geometry
  • computational biology
  • cryptography and information security
  • distributed and parallel algorithms
  • experimental evaluation of algorithms
  • fine-grained complexity
  • foundations of cloud computing
  • graph algorithms for social network analysis
  • graph drawing and labelling
  • graph theory and combinatorics
  • mobile agents
  • new paradigms of computation
  • online algorithms
  • parameterized and exact algorithms
  • probabilistic and randomized algorithms
  • scheduling
  • streaming algorithms

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (5 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

19 pages, 566 KiB  
Article
Enumerating Minimal Vertex Covers and Dominating Sets with Capacity and/or Connectivity Constraints
by Yasuaki Kobayashi, Kazuhiro Kurita, Kevin Mann, Yasuko Matsui and Hirotaka Ono
Algorithms 2025, 18(2), 112; https://doi.org/10.3390/a18020112 - 17 Feb 2025
Viewed by 395
Abstract
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs. For the case of minimal connected vertex covers, our algorithms run in [...] Read more.
In this paper, we consider the minimal vertex cover and minimal dominating sets with capacity and/or connectivity constraint enumeration problems. We develop polynomial-delay enumeration algorithms for these problems on bounded-degree graphs. For the case of minimal connected vertex covers, our algorithms run in polynomial delay, even on the class of d-claw free graphs. This result is extended for bounded-degree graphs and outputs in quasi-polynomial time on general graphs. To complement these algorithmic results, we show that the minimal connected vertex cover, minimal connected dominating set, and minimal capacitated vertex cover enumeration problems in 2-degenerated bipartite graphs are at least as hard as enumerating minimal transversals in hypergraphs. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
►▼ Show Figures

Figure 1

13 pages, 263 KiB  
Article
Broadcasting in Stars of Cliques and Path-Connected Cliques
by Akash Ambashankar and Hovhannes A. Harutyunyan
Algorithms 2025, 18(2), 76; https://doi.org/10.3390/a18020076 - 1 Feb 2025
Viewed by 484
Abstract
Broadcasting is a fundamental information dissemination problem in a connected network where one node, referred to as the originator, must distribute a message to all other nodes through a series of calls along the network’s links. Once informed, nodes assist the originator by [...] Read more.
Broadcasting is a fundamental information dissemination problem in a connected network where one node, referred to as the originator, must distribute a message to all other nodes through a series of calls along the network’s links. Once informed, nodes assist the originator by forwarding the message to their neighbors. Determining the broadcast time for a node in an arbitrary network is NP-complete. While polynomial-time algorithms exist for specific network topologies, the problem remains open for many others. In this paper, we focus on addressing the broadcasting problem in network topologies represented by specialized clique-based structures. Specifically, we investigate the windmill graph Wdk,l, which consists of k cliques of size l connected to a universal node, and extend our study to the star of cliques, a generalization of the windmill graph with cliques of arbitrary sizes. Our primary objective is to propose an efficient algorithm for determining the broadcast time of any node in an arbitrary star of cliques and to rigorously prove its optimality. Additionally, we broaden the scope by examining the broadcasting problem in path-connected cliques, a topology featuring k cliques of varying sizes sequentially connected along a path. For this structure, we develop a computationally efficient algorithm that leverages clique sizes and adjacency to optimize broadcast strategies, with broader implications for understanding communication in block graphs. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
►▼ Show Figures

Figure 1

26 pages, 1131 KiB  
Article
Perfect Roman Domination: Aspects of Enumeration and Parameterization
by Kevin Mann and Henning Fernau
Algorithms 2024, 17(12), 576; https://doi.org/10.3390/a17120576 - 14 Dec 2024
Viewed by 825
Abstract
Perfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions. We also consider the enumeration of minimal Perfect Roman Dominating Functions and show a tight relation to minimal Roman [...] Read more.
Perfect Roman Dominating Functions and Unique Response Roman Dominating Functions are two ways to translate perfect code into the framework of Roman Dominating Functions. We also consider the enumeration of minimal Perfect Roman Dominating Functions and show a tight relation to minimal Roman Dominating Functions. Furthermore, we consider the complexity of the underlying decision problems Perfect Roman Domination and Unique Response Roman Domination on special graph classes. For instance, split graphs are the first graph class for which Unique Response Roman Domination is polynomial-time solvable, while Perfect Roman Domination is NP-complete. Beyond this, we give polynomial-time algorithms for Perfect Roman Domination on interval graphs and for both decision problems on cobipartite graphs. However, both problems are NP-complete on chordal bipartite graphs. We show that both problems are W[1]-complete if parameterized by solution size and FPT if parameterized by the dual parameter or by clique width. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
►▼ Show Figures

Figure 1

12 pages, 535 KiB  
Article
Text Indexing for Faster Gapped Pattern Matching
by Md Helal Hossen, Daniel Gibney and Sharma V. Thankachan
Algorithms 2024, 17(12), 537; https://doi.org/10.3390/a17120537 - 23 Nov 2024
Viewed by 549
Abstract
We revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text T[1..n] to enable efficient reporting of all occ occurrences of a gapped pattern [...] Read more.
We revisit the following version of the Gapped String Indexing problem, where the goal is to preprocess a text T[1..n] to enable efficient reporting of all occ occurrences of a gapped pattern P=P1[α..β]P2 in T. An occurrence of P in T is defined as a pair (i,j) where substrings T[i..i+|P1|) and T[j..j+|P2|) match P1 and P2, respectively, with a gap j−(i+|P1|) lying within the interval [α..β]. This problem has significant applications in computational biology and text mining. A hardness result on this problem suggests that any index with polylogarithmic query time must occupy near quadratic space. In a recent study [STACS 2024], Bille et al. presented a sub-quadratic space index using space O˜(n2−δ/3), where 0≤δ≤1 is a parameter fixed at the time of index construction. Its query time is O˜(|P1|+|P2|+nδ·(1+occ)), which is sub-linear per occurrence when δ<1. We show how to achieve a gap-sensitive query time of O˜(|P1|+|P2|+nδ·(1+occ1−δ)+∑g∈[α..β]occg·gδ) using the same space, where occg denotes the number of occurrences with gap g. This is faster when there are many occurrences with small gaps. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
►▼ Show Figures

Figure 1

11 pages, 250 KiB  
Article
Hardness and Approximability of Dimension Reduction on the Probability Simplex
by Roberto Bruno
Algorithms 2024, 17(7), 296; https://doi.org/10.3390/a17070296 - 6 Jul 2024
Viewed by 1796
Abstract
Dimension reduction is a technique used to transform data from a high-dimensional space into a lower-dimensional space, aiming to retain as much of the original information as possible. This approach is crucial in many disciplines like engineering, biology, astronomy, and economics. In this [...] Read more.
Dimension reduction is a technique used to transform data from a high-dimensional space into a lower-dimensional space, aiming to retain as much of the original information as possible. This approach is crucial in many disciplines like engineering, biology, astronomy, and economics. In this paper, we consider the following dimensionality reduction instance: Given an n-dimensional probability distribution p and an integer m<n, we aim to find the m-dimensional probability distribution q that is the closest to p, using the Kullback–Leibler divergence as the measure of closeness. We prove that the problem is strongly NP-hard, and we present an approximation algorithm for it. Full article
(This article belongs to the Special Issue Selected Algorithmic Papers from IWOCA 2024)
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-5
Back to TopTop