Research/art/teacher profile of a person
Name and surname:
doc. RNDr. Dana Pardubská, CSc.
Document type:
Research/art/teacher profile of a person
The name of the university:
Comenius University Bratislava
The seat of the university:
Šafárikovo námestie 6, 818 06 Bratislava

I. - Basic information

I.1 - Surname
Pardubská
I.2 - Name
Dana
I.4 - Year of birth
1961
I.5 - Name of the workplace
Faculty of Mathematics, Physics, and Informatics of the Comenius University in Bratislava
I.6 - Address of the workplace
FMFI UK, Mlynská dolina, 84248 Bratislava
I.7 - Position
Associate professor
I.8 - E-mail address
pardubska@dcs.fmph.uniba.sk
I.9 - Hyperlink to the entry of a person in the Register of university staff
https://www.portalvs.sk/regzam/detail/4683
I.10 - Name of the study field in which a person works at the university
Computer Science
I.11 - ORCID iD
0000-0001-9383-8117

II. - Higher education and further qualification growth

II.1 - First degree of higher education
II.2 - Second degree of higher education
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
1985
II.c - Study field and programme
Theoretical Cybernetics and Mathematical Informatics
II.3 - Third degree of higher education
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
1995
II.c - Study field and programme
Mathematical Informatics and Theoretical Cybernetics
II.4 - Associate professor
II.a - Name of the university or institution
Comenius University in Bratislava
II.b - Year
2008
II.c - Study field and programme
Computer Science
II.5 - Professor
II.6 - Doctor of Science (DrSc.)

III. - Current and previous employment

III.a - Occupation-position III.b - Institution III.c - Duration
teaching assistant Comenius University in Bratislava 1985-2008
associate professor Comenius University in Bratislava 2008-

IV. - Development of pedagogical, professional, language, digital and other skills

V. - Overview of activities within the teaching career at the university

V.1 - Overview of the profile courses taught in the current academic year according to study programmes
V.1.a - Name of the profile course V.1.b - Study programme V.1.c - Degree V.1.d - Field of study
Computational Complexity and Computability Computer Science I. Computer Science
BSc Seminar (1) Computer Science I. Computer Science
BSc Seminar (2) Computer Science I. Computer Science
Computability Theory Computer Science II. Computer Science
Randomized Algorithms Computer Science II. Computer Science
Algorithms and Data Structures Computational Graphics and Geometry II. Mathematics
Computational Complexity Computational Graphics and Geometry II. Mathematics
V.2 - Overview of the responsibility for the delivery, development and quality assurance of the study programme or its part at the university in the current academic year
V.2.a - Name of the study programme V.2.b - Degree V.2.c - Field of study
Computer Science I. Computer Science
V.3 - Overview of the responsibility for the development and quality of the field of habilitation procedure and inaugural procedure in the current academic year
V.4 - Overview of supervised final theses
V.4.1 - Number of currently supervised theses
V.4.a - Bachelor's (first degree)
1
V.4.b - Diploma (second degree)
0
V.4.c - Dissertation (third degree)
0
V.4.2 - Number of defended theses
V.4.a - Bachelor's (first degree)
4
V.4.b - Diploma (second degree)
14
V.4.c - Dissertation (third degree)
1
V.5 - Overview of other courses taught in the current academic year according to study programmes
V.5.a - Name of the course V.5.b - Study programme V.5.c - Degree V.5.d - Field of study
Kolmogorov Complexity Computer Science II. Computer Science

VI. - Overview of the research/artistic/other outputs

VI.1 - Overview of the research/artistic/other outputs and the corresponding citations
VI.1.1 - Number of the research/artistic/other outputs
VI.1.a - Overall
64
VI.1.b - Over the last six years
13
VI.1.2 - Number of the research/artistic/other outputs registered in the Web of Science or Scopus databases
VI.1.a - Overall
42
VI.1.b - Over the last six years
12
VI.1.3 - Number of citations corresponding to the research/artistic/other outputs
VI.1.a - Overall
191
VI.1.b - Over the last six years
54
VI.1.4 - Number of citations registered in the Web of Science or Scopus databases
VI.1.a - Overall
158
VI.1.b - Over the last six years
51
VI.1.5 - Number of invited lectures at the international, national level
VI.1.a - Overall
0
VI.1.b - Over the last six years
0
VI.2 - The most significant research/artistic/other outputs
1

Dobrev, S., Královič, R., Pardubská, D.:  

Measuring the problem-relevant information in input RAIRO - Theoretical Informatics and Applications, 43 (3), pp. 585-613 (2009)

https://www.scopus.com/inward/record.uri?eid=2-s2.0-67650494675&doi=10.1051%2fita%2f2009012&partnerID=40&md5=1c615d3db16c557b6c064b93735a318c DOI: 10.1051/ita/2009012

2

Viliam Geffert, Dana Pardubská:

Unary Coded NP-Complete Languages in Aspace(log log n). Int. J. Found. Comput. Sci. 24(7): 1167- (2013)

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84897595846&doi=10.1142%2fS0129054113400376&partnerID=40&md5=750e66d05d414c3099f99354763f32f1

DOI: 10.1142/S0129054113400376

3

Ďuriš, P., Královič, R., Pardubská, D.: Tight hierarchy of data-independent multi-head automata. (2020) Journal of Computer and System Sciences, 114, pp. 126-136.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087405144&doi=10.1016%2fj.jcss.2020.06.005&partnerID=40&md5=4bef676b68a4ed751f2677e7a28edad1

DOI: 10.1016/j.jcss.2020.06.005

4

Jirí Wiedermann, Dana Pardubská:

Wireless Mobile Computing and its Links to Descriptive Complexity. Int. J. Found. Comput. Sci. 19(4): 887-913 (2008) 

https://www.scopus.com/inward/record.uri?eid=2-s2.0-49449094641&partnerID=40&md5=3476e65f1234919123d7e7d75bf2d00d

5

Parallel communicating grammar systems with regular control and skeleton preserving FRR automata

(2011) Theoretical Computer Science, 412 (4-5), pp. 458-477.  

https://www.scopus.com/inward/record.uri?eid=2-s2.0-78650827830&doi=10.1016%2fj.tcs.2010.10.017&partnerID=40&md5=0f18c6a2c9cae1fdf8282a965693f308 DOI: 10.1016/j.tcs.2010.10.017

VI.3 - The most significant research/artistic/other outputs over the last six years
1

Pavol Duris, Rastislav Královic, Richard Královic, Dana Pardubská, Martin Pasen, Peter Rossmanith:

Randomization in non-uniform finite automata(2020) Leibniz International Proceedings in Informatics, LIPIcs, 170, art. no. MFCS-2020-30.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090509523&doi=10.4230%2fLIPIcs.MFCS.2020.30&partnerID=40&md5=138de3f3c3333106290e7bef3950b160

DOI: 10.4230/LIPIcs.MFCS.2020.30

2

Ďuriš, P., Královič, R., Pardubská, D.: Tight hierarchy of data-independent multi-head automata. (2020) Journal of Computer and System Sciences, 114, pp. 126-136.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85087405144&doi=10.1016%2fj.jcss.2020.06.005&partnerID=40&md5=4bef676b68a4ed751f2677e7a28edad1

DOI: 10.1016/j.jcss.2020.06.005

3

Stefan Dobrev, Rastislav Královic, Dana Pardubská: 

Improved Lower Bounds for Shoreline Search. SIROCCO 2020: 80-90

 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089409530&doi=10.1007%2f978-3-030-54921-3_5&partnerID=40&md5=1946a8359ca711fd675eb03376e2bef7

DOI: 10.1007/978-3-030-54921-3_5



4

Stefan Dobrev, Rastislav Královic, Dana Pardubská:

Exploration of Time-Varying Connected Graphs with Silent Agents. SIROCCO 2020: 146-162 

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85089439428&doi=10.1007%2f978-3-030-54921-3_9&partnerID=40&md5=aa388d0c8eea337aaf6fb9f4c37fb92f 

DOI: 10.1007/978-3-030-54921-3_9

5

Brona Brejová, Askar Gafurov, Dana Pardubská, Michal Sabo, Tomás Vinar: Isometric gene tree reconciliation revisited. Algorithms Mol. Biol. 12(1): 17:1-17:16 (2017) https://www.scopus.com/inward/record.uri?eid=2-s2.0-85020660962&doi=10.1186%2fs13015-017-0108-x&partnerID=40&md5=41ae3647bcc10a8a17b237a49cc100e7

DOI: 10.1186/s13015-017-0108-x

VI.4 - The most significant citations corresponding to the research/artistic/other outputs
1

2017 Boyar, J. - Favrholdt, L. M. - Kudahl, C. - Larsen, K. S. - Mikkelsen, J. W.: Online algorithms with advice: A survey. In: ACM Computing Surveys, Vol. 50, No. 2, 2017, Art. No. 19 - SCI ;

(2017) ACM Computing Surveys, 50 (2), art. no. 19, .

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85017460258&doi=10.1145%2f3056461&partnerID=40&md5=9f96ef016640c43abd3874e10f65b31b

DOI: 10.1145/3056461


Cited: Dobrev, S., Královič, R., Pardubská, D.: Measuring the problem-relevant information in input RAIRO - Theoretical Informatics and Applications, 43 (3), pp. 585-613 (2009)

2

Georgiou, K. - Leizerovich, S. - Lucier, J. - Kundu, S.: Evacuating from ?p Unit Disks in the Wireless Model: (Extended Abstract). In: 17th International Symposium on Algorithms and Experiments for Wireless Sensor Networks,ALGOSENSORS 2021 : Lecture Notes in Computer Science, Vol. 12961.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85118156545&doi=10.1007%2f978-3-030-89240-1_6&partnerID=40&md5=c2a9fa8c72acbc632d4e17bcd26d74a6


Cited: Stefan Dobrev, Rastislav Královic, Dana Pardubská: Improved Lower Bounds for Shoreline Search. SIROCCO 2020: 80-90

3

Boyar, J. - Kamali, S. - Larsen, K. - López-Ortiz, A.: Online bin packing with advice. In: Algorithmica, Vol. 74, No. 1, 2016, s. 507-527

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84953346863&doi=10.1007%2fs00453-014-9955-8&partnerID=40&md5=4ed1408409b83d59a1e95a5425effa27


Cited: Dobrev, S., Královič, R., Pardubská, D.: Measuring the problem-relevant information in input RAIRO - Theoretical Informatics and Applications, 43 (3), pp. 585-613 (2009)

4

Rodriguez-Tello, E., Romero-Monsivais, H., Ramirez-Torres, G., Lardeux, F.:

Tabu search for the cyclic bandwidth problem

(2015) Computers and Operations Research, 57, pp. 17-32.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-84919775222&doi=10.1016%2fj.cor.2014.11.013&partnerID=40&md5=d7a78624dfedf9979907f856f6f1a6ac


Cited: Dobrev, S., Královič, R., Pardubská, D., Török, Ľ., Vrťo, I.: Antibandwidth and cyclic antibandwidth of Hamming graphs. EuroComb 2009 : European Conference on Combinatorics, Graph Theory and Applications. 5th, Bordeaux, 7.-11.9.2009

5

Chen, L.-H., Hung, L.-J., Lotze, H., Rossmanith, P. Online Node- and Edge-Deletion Problems with Advice (2021) Algorithmica, 83 (9), pp. 2719-2753.

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85111970685&doi=10.1007%2fs00453-021-00840-9&partnerID=40&md5=e9db86e59433da3031d015ae53b4e2ea DOI: 10.1007/s00453-021-00840-9


Cited: Dobrev, S., Královič, R., Pardubská, D.: Measuring the problem-relevant information in input RAIRO - Theoretical Informatics and Applications, 43 (3), pp. 585-613 (2009)

VI.5 - Participation in conducting (leading) the most important research projects or art projects over the last six years
1

VEGA 1/0601/20 Models and algorithms for computing with incomplete information. (team member)

2

VEGA 1/0463/20: Alternative Representations of Big Genomic Data (team member)

3

VEGA 2/0165/16 Computation with incomplete information - algorithms, models, networks. (team member)

4

VEGA 1/0684/16: Algorithms for heterogeneous next generation sequencing data (team member)

VII. - Overview of organizational experience related to higher education and research/artistic/other activities

VII.a - Activity, position VII.b - Name of the institution, board VII.c - Duration
vice dean for pregradual study FMFI UK 2008-2016
member of the Scientific Board FMFI UK 2011-2019
member of Academic Senat FMFI UK / UK 2019-2023/2019-(2027)
PC memeber DCFS, MFCS, SOFSEM (2016,2020); (2015, 2017); (2008,2019)
Organizing Committee (co) Chair SIROCCO, MFCS, SOFSEM 2004, 2012, 2019

VIII. - Overview of international mobilities and visits oriented on education and research/artistic/other activities in the given field of study

VIII.a - Name of the institution VIII.b - Address of the institution VIII.c - Duration (indicate the duration of stay) VIII.d - Mobility scheme, employment contract, other (describe)
University of Paderborn Paderborn, Germany 3 months 1991,1993 stay invited by prof. J. Hromkovič
University of Trier Trier, Germany 2 months 1996 stay invited by prof. Ch. Meinel
University of Ottawa Ottawa, Kanada July 2015 visit invited by S. Dobrev
IBM research Lab. Austin, Texas 2 weeks,2 months 2000, 2001 visit invited by prof. W. Hunt

IX. - Other relevant facts

IX.a - If relevant, other activities related to higher education or research/artistic/other activities are mentioned

reviews for journals (TCS, JALC) and international confences