Jörg-Rüdiger Sack
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jörg-Rüdiger Sack has a total of 127 co-authors. Here are the top co-authors by number of shared publications:
Anil Maheshwari
Carleton University
17 shared publicationsDoron Nussbaum
Carleton University, Ottawa
10 shared publicationsFrank Dehne
Carleton University, Ottawa - Canada
7 shared publications- Anil Maheshwari
School of Computer Science, Carleton University, Ottawa, Canada
6 shared publications - Doron Nussbaum
Carleton University
6 shared publications Hamid Zarrabi-Zadeh
Department of Computer Engineering, Sharif University of Technology, Tehran, Iran
5 shared publications
Latest Publications
- Open Access
Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
In 2021, Gupta and Suzumura proposed a novel algorithm for enumerating all bounded-length simple cycles in directed graphs. In this work, we present concrete examples demonstrating that the proposed algorithm fails to enumerate certain valid cycles. Via these examples, we perform a detailed analysis pinpointing the specific points at which the proofs exhibit logical gaps. Furthermore, we propose a corrected formulation that resolves these issues while preserving the desirable property that the algorithm's computational complexity remains $O((c + 1) \cdot k \cdot (n + e))$ where $c$ is the number of simple cycles of a specified maximum length $k$, and $n$ and $e$ the number of graph nodes and edges respectively.Open AccessFinding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
In 2021, Gupta and Suzumura proposed a novel algorithm for enumerating all bounded-length simple cycles in directed graphs. In this work, we present concrete examples demonstrating that the proposed algorithm fails to enumerate certain valid cycles. Via these examples, we perform a detailed analysis pinpointing the specific points at which the proofs exhibit logical gaps. Furthermore, we propose a corrected formulation that resolves these issues while preserving the desirable property that the algorithm's computational complexity remains $O((c + 1) \cdot k \cdot (n + e))$ where $c$ is the number of simple cycles of a specified maximum length $k$, and $n$ and $e$ the number of graph nodes and edges respectively. - Open Access
Predicting the Citation Count and CiteScore of Journals One Year in Advance
Prediction of the future performance of academic journals is a task that can benefit a variety of stakeholders including editorial staff, publishers, indexing services, researchers, university administrators and granting agencies. Using historical data on journal performance, this can be framed as a machine learning regression problem. In this work, we study two such regression tasks: 1) prediction of the number of citations a journal will receive during the next calendar year, and 2) prediction of the Elsevier CiteScore a journal will be assigned for the next calendar year. To address these tasks, we first create a dataset of historical bibliometric data for journals indexed in Scopus. We propose the use of neural network models trained on our dataset to predict the future performance of journals. To this end, we perform feature selection and model configuration for a Multi-Layer Perceptron and a Long Short-Term Memory. Through experimental comparisons to heuristic prediction baselines and classical machine learning models, we demonstrate superior performance in our proposed models for the prediction of future citation and CiteScore values.
Open AccessPredicting the Citation Count and CiteScore of Journals One Year in Advance
Prediction of the future performance of academic journals is a task that can benefit a variety of stakeholders including editorial staff, publishers, indexing services, researchers, university administrators and granting agencies. Using historical data on journal performance, this can be framed as a machine learning regression problem. In this work, we study two such regression tasks: 1) prediction of the number of citations a journal will receive during the next calendar year, and 2) prediction of the Elsevier CiteScore a journal will be assigned for the next calendar year. To address these tasks, we first create a dataset of historical bibliometric data for journals indexed in Scopus. We propose the use of neural network models trained on our dataset to predict the future performance of journals. To this end, we perform feature selection and model configuration for a Multi-Layer Perceptron and a Long Short-Term Memory. Through experimental comparisons to heuristic prediction baselines and classical machine learning models, we demonstrate superior performance in our proposed models for the prediction of future citation and CiteScore values.
- 1 October 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 319, 296-309
A new model and algorithms in firefighting theory
- 1 October 2022
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 319, 296-309
A new model and algorithms in firefighting theory
- 10 May 2022
- Published by Elsevier in Computational Geometry
- Vol. 107
CGTA Awards
- 31 March 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (2) , 369-388
Differential Privacy via a Truncated and Normalized Laplace Mechanism
- 31 March 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (2) , 369-388
Differential Privacy via a Truncated and Normalized Laplace Mechanism
- 12 March 2021
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 14 (3) , 1705-1733
Obfuscation of images via differential privacy: From facial images to general images
- 12 March 2021
- Published by Springer Nature in Peer-to-Peer Networking and Applications
- Vol. 14 (3) , 1705-1733
Obfuscation of images via differential privacy: From facial images to general images
- 3 February 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (3) , 775
Special Issue on Algorithms and Data Structures (WADS 2019)
- 3 February 2021
- Published by Springer Nature in Algorithmica
- Vol. 83 (3) , 775
Special Issue on Algorithms and Data Structures (WADS 2019)
- 31 January 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 51 (8) , 6104-6123
A novel similarity measure for spatial entity resolution based on data granularity model: Managing inconsistencies in place descriptions
- 31 January 2021
- Published by Springer Nature in Applied Intelligence
- Vol. 51 (8) , 6104-6123
A novel similarity measure for spatial entity resolution based on data granularity model: Managing inconsistencies in place descriptions
- 3 December 2020
- Published by Springer Nature
- p. 235-246
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures- 3 December 2020
- Published by Springer Nature
- p. 235-246
An $\varOmega (n^3)$ Lower Bound on the Number of Cell Crossings for Weighted Shortest Paths in 3-Dimensional Polyhedral Structures- 1 December 2020
- Published by Elsevier in Computational Geometry
- Vol. 91
Preface