Tibor Szkaliczki

Dr. Tibor Szkaliczki

orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 August 2014 in Multimedia Tools and Applications
Verified
Journal Article
Closed access
PDF file
KSKlaus Schoeffmann
Klaus Schoeffmann
MFManfred Del Fabro
Manfred Del Fabro
TSTibor Szkaliczki
Tibor Szkaliczki
LBLaszlo Böszörmenyi
Laszlo Böszörmenyi
JKJörg Keckstein
Jörg Keckstein

4 June 2007 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
MPMartin Prangl
Martin Prangl
TSTibor Szkaliczki
Tibor Szkaliczki
HHHermann Hellwagner
Hermann Hellwagner
Content adaptation is an important issue of multimedia frameworks in order to achieve universal multimedia access (UMA), i.e., to enable consumption of multimedia content independently of the given resource limitations, terminal capabilities, and user preferences. The digital item adaptation (DIA) standard, one of the core specifications of the MPEG-21 framework, supports content adaptation considering a wide range of networks, devices, and user preferences. Most adaptive multimedia frameworks targeting the UMA vision do not consider utility aspects in their adaptation decisions. This paper focuses on a generic semantic-based audio-visual utility model for DIA that aims to enhance the multimedia experience for the user. Our proposed model is able to take the semantics and the perceptual features of the content as well as the users' specific utility aspects into account. Based on a detailed analysis of these constraints, we will show how the model reacts on individual input data. For choosing the best adaptation decision considering resource limitations on client and server sides as well as network characteristics, we evaluate four algorithms for performing this adaptation decision taking task. We will discuss results according to some use case scenarios

1 January 1999 in SIAM Journal on Computing
Verified
Journal Article
Closed access
TSTibor Szkaliczki
Tibor Szkaliczki
The present article concentrates on the dogleg-free Manhattan model where horizontal and vertical wire segments are positioned on different sides of the board and each net (wire) has at most one horizontal segment. While the minimum width can be found in linear time in the single row routing, apparently there was no efficient algorithm to find the minimum wire length. We show that there is no hope to find such an algorithm because this problem is ${\cal NP}$-complete even if each net has only two terminals. The results on dogleg-free Manhattan routing can be connected with other application areas related to interval graphs. In this paper we define the minimum value interval placement problem. There is given a set of weighted intervals and w rows and the intervals have to be placed without overlapping into rows so that the sum of the interval values, which is the value of a function of the weight and the row number assigned to the interval, is minimum. We show that this problem is ${\cal NP}$-complete. This implies the ${\cal NP}$-completeness of other problems including the minimum wire length routing and the sum coloring on interval graphs.

27 March 2025 in Mathematics
Verified
Journal Article
Open access
PDF file
TSTibor Szkaliczki
Tibor Szkaliczki
The Knapsack Problem belongs to the best-studied classical problems in combinatorial optimization. The Multiple-choice Knapsack Problem (MCKP) represents a generalization of the problem, with various application fields such as industry, transportation, telecommunication, national defense, bioinformatics, finance, and life. We found a lack of survey papers on MCKP. This paper overviews MCKP and presents its variants, solution methods, and applications. Traditional operational research methods solving the knapsack problem, such as dynamic programming, greedy heuristics, and branch-and-bound algorithms, can be adapted to MCKP. Only a few algorithms appear to have solved the problem in recent years. We found various related problems during the literature study and explored the broad spectrum of application areas. We intend to inspire research into MCKP algorithms and motivate experts from different domains to apply MCKP.

1 April 2014 in Discrete Applied Mathematics
Verified
Journal Article
Closed access
TSTibor Szkaliczki
Tibor Szkaliczki
MEMichael Eberhard
Michael Eberhard
HHHermann Hellwagner
Hermann Hellwagner
LSLászló Szobonya
László Szobonya

3 September 2018 in Digital Presentation and Preservation of Cultural and Scientific Heritage
Verified
Journal Article
Closed access
PDF file
ZMZsolt László Márkus
Zsolt László Márkus
MGMaxim Goynov
Maxim Goynov
DLDetelin Luchev
Detelin Luchev
RPRadoslav Pavlov
Radoslav Pavlov
DPDesislava Paneva-Marinova
Desislava Paneva-Marinova
LPLilia Pavlova
Lilia Pavlova
Serious educational games provide a novel way to transfer knowledge on cultural heritage, which can especially attract young people by using interactive multimedia technology. The paper presents a new flexible tool for developing, managing and presenting games. This server-based solution can facilitate the game development by applying game templates, layout styles and question pools. It also supports the development of game packages for multiple languages and multiple platforms (Web and mobile). The games can easily be customised for various learning domains. Complex games can be composed from several socalled minigames (e.g. puzzle, multiple choice, memory game, crossword etc.) and the tool also supports the evaluation of the user answers and organising competitions. The games were applied to deepen knowledge on various topics related to our cultural heritage. The latest game development is represented by the serious educational game “The Thracians” running in a virtual 360º panorama environment, which presents the life, beliefs and traditions of the ancient tribes.