Articles with public access mandates - Juraj HromkovicLearn more
Not available anywhere: 4
Online graph coloring with advice and randomized adversary
E Burjons, J Hromkovič, X Munoz, W Unger
International Conference on Current Trends in Theory and Practice of …, 2016
Mandates: Swiss National Science Foundation, Government of Spain
On the hardness of determining small NFA’s and of proving lower bounds on their sizes
J Hromkovič, G Schnitger
International Conference on Developments in Language Theory, 34-55, 2008
Mandates: Swiss National Science Foundation, German Research Foundation
The complexity of paging against a probabilistic adversary
S Dobrev, J Hromkovič, D Komm, R Královič, R Královič, T Mömke
International Conference on Current Trends in Theory and Practice of …, 2016
Mandates: Swiss National Science Foundation, German Research Foundation
Two-Way Non-Uniform Finite Automata
F Frei, J Hromkovič, R Královič, R Královič
International Journal of Foundations of Computer Science 34 (02n03), 145-162, 2023
Mandates: Swiss National Science Foundation
Available somewhere: 25
The string guessing problem as a method to prove lower bounds on the advice complexity
HJ Böckenhauer, J Hromkovič, D Komm, S Krug, J Smula, A Sprock
Theoretical Computer Science 554, 95-108, 2014
Mandates: Swiss National Science Foundation
Online coloring of bipartite graphs with and without advice
MP Bianchi, HJ Böckenhauer, J Hromkovič, L Keller
Algorithmica 70 (1), 92-111, 2014
Mandates: Swiss National Science Foundation
The parameterized approximability of TSP with deadlines
HJ Bockenhauer, J Hromkovic, J Kneis, J Kupke
Theory of Computing Systems 41, 431-444, 2007
Mandates: Swiss National Science Foundation
On the power of advice and randomization for the disjoint path allocation problem
K Barhum, HJ Böckenhauer, M Forišek, H Gebauer, J Hromkovič, S Krug, ...
SOFSEM 2014: Theory and Practice of Computer Science: 40th International …, 2014
Mandates: Swiss National Science Foundation
On the advice complexity of the online L (2, 1)-coloring problem on paths and cycles
MP Bianchi, HJ Böckenhauer, J Hromkovič, S Krug, B Steffen
Theoretical Computer Science 554, 22-39, 2014
Mandates: Swiss National Science Foundation
Ambiguity and communication
J Hromkovič, G Schnitger
Theory of Computing Systems 48 (3), 517-534, 2011
Mandates: Swiss National Science Foundation, German Research Foundation
On the approximability and hardness of minimum topic connected overlay and its special instances
J Hosoda, J Hromkovič, T Izumi, H Ono, M Steinová, K Wada
Theoretical Computer Science 429, 144-154, 2012
Mandates: Swiss National Science Foundation
Knowing all optimal solutions does not help for TSP reoptimization
HJ Böckenhauer, J Hromkovič, A Sprock
Computation, cooperation, and life: essays dedicated to Gheorghe Păun on the …, 2011
Mandates: Swiss National Science Foundation
On probabilistic pushdown automata
J Hromkovič, G Schnitger
Information and Computation 208 (8), 982-995, 2010
Mandates: Swiss National Science Foundation, German Research Foundation
Steiner tree reoptimization in graphs with sharpened triangle inequality
HJ Böckenhauer, K Freiermuth, J Hromkovič, T Mömke, A Sprock, ...
Journal of Discrete Algorithms 11, 73-86, 2012
Mandates: Swiss National Science Foundation
Comparing the size of NFAs with and without ε-transitions
J Hromkovič, G Schnitger
Theoretical Computer Science 380 (1-2), 100-114, 2007
Mandates: German Research Foundation
On the hardness of reoptimization with multiple given solutions
HJ Böckenhauer, J Hromkovič, A Sprock
Fundamenta Informaticae 110 (1-4), 59-76, 2011
Mandates: Swiss National Science Foundation
On k-connectivity problems with sharpened triangle inequality
HJ Böckenhauer, D Bongartz, J Hromkovič, R Klasing, G Proietti, ...
Journal of Discrete Algorithms 6 (4), 605-617, 2008
Mandates: Swiss National Science Foundation
Advice complexity of the online search problem
J Clemente, J Hromkovič, D Komm, C Kudahl
International Workshop on Combinatorial Algorithms, 203-212, 2016
Mandates: Swiss National Science Foundation, Villum Foundation
The steiner tree reoptimization problem with sharpened triangle inequality
HJ Böckenhauer, K Freiermuth, J Hromkovič, T Mömke, A Sprock, ...
International Conference on Algorithms and Complexity, 180-191, 2010
Mandates: Swiss National Science Foundation
On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA’s
J Hromkovič, H Petersen, G Schnitger
Theoretical Computer Science 410 (30-32), 2972-2981, 2009
Mandates: Swiss National Science Foundation, German Research Foundation
Publication and funding information is determined automatically by a computer program