Следене
Matúš Mihalák
Matúš Mihalák
Assistant Professor, Department of Data Science and Knowledge Engineering, Maastricht University
Потвърден имейл адрес: maastrichtuniversity.nl - Начална страница
Заглавие
Позовавания
Позовавания
Година
Network discovery and verification
Z Beerliova, E Felix, T Erlebach, A Hall, M Hoffmann, M Mihal'ak, LS Ram
IEEE Journal on selected areas in communications 24 (12), 2168-2181, 2006
2732006
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
C Ambühl, T Erlebach, M Mihalák, M Nunkesser
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
1652006
Shunting for dummies: An introductory algorithmic survey
M Gatto, J Maue, M Mihalák, P Widmayer
Robust and Online Large-Scale Optimization, 310-337, 2009
672009
Computing minimum spanning trees with uncertainty
T Erlebach, M Hoffmann, D Krizanc, M Mihal'Ák, R Raman
arXiv preprint arXiv:0802.2855, 2008
622008
A (4+ ε)-approximation for the minimum-weight dominating set problem in unit disk graphs
T Erlebach, M Mihalák
International Workshop on Approximation and Online Algorithms, 135-146, 2009
582009
An Algorithmic View on OVSF Code Assignment
T Erlebach, R Jacob, M Mihalák, M Nunkesser, G Szabó, P Widmayer
Technical Report, 2003
45*2003
An algorithmic view on OVSF code assignment
T Erlebach, R Jacob, M Mihalak, M Nunkesser, G Szabó, P Widmayer
Algorithmica 47 (3), 269-298, 2007
422007
Tree Nash equilibria in the network creation game
A Mamageishvili, M Mihalák, D Müller
Internet Mathematics 11 (4-5), 472-486, 2015
402015
On the complexity of the metric tsp under stability considerations
M Mihalák, M Schöngens, R Šrámek, P Widmayer
International Conference on Current Trends in Theory and Practice of …, 2011
402011
Network discovery and verification
Z Beerliova, F Eberhard, T Erlebach, A Hall, M Hoffmann, M Mihalák, ...
Graph-Theoretic Concepts in Computer Science, 127-138, 2005
402005
The price of anarchy in network creation games is (mostly) constant
M Mihalák, JC Schlegel
International Symposium on Algorithmic Game Theory, 276-287, 2010
392010
Rendezvous of mobile agents when tokens fail anytime
S Das, M Mihalák, R Šrámek, E Vicari, P Widmayer
International Conference On Principles Of Distributed Systems, 463-480, 2008
352008
Counting targets with mobile sensors in an unknown environment
B Gfeller, M Mihalák, S Suri, E Vicari, P Widmayer
International Symposium on Algorithms and Experiments for Sensor Systems …, 2007
342007
Data Delivery by Energy-Constrained Mobile Agents
J Chalopin, S Das, M Mihalák, P Penna, P Widmayer
34*
Optimization methods for multistage freight train formation
M Bohlin, S Gestrelius, F Dahms, M Mihalák, H Flier
Transportation science 50 (3), 823-840, 2016
332016
Track Allocation in Freight-Train Classification with Mixed Tracks
M Bohlin, H Flier, J Maue, M Mihalák
11th Workshop on Algorithmic Approaches for Transportation Modelling …, 2011
332011
Asymmetric swap-equilibrium: a unifying equilibrium concept for network creation games
M Mihalák, JC Schlegel
International Symposium on Mathematical Foundations of Computer Science, 693-704, 2012
322012
Data Delivery by Energy-Constrained Mobile Agents on a Line
J Chalopin, R Jacob, M Mihalák, P Widmayer
International Colloquium on Automata, Languages, and Programming, 423-434, 2014
312014
The price of anarchy in network creation games is (mostly) constant
M Mihalák, JC Schlegel
Theory of Computing Systems 53 (1), 53-72, 2013
302013
Simple robots in polygonal environments: A hierarchy
J Brunner, M Mihalák, S Suri, E Vicari, P Widmayer
International Symposium on Algorithms and Experiments for Sensor Systems …, 2008
302008
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20